Sample records for updating recursive xml

  1. Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation

    Microsoft Academic Search

    Rajasekar Krishnamurthy; Venkatesan T. Chakaravarthy; Raghav Kaushik; Jeffrey F. Naughton

    2004-01-01

    We consider the problem of translating XML queries into SQL when XML documents have been stored in an RDBMS using a schema-based relational decomposition. Surpris- ingly, there is no published XML-to-SQL query transla- tion algorithm for this scenario that handles recursive XML schemas. We present a generic algorithm to translate path expression queries into SQL in the presence of recursion

  2. HUX: Handling Updates in XML

    Microsoft Academic Search

    Ling Wang; Elke A. Rundensteiner; Murali Mani; Ming Jiang

    2006-01-01

    We demonstrate HUX (Handling Updates in XML) which provides a reliable and efficient solution for the XML view update prob- lem. Given an update over an XML view, our U-Filter subsytem first determines whether the update is translatable or not by exam- ining potential conflicts in both schema and data. If an update is determined to be translatable, our U-Translator

  3. View update translation for XML Iovka Boneva

    E-print Network

    View update translation for XML Iovka Boneva University Lille 1 Benoît Groz University Lille 1 Sophie Tison University Lille 1 Anne-Cécile Caron University Lille 1 Yves Roos University Lille 1 Slawek Staworko University Lille 3 ABSTRACT We study the problem of update translation for views on XML documents

  4. xmile: an XML based Approach for Incremental Code Mobility and Update

    E-print Network

    Mascolo, Cecilia

    xmile: an XML based Approach for Incremental Code Mobility and Update Cecilia Mascolo, Luca Zanolin.mascolo | l.zanolin | w.emmerich}@cs.ucl.ac.uk Abstract The eXtensible Markup Language (XML) was originally

  5. XMILE: An XML Based Approach for Incremental Code Mobility and Update

    Microsoft Academic Search

    Cecilia Mascolo; Luca Zanolin; Wolfgang Emmerich

    2002-01-01

    The eXtensible Markup Language (XML) was originally defined to represent Web con- tent, but it is increasingly used to define languages, such as XPL, that are used for coding executable algorithms, policies or scripts. XML-related standards, such as XPath and the Document Object Model, permit the flexible manipulation of fragments of XML code, which enables novel code migration and update

  6. Copyright IBM Corporation 2010 Trademarks Use CSV and XML import methods to populate, update, and

    E-print Network

    Copyright IBM Corporation 2010 Trademarks Use CSV and XML import methods to populate, update, and enhance your InfoSphere Business Glossary content Page 1 of 27 Use CSV and XML import methods to populate CSV and XML import and export methods to populate a business glossary with data. This tutorial

  7. Direct data-driven recursive controller unfalsification with analytic update

    Microsoft Academic Search

    Jeroen Van Helvoort; Bram De Jager; Maarten Steinbuch

    2007-01-01

    Unfalsified Control is a data-driven, plant-model-free controller design method, which recursively falsifies controllers that fail to meet the specified performance requirement. In Ellipsoidal Unfalsified Control, the region of controllers that are unfalsified, the Unfalsified set, is described by an ellipsoid. Due to the combination of the performance requirement and controller structure, the update of the Unfalsified set can be computed

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

  9. Bayesian reasoning approach based recursive algorithm for online updating belief rule based expert system of pipeline leak detection

    Microsoft Academic Search

    Zhi-Jie Zhou; Chang-Hua Hu; Dong-Ling Xu; Jian-Bo Yang; Dong-Hua Zhou

    2011-01-01

    In this paper a recursive algorithm based on the Bayesian reasoning approach is proposed to update a belief rule based (BRB) expert system for pipeline leak detection and leak size estimation. In addition to using available real time data, expert knowledge on the relationships of the parameters among different rules is incorporated into the updating process so that the performance

  10. 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 July 21, 2015 MedlinePlus Health Topic ...

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

    SciTech Connect

    Yan, Y; Mao, W; Jiang, S [UT Southwestern Medical Center, Dallas, TX (United States)

    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.

  12. An extended cooperative transaction model for xml

    Microsoft Academic Search

    Francis Gropengieer; Kai-uwe Sattler

    2008-01-01

    In many application areas, for example in design or media production processes, several authors have to work coopera- tively on the same project. Thereby, a frequently used data format is XML. In this paper, we address the special require- ments of cooperative working on shared XML graph struc- tures, such as early visibility of updates, multi-directional information ow, and parallel

  13. Probing recursion.

    PubMed

    Lobina, David J

    2014-11-01

    The experimental probing of recursion in human performance is faced with non-trivial problems. Here, I analyse three case studies from the literature and argue that they tell us little about the underlying mental processes at play within each of these domains: (a) the question of whether experimental participants employ recursive rules in parsing artificial strings of nonsense syllables; (b) the role of self-embedded structures in reasoning and general cognition; and (c) the reputed connection between structural features of a given object and the corresponding, recursive rules needed to represent/generate it. I then outline what a recursive process would actually look like and how one could go about probing its presence in human behaviour, concluding, however, that recursive processes in performance are very unlikely, at least as far as fast, mandatory, and automatic modular processes are concerned. PMID:24817314

  14. Semantically Interoperable XML Data.

    PubMed

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

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

  16. Query Rewrite for XML in Oracle XML DB

    Microsoft Academic Search

    Muralidhar Krishnaprasad; Zhen Hua Liu; Anand Manikutty; James W. Warner; Vikas Arora; Susan Kotsovolos

    2004-01-01

    Oracle XML DB integrates XML storage and querying using the Oracle relational and object relational framework. It has the capability to physically store XML documents by shredding them as relational or object relational data, and creating logical XML documents using SQL\\/XML publishing functions. However, querying XML in a relational or object relational database poses several challenges. The biggest challenge is

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

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

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

  20. Developpement Java -XML Developpement Java -XML

    E-print Network

    Hao, Jin-Kao

    traiter · ´ecriture de fichiers XML · StAX ne sera pas trait´e dans ce document 7 / 48 #12;D complet du document XML · r´eserv´e `a de petits fichiers et lecture lin´eaire 9 / 48 #12;D.getDocumentElement().normalize(); 12/ 48 #12;D´eveloppement Java - XML DOM DOM lecture value lecture value 1 Node

  1. On recursion

    PubMed Central

    Watumull, Jeffrey; Hauser, Marc D.; Roberts, Ian G.; Hornstein, Norbert

    2014-01-01

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

  2. The XML Benchmark Project

    Microsoft Academic Search

    A. R. Schmidt; F. Waas; M. L. Kersten; D. Florescu; I. Manolescu; M. J. Carey; R. Busse

    2001-01-01

    With standardization efforts of a query language for XML documents drawing to a close, researchers and users increasingly focus their attention on the database technology that has to deliver on the new challenges that the sheer amount of XML documents produced by applications pose to data management: validation, performance evaluation and optimization of XML query processors are the upcoming issues.

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

  4. Plug-and-Play XML

    PubMed Central

    Schweiger, Ralf; Hoelzer, Simon; Altmann, Udo; Rieger, Joerg; Dudeck, Joachim

    2002-01-01

    The application of XML (Extensible Markup Language) is still costly. The authors present an approach to ease the development of XML applications. They have developed a Web-based framework that combines existing XML resources into a comprehensive XML application. The XML framework is model-driven, i.e., the authors primarily design XML document models (XML schema, document type definition), and users can enter, search, and view related XML documents using a Web browser. The XML model itself is flexible and might be composed of existing model standards. The second part of the paper relates the approach of the authors to some problems frequently encountered in the clinical documentation process. PMID:11751802

  5. RECURSIVE TREES Michael Drmota

    E-print Network

    Drmota, Michael

    copies of ancient texts · convex hull algorithms · ... #12;Enumeration of Recursive Trees All recursive Combinatorial Description · labelled rooted tree · labels are strictly increasing · no left-to-right order (non-planar

  6. Mixed Mode XML Query Processing

    Microsoft Academic Search

    Alan Halverson; Josef Burger; Leonidas Galanis; Ameet Kini; Rajasekar Krishnamurthy; Ajith Nagaraja Rao; Feng Tian; Stratis Viglas; Yuan Wang; Jeffrey F. Naughton; David J. Dewitt

    2003-01-01

    Querying XML documents typically involves both tree-based navigation and pattern matching similar to that used in structured information retrieval domains. In this paper, we show that for good performance, a native XML query processing system should support query plans that mix these two processing paradigms. We describe our prototype native XML system, and report on experiments demonstrating that even for

  7. XML Conceptual Modeling Using UML

    Microsoft Academic Search

    Rainer Conrad; Dieter Scheffner; Johann Christoph Freytag

    2000-01-01

    . The eXtensible Markup Language (XML) is increasingly findingacceptance as a standard for storing and exchanging structured andsemi-structured information. With its expressive power, XML enables agreat variety of applications relying on such structures - notably productcatalogs, digital libraries, and electronic data interchange (EDI). Asthe data schema, an XML Document Type Definition (DTD) is a meansby which documents and objects can

  8. Compressing XML Documents Using Recursive Finite State Automata

    E-print Network

    Shankar, Priti

    is a lossless adaptive algorithm where the model used for compression and decompression is generated. Our compres- sion scheme is on-line, that is, it can compress the document as it is being read. We of a compression scheme is the ability to be able to query the compressed document without decompressing the whole

  9. Quantized kernel recursive least squares algorithm.

    PubMed

    Chen, Badong; Zhao, Songlin; Zhu, Pingping; Prncipe, Jos C

    2013-09-01

    In a recent paper, we developed a novel quantized kernel least mean square algorithm, in which the input space is quantized (partitioned into smaller regions) and the network size is upper bounded by the quantization codebook size (number of the regions). In this paper, we propose the quantized kernel least squares regression, and derive the optimal solution. By incorporating a simple online vector quantization method, we derive a recursive algorithm to update the solution, namely the quantized kernel recursive least squares algorithm. The good performance of the new algorithm is demonstrated by Monte Carlo simulations. PMID:24808586

  10. Classifying XML tags through \\

    Microsoft Academic Search

    Xavier Tannier; Jean-Jacques Girardot; Mihaela Mathieu

    2005-01-01

    Some tags used in XML documents create arbitrary breaks in the natural flow of the text. This may constitute an impediment to the application of some methods of document engineering. This article introduces the concept of ``reading contexts'', and gives clues to handle it theorically and in practice. This work should notably allow to recognize emphasis tags in a text,

  11. RBAC for XML Document Stores

    Microsoft Academic Search

    Michael Hitchens; Vijay Varadharajan

    2001-01-01

    Web based services and applications have increased the availability and accessibility of information. XML (eXtensible Markup\\u000a Language) has recently emerged as an important standard in the area of information representation. XML documents can represent\\u000a information at different levels of sensitivity. Access control for XML document stores must recognise the finegrained nature\\u000a of the document structure. In this paper we present

  12. Generalized XML security views

    Microsoft Academic Search

    Gabriel M. Kuper; Fabio Massacci; Nataliya Rassadko

    2009-01-01

    We investigate a generalization of the notion of XML security view introduced by Stoica and Farkas (Proceedings of the 16th\\u000a International Conference on Data and Applications Security (IFIP02). IFIP Conference Proceedings, vol. 256, pp. 133146.\\u000a Kluwer, Dordrecht, 2002) and later refined by Fan et al. (Proceedings of the ACM SIG- MOD International Conference on Management\\u000a of Data (SIGMOD04), pp. 587598.

  13. Recursive time-to-go estimation for homing guidance missiles

    Microsoft Academic Search

    Min-Jea Tahk; Chang-Kyung Ryoo; Hangju Cho

    2002-01-01

    This paper addresses the problem of computing accurate time-to-go estimates, which is an important issue in implementing various optimal guidance laws developed for missiles of time-varying velocity. A recursive time-to-go computation method which updates the time-to-go in a noniterative way is presented. The recursive method includes an error compensation feature which explicitly computes the time-to-go error produced by nonzero initial

  14. Language and Recursion

    Microsoft Academic Search

    Francis Lowenthal

    2010-01-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

  15. Recursion in phonology

    Microsoft Academic Search

    Maartje Schreuder; Dicky Gilbers; Hugo Quen

    2009-01-01

    This paper investigates phonological recursion by means of early accent placement (stress shift), which marks the initial boundary of a phonological phrase. The question is whether or not this early pitch accent placement can be applied recursively to phonological phrases that are embedded in larger phonological phrases. This was investigated in a map task experiment, with various Dutch phonological phrases

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

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

  18. Detecting Changes in XML Documents

    Microsoft Academic Search

    Gregory Cobena; Serge Abiteboul; Amlie Marian

    2002-01-01

    We present a diff algorithm for XML data. This work is motivated by the support for change control in the context of the Xyleme project that is investigating dynamic warehouses capable of storing massive volume of XML data. Because of the context, our algorithm has to be very efficient in terms of speed and memory space even at the cost

  19. A Query Language for XML

    Microsoft Academic Search

    Alin Deutsch; Mary F. Fernndez; Daniela Florescu; Alon Y. Levy; Dan Suciu

    1999-01-01

    An important application of XML is the interchange of electronic data (EDI) between multiple data sources on the Web. As XML data proliferates on the Web, applications will need to integrate and aggregate data from multiple source and clean and transform data to facilitate exchange. Data extraction, conversion, transformation, and integration are all well-understood database problems, and their solutions rely

  20. A Transducer-Based XML Query Processor

    Microsoft Academic Search

    Bertram Ludscher; Pratik Mukhopadhyay; Yannis Papakonstantinou

    2002-01-01

    The XML Stream Machine (XSM) system is a novel XQuery processing paradigm that is tuned to the efficient processing of sequentially accessed XML data (streams). The system compiles a given XQuery into an XSM, which is an XML stream transducer, i.e., an abstract device that takes as input one or more XML data streams and produces one or more output

  1. XRANK: ranked keyword search over XML documents

    Microsoft Academic Search

    Lin Guo; Feng Shao; Chavdar Botev; Jayavel Shanmugasundaram

    2003-01-01

    We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML documents, as opposed to (conceptually) flat HTML documents, introduces many new challenges. First, XML keyword search queries do not always return entire documents, but can return deeply nested XML elements that contain the desired keywords. Second,

  2. Schema Based XML Security: RBAC Approach

    Microsoft Academic Search

    Xinwen Zhang; Jaehong Park; Ravi S. Sandhu

    2003-01-01

    As a platform-independent solution, XML is going to be used in many environments such as applica- tion integration and Web Services. Security of XML instance is a basic problem, especially in enterprise with large number of users and XML objects as well as complex authorizations administration. In this paper, a role-based access control (RBAC) model based on XML Schema is

  3. Recursive and Recursively Enumerable Languages Proposition 2 If L is recursive, then it is recursively

    E-print Network

    Lyuu, Yuh-Dauh

    (x) = f(x). · We call f a recursive functiona if such an M exists. aKurt G¨odel (1931). c 2008 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 52 #12;Kurt G¨odel (1906­1978) c 2008 Prof. Yuh-Dauh Lyuu. ­ Recursive function (G¨odel), calculus (Church), formal language (Post), assembly language-like RAM

  4. Fast learning process of multi-layer neural nets using recursive least squares technique

    Microsoft Academic Search

    M. R. Azimi-Sadjadi; S. Citrin

    1989-01-01

    Summary form only given, as follows. A novel approach for a learning process of multilayer perceptron neural networks using the recursive-least-squares (RLS) technique is proposed. This method minimizes the sum of the square of the errors between the actual and the desired output values recursively. The weights in the net are updated upon the arrival of a new training sample

  5. Distinctive signatures of recursion

    PubMed Central

    Martins, Maurcio Dias

    2012-01-01

    Although recursion has been hypothesized to be a necessary capacity for the evolution of language, the multiplicity of definitions being used has undermined the broader interpretation of empirical results. I propose that only a definition focused on representational abilities allows the prediction of specific behavioural traits that enable us to distinguish recursion from non-recursive iteration and from hierarchical embedding: only subjects able to represent recursion, i.e. to represent different hierarchical dependencies (related by parenthood) with the same set of rules, are able to generalize and produce new levels of embedding beyond those specified a priori (in the algorithm or in the input). The ability to use such representations may be advantageous in several domains: action sequencing, problem-solving, spatial navigation, social navigation and for the emergence of conventionalized communication systems. The ability to represent contiguous hierarchical levels with the same rules may lead subjects to expect unknown levels and constituents to behave similarly, and this prior knowledge may bias learning positively. Finally, a new paradigm to test for recursion is presented. Preliminary results suggest that the ability to represent recursion in the spatial domain recruits both visual and verbal resources. Implications regarding language evolution are discussed. PMID:22688640

  6. Health Topic XML File Description

    MedlinePLUS

    ... nih.gov/medlineplus/xmldescription.html Health Topic XML File Description: MedlinePlus To use the sharing features on ... Tags Definitions of every possible tag in the file, with examples and their use on MedlinePlus.

  7. Recursive least-squares-based subspace tracking

    NASA Astrophysics Data System (ADS)

    Yang, Bin

    1994-10-01

    In this paper, we introduce a new interpretation of the signal subspace as the solution of an unconstrained minimization problem. We show that recursive least squares techniques can be applied to track the signal subspace recursively by making an appropriate projection approximation of the cost function. The resulting algorithms have a computational complexity of O(nr) where n is the input vector dimension and r(rupdating by Stewart, and even the exact eigenvalue decomposition.

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

  9. Recursively Imputed Survival Trees

    PubMed Central

    Zhu, Ruoqing; Kosorok, Michael R.

    2011-01-01

    We propose recursively imputed survival tree (RIST) regression for right-censored data. This new nonparametric regression procedure uses a novel recursive imputation approach combined with extremely randomized trees that allows significantly better use of censored data than previous tree based methods, yielding improved model fit and reduced prediction error. The proposed method can also be viewed as a type of Monte Carlo EM algorithm which generates extra diversity in the tree-based fitting process. Simulation studies and data analyses demonstrate the superior performance of RIST compared to previous methods. PMID:23125470

  10. Recommending XML Physical Designs for XML Databases Iman Elghandour Ashraf Aboulnaga Daniel C. Zilio Calisto Zuzarte

    E-print Network

    Aboulnaga, Ashraf

    Recommending XML Physical Designs for XML Databases Iman Elghandour Ashraf Aboulnaga Daniel C Database physical design XML database Design advisor XMLTable views XML indexes Iman Elghandour that automatically recommend various physical structures [1, 7, 34, 36]. #12;2 Iman Elghandour et al. Candidates

  11. XML-GL: A Graphical Language for Querying and Restructuring XML Documents

    Microsoft Academic Search

    Stefano Ceri; Sara Comai; Piero Fraternali; Stefano Paraboschi; Letizia Tanca; Ernesto Damiani

    1999-01-01

    The widespreading of XML as a standard for semi-structured documents on the WEB opens up challenging opportunities for WEB query languages. In this paper we introduce XML-GL, a graphical query language for XML documents. The use of a visual formalism for representing both the content of XML documents (and of their DTDs) and the syntax and semantics of queries enables

  12. XWeB: The XML Warehouse Benchmark

    NASA Astrophysics Data System (ADS)

    Mahboubi, Hadj; Darmont, Jrme

    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.

  13. An analysis of XML compression efficiency

    Microsoft Academic Search

    Christopher J. Augeri; Dursun A. Bulutoglu; Barry E. Mullins; Rusty O. Baldwin; Leemon C. Baird III

    2007-01-01

    XML simplifies data exchange among heterogeneous computers, but it is notoriously verbose and has spawned the development of many XML-specific compressors and binary formats. We present an XML test corpus and a combined efficiency metric integrating compression ratio and execution speed. We use this corpus and linear regression to assess 14 general-purpose and XML-specific compressors relative to the proposed metric.

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

  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. Recursion, Computers and Art

    ERIC Educational Resources Information Center

    Kemp, Andy

    2007-01-01

    "Geomlab" is a functional programming language used to describe pictures that are made up of tiles. The beauty of "Geomlab" is that it introduces students to recursion, a very powerful mathematical concept, through a very simple and enticing graphical environment. Alongside the software is a series of eight worksheets which lead into producing

  17. XML Support in Visual Basic 9

    Microsoft Academic Search

    Erik Meijer; Brian Beckman

    2006-01-01

    Programming against XML using the DOM API today is a bitch. The accidental complexity of working with the DOM is so high that many programmers are giv-ing up on using XML altogether, cursing the hype that XML makes dealing with data simple, which no one who has actually written DOM code could claim. The W3C DOM was not designed with

  18. DSD: A schema language for XML

    Microsoft Academic Search

    Nils Klarlund; Anders Mller; Michael I. Schwartzbach

    2000-01-01

    XML (eXtensible Markup Language) is a linear syntax for trees, which has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the application of formal methods such as specification of abstract syntax tree sets and tree transformations.A notation for defining a set of XML trees is called a schema language. Such trees correspond

  19. Teaching XML in a web development context

    Microsoft Academic Search

    James H. Paterson; Frances McCormick; Gerry Creechan

    2005-01-01

    This poster illustrates the way in which XML has been introduced in the context of a web development course. XML is an increasingly important technology with applications across a range of fields. It is therefore highly desirable that students gain meaningful exposure to this technology within the computing curriculum.The wide applicability of XML allows its concepts to be taught in

  20. XMark: A Benchmark for XML Data Management

    Microsoft Academic Search

    Albrecht Schmidt; Florian Waas; Martin L. Kersten; Michael J. Carey; Ioana Manolescu; Ralph Busse

    2002-01-01

    While standardization efforts for XML query languages have been progressing, researchers and users increasingly focus on the database technology that has to deliver on the new challenges that the abundance of XML doc- uments poses to data management: valida- tion, performance evaluation and optimiza- tion of XML query processors are the up- coming issues. Following a long tradition in database

  1. A UML profile for XML Schema

    Microsoft Academic Search

    M. Laura Caliusco; Csar Maidana; Martn Patio; M. Rosa Galli; Omar Chiotti

    XML Schema has rapidly become a standard method for exchanging business information over the Internet. Much work has been done to solve the prob lem of how to map data stored in relational and object oriented databases into XML documents. However, little work has been done in the area of manipulating cus tomized XML Schema. Moreover, there has been no

  2. Efficiently Publishing Relational Data as XML Documents

    Microsoft Academic Search

    Jayavel Shanmugasundaram; Eugene J. Shekita; Rimon Barr; Michael J. Carey; Bruce G. Lindsay; Hamid Pirahesh; Berthold Reinwald

    2000-01-01

    XML is rapidly emerging as a standard for ex- changing business data on the World Wide Web. For the fore- seeable future, however, most business data will continue to be stored in relational database systems. Consequently, if XML is to fulfill its potential, some mechanism is needed to publish re- lational data as XML documents. Towards that goal, one of

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

    ...include ``XML Schema'' in the subject line of any such email. We encourage all EQR filers to subscribe to our EQR RSS Feed to stay up-to-date on all updates. Dated: May 8, 2013. Kimberly D. Bose, Secretary. [FR Doc. 2013-11665...

  4. ADASS Web Database XML Project

    NASA Astrophysics Data System (ADS)

    Barg, M. I.; Stobie, E. B.; Ferro, A. J.; O'Neil, E. J.

    In the spring of 2000, at the request of the ADASS Program Organizing Committee (POC), we began organizing information from previous ADASS conferences in an effort to create a centralized database. The beginnings of this database originated from data (invited speakers, participants, papers, etc.) extracted from HyperText Markup Language (HTML) documents from past ADASS host sites. Unfortunately, not all HTML documents are well formed and parsing them proved to be an iterative process. It was evident at the beginning that if these Web documents were organized in a standardized way, such as XML (Extensible Markup Language), the processing of this information across the Web could be automated, more efficient, and less error prone. This paper will briefly review the many programming tools available for processing XML, including Java, Perl and Python, and will explore the mapping of relational data from our MySQL database to XML.

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

  6. XML document-grammar comparison: related problems and applications

    Microsoft Academic Search

    Joe Tekli; Richard Chbeir; Agma J. M. Traina; Caetano Traina

    2011-01-01

    XML document comparison is becoming an ever more popular research issue due to the increasingly abundant use of XML. Likewise,\\u000a a growing interest fosters the development of XML grammar matching and comparison, due to the proliferation of heterogeneous\\u000a XML data sources, particularly on the Web. Nonetheless, the process of comparing XML documents with XML grammars, i.e., XML\\u000a document and grammar

  7. Filtering XPath expressions for XML access control

    Microsoft Academic Search

    Jae-myeong Jeon; Yon Dohn Chung; Myoung-ho Kim; Yoon-joon Lee

    2004-01-01

    Abstract,XPath is a standard,for specifying parts of XML documents,and a suitable language for both query processing and access control of XML. In this paper, we use the XPath expression,for representing,user queries and,access control for XML. And we propose an access-control method for XML, where we control accesses to XML documents,by,filtering query,XPath expressions,through,access-control,XPath expressions. For filtering the access-denied parts out of

  8. Recursive Distributed Representations

    Microsoft Academic Search

    Jordan B. Pollack

    1990-01-01

    A long-standing difficulty for connectionist modeling has been how to represent variable-sized recursive data structures, such as trees and lists, in fixed-width patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations for such compositional structures, as well as efficient access- ing mechanisms for them. Patterns which stand for the internal nodes of fixed-valence trees are devised

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

  10. Distributed XML Design Serge Abiteboul

    E-print Network

    Paris-Sud XI, Universit de

    , the distribution of XML data is essential in many areas such as e-commerce (shared prod- uct catalog.4 [Distributed Systems]: Distributed databases; H.2.1 [Logical Design]: Data models; Schema and subschema General use is granted without fee provided that copies are not made or distributed for profit or commercial

  11. Xml - Rosetta Stone for Data

    Microsoft Academic Search

    John Van Den Hoven

    2000-01-01

    The continuing proliferation of different platforms in modern enterprises has created the immense challenge of managing and working with different data formats. This challenge is further magnified by the efforts required to work with different data formats between enterprises. More flexible and cost-effective data exchange alternatives than the current customized interfaces are urgently required. Increasingly, XML is viewed as a

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

  13. Temporal logic Hennessy-Milner logic Semantics of HML Recursion Semantics of Recursion Modal -Calculus

    E-print Network

    Mousavi, Mohammad

    Temporal logic Hennessy-Milner logic Semantics of HML Recursion Semantics of Recursion Modal µ;Temporal logic Hennessy-Milner logic Semantics of HML Recursion Semantics of Recursion Outline Temporal logic Hennessy-Milner logic Semantics of HML Recursion Semantics of Recursion Mousavi: Modal µ

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

  15. XML technology planning database : lessons learned

    NASA Technical Reports Server (NTRS)

    Some, Raphael R.; Neff, Jon M.

    2005-01-01

    A hierarchical Extensible Markup Language(XML) database called XCALIBR (XML Analysis LIBRary) has been developed by Millennium Program to assist in technology investment (ROI) analysis and technology Language Capability the New return on portfolio optimization. The database contains mission requirements and technology capabilities, which are related by use of an XML dictionary. The XML dictionary codifies a standardized taxonomy for space missions, systems, subsystems and technologies. In addition to being used for ROI analysis, the database is being examined for use in project planning, tracking and documentation. During the past year, the database has moved from development into alpha testing. This paper describes the lessons learned during construction and testing of the prototype database and the motivation for moving from an XML taxonomy to a standard XML-based ontology.

  16. Fxt A Transformation Language for XML Documents

    Microsoft Academic Search

    Alexandru Berlea; Helmut Seid

    2001-01-01

    As XML spreads to various application domains, transformation tasks on XML documents areaccomplished by an ever increasing number of non-programmers. In this respect, rather than providingjust a collection of basic operations via a library in a special purpose language, it is usefulto provide a more intuitive, ruled-based approach to XML transformation. The rule-based approachrequires pattern-matching for identifying parts of the

  17. The Active XML project: an overview

    Microsoft Academic Search

    Serge Abiteboul; Omar Benjelloun; Tova Milo

    2008-01-01

    This paper provides an overview of the Active XML project developed at INRIA over the past five years. Active XML (AXML, for\\u000a short), is a declarative framework that harnesses Web services for distributed data management, and is put to work in a peer-to-peer\\u000a architecture. The model is based on AXML documents, which are XML documents that may contain embedded calls

  18. XML Syntax for Clinical Laboratory Procedure Manuals

    PubMed Central

    Saadawi, Gilan; Harrison, James H.

    2003-01-01

    We have developed a document type description (DTD) in Extensable Markup Language (XML)1 for clinical laboratory procedures. Our XML syntax can adequately structure a variety of procedure types across different laboratories and is compatible with current procedure standards. The combination of this format with an XML content management system and appropriate style sheets will allow efficient procedure maintenance, distributed access, customized display and effective searching across a large body of test information. PMID:14728496

  19. StatiX: making XML count

    Microsoft Academic Search

    Juliana Freire; Jayant R. Haritsa; Maya Ramanath; Prasan Roy; Jrme Simon

    2002-01-01

    The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query optimization. StatiX is a novel XML Schema-aware statistics framework that exploits the structure derived by regular expressions (which define elements in an XML Schema) to pinpoint places in the schema that are likely sources

  20. Converting FITS into XML: Methods and Advantages

    NASA Astrophysics Data System (ADS)

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

    We discuss how and why FITS data should be encapsulated in XML. Our goal is not to throw away the FITS standard entirely. Rather, we seek to re-map the FITS standard into an XML-based format. The advantages of doing so are legion and include: greater interoperability, parsing by XML aware browsers and applications, hierarchical structure for improved searchability, default values for header descriptions, extensibility for specialized usage and future development, and piggybacking on industry applications.

  1. Expressiveness of restricted recursive queries

    Microsoft Academic Search

    Foto Afrati; S. S. Cosmadakis

    1989-01-01

    We study the effect of various syntactic restrictions on the expressive power of database logic programs. We find natural examples of programs whichrequire recursively defined predicates of arbitrarily large width,require rules with arbitrarily many recursive calls, orrequire nonlinear rules, but can be evaluated in NC2.

  2. Recursive Patterns in Phonological Phrases

    Microsoft Academic Search

    Maartje Schreuder; Dicky Gilbers

    In this paper we investigate an instance of phonological recursion, more specifically we investigate iterative rule application in phonological phrases. The question is whether or not edge-marking processes, such as early pitch accent placement, can be applied recursively to phonological phrases that are embedded in larger phonological phrases. 1. Overview

  3. An XML Representation of FITS - Introducing FITSML

    NASA Astrophysics Data System (ADS)

    Thomas, B.; Shaya, E.; Gass, J.; Blackwell, J.; Cheung, C.

    2000-12-01

    We describe a means by which FITS data may be encapsulated in XML using the eXtensible Data Format (XDF) - an XML based language for encapsulating n-dimensional scientific data. Our goal is to re-map (rather than to redefine) the FITS standards into an XML format. The advantages include: greater interoperability, parsing by XML aware browsers and applications, hierarchical structure for improved searchability, automatic validation, default values for header descriptions, extensibility for specialized usage and future development, and piggybacking on industry applications. We present our current work including a DTD and examples and discuss complexities, choices and future work.

  4. XML Translator for Interface Descriptions

    NASA Technical Reports Server (NTRS)

    Boroson, Elizabeth R.

    2009-01-01

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

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

  6. Validating Streaming XML Documents Luc Segou n

    E-print Network

    Segoufin, Luc

    Validating Streaming XML Documents Luc Segou n INRIA-Rocquencourt Luc.Segou n@inria.fr Victor Vianu U.C. San Diego vianu@cs.ucsd.edu ABSTRACT This paper investigates the on-line validation of stream- ing XML documents with respect to a DTD, under memory constraints. We rst consider validation us- ing

  7. XML and Web Services Security Standards

    Microsoft Academic Search

    Nils Agne Nordbotten

    2009-01-01

    XML and Web services are widely used in current distributed systems. The security of the XML based communication, and the Web services themselves, is of great importance to the overall security of these systems. Furthermore, in order to facilitate interoperability, the security mechanisms should preferably be based on established standards. In this paper we provide a tutorial on current security

  8. A Taxonomy for XML Retrieval Use Cases

    Microsoft Academic Search

    Miro Lehtonen; Nils Pharo; Andrew Trotman

    2006-01-01

    Despite the active research on XML retrieval, it is a great challenge to determine the contexts where the methods can be applied and where the proven results hold. Therefore, having a common taxon- omy for the use cases of XML retrieval is useful when presenting the scope of the research. The taxonomy also helps us design more focused user studies

  9. Orthogonality in DBMS Design: the XML Approach

    Microsoft Academic Search

    Lutz Wegner; Morad Ahmad

    XML, XML-Schema an d t he st yle s heet language XS L have emerged as a base for universal data exchange. They have enriched our capabili- ties for view generation and schema transformations. Mapping hierarchical doc- uments into tables a ccording to the nested relational model is one obvious example. One elegant way to achieve this is to augment

  10. Compressing Aviation Data in XML Format

    NASA Technical Reports Server (NTRS)

    Patel, Hemil; Lau, Derek; Kulkarni, Deepak

    2003-01-01

    Design, operations and maintenance activities in aviation involve analysis of variety of aviation data. This data is typically in disparate formats making it difficult to use with different software packages. Use of a self-describing and extensible standard called XML provides a solution to this interoperability problem. XML provides a standardized language for describing the contents of an information stream, performing the same kind of definitional role for Web content as a database schema performs for relational databases. XML data can be easily customized for display using Extensible Style Sheets (XSL). While self-describing nature of XML makes it easy to reuse, it also increases the size of data significantly. Therefore, transfemng a dataset in XML form can decrease throughput and increase data transfer time significantly. It also increases storage requirements significantly. A natural solution to the problem is to compress the data using suitable algorithm and transfer it in the compressed form. We found that XML-specific compressors such as Xmill and XMLPPM generally outperform traditional compressors. However, optimal use of Xmill requires of discovery of optimal options to use while running Xmill. This, in turn, depends on the nature of data used. Manual disc0ver.y of optimal setting can require an engineer to experiment for weeks. We have devised an XML compression advisory tool that can analyze sample data files and recommend what compression tool would work the best for this data and what are the optimal settings to be used with a XML compression tool.

  11. Advances in XML Retrieval: The INEX Inititative

    E-print Network

    Lalmas, Mounia

    Advances in XML Retrieval: The INEX Inititative Norbert Fuhr, University of Duisburg-Essen, Germany- propriate scoring methods, for evaluating how effective content-oriented XML search systems are [Fuhr et al. 04, Fuhr et al. 05, Fuhr et al. 06]. In the fol- lowing, we first give a survey over the test

  12. XML Format for SESAME and LEOS

    Microsoft Academic Search

    J K Durrenberger; J R Neely; P A Sterne

    2009-01-01

    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

  13. Ontology-Based Secure XML Content Distribution

    NASA Astrophysics Data System (ADS)

    Rahaman, Mohammad Ashiqur; Roudier, Yves; Miseldine, Philip; Schaad, Andreas

    This paper presents an ontology-driven secure XML content distribution scheme. This scheme first relies on a semantic access control model for XML documents that achieves three objectives: (1) representing flexible and evolvable policies, (2) providing a high-level mapping and interoperable interface to documents, and (3) automating the granting of fine-grained access rights by inferring on content semantics. A novel XML document parsing mechanism is defined to delegate document access control enforcement to a third party without leaking the document XML schema to it. The Encrypted Breadth First Order Labels (EBOL) encoding is used to bind semantic concepts with XML document nodes and to check the integrity of a document.

  14. Compressing and searching XML data via two zips

    Microsoft Academic Search

    Paolo Ferragina; Fabrizio Luccio; Giovanni Manzini; S. Muthukrishnan

    2006-01-01

    XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML representation of a document is significantly larger than its native state) and the complexity of its search (XML search involves path and content searches on labeled tree structures). We

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

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

  17. Recursive least-squares learning algorithms for neural networks

    SciTech Connect

    Lewis, P.S. (Los Alamos National Lab., NM (USA)); Hwang, Jenq-Neng (Washington Univ., Seattle, WA (USA). 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. SUPPORTING COLLABORATIVE WRITING OF XML DOCUMENTS

    E-print Network

    Boyer, Edmond

    SUPPORTING COLLABORATIVE WRITING OF XML DOCUMENTS G´erald Oster, Hala Skaf-Molli, Pascal Molli oster@loria.fr, skaf@loria.fr, molli@loria.fr Hala Naja-Jazzar Faculty of Science 3, Lebanese University

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

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

  1. An XML portable chart format.

    PubMed Central

    Chueh, H. C.; Raila, W. F.; Berkowicz, D. A.; Barnett, G. O.

    1998-01-01

    The clinical chart remains the fundamental record of outpatient clinical care. As this information migrates to electronic form, there is an opportunity to create standard formats for transmitting these charts. This paper describes work toward a Portable Chart Format (PCF) that can represent the relevant aspects of an outpatient chart. The main goal of the format is to provide a packaging medium for outpatient clinical charts in a transfer of care scenario. A secondary goal is to support the aggregation of comparable clinical data for outcomes analysis. The syntax used for PCF is Extended Markup Language (XML), a W3C standard. The structure of the PCF is based on a clinically relevant view of the data. The data definitions and nomenclature used are based primarily on existing clinical standards. PMID:9929315

  2. Monitoring XML Data on the Web

    Microsoft Academic Search

    Benjamin Nguyen; Serge Abiteboul; Gregory Cobena; Mihai Preda

    2001-01-01

    We consider the monitoring of a flow of incoming documents.More precisely, we present here the monitoring used in avery large warehouse built from XML documents found onthe web. The flow of documents consists in XML pages(that are warehoused) and HTML pages (that are not). Ourcontributions are the following:ffl a subscription language which specifies the monitoringof pages when fetched, the periodical

  3. ADM: An Active Deductive XML Database System

    Microsoft Academic Search

    Jos Oscar Olmedo-aguirre; Karina Escobar-vzquez; Giner Alor-hernndez; Guillermo Morales-luna

    2004-01-01

    \\u000a As XML is becoming widely accepted as a mean of storing, searching and extracting information, a larger number of Web applications\\u000a will require conceptual models and administrative tools to organize their collections of documents. Recently, event-condition-action\\u000a (ECA) rules have been proposed to provide reactive functionality into XML document databases. However, logical inference mechanisms\\u000a to deliver multiagent-based applications remain unconsidered in

  4. Efficient Structural Joins on Indexed XML Documents

    Microsoft Academic Search

    Shu-yao Chien; Zografoula Vagena; Donghui Zhang; Vassilis J. Tsotras; Carlo Zaniolo

    2002-01-01

    Queries on XML documents typically combine selections on element contents, and, via path expressions, the structural relationships be- tween tagged elements. Structural joins are used to flnd all pairs of elements satisfying the primitive structural relationships specifled in the query, namely, parent{child and ancestor{ descendant relationships. E-cient support for structural joins is thus the key to e-cient implementations of XML

  5. DSpace XML UI Project Technical Overview

    E-print Network

    Phillips, Scott; Maslov, Alexey; Leggett, John; Mikeal, Adam

    2007-07-16

    &M University adam@cs.tamu.edu ABSTRACT This paper describes the modifications to DSpace by Texas A&M Libraries to suport an XML-based user interface. DSpace suports digital repositories composed of comunities and colections. Each comunity within... interface to the curent JSP based implementation, requiring no changes to the core of DSpace (including the database), while specificaly enabling both user interfaces to operate simultaneously. ARCHITECTURE The XML user interface relies on Java Servlets...

  6. Reformulation of XML Queries and Constraints

    Microsoft Academic Search

    Alin Deutsch; Val Tannen

    2003-01-01

    We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redundancies (material- ized views, indexes and caches) to enhance performance. The correspon- dence between published and proprietary schemas is specied by views in both directions, and the same algorithm performs rewriting-with-views, composition-with-views,

  7. Cumulant filters - a recursive estimation method for systems with non-Gaussian process and measurement noise

    Microsoft Academic Search

    Jose R. Latimer; Nader M. Namazi

    2003-01-01

    A recursive filtering technique for the state estimation of linear systems where the Gaussian assumption is not required for either the plant (process), initial condition, or measurement noise are presented. The approach requires the noise to be defined by their higher-order statistics (moments or cumulants). Analogous to the Kalman filter time-update propagation of a covariance matrix, cumulants can be propagated

  8. Recursive maximum likelihood estimation of aircraft position using multiple range and bearing measurements

    Microsoft Academic Search

    Joseph H. Clements III

    1996-01-01

    In this paper an algorithm is presented that recursively computes the maximum likelihood (ML) estimates of an aircraft's position in space. By combining an a priori ML estimate of the aircraft's state vector and its error covariance matrix with multiple range measurements, updated estimates are obtained. This technique is particularly useful in situations where distance measuring equipment coverage or geometry

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

  10. Lecture Notes in Computer Science 1 XML-based Components for Federating Multiple

    E-print Network

    Paris-Sud XI, Universit de

    on top of relational DBMSs, and client tools including a Java API and an XML query browser. The results) to store and query XML documents in a relational DBMS, an XML media- tor which receives XML-QL queries from to the source wrapper and assemble the results in XML. Finally, it also includes an XML query browser to for

  11. Following the paths of XML Data: An algebraic framework for XML query evaluation

    Microsoft Academic Search

    Leonidas Galanis; Efstratios Viglas; David J. Dewitt; Jeffrey. F. Naughton; David Maier

    2001-01-01

    This paper introduces an algebraic framework for expressing and evaluating queries over XML data.It presents the underlying assumptions of the framework, describes the input and output of the algebraicoperators, and defines these operators and their semantics. It evaluates the framework with regard toother proposed XML query algebras. Examples show that this framework is flexible enough to capturequeries expressed in Quilt,

  12. How Learning Logic Programming Affects Recursion Comprehension

    ERIC Educational Resources Information Center

    Haberman, Bruria

    2004-01-01

    Recursion is a central concept in computer science, yet it is difficult for beginners to comprehend. Israeli high-school students learn recursion in the framework of a special modular program in computer science (Gal-Ezer & Harel, 1999). Some of them are introduced to the concept of recursion in two different paradigms: the procedural programming

  13. FPGA-based implementation of recursive algorithms

    Microsoft Academic Search

    Valery Sklyarov

    2004-01-01

    The paper suggests a novel method for implementing recursive algorithms in hardware. The required support for recursion has been provided through a modular and a hierarchical specification of a control unit that can be translated to an implementation of the respective hardware circuit on the basis of a recursive hierarchical finite state machine and through a mechanism that permits the

  14. Recursive equations for Majorana currents

    E-print Network

    R. Kleiss; G. van den Oord

    2009-06-03

    A recursive computation of scattering amplitudes including Majorana fermions requires a consistent definition of the fermion flow, which is introduced by Denner et al. in a diagrammatic setting. A systematic treatment in the off-shell current formalism is proposed, which involves explicit reversal of fermion currents.

  15. Lessons in Contingent, Recursive Humility

    ERIC Educational Resources Information Center

    Vagle, Mark D.

    2011-01-01

    In this article, the author argues that critical work in teacher education should begin with teacher educators turning a critical eye on their own practices. The author uses Lesko's conception of contingent, recursive growth and change to analyze a lesson he observed as part of a phenomenological study aimed at understanding more about what it is

  16. Hybrid approach for XML access control (HyXAC)

    E-print Network

    Thimma, Manogna

    2012-08-31

    While XML has been widely adopted for sharing and managing information over the Internet, the need for efficient XML access control naturally arise. Various access control models and mechanisms have been proposed in the ...

  17. PRIX: Indexing And Querying XML Using Prfer Sequences

    Microsoft Academic Search

    Praveen Rao; Bongki Moon

    2004-01-01

    We propose a new way of indexing XML documents and pro- cessing twig patterns in an XML database. Every XML docu- ment in the database can be transformed into a sequence of labels by Pr ufer's method that constructs a one-to-one corre- spondence between trees and sequences. During query pro- cessing, a twig pattern is also transformed into its Prufer

  18. A Graphical Programming Interface for a XML-based

    E-print Network

    Goldschmidt, Christina

    A Graphical Programming Interface for a XML-based Hidden Markov Model Compiler Ahmad Usman Chughtai to act as a graphical layer between the user and the XML specification. The process detailing is that it requires the user to learn a new (XML) language. The natural way to specify a HMM would be to draw a graph

  19. XML Index Recommendation with Tight Optimizer Iman Elghandour 1

    E-print Network

    Aboulnaga, Ashraf

    XML Index Recommendation with Tight Optimizer Coupling Iman Elghandour 1 , Ashraf Aboulnaga 1 the best set of indexes for a given workload. In this paper, we present an XML Index Advisor that solves this XML index recommendation problem and has the key characteristic of being tightly coupled

  20. Redundancy, Dependencies and Normal Forms for XML Databases

    Microsoft Academic Search

    Klaus-dieter Schewe

    2005-01-01

    With the advent of XML and its use as a database language, dependency and normal form theory has attracted novel research interest. Several approaches to build up a dependency and normal form theory for XML databases have been published, mainly concen- trating on functional dependencies and keys. XML- like database structures can be modelled by rational trees using constructors for

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

  2. Programming with Heterogeneous Structures: Manipulating XML data using bondi

    E-print Network

    Graham, Nick

    Programming with Heterogeneous Structures: Manipulating XML data using bondi F.Y. Huang C. B. Jay D expressive power. We show how an existing programming language, bondi, can be used as is to handle XML data as parameters to functions. #12;Programming with Heterogeneous Structures: Manipulating XML data using bondi F

  3. Programming with Heterogeneous Structures: Manipulating XML data using bondi

    E-print Network

    Graham, Nick

    Programming with Heterogeneous Structures: Manipulating XML data using bondi F.Y. Huang C. B. Jay D. We show how an existing programming language, bondi, can be used as is to handle XML data, since data to functions. #12; Programming with Heterogeneous Structures: Manipulating XML data using bondi F.Y. Huang

  4. Integrating XML and Object-Based Programming for Distributed Collaboration

    Microsoft Academic Search

    Vassil Roussev; Prasun Dewan; Naveen Koorakula; Sriram Sellappa

    2000-01-01

    In this paper, we explore some of the new opportunities for distributed collaborative applications that emerge from the use of XML as a data specification language. We present two different approaches: the first one transparently adds asynchronous collaboration to applications whose persistent state is in XML format, while the second one helps build synchronous collaborative applications starting with an XML

  5. XML Multimedia Retrieval Zhigang Kong and Mounia Lalmas

    E-print Network

    Lalmas, Mounia

    XML Multimedia Retrieval Zhigang Kong and Mounia Lalmas Department of Computer Science, Queen Mary, University of London {cskzg, mounia}@dcs.qmul.ac.uk Abstract. Multimedia XML documents can be viewed as a tree, whose nodes correspond to XML elements, and where multimedia objects are referenced in attributes

  6. Using Structural Analysis to Mediate XML Semantic Interoperability

    Microsoft Academic Search

    Amar Gupta; Ashish Mishra; Michael Ripley

    2002-01-01

    At the forefront of interoperability using XML in an Internet environment is the issue of semantic trans-lation; that is, the ability to properly interpret the elements, attributes, and values contained in an XML file. In many cases, specific domains have standardized the way data are represented in XML. When this does not occur, some type of mediation is required to

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

  8. TIJAH: Embracing IR Methods in XML Databases Johan List1

    E-print Network

    Hiemstra, Djoerd

    TIJAH: Embracing IR Methods in XML Databases Johan List1 Vojkan Mihajlovic2 Georgina Ramirez1 in INEX (the Initiative for the Evaluation of XML Retrieval) using the TIJAH XML-IR system. TIJAH's system the `pre-post numbering scheme'. The paper concludes with an analysis of experiments performed

  9. XML Fragment Caching for Small Mobile Internet Devices

    Microsoft Academic Search

    Stefan Bttcher; Adelhard Trling

    2002-01-01

    Whenever small mobile devices with low bandwidth connections to a server execute transactions on common XML data, then efficient data exchange be- tween client and server is a key problem to be solved. However, a solution should also consider client- side cache management for the XML data, synchronization of concurrent access to the XML data, and lost connections during transaction

  10. SilkRoute: trading between relations and XML

    Microsoft Academic Search

    Mary F. Fernandez; Wang-Chiew Tan; Dan Suciu

    2000-01-01

    XML is the standard format for data exchange between inter-enterprise applications on the Internet. To facilitate data exchange, industry groups define public document type definitions (DTDs) that specify the format of the XML data to be exchanged between their applications. In this paper, we address the problem of automating the conversion of relational data into XML. We describe SilkRoute, a

  11. Application of XML Tools for Enterprise-Wide RBAC Implementation

    E-print Network

    Sandhu, Ravi

    1 Application of XML Tools for Enterprise-Wide RBAC Implementation Tasks Ramaswamy Chandramouli · Representing an RBAC model in an XML schema · Use of XML Tools for three Enterprise-RBAC tasks (1) Implementing RBAC in a DB Server (2) Implementing Identical RBAC Models (3) Implementing Access Control Service

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

  13. XML Lossy Text Compression: A Preliminary Study

    NASA Astrophysics Data System (ADS)

    Bonifati, Angela; Lorusso, Marianna; Sileo, Domenica

    Lossy compression techniques have been applied to image and text compression, yielding compression factors that are vastly superior to lossless compression schemes. In this paper, we present a preliminary study on a set of lossy transformations for XML documents that preserve the semantics. Inspired by previous techniques, e.g. lossy text compression and literate programming, we apply a simple algorithm to XML syntactic constructs to loose superfluous layout information and redundant text. The obtained XML keeps the human-readability and machine-readability properties. Additionally, it can lead to a considerable reduction of its space occupancy and boost the application of conventional text compressors, thus representing a promising technology for several data management tasks.

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

  15. A Binary Recursive Gcd Algorithm

    Microsoft Academic Search

    Damien Stehl; Paul Zimmermann

    2004-01-01

    The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common divisor of two integers by simulating a slightly modied version of the binary algorithm. The structure of our algorithm is very close to the one of the well-known Knuth-Schonhage fast gcd algorithm; although

  16. Implementing XML Schema Naming and Design Rules

    SciTech Connect

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

    2006-08-01

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

  17. A Scalable Architecture for XML Retrieval

    Microsoft Academic Search

    Gabriella Kazai; Thomas Rlleke

    2002-01-01

    Whereas in classical text collections, documents are considered as atomic units, we consider in XML col- lections elements in documents. This augmented view increases the number of potentially retrieved objects. A retrieved object can be a document, an element in a document, an aggregation of elements or of documents or the whole collection itself. The increase in the num- ber

  18. Bachelor scriptie Uitdrukkingskracht van XML schema's

    E-print Network

    Lucas, Peter

    . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.2.1 Deterministische hedge automaten . . . . . . . . . . . . . 18 4.2.2 DHA voor een XML . . . . . . . . . . . . . . . . . . . . . . . . 23 4.3.2 NDHA RHG . . . . . . . . . . . . . . . . . . . . . . . . 24 4.3.3 DHA NDHA . . . . . . . . . . . . . . . . . . . . . . . . 25 4.3.4 NDHA DHA . . . . . . . . . . . . . . . . . . . . . . . . 25 4.4 Uitgebreide RHG

  19. A Smart Compressed XML Data on Networks

    Microsoft Academic Search

    Xu Huang; Dharmendra Sharma

    2007-01-01

    It is well known that XML became an official recommendation of the World Wide Web Consortium (W3C) in 1998, it is now increasingly being used to transmit data on networks but is a verbose format and needs an efficient encoding to send relatively large amounts of data efficiently, which is most attractive to wireless data communications. It is a common

  20. Converting from XML to HDF-EOS

    NASA Technical Reports Server (NTRS)

    Ullman, Richard; Bane, Bob; Yang, Jingli

    2008-01-01

    A computer program recreates an HDF-EOS file from an Extensible Markup Language (XML) representation of the contents of that file. This program is one of two programs written to enable testing of the schemas described in the immediately preceding article to determine whether the schemas capture all details of HDF-EOS files.

  1. Safe software standards and XML schemas

    Microsoft Academic Search

    Robert C. Leif

    2010-01-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

  2. Incremental Validation of XML Documents ANDREY BALMIN

    E-print Network

    Papakonstantinou, Yannis

    Incremental Validation of XML Documents ANDREY BALMIN IBM Almaden Research Center and YANNIS PAPAKONSTANTINOU and VICTOR VIANU University of California at San Diego We investigate the incremental validation) incremental validation algorithm using an auxiliary structure of size O(n), where n is the size

  3. XML Model for Legal Documents Vanyo Peychev

    E-print Network

    Borissova, Daniela

    8 6 XML Model for Legal Documents Vanyo Peychev Faculty of Mathematics and Informatics, Sofia and gives us possibilities to define operation above the document. Defining a structure for information. The text information is distributed and processed as document form. Every document is a set of paragraphs

  4. Labeling Dynamic XML Trees Edith Cohen

    E-print Network

    Milo, Tova

    is an ancestor of the other. This problem arises in the context of XML databases that support queries also consider the same problem when ''clues'' that pro vide guarantees on possible future insertions are given to gether with newly inserted nodes. Such clues can be derived from the DTD or from statistics

  5. XML for Video Games CS 297 Report

    E-print Network

    Pollett, Chris

    extensibility. Unlike the other markup language HTML, XML allows us to define our own tags and our own document is to eat as many as doughnuts as possible before the aliens at the side of the screen shoot the player every time he eats a doughnut and his health will go up by 2. The aliens cannot move but they try

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

  7. On-line adaptive learning of the continuous density hidden Markov model based on approximate recursive Bayes estimate

    Microsoft Academic Search

    Qiang Huo; Chin-Hui Lee

    1997-01-01

    We present a framework of quasi-Bayes (QB) learning of the parameters of the continuous density hidden Markov model (CDHMM) with Gaussian mixture state observation densities. The QB formulation is based on the theory of recursive Bayesian inference. The QB algorithm is designed to incrementally update the hyperparameters of the approximate posterior distribution and the CDHMM parameters simultaneously. By further introducing

  8. The Recursive Paradigm: Suppose We Already Knew.

    ERIC Educational Resources Information Center

    Maurer, Stephen B.

    1995-01-01

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

  9. On Conservative Learning of Recursively Enumerable Languages #

    E-print Network

    Stephan, Frank

    On Conservative Learning of Recursively Enumerable Languages # Ziyuan Gao 1 , Sanjay Jain 2 partial learning is a variant of partial learning whereby the learner, on a text for a target language L''. A class of languages is learnable i# there is a recursive learner which learns every language in the class

  10. Real recursive functions and their hierarchy

    Microsoft Academic Search

    Jerzy Mycka

    2004-01-01

    In the last years, recursive functions over the reals (13) have been considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes (3). However, one of the operators intro- duced in the seminal paper by Cris Moore (in 1996), the minimalization operator, has not been considered: (a) although dierential recursion (the

  11. Recursive Moving Frames Peter J. Olver

    E-print Network

    Olver, Peter

    Recursive Moving Frames Peter J. Olver School of Mathematics University of Minnesota Minneapolis for the equivariant method of moving frames, for both finite-dimensional Lie group actions and Lie pseudo-groups, is developed and illus- trated by several examples of interest. The recursive method enables one avoid unwieldy

  12. A Fast Recursive Algorithm Molecular Dynamics Simulation

    E-print Network

    A Fast Recursive Algorithm for Molecular Dynamics Simulation A. Jain Jet Propulsion Laboratory: Molecular dynamics, algorithms, simulation. #12; Running head: A Fast Algorithm for MD Simulation Please Pasadena, CA 91109 2 #12; A Fast Recursive Algorithm for Molecular Dynamics Simulation A. Jain, N. Vaidehi

  13. Decidability and Recursive Languages Let L ( -{ })

    E-print Network

    Lyuu, Yuh-Dauh

    ( - { }) , M(x) = f(x). · We call f a recursive functiona if such an M exists. aKurt G¨odel (1931). c 2006 Prof models have been proposed. ­ Recursive function (G¨odel), calculus (Church), formal language (Post

  14. Acceptability and Recursively Enumerable Languages Let L ( -{ })

    E-print Network

    Lyuu, Yuh-Dauh

    string x ( - { }) , M(x) = f(x). · We call f a recursive functiona if such an M exists. aKurt G¨odel (1931). c 2011 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 41 #12;Kurt G¨odel (1906­1978) c have been proposed. ­ Recursive function (G¨odel), calculus (Church), formal language (Post), assembly

  15. Recursive Turtle Programs and Iterated Affine Transformations

    E-print Network

    Schaefer, Scott

    Recursive Turtle Programs and Iterated Affine Transformations Tao Ju*, Scott Schaefer, Ron Goldman of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine, turtle graphics 1 Introduction In computer graphics, there are several different methods for generating 2

  16. Evaluating compound generalized Poisson distributions recursively

    Microsoft Academic Search

    M. J. GOOVAERTS; R. KAAS

    1993-01-01

    In this paper we give a recursive scheme, involving Panjer's recursion, to compute the distribution of a compound sum of integer claims, when the number of summands follows a Generalized Poisson distribution. Also, an elegant derivation is given for some basic properties of this counting distribu- tion. The Generalized Poisson distribution, see CONSUL (1989), is an integer-valued, non-negative distribution with

  17. Utiliser le fichier emploi-du-temps.xml ou emploi-du-temps2.xml (que vous avez cr dans les TD prcdents) pour rpondre aux questions suivantes

    E-print Network

    Belaïd, Abdel

    TD : Xpath Exercice 1 Utiliser le fichier emploi-du-temps.xml ou emploi-du-temps2.xml (que vous cours ayant lieu, un jour donné Exercice 2 Reproduire le fichier emploi-du-temps.xml en effectuant une Exercice 3 Reproduire le fichier emploi-du-temps.xml en ajoutant, pour chaque salle de cours, une boucle

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

  19. Clustering XML Documents Using Frequent Subtrees

    NASA Astrophysics Data System (ADS)

    Kutty, Sangeetha; Tran, Tien; Nayak, Richi; Li, Yuefeng

    This paper presents an experimental study conducted over the INEX 2008 Document Mining Challenge corpus using both the structure and the content of XML documents for clustering them. The concise common substructures known as the closed frequent subtrees are generated using the structural information of the XML documents. The closed frequent subtrees are then used to extract the constrained content from the documents. A matrix containing the term distribution of the documents in the dataset is developed using the extracted constrained content. The k-way clustering algorithm is applied to the matrix to obtain the required clusters. In spite of the large number of documents in the INEX 2008 Wikipedia dataset, the proposed frequent subtree-based clustering approach was successful in clustering the documents. This approach significantly reduces the dimensionality of the terms used for clustering without much loss in accuracy.

  20. Internet-based data interchange with XML

    NASA Astrophysics Data System (ADS)

    Fuerst, Karl; Schmidt, Thomas

    2000-12-01

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

  1. Software Development Of XML Parser Based On Algebraic Tools

    NASA Astrophysics Data System (ADS)

    Georgiev, Bozhidar; Georgieva, Adriana

    2011-12-01

    In this paper, is presented one software development and implementation of an algebraic method for XML data processing, which accelerates XML parsing process. Therefore, the proposed in this article nontraditional approach for fast XML navigation with algebraic tools contributes to advanced efforts in the making of an easier user-friendly API for XML transformations. Here the proposed software for XML documents processing (parser) is easy to use and can manage files with strictly defined data structure. The purpose of the presented algorithm is to offer a new approach for search and restructuring hierarchical XML data. This approach permits fast XML documents processing, using algebraic model developed in details in previous works of the same authors. So proposed parsing mechanism is easy accessible to the web consumer who is able to control XML file processing, to search different elements (tags) in it, to delete and to add a new XML content as well. The presented various tests show higher rapidity and low consumption of resources in comparison with some existing commercial parsers.

  2. XML Restructuring and Integration for Tabular Data

    Microsoft Academic Search

    Wei Yu; Z. Meral Ozsoyoglu; Gultekin Ozsoyoglu

    \\u000a We study the data integration and restructuring issues of tabular data. We consider the case where the same set of data is\\u000a collected from independent sites, stored in different DBMSs or other repositories, organized in different tabular or equivalent\\u000a semi-structured formats, and published on the web. These sites transform tabular data into XML data with possible syntactic\\u000a discrepancies in their

  3. Standards for XML and Web Services Security

    Microsoft Academic Search

    Martin Naedele

    2003-01-01

    XML schemas convey the data syntax and semantics for various application domains, such as business-to-business transactions, medical records, and production status reports. However, these schemas seldom address security issues, which can lead to a worst-case scenario of systems and protocols with no security at all. At best, they confine security to transport level mechanisms such as secure sockets layer (SSL).

  4. XML Lossy Text Compression: A Preliminary Study

    Microsoft Academic Search

    Angela Bonifati; Marianna Lorusso; Domenica Sileo

    2009-01-01

    Lossy compression techniques have been applied to image and text compression, yielding compression factors that are vastly\\u000a superior to lossless compression schemes. In this paper, we present a preliminary study on a set of lossy transformations\\u000a for XML documents that preserve the semantics. Inspired by previous techniques, e.g. lossy text compression and literate programming,\\u000a we apply a simple algorithm to

  5. Graph queries for data integration using xml

    Microsoft Academic Search

    V. G. Tulchinsky; A. K. Yushchenko; R. A. Yushchenko

    2008-01-01

    A new visual language, which is called ER-QBE and uses a conceptual model semantics, is proposed for the development of XML\\u000a views. ER-QBE is based on graph queries that are trees of parametric SQL queries. The ER-QBE language is characterized by\\u000a formally proved completeness, its expressiveness is higher than that of well-known alternatives, and it supports both relational\\u000a and object-relational

  6. Letter to the editor: SeqXML and OrthoXML: standards for sequence and orthology information.

    PubMed

    Schmitt, Thomas; Messina, David N; Schreiber, Fabian; Sonnhammer, Erik L L

    2011-09-01

    There is a great need for standards in the orthology field. Users must contend with different ortholog data representations from each provider, and the providers themselves must independently gather and parse the input sequence data. These burdensome and redundant procedures make data comparison and integration difficult. We have designed two XML-based formats, SeqXML and OrthoXML, to solve these problems. SeqXML is a lightweight format for sequence records-the input for orthology prediction. It stores the same sequence and metadata as typical FASTA format records, but overcomes common problems such as unstructured metadata in the header and erroneous sequence content. XML provides validation to prevent data integrity problems that are frequent in FASTA files. The range of applications for SeqXML is broad and not limited to ortholog prediction. We provide read/write functions for BioJava, BioPerl, and Biopython. OrthoXML was designed to represent ortholog assignments from any source in a consistent and structured way, yet cater to specific needs such as scoring schemes or meta-information. A unified format is particularly valuable for ortholog consumers that want to integrate data from numerous resources, e.g. for gene annotation projects. Reference proteomes for 61 organisms are already available in SeqXML, and 10 orthology databases have signed on to OrthoXML. Adoption by the entire field would substantially facilitate exchange and quality control of sequence and orthology information. PMID:21666252

  7. Fuzzy Duplicate Detection on XML Data Melanie Weis

    E-print Network

    Weske, Mathias

    , there is a need for XML data cleansing, which requires solutions for fuzzy duplicate detection in XML Introduction Data cleansing is an issue of critical practical impor- tance. It is required to ensure high data cleansing is fuzzy duplicate detection (duplicate detection for short). It resolves which entries in a data

  8. Visibly Pushdown Transducers for Approximate Validation of Streaming XML

    Microsoft Academic Search

    Alex Thomo; Srinivasan Venkatesh; Ying Ying Ye

    2008-01-01

    Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of context- free languages. It has been shown that VPAs are equivalent to Extended Document Type Definitions (EDTDs), and thus, they provide means for elegantly solving various problems on XML. Especially, it has been shown that VPAs are the apt device for streaming XML. One

  9. INDEXING OF MEDICAL XML DOCUMENTS STORED IN WORM STORAGE

    Microsoft Academic Search

    Naim Aksu

    2009-01-01

    Write-Once-Read-Many (WORM) storage devices may be used to store critical medical data to prevent them from easy modification. In this paper, we propose a novel indexing structure for encrypted medical XML documents stored in WORM storage. The proposed indexing that uses Generalized Hash Tree (GHT) expedites projection and selection operations on encrypted medical XML records stored in WORM storage. We

  10. Rainbow: multi-XQuery optimization using materialized XML views

    Microsoft Academic Search

    Xin Zhang; Katica Dimitrova; Ling Wang; Maged El Sayed; Brian Murphy; Bradford Pielech; Mukesh Mulchandani; Luping Ding; Elke A. Rundensteiner

    2003-01-01

    Outlook. We present multiple XQuery optimization based on ma- terialized XML view technology in the Rainbow system. In this demo we in particular show: (1) Rainbow's support for defining and incrementally maintaining materialized XQuery views, (2) XQuery optimization by query rewriting to use materialized views, (3) Per- forming multiple query optimization by merging multiple XML queries (XATs) into one global

  11. Regular Expression Types for XML Haruo Hosoya J

    E-print Network

    Vouillon, Jérôme - Laboratoire Preuves, Programmes et Systèmes, Université Paris 7

    the following set of definitions type Addrbook = addrbook[Person*] type Person = person[Name,Addr,Tel?] type). An instance of the type Addrbook is the following XML document: !addrbook? !person? !name?Haruo HosoyaRegular Expression Types for XML Haruo Hosoya J ?? er ?? ome Vouillon Benjamin C. Pierce Department

  12. The Semantic Web: The Roles of XML and RDF

    Microsoft Academic Search

    Stefan Decker; Sergey Melnik; Frank Van Harmelen; Dieter Fensel; Michel C. A. Klein; Jeen Broekstra; Michael Erdmann; Ian Horrocks

    2000-01-01

    this article, we explain the role of ontologies in the architecture ofthe Semantic Web. We then briefly summarize key elements of XML andRDF, showing why using XML as a tool for semantic interoperability willbe ineffective in the long run. We argue that a further representation andinference layer is needed on top of the Web's current layers, and to establishsuch a

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

  14. Acquiring XML pages for a WebHouse

    Microsoft Academic Search

    Laurent Mignet; Serge Abiteboul; Sbastien Ailleret; Bernd Amann; Amlie Marian; Mihai Preda

    2000-01-01

    Xyleme is a dynamic warehouse for the XML data of the web supporting change control and data integration. Major issues are the acquisition of XML data and keeping data up to date with the web as best as possible. This is the topic of the present paper.

  15. User Expectations from XML Element Retrieval Stamatina Betsi1

    E-print Network

    Tombros, Tassos

    is to return to users XML elements, rather than whole documents. This poster describes a small study, in which we elicited users' expectations, i.e. their anticipated experience, when interacting with an XML their effort when viewing large texts, by allowing them to focus only on the parts of the document

  16. Sound ranking algorithms for XML search Djoerd Hiemstra1

    E-print Network

    Reiterer, Harald

    Sound ranking algorithms for XML search Djoerd Hiemstra1 , Stefan Klinger2 , Henning Rode3 , Jan Flokstra1 , and Peter Apers1 1 University of Twente, 2 University of Konstanz, and 3 CWI hiemstra for articles that talk about ranked xml retrieval which were supported in one way or another by John Doe

  17. An extended transaction model for cooperative authoring of XML data

    Microsoft Academic Search

    Francis Gropengieer; Katja Hose; Kai-uwe Sattler

    2009-01-01

    Eingegangen: date \\/ Angenommen: date Abstract In many application scenarios, for example in design or media production processes, several authors have to work cooperatively on the same project and con- sequently on the same data. In this context, a frequently used data format is XML. To enable cooperative au- thoring of shared XML graph structures, several require- ments have to

  18. X-CSR: Dataflow Optimization for Distributed XML Process Pipelines

    Microsoft Academic Search

    Daniel Zinn; Shawn Bowersy; Timothy McPhillipsy; Bertram Ludscher

    XML process networks are a simple, yet power- ful programming paradigm for loosely coupled, coarse-grained dataflow applications such as data-centric scientific workflows. We describe a framework called -XML that is well-suited for applications in which pipelines of data processors modify parts (\\

  19. XML'99 Paper 1 Copyright 1999 Commerce One, Inc.

    E-print Network

    Glushko, Robert J.

    with documents in other communities. The paper briefly explains how a Common Business Library encoded in an XML. It revisits EDI's basic premise that it is easier to interconnect business systems using "document business process requirements and analyzes the technical limitations in both EDI and XML that make

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

  1. Visibly Pushdown Transducers for Approximate Validation of Streaming XML

    E-print Network

    Srinivasan, Venkatesh

    of context- free languages. It has been shown that VPAs are equivalent to Extended Document Type Definitions been shown that VPAs are the apt device for streaming XML. One of the important problems about XML document conforms to the specification given by an EDTD. In this paper, we are interested in solving

  2. Modeling Web Applications Using Java and XML Related Technologies

    Microsoft Academic Search

    Sam Chung; Yun-Sik Lee

    2003-01-01

    The purpose of this paper is to propose visual models for a web application using Java and XML related technologies. We consider a web application that uses 3- tier architecture and each tier is distributed onto web, application, and data base servers. In the web applications, various Java and XML related technologies are employed in the form of different languages:

  3. XIRAF - XML-based indexing and querying for digital forensics

    Microsoft Academic Search

    Wouter Alink; R. A. F. Bhoedjang; Peter A. Boncz; Arjen P. De Vries

    2006-01-01

    This paper describes a novel, XML-based approach towards managing and querying forensic traces extracted from digital evidence. This approach has been implemented in XIRAF, a prototype system for forensic analysis. XIRAF systematically applies forensic analysis tools to evidence files (e.g., hard disk images). Each tool produces structured XML annotations that can refer to regions (byte ranges) in an evidence file.

  4. XPERANTO: Publishing Object-Relational Data as XML

    Microsoft Academic Search

    Michael J. Carey; Daniela Florescu; Zachary G. Ives; Ying Lu; Jayavel Shanmugasundaram; Eugene J. Shekita; Subbu N. Subramanian

    2000-01-01

    Since its introduction, XML, the eXtended Markup Language, has quickly emerged as the universal format for publishing and exchanging data in the World Wide Web. As a result, data sources, including object-relational databases, are now faced with a new class of users: clients and customers who would like to deal directly with XML data rather than being forced to deal

  5. XML-based Agent Communication for Electronic Marketplaces

    Microsoft Academic Search

    Karl Kurbel; Frank Teuteberg; Daniel Szulim

    2002-01-01

    Efficient electronic marketplaces require flexible lan- guages such as XML to define the exchange of struc- tured and unstructured information across electronic commerce applications. Software agents can enhance such marketplaces significantly. Therefore we investi- gate how agent technology can be integrated with XML. This paper discusses relevant technology issues related to the integration task. An e-commerce scenario is out- lined

  6. Xyleme, a dynamic warehouse for XML data of the Web

    Microsoft Academic Search

    S. Abiteboul; V. Aguilera; S. Ailleret; B. Amann; F. Arambarri; S. Cluet; G. Cobena; G. Corona; G. Ferran; A. Galland; M. Hascoet; C.-C. Kanne; B. Koechlin; D. Le Niniven; A. Marian; L. Mignet; G. Moerkotte; B. Nguyen; M. Preda; M.-C. Rousset; M. Sebag; J.-P. Sirot; P. Veltri; D. Vodislav; F. Watez; T. Westmann

    2001-01-01

    The current development of the Web and the generalization of XML technology provide a major opportunity which can radically change the face of the Web. Xyleme intends to be a leader of this revolution by providing database services over the XML data of the Web. Originally, Xyleme was a research project functioning as an open, loosely coupled network of researchers.

  7. Wrapping Legacy COBOL Programs behind an XML-Interface

    Microsoft Academic Search

    Harry M. Sneed

    2001-01-01

    This paper describes the tools and techniques for encapsulating host COBOL programs with an XML interface. The legacy programs are divided into three classes - online programs, batch programs and subprograms. For each program type, a different wrapping technique and a different tool is employed. Online programs are transformed into data-driven subprograms which process an XML document. Batch programs are

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

  10. Meaning Predictability and Recursion in Onomasiology

    E-print Network

    Mason, Julia

    2011-11-23

    The following study of recursive naming units sought to test the methods of meaning predictability outlined in tekauers (2005a) onomasiological account of word-formation. One of his experiments was repeated with new ...

  11. Gaussian process based recursive system identification

    NASA Astrophysics Data System (ADS)

    Prher, Jakub; imandl, Miroslav

    2014-12-01

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

  12. Simple Recursion Relations for General Field Theories

    E-print Network

    Cheung, Clifford; Trnka, Jaroslav

    2015-01-01

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

  13. Recursive least-squares learning algorithms for neural networks

    NASA Astrophysics Data System (ADS)

    Lewis, Paul S.; Hwang, Jenq N.

    1990-11-01

    This paper presents the development of a pair of recursive least squares (ItLS) 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 0(N2) where N is the number of network parameters. This is due to the estimation of the N x N inverse Hessian matrix. Less computationally intensive approximations of the ilLS 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 (6 1 BACKGROUND Artificial neural networks (ANNs) offer an interesting and potentially useful paradigm for signal processing and pattern recognition. The majority of ANN applications employ the feed-forward multilayer perceptron (MLP) network architecture in which network parameters are " trained" by a supervised learning algorithm employing the generalized delta rule (GDIt) [1 2]. The GDR algorithm approximates a fixed step steepest descent algorithm using derivatives computed by error backpropagatiori. The GDII algorithm is sometimes referred to as the backpropagation algorithm. However in this paper we will use the term backpropagation to refer only to the process of computing error derivatives. While multilayer perceptrons provide a very powerful nonlinear modeling capability GDR training can be very slow and inefficient. In linear adaptive filtering the analog of the GDR algorithm is the leastmean- squares (LMS) algorithm. Steepest descent-based algorithms such as GDR or LMS are first order because they use only first derivative or gradient information about the training error to be minimized. To speed up the training process second order algorithms may be employed that take advantage of second derivative or Hessian matrix information. Second order information can be incorporated into MLP training in different ways. In many applications especially in the area of pattern recognition the training set is finite. In these cases block learning can be applied using standard nonlinear optimization techniques [3 4 5].

  14. Difference Splittings of Recursively Enumerable Sets

    Microsoft Academic Search

    Asat Arslanov

    1997-01-01

    Abstract We study here the degree-theoretic structure of set-theoretical splittings of recursively enumerable (r.e.) sets into difierences of r.e. sets. As a corollary we deduce that the ordering of wtt{degrees of unsolvability of difierences of r.e. sets is not a distributive semilattice and is not elementarily equivalent to the ordering of r.e. wtt{degrees of unsolvability. Keywords: Recursively enumerable sets, degrees

  15. A polymorphic representation of induction-recursion

    E-print Network

    Capretta, Venanzio

    -recursive type of trees Consider the following inductive-recursive definition: T: Set lf: T nd: (t: T)T(nds t) T nds: T N nds lf = 0 nds (nd t v) = zv(nds z) + 1 Intuitively, T is a type of trees with a restriction of the function nds on t. The function nds simply counts the nodes of a tree that are not on the first child

  16. Converting European-Pulsar-Network Data to XML

    NASA Astrophysics Data System (ADS)

    Seiradakis, J. H.; Radioti, E.

    2006-04-01

    The European Pulsar Network (EPN) format for pulsar data was discussed, reviewed and established about 10 years ago, during the EU Human Capital and Mobility project. Since then it has been extensively used in most pulsar observing facilities worldwide. It is a flexible format, able to accommodate the various data-structures of pulsar data. Its use has enhanced collaborative pulsar research and corroborated our understanding of these exotic compact stars. Three years ago it was decided to create a new tool to convert EPN-formatted data to XML (eXtensible Markup Language). The tool automatically converts EPN files to XML Physical Structure (xml) and XML Document Type Definition (dtd) files. The XML-formatted pulsar data allows the use of a wide range of analysis packages to be applied to pulsar research.

  17. XML 052159104Xc42.xml CU979-Baldwin March 18, 2003 19:50 THE RENAISSANCE OF EPISTEMOLOGY

    E-print Network

    Floridi, Luciano

    XML 052159104Xc42.xml CU979-Baldwin March 18, 2003 19:50 42 THE RENAISSANCE OF EPISTEMOLOGY luciano floridi The renaissance of epistemology between the two world wars forms a bridge between early modern directed attention away from the traditional a priori to the natural sciences. The interwar renaissance

  18. Information persistence using XML database technology

    NASA Astrophysics Data System (ADS)

    Clark, Thomas A.; Lipa, Brian E. G.; Macera, Anthony R.; Staskevich, Gennady R.

    2005-05-01

    The Joint Battlespace Infosphere (JBI) Information Management (IM) services provide information exchange and persistence capabilities that support tailored, dynamic, and timely access to required information, enabling near real-time planning, control, and execution for DoD decision making. JBI IM services will be built on a substrate of network centric core enterprise services and when transitioned, will establish an interoperable information space that aggregates, integrates, fuses, and intelligently disseminates relevant information to support effective warfighter business processes. This virtual information space provides individual users with information tailored to their specific functional responsibilities and provides a highly tailored repository of, or access to, information that is designed to support a specific Community of Interest (COI), geographic area or mission. Critical to effective operation of JBI IM services is the implementation of repositories, where data, represented as information, is represented and persisted for quick and easy retrieval. This paper will address information representation, persistence and retrieval using existing database technologies to manage structured data in Extensible Markup Language (XML) format as well as unstructured data in an IM services-oriented environment. Three basic categories of database technologies will be compared and contrasted: Relational, XML-Enabled, and Native XML. These technologies have diverse properties such as maturity, performance, query language specifications, indexing, and retrieval methods. We will describe our application of these evolving technologies within the context of a JBI Reference Implementation (RI) by providing some hopefully insightful anecdotes and lessons learned along the way. This paper will also outline future directions, promising technologies and emerging COTS products that can offer more powerful information management representations, better persistence mechanisms and improved retrieval techniques.

  19. Lecture Notes in Computer Science 1 XML-based Components for Federating Multiple

    E-print Network

    Dang Ngoc, Tuyt Trm

    on top of relational DBMSs, and client tools including a Java API and an XML query browser. The results (also called a cartridge) to store and query XML documents in a relational DBMS, an XML media- tor which query browser to for- mulate queries in XML-QL and present the results, plus a Java DOM API for submit

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

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

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

    E-print Network

    Pei, Jian

    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. We extend OLAP operations to XML data. We also develop efficient approaches to IX-Cube computation

  3. XML Publishing: Bridging Theory and Practice University of Edinburgh and Bell Laboratories

    E-print Network

    Fan, Wenfei

    XML Publishing: Bridging Theory and Practice Wenfei Fan University of Edinburgh and Bell Laboratories Abstract. Transforming relational data into XML, as known as XML publishing, is often necessary database. This paper aims to provide an overview of recent advances in XML publish- ing. We present

  4. An Extended Role Based Access Control Method for XML Documents Xiaofeng Meng and Daofeng Luo

    E-print Network

    and Intranet, Access-Control-On-XML-Properties rises as a new issue. Role-Based Access Control (RBAC these 10 years. Though RBAC is already relatively mature in the above fields, new problems occur when the fully analysis on the features of XML and RBAC. Keyword: XML, RBAC 1. Introduction XMl has been

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

  6. Recursive identification of lung parameters.

    PubMed

    Valcke, C P; Jenkins, J S; Ward, D S

    1989-06-01

    Determination of lung capacity (FRC) using insoluble gas washout or equilibrium methods is a common procedure in respiratory tests. The lung model can be extended to include multiple compartments with differing volumes and ventilation fractions. A discrete-time mathematical model of a multi-compartment lung was developed based on mass conservation laws of the gas exchange. To estimate the unknown parameters in the model from experimental data, a recursive prediction error algorithm was implemented. The design of the algorithm provides the capability to track time-varying parameters, such that the system can be monitored on-line. Determination of the model order may be as important as estimation of the parameters, especially in biological systems where little may be known about the structure. Two new criteria to distinguish between models of varying complexity, the 'minimum description length principle' and the 'accumulated prediction error', are illustrated. Theoretical studies show that these criteria yield consistent order estimates of the process. Simulations and experimental data confirm the feasibility of this approach for the estimation of lung parameters. PMID:2743753

  7. Impedence calculation with recursive folding

    NASA Astrophysics Data System (ADS)

    Ahrens, Klemens

    A method, based on the folding integral for solving the first order differential equation which mathematically describes the short circuit path, is presented. The distance to the short circuit location could be calculated with only two scan values, when no light arc errors and no compensation processes, due to band capacities, occur. It is noticed that the evaluation of input and output quantities always gives the same weight function for a time invariant linear system; this property allows the solution to be not influenced by the overoscillations of the active network. Earth capacities of the short circuited transmission line or light arc faults were taken into account through calculations performed with the error quadratic sum as optimization criterion. This structure of the distance protection algorithm allows the most important perturbation sources on the travelling waves to be considered. The recursive folding was compared with other usual algorithms in terms of secondary lines perturbation, digital processing, calculation time needs and filter properties; it is concluded that the method is fast and evolutive.

  8. The XSD-Builder Specification LanguageToward a Semantic View of XML Schema Definition

    Microsoft Academic Search

    Joseph Fong; San Kuen Cheung

    2006-01-01

    \\u000a In the present database market, XML database model is a main structure for the forthcoming database system in the Internet\\u000a environment. As a conceptual schema of XML database, XML Model has its limitation on presenting its data semantics. System\\u000a analyst has no toolset for modeling and analyzing XML system. We apply XML Tree Model (shown in Figure 2) as a

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

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

  11. Simple Recursion Relations for General Field Theories

    E-print Network

    Clifford Cheung; Chia-Hsien Shen; Jaroslav Trnka

    2015-05-20

    On-shell methods offer an alternative definition of quantum field theory at tree-level, replacing Feynman diagrams with recursion relations and interaction vertices with a handful of seed scattering amplitudes. In this paper we determine the simplest recursion relations needed to construct a general four-dimensional quantum field theory of massless particles. For this purpose we define a covering space of recursion relations which naturally generalizes all existing constructions, including those of BCFW and Risager. The validity of each recursion relation hinges on the large momentum behavior of an n-point scattering amplitude under an m-line momentum shift, which we determine solely from dimensional analysis, Lorentz invariance, and locality. We show that all amplitudes in a renormalizable theory are 5-line constructible. Amplitudes are 3-line constructible if an external particle carries spin or if the scalars in the theory carry equal charge under a global or gauge symmetry. Remarkably, this implies the 3-line constructibility of all gauge theories with fermions and complex scalars in arbitrary representations, all supersymmetric theories, and the standard model. Moreover, all amplitudes in non-renormalizable theories without derivative interactions are constructible; with derivative interactions, a subset of amplitudes is constructible. We illustrate our results with examples from both renormalizable and non-renormalizable theories. Our study demonstrates both the power and limitations of recursion relations as a self-contained formulation of quantum field theory.

  12. Recursive least-squares algorithms for fast discrete frequency domain equalization

    NASA Astrophysics Data System (ADS)

    Picchi, G.; Prati, G.

    A simple least-squares initialization algorithm (IA) is defined for use with a self-orthogonalizing equalization algorithm in the discrete frequency domain (DFD). A parallel recursive relation is formulated for updating the Kalman vector in the Kalman/Godard algorithm. The DFD is shown to be a modified LS algorithm, thus permitting an exact solution of the LS problem during the equalizer fill-up stage when the data correlation matrix is singular. The solution to the LS problem provides a basis for initialization of the DFD equalizer coefficients. The results of a simulation of on-line initialization of a DFD equalizer with a recursive initialization algorithm demonstrate a weighting capability that minimizes the effects of mean square errors of poorly estimated small-value taps.

  13. [Visible and near infrared spectroscopy combined with recursive variable selection to quantitatively determine soil total nitrogen and organic matter].

    PubMed

    Jia, Sheng-yao; Tang, Xu; Yang, Xiang-long; Li, Guang; Zhang, Jian-ming

    2014-08-01

    In the present work, recursive variable selection methods (updating both the model coefficients and effective variables during the prediction process) were applied to maintain the predictive abilities of calibration models. This work compared the performances of partial least squares (PLS), recursive PLS (RPLS) and three recursive variable selection methods, namely vari- able importance in the projection combined with RPLS (VIP-RPLS), VIP-PLS, and uninformative variable elimination combined with PLS (UVE-PLS) for the measurement of soil total nitrogen (TN) and organic matter (OM) using Vis-NIR spectroscopy. The dataset consisted of 195 soil samples collected from eight towns in Wencheng County, Zhejiang Province, China. The entire data set was split randomly into calibration set and prediction set. The calibration set was composed of 120 samples, while the prediction set included 75 samples. The best prediction results were obtained by the VIP-RPLS model. The coefficient of determination (R2) and residual prediction deviation (RPD) were respectively 0.85, 0.86 and 2.6%, 2.7% for soil TN and OM. The results indicate that VIP-RPLS is able to capture the effective information from the latest modeling sample by recursively updating the effective variables. The proposed method VIP-RPLS has the advantages of better performance for Vis-NIR prediction of soil N and OM compared with other methods in this work. PMID:25508715

  14. [Visible and near infrared spectroscopy combined with recursive variable selection to quantitatively determine soil total nitrogen and organic matter].

    PubMed

    Jia, Sheng-yao; Tang, Xu; Yang, Xiang-long; Li, Guang; Zhang, Jian-ming

    2014-08-01

    In the present work, recursive variable selection methods (updating both the model coefficients and effective variables during the prediction process) were applied to maintain the predictive abilities of calibration models. This work compared the performances of partial least squares (PLS), recursive PLS (RPLS) and three recursive variable selection methods, namely vari- able importance in the projection combined with RPLS (VIP-RPLS), VIP-PLS, and uninformative variable elimination combined with PLS (UVE-PLS) for the measurement of soil total nitrogen (TN) and organic matter (OM) using Vis-NIR spectroscopy. The dataset consisted of 195 soil samples collected from eight towns in Wencheng County, Zhejiang Province, China. The entire data set was split randomly into calibration set and prediction set. The calibration set was composed of 120 samples, while the prediction set included 75 samples. The best prediction results were obtained by the VIP-RPLS model. The coefficient of determination (R2) and residual prediction deviation (RPD) were respectively 0.85, 0.86 and 2.6%, 2.7% for soil TN and OM. The results indicate that VIP-RPLS is able to capture the effective information from the latest modeling sample by recursively updating the effective variables. The proposed method VIP-RPLS has the advantages of better performance for Vis-NIR prediction of soil N and OM compared with other methods in this work. PMID:25474936

  15. Parallelizable Approximate Solvers for Recursions Arising in Preconditioning

    E-print Network

    Abstract For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely \\Gamma \\Gamma \\Gamma \\Gamma \\Gamma \\Gamma \\Gamma Figure 1: The data dependence in the (M)ILU recursions

  16. Modular Strategies for In nite Games on Recursive Graphs ?

    E-print Network

    Parthasarathy, Madhusudan

    of the choices represent uncontrollable nondeter- minism, synthesizing a controller that supplies inputs of recursive state machines (RSMs) [1, 5]. A recursive state ma- chine consists of a set of component machines

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

  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. Optimizing Approximations of DNF Query Lineage in Probabilistic XML

    E-print Network

    Senellart, Pierre

    Optimizing Approximations of DNF Query Lineage in Probabilistic XML Asma Souihli #1 , Pierre Senellart #2 # Institut MinesTelecom; Telecom ParisTech; CNRS LTCI 75634 Paris Cedex 13, France 1 asma

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

  1. FLEXIBLE RECONCILIATION OF XML DOCUMENTS IN ASYNCHRONOUS EDITING

    E-print Network

    Boyer, Edmond

    ´erald Oster LORIA-INRIA Lorraine, Campus Scientifique, F-54506 Vandoeuvre-l`es-Nancy CEDEX, France Claudia.Ignat@loria.fr, Gerald.Oster@loria.fr Keywords: Collaborative editing, asynchronous communication, XML, conflict

  2. The TIJAH XML Information Retrieval System* Henk Ernst Blok1

    E-print Network

    Hiemstra, Djoerd

    The TIJAH XML Information Retrieval System* Henk Ernst Blok1 , Vojkan Mihajlovic1 , Georgina Ram Amsterdam, The Netherlands 1 {h.e.blok, v.mihajlovic, d.hiemstra}@utwente.nl 2 {georgina.ramirez, thijs

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

  4. Taxonomy of XML Schema Languages Using Formal Language Theory

    Microsoft Academic Search

    Makoto Murata; Dongwon Lee; Murali Mani

    2001-01-01

    On the basis of regular tree languages, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages. Our main results are as follows: (1) four classes of tree languages, namely \\

  5. Algebraic Modeling of Information Retrieval in XML Documents

    NASA Astrophysics Data System (ADS)

    Georgiev, Bozhidar; Georgieva, Adriana

    2009-11-01

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

  6. Dynamically Generated Interfaces in XML Based Architecture

    E-print Network

    Gupta, Minit

    2009-01-01

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

  7. Principal component extraction using recursive least squares learning method

    Microsoft Academic Search

    S. Bannour; M. R. Azimi-Sadjadi

    1991-01-01

    A new approach is introduced for the recursive computation of the principal components of a vector stochastic process. The neurons of a single layer perceptron are sequentially trained using a recursive least square type algorithm to extract the principal components of the input process. The approach provides a recursive way to determine the variance associated with each principal component. The

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

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

  10. On the Automatic Analysis of Recursive Security Protocols with XOR

    Microsoft Academic Search

    Ralf Ksters; Tomasz Truderung

    2007-01-01

    In many security protocols, such as group protocols, princi- pals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently, first results on the decidability of the security of such protocols have been obtained. While recursive protocols often employ operators with algebraic, security relevant prop- erties, such as the exclusive OR (XOR), the existing decision procedures,

  11. A Smart XML Access Right Controller for Mobile Applications

    Microsoft Academic Search

    Luc Bouganim; Franois Dang Ngoc; Philippe Pucheral

    Chip-Secured XML Access (C-SXA) is a versatile XML-based Access Right Controller embedded in a smart card. C-SXA can be used either to protect the privacy of on-board personal data or to control the flow of data extracted from an external source. C-SXA addresses a broad range of applications, like secure portable folders, Digital Right Management, parental control or exchange of

  12. A typed text retrieval query language for XML documents

    Microsoft Academic Search

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

    2002-01-01

    ABSTRACT XML is nowadays,considered the standard ,meta-language ,for document,markup ,and ,data representation. XML is widely employed,in Web-related applications as well as in ,database applications, and there is also a growing interest for itb y the literary community ,in order to develop ,tools for supporting document-oriented retrieval operations. The purpose ,of this paper is to show,the basic new,requirements , of this

  13. Static Analysis for Event-Based XML Processing

    Microsoft Academic Search

    Anders Mller

    Event-based processing of XML data - as exemplified by the pop - ular SAX framework - is a powerful alternative to using W3C's DOM or similar tree-based APIs. The event-based approach is particularly superior when processing large XML documents in a streaming fashion with minimal memory consumption. This paper discusses challenges for creating program analy ses for SAX applications. In

  14. XIRQL: a query language for information retrieval in XML documents

    Microsoft Academic Search

    Norbert Fuhr; Kai Grojohann

    2001-01-01

    Based on the document-centric view of XML, we present the query language XIRQL. Current proposals for XML query languages lack most IR-related features, which are weighting and ranking, relevance-oriented search, datatypes with vague predicates, and semantic relativism. XIRQL integrates these features by using ideas from logic-based probabilistic IR models, in combination with concepts from the database area. For processing XIRQL

  15. XML Dataspaces for the Coordination of Internet Agents

    Microsoft Academic Search

    Giacomo Cabri; Letizia Leonardi; Franco Zambonelli

    2001-01-01

    This article presents MARS-X, a programmable coordination architecture for autonomous and mobile Internet agents. In MARS-X, mobile Internet agents coordinate through programmable XML dataspaces, accessed by agents in a Linda-like fashion. Therefore, MARS-X enforces open and uncoupled interactions and, via XML, it offers a high degree of standard interoperability. These properties suit very well the characteristics of both mobile Internet

  16. Recursion and the Axiom of Infinity

    E-print Network

    Antonio Leon

    2012-01-27

    This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the successively defined nested sets. The consequence is a contradiction involving the consistency of w-order and then that of the Axiom of Infinity.

  17. MULTIPLE CONCURRENT RECURSIVE LEAST SQUARES IDENTIFICATION

    Microsoft Academic Search

    Edward Wilson; David W. Sutter; Robert W. Mah

    2004-01-01

    A new algorithm, multiple concurrent recursive least squares (MCRLS) is developed for parameter estimation in a system having a set of governing equations describing its behavior that cannot be manipulated into a form allowing (direct) linear regression of the unknown parameters. In this algorithm, the single nonlinear problem is segmented into two or more separate linear problems, thereby enabling the

  18. MULTIPLE CONCURRENT RECURSIVE LEAST SQUARES IDENTIFICATION

    Microsoft Academic Search

    Edward Wilson; David W. Sutter; Robert W. Mah

    A new algorithm, multiple concurrent recursive least squares (MCRLS) is developed for parameter estimation in a system having a set of governing equations describing its behavior that cannot be manipulated into a form allowing (direct) linear regression of the unknown parameters. In this algorithm, the single nonlinear problem is segmented into two or more separate linear problems, thereby enabling the

  19. Recursive Array Layouts and Fast Matrix Multiplication

    Microsoft Academic Search

    Siddhartha Chatterjee; Alvin R. Lebeck; Praveen K. Patnala; Mithuna Thottethodi

    2002-01-01

    The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditional column-major or row-major array layouts to incur high variability in memory system performance as matrix size varies. This paper investigates the use of recursive array layouts to improve performance and reduce variability. Previous work on

  20. Supporting the Learning of Recursive Problem Solving.

    ERIC Educational Resources Information Center

    Bhuiyan, Shawkat; And Others

    1994-01-01

    Presents the PETAL (Programming Environment Tool) learning environment, and discusses a study where one group of students used PETAL and another used a standard LISP environment to learn recursion. The PETAL group performed better during the learning period and on a written posttest. Theorizes why PETAL may be responsible for improved learning of

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

  2. Avoiding Pitfalls When Learning Recursive Theories

    Microsoft Academic Search

    R. Mike Cameron-jones; J. Ross Quinlan

    1993-01-01

    Learning systems that express theories in firstorderlogic must ensure that the theories areexecutable and, in particular, that they do notlead to infinite recursion. This paper presentsa heuristic method for preventing infinite recursionin the (multi-clause) definition of arecursive relation. The method has been implementedin the latest version of foil, but couldalso be used with any learning method thatgrows clauses from ground

  3. 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 Wright State University Yuqing Wu School of Informatics Indiana University Abstract We present ACXESS (Access Control for XML with En- hanced Security Specifications), a system for specifying and enforcing

  4. Realization Of Algebraic Processor For XML Documents Processing

    SciTech Connect

    Georgiev, Bozhidar [Fac. Computer Systems and Control Technical University of Sofia, TU-Sofia, Sofia (Bulgaria); Georgieva, Adriana [Fac. Applied Mathematics and Informatics Technical University of Sofia, TU-Sofia, Sofia (Bulgaria)

    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.

  5. Realization Of Algebraic Processor For XML Documents Processing

    NASA Astrophysics Data System (ADS)

    Georgiev, Bozhidar; Georgieva, Adriana

    2010-10-01

    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.

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

  7. Join minimization in XML-to-SQL translation: an algebraic approach

    Microsoft Academic Search

    Murali Mani; Song Wang; Daniel J. Dougherty; Elke A. Rundensteiner

    2006-01-01

    Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our translator maps the XML query to one or more SQL queries, (b) the relational engine translates an SQL query to a relational algebra plan, (c) the relational engine executes the

  8. XML Index Recommendation with Tight Optimizer Coupling Technical Report CS-2007-22

    E-print Network

    Aboulnaga, Ashraf

    XML Index Recommendation with Tight Optimizer Coupling Technical Report CS-2007-22 July 11, 2007. An important problem that needs to be solved for these systems is how to choose the best set of indexes for a given workload. In this paper, we present an XML Index Advisor that solves this XML index recommendation

  9. AC-Index: An Efficient Adaptive Index for Branching XML Queries

    E-print Network

    New South Wales, University of

    AC-Index: An Efficient Adaptive Index for Branching XML Queries Bo Zhang1 Wei Wang2 Xiaoling Wang1 2052, Australia #12;Abstract Query-adaptive XML indexing has been proposed and shown to be an efficient, existing adaptive index suffers from a number of issues, such as lack of support for general types of XML

  10. XL: an XML programming language for web service specification and composition

    Microsoft Academic Search

    Daniela Florescu; Andreas Grnhagen; Donald Kossmann

    2002-01-01

    We present an XML programming language specially designed for the implementation of Web services. XL is portable and fully compliant with W3C standards such as XQuery, XML Protocol, and XML Schema. One of the key features of XL is that it allows programmers to concentrate on the logic of their application. XL provides high-level and declarative constructs for actions which

  11. WPI-CS-TR-02-24 July 2002 XAT: XML Algebra for the Rainbow System

    E-print Network

    WPI-CS-TR-02-24 July 2002 XAT: XML Algebra for the Rainbow System by Xin Zhang Elke A Department 100 Institute Road, Worcester, Massachusetts 01609-2280 #12; XAT: XML Algebra for the Rainbow Rainbow, an XML data management system, that at its core has an al- gebra based XQuery query engine

  12. ONTOLOGY MAPPING BETWEEN PSLAND XML-BASED STANDARDS FOR PROJECT SCHEDULING

    E-print Network

    Stanford University

    ONTOLOGY MAPPING BETWEEN PSLAND XML- BASED STANDARDS FOR PROJECT SCHEDULING Jinxing Cheng1 , Pooja Trivedi2 and Kincho H. Law3 ABSTRACT Many ontology standards, such as STEP, ifcXML, aecXML and PSL, have been proposed for the A/E/C industries. Different ontologies exist and they have many advantages

  13. GRAPH-BASED RULES FOR XML DATA CONVERSION TO OWL ONTOLOGY

    E-print Network

    Paris-Sud XI, Universit de

    GRAPH-BASED RULES FOR XML DATA CONVERSION TO OWL ONTOLOGY Christophe CRUZ, Christophe Nicolle.cruz, cnicolle}@u-bourgogne.fr Keywords: Ontology population, ontology enrichment, OWL ontology, XML data, RDF ontology from XML data based on graph-based rules. These rules are defined in order to populate

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

  15. Timing Your Migration to XML There is no compelling reason to leave EDI

    E-print Network

    to small and medium enterprises to the end-user creating XML documents in their word processor enabled tool. XML appeals to users across the entire spectrum of enterprises from large enterprises and retrofit them to your EDI environment. You can transfer information from your enterprise systems to XML

  16. Common model and infrastructure for application of XML within the automation domain

    Microsoft Academic Search

    Martin WOLLSCHLAEGER; P. Wenzel

    2005-01-01

    Nowadays, the use of XML as a description language has become state of the art within the automation and control domain. Use cases and application scenarios are manifold, resulting in heterogeneous XML document structures. However, a common basic model for XML applications suitable for the automation domain is still lacking. This paper describes requirements and principle structures for such a

  17. Collaborative Writing of XML Documents Hala Skaf-Molli, Pascal Molli, and Charbel Rahhal

    E-print Network

    Paris-Sud XI, Universit de

    Collaborative Writing of XML Documents Hala Skaf-Molli, Pascal Molli, and Charbel Rahhal LORIA document. People can be distributed in time, in place and across organizations. They can share writing different kinds of documents. In this paper, we focus on collaborative writing of XML documents. XML

  18. XRel: a path-based approach to storage and retrieval of XML documents using relational databases

    Microsoft Academic Search

    Masatoshi Yoshikawa; Toshiyuki Amagasa; Takeyuki Shimura; Shunsuke Uemura

    2001-01-01

    This paper describes XRel, a novel approach to storage and retrieval of XML documents using relational databases. In this approach, an XML document is decomposed into nodes based on its tree structure, and stored in relational tables according to the node type, with path information from the root to each node. XRel enables us to store XML documents using a

  19. Efficient XML-to-SQL Query Translation: Where to Add the Intelligence?

    E-print Network

    Pennsylvania, University of

    Efficient XML-to-SQL Query Translation: Where to Add the Intelligence? Rajasekar Krishnamurthy of queries generated by XML to SQL translation. We first show that published XML-to-SQL query translation algo- rithms are suboptimal in that they often trans- late simple path expressions into complex SQL

  20. Mapping XML to a Wide Sparse Table Liang Jeff Chen2

    E-print Network

    Wang, Deli

    normalization lies at the foundation of query processing in relational database systems (RDBMSs). It not only.shamgunov@gmail.com Abstract-- XML is commonly supported by SQL database systems. However, existing mappings of XML to tables existing techniques for the target use cases. I. INTRODUCTION XML is commonly supported by SQL database

  1. Application of XML tools for enterprise-wide RBAC implementation tasks

    Microsoft Academic Search

    Ramaswamy Chandramouli

    2000-01-01

    The use of Extensible Markup Language (XML) and its associated APIs, for information modeling and information interchange applications is being actively explored by the reseach community. In this paper we develop an XML Document Type Definition (DTD) for representing the schema of a Role-based Access Control (RBAC) Model and a conforming XML document containing the actual RBAC-based access control data

  2. The XML Framework and Its Implications for Corpus Access and Use

    Microsoft Academic Search

    Nancy Ide

    2000-01-01

    The eXtensible Markup Language (XML) (Bray, et al., 1998) is the emerging standard for data representation and exchange on the World Wide Web. The XML Framework includes very powerful mechanisms for accessing and manipulating XML documents that are likely to significantly impact the way annotated corpora are created and accessed. This paper outlines a few of the possibilities.

  3. Consciousness as recursive, spatiotemporal self-location

    Microsoft Academic Search

    Frederic Peters

    2010-01-01

    At the phenomenal level, consciousness arises in a consistently coherent fashion as a singular, unified field of recursive\\u000a self-awareness (subjectivity) with explicitly orientational characteristicsthat of a subject located both spatially and temporally\\u000a in an egocentrically-extended domain. Understanding these twin elements of consciousness begins with the recognition that\\u000a ultimately (and most primitively), cognitive systems serve the biological self-regulatory regime in which

  4. Recursively indexed differential pulse code modulation

    NASA Technical Reports Server (NTRS)

    Sayood, Khalid; Na, Sangsin

    1992-01-01

    The performance of a differential pulse code modulation (DPCM) system with a recursively indexed quantizer (RIQ) under various conditions, with first order Gauss-Markov and Laplace-Markov sources as inputs, is studied. When the predictor is matched to the input, the proposed system performs at or close to the optimum entropy constrained DPCM system. If one is willing to accept a 5 percent increase in the rate, the system is very forgiving of predictor mismatch.

  5. Decidability and Recursive Languages Let L ( -{ })

    E-print Network

    Lyuu, Yuh-Dauh

    (x) = f(x). · We call f a recursive functiona if such an M exists. aKurt G¨odel (1931). c 2010 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 45 #12;Kurt G¨odel (1906­1978) c 2010 Prof. Yuh-Dauh Lyuu function (G¨odel), calculus (Church), formal language (Post), assembly language-like RAM (Shepherdson

  6. Weighted Laplacians, cocycles and recursion relations

    NASA Astrophysics Data System (ADS)

    Krasnov, Kirill; Scarinci, Carlos

    2013-11-01

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

  7. Development Life Cycle and Tools for XML Content Models

    SciTech Connect

    Kulvatunyou, Boonserm [ORNL; Morris, Katherine [National Institute of Standards and Technology (NIST); Buhwan, Jeong [POSTECH University, South Korea; Goyal, Puja [National Institute of Standards and Technology (NIST)

    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. A Cost-Based Approach for Converting Relational Schemas to XML University of Iowa Technical Report 05-02

    Microsoft Academic Search

    Ramon Lawrence

    Converting relational database schemas to XML schemas is important as applica- tions originally written to manipulate relational data are converted to XML-enabled applications. Most research has focused on the challenging problem of e-ciently ex- tracting relational data through XML views. However, another important challenge is determining good XML schemas from existing relational schemas, so that applica- tions may be migrated

  10. XML in an Adaptive Framework for Instrument Control

    NASA Technical Reports Server (NTRS)

    Ames, Troy J.

    2004-01-01

    NASA Goddard Space Flight Center is developing an extensible framework for instrument command and control, known as Instrument Remote Control (IRC), that combines the platform independent processing capabilities of Java with the power of the Extensible Markup Language (XML). A key aspect of the architecture is software that is driven by an instrument description, written using the Instrument Markup Language (IML). IML is an XML dialect used to describe interfaces to control and monitor the instrument, command sets and command formats, data streams, communication mechanisms, and data processing algorithms.

  11. Efficient Implementation of XML Security for Mobile Devices

    Microsoft Academic Search

    Jaakko Kangasharju

    2007-01-01

    The population of mobile devices capable of participating in the Internet has increased dramatically in the last few years. To include this population into the Web service world requires support for the most important features, in particular security at the message level. This paper covers our approach to implement XML security specifications on mobile devices that allows efficient single-pass processing

  12. Capturing Agent Autonomy in Roles and XML Gerhard Wei

    E-print Network

    Rovatsos, Michael

    , polymorphism, etc. Since some years a subfield is emerg- ing in software engineering, known as agentCapturing Agent Autonomy in Roles and XML Gerhard Wei Institut fur Informatik, TUM-oriented software en- gineering is how the kind and extent of autonomy owned by computational agents can

  13. Nonius: Implementing a DRM Extension to an XML Browser

    Microsoft Academic Search

    Olli Pitknen; Ville Saarinen; Jari Anttila; Petri Lauronen; Mikko Vlimki

    2004-01-01

    The paper describes experiences, ideas, and problems that were discovered while developing a digital rights management (DRM) extension to an XML browser. The supported rights description language is ODRL. The most significant implemented features are restrictions related to an individual, time, and usage-counts. On the other hand, some interesting features were intentionally left out. They include for example, aspect and

  14. Using XML, XSLT, and CSS in a Digital Library.

    ERIC Educational Resources Information Center

    Cole, Timothy W.; Mischo, William H.; Ferrer, Robert; Habing, Thomas G.

    2000-01-01

    Describes the evolving information technologies employed at the Digital Library Initiative (DLI-I) Testbed of full-text journal articles at the University of Illinois at Urbana-Champaign. Examines how XML, XSLT, and CSS can be used in a digital library application and discusses document representation and transmission, metadata schema, and

  15. XML Web Services Automation: A Software Engineering Approach

    Microsoft Academic Search

    Nicholas Nicoloudis; Christine Mingins

    2002-01-01

    XML Web services are a mechanism for exposing program functionality over the Web, typically to other services. In this paper we analyse the interactions of standalone applications and Web services and investigate modeling role-based interactions. From this investigation, we engineer a tool that automates the process of generating Web services based on an application's set of compliant interface primitives. These

  16. Xandy: A Scalable Change Detection Technique for Ordered XML Documents

    E-print Network

    Bhowmick, Sourav S.

    forms. The first is existence. XML pages exhibit varied longevity pattern. The second is structure trees and unordered trees. An ordered tree is one in which both the ancestor relationships and the left-to-right ordering among siblings are significant. An unordered tree is one in which only ancestor relationships

  17. The effect of granularity and order in XML element retrieval

    Microsoft Academic Search

    Nils Pharo

    2008-01-01

    The article presents an analysis of the effect of granularity and order in an XML encoded collection of full text journal articles. Two-hundred and eighteen sessions of searchers performing simulated work tasks in the collection have been analysed. The results show that searchers prefer to use smaller sections of the article as their source of information. In interaction sessions during

  18. An XML Index Advisor for DB2 Iman Elghandour

    E-print Network

    Aboulnaga, Ashraf

    , the index recommendation process, and the effectiveness of the recom- mended indexes. Categories and Subject its index selection and cost estimation capabilities, and provides a solid and easy way for ensuring of the XML index recommendation process. More details are avail- able in [4]. In Section 3, we describe our

  19. Fast XML Document Filtering by Sequencing Twig Patterns

    E-print Network

    Moon, Bongki

    as an increasingly important tool for e-commerce and Internet applications. In a typical pub-sub system, subscribed. INTRODUCTION Publish-subscribe (pub-sub) systems play an important role in e-commerce and Internet applications13 Fast XML Document Filtering by Sequencing Twig Patterns JOONHO KWON Advanced Institutes

  20. DSD: A Schema Language for XML Nils Klarlund

    E-print Network

    Schwartzbach, Michael I.

    DSD: A Schema Language for XML Nils Klarlund AT&T LabsResearch klarlund@research.att.com Anders. In the present paper, we introduce the DSD (Document Structure Description) notation as our bid on how to meet modern browsers. Finally, we include a simple technique for evolv- ing DSD documents through selective

  1. : A Web Service for the Conversion of XML Standards

    Microsoft Academic Search

    Erik Wstner; Peter Buxmann; Sven Schade

    2005-01-01

    This paper examines how open standards and open source software can serve as a basis for developing modern solutions for electronic data interchange (EDI). In recent years, various XML vocabularies for defining business documents (e.g., invoices and purchase orders) have emerged. In many cases, the involved business partners cannot agree on a jointly used standard, because their individual requirements for

  2. High-Performance Complex Event Processing over XML Streams

    E-print Network

    attention has been given to high-performance sys- tems that are capable of complex event processing (CEPHigh-Performance Complex Event Processing over XML Streams Barzan Mozafari UCLA 420 Westwood Plaza for XSeq queries. Our extensive experiments indicate that XSeq brings outstanding performance to CEP appli

  3. High-Performance Complex Event Processing over XML Streams

    E-print Network

    Zaniolo, Carlo

    attention has been given to delivering high-performance systems that are capable of complex event processingHigh-Performance Complex Event Processing over XML Streams Barzan Mozafari UCLA 420 Westwood Plaza processing data having a simple structure, and are otherwise limited in their ability to efficiently support

  4. Sequencing XML Data and Query Twigs for Fast Pattern Matching

    E-print Network

    Moon, Bongki

    Sequencing XML Data and Query Twigs for Fast Pattern Matching PRAVEEN RAO and BONGKI MOON on the set of sequences in the database and performing a series of refinement phases that we have developed of the article. Authors' address: P. Rao and B. Moon, Department of Computer Science, University of Arizona, AZ

  5. XDuce: A Typed XML Processing Language (Preliminary Report)

    E-print Network

    Ghelli, Giorgio

    ming language, XDuce (pronounced ``transduce''). XDuce is a tree transforma tion language, similar in spirit to mainstream functional languages but special ized to the domain of XML processing. Its novel on the seven children so that they can be regarded as three ``entries,'' each of which consists of fields

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

  7. Comparative analysis of reporting mechanisms based on XML technology

    Microsoft Academic Search

    Dariusz Krl; Jacek Oleksy

    Comparative analysis of reporting mechanisms based on XML technology is presented in the paper. The analysis was carried out as the part of the process of selecting and implementing of reporting mechanisms for a cadastre information system. The reports were designed for two versions of the system, i.e. for the internet system based on PHP technology and the fat client

  8. Research on content retrieval of flash animation based on XML

    Microsoft Academic Search

    Ni Yinghua; Yuan Liyong; Ma Yongjin; Jin Bingyao

    2010-01-01

    This paper proposes a program of flash content retrieval based on XML. The paper describes the retrieval model, focusing on analysis of the two areas in which flash content retrieval is achieved: (1)SWF file parsing and SWFXML document generation; (2)Construction of the object characteristic tree according to the retrieval requirement, and the exportation of target file and content by calculating

  9. Designing and Implementing OLAP Systems from XML Documents

    Microsoft Academic Search

    Franck Ravat; Olivier Teste; Ronan Tournier; Gilles Zurfluh

    There has been a lot of research on OLAP (On-Line Analytical Pro- cessing) systems during the past decade. These systems allow decision makers to improve their decisions. Despite numerous multidimensional conceptual models, none tackle the problem of analysing data extracted from text-rich XML documents. These documents represent a lot of unavailable information for actual OLAP sys- tems. Moreover, the implementation

  10. RBAC POLICIES IN XML FOR X.509 BASED PRIVILEGE MANAGEMENT

    E-print Network

    Kent, University of

    1 RBAC POLICIES IN XML FOR X.509 BASED PRIVILEGE MANAGEMENT D.W.Chadwick, A. Otenko University. There is a brief description of the X.509 privilege management model, and how it can be used to implement RBAC and the Open Group's AZN API. Key words: X.509, Attribute Certificates, RBAC, LDAP, Role Based Access Controls

  11. RBAC Policies in XML for X.509 Based Privilege Management

    Microsoft Academic Search

    David W. Chadwick; Alexander Otenko

    2002-01-01

    This paper describes a role based access control policy template for use by privilege management infrastructures where the roles are stored as X.509 Attribute Certificates in an LDAP directory. There is a brief description of the X.509 privilege management model, and how it can be used to implement RBAC. Policies that conform to the template are written in XML, and

  12. XCES: An XML-based Encoding Standard for Linguistic Corpora

    Microsoft Academic Search

    Nancy Ide; Patrice Bonhomme; Laurent Romary

    2000-01-01

    The Corpus Encoding Standard (CES) is a part of the EAGLES Guidelines developed by the Expert Advisory Group on Language Engineering Standards (EAGLES) that provides a set of encoding standards for corpus-based work in natural language processing applications. We have instantiated the CES as an XML application called XCES, based on the same data architecture comprised of a primary encoded

  13. Integration and Efficient Lookup of Compressed XML Accessibility Maps

    E-print Network

    Fu, Ada Waichee

    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1 #12; Technical Report The Chinese University of Hongkong 4.2 ICAM Construction for a Unit Region . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 8 Conclusion 29 9 Proof of Theorem 2, 3 & 4 30 2 #12; Technical Report The Chinese University access control mechanism for XML data still remains an open issue [15]. The models proposed by [3, 7

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

  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. Semiparametric inference in mixture models with predictive recursion marginal likelihood

    Microsoft Academic Search

    Ryan Martin; Surya T. Tokdar

    2011-01-01

    Predictive recursion is an accurate and computationally efficient algorithm for nonparametric estimation of mixing densities in mixture models. In semiparametric mixture models, however, the algorithm fails to account for any uncertainty in the additional unknown structural parameter. As an alternative to existing profile likelihood methods, we treat predictive recursion as a filter approximation to fitting a fully Bayes model, whereby

  17. Efficient recursive structures for forward and inverse discrete cosine transform

    Microsoft Academic Search

    Che-Hong Chen; Bin-Da Liu; Jar-Ferr Yang; Jiun-Lung Wang

    2004-01-01

    In this paper, efficient architectures for realizing the recursive discrete cosine transform (DCT) and the recursive inverse DCT (IDCT) are proposed. By respectively folding the inputs of the DCT and the outputs of the IDCT, efficient formulations of the DCT and IDCT are derived to construct the transform kernels. The data throughput per transformation is twice that of the existing

  18. Automatic Verification of Recursive Procedures with one Integer Parameter

    E-print Network

    ?ayr, Richard

    ­free processes (BPA) have been used for dataflow­analysis in recursive procedures with applications in optimizing compilers [6]. We introduce a more refined model called BPA(ZZ) that can model not only recursive dependen be tested against conditions expressible in Presburger­arithmetic. This new and more expressive model can

  19. Recursion filters for digital processing of potential field data

    Microsoft Academic Search

    B. K. Bhattacharyya

    1976-01-01

    Zero-phase two-dimensional recursive filters, with a specified frequency domain response, have been designed for processing potential field data. In the case of second vertical derivative filters, it is possible to use the rational approximation of symmetrical functions of a single variable for the design of a short recursive filter. The filter so designed has an excellent response in the frequency

  20. Semantics and Compilation of Recursive Sequential Streams in 8

    Microsoft Academic Search

    Jean-louis Giavitto; Dominique De Vito

    1997-01-01

    Recursive definition of streams (infinite lists of values) have been proposed as a fundamental programming structure in various fields. A problem is to turn such expressive recursive definitions into an efficient imperative code for their evaluation. One of the main approach is to re- strict the stream expressions to interpret them as a temporal sequence of values. Such sequential stream

  1. Static Analysis of Accessed Regions in Recursive Data Structures

    E-print Network

    Rugina, Radu

    Static Analysis of Accessed Regions in Recursive Data Structures Stephen Chong and Radu Rugina. This paper presents an interprocedural heap analysis that computes information about how programs access regions within recursive data structures, such as sublists within lists or subtrees within trees

  2. Static Analysis of Accessed Regions in Recursive Data Structures

    E-print Network

    Chong, Stephen

    Static Analysis of Accessed Regions in Recursive Data Structures Stephen Chong and Radu Rugina. This paper presents an inter-procedural heap analysis that computes information about how programs access regions within recursive data structures, such as sublists within lists or subtrees within trees

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

  4. THE COMPLEXITY OF RECURSIVE SPLITTINGS OF RANDOM SETS

    E-print Network

    Stephan, Frank

    THE COMPLEXITY OF RECURSIVE SPLITTINGS OF RANDOM SETS KENG MENG NG, ANDR ?? E NIES AND FRANK STEPHAN Abstract. It is investigated how much information of a random set can be preserved if one splits the random of the two parts of each given recursive splitting. Here our notion of a ``part'' of a set Z # N

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

  6. Recursive structure of noncausal Gauss-Markov random fields

    Microsoft Academic Search

    Jos M. F. Moura; Nikhil Balram

    1992-01-01

    An approach is developed for noncausal Gauss-Markov random fields (GMRFs) that enables the use of recursive procedures while retaining the noncausality of the field. Recursive representations are established that are equivalent to the original field. This is achieved by first presenting a canonical representation for GMRFs that is based on the inverse of the covariance matrix, which is called the

  7. 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 describe fractals through a re-drawing rule. For instance, consider the rule that replaces a straight line the Koch snowflake. 1 #12;We can write this rule as a recursive function: drawBump(i) { if (i==0) { draw

  8. Recursive speed and parameter estimation for induction machines

    Microsoft Academic Search

    Miguel Vdlez-Reyes; K. Minami; G. C. Verghese

    1989-01-01

    A hierarchical recursive algorithm is presented to estimate the rotor speed and parameters of the induction machine on the basis of measurements of the stator voltages and currents. Due to its recursive structure, this algorithm has the potential to be used for online estimation and adaptive control. The algorithm is designed using two linear regression models derived from the machine

  9. The cut-tree of large recursive trees Jean Bertoin

    E-print Network

    Paris-Sud XI, Universit de

    The cut-tree of large recursive trees Jean Bertoin Abstract Imagine a graph which is progressively destroyed by cutting its edges one after the other in a uniform random order. The so-called cut-tree records with a natural probability mass. In this work, we show that the cut-tree of a random recursive tree of size n

  10. 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 Posts seminal Real Programmers Dont 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.

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

  12. PRIX: Indexing And Querying XML Us-ing Pr?ufer Sequences

    Microsoft Academic Search

    P. Rao; B. Moon

    2003-01-01

    We propose a new way of indexing XML documents and pro-cessing twig patterns in an XML database. Every XML docu-ment in the database can be transformed into a sequence of labels by Pr ufer's method that constructs a one-to-one corre-spondence between trees and sequences. During query pro-cessing, a twig pattern is also transformed into its Pr ufer se-quence. By performing

  13. Renda-RX: A Benchmark for Evaluating XML-Relational Database System

    Microsoft Academic Search

    Xiao Zhang; Kuicheng Liu; Li Zou; Xiaoyong Du; Shan Wang

    \\u000a This paper proposes a new benchmark, Renda-RX, for evaluating XML-Relational database management systems which can store and\\u000a process both relational and XML data. To our knowledge, it is the first time to consider a performance benchmark on mixed\\u000a data, although there are TPC series for relational data, and XBench, XMark, TPoX etc. for XML data. We summarize the requirements\\u000a of

  14. Recursive and Explicit Rules: How Can We Build Student Algebraic Understanding?

    ERIC Educational Resources Information Center

    Lannin, John K.; Barker, David D.; Townsend, Brian E.

    2006-01-01

    Differing perspectives have been offered about student use of recursive and explicit rules. These include: (a) promoting the use of explicit rules over the use of recursive rules, and (b) encouraging student use of both recursive and explicit rules. This study sought to explore students' use of recursive and explicit rules by examining the

  15. Reasoning about Assignments in Recursive Data Structures

    NASA Astrophysics Data System (ADS)

    Tamalet, Alejandro; Madlener, Ken

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

  16. On Multi-step BCFW Recursion Relations

    E-print Network

    Feng, Bo; Zhou, Kang

    2015-01-01

    In this paper, we extensively investigate the new algorithm known as the multi-step BCFW recursion relations. Many interesting mathematical properties are found and crucially, with these aspects understood, one can find a systematic process to complete the calculation after finite, definite steps and reach the correct answer, without recourse to any specific knowledge from field theories, except mass dimension and helicities. This process is constituted of the pole concentration and inconsistency elimination. Terms that survive inconsistency elimination cannot be determined by the new algorithm. They include polynomials and their generalizations, which are new mathematical objects to be explored. Afterwards, we apply this process to Standard Model plus gravity to illustrate both of its power and limitation. Having a systematic algorithm, we also tentatively discuss how to improve its efficiency by reducing its steps, which will be the next major topic.

  17. On Multi-step BCFW Recursion Relations

    E-print Network

    Bo Feng; Junjie Rao; Kang Zhou

    2015-04-23

    In this paper, we extensively investigate the new algorithm known as the multi-step BCFW recursion relations. Many interesting mathematical properties are found and crucially, with these aspects understood, one can find a systematic process to complete the calculation after finite, definite steps and reach the correct answer, without recourse to any specific knowledge from field theories, except mass dimension and helicities. This process is constituted of the pole concentration and inconsistency elimination. Terms that survive inconsistency elimination cannot be determined by the new algorithm. They include polynomials and their generalizations, which are new mathematical objects to be explored. Afterwards, we apply this process to Standard Model plus gravity to illustrate both of its power and limitation. Having a systematic algorithm, we also tentatively discuss how to improve its efficiency by reducing its steps, which will be the next major topic.

  18. Analysing complexity of XML Schemas in geospatial web services

    E-print Network

    Tamayo, Alain; Huerta, Joaqun

    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.

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

    NASA Astrophysics Data System (ADS)

    Zhang, Zhen Yu

    2012-01-01

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

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

    NASA Astrophysics Data System (ADS)

    Zhang, Zhen Yu

    2011-12-01

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

  1. Online recursive independent component analysis for real-time source separation of high-density EEG.

    PubMed

    Hsu, Sheng-Hsiou; Mullen, Tim; Jung, Tzyy-Ping; Cauwenberghs, Gert

    2014-01-01

    Online Independent Component Analysis (ICA) algorithms have recently seen increasing development and application across a range of fields, including communications, biosignal processing, and brain-computer interfaces. However, prior work in this domain has primarily focused on algorithmic proofs of convergence, with application limited to small `toy' examples or to relatively low channel density EEG datasets. Furthermore, there is limited availability of computationally efficient online ICA implementations, suitable for real-time application. This study describes an optimized online recursive ICA algorithm (ORICA), with online recursive least squares (RLS) whitening, for blind source separation of high-density EEG data. It is implemented as an online-capable plugin within the open-source BCILAB (EEGLAB) framework. We further derive and evaluate a block-update modification to the ORICA learning rule. We demonstrate the algorithm's suitability for accurate and efficient source identification in high density (64-channel) realistically-simulated EEG data, as well as real 61-channel EEG data recorded by a dry and wearable EEG system in a cognitive experiment. PMID:25570830

  2. Context Matters: An Analysis of Assessments of XML Documents

    Microsoft Academic Search

    Nils Pharo; Ragnar Nordlie

    2005-01-01

    \\u000a The paper analyses searchers assessments of usefulness and specificity on different levels of granularity in XML-coded documents.\\u000a Documents are assessed on 10 usefulness\\/specificity combinations and on the granularity levels of article, section, and subsection.\\u000a Overlapping judgements show a remarkable lack of consistency between searchers. There is an inverse relationship between articles\\u000a and sections both in the assessment of specificity and

  3. Optimistic Synchronization of Cooperative XML Authoring Using Tunable Transaction Boundaries

    Microsoft Academic Search

    Francis Gropengieer; Kai-Uwe Sattler

    2010-01-01

    AbstractDesign applications, e.g., CAD or media produc- tion, often require multiple users to work cooperatively on shared data, e.g., XML documents. Using explicit transactions in such environments is difficult, because designers usually do not want to consider transactions or ACID. However, applying,transactions in order to control visibility of changes or specify recovery units, is reasonable, but determining trans- action boundaries,must,be

  4. Using XML and XSLT to process and render online journals

    Microsoft Academic Search

    Timothy W. Cole; William H. Mischo; Thomas G. Habing; Robert H. Ferrer

    2001-01-01

    Describes an approach to the processing and presentation of online full-text journals that utilizes several evolving information technologies, including extensible markup language (XML) and extensible stylesheet language transformations (XSLT). Discusses major issues and trade-offs associated with these technologies, and also specific lessons learned from our use of these technologies in the Illinois Testbed of full-text journal articles. Focuses especially on

  5. Enhancing composite digital documents using XML-based standoff markup

    Microsoft Academic Search

    Peter L. Thomas; David F. Brailsford

    2005-01-01

    Document representations can rapidly become unwieldy if they try to encapsulate all possible document properties, ranging from abstract structure to detailed rendering and layout.We present a composite document approach wherein an XML-based document representation is linked via a 'shadow tree' of bi-directional pointers to a PDF representation of the same document. Using a two-window viewer any material selected in the

  6. LINQ: reconciling object, relations and XML in the .NET framework

    Microsoft Academic Search

    Erik Meijer; Brian Beckman; Gavin M. Bierman

    2006-01-01

    Introduction Many software applications today need to handle data from di erent data models; typically objects from the host programming language along with the re-lational and XML data. The ROX impedance mismatch makes programs awkward to write and hard to maintain. The. NET Language-Integrated Query (LINQ) framework, proposed for the next release of the. NET framework, ap-proaches this problem by

  7. OrientX Version 2.5 IDKE XML

    E-print Network

    -Tree ElementNode ElementNode Item BP-Tree : ElementNode DataSet Dataset DocumentIndex #12; Close PathIndex CreatePathIndex(int datasetID, int docID) XML Schema datasetID dataset docID doc 0 CreatePathIndexint datasetID, int docID, DTDNodeCode &eID datasetID dataset docID doc

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

  9. An XML-Powered Framework for Building Adaptive Software Components

    Microsoft Academic Search

    Jinyu Wang

    As application developers move toward building component-based web service applications, the traditional tools and development models turn out insufficient to meet the new requirements from rapid evolution due to the speed of the Internet. This paper presents an XML-powered framework designed to build adaptive software components, in order to relieve developers from low-level implementation tasks and concentrate on the processing

  10. A Review of XML-compliant User Interface Description Languages

    Microsoft Academic Search

    Nathalie Souchon; Jean Vanderdonckt

    2003-01-01

    A review of XML-compliant user interface description lan- guages is produced that compares a significant selection of various lan- guages addressing different goals, such as multi-platform user interfaces, device-independence, content delivery, and user interfaces virtually de- fined. There has been a long history and tradition to attempt to capture the essence of user interfaces at various levels of abstraction for

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

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

    NASA Astrophysics Data System (ADS)

    Chen, Gang

    2012-07-01

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

  13. Optical Ethernet span protection using an XML-based multiprotocol framework

    NASA Astrophysics Data System (ADS)

    Martini, Barbara; Baroncelli, Fabio; Cugini, Filippo; Valcarenghi, Luca; Castoldi, Piero

    2004-09-01

    Optical Access Networks based on Optical Ethernet (OE) architectures represent a simple and low cost solution for eliminating the bandwidth bottleneck between high speed Local Area Networks and optical Metropolitan Area Network core. Transparent optical Network Elements (NE), e.g. optical switches, can be successfully introduced in current OE networks to provide an adequate level of resilience and reduce the overall network cost. However network control and management plane must be extended to administrate the optical network elements. This paper shows a hardware and software implementation of a 1:1 optical span protection scheme for OE network based on optical switches triggered by failure detection. Detection is obtained by three different methods based either on hardware or software mechanisms. Link state is updated both at the switch controller and control manager through, respectively, Link Management Protocol (LMP) and Simple Network Management Protocol (SNMP) messaging implemented by a novel Extensible Markup Language (XML) Multi Protocol Framework (XMPF). Experimental results show that a recovery time in the millisecond range can be achieved and network state is correctly synchronized in all the network elements.

  14. From implicit to recursive equations Joris van der Hoeven

    E-print Network

    Boyer, Edmond

    From implicit to recursive equations Joris van der Hoeven LIX, CNRS ?cole polytechnique 91128 Palaiseau Cedex France Email: vdhoeven@lix.polytechnique.fr Web: http://lix.polytechnique.fr/~vdhoeven April

  15. Semiparametric inference in mixture models with predictive recursion marginal likelihood

    E-print Network

    Martin, Ryan

    2011-01-01

    Predictive recursion is an accurate and computationally efficient algorithm for nonparametric estimation of mixing densities in mixture models. In semiparametric mixture models, however, the algorithm fails to account for any uncertainty in the additional unknown structural parameter. As an alternative to existing profile likelihood methods, we treat predictive recursion as a filter approximation to fitting a fully Bayes model, whereby an approximate marginal likelihood of the structural parameter emerges and can be used for inference. We call this the predictive recursion marginal likelihood. Convergence properties of predictive recursion under model mis-specification also lead to an attractive construction of this new procedure. We show pointwise convergence of a normalized version of this marginal likelihood function. Simulations compare the performance of this new marginal likelihood approach that of existing profile likelihood methods as well as Dirichlet process mixtures in density estimation. Mixed-eff...

  16. Recursive bisection placement: feng shui 5.0 implementation details

    Microsoft Academic Search

    Ameya R. Agnihotri; Satoshi Ono; Patrick H. Madden

    2005-01-01

    In this paper, we summarize circuit placement techniques and algorithms developed by the BLAC CAD research group; these have been integrated into our recursive bisection based placement tool feng shui. We also briefly describe current research interests.

  17. A Zassenhaus-type algorithm solves the Bogoliubov recursion

    Microsoft Academic Search

    Kurusch Ebrahimi-Fard; Frederic Patras

    2007-01-01

    This paper introduces a new Lie-theoretic approach to the computation of counterterms in perturbative renormalization. Contrary to the usual approach, the devised version of the Bogoliubov recursion does not follow a linear induction on the number of loops. It is well-behaved with respect to the Connes-Kreimer approach: that is, the recursion takes place inside the group of Hopf algebra characters

  18. The widely linear quaternion recursive total least squares

    E-print Network

    Thanthawaritthisai, Thiannithi; Tobar, Felipe; Constantinides, Anthony G.; Mandic, Danilo P.

    2015-05-27

    THE WIDELY LINEAR QUATERNION RECURSIVE TOTAL LEAST SQUARES Thiannithi Thanthawaritthisai1, Felipe Tobar2, Anthony G. Constantinides1, and Danilo P. Mandic1 1Department of Electrical and Electronic Engineering, Imperial College London 2Department... of Engineering, University of Cambridge Email: tt1513@imperial.ac.uk, fat25@cam.ac.uk, {a.constantinides, d.mandic}@imperial.ac.uk ABSTRACT A widely linear quaternion recursive total least squares (WL- QRTLS) algorithm is introduced for the processing of Q...

  19. Further improved recursions for a class of compound Poisson distributions

    Microsoft Academic Search

    Stathis Chadjiconstantinidis; Georgios Pitselis

    2009-01-01

    In the present paper we develop more efficient recursive formulae for the evaluation of the t-order cumulative function ?th(x) and the t-order tail probability ?th(x) of the class of compound Poisson distributions in the case where the derivative of the probability generating function of the claim amounts can be written as a ratio of two polynomials. These efficient recursions can

  20. Recursive Mahalanobis separability measure for gene subset selection.

    PubMed

    Mao, K Z; Tang, Wenyin

    2011-01-01

    Mahalanobis class separability measure provides an effective evaluation of the discriminative power of a feature subset, and is widely used in feature selection. However, this measure is computationally intensive or even prohibitive when it is applied to gene expression data. In this study, a recursive approach to Mahalanobis measure evaluation is proposed, with the goal of reducing computational overhead. Instead of evaluating Mahalanobis measure directly in high-dimensional space, the recursive approach evaluates the measure through successive evaluations in 2D space. Because of its recursive nature, this approach is extremely efficient when it is combined with a forward search procedure. In addition, it is noted that gene subsets selected by Mahalanobis measure tend to overfit training data and generalize unsatisfactorily on unseen test data, due to small sample size in gene expression problems. To alleviate the overfitting problem, a regularized recursive Mahalanobis measure is proposed in this study, and guidelines on determination of regularization parameters are provided. Experimental studies on five gene expression problems show that the regularized recursive Mahalanobis measure substantially outperforms the nonregularized Mahalanobis measures and the benchmark recursive feature elimination (RFE) algorithm in all five problems. PMID:20479500

  1. Why (and how) I am using XML and MathML Richard Kaye, School of Mathematics, University of Birmingham

    E-print Network

    Kaye, Richard

    of technology, our documents reach a wider readership, then that is good for us too. I first heard about XML be using XML and MathML much more, and outline my own attempts to make XML/MathML publishing accessible in a mathematical formula to allow translation to MathML, let alone to a computer algebra system or other

  2. IEEE 1451.1 Standard and XML Web Services: a Powerful Combination to Build Distributed Measurement and Control Systems

    Microsoft Academic Search

    Vtor Viegas; J. M. Dias Pereira; S. Silva Girao

    2006-01-01

    In 2005, we presented the NCAP\\/XML, a prototype of NCAP (network capable application processor) that runs under the .NET framework and makes available its functionality through a set of Web services using XML (extended Markup Language). Giving continuity to this project, it is time to explain how to use the NCAP\\/XML to build a distributed measurement and control system (DMCS)

  3. A TransducerBased XML Query Processor \\Lambda Bertram Ludascher y Pratik Mukhopadhyay z Yannis Papakonstantinou z

    E-print Network

    Papakonstantinou, Yannis

    A TransducerBased XML Query Processor \\Lambda Bertram Ludascher y Pratik Mukhopadhyay z Yannis into an XSM, which is an XML stream transducer, i.e., an abstract device that takes as input one or more XML data streams and produces one or more output streams, potentially using inter nal buffers. We present

  4. A Runtime System for XML Transformations in Java Aske Simon Christensen, Christian Kirkegaard, and Anders Mller

    E-print Network

    Møller, Anders

    high-level data-type for manipulating XML docu- ments while permitting (1) precise static analysis of immutable XML templates and uses XPath for deconstructing documents. A companion paper presents the program analysis; this paper focuses on the efficient runtime representation. 1 Introduction There exists a variety

  5. Publishing and Querying the Histories of Archived Relational Databases in XML

    Microsoft Academic Search

    Fusheng Wang; Carlo Zaniolo

    2003-01-01

    There is much current interest in publishing and view- ing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set available for visualizing and processing informa- tion encoded in this universal standard. In this paper, we explore the additional and unique benefits achieved by this approach on temporal database applications.

  6. FleXml: Plataforma de Ensino a Distncia para Promover Flexibilidade Cognitiva

    Microsoft Academic Search

    Ana Amlia; Amorim Carvalho; Carlos Sousa Pinto; Pedro Jorge Martins Monteiro

    Resumo- Esta comunicao apresenta a plataforma Web FleXml para ensino a distncia, desenvolvi da na Universidade do Minho, em Portugal, e estruturada segundo os princpios da Teoria de Flexibilidade Cognitiva. Comeamos por caracterizar a referida teoria, passando de seguida a descrever a plataforma Web FleXml em termos da sua arquitectura e funcio namento nos mdulos autor e leitor. Por fim,

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

  8. Integration of an XML electronic dictionary with linguistic tools for natural language processing

    Microsoft Academic Search

    Octavio Santana Surez; Francisco J. Carreras Riudavets; Zenn Jos Hernndez Figueroa; Antonio C. Gonzlez Cabrera

    2007-01-01

    This study proposes the codification of lexical information in electronic dictionaries, in accordance with a generic and extendable XML scheme model, and its conjunction with linguistic tools for the processing of natural language. Our approach is different from other similar studies in that we propose XML coding of those items from a dictionary of meanings that are less related to

  9. Efficient storage of healthcare data in XML-based smart cards

    Microsoft Academic Search

    Taflan I. Gndem; . Armagan

    2006-01-01

    In this paper we present storage structures for efficiently processing XML path queries on healthcare data stored in smart cards using XML format. In the design of the storage structures that we present, properties of healthcare data and fundamental types of queries on the healthcare data are taken into account as well as the constraints of the smart cards. We

  10. Improving Timely Clinical Lab Test Result Management: A Generative XML Process Model to Support Medical Care

    E-print Network

    Shneiderman, Ben

    Improving Timely Clinical Lab Test Result Management: A Generative XML Process Model to Support4,5 1 Department of Computer Science & 2 Human-Computer Interaction Lab University of Maryland (Multi-Step Task Alerting, Reminding, and Tracking), which uses XML specifications of a workflow model

  11. Ensuring Timely Clinical Lab Test Result Management: A Generative XML Process Model to Support Medical Care

    E-print Network

    Golbeck, Jennifer

    Ensuring Timely Clinical Lab Test Result Management: A Generative XML Process Model to Support4,5 1 Department of Computer Science & 2 Human-Computer Interaction Lab University of Maryland (Multi-Step Task Alerting, Reminding, and Tracking), which uses XML specifications of a workflow model

  12. Compact XML grammar based compression S. Harrusi, A. Averbuch, A. Yehudai

    E-print Network

    Averbuch, Amir

    significantly enlarges the volumes of the stored data. It is clear that a lossless compression scheme such as validators, converters, editors, etc. 1.2 The basic idea A lossless compression scheme for XML data is needed structure. This enhances the XML text compression twofold: first, there are less symbols to encode

  13. Indexing and Searching XML Documents based on Content and Structure Synopses

    E-print Network

    Fegaras, Leonidas

    Indexing and Searching XML Documents based on Content and Structure Synopses Weimin He, Leonidas,fegaras,levine}@cse.uta.edu Abstract. We present a novel framework for indexing and searching schema-less XML documents based-phase con- tainment filtering algorithm based on these synopses that improves the searching process. Our

  14. XML filtering with XPath expressions containing parent and ancestor axes , Chengfei Liu b

    E-print Network

    Liu, Chengfei

    XML filtering with XPath expressions containing parent and ancestor axes Bo Ning a, , Chengfei Liu 2012 Accepted 25 April 2012 Available online 4 May 2012 Keywords: XML XPath axes Selective documents with large number of XPath expressions, which may contain `ancestor' and `parent' axes. XPath

  15. Sound ranking algorithms for XML search in PF/Tijah Djoerd Hiemstra1

    E-print Network

    Hiemstra, Djoerd

    Sound ranking algorithms for XML search in PF/Tijah Djoerd Hiemstra1 , Stefan Klinger2 , Henning hiemstra@cs.utwente.nl, klinger@inf.unikonstanz.de, henning@cwi.nl, flokstra@cs.utwente.nl, apers that talk about ranked xml retrieval which were supported in one way or another by John Doe. This might

  16. WReX: A Scalable Middleware Architecture to Enable XML Caching for Web-Services

    E-print Network

    Candan, Seluk

    WReX: A Scalable Middleware Architecture to Enable XML Caching for Web-Services Junichi Tatemura1 on the source data size, therefore, the solution is highly scalable. Experi- mental evaluation is conducted Federation for Information Processing 2005 #12;WReX: A Scalable Middleware Architecture to Enable XML Caching

  17. Building a Scalable Native XML Database Engine on Infrastructure for a Relational Database

    Microsoft Academic Search

    Guogen Zhang

    2005-01-01

    We describe the architecture and some aspects of System R\\/X, a native XML database engine that is built on the same mature infrastructure for a relational database and integrated with the relational engine. We describe what parts of the infrastructure can be reused, what need to be extended, and what are totally new to the XML database and their techniques.

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

    E-print Network

    Senellart, Pierre

    , semantic knowledge bases or end user applications in one common file format. Yet, XML by itself defines and understood. Through the medium of this tutorial, we show the newest research trends in the area of the hidden. Through XML, it has become possible to transfer data between systems as diverse as databases, Web services

  19. Parallel and Distributed Approach for Processing Large-Scale XML Datasets

    E-print Network

    for processing large-scale XML datasets that utilizes the capabilities for parallelism that are available are scheduled on available cores in a node to effectively utilize the processing capabilities and achieve to process small-sized XML datasets. The recent trends and announcements from major vendors indicate

  20. 1 Correlated Data Inference in Ontology Guided XML Security Engine CORRELATED DATA INFERENCE in ONTOLOGY

    E-print Network

    Farkas, Csilla

    in ONTOLOGY GUIDED XML SECURITY ENGINE Csilla Farkas Andrei Stoica Information Security Laboratory Department publicly available information. We propose a framework, the Ontology guided XML Security Engine (Oxsegin of confidential information. 1 This work was partially supported by the National Science Foundation under Grant No

  1. An Internet-Scale Service for Publishing and Locating XML Documents

    E-print Network

    Moon, Bongki

    An Internet-Scale Service for Publishing and Locating XML Documents Praveen Rao #1 , Bongki Moon 2>{$e/name/text()} This query can be processed in two phases. In the first phase, all qualifying peers are located who store")]. In the second phase, the query is executed on the matched XML documents either remotely by shipping it to those

  2. A Data Parallel Algorithm for XML DOM Parsing Bhavik Shah1

    E-print Network

    Moon, Bongki

    A Data Parallel Algorithm for XML DOM Parsing Bhavik Shah1 , Praveen R. Rao1 , and Bongki Moon2 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

  3. Case Based Reasoning Applied in Personal Financing: Representing Cases Based on XML

    Microsoft Academic Search

    Mao Tingyu; Ma Biao

    2010-01-01

    This paper proposes using CBR (Case Based Reasoning) method in the field of Personal Finance to solve the conflict between the lack of financial planner and the expanding needs of Personal Finance. It also analyzed how to represent Personal Finance cases using XML, and the advantage of using XML to build the database. Then an example of application was given

  4. Report on the first Twente Data Management Workshop on XML Databases and Information Retrieval

    E-print Network

    Hiemstra, Djoerd

    in the INEX work- shops (Fuhr and Lalmas 2004; see below for a short description of INEX). We believe) for sponsoring the proceedings. 2 XML Information Retrieval: Achievements & Challenges Norbert Fuhr on achievements and challenges in XML information retrieval, focusing on the INEX workshops (Fuhr and Lalmas 2004

  5. An XML application for genomic data interoperation Kei-Hoi Cheung1

    E-print Network

    Gerstein, Mark

    technology to process these XML-formatted data. This paper illustrates the usefulness of XML in representing in SGD. Such a comparison allows us to characterize the transposon insertions by indicating whether. They provide for the user the capability of browsing through a large set of data graphically on their local

  6. Automating Disk Forensic Processing with SleuthKit, XML and Python

    Microsoft Academic Search

    Simson L. Garfinkel

    2009-01-01

    We have developed a program called fiwalk which produces detailed XML describing all of the partitions and files on a hard drive or disk image, as well as any extractable metadata from the document files themselves. We show how it is relatively simple to create automated disk forensic applications using a Python module we have written that reads fiwalk's XML

  7. Querying Regular Sets of XML Documents Slawomir Staworko1,2

    E-print Network

    Paris-Sud XI, Universit de

    Querying Regular Sets of XML Documents Slawomir Staworko1,2 , Emmanuel Filiot1 , and Jan Chomicki2, Buffalo, NY Abstract. We investigate the problem of querying (regular) sets of XML documents represented. Because finite automata can represent infinite sets of documents, we pro- pose the notions of universal

  8. inria-00000002,version3-9Aug2005 Experiments in Clustering Homogeneous XML Documents

    E-print Network

    Paris-Sud XI, Universit de

    inria-00000002,version3-9Aug2005 Experiments in Clustering Homogeneous XML Documents to Validate in clustering homogeneous XML documents to validate an existing classification or more generally with unsupervised classification (clustering) of documents. We focus on the feature selection used for representing

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

    Microsoft Academic Search

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

    2007-01-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,

  10. SQL4X: A Flexible Query Language for XML and Relational Databases

    E-print Network

    Kanza, Yaron

    SQL4X: A Flexible Query Language for XML and Relational Databases Sara Cohen, Yaron Kanza, and Yehoshua Sagiv The Hebrew University, Institute of Computer Science, Jerusalem 91904, Israel Abstract. SQL4. Using SQL4X, one can create both relations and XML documents as query results. Thus, SQL4X can

  11. XML Structures for Relational Data Wenyue Du Mong Li Lee Tok Wang Ling

    E-print Network

    Lee, Mong Li "Janice"

    XML Structures for Relational Data Wenyue Du Mong Li Lee Tok Wang Ling School of Computing National is often stored in the relational databases. Some mechanism is needed to convert the relational data enriched relational schema to XML Schema. This approach allows us to handle the translation of a set

  12. System Entity Structure For XML Meta Data Modeling; Application to the US Climate Normals

    E-print Network

    , and transformation to XML representations, all through natural language and graphical interfaces. Thus the software a software tool, the SESBuilder, employing the extended markup language XML. Pruned Entity Structures (PES modeling of US Climate Normals for the purpose of automated generation of weather simulation models. Key

  13. 1.0 MOML PRINCIPLES MoML is an XML modeling markup language. It is

    E-print Network

    or on a network. Implementation independence. The MoML language is designed to work with a variety of tools1.0 MOML PRINCIPLES MoML is an XML modeling markup language. It is intended for specifying specified in some other language (such as another XML language). The intent is to keep MoML very small

  14. XPERANTO: Middleware for Publishing Object-Relational Data as XML Documents

    Microsoft Academic Search

    Michael J. Carey; Jerry Kiernan; Jayavel Shanmugasundaram; Eugene J. Shekita; Subbu N. Subramanian

    2000-01-01

    The eXtended Markup Language (XML) is quickly emerging as the universal format for publishing and exchanging data on the World Wide Web. As a result, data sources, including object-relational databases, are now faced with a new class of users and applications; customers and programs that would like to deal directly with XML data rather than being forced to deal with

  15. Enterprise Architecture Analysis with XML F.S. de Boer1,2

    E-print Network

    van der Torre, Leon

    Enterprise Architecture Analysis with XML F.S. de Boer1,2 M.M. Bonsangue2 J. Jacob1 A. Stam2,3 L, The Netherlands Abstract This paper shows how XML can be used for static and dynamic analysis of architectures. Our analysis is based on the distinction between symbolic and semantic models of architectures

  16. CSV Compaction to Improve Data-Processing Performance for Large XML Documents

    Microsoft Academic Search

    Shigeru Yoshida; Hironori Yahagi; Junichi Odagiri

    2004-01-01

    XML (extensible markup language) is the global standardized and flexible electronic data expression form, expected to further spread through its varied and wide use. To improve data-processing performance for XML documents in a record form, such as bills and customer lists (the data size tends to be large for business purposes), a reversible compaction method which reduces the number of

  17. Recursive Construction of Operator Product Expansion Coefficients

    NASA Astrophysics Data System (ADS)

    Holland, Jan; Hollands, Stefan

    2015-06-01

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

  18. Using XML-Schema to Model Data from Present and Future Astronomical Databases

    NASA Astrophysics Data System (ADS)

    Debray, Bernard

    XML (eXtensible Markup Language) has now become an almost inescapable tool for the exchange of formatted data over the World Wide Web and is now becoming extensively used in astronomical data bases to interweave them, therefore making it an important tool for the building of the Virtual Observatory. Document Type Definitions (DTD) have been initially used to describe XML documents formatting; they offer very limited possibility about data typing, constraints or bounds for the handling of data-oriented documents. These limitations can now be overcome thanks to the XML Schema recommendation. The potential benefit of XML Schema for astronomical databases is illustrated through an ongoing implementation of XML Schema for formatted data output in the Besancon Double and Multiple Star database.

  19. Email Updates

    MedlinePLUS

    ... http://www.nlm.nih.gov/medlineplus/listserv.html Email Updates To use the sharing features on this ... view your email history or unsubscribe. Prevent MedlinePlus emails from being marked as "spam" or "junk" To ...

  20. Experiments with recursive estimation in astronomical image processing

    NASA Technical Reports Server (NTRS)

    Busko, I.

    1992-01-01

    Recursive estimation concepts were applied to image enhancement problems since the 70's. However, very few applications in the particular area of astronomical image processing are known. These concepts were derived, for 2-dimensional images, from the well-known theory of Kalman filtering in one dimension. The historic reasons for application of these techniques to digital images are related to the images' scanned nature, in which the temporal output of a scanner device can be processed on-line by techniques borrowed directly from 1-dimensional recursive signal analysis. However, recursive estimation has particular properties that make it attractive even in modern days, when big computer memories make the full scanned image available to the processor at any given time. One particularly important aspect is the ability of recursive techniques to deal with non-stationary phenomena, that is, phenomena which have their statistical properties variable in time (or position in a 2-D image). Many image processing methods make underlying stationary assumptions either for the stochastic field being imaged, for the imaging system properties, or both. They will underperform, or even fail, when applied to images that deviate significantly from stationarity. Recursive methods, on the contrary, make it feasible to perform adaptive processing, that is, to process the image by a processor with properties tuned to the image's local statistical properties. Recursive estimation can be used to build estimates of images degraded by such phenomena as noise and blur. We show examples of recursive adaptive processing of astronomical images, using several local statistical properties to drive the adaptive processor, as average signal intensity, signal-to-noise and autocorrelation function. Software was developed under IRAF, and as such will be made available to interested users.

  1. Associating Style Sheets with XML documents Version 1.0

    NSDL National Science Digital Library

    1999-01-01

    This latest recommendation from the World Wide Web Consortium (W3C) (last discussed in the May 7, 1999 Scout Report) provides XML authors with a wider range of design and display options. As with all W3C recommendations, the W3C endorsement indicates that "a specification is stable, contributes to Web interoperability, and has been reviewed by the W3C membership, who favor its adoption by the industry." The latest and previous version of the recommendation, a press release, and testimonials are available at the above URLs.

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

  3. Data Entity Dictionary Specification Language: XML/DTD Syntax

    NSDL National Science Digital Library

    2002-01-01

    This report, published by the Consultative Committee for Space Data Systems (CCSDS), is a recommendation for a common Data Entity Dictionary Specification Language (DEDSL) implementation to establish interoperability of data dictionaries. Specifically, it deals with XML Document Type Declaration and requires some technical experience using the languages. Organizations, users, and producers of space data products are the target audience of the report. The purpose of the CCSDS is to develop "standard data handling techniques to support space research," and its members include NASA, the European and Russian Space Agencies, and several others. While this report is the most recent finalized document, there are many other recommendations offered on the CCSDS Web site.

  4. Knot Invariants from Topological Recursion on Augmentation Varieties

    NASA Astrophysics Data System (ADS)

    Gu, Jie; Jockers, Hans; Klemm, Albrecht; Soroush, Masoud

    2015-06-01

    Using the duality between Wilson loop expectation values of SU( N) Chern-Simons theory on S 3 and topological open-string amplitudes on the local mirror of the resolved conifold, we study knots on S 3 and their invariants encoded in colored HOMFLY polynomials by means of topological recursion. In the context of the local mirror Calabi-Yau threefold of the resolved conifold, we generalize the topological recursion of the remodelled B-model in order to study branes beyond the class of toric Harvey-Lawson special Lagrangiansas required for analyzing non-trivial knots on S 3. The basic ingredients for the proposed recursion are the spectral curve, given by the augmentation variety of the knot, and the calibrated annulus kernel, encoding the topological annulus amplitudes associated to the knot. We present an explicit construction of the calibrated annulus kernel for torus knots and demonstrate the validity of the topological recursion. We further argue thatif an explicit form of the calibrated annulus kernel is provided for any other knotthe proposed topological recursion should still be applicable. We study the implications of our proposal for knot theory, which exhibit interesting consequences for colored HOMFLY polynomials of mutant knots.

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

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

    PubMed

    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

    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. Theoretical properties of recursive neural networks with linear neurons.

    PubMed

    Bianchini, M; Gori, M

    2001-01-01

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

  8. Theory and applications of sampled analog recursive CTD comb filters

    NASA Technical Reports Server (NTRS)

    Tao, T. F.; Holmes, S. V.; Ejaz, A.; Piazza, F.; Saetre, L. T.; Freund, B.

    1976-01-01

    Sampled analog comb filter using a recursive filter implementation was studied. Charge transfer device delay lines were used as the delay elements. The similarities and differences between sampled analog recursive filter and digital recursive filter were pointed out. Both canceller type and integrator type comb filter using the first order or the second order canonical circuits were studied. Experimental results of frequency response are presented to show their difference from that of digital filters. A theoretical analysis was presented based essentially on the digital filter theory but modified to take into account the differences described above. The usefulness of this theory in analyzing the comb filter characteristics was discussed. Several applications of both the canceller type comb filter and the integrator type comb filter were demonstrated.

  9. Dynamic interval-based labeling scheme for efficient XML query and update processing

    E-print Network

    Chung, Chin-Wan

    relationships, several node labeling and index schemes have been suggested (Li and Moon, 2001; Zhang et al., 2001; Wu et al., 2004; Tatarinov et al., 2002; Kaplan et al., 2002; Catania et al., 2005; Chen et al the case of the interval-based labeling scheme (Li and Moon, 2001; Zhang et al., 2001) that assigns start

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

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

    E-print Network

    Norman Do; Alastair Dyer; Daniel V. Mathews

    2014-08-18

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

  12. Ward Identity Implies Recursion Relation at Tree and Loop Level

    E-print Network

    Yun Zhang; Gang Chen

    2013-02-09

    In this article, we use Ward identity to calculate tree and one loop level off shell amplitudes in pure Yang-Mills theory with a pair of external lines complexified. We explicitly prove Ward identity at tree and one loop level using Feynman rules, and then give recursion relations for the off shell amplitudes. We find that the cancellation details in the proof of Ward identity simplifies our derivation of the recursion relations. Then we calculate three and four point one loop off shell amplitudes as examples of our method.

  13. Two Level Recursive Reasoning by Humans Playing Sequential Fixed-Sum Games

    Microsoft Academic Search

    Adam Goodie; Prashant Doshi; Diana Young

    2009-01-01

    Recursive reasoning of the form what do I think that you think that I think (and so on) arises often while acting rationally in multiagent settings. Previous investigations indicate that humans do not tend to ascribe recursive thinking to others. Several multiagent decision- making frameworks such as RMM, I-POMDP and the theory of mind model recursive reasoning as integral to

  14. Piecewise linear current density recursive convolution FDTD implementation for anisotropic magnetized plasmas

    Microsoft Academic Search

    Shaobin Liu; Jinjun Mo; Naichang Yuan

    2004-01-01

    The piecewise linear current density recursive convolution (PLCDRC) finite-difference time-domain (FDTD) method for isotropic dispersive media greatly improves accuracy over recursive convolution (RC) and current density recursive convolution (CDRC) FDTD approaches but retains its speed and efficiency advantages. This letter extends this approach to anisotropic magnetoactive plasmas which incorporates both anisotropy and frequency dispersion at the same time, enabling the

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

    ERIC Educational Resources Information Center

    McCauley, Rene; 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,

  16. Learning recursive theories with the separate-and-parallel-conquer strategy

    E-print Network

    Malerba, Donato

    Learning recursive theories with the separate-and- parallel-conquer strategy Antonio Varlaro problem. In this paper we are interested in learning multiple predicate definitions (or recursive theories, to the problem of learning recursive logical theories. There has been considerable debate on the actual

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

    E-print Network

    Rschendorf, Ludger

    Limit theorems for depths and distances in weighted random b-ary recursive trees Gotz 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

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

    E-print Network

    Janson, Svante

    Limit Laws for Functions of Fringe trees for Binary Search Trees and Recursive Trees Cecilia of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size k = kn in the binary search tree and the random recursive tree (of total

  19. A NECESSARY CONDITION FOR A DOUBLY RECURSIVE RULE TO BE EQUIVALENT TO

    E-print Network

    Zhang, Weining

    quenes It is therefore of mterest to transform non-lmear recursive quenes mto hnear ones We obtam and convertmg them mto equivalent lmear recursive quenes, we are able to utilize the more efficient hear mto a sequence of hnear recursive rules (A smular but not identical converhon appears111[Ce

  20. 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. In our previous works, we propose a programming method- ology for designing block recursive algorithms

  1. Space Update

    NSDL National Science Digital Library

    2006-01-01

    This DVD includes space science images, movies and activities aligned with national standards. Includes the following sections: Astronomy, Solar System, Sky Tonight, and Space Weather models, which run separately or as a linked system, plus Space Events. It is safe for unattended use and suitable for museums or school libraries. Images can be updated without need of an open web browser.

  2. Open Rigging Through XML: Character Setup Utilizing Metadata and Node Based Editing

    E-print Network

    Kelly, Logan Scott

    2014-02-19

    definitions in extensible markup language (XML). This method provides for version control along with the construct of a metadata node network facilitating easy propagation of changes to existing rigs. A node based interface is also provided for easily...

  3. A Tool Kit for Implementing XML Schema Naming and Design Rules

    SciTech Connect

    Lubell, Joshua [National Institute of Standards and Technology (NIST); Kulvatunyou, Boonserm [ORNL

    2005-11-01

    A tool kit being developed at the National Institute of Standards and Technology (NIST)encodes XML schema Naming and Design Rules in a computer-interpretable fashion,enabling automated rule enforcement and improving schema quality.

  4. The overlap problem in content-oriented XML retrieval Gabriella Kazai

    E-print Network

    Lalmas, Mounia

    a solution to both overlap issues. Keywords XML retrieval, INEX, evaluation, metrics, overlap, overpopulated. Although these met- rics provide a solution towards addressing the problem of overlap among returned result

  5. XML and the VITAL standard: the document-oriented approach for open telemedicine applications.

    PubMed

    Anagnostaki, A; Pavlopoulos, S; Koutsouris, D

    2001-01-01

    This paper describes an effort to create a common, document-oriented architecture for the interchange of medical data in healthcare telemedicine applications. Key components are: The VITAL standard specifying a common (medical device independent) representation of Vital Signs Information and the Extensible Markup Language (XML) specifying the document specifications form, an architecture that, in aggregate, define the semantics and structural constraints necessary for the exchange of vital signs and related medical data. The modelling and design technique for the described application has been the Unified Modelling Language (UML). The XMI (XML Metadata Interchange Format) of the Object Management Group (OMG) provided the meta-model for this application, for sharing objects using XML, via the transfer of the application's UML model to XML documents and DTDs. PMID:11604709

  6. XML-based Gating Descriptions in Flow Cytometry

    PubMed Central

    Spidlen, Josef; Leif, Robert; Moore, Wayne; Roederer, Mario; Brinkman, Ryan R.

    2008-01-01

    Background The lack of software interoperability with respect to gating due to lack of a standardized mechanism for data exchange has traditionally been a bottleneck preventing reproducibility of flow cytometry (FCM) data analysis and the usage of multiple analytical tools. Methods To facilitate interoperability among FCM data analysis tools, members of the International Society for the Advancement of Cytometry (ISAC) Data Standards Task Force (DSTF) have developed an XML-based mechanism to formally describe gates (Gating-ML). Results Gating-ML, an open specification for encoding gating, data transformations and compensation, has been adopted by the ISAC DSTF as a Candidate Recommendation (CR). Conclusions Gating-ML can facilitate exchange of gating descriptions the same way that FCS facilitated for exchange of raw FCM data. Its adoption will open new collaborative opportunities as well as possibilities for advanced analyses and methods development. The ISAC DSTF is satisfied that the standard addresses the requirements for a gating exchange standard. PMID:18773465

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

  8. Effects of quantization and overflow in recursive digital filters

    Microsoft Academic Search

    T. Claasen; W. Mecklenbrauker; J. Peek

    1976-01-01

    A classification is given of the various possible nonlinear effects that can occur in recursive digital filters due to signal quantization and adder overflow. The effects include limit cycles, overflow oscillations, and quantization noise. A review is given of recent literature on this subject. Alternative methods of avoiding some of these nonlinear phenomena are discussed.

  9. Efficient and Optimal Attitude Determination Using Recursive Global Positioning System

    E-print Network

    Crassidis, John L.

    1 Efficient and Optimal Attitude Determination Using Recursive Global Positioning System Signal and efficient algorithm is developed for attitude determination from Global Positioning System signals. The new. Fellow AIAA. #12;2 Introduction Phase difference measurements from Global Positioning System (GPS

  10. A Recursive Taylor Method for Algebraic Curves and Surfaces

    E-print Network

    Martin, Ralph R.

    A Recursive Taylor Method for Algebraic Curves and Surfaces Huahao Shou1,2 , Ralph Martin3 , Guojin. The modified affine arithmetic method (MAA), previously shown to be one of the best methods for polyno- mial curves or surfaces can not be plotted so readily. Implicit curve or surface plotting methods can

  11. Constructing Partial and Complete Intelligent Answers for Recursive Queries

    Microsoft Academic Search

    Xubo Zhang; Z. Meral Ozsoyoglu

    1995-01-01

    In this paper we study the issue of providing intelligent answers to recursive queriesinitially proposed in [Imie88]. In contrast to conventional query answers, whichare sets of tuples, intelligent answers are rules describing the characteristics ofthe results. This way, an intelligent answer facilitates users to better capture themeaning of the query.To this aim, we first extend the notion of intelligent answers

  12. Average treatment eect estimation via random recursive partitioning

    Microsoft Academic Search

    Giuseppe Porro; Stefano Maria Iacus

    2004-01-01

    A new matching method is proposed for the estimation of the average treatment eect of social policy interventions (e.g., training programs or health care measures). Given an outcome variable, a treatment and a set of pre-treatment covariates, the method is based on the examination of random recursive partitions of the space of covariates using regression trees. A regression tree is

  13. Average treatment effect estimation via random recursive partitioning

    Microsoft Academic Search

    Stefano Iacus; Giuseppe Porro

    2004-01-01

    A new matching method is proposed for the estimation of the average treatment effect of social policy interventions (e.g., training programs or health care measures). Given an outcome variable, a treatment and a set of pre-treatment covariates, the method is based on the examination of random recursive partitions of the space of covariates using regression trees. A regression tree is

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

    PubMed

    Kiatsupaibul, Seksan; Hayter, Anthony J

    2015-01-01

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

  15. HIERARCHICAL MOTION ESTIMATION USING RECURSIVE LMS FILTERS Mejdi Trimeche (a)

    E-print Network

    Gabbouj, Moncef

    frames. We extend the algo- rithm to use mirrored scanning and we apply it hierarchically across diadic]. In [3], a two-dimensional recursive least squares (LS) filtering scheme was introduced. The filter- tion is formulated as a two-dimensional (2-D) system identification problem with spatially varying

  16. RECURSIVELY STRUCTURED DISTRIBUTED COMPUTING SYSTEMS University of Newcastle upon Tyne

    E-print Network

    Newcastle upon Tyne, University of

    1 RECURSIVELY STRUCTURED DISTRIBUTED COMPUTING SYSTEMS B. Randell University of Newcastle upon Tyne ABSTRACT Two design rules which aid the construction of distributed computing systems and the provision of fault tolerance are described, namely that: (i) a distributed computing system should be functionally

  17. Teaching Non-Recursive Binary Searching: Establishing a Conceptual Framework.

    ERIC Educational Resources Information Center

    Magel, E. Terry

    1989-01-01

    Discusses problems associated with teaching non-recursive binary searching in computer language classes, and describes a teacher-directed dialog based on dictionary use that helps students use their previous searching experiences to conceptualize the binary search process. Algorithmic development is discussed and appropriate classroom discussion

  18. Automatic Veri cation of Recursive Procedures with one Integer Parameter

    E-print Network

    ?ayr, Richard

    , Georges-Koehler-Allee Geb. 051, D-79110 Freiburg, Germany. Abstract Context-free processes (BPA) have been introduce a more re#12;ned model called BPA(Z) that can model not only recursive dependencies, but also the passing of an integer parameter to a subroutine. Moreover, this parameter can be tested against conditions

  19. A Binary Recursive Gcd Algorithm Damien Stehle and Paul Zimmermann

    E-print Network

    Zimmermann, Paul

    . The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present Euclidean algorithm is much simpler to describe and to prove than the Knuth- Sch¨onhage algorithm, whileA Binary Recursive Gcd Algorithm Damien Stehl´e and Paul Zimmermann LORIA/INRIA Lorraine, 615 rue

  20. Profiles of random trees: Plane-oriented recursive trees

    Microsoft Academic Search

    Hsien-kuei Hwang

    2007-01-01

    We derive several limit results for the profile of random plan e-oriented recursive trees. These include the limit distribution of the normalized profi le, asymptotic bimodality of the variance, asymptotic approximation to the expected width and the correlation coefficients of two level sizes. Most of our proofs are based on a method of moments. We also discover an unexpected connection

  1. Global asymptotic stability of a nonlinear recursive sequence

    Microsoft Academic Search

    Xianyi Li; Deming Zhu

    2004-01-01

    A sufficient condition is obtained to guarantee the global asymptotic stability of the following nonlinear recursive difference equation: xn+1=xnxn?1b+xn?2b+axn?1b+xnxn?2b+a,n=0,1,2,, where a, b [0, ?] and the initial values x?2, x?1, x0 (0, ?). Some known results are included and improved.

  2. FIBONACCI'S SEQUENCE OBTAINED BY A GENERAL RECURSIVE FORMULA

    E-print Network

    : Fibonacci`s secuence. Recursive formula. Di¤erence Equations INTRODUCTION: The Fibonacci's numbers though all the Fibonacci's number are integers. Now in this short paper we are going to derive among other things a general formula for the Fibonacci's numbers which is done from a combinatorial point

  3. Bivariate Uniqueness in the Logistic Recursive Distributional Equation

    E-print Network

    Bandyopadhyay, Antar

    Bivariate Uniqueness in the Logistic Recursive Distributional Equation Antar Bandyopadhyay. Bivariate uniqueness, distributional identity, fixed-point equation, Logistic distribution, measurability if = , where is defined as the joint distribution of (Z, Z) on R2 , with Z Logistic distribution

  4. Wiener-Hammerstein Model Identification-Recursive Algorithms

    Microsoft Academic Search

    Hosam E. Emara-Shabaik; Mohammed S. Ahmed; Khaled H. Al-Ajmi

    2002-01-01

    Recursive algorithms for parameter estimation of Wiener-Hammerstein (W-H) models are developed. These algorithms are derived on the basis of minimizing cost functions of the output errors, the equation errors, and the prediction errors. Convergence conditions of the developed algorithms are established. Numerical results, to test the algorithms and illustrate their estimation accuracy, are given.

  5. Exploiting Fine-Grain Parallelism in Recursive LU Factorization1

    E-print Network

    Luszczek, Piotr

    of the factoriza- tion. It is based on conflict-free partitioning of the data and lockless synchroniza- tion of square matrix LU factorization with partial pivoting ­ a result consistent with related efforts [3 of a matrix panel using the recursive algo- rithm [5]. Even though the panel factorization is a lower order

  6. On abstract computer virology from a recursion-theoretic perspective

    E-print Network

    Paris-Sud XI, Universit de

    On abstract computer virology from a recursion-theoretic perspective G. Bonfante, M. Kaczmarek examples. Lastly, we show results on virus detection. 1 A short overview of computer virology From of a series whose aim is to define an abstract virology by exploring and understanding relationships between

  7. Traversing Recursive Object Structures: The Functional Visitor in Demeter

    E-print Network

    Krishnamurthi, Shriram

    in software development. The VISITOR pattern [2] improves the implementation of that concern by separating limitation of the VISITOR pattern by providing traverse methods in DJ library for developers to access. ConTraversing Recursive Object Structures: The Functional Visitor in Demeter Pengcheng Wu College

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

  9. Non-quadratic recursive algorithms (RLK) for transversal plant identification

    Microsoft Academic Search

    Anibal R. Figueiras-Vidal; J. M. Paez-Borallo; Francisco Lorenzo-Speranzini

    1988-01-01

    A generalization of the RLS algorithm is presented. The objective measure to be minimized is composed of the sum of arbitrarily weighted kth powers of the observed error (RLK algorithm). The authors formulate general recursive algorithm in the context of noisy transversal plant identification. An approximate analysis of its performance based on the convergence of the mean and covariance matrix

  10. CPSC 235 Fall 2013 Assignment 3: Drawing A Recursive Curve

    E-print Network

    Li, Zongpeng

    CPSC 235 ­ Fall 2013 Assignment 3: Drawing A Recursive Curve Due: October 23 2010, before mid above. In this assignment, your task is to write a Python program that prints QuickDraw commands to draw. For example, $ python3 a3.py 3 should draw the curve at level 3. Recall that by including from sys import argv

  11. Speech Noise Estimation using Enhanced Minima Controlled Recursive Averaging

    Microsoft Academic Search

    Ningping Fan; Justinian Rosca; Radu Balan

    2007-01-01

    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). This paper presents an enhanced MCRA algorithm (EMCRA), which demonstrates less speech signal leakage and faster response time to follow abrupt changes in the noise power spectrum. Experiments using real speech and

  12. RAM Programs, Turing Machines, and the Partial Recursive Functions

    E-print Network

    Gallier, Jean

    Chapter 4 RAM Programs, Turing Machines, and the Partial Recursive Functions 4.1 Introduction Anyone with some programming experience has an intuituive idea of the notion of "algo- rithm". Even is synonymous with that of a program written in some general purpose programming language. To be more accurate

  13. Limit Laws for Random Recursive Structures and Algorithms

    E-print Network

    Neininger, Ralph

    ; #12; Introduction Mathematical Analysis of Algorithms is the field where characteristic parame­ tersLimit Laws for Random Recursive Structures and Algorithms Dissertation zur Erlangung des. Referent: Prof. Dr. L. Devroye, Montreal Datum der Promotion: 10. Dezember 1999 #12; Contents Introduction

  14. Limit Laws for Random Recursive Structures and Algorithms

    E-print Network

    Neininger, Ralph

    ;#12;Introduction Mathematical Analysis of Algorithms is the field where characteristic parame- ters of algorithmsLimit Laws for Random Recursive Structures and Algorithms Dissertation zur Erlangung des. Referent: Prof. Dr. L. Devroye, Montreal Datum der Promotion: 10. Dezember 1999 #12;Contents Introduction i

  15. Refinement of Software Architectures by Recursive Model Transformations

    Microsoft Academic Search

    Ricardo Jorge Machado; Joo M. Fernandes; Paula Monteiro; Helena Rodrigues

    2006-01-01

    The main aim of this paper is to present how to refine software logi- cal architectures by application of a recursive model-based transformation ap- proach called 4SRS (four step rule set). It is essentially based on the mapping of UML use case diagrams into UML object diagrams. The technique is based on a sequence of steps that are inscribed in

  16. The Category-Theoretic Solution of Recursive Domain Equations

    Microsoft Academic Search

    Michael B. Smyth; Gordon D. Plotkin

    1982-01-01

    Recursive specifications of domains plays a crucial role in denotational semantics as devel- oped by Scott and Strachey and their followers. The purpose of the present paper is to set up a categorical framework in which the known techniques for solving these equations find a natural place. The idea is to follow the well-known analogy between partial orders and categories,

  17. Multivariate Online Anomaly Detection Using Kernel Recursive Least Squares

    E-print Network

    Multivariate Online Anomaly Detection Using Kernel Recursive Least Squares Tarem Ahmed and Mark an online, sequential, anomaly detection algorithm, that is suitable for use with multivariate data anomaly detection has used block-based methods, which are only suitable for offline applications

  18. Piecewise linear recursive convolution for dispersive media using FDTD

    Microsoft Academic Search

    David F. Kelley; Raymond J. Luebbers

    1996-01-01

    Electromagnetic propagation through linear dispersive media can be analyzed using the finite-difference time-domain (FDTD) method by employing the recursive convolution (RC) approach to evaluate the discrete time convolution of the electric field and the dielectric susceptibility function. The RC approach results in a fast and computationally efficient algorithm; however, the accuracy achieved is not generally as good as that obtained

  19. Wiener-Hammerstein Model Identification-Recursive Algorithms

    NASA Astrophysics Data System (ADS)

    Emara-Shabaik, Hosam E.; Ahmed, Mohammed S.; Al-Ajmi, Khaled H.

    Recursive algorithms for parameter estimation of Wiener-Hammerstein (W-H) models are developed. These algorithms are derived on the basis of minimizing cost functions of the output errors, the equation errors, and the prediction errors. Convergence conditions of the developed algorithms are established. Numerical results, to test the algorithms and illustrate their estimation accuracy, are given.

  20. Recursive Mahalanobis Separability Measure for Gene Subset Selection

    Microsoft Academic Search

    Kezhi Z. Mao; Wenyin Tang

    2011-01-01

    Mahalanobis class separability measure provides an effective evaluation of the discriminative power of a feature subset, and is widely used in feature selection. However, this measure is computationally intensive or even prohibitive when it is applied to gene expression data. In this study, a recursive approach to Mahalanobis measure evaluation is proposed, with the goal of reducing computational overhead. Instead

  1. A recursive construction of noiseless subsystem for qudits

    NASA Astrophysics Data System (ADS)

    Gngrd, Utkan; Li, Chi-Kwong; Nakahara, Mikio; Poon, Yiu-Tung; Sze, Nung-Sing

    2014-03-01

    The noiseless subsystem is a method of using the inherent permutation symmetry of the noise to protect a subsystem against errors. Its construction becomes a formidable task with the growing number of qudits. In this work, we describe a recursive way of constructing noiseless subsystem for qudits, that is robust against collective noise of the form W?n, where n is the number of qudits and W is the Kraus operator acting on a single site. This kind of error appears when the wavelength of an environmental disturbance is much larger than the size of the quantum system, which makes it natural to assume all the qubits in the register suffer from the same error operator. The presented recursive scheme is a direct generalization of the recursive scheme described in Phys. Rev. A,84, (2011) 044301 for qubits. We show that the quantum error correction rate, i.e., the ratio of correctable qudits and the number of transmitted qudits, approaches 1 / d as n goes to infinity in this recursive scheme. UG is grateful to JSPS (Japan Society for the Promotion of Science) for partial support from Grant-in-Aid for Scientifc Research (Grant Nos. 23540470 and 24320008). UG acknowledges the financial support of the MEXT.

  2. Recursive estimation of structure and motion using relative orientation constraints

    Microsoft Academic Search

    Ali Azarbayejani; Bradley Horowitz; Alex Pentland

    1993-01-01

    A recursive estimation technique for recovering the 3-D motion and pointwise structure of an object is presented. It is based on the use of relative orientation constraints in a local coordinate frame. By carefully formulating the problem to propagate all constraints and to use the minimal number of parameters, an estimator is obtained which is remarkably accurate, stable, and fast-conveying.

  3. Recursive Sherman-Morrison factorization for scattering calculations

    E-print Network

    Chen, Yu

    Recursive Sherman-Morrison factorization for scattering calculations Sang-Yeun Shim and Yu Chen, United States Abstract. A technique based on the Sherman-Morrison formula is presented for developing e Sherman-Morrison factorization, because it turns out that the purely algebraic procedure, the Sherman-Morrison

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

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

  6. Locating XML Documents in a Peer-to-Peer Network Using Distributed Hash Tables

    Microsoft Academic Search

    Praveen R. Rao; Bongki Moon

    2009-01-01

    One of the key challenges in a peer-to-peer (P2P) network is to efficiently locate relevant data sources across a large number of participating peers. With the increasing popularity of the extensible markup language (XML) as a standard for information interchange on the Internet, XML is commonly used as an underlying data model for P2P applications to deal with the heterogeneity

  7. Scalable Filtering of Multiple Generalized-Tree-Pattern Queries over XML Streams

    Microsoft Academic Search

    Songting Chen; Hua-gang Li; Jun'ichi Tatemura; Wang-pin Hsiung; Divyakant Agrawal; K. Seluk Candan

    2008-01-01

    An XML publish\\/subscribe system needs to filter a large number of queries over XML streams. Most existing systems only consider filtering the simple XPath statements. In this paper, we focus on filtering of the more complex generalized-tree-pattern (GTP) queries. Our filtering mechanism is based on a novel Tree-of-Path (TOP) encoding scheme, which compactly represents the path matches for the entire

  8. A Lock Manager for Collaborative Processing of Natively Stored XML Documents

    Microsoft Academic Search

    Michael Peter Haustein; Theo Hrder

    2004-01-01

    Today, neither transactional provisions, in general, nor concurrency control, in particular, of DBMS-based pro- cessing are tailored to the specific needs of large and collaboratively used XML documents. Existing DBMSs more or less offer strictly serialized operations on them. To gain great progress in this area, we have implemented the XTC testbed as an (O)RDBMS-connected native XML database management system

  9. Integrated Design and Production Reference Integration with ArchGenXML V1.00

    SciTech Connect

    Barter, R H

    2004-07-20

    ArchGenXML is a tool that allows easy creation of Zope products through the use of Archetypes. The Integrated Design and Production Reference (IDPR) should be highly configurable in order to meet the needs of a diverse engineering community. Ease of configuration is key to the success of IDPR. The purpose of this paper is to describe a method of using a UML diagram editor to configure IDPR through ArchGenXML and Archetypes.

  10. A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object

    Microsoft Academic Search

    Roberto Di Cosmo; Delia Kesner

    1993-01-01

    We add extensional equalities for the functional and product types to the typed -calculuswith not only products and terminal object, but also sums and bounded recursion (a versionof recursion that does not allow recursive calls of infinite length). We provide a confluent andstrongly normalizing (thus decidable) rewriting system for the calculus, that stays confluentwhen allowing unbounded recursion. For that, we

  11. A Recursive Wavelet-based Strategy for Real-Time Cochlear Implant Speech Processing on PDA Platforms

    PubMed Central

    Gopalakrishna, Vanishree; Kehtarnavaz, Nasser; Loizou, Philipos C.

    2011-01-01

    This paper presents a wavelet-based speech coding strategy for cochlear implants. In addition, it describes the real-time implementation of this strategy on a PDA platform. Three wavelet packet decomposition tree structures are considered and their performance in terms of computational complexity, spectral leakage, fixed-point accuracy, and real-time processing are compared to other commonly used strategies in cochlear implants. A real-time mechanism is introduced for updating the wavelet coefficients recursively. It is shown that the proposed strategy achieves higher analysis rates than the existing strategies while being able to run in real-time on a PDA platform. In addition, it is shown that this strategy leads to a lower amount of spectral leakage. The PDA implementation is made interactive to allow users to easily manipulate the parameters involved and study their effects. PMID:20403778

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

    SciTech Connect

    Li Jing [University of Texas MD Anderson Cancer Center, Houston, TX (United States); Wang Meihua; Won, Minhee [RTOG Statistical Center, Philadelphia, PA (United States); Shaw, Edward G. [Wake Forest University School of Medicine, Winston-Salem, NC (United States); Coughlin, Christopher [Federal Bureau of Prisons, Butner, NC (United States); Curran, Walter J. [Emory Clinic, Atlanta, GA (United States); Mehta, Minesh P., E-mail: mehta@humonc.wisc.edu [University of Wisconsin-Madison School of Medicine and Public Health, Madison, WI (United States)

    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.

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

  14. Categorial compositionality III: F-(co)algebras and the systematicity of recursive capacities in human cognition.

    PubMed

    Phillips, Steven; Wilson, William H

    2012-01-01

    Human cognitive capacity includes recursively definable concepts, which are prevalent in domains involving lists, numbers, and languages. Cognitive science currently lacks a satisfactory explanation for the systematic nature of such capacities (i.e., why the capacity for some recursive cognitive abilities-e.g., finding the smallest number in a list-implies the capacity for certain others-finding the largest number, given knowledge of number order). The category-theoretic constructs of initial F-algebra, catamorphism, and their duals, final coalgebra and anamorphism provide a formal, systematic treatment of recursion in computer science. Here, we use this formalism to explain the systematicity of recursive cognitive capacities without ad hoc assumptions (i.e., to the same explanatory standard used in our account of systematicity for non-recursive capacities). The presence of an initial algebra/final coalgebra explains systematicity because all recursive cognitive capacities, in the domain of interest, factor through (are composed of) the same component process. Moreover, this factorization is unique, hence no further (ad hoc) assumptions are required to establish the intrinsic connection between members of a group of systematically-related capacities. This formulation also provides a new perspective on the relationship between recursive cognitive capacities. In particular, the link between number and language does not depend on recursion, as such, but on the underlying functor on which the group of recursive capacities is based. Thus, many species (and infants) can employ recursive processes without having a full-blown capacity for number and language. PMID:22514704

  15. Categorial Compositionality III: F-(co)algebras and the Systematicity of Recursive Capacities in Human Cognition

    PubMed Central

    Phillips, Steven; Wilson, William H.

    2012-01-01

    Human cognitive capacity includes recursively definable concepts, which are prevalent in domains involving lists, numbers, and languages. Cognitive science currently lacks a satisfactory explanation for the systematic nature of such capacities (i.e., why the capacity for some recursive cognitive abilitiese.g., finding the smallest number in a listimplies the capacity for certain othersfinding the largest number, given knowledge of number order). The category-theoretic constructs of initial F-algebra, catamorphism, and their duals, final coalgebra and anamorphism provide a formal, systematic treatment of recursion in computer science. Here, we use this formalism to explain the systematicity of recursive cognitive capacities without ad hoc assumptions (i.e., to the same explanatory standard used in our account of systematicity for non-recursive capacities). The presence of an initial algebra/final coalgebra explains systematicity because all recursive cognitive capacities, in the domain of interest, factor through (are composed of) the same component process. Moreover, this factorization is unique, hence no further (ad hoc) assumptions are required to establish the intrinsic connection between members of a group of systematically-related capacities. This formulation also provides a new perspective on the relationship between recursive cognitive capacities. In particular, the link between number and language does not depend on recursion, as such, but on the underlying functor on which the group of recursive capacities is based. Thus, many species (and infants) can employ recursive processes without having a full-blown capacity for number and language. PMID:22514704

  16. XML-based information system for planetary sciences

    NASA Astrophysics Data System (ADS)

    Carraro, F.; Fonte, S.; Turrini, D.

    2009-04-01

    EuroPlaNet (EPN in the following) has been developed by the planetological community under the "Sixth Framework Programme" (FP6 in the following), the European programme devoted to the improvement of the European research efforts through the creation of an internal market for science and technology. The goal of the EPN programme is the creation of a European network aimed to the diffusion of data produced by space missions dedicated to the study of the Solar System. A special place within the EPN programme is that of I.D.I.S. (Integrated and Distributed Information Service). The main goal of IDIS is to offer to the planetary science community a user-friendly access to the data and information produced by the various types of research activities, i.e. Earth-based observations, space observations, modeling, theory and laboratory experiments. During the FP6 programme IDIS development consisted in the creation of a series of thematic nodes, each of them specialized in a specific scientific domain, and a technical coordination node. The four thematic nodes are the Atmosphere node, the Plasma node, the Interiors & Surfaces node and the Small Bodies & Dust node. The main task of the nodes have been the building up of selected scientific cases related with the scientific domain of each node. The second work done by EPN nodes have been the creation of a catalogue of resources related to their main scientific theme. Both these efforts have been used as the basis for the development of the main IDIS goal, i.e. the integrated distributed service. An XML-based data model have been developed to describe resources using meta-data and to store the meta-data within an XML-based database called eXist. A search engine has been then developed in order to allow users to search resources within the database. Users can select the resource type and can insert one or more values or can choose a value among those present in a list, depending on selected resource. The system searches for all the resources containing the inserted values within the resources descriptions. An important facility of the IDIS search system is the multi-node search capability. This is due to the capacity of eXist to make queries on remote databases. This allows the system to show all resources which satisfy the search criteria on local node and to show how many resources are found on remote nodes, giving also a link to open the results page on remote nodes. During FP7 the development of the IDIS system will have the main goal to make the service Virtual Observatory compliant.

  17. Multi-objective integer programming: An improved recursive algorithm

    E-print Network

    Ozlen, Melih

    2011-01-01

    This paper introduces an improved recursive algorithm to generate the set of all nondominated objective vectors for the Multi-Objective Integer Programming (MOIP) problem. We significantly improve the earlier recursive algorithm of \\"Ozlen and Azizo\\u{g}lu by using the set of already solved subproblems and their solutions to avoid solving a large number of IPs. A numerical example is presented to explain the workings of the algorithm, and we conduct a series of randomised computational experiments to show the savings that can be obtained. As our experiments show, the improvement becomes more significant as the problems grow larger in terms of the number of rows, columns, objectives, and nondominated objective vectors.

  18. ROOM: A recursive object oriented method for information systems development

    SciTech Connect

    Thelliez, T.; Donahue, S.

    1994-02-09

    Although complementary for the development of complex systems, top-down structured design and object oriented approach are still opposed and not integrated. As the complexity of the systems are still growing, and the so-called software crisis still not solved, it is urgent to provide a framework mixing the two paradigms. This paper presents an elegant attempt in this direction through our Recursive Object-Oriented Method (ROOM) in which a top-down approach divides the complexity of the system and an object oriented method studies a given level of abstraction. Illustrating this recursive schema with a simple example, we demonstrate that we achieve the goal of creating loosely coupled and reusable components.

  19. One loop integration with hypergeometric series by using recursion relations

    NASA Astrophysics Data System (ADS)

    Watanabe, Norihisa; Kaneko, Toshiaki

    2014-06-01

    General one-loop integrals with arbitrary mass and kinematical parameters in d-dimensional space-time are studied. By using Bernstein theorem, a recursion relation is obtained which connects (n + 1)-point to n-point functions. In solving this recursion relation, we have shown that one-loop integrals are expressed by a newly defined hypergeometric function, which is a special case of Aomoto-Gelfand hypergeometric functions. We have also obtained coefficients of power series expansion around 4-dimensional space-time for two-, three- and four-point functions. The numerical results are compared with "LoopTools" for the case of two- and three-point functions as examples.

  20. Fast, recursive-least-squares transversal filters for adaptive filtering

    Microsoft Academic Search

    J. M. Cioffi; T. Kailath

    1984-01-01

    Fast transversal filter (FTF) implementations of recursive-least-squares (RLS) adaptive-filtering algorithms are presented in this paper. Substantial improvements in transient behavior in comparison to stochastic-gradient or LMS adaptive algorithms are efficiently achieved by the presented algorithms. The true, not approximate, solution of the RLS problem is always obtained by the FTF algorithms even during the critical initialization period (first N iterations)

  1. Global asymptotic stability for two recursive difference equations

    Microsoft Academic Search

    Xianyi Li; Deming Zhu

    2004-01-01

    Two sufficient conditions are obtained for the global asymptotic stability of the following two recursive difference equationsxn+1=xnxn?1+xn?2+axn+xn?1xn?2+a,n=0,1,2,,andxn+1=xn?1+xnxn?2+axnxn?1+xn?2+a,n=0,1,2,,where a?[0,?) and the initial values x?2,x?1,x0?(0,?). Some known results are included.

  2. Recursion and Grammars for CS2 Viera K. Proulx

    E-print Network

    Proulx, Viera K.

    distance while lifting the pen symbol f · turn (left or right) by a fixed angle symbols + and ­ Partial. For example, the Koch snowflake is described by the following grammar: angle = 60° S -> F­­F­­F the starting string F -> F+F­­F+F rewriting rule for symbol F at recursion levels > 0 The snowflakes at the first

  3. A fast recursive algorithm for molecular dynamics simulation

    NASA Technical Reports Server (NTRS)

    Jain, A.; Vaidehi, N.; Rodriguez, G.

    1993-01-01

    The present recursive algorithm for solving molecular systems' dynamical equations of motion employs internal variable models that reduce such simulations' computation time by an order of magnitude, relative to Cartesian models. Extensive use is made of spatial operator methods recently developed for analysis and simulation of the dynamics of multibody systems. A factor-of-450 speedup over the conventional O(N-cubed) algorithm is demonstrated for the case of a polypeptide molecule with 400 residues.

  4. On binary search tree recursions with monomials as toll functions

    NASA Astrophysics Data System (ADS)

    Neininger, Ralph

    2002-05-01

    We consider distributional recursions which appear in the study of random binary search trees with monomials as toll functions. This extends classical parameters as the internal path length in binary search trees. As our main results we derive asymptotic expansions for the moments of the random variables under consideration as well as limit laws and properties of the densities of the limit distributions. The analysis is based on the contraction method.

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

    NASA Astrophysics Data System (ADS)

    Kazarian, Maxim; Zograf, Peter

    2015-06-01

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

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

  7. H? bounds for the recursive-least-squares algorithm

    Microsoft Academic Search

    B. Hassibi; Thomas Kailath

    1994-01-01

    We obtain upper and lower bounds for the H? norm of the RLS (recursive-least-squares) algorithm. The H? norm may be regarded as the worst-case energy gain from the disturbances to the prediction errors, and is therefore a measure of the robustness of an algorithm to perturbations and model uncertainty. Our results allow one to compare the robustness of RLS compared

  8. Data-Driven Controller Unfalsification With Analytic Update Applied to a Motion System

    Microsoft Academic Search

    Jeroen van Helvoort; Bram de Jager; Maarten Steinbuch

    2008-01-01

    Ellipsoidal unfalsified control is a plant-model-free, data-driven control design method. It recursively checks, using available data, whether the ability of a controller to meet a predefined performance requirement is (un)falsified. The set of unfalsified controllers is described by an ellipsoid in the control parameter space. The update of the ellipsoid employing new measurements can be computed analytically, hence, it is

  9. P-recursive sequence and key-dependent multimedia scrambling

    NASA Astrophysics Data System (ADS)

    Zhou, Yicong; Panetta, Karen; Agaian, Sos

    2008-04-01

    Multimedia scrambling technologies ensure that multimedia content is only used by authorized users by transforming multimedia data into an unintelligible format. This paper introduces a new P-recursive sequence and two multimedia scrambling algorithms based on the P-recursive sequence. The P-recursive sequence is a more generalized sequence which can derive many well-known sequences such as the P-Fibonacci sequence, the P-Lucas sequence and P-Gray code. The algorithms can be used to scramble two or three dimensional multimedia data in one step. Electronic signatures, grayscale images and three-color-component images are all examples of 2-D and 3-D multimedia data which can utilize these algorithms. Furthermore, a security key parameter p may be chosen as different or the same values for each dimensional component of the multimedia data. Experiments show that the presented algorithms can scramble multimedia data at different levels of security by partially or fully encrypting multimedia data. They also have been demonstrated in the experiments to show good performance in known-plain text attack and common image attacks such as data loss, Gaussian noise, and Salt Pepper noise. The scrambled multimedia data can be completely reconstructed only by using the correct security keys.

  10. Parallelizable approximate solvers for recursions arising in preconditioning

    SciTech Connect

    Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)

    1996-12-31

    For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.

  11. An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems

    SciTech Connect

    Seal, Sudip K [ORNL] [ORNL

    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.

  12. Identifying clusters in genomics data by recursive partitioning.

    PubMed

    Nilsen, Gro; Borgan, Ornulf; Liestl, Knut; Lingjrde, Ole Christian

    2013-10-01

    Genomics studies frequently involve clustering of molecular data to identify groups, but common clustering methods such as K-means clustering and hierarchical clustering do not determine the number of clusters. Methods for estimating the number of clusters typically focus on identifying the global structure in the data, however the discovery of substructures within clusters may also be of great biological interest. We propose a novel method, Partitioning Algorithm based on Recursive Thresholding (PART), that recursively uncovers distinct subgroups in the groups already identified. Outliers are common in high-dimensional genomics data and may mask the presence of substructure within a cluster. A crucial feature of the algorithm is the introduction of tentative splits of clusters to isolate outliers that might otherwise halt the recursion prematurely. The method is demonstrated on simulated as well as a wide range of real data sets from gene expression microarrays, where the correct clusters were known in advance. When subclusters are present and the variance is large or varies between the clusters, the proposed method performs better than two established global methods on simulated data. On the real data sets the overall performance of PART is superior to the global methods when used in combination with hierarchical clustering. The method is implemented in the R package clusterGenomics and is freely available from CRAN (The Comprehensive R Archive Network). PMID:23942354

  13. RBU+: Recursive Binding Update for End-to-End Route Optimization in Nested Mobile Networks

    E-print Network

    through wireless technologies using their own IP address. The Mobile-IP Working Group in the Internet devices, but also vehicles, can be connected to the Internet [3]. Mobile devices can connect to the Internet even from within vehicles. In addition, they can move in groups, e.g. a radio, a mobile phone

  14. Converting biomolecular modelling data based on an XML representation.

    PubMed

    Sun, Yudong; McKeever, Steve

    2008-01-01

    Biomolecular modelling has provided computational simulation based methods for investigating biological processes from quantum chemical to cellular levels. Modelling such microscopic processes requires atomic description of a biological system and conducts in fine timesteps. Consequently the simulations are extremely computationally demanding. To tackle this limitation, different biomolecular models have to be integrated in order to achieve high-performance simulations. The integration of diverse biomolecular models needs to convert molecular data between different data representations of different models. This data conversion is often non-trivial, requires extensive human input and is inevitably error prone. In this paper we present an automated data conversion method for biomolecular simulations between molecular dynamics and quantum mechanics/molecular mechanics models. Our approach is developed around an XML data representation called BioSimML (Biomolecular Simulation Markup Language). BioSimML provides a domain specific data representation for biomolecular modelling which can effciently support data interoperability between different biomolecular simulation models and data formats. PMID:20134068

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

  16. On the Development of a User-Defined Quality Measurement Tool for XML Documents

    NASA Astrophysics Data System (ADS)

    Pardede, Eric; Gaur, Tejasvi

    The capability of eXtensible Markup Language (XML) for data representation has been widely accepted by research communities and industries. Even though it can be used for efficient data transfer, many industries look for a more promising language on which to rely when it comes to their important data. An ability to provide good XML data quality is necessary to make this data format more reliable and usable. To measure data quality, the current methods are largely driven by structural and technical factors and often assess data quality impartially, not accounting for contextual factors. It is well known that different data share common quality features: completeness, validity, accuracy and timeliness. Nevertheless, the measurement of quality features will be unique, based on the data format. The measurement of quality for XML documents cannot be generalised from quality measurement in other data formats. In this chapter, we describe the development of a user-defined quality metric for XML documents. For implementation, we develop a tool that enables users to control XML data quality. We use a case study in health informatics as the proof of concept.

  17. RESRAD update

    SciTech Connect

    Yu, C.; Cheng, J.J.; Zielen, A.J.; Jones, L.G.; LePoire, D.J.; Wang, Y.Y. (Argonne National Lab., IL (United States)); Yuan, Y.C. (Square Y Consultants, Orchard Park, NY (United States)); Loureiro, C.O. (Minas Gerais Univ., Belo Horizonte, MG (Brazil). Escola de Engenharia); Wallo, A. III; Peterson, H. (USDOE Assistant Secretary for Environment, Safety, and Health, Washington, DC (United States). Offic

    1993-01-01

    A microcomputer program called RESRAD, which implements a pathway analysis method for radiological risk assessment, was developed by Argonne National Laboratory (ANL) in 1989. This program is used to derive allowable residual concentrations of radionuclides in soil and to predict effective dose equivalents and excess cancer incidence risks incurred by an individual exposed to radioactive materials. Since its development, the RESRAD code has been adopted by DOE in Order 5400.5 for the derivation of soil cleanup criteria and dose calculations, and it has been used widely by DOE, other agencies, and their contractors. The original models used by ANL to develop RESRAD were initially developed as part of a DOE effort that began in the early 1980s and involved most of the national laboratories and DOE program offices. The RESRAD code is continuously improved and updated to incorporate comments from users and new features that ease the interaction with users and increase the code's capability and flexibility. The DOE Offices of Environmental Guidance and Environmental Restoration also provide periodic guidance regarding any significant changes to the code. The RESRAD update, Version 5.0, has substantial improvements in many aspects compared with the last version released in 1989.

  18. RESRAD update

    SciTech Connect

    Yu, C.; Cheng, J.J.; Zielen, A.J.; Jones, L.G.; LePoire, D.J.; Wang, Y.Y. [Argonne National Lab., IL (United States); Yuan, Y.C. [Square Y Consultants, Orchard Park, NY (United States); Loureiro, C.O. [Minas Gerais Univ., Belo Horizonte, MG (Brazil). Escola de Engenharia; Wallo, A. III; Peterson, H. [USDOE Assistant Secretary for Environment, Safety, and Health, Washington, DC (United States). Office of Environmental Guidance; H Williams, W.A. [USDOE Assistant Secretary for Environmental Restoration and Waste Management, Washington, DC (United States)

    1993-05-01

    A microcomputer program called RESRAD, which implements a pathway analysis method for radiological risk assessment, was developed by Argonne National Laboratory (ANL) in 1989. This program is used to derive allowable residual concentrations of radionuclides in soil and to predict effective dose equivalents and excess cancer incidence risks incurred by an individual exposed to radioactive materials. Since its development, the RESRAD code has been adopted by DOE in Order 5400.5 for the derivation of soil cleanup criteria and dose calculations, and it has been used widely by DOE, other agencies, and their contractors. The original models used by ANL to develop RESRAD were initially developed as part of a DOE effort that began in the early 1980s and involved most of the national laboratories and DOE program offices. The RESRAD code is continuously improved and updated to incorporate comments from users and new features that ease the interaction with users and increase the code`s capability and flexibility. The DOE Offices of Environmental Guidance and Environmental Restoration also provide periodic guidance regarding any significant changes to the code. The RESRAD update, Version 5.0, has substantial improvements in many aspects compared with the last version released in 1989.

  19. The Oracle XML Database Team* (Full time position only, no internships) Come join a team of energetic and easy going people with a passion to

    E-print Network

    Plotkin, Joshua B.

    The Oracle XML Database Team* (Full time position only, no internships) Come join a team for the Oracle database. These technologies are used by several other internal and external customers besides this need, Oracle XML DB has been developed as a high-performance, native XML storage technology

  20. Integrating Web information with XML Concrete Views Tuyt-Trm Dang-Ngoc Huaizhong Kou Georges Gardarin

    E-print Network

    Boyer, Edmond

    Integrating Web information with XML Concrete Views Tuyt-Trm Dang-Ngoc Huaizhong Kou Georges.Lastname}@prism.uvsq.fr ABSTRACT To cope with the difficulties of Web information search, lots of technologies related to Web another Web search engines with general purpose, this paper couples text mining and XML view caching

  1. ARCOLite --an XML based system for building and presenting Virtual Museum Exhibitions using Web3D and Augmented Reality

    E-print Network

    Liarokapis, Fotis

    .Liarokapis, N.Mourkoussis, A.Basu, J.Darcy, P.Petridis, M.Sifniotis, P.F.Lister}@sussex.ac.uk Abstract of virtual artefacts including virtual reconstruction of buildings; XML content management, XML technologies. A traditional display cabinet in a museum forces the visitor to take the museum curators perspective

  2. Let's Have a party! An Open-Source Toolbox for Recursive Partytioning

    Microsoft Academic Search

    Torsten Hothorn; Achim Zeileis; Kurt Hornik

    Package party, implemented in the R system for statistical computing, provides basic classes and methods for recursive partitioning along with reference implementations for three recently- suggested tree-based learners: conditional inference trees and forests, and model-based recursive partitioning. 1. Overview Tree-based learners, also known as recursive partitioning techniques, belong to the core tools for clas- sification and regression, both in the

  3. At-sea demonstration of RF sensor tasking using XML over a worldwide network

    NASA Astrophysics Data System (ADS)

    Kellogg, Robert L.; Lee, Tom; Dumas, Diane; Raggo, Barbara

    2003-07-01

    As part of an At-Sea Demonstration for Space and Naval Warfare Command (SPAWAR, PMW-189), a prototype RF sensor for signal acquisition and direction finding queried and received tasking via a secure worldwide Automated Data Network System (ADNS). Using extended mark-up language (XML) constructs, both mission and signal tasking were available for push and pull Battlespace management. XML tasking was received by the USS Cape St George (CG-71) during an exercise along the Gulf Coast of the US from a test facility at SPAWAR, San Diego, CA. Although only one ship was used in the demonstration, the intent of the software initiative was to show that a network of different RF sensors on different platforms with different capabilitis could be tasked by a common web agent. A sensor software agent interpreted the XML task to match the sensor's capability. Future improvements will focus on enlarging the domain of mission tasking and incorporate report management.

  4. Supporting clinical practice guidelines: lifecycle of guidelines for oncology within an XML-based guideline framework.

    PubMed

    Mludek, Volker; Wolff, Astrid Corinna; van der Haak, Minne; Schweiger, Ralf; Hlzer, Simon; Dudeck, Joachim; Wetter, Thomas

    2002-01-01

    Clinical Practice Guidelines (CPGs) have become important instruments for supporting patient care. Many structure models for CPGs have been developed to explicitly gain structured CPG documents, some of them using XML. Often, however, problems arise in filling these structures with content and integrating CPG applications into an EPR/HIS The Universities of Giessen and Heidelberg have each presented an XML-based CPG structure, which are actually being merged into one. The obtained CPG structure will build our common "xCPG core model" embedded in an "XML framework", an authoring environment. This paper shows how this model used in the framework could support the entire 5-step CPG lifecycle, spanning CPG development, the integration of a CPG into an EPR/HIS, as well as maintenance. Furthermore, this paper points out how the method draws on the different information management services as a precondition for successful CPG implementation. PMID:15460738

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

    PubMed

    Oak, Mayura; Mandke, Rhishikesh

    2014-11-01

    The current industry update covers the period 1-31 August 2014, with the information largely based on company press releases, and news from regulatory agencies, patents and various news websites. On the product approval front, Genzyme, The Medicines Company, Merck, Sharpe & Dohme Corporation, Genentech/Roche, and Boehringer Ingelheim-Eli Lilly reported approval of new products. There was promising news on the clinical trial front for the experimental vaccine to prevent the mosquito-borne viral disease 'chikungunya'. The recent multibillion-dollar deal in the pharma sector is the acquisition of InterMune Inc., a California-based biotech firm, by Roche Holding AG. Also, Cilag GmbH International has announced acquisition of Covagen AG, a privately-held biopharmaceutical company. PMID:25491668

  7. Ethics Updates

    NSDL National Science Digital Library

    Hinman, Lawrence M.

    Created in 1994 by Professor Lawrence M. Hinman of the University of San Diego, the Ethics Updates site is designed primarily to be used to ethics instructors and their students. However, the site is rather interesting, so members of the general public may find themselves making a few return visits. Visitors can use the drop-down tabs on the top of the homepage to make their way through sections that cover some of the basic theories of ethics and also learn more about applied ethics in relation to such issues as animal rights, torture, and world hunger. Moving on, the "Resources" area includes case studies for discussion, a glossary of terms, classic texts in ethics, and ethics surveys. The site is rounded out by a search engine and a selection of videos that deal with various topics in ethics.

  8. Research on heterogeneous data query and sharing mode based on XML

    NASA Astrophysics Data System (ADS)

    Sang, Yaqun; Mu, Qi

    2013-07-01

    At present, XML language has been regarded as a standard of data exchange due to such attributes as being unrelevant to platform, auto-description of itself, easy extention, separation of content and form, and so on. Therefore, in the course of study of share of heterogeneous-data in coal enterprises, we design a heterogeneous-data query system based on XML to provide a unified data integration platform and share of information resource with high quality and speed, which will solve a problem with information islands produced in coal enterprises.

  9. Scattering amplitudes and BCFW recursion in twistor space

    NASA Astrophysics Data System (ADS)

    Mason, Lionel; Skinner, David

    2010-01-01

    Twistor ideas have led to a number of recent advances in our understanding of scattering amplitudes. Much of this work has been indirect, determining the twistor space support of scattering amplitudes by examining the amplitudes in momentum space. In this paper, we construct the actual twistor scattering amplitudes themselves. We show that the recursion relations of Britto, Cachazo, Feng and Witten have a natural twistor formulation that, together with the three-point seed amplitudes, allows us to recursively construct general tree amplitudes in twistor space. We obtain explicit formulae for n-particle MHV and NMHV super-amplitudes, their CPT conjugates (whose representations are distinct in our chiral framework), and the eight particle N2MHV super-amplitude. We also give simple closed form formulae for the mathcal{N} = 8 supergravity recursion and the MHV and overline {text{MHV}} amplitudes. This gives a formulation of scattering amplitudes in maximally supersymmetric theories in which superconformal symmetry and its breaking is manifest. For N k MHV, the amplitudes are given by 2 n - 4 integrals in the form of Hilbert transforms of a product of n - k - 2 purely geometric, superconformally invariant twistor delta functions, dressed by certain sign operators. These sign operators subtly violate conformal invariance, even for tree-level amplitudes in mathcal{N} = 4 super Yang-Mills, and we trace their origin to a topological property of split signature space-time. We develop the twistor transform to relate our work to the ambidextrous twistor diagram approach of Hodges and of Arkani-Hamed, Cachazo, Cheung and Kaplan.

  10. Scattering Amplitudes and BCFW Recursion in Twistor Space

    E-print Network

    Lionel Mason; David Skinner

    2009-12-10

    Twistor ideas have led to a number of recent advances in our understanding of scattering amplitudes. Much of this work has been indirect, determining the twistor space support of scattering amplitudes by examining the amplitudes in momentum space. In this paper, we construct the actual twistor scattering amplitudes themselves. We show that the recursion relations of Britto, Cachazo, Feng and Witten have a natural twistor formulation that, together with the three-point seed amplitudes, allows us to recursively construct general tree amplitudes in twistor space. We obtain explicit formulae for $n$-particle MHV and NMHV super-amplitudes, their CPT conjugates (whose representations are distinct in our chiral framework), and the eight particle N^2MHV super-amplitude. We also give simple closed form formulae for the N=8 supergravity recursion and the MHV and conjugate MHV amplitudes. This gives a formulation of scattering amplitudes in maximally supersymmetric theories in which superconformal symmetry and its breaking is manifest. For N^kMHV, the amplitudes are given by 2n-4 integrals in the form of Hilbert transforms of a product of $n-k-2$ purely geometric, superconformally invariant twistor delta functions, dressed by certain sign operators. These sign operators subtly violate conformal invariance, even for tree-level amplitudes in N=4 super Yang-Mills, and we trace their origin to a topological property of split signature space-time. We develop the twistor transform to relate our work to the ambidextrous twistor diagram approach of Hodges and of Arkani-Hamed, Cachazo, Cheung and Kaplan.

  11. Recursive partitioned inversion of large (1500 x 1500) symmetric matrices

    NASA Technical Reports Server (NTRS)

    Putney, B. H.; Brownd, J. E.; Gomez, R. A.

    1976-01-01

    A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.

  12. Ladder operators and recursion relations for the associated Bessel polynomials

    NASA Astrophysics Data System (ADS)

    Fakhri, H.; Chenaghlou, A.

    2006-10-01

    Introducing the associated Bessel polynomials in terms of two non-negative integers, and under an integrability condition we simultaneously factorize their corresponding differential equation into a product of the ladder operators by four different ways as shape invariance symmetry equations. This procedure gives four different pairs of recursion relations on the associated Bessel polynomials. In spite of description of Bessel and Laguerre polynomials in terms of each other, we show that the associated Bessel differential equation is factorized in four different ways whereas for Laguerre one we have three different ways.

  13. Recursive Neural Networks for Undirected Graphs for Learning Molecular Endpoints

    Microsoft Academic Search

    Ian Walsh; Alessandro Vullo; Gianluca Pollastri

    2009-01-01

    Accurately predicting the endpoints of chemical compounds is an important step towards drug design and molecular screening\\u000a in particular.\\u000a \\u000a Here we develop a recursive architecture that is capable of mapping Undirected Graphs into individual labels, and apply it\\u000a to the prediction of a number of different properties of small molecules. The results we obtain are generally state-of-the-art.\\u000a \\u000a \\u000a \\u000a The final model

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

    class, irrigation water availability for each of 18 irrigation periods and a total annual water use constraint. The model can be run as either a static single period optimization or as a recursive, temporal model When operated in the recursive mode...

  15. Feature Extraction Using Recursive Cluster-Based Linear Discriminant With Application to Face Recognition

    Microsoft Academic Search

    C. Xiang; D. Huang

    2006-01-01

    A novel recursive procedure for extracting discriminant features, termed recursive cluster-based linear discriminant (RCLD), is proposed in this paper. Compared to the traditional Fisher linear discriminant (FLD) and its variations, RCLD has a number of advantages. First of all, it relaxes the constraint on the total number of features that can be extracted. Second, it fully exploits all information available

  16. Recursive algorithms in computer science courses: Fibonacci numbers and binomial coefficients

    Microsoft Academic Search

    I. Stojmenovic; Binomial Coefficients

    2000-01-01

    We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science courses in the first three years of the curriculum. Fibonacci numbers and binomial coefficients were frequently used as examples of branched recursive functions. However, their exponential time complexity was rarely claimed and never completely proved in the textbooks. Alternative

  17. A Rational Reconstruction and Extension of Recursion Analysis * Alan Bundy, Frank van Harmelen, Jane Hesketh

    E-print Network

    van Harmelen, Frank

    theorem. Proof plans provide this flex- ible application. Each tactic is partially specified by a methodA Rational Reconstruction and Extension of Recursion Analysis * Alan Bundy, Frank van Harmelen of re- cur8\\on analysis. Recursion analysis is used by the Boyer-Moore Theorem Prover to choose

  18. Generalized Path Analysis and Generalized Simultaneous Equations Model for Recursive Systems with Responses of Mixed Types

    ERIC Educational Resources Information Center

    Tsai, Tien-Lung; Shau, Wen-Yi; Hu, Fu-Chang

    2006-01-01

    This article generalizes linear path analysis (PA) and simultaneous equations models (SiEM) to deal with mixed responses of different types in a recursive or triangular system. An efficient instrumental variable (IV) method for estimating the structural coefficients of a 2-equation partially recursive generalized path analysis (GPA) model and

  19. Optimal recursive filtering, prediction, and smoothing for singular stochastic discrete-time systems

    Microsoft Academic Search

    Huanshui Zhang; Lihua Xie; Yeng Chai Soh

    1999-01-01

    A new and simple approach to optimal recursive filtering, prediction, and smoothing for singular stochastic discrete-time systems is presented by using a time-domain innovation analysis method. The estimators are calculated based on an ARMA innovation model which can be obtained using spectral factorization or a recursive identifier. The prediction problem for the singular systems is solved with the aid of

  20. Recursive formulation of class 1 and 2 time domain Wiener estimation matrix filters

    Microsoft Academic Search

    Jenny Ho; Claude S. Lindquist

    1991-01-01

    Matrix filters can be implemented using block processing or recursive processing. Recursive processing is used to generate the output of time-invariant periodic and nonperiodic systems and time-varying memoryless systems for Class 1 and 2 filters. Simulations are presented to illustrate the relationships among signal characteristics, smoothing effects, and computational efficiency. It is noted that the types of estimation problems define