These are representative sample records from Science.gov related to your search topic.
For comprehensive and current results, perform a real-time search at Science.gov.
1

Processing Continuous Historical Queries over XML Update Streams  

E-print Network

, such as stock tickers. But when ap- plied to XML data, it is still an open problem to find an effective method, processing stock mar- ket updates and real-time news feeds (RSS), and extracting XML descriptors

Fegaras, Leonidas

2

Xerial: An Update Tolerant and High Concurrent XML Database  

Microsoft Academic Search

XML has a variety of properties such as tree structures, doc- ument order of nodes, a tag name accompanied each node, etc. These various aspects of XML make query processing difficult, and index structures for this purpose have attracted research at- tention. On the other hand, updates and concurrency control in XML have usually been left untouched. However, the design

Taro L. Saito; Shinichi Morishita

3

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

NASA Astrophysics Data System (ADS)

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

Peng, Yankun; Lu, Renfu

2007-09-01

4

Probing recursion.  

PubMed

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

Lobina, David J

2014-11-01

5

Recursion Mathematics.  

ERIC Educational Resources Information Center

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)

Olson, Alton T.

1989-01-01

6

On recursion.  

PubMed

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 language-the faculty of language in the narrow sense (FLN)-is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded-existent or 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 principled-and potentially unbounded-expansion of strongly generated structure). By these necessary and sufficient criteria, the grammars of all natural languages are recursive. PMID:24409164

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

2014-01-01

7

On recursion  

PubMed Central

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 language—the faculty of language in the narrow sense (FLN)—is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded—existent or 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 principled—and potentially unbounded—expansion of strongly generated structure). By these necessary and sufficient criteria, the grammars of all natural languages are recursive. PMID:24409164

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

2014-01-01

8

XML Keyword Search Introduction  

E-print Network

XML Keyword Search CIS650 Yong Cha #12;Introduction T One of the goals of XML is to represent of the paper is to combine database-style query language with free- text search. #12;Role of RDBMS in XML keyword search T XML is rapidly becoming data format of choice, but retrieving data from large XML sources

Ives, Zachary G.

9

XML for Bioinformatics XML for Bioinformatics  

E-print Network

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

Richer, Jean-Michel

10

EXRT: Towards a Simple Benchmark for XML Readiness Testing  

NASA Astrophysics Data System (ADS)

As we approach the ten-year anniversary of the first working draft of the XQuery language, one finds XML storage and query support in a number of commercial database systems. For many XML use cases, database vendors now recommend storing and indexing XML natively and using XQuery or SQL/XML to query and update XML directly. If the complexity of the XML data allows, shredding and reconstructing XML to/from relational tables is still an alternative as well, and might in fact outperform native XML processing. In this paper we report on an effort to evaluate these basic XML data management trade-offs for current commercial systems. We describe EXRT (Experimental XML Readiness Test), a simple micro-benchmark that methodically evaluates the impact of query characteristics on the comparison of shredded and native XML. We describe our experiences and preliminary results from EXRT'ing pressure on the XML data management facilities offered by two relational databases and one XML database system.

Carey, Michael J.; Ling, Ling; Nicola, Matthias; Shao, Lin

11

Semantically Interoperable XML Data  

PubMed Central

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.

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

2013-01-01

12

ScotlandsPlaces XML: Bespoke XML or XML Mapping?  

ERIC Educational Resources Information Center

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

Beamer, Ashley; Gillick, Mark

2010-01-01

13

Searching XML documents via XML fragments  

Microsoft Academic Search

Most of the work on XML query and search has stemmed from the publishing and database communities, mostly for the needs of business applications. Recently, the Information Retrieval community began investigating the XML search issue to answer information discovery needs. Following this trend, we present here an approach where information needs can be expressed in an approximate manner as pieces

David Carmel; Yoelle S. Maarek; Matan Mandelbrod; Yosi Mass; Aya Soffer

2003-01-01

14

XML Based Course Websites.  

ERIC Educational Resources Information Center

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

Wollowski, Michael

15

Introduction Basic XML concepts Challenges in XML IR Vector space model for XML IR Evaluation of XML IR Web Search and Text Mining  

E-print Network

Introduction Basic XML concepts Challenges in XML IR Vector space model for XML IR Evaluation of XML IR Web Search and Text Mining http://www.cc.gatech.edu/~agray/6240spr11 IIR 10: XML Retrieval;Introduction Basic XML concepts Challenges in XML IR Vector space model for XML IR Evaluation of XML IR

Gray, Alexander

16

Kalchas: a dynamic XML search engine  

Microsoft Academic Search

This paper outlines the system architecture and the core data structures of Kalchas, a fulltext search engine for XML data with emphasis on dynamic indexing, and identifies features worth demonstrating. The concept of dynamic index implies that the aim is to re ect the creation of, deletion of, and updates to relevant files in the search index as early as

Rasmus Kaae; Thanh-Duy Nguyen; Dennis Nørgaard; Albrecht Schmidt

2005-01-01

17

Personalizing XML Search in PIMENTO  

Microsoft Academic Search

XML search is increasing in popularity as more and larger XML repositories are becoming available. The accuracy of XML search varies across different systems and a lot of effort is put into designing scoring functions tailored to specific users and datasets. We argue that there is no one scoring function that fits all and advocate incorporating user profiles into XML

Sihem Amer-yahia; Irini Fundulaki; Laks V. S. Lakshmanan

2007-01-01

18

Subtyping recursive types  

Microsoft Academic Search

We investigate the interactions of subtyping and recursive types, in a simply typed ?-calculus. The two fundamental questions here are whether two (recursive)types are in the subtype relation and whether a term has a type. To address the first question, we relate various definitions of type equivalence and subtyping that are induced by a model, an ordering on infinite trees,

Roberto M. Amadio; Luca Cardelli

1993-01-01

19

Recursive Parameter Estimation: Convergence  

Microsoft Academic Search

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general statistical model and study convergence.

Teo Sharia

2007-01-01

20

Recursive parameter estimation: convergence  

Microsoft Academic Search

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous\\u000a one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general statistical model and\\u000a study convergence.

Teo Sharia

2008-01-01

21

Recursion, Language, and Starlings  

ERIC Educational Resources Information Center

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

Corballis, Michael C.

2007-01-01

22

Scripting XML with Generic Haskell Frank Atanassow  

E-print Network

converters, XML parsers, XML validators, 1 #12;XML search engines, XML encryptors, XML compressors, etcScripting XML with Generic Haskell Frank Atanassow Dave Clarke Johan Jeuring institute;Scripting XML with Generic Haskell Frank Atanassow, Dave Clarke and Johan Jeuring July 28, 2003 Abstract

Utrecht, Universiteit

23

Scripting XML with Generic Haskell Frank Atanassow  

E-print Network

converters, XML parsers, XML validators, 1 #12; XML search engines, XML encryptors, XML compressors, etcScripting XML with Generic Haskell Frank Atanassow Dave Clarke Johan Jeuring institute; Scripting XML with Generic Haskell Frank Atanassow, Dave Clarke and Johan Jeuring July 28, 2003 Abstract

Utrecht, Universiteit

24

IBM Developers Portal: XML Zone  

NSDL National Science Digital Library

Within the IBM Developers Portal, XML Zone is probably the most complete and useful area to visit. Intended to be the premier destination for developer resources of any kind, XML Zone contains a good selection of pointers to XML tools and source code, annotated pointers to educational and reference resources, an XML email newsletter, and more. The site is organized in an easy-to-use fashion; users can conduct searches on an XML-specific search engine. XML Zone appears to be one of the more well-constructed XML web resources; with the resources of IBM behind it, XML Zone is sure to grow and to provide an important service to XML developers for a long time to come.

25

Prosody and recursion  

E-print Network

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

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

2005-01-01

26

Recursive relational urban design  

E-print Network

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

Hillman, Dessen

2014-01-01

27

Spiral through Recursion.  

ERIC Educational Resources Information Center

Presents an activity centering on Baravelle spirals in regular polygons to review and connect a number of algebraic and geometric topics, as well as to involve students in formal calculations, visualization, pattern discovery, series, estimation, and recursion. (MKR)

Choppin, Jeffrey M.

1994-01-01

28

VoiceXML Forum  

NSDL National Science Digital Library

The market for voice-operated applications has steadily grown for several years, and wireless and mobile devices are an added incentive to develop a standard for voice processing. An established standard is VoiceXML, which dates back to 1999. The VoiceXML Forum has introductory tutorials about the standard, and the full specifications can be downloaded (including a draft of version 2.0, published in early 2003). A more recent initiative is the Speech Application Language Tags (SALT) specification. Similar documents and resources can be found at the SALT Forum homepage, as well as links to Webcasts and other items for developers.

29

XML and Better Web Searching.  

ERIC Educational Resources Information Center

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

Jackson, Joe; Gilstrap, Donald L.

1999-01-01

30

The Recursion . . . Extended Rice . . .  

E-print Network

application, we get a very short proof of Rice's Theorem. Let C be such that PC = and PC = N, and let j PCThe 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

Gallier, Jean

31

XML Data Compression using Brevity Encoding Email: superjing@gmail.com krunapon@kku.ac.th  

E-print Network

Language) [11] BPEL, SVG, CML XML XML (Web Service) [21] Yahoo Search Web Services [23 XML XML Data Compression using Brevity Encoding Email: superjing@gmail.com krunapon@kku.ac.th XML XML XML XML XML (XBrevity*) XML XML XML : , Abstract XML becomes

Runapongsa, Kanda

32

Relationally Mapping XML Queries For Scalable XML Search  

Microsoft Academic Search

Abstract—The growing trend of using XML to share security data requires scalable technology to effectively manage,the volume and variety of data. Although a wide variety of methods exist for storing and searching XML, the two most common techniques are conventional tree-based approaches and relational approaches. Tree-based approaches represent XML as a tree and use indexes and path join algorithms to

Rebecca Cathey; Steven M. Beitzel; Eric C. Jensen; David A. Grossman; Ophir Frieder

2007-01-01

33

XML.com  

NSDL National Science Digital Library

Seybold Communications and O'Reilly and Associates offer this "preview edition" of a site due to officially launch on May 1, 1998; it is designed to be a clearinghouse of information about Extensible Markup Language for both introductory and advanced web developers. It features an annotated version of the XML 1.0 specification, provided by Tim Bray, one of the authors of the specification. The frame-based annotated XML specification contains historical commentary, technical explanations, advice on how to use parts of the specification, examples, and other miscellaneous annotations. In addition, users can access the toolbox (featuring RUWF--are you well formed?--a syntax checker, at this time), and news and analytic articles about the specification from various sources, including the Seybold Report on Internet Publishing.

34

Efficient Computation of Multiple XML Keyword Queries  

E-print Network

,cliu,jianxinli,rzhou}@swin.edu.au Abstract. Answering keyword queries on XML data has been exten- sively studied. Current XML keyword search notice that most XML keyword search solutions proposed so far primarily focus on single query setting queries q1={"keyword", "search", "probabilistic", "XML"}, q2 = {"rank", "keyword", "search", "XML"}, q3

Liu, Chengfei

35

Identifying Result Subdocuments of XML Search Conditions  

Microsoft Academic Search

XML is becoming widely used as a standard data format on the Web. Unlike SGML, XML documents do not require having their schemas. Since design of schemas of XML documents is not an easy task, a significant number of XML documents will be simply well-formed. We focus on miscellaneous well-formed XML documents with no common schemas. We articulate issues related

Hiroko Kinutani; Masatoshi Yoshikawa; Shunsuke Uemura

2000-01-01

36

phyloXML: XML for evolutionary biology and comparative genomics  

PubMed Central

Background Evolutionary trees are central to a wide range of biological studies. In many of these studies, tree nodes and branches need to be associated (or annotated) with various attributes. For example, in studies concerned with organismal relationships, tree nodes are associated with taxonomic names, whereas tree branches have lengths and oftentimes support values. Gene trees used in comparative genomics or phylogenomics are usually annotated with taxonomic information, genome-related data, such as gene names and functional annotations, as well as events such as gene duplications, speciations, or exon shufflings, combined with information related to the evolutionary tree itself. The data standards currently used for evolutionary trees have limited capacities to incorporate such annotations of different data types. Results We developed a XML language, named phyloXML, for describing evolutionary trees, as well as various associated data items. PhyloXML provides elements for commonly used items, such as branch lengths, support values, taxonomic names, and gene names and identifiers. By using "property" elements, phyloXML can be adapted to novel and unforeseen use cases. We also developed various software tools for reading, writing, conversion, and visualization of phyloXML formatted data. Conclusion PhyloXML is an XML language defined by a complete schema in XSD that allows storing and exchanging the structures of evolutionary trees as well as associated data. More information about phyloXML itself, the XSD schema, as well as tools implementing and supporting phyloXML, is available at . PMID:19860910

Han, Mira V; Zmasek, Christian M

2009-01-01

37

Optimizing XML Compression  

NASA Astrophysics Data System (ADS)

The eXtensible Markup Language (XML) provides a powerful and flexible means of encoding and exchanging data. As it turns out, its main advantage as an encoding format (namely, its requirement that all open and close markup tags are present and properly balanced) yields also one of its main disadvantages: verbosity. XML-conscious compression techniques seek to overcome this drawback. Many of these techniques first separate XML structure from the document content, and then compress each independently. Further compression gains can be realized by identifying and compressing together document content that is highly similar, thereby amortizing the storage costs of auxiliary information required by the chosen compression algorithm. Additionally, the proper choice of compression algorithm is an important factor not only for the achievable compression gain, but also for access performance. Hence, choosing a compression configuration that optimizes compression gain requires one to determine (1) a partitioning strategy for document content, and (2) the best available compression algorithm to apply to each set within this partition. In this paper, we show that finding an optimal compression configuration with respect to compression gain is an NP-hard optimization problem. This problem remains intractable even if one considers a single compression algorithm for all content. We also describe an approximation algorithm for selecting a partitioning strategy for document content based on the branch-and-bound paradigm.

Leighton, Gregory; Barbosa, Denilson

38

Recursive Parameter Estimation: Asymptotic expansion  

E-print Network

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. The model considered in the paper is very general as we do not impose any preliminary restrictions on the probabilistic nature of the observation process and cover a wide class of nonlinear recursive procedures. In this paper we study asymptotic behaviour of the recursive estimators. The results of the paper can be used to determine the form of a recursive procedure which is expected to have the same asymptotic properties as the corresponding non-recursive one defined as a solution of the corresponding estimating equation.

Sharia, Teo

2007-01-01

39

Document image representation using XML technologies  

NASA Astrophysics Data System (ADS)

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

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

2001-12-01

40

Ontology-Enabled XML Search  

Microsoft Academic Search

\\u000a XML is rapidly evolving towards the standard for data integration and exchange over the Internet and within intranets, covering\\u000a the complete spectrum from largely unstructured, ad hoc documents to highly structured, schematic data. However, established\\u000a XML query languages like XML-QL [96] or XQuery [34] cannot cope with the rapid growth of information in open environments\\u000a such as the Web or

Ralf Schenkel; Anja Theobald; Gerhard Weikum

2003-01-01

41

Recursive Microstates Model  

NSDL National Science Digital Library

The Recursive Microstates model considers an isolated system consisting of N identical, non-interacting quantum particles energy E. The model displays the total number of microstates accessible to the system with energy E. A second windows displays the entropy S(N,E).   For fixed total energy E, the model computes the number of microstates by considering a system of N distinguishable particles to be composed of a subsystem of N - 1 particles and a subsystem of 1 particle. The number of microstates is then constructed by summing the number of ways in which the subsystem of N ?1 particles can configure itself with energy E ? E? weighted by the degeneracy of the single particle level with energy E?. The Recursive Microstates model was developed by Wolfgang Christian, Trisha Salagaram, and Nithaya Chetty using the Easy Java Simulations (EJS) modeling tool. It is distributed as a ready-to-run (compiled) Java archive. Double clicking the ejs_stp_RecursiveMicrostates.jar file will run the program if Java is installed.

Christian, Wolfgang; Salagaram, Trisha; Chetty, Nithaya

2011-08-08

42

XML Databases and Biomedical Informatics  

E-print Network

XML Databases and Biomedical Informatics A report by James Lindsay for UCONN CSE 300, Spring 2008 Web Consortium, as a free and open standard [13-16]. In the field of biomedical informatics one of the long standing open problems is finding a way to share medical data across a variety of mediums. XML has

Demurjian, Steven A.

43

Recursive parameter estimation: asymptotic expansion  

Microsoft Academic Search

This paper is concerned with the asymptotic behaviour of estimation procedures which are recursive in the sense that each\\u000a successive estimator is obtained from the previous one by a simple adjustment. The results of the paper can be used to determine\\u000a the form of the recursive procedure which is expected to have the same asymptotic properties as the corresponding non-recursive

Teo Sharia

2010-01-01

44

Using recursion to compute the inverse of the genomic relationship matrix.  

PubMed

Computing the inverse of the genomic relationship matrix using recursion was investigated. A traditional algorithm to invert the numerator relationship matrix is based on the observation that the conditional expectation for an additive effect of 1 animal given the effects of all other animals depends on the effects of its sire and dam only, each with a coefficient of 0.5. With genomic relationships, such an expectation depends on all other genotyped animals, and the coefficients do not have any set value. For each animal, the coefficients plus the conditional variance can be called a genomic recursion. If such recursions are known, the mixed model equations can be solved without explicitly creating the inverse of the genomic relationship matrix. Several algorithms were developed to create genomic recursions. In an algorithm with sequential updates, genomic recursions are created animal by animal. That algorithm can also be used to update a known inverse of a genomic relationship matrix for additional genotypes. In an algorithm with forward updates, a newly computed recursion is immediately applied to update recursions for remaining animals. The computing costs for both algorithms depend on the sparsity pattern of the genomic recursions, but are lower or equal than for regular inversion. An algorithm for proven and young animals assumes that the genomic recursions for young animals contain coefficients only for proven animals. Such an algorithm generates exact genomic EBV in genomic BLUP and is an approximation in single-step genomic BLUP. That algorithm has a cubic cost for the number of proven animals and a linear cost for the number of young animals. The genomic recursions can provide new insight into genomic evaluation and possibly reduce costs of genetic predictions with extremely large numbers of genotypes. PMID:24679933

Misztal, I; Legarra, A; Aguilar, I

2014-06-01

45

Recursive Objects--An Object Oriented Presentation of Recursion  

ERIC Educational Resources Information Center

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…

Sher, David B.

2004-01-01

46

Xml in the Virtual Observatory  

NASA Astrophysics Data System (ADS)

XML is the lingua franca in the Web (and Grid) services world and so will play a major role in the construction of the Virtual Observatory. Its great advantages are its flexibility platform-independence ease of transformation and the wide variety of existing software that can process it. An obvious disadvantage in its use as an astronomical data format is its verbosity; the number of bytes taken up writing the XML tags can easily outnumber those constituting the actual astronomical data. This becomes prohibitively inefficient when large amounts of data are stored in XML and the developers of VOTable sought to circumvent this by allowing for the use of binary data either in the VOTable document itself or in an external file linked from it. The verbosity of XML in this regard is a problem in many other disciplines and computer scientists are developing more generic solutions to that found in the VOTable specification. In this paper we describe several of these projects currently underway in Edinburgh which focus on the compression and querying of XML and a technology for representing the structure of a binary file in XML enabling it to be read as if it were XML.

Mann, Robert; Baxter, Rob; Buneman, Peter; Byrne, Daragh; Hutchison, Rob; Koch, Christoph; Wen, Ted; Westhead, Martin

47

The XML Astronomical Data Center  

NASA Astrophysics Data System (ADS)

The eXtensible Markup Language (XML) is a document markup language for the creation of hierarchical information structures. The document designer specifies (in a DTD) requirements on the document's content and provides choices for attributes of the contents. XML is supported by most major commercial software developers world-wide. A rich array of tools are already available to process and display XML documents. The Astronomical Data Center (ADC, http://adc.gsfc.nasa.gov) is involved in a research project to define an XML format for the metadata of an astronomical repository and for large data tables. In the process, an XML tool box is being developed for importation, enhancement, and distribution of tabled data and their metadata documents. There is now a working draft Document Type Definition (DTD, at http://tarantella.gsfc.nasa.gov/xml/dataset.dtd) which specifies the required elements of content and their attributes. The ADC is actively creating designs for the flow of data through automated pipelines from authors and journal presses into the ADC's XML archive, as well as data retrieval through the web via the eXtensible Query Language (XQL) (see accompanying poster by B. Holmes).

Shaya, E. J.; Blackwell, J.; Gass, J.; Holmes, B.; Odegard, N.; Schneider, G. L.; Thomas, Brian; Sodroski, T.; Cheung, C. Y.

1999-12-01

48

TAX: A Tree Algebra for XML  

Microsoft Academic Search

Querying XML has been the subject of much recent investigation. A formal bulk algebra is essential for applying database-style optimization to XML queries. We develop such an algebra, called TAX (Tree Algebra for XML), for manipulating XML data, modeled as forests of labeled ordered trees. Motivated both by aesthetic considerations of intuitiveness, and by efficient computability and amenability to optimization,

H. V. Jagadish; Laks V. S. Lakshmanan; Divesh Srivastava; Keith Thompson

2001-01-01

49

XML Retrieval RuSSIR 2010  

E-print Network

) Research INEX 2002 ­ 2008 (XML retrieval evaluation) Quantum theory for IR Aggregated search Bridging Semi-structured Data/Metadata, XML Content and Structure Search #12;XML Retrieval 8 Problems of the IRXML Retrieval 1 RuSSIR 2010 XML Retrieval Mounia Lalmas mounia@acm.org About me Professor

Lalmas, Mounia

50

Recursive Green's function registration.  

PubMed

Non-parametric image registration is still among the most challenging problems in both computer vision and medical imaging. Here, one tries to minimize a joint functional that is comprised of a similarity measure and a regularizer in order to obtain a reasonable displacement field that transforms one image to the other. A common way to solve this problem is to formulate a necessary condition for an optimizer, which in turn leads to a system of partial differential equations (PDEs). In general, the most time consuming part of the registration task is to find a numerical solution for such a system. In this paper, we present a generalized and efficient numerical scheme for solving such PDEs simply by applying 1-dimensional recursive filtering to the right hand side of the system based on the Green's function of the differential operator that corresponds to the chosen regularizer. So in the end we come up with a general linear algorithm. We present the associated Green's function for the diffusive and curvature regularizers and show how one may efficiently implement the whole process by using recursive filter approximation. Finally, we demonstrate the capability of the proposed method on realistic examples. PMID:20879358

Beuthien, Björn; Kamen, Ali; Fischer, Bernd

2010-01-01

51

Recursive Parameter Estimation: Asymptotic expansion  

Microsoft Academic Search

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. The model considered in the paper is very general as we do not impose any preliminary restrictions on the probabilistic nature of the observation process and cover a wide class of nonlinear recursive procedures. In this

Teo Sharia

2007-01-01

52

The XSet XML Search Engine and XBench XML Query Benchmark  

Microsoft Academic Search

The XSet XML Search Engine and XBench XML Query BenchmarkbyBen Yanbin ZhaoMaster of Science in Computer ScienceUniversity of California at BerkeleyProfessor Anthony D. Joseph, ChairInternet-scale distributed applications (such as wide-area service and device discoveryand location, user preference management, Domain Name Service) impose interestingrequirements on information storage, management, and retrieval. They maintain structuredsoft-state and pose numerous queries against...

Ben Yanbin Zhao

2000-01-01

53

Positive Active XML Serge Abiteboul  

E-print Network

of computations, termination and lazy query evaluation. 1. INTRODUCTION XML, a self-describing, semistructured services, that enrich the documents in a monotone manner, and on fair sequences of call invo- cations

Ghelli, Giorgio

54

Recursivity in Lingua Cosmica  

NASA Astrophysics Data System (ADS)

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.

Ollongren, Alexander

2011-02-01

55

SIGIR 2006 Tutorial: XML Information 6 August 2006  

E-print Network

Web Semi-structured Data/Metadata, XML Content and Structure Search 10 XML · XML: eXtensible MarkupSIGIR 2006 Tutorial: XML Information Retrieval 6 August 2006 1 1 SIGIR 2006 Tutorial XML Outline Part I: Introduction Part II: XML Basics Part III: Structured text models Part IV: Ranking models

Lalmas, Mounia

56

Generic Programming for XML Tools Johan Jeuring and Paul Hagg  

E-print Network

, XML validators, XML search engines, XML encryptors, etc. Information about XML tools is available fromGeneric Programming for XML Tools Johan Jeuring and Paul Hagg Institute of Information, class hierarchies). This paper shows how generic programming can be used to implement XML tools

Utrecht, Universiteit

57

One-multiplier adaptive lattice algorithm for recursive filters  

Microsoft Academic Search

The formulation of one-multiplier lattice structures of the Gray-Markel type forinfinite impulse response filters is reviewed. Several special cases of this formulation — including the well-known Gray-Markel normalized lattice—are presented as scaled polynomial versions of the two-multiplier lattice. A new adaptive algorithm is presented for updating the parameters of one-multiplier lattice structured recursive filters. The LMS-based algorithm requires fewer computations

Murali Tummala

1989-01-01

58

DSpace XML UI Project Technical Overview  

E-print Network

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... Transformations ? XHTML Our architecture: Java ? DOM ? XSL Transformations ? XHTML DSpace Java Servlets XML Objects XML Manager Theme Manager themes.xml HTP Request HTP Response 1 2 3 4 5 6 Both our architecture and a Cocon...

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

2007-07-16

59

Logical Foundations of XML and XQuery  

Microsoft Academic Search

XML is the underlying representation formalism of much web-data. Thus to reason about web-data essentially boils down to reasoning about data in XML format. In this course the students learn about the main languages for querying XML data: XPath and XQuery. The course contains both theoretical work and practical examples. These lecture notes are based on four articles about querying

Maarten Marx

2009-01-01

60

XEM: XML Evolution Management Diane Kramer  

E-print Network

XEM: XML Evolution Management by Diane Kramer A Thesis Submitted to the Faculty of the WORCESTER framework, called XML Evolution Manager (XEM), to manage the evolution of DTDs and XML documents. XEM to the modified DTD. We prove both the completeness of our evolution taxonomy, as well as its consistency

61

Integrating Network-Bound XML Data  

Microsoft Academic Search

Although XML was originally envisioned as a replacement for HTML on the web, to this point it has instead been used primarily as a format for on-demand interchange of data between applications and enterprises. The web is rather sparsely populated with static XML documents, but nearly every data management application today can export XML data. There is great interest in

Zachary G. Ives; Alon Y. Halevy; Daniel S. Weld

2001-01-01

62

Cooperative Evaluation of XML Queries in Mediators  

Microsoft Academic Search

As XML becomes the de facto standard for data representation and exchange over Internet, there are ever increasing applica tions using XML as a middleware model. Network-computing paradigm is also changing; it shifts to mobile agent paradigm. Building a mediated query system by combining both XML and mobile agent technologies is very promising.In this paper, we address the problem of

Liang-Huai Yang; Shi-Wei Tang; Dong-Qing Yang

2001-01-01

63

Forward XPath rewriting over XML data streams  

Microsoft Academic Search

Streaming XML data is often encountered in applications in medical biology. So, how to effectively manage and query XML data streams can be a fundamental issue for the quality of those medical biology applications. With respect to current methods for XPath query evaluation over XML data streams, adoption of some query rewriting techniques are common when encountering some complex query

Lixiang Qiao; Zhimin Yang; Chi Yang; Kaijun Ren; Le Yu; Chang Liu

2009-01-01

64

Effective, design-independent XML keyword search  

Microsoft Academic Search

Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely on intuitively appealing heuristics that are ultimately ad hoc. These approaches often retrieve irrelevant answers, overlook relevant answers, and cannot rank answers appropriately. To address these problems for data-centric XML, we propose

Arash Termehchy; Marianne Winslett

2009-01-01

65

MRM: an adaptive framework for XML searching  

Microsoft Academic Search

In order to deal with the diversified nature of XML documents as well as individual user preferences, we propose a novel Multi- Ranker Model (MRM), which is able to abstract a spectrum of important XML properties and adapt the features to different XML search needs. The model consists of a novel three-level ranking structure and a training module called Ranking

Ho Lam Lau; Ng Wilfred

2009-01-01

66

Towards an Effective XML Keyword Search  

Microsoft Academic Search

Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: 1) Identify the user search intention, i.e., identify the XML node types that user wants to search for and search via. 2) Resolve keyword ambiguity

Zhifeng Bao; Jiaheng Lu; Tok Wang Ling; Bo Chen

2010-01-01

67

1. XML Syntax 1-1 Chapter 1: XML Syntax  

E-print Network

· · · EXERCISES CAT ENO TOPIC MAXPT H 1 Rel. Algeb. 10 H 2 SQL 10 M 1 SQL 14 RESULTS SID CAT ENO POINTS 101 H 1 10='Ann' LAST='Smith'/> ... ENO='1' TOPIC='Rel. Algeb.'/> ... ENO='1' POINTS='10'/> ... Stefan Brass: XML und

Brass, Stefan

68

A hybrid recursion method to robustly ensure convergence efficiencies in the simulated scaling based free energy simulations  

NASA Astrophysics Data System (ADS)

Recently, we developed an efficient free energy simulation technique, the simulated scaling (SS) method [H. Li et al., J. Chem. Phys. 126, 024106 (2007)], in the framework of generalized ensemble simulations. In the SS simulations, random walks in the scaling parameter space are realized so that both phase space overlap sampling and conformational space sampling can be simultaneously enhanced. To flatten the distribution in the scaling parameter space, in the original SS implementation, the Wang-Landau recursion was employed due to its well-known recursion capability. In the Wang-Landau recursion based SS free energy simulation scheme, at the early stage, recursion efficiencies are high and free energy regions are quickly located, although at this stage, the errors of estimated free energy values are large; at the later stage, the errors of estimated free energy values become smaller, however, recursions become increasingly slow and free energy refinements require very long simulation time. In order to robustly resolve this efficiency problem during free energy refinements, a hybrid recursion strategy is presented in this paper. Specifically, we let the Wang-Landau update method take care of the early stage recursion: the location of target free energy regions, and let the adaptive reweighting method take care of the late stage recursion: the refinements of free energy values. As comparably studied in the model systems, among three possible recursion procedures, the adaptive reweighting recursion approach is the least favorable one because of its low recursion efficiency during free energy region locations; and compared to the original Wang-Landau recursion approach, the proposed hybrid recursion technique can be more robust to guarantee free energy simulation efficiencies.

Zheng, Lianqing; Carbone, Irina O.; Lugovskoy, Alexey; Berg, Bernd A.; Yang, Wei

2008-07-01

69

Recursive computer architecture for VLSI  

SciTech Connect

A general-purpose computer architecture based on the concept of recursion and suitable for VLSI computer systems built from replicated (lego-like) computing elements is presented. The recursive computer architecture is defined by presenting a program organisation, a machine organisation and an experimental machine implementation oriented to VLSI. The experimental implementation is being restricted to simple, identical microcomputers each containing a memory, a processor and a communications capability. This future generation of lego-like computer systems are termed fifth generation computers by the Japanese. 30 references.

Treleaven, P.C.; Hopkins, R.P.

1982-01-01

70

Recursive Polynomial Remainder Sequence and its Subresultants  

E-print Network

We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," along with investigation of their properties. A recursive PRS is defined as, if there exists the GCD (greatest common divisor) of initial polynomials, a sequence of PRSs calculated "recursively" for the GCD and its derivative until a constant is derived, and recursive subresultants are defined by determinants representing the coefficients in recursive PRS as functions of coefficients of initial polynomials. We give three different constructions of subresultant matrices for recursive subresultants; while the first one is built-up just with previously defined matrices thus the size of the matrix increases fast as the recursion deepens, the last one reduces the size of the matrix drastically by the Gaussian elimination on the second one which has a "nested" expression, i.e. a Sylvester matrix whose elements are themselves determinants.

Terui, Akira

2008-01-01

71

Induction-Recursion and Initial Algebras  

E-print Network

Induction-Recursion and Initial Algebras Peter Dybjer*and Anton Setzery Abstract Induction-recursion is a powerful definition method in intuitionistic t* *ype theory. It extends (generalized) inductive

Setzer, Anton

72

Indexed Induction-Recursion Peter Dybjer a,?  

E-print Network

Indexed Induction-Recursion Peter Dybjer a. _____________________________________________________________________________ Abstract An indexed inductive definition (IID) is a simultaneous inductive definition of* * an indexed family of sets. An inductive-recursive definition (IRD) is a simultaneo* *us inductive definition

Setzer, Anton

73

Indexed Induction-Recursion Peter Dybjer  

E-print Network

Indexed Induction-Recursion Peter Dybjer and Anton Setzer September 24, 2001 Abstract We give two finite axiomatizations of indexed inductive-recursive def- initions in intuitionistic type theory. They extend our previous finite axiomatizations of inductive-recursive definitions of sets to indexed fami

Setzer, Anton

74

Speed up of XML parsers with PHP language implementation  

NASA Astrophysics Data System (ADS)

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.

Georgiev, Bozhidar; Georgieva, Adriana

2012-11-01

75

Efficient Evaluation of Regular Path Expressions on Streaming XML Data  

Microsoft Academic Search

The adoption of XML promises to accelerate construction of systems that integrate distributed,heterogeneous data. Query languages for XML are typically based on regular pathexpressions that traverse the logical XML graph structure; the ecient evaluation of such pathexpressions is central to good query processing performance. Most existing XML query processingsystems convert XML documents to an internal representation, generally a set of

Zachary Ives; Alon Levy; Daniel Weld

2000-01-01

76

Mining Maximal Frequently Changing Subtree Patterns from XML Documents  

E-print Network

attention recently[13][5]. Detected changes to XML can be used in search engines, XML query systems etc but evolve differently. ­ Semantic XML Search Engine: If two subtrees in an XML structure frequently change correlation. Then frequently changing subtree patterns can be used by semantic XML search engine [6], which

Chia, Liang-Tien

77

XML Data in the Virtual Observatory  

NASA Astrophysics Data System (ADS)

XML is the lingua franca of the Web services world and so will play a major role in the construction of the Virtual Observatory. Its great advantages are its flexibility, platform-independence, ease of transformation, and the wide variety of existing software that can process it. An obvious disadvantage in its use as an astronomical data format is its verbosity; the number of bytes taken up writing the XML tags can easily outnumber those constituting the actual astronomical data. The verbosity of XML in this regard is a problem in many other disciplines, and computer scientists are developing more generic solutions to that found in the VOTable specification. In this paper we describe two of these projects currently underway in Edinburgh, which focus on the compression and querying of XML, and a technology for representing the structure of a binary file in XML, enabling it to be read as if it were XML.

Mann, R. G.; Baxter, R. M.; Carroll, R.; Wen, Q.; Buneman, O. P.; Choi, B.; Fan, W.; Hutchison, R. W. O.; Viglas, S. D.

2005-12-01

78

A Requirement Engineering Approach for Designing XML-View Driven, XML Document Warehouses  

Microsoft Academic Search

The extensible markup language (XML) has emerged as the dominant standard in describing and exchanging data among heterogeneous data sources. The increasing presence of large volumes of data appearing in enterprise settings creates the need to investigate XML document warehouses (XDW) as a means of handling and analysing XML data for business intelligence. In our previous work, we proposed a

Vicky Nassis; Rajagopal Rajugan; Tharam S. Dillon; J. Wenny Rahayu

2005-01-01

79

Fault Tree XML {syjsmk, ldalove, jbyoo}@konkuk.ac.kr  

E-print Network

. 1. (FTA, Fault Tree Analysis) / , [1]. , . 1 FTA . 1. FTA(Fault Tree Analysis)[1] XML . XML [2]. (FT, Fault Tree) XML Fault Tree Analysis", Transactions of Korean Nuclear Society, vol.1, Pages 855-857, 2010 #12;

80

Recursive Programming Model for Crop Production on the Texas High Plains  

E-print Network

, the model will loop through up to 20 iterations, rebuilding the LP matrix for each iteration and writing a report for each period. The feedback section of the recursive model is used to update the groundwater situation after solution of each iteration...

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

81

Electronic Commerce System Research Based on XML  

Microsoft Academic Search

This thesis has put forward a kind of new data presentation and analysis model based on XML and script language, it can express data information with the form that accords with the specification of XML , so makes it have good nature witch is unconcerned with platform, and it can be effective to have so alleviated the burden of server

Hu Zhi-jun; Wang Hong-bin

2009-01-01

82

Streaming XML with Jabber\\/XMPP  

Microsoft Academic Search

Jabber is an open alternative to closed instant messaging (IM) and presence services. At its core is the extensible messaging and presence protocol (XMPP), which defines how to stream XML content and is being used to build not only a large open IM network but also a wide range of XML applications. This article provides an overview of Jabber\\/XMPP protocols

Peter Saint-andre

2005-01-01

83

XML Format for SESAME and LEOS  

Microsoft Academic Search

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

J K Durrenberger; J R Neely; P A Sterne

2009-01-01

84

Advanced technology for managing XML document collection  

Microsoft Academic Search

Organizing large document collections for finding information easily and quickly has always been a challenging problem. In the last few years, XML has become the de-facto standard for content publishing and data exchange. The proliferation of XML documents and data has created new challenges and opportunities for managing document collections. Existing technologies for automatically organizing document collections are either imprecise

Hui-I Hsiao

2005-01-01

85

XML for Video Games CS 297 Report  

E-print Network

1 XML for Video Games CS 297 Report Ru Chen Advisor: Dr. Chris Pollett Department of Computer Science San Jose State University Dec 2005 #12;2 Introduction: When designing a video game, a game and test video games. XML (Extensible Markup language) is a standardized text format for representing

Pollett, Chris

86

An Architecture for Selling XML Content  

Microsoft Academic Search

Content provides a way for business to increase revenues on the Internet. However, the key to increasing revenues through content is efficient billing. Therefore this paper intro- duces an architecture for selling XML content. The architecture is based on a family of models that provides a guide to the requirements for a content-based billing system in XML envi- ronments incorporating

Peter J. de Villiers; Reinhardt A. Botha

87

Automated reasoning with legal XML documents  

Microsoft Academic Search

We have integrated the Jess Expert System tool from Sandia Labs [2] with the Xerces XML parser. We submit to this software contracts and court filings for litigation involving those contracts. These are written as per a contract standard submitted to the Legal XML standards group [5] and the court filing proposed standards. The software determines if a summary judgment

Laurence L. Leff

2001-01-01

88

Capturing Chemistry in XML/CML  

E-print Network

Capturing Chemistry in XML/CML J. A. Townsend*, S. E. Adams* , J. M. Goodman*, P. Murray-Rust*, C. A. Waudby* Capturing Chemistry in XML/CML ACS March 2004 * Unilever Centre for Molecular Informatics, University of Cambridge The Agony...

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

89

Declarative XML Data Cleaning with XClean  

Microsoft Academic Search

Data cleaning is the process of correcting anomalies in a data source, that may for instance be due to typographical errors, or duplicate representations of an entity. It is a crucial task in customer relationship management, data mining, and data integration. With the growing amount of XML data, approaches to effectively and efficiently clean XML are needed, an issue not

Melanie Weis; Ioana Manolescu

2007-01-01

90

Compressing Aviation Data in XML Format  

NASA Technical Reports Server (NTRS)

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.

Patel, Hemil; Lau, Derek; Kulkarni, Deepak

2003-01-01

91

Retrieving valid matches for XML keyword search  

Microsoft Academic Search

Adapting keyword search to XML data has been attractive recently, generalized as XML Keyword Search (XKS). Its fundamental task is to retrieve meaningful and concise result for the given keyword query, and [1] is the latest work which returns the fragments rooted at the SLCA (Smallest LCA - Lowest Common Ancestor) nodes. To guarantee the fragments only containing meaningful nodes,

Lingbo Kong; Rémi Gilleron; Aurélien Lemay

2009-01-01

92

XReal: an interactive XML keyword searching  

Microsoft Academic Search

Keyword search over XML data usually brings irrelevant results especially when the keywords in a user query have ambiguities. We demonstrate a statistic-based approach to identify the search targets and constraints of a user query in the presence of keyword ambiguities, and come out a relevance oriented result ranking scheme called XML TF*IDF. Since the search intention of a same

Zhifeng Bao; Jiaheng Lu; Tok Wang Ling

2010-01-01

93

Query biased snippet generation in XML search  

Microsoft Academic Search

Snippets are used by almost every text search engine to com- plement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose rele- vance semantics are difficult to assess. Despite the fact that XML is a standard representation format of web data, re- search on generating result snippets for XML search remains untouched. In this

Yu Huang; Ziyang Liu; Yi Chen

2008-01-01

94

XML Security --A Comparative Literature Andreas Ekelhart  

E-print Network

, ScienceDirect and Springer, using Boolean search strings, such as "XML (Digital) Signature", "XMLXML Security -- A Comparative Literature Review Andreas Ekelhart , Stefan Fenz , Gernot GoluchC have been concentrating on the development of XML based security stan- dards, which

95

XML Content Finally Arrives on the Web!  

ERIC Educational Resources Information Center

Explains extensible markup language (XML) and how it differs from hypertext markup language (HTML) and standard generalized markup language (SGML). Highlights include features of XML, including better formatting of documents, better searching capabilities, multiple uses for hyperlinking, and an increase in Web applications; Web browsers; and what…

Funke, Susan

1998-01-01

96

Considering Network Recursion and Bartok's "Fourths"  

E-print Network

document contains the author’s final draft. For the publisher’s version, see the link in the header of this document.] Considering Network Recursion and Bartók’s “Fourths” By Scott Murphy Music Department, the University of Kansas Paper citation...: Murphy, Scott. “Considering Network Recursion and Bartók’s ‘Fourths’,” Music Theory Online 13/3 (September 2007). Keywords: Klumpenhouwer network, recursion, self-similarity, Bartók, analysis, inversion, mirror, axis, register Abstract: Notions...

Murphy, Scott

2007-09-01

97

Indexed Induction-Recursion Peter Dybjer*and Anton Setzery  

E-print Network

Indexed Induction-Recursion Peter Dybjer*and Anton Setzery of indexed inductive-recursive def- initions in intuitionistic type theory. They extend our previous finite axiomatizations of inductive-recursive definitions of sets to indexed fami- lies of sets

Setzer, Anton

98

An XML query engine for network-bound data  

Microsoft Academic Search

XML has become the lingua franca for data exchange and integration across administrative and enterprise boundaries. Nearly all data providers are adding XML import or export capabilities, and standard XML Schemas and DTDs are being promoted for all types of data sharing. The ubiquity of XML has removed one of the major obstacles to integrating data from widely disparate sources

Zachary G. Ives; Alon Y. Halevy; Daniel S. Weld

2002-01-01

99

Indexing and Querying XML Data for Regular Path Expressions  

Microsoft Academic Search

With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query lan- guages have been proposed, and the common feature of the languages is the use of regu- lar path expressions to query XML data. This poses a new challenge concerning indexing

Quanzhong Li; Bongki Moon

2001-01-01

100

Semantic and Structure Based XML Similarity: An Integrated Approach  

Microsoft Academic Search

Since the last decade, XML has gained growing importance as a major means for information management, and has become inevitable for complex data representation. Due to an unprecedented increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes crucial in information retrieval (IR) research. A range of algorithms for comparing hierarchically structured data, e.g. XML documents,

Joe Tekli; Kokou Yétongnon

2006-01-01

101

Mining Maximal Frequently Changing Subtree Patterns from XML Documents  

E-print Network

considerable attention recently[13][5]. De- tected changes to XML can be used in search engines, XML query sys Search Engine: If two subtrees in an XML struc- ture frequently change together, it is likely subtree patterns can be used by semantic XML search engine [6], which returns semantically related

Bhowmick, Sourav S.

102

Local XML Functional Dependencies Jixue Liu Millist Vincent Chengfei Liu  

E-print Network

much less at- tention and has been listed as an open problem in XML re- search [12]. Recently [9, 10Local XML Functional Dependencies Jixue Liu Millist Vincent Chengfei Liu School of Computer a fundamental role in XML and recently keys and functional dependencies in XML have been defined. In this paper

Liu, Chengfei

103

Processing XML Keyword Search by Constructing Effective Structured Queries  

E-print Network

Processing XML Keyword Search by Constructing Effective Structured Queries Jianxin Li, Chengfei Liu in XML database. It is hard to directly improve the relevancy of XML keyword search because lots design an adaptive XML keyword search approach, called XBridge, that can derive the semantics

Liu, Chengfei

104

Framework for a XML-based search system  

Microsoft Academic Search

Abstract-This article presents a framework for a XML based search system composed by three layers: data layer, logic layer and presentation layer. In all three layers XML related technologies are used to store, search, transport and present information like Native XML Databases, Web Services and XSLT. Two examples of an implementation of a XML based search system are presented and

Pedro Almeida; Joaquim Sousa Pinto; Joaquim Arnaldo Martins; Helder Troca Zagalo

2004-01-01

105

A Unifying Framework for Merging and Evaluating XML Information  

E-print Network

their own relevant XML data objects (or simply XML data trees) as a consequence of searching for a required used in the search and integration processes of the required XML data objects as discussed in [1, 2, 3A Unifying Framework for Merging and Evaluating XML Information Ho-Lam Lau and Wilfred Ng

Ng, Wilfred Siu Hung

106

Efficient XML Keyword Search: From Graph Model to Tree Model  

E-print Network

Efficient XML Keyword Search: From Graph Model to Tree Model Yong Zeng # , Zhifeng Bao # , Tok Wang/IDREF is not considered, an XML document can be modeled as a tree. Keyword search on XML tree can be much more efficient tree search methods and invent new, but less efficient search methods for XML graph. To address

Ling, Tok Wang

107

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

E-print Network

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

Soloviev, Igor; The ATLAS collaboration

2012-01-01

108

Submarine Maneuvers Prediction using Recursive Neural Networks  

Microsoft Academic Search

Recursive neural networks (RNNs) are a technique for developing time-dependent, nonlinear equation systems. In this paper, we applied RNN to simulate the maneuvers of submarine. The forces and moments acting on the body of submarine are functions of the motion state variables. Component force modules is developed to calculate five component forces as inputs to the recursive neural networks. These

Hassan Fahmy Hashem; Alexandria HighInstitute

2006-01-01

109

Using Spreadsheets to Help Students Think Recursively  

ERIC Educational Resources Information Center

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

Webber, Robert P.

2012-01-01

110

XML Format for SESAME and LEOS  

SciTech Connect

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.

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

2009-04-29

111

Safe software standards and XML schemas  

NASA Astrophysics Data System (ADS)

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.

Leif, Robert C.

2010-02-01

112

Advanced Information Retrieval Using XML Standards.  

PubMed

The bulk of clinical data is available in an electronic form. About 80% of the electronic data, however, is narrative text and therefore limited with respect to machine interpretation. As a result, the discussion has shifted from "electronic versus paper based data" towards "structured versus unstructured electronic data". The XML technology of today paves a way towards more structured clinical data and several XML based standards such as the Clinical Document Architecture (CDA) emerge. The implementation of XML based applications is yet a challenge. This paper will focus on XML retrieval issues and describe the difficulties and prospects of such an approach. The result of our work is a search technique called "topic matching" that exploits structured data in order to provide a search quality that is superior to established text matching methods. With this solution we are able to utilize large numbers of heterogeneously structured documents with only a minimum of effort. PMID:16160336

Schweiger, Ralf; Hölzer, Simon; Dudeck, Joachim

2005-01-01

113

Interactive Searching Behavior with Structured XML Documents  

Microsoft Academic Search

\\u000a The aim of this study was to provide fundamental data on users’ searching behavior when they are interacting with structured\\u000a XML documents, and to discover the correlation between users’ search characteristics and their attitude towards evaluating\\u000a the interactive XML IR system. 8 subjects took part in this experiment and we followed the experimental guidelines from the\\u000a INEX 2004 Interactive Track

Heesop Kim; Heejung Son

2004-01-01

114

A Survey on XML Keyword Search  

Microsoft Academic Search

\\u000a Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML\\u000a documents in the World Wide Web and much work has been done in this domain. Specifically, With the increasing application\\u000a of XML in web, the study on XML keyword search has been gaining growing attention of the researchers. Great efforts have also

Zongqi Tian; Jiaheng Lu; Deying Li

2011-01-01

115

Document Transformation System from Papers to XML Data Based on Pivot XML Document Method  

Microsoft Academic Search

This paper proposes a new method for document trans- formation using OCR to generate various XML documents from printed documents. The proposed method adopts a hi- erarchical transformation strategy based on a pivot XML document. Firstly, document elements such as title, au- thors, abstract, headings, paragraphs, lists, captions, ta- bles and figures are extracted from document images. Sec- ondly, the

Yasuto Ishitani; Komukai Toshiba-cho

2003-01-01

116

Traceable Recursion with Graphical Illustration for Novice Programmers  

ERIC Educational Resources Information Center

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

Sa, Leonardo; Hsin, Wen-Jung

2010-01-01

117

Recursiveness and Deletion in English: Two Countervaling Forces.  

ERIC Educational Resources Information Center

The notions of recursiveness and deletion are discussed in the context of Chomsky's presentations of transformational grammar in "Syntactic Structures" and in the later work, "Aspects of the Theory of Syntax." After consideration of word-recursion, coordinate-clause recursion, and subordinate-clause recursion, extensions to discourse analysis are…

Nilsen, Don L.F.

118

RECURSIVE ASCENT-DESCENT PARSING R. Nigel Horspool  

E-print Network

RECURSIVE ASCENT-DESCENT PARSING R. Nigel Horspool Department of Computer Science, University-corner parsing was originally presented as a technique for generating a parser for the SLR1 class of grammars that subsumes the parsing methods known as recursive descent and recursive ascent hence the name recursive

Horspool, R. Nigel

119

Method for implementation of recursive hierarchical segmentation on parallel computers  

NASA Technical Reports Server (NTRS)

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

Tilton, James C. (Inventor)

2005-01-01

120

MITOSIS RECURSION FOR COEFFICIENTS OF SCHUBERT POLYNOMIALS  

E-print Network

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

Miller, Ezra N.

121

On recursion relations in topological string theory  

E-print Network

We discuss a link between the topological recursion relations derived algebraically by Witten and the holomorphic anomaly equation of Bershadsky, Cecotti, Ooguri and Vafa. This is obtained through the definition of an operator ${\\cal{W}}_s$ that reproduces the recursion relations for topological string theory coupled to worldsheet gravity a la BCOV. This operator is contained inside an algebra that generalizes the tt* equations and whose direct consequence is the holomorphic anomaly equation itself.

Andrea Prudenziati

2012-10-16

122

Reasoning about High-Level Tree Update and its Low-Level Implementation  

E-print Network

- ifying properties about arbitrary structured data up- date such as XML update. Since then, we have had requiring addi- tional pointer surgery. Tying up the high-level and low-level reasoning is therefore rather identifiers and lists of children which may vary in length. This simple structure gives the essence of XML

Gardner, Philippa

123

XML for data representation and model specification in neuroscience.  

PubMed

EXtensible Markup Language (XML) technology provides an ideal representation for the complex structure of models and neuroscience data, as it is an open file format and provides a language-independent method for storing arbitrarily complex structured information. XML is composed of text and tags that explicitly describe the structure and semantics of the content of the document. In this chapter, we describe some of the common uses of XML in neuroscience, with case studies in representing neuroscience data and defining model descriptions based on examples from NeuroML. The specific methods that we discuss include (1) reading and writing XML from applications, (2) exporting XML from databases, (3) using XML standards to represent neuronal morphology data, (4) using XML to represent experimental metadata, and (5) creating new XML specifications for models. PMID:18368360

Crook, Sharon M; Howell, Fred W

2007-01-01

124

Search Driven Analysis of Heterogenous XML Data  

E-print Network

Analytical processing on XML repositories is usually enabled by designing complex data transformations that shred the documents into a common data warehousing schema. This can be very time-consuming and costly, especially if the underlying XML data has a lot of variety in structure, and only a subset of attributes constitutes meaningful dimensions and facts. Today, there is no tool to explore an XML data set, discover interesting attributes, dimensions and facts, and rapidly prototype an OLAP solution. In this paper, we propose a system, called SEDA that enables users to start with simple keyword-style querying, and interactively refine the query based on result summaries. SEDA then maps query results onto a set of known, or newly created, facts and dimensions, and derives a star schema and its instantiation to be fed into an off-the-shelf OLAP tool, for further analysis.

Balmin, Andrey; Curtmola, Emiran; Li, Quanzhong; Ozcan, Fatma

2009-01-01

125

OTwig: An Optimised Twig Pattern Matching Approach for XML Databases  

Microsoft Academic Search

Twig based optimisation is one of the current approaches to improving XML query performance. It uses structural joins to find\\u000a all pairs of elements in the XML documents satisfying the primitive structural relationships specified in the XML queries.\\u000a They focus on parent-child and ancestor-descendant relationships. Efficient location of all joins is one of the core operations\\u000a in XML query processing.

Jun Liu; Mark Roantree

2010-01-01

126

Semantic-Distance Based Clustering for XML Keyword Search  

Microsoft Academic Search

\\u000a XML Keyword Search is a user-friendly information discovery technique, which is well-suited to schema-free XML documents.\\u000a We propose a novel scheme for XML keyword search called XKLUSTER, in which a novel semantic-distance model is proposed to\\u000a specify the set of nodes contained in a result. Based on this model, we use clustering approaches to generate all meaningful\\u000a results in XML

Weidong Yang; Hao Zhu

2010-01-01

127

Using structural information in XML keyword search effectively  

Microsoft Academic Search

The popularity of XML has exacerbated the need for an easy-to-use, high precision query interface for XML data. When traditional document-oriented keyword search techniques do not suffice, natural language interfaces and keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases. Unfortunately, current approaches to processing these queries rely heavily

Arash Termehchy; Marianne Winslett

2011-01-01

128

Effective Ranking of XML Keyword Search Results (Extended Version)  

Microsoft Academic Search

The popularity of XML has exacerbated the need for an easy-to-use, high precision query interface for XML data. When traditional document-oriented keyword search tech- niques do not suce, natural language interfaces and key- word search techniques that take advantage of XML struc- ture make it very easy for ordinary users to query XML databases. Unfortunately, current approaches to process- ing

Arash Termehchy; Marianne Winslett

129

Storing and querying ordered XML using a relational database system  

Microsoft Academic Search

XML is quickly becoming the de facto standard for data exchange over the Internet. This is creating a new set of data management requirements involving XML, such as the need to store and query XML documents. Researchers have proposed using relational database systems to satisfy these requirements by devising ways to \\

Igor Tatarinov; Stratis D. Viglas; Kevin S. Beyer; Jayavel Shanmugasundaram; Eugene J. Shekita; Chun Zhang

2002-01-01

130

Clock: Synchronizing Internal Relational Storage with External XML Documents  

Microsoft Academic Search

In many business settings, a relational database system (RDBMS) will serve as the storage manager for data from XML documents. In such a system, once the XML data is dissembled and loaded into the storage system, XML queries posed against the (virtual) XMLdocumentsare pro- cessed by translating them into SQL queries against the relational storage. However, for applications which fre-

Xin Zhangt; Gail Mitchellt; Wang-Chien Leet; Elke A. Rundensteinert

2001-01-01

131

SilkRoute: trading between relations and XML  

Microsoft Academic Search

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

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

2000-01-01

132

FLEXIBLE RECONCILIATION OF XML DOCUMENTS IN ASYNCHRONOUS EDITING  

E-print Network

.Ignat@loria.fr, Gerald.Oster@loria.fr Keywords: Collaborative editing, asynchronous communication, XML, conflict appropriate support for the management of conflicting changes performed in parallel on XML documents management, operational transformation Abstract: As XML documents are increasingly being used in a wide

Boyer, Edmond

133

Result-reconstruction method to return useful XML elements  

Microsoft Academic Search

Purpose – Nowadays there are a large number of XML documents on the web. This means that information retrieval techniques for searching XML documents are very important and necessary for internet users. Moreover, it is often said that users of search engines want to browse only relevant content in each document. Therefore, an effective XML element search aims to produce

Atsushi Keyaki; Kenji Hatano; Jun Miyzaki

2011-01-01

134

Investigating the Use of Summarisation for Interactive XML Zoltan Szlavik  

E-print Network

in XML retrieval as a means of helping users in their searching process. 1. INTRODUCTION As the eXtensible Markup Language (XML) is becoming increasingly widespread, retrieval engines that allow search withinInvestigating the Use of Summarisation for Interactive XML Retrieval Zolt´an Szl´avik Queen Mary

Tombros, Tassos

135

Integrating Keyword Search into XML Query Processing Daniela Florescu  

E-print Network

Integrating Keyword Search into XML Query Processing Daniela Florescu Inria, Rocquencourt BP 105 a very difficult task. We propose an extension to XML query languages that enables keyword search records from the structured part of an XML document and that search for information in text. For instance

Manolescu, Ioana

136

Algorithms for Temporal Query Operators in XML Databases Kjetil Nrvag  

E-print Network

Algorithms for Temporal Query Operators in XML Databases Kjetil Nørv°ag Department of Computer.Norvag@idi.ntnu.no Abstract The contents of an XML database or an XML/Web data warehouse is seldom static. New documents to be able to search in historical versions, retrieve documents valid at a cer- tain time, query changes

137

YAPI: Yet Another Path Index for XML Searching  

Microsoft Academic Search

As many metadata are encoded in XML, and many digital libraries need to manage XML documents, efficient techniques for search- ing in such formatted data are required. In order to efficiently process path expressions with wildcards on XML data, a new path index is pro- posed. Extensive evaluation confirms better performance with respect to other techniques proposed in the literature.

Giuseppe Amato; Franca Debole; Pavel Zezula; Fausto Rabitti

2003-01-01

138

Clustering XML Search Results Based on Content and Structure Similarity  

Microsoft Academic Search

Clustering XML search results is an effective way to improve performance. However, the key problem is how to measure similarity between XML documents. In this paper, we propose a semantic similarity measure method combining content with structure, in which a variety of XML document features, including term element frequency, term inverse element frequency, semantic weight of tag label and level

Zhong Min-Juan; Wan Chang-Xuan; Liu De-Xi; Jiao Xian-Pei

2011-01-01

139

ALGEBRAIC LANGUAGES FOR XML DATABASES MARIA G. CHINWALA  

E-print Network

to search their contents. A standard XML Query Language and Algebra are required, which should be basedALGEBRAIC LANGUAGES FOR XML DATABASES by MARIA G. CHINWALA mariagc@arches.uga.edu Tel: 706-2966 #12;ABSTRACT XML is becoming increasingly popular as a means of exchanging a wide variety of data

Miller, John A.

140

STRUCTURE-BASED QUERY EXPANSION FOR XML SEARCH ENGINE  

Microsoft Academic Search

Based on the query expansion techniques in information retrieval systems, structure-based query expansion for XML search engines, which is designed to ease the query for XML data while keeping the power and flexibility of XML query, is introduced in this paper. To enable the structure expansion, a structure thesaurus should be built first, which involves the construction of a weighted

Wei-ning Qian; Hai-lei Qian; Li Wei; Yan Wang; Ao-ying Zhou

141

Retrieving Meaningful Relaxed Tightest Fragments for XML Keyword Search  

E-print Network

Retrieving Meaningful Relaxed Tightest Fragments for XML Keyword Search Lingbo Kong , RémiLinking@gmail.com, {remi.gilleron, aurelien.lemay}@univ-lille3.fr ABSTRACT Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return

Paris-Sud XI, Université de

142

A new indexing strategy for XML keyword search  

Microsoft Academic Search

With the rapid increase of XML documents on the web, how to index, store and retrieve these documents has become a very popular and valuable problem. At present, there are two normal ways of retrieving XML documents. One is structure-based retrieval; the other is keyword-based retrieval. However, XML keyword search is becoming more and more popular because it is easy

Yong-Qing Xiang; Zhi-Hong Deng; Hang Yu; Sijing Wang; Ning Gao

2010-01-01

143

TX-Kw: An Effective Temporal XML Keyword Search  

Microsoft Academic Search

Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search on XML has emerged recently. Existing methods cannot resolve challenges addressed by using keyword search in Temporal XML documents. We propose a way to evaluate temporal keyword search queries over Temporal XML documents. Moreover, we propose a new ranking method based on the

Rasha Bin-Thalab; Neamat El-Tazi; Mohamed E. El-Sharkawi

2013-01-01

144

Effective XML Keyword Search with Relevance Oriented Ranking  

Microsoft Academic Search

Inspired by the great success of information re- trieval (IR) style keyword search on the web, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: (1) Identify the user search intention, i.e. identify the XML node types that user wants to search for and search via. (2) Resolve keyword

Zhifeng Bao; Tok Wang Ling; Bo Chen; Jiaheng Lu

2009-01-01

145

Designing an XML Database Engine: API and Performance  

E-print Network

time. Xset [6] is a main memory database and search engine, which uses XML as the data storage languageDesigning an XML Database Engine: API and Performance Sudhanshu Sipani, Kunal Verma, Senthilanand of Computer Science University of Georgia, Athens, GA jam@cs.uga.edu Abstract XML (eXtensible Markup Language

Miller, John A.

146

Answering Keyword Queries on XML Using Materialized Views  

E-print Network

of keyword search over XML data, it is an open problem whether materialized views can be leveraged for query-evolving, providing keyword search on XML becomes critical in those applications. Though much work has been done on inferring the semantics of XML keyword search by defining query results appropriately ([6], [4], [5], [1

Chen, Yi

147

Index-Based Approximate XML Joins Sudipto Guha  

E-print Network

of such operations. We propose novel search and join algorithms for R-trees adopted to index XML document collections, we propose R-tree based search and join algorithms for the approximate XML join problem. Our completeIndex-Based Approximate XML Joins Sudipto Guha University of Pennsylvania sudipto

Yu, Ting

148

Demonstrating Effective Ranked XML Keyword Search with Meaningful Result Display  

Microsoft Academic Search

In this paper, we demonstrate an efiective ranked XML key- word search with meaningful result display. Our system, named ICRA, recognizes a set of object classes in XML data for result display, deflnes the matching semantics that meet user's search needs more precisely, captures the ID references in XML data to flnd more relevant results, and adopts novel ranking schemes.

Zhifeng Bao; Bo Chen; Tok Wang Ling; Jiaheng Lu

2009-01-01

149

A Search Engine for Complex XML Queries Leonidas Fegaras  

E-print Network

A Search Engine for Complex XML Queries Leonidas Fegaras Department of Computer Science proposals for XML languages now that allow queries over the whole Internet, as is done by current web search search engines. One may wonder how feasible it is to evaluate XML queries that join web documents

Fegaras, Leonidas

150

Demonstrating Effective Ranked XML Keyword Search with Meaningful Result Display  

E-print Network

Demonstrating Effective Ranked XML Keyword Search with Meaningful Result Display Zhifeng Bao1 , Bo, jiahenglu@gmail.com Abstract. In this paper, we demonstrate an effective ranked XML key- word search is available at http://xmldb.ddns.comp.nus.edu.sg/. 1 Introduction The goal of XML keyword search is to find

Ling, Tok Wang

151

Accessing XML Content From DB and IR Perspectives  

E-print Network

Sihem Amer-Yahia AT&T Labs ­ Research Outline · Part I: Motivation · Part II: XML Search and Scoring ­ Information retrieval (IR) vs. Structured Document Retrieval (SDR) ­ XML Search vs. Traditional Search · Part II: XML Search and Scoring · Part III: Evaluation · Part IV: Open Issues · Part V: Contact Details

Lalmas, Mounia

152

Processing XML Keyword Search by Constructing Effective Structured Queries  

Microsoft Academic Search

Recently, keyword search has attracted a great deal of at- tention in XML database. It is hard to directly improve the relevancy of XML keyword search because lots of keyword-matched nodes may not contribute to the results. To address this challenge, in this paper we design an adaptive XML keyword search approach, called XBridge, that can derive the semantics of

Jianxin Li; Chengfei Liu; Rui Zhou; Bo Ning

2009-01-01

153

Why and how to benchmark XML databases  

Microsoft Academic Search

Benchmarks belong to the very standard repertory of tools deployed in database development. Assessing the capabilities of a system, analyzing actual and potential bottlenecks, and, naturally, comparing the pros and cons of different systems architectures have become indispensable tasks as databases management systems grow in complexity and capacity. In the course of the development of XML databases the need for

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

2001-01-01

154

Shuttle-Data-Tape XML Translator  

NASA Technical Reports Server (NTRS)

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

Barry, Matthew R.; Osborne, Richard N.

2005-01-01

155

XTCE. XML Telemetry and Command Exchange Tutorial  

NASA Technical Reports Server (NTRS)

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

Rice, Kevin; Kizzort, Brad; Simon, Jerry

2010-01-01

156

Flight Dynamic Model Exchange using XML  

NASA Technical Reports Server (NTRS)

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

Jackson, E. Bruce; Hildreth, Bruce L.

2002-01-01

157

Template Resolution in XML\\/HTML  

Microsoft Academic Search

templates to applications and documents on the Web. The primary motivation is the need of Web application developers to separate program logic from presentation logic. A template is a prototypical document or part thereof. It consists of content in the target language, HTML, XML, or plain text, plus markup specifying variable parts of the document. The Template Markup Language (TML)

Anders Kristensen

1998-01-01

158

XML search: languages, INEX and scoring  

Microsoft Academic Search

The development of approaches to access XML content has generated a wealth of issues in information retrieval (IR) and database (DB) (e.g., [2, 15, 17, 20, 19, 47, 26, 32, 24]). While the IR community has traditionally focused on searching unstructured content, and has developed various techniques for ranking query results and evaluating their effectiveness, the DB community has focused

Sihem Amer-yahia; Mounia Lalmas

2006-01-01

159

Sound ranking algorithms for XML search  

Microsoft Academic Search

Ranking algorithms for XML should reflect the actual combined content and structure constraints of queries, while at the same time producing equal rankings for queries that are semantically equal. Ranking algorithms that produce different rankings for queries that are semantically equal are easily detected by tests on large databases: We call such algorithms not sound. We report the behavior of

Djoerd Hiemstra; Stefan Klinger; Henning Rode; Jan Flokstra; Peter Apers

2008-01-01

160

Variable Resolution Spatial Interpolation Using the Simple Recursive Point Voronoi  

E-print Network

Variable Resolution Spatial Interpolation Using the Simple Recursive Point Voronoi Diagram Robert of data sites. The procedure uses the Simple Recursive Point Voronoi Diagram in which Voronoi concepts point Voronoi d

161

Rate of Convergence in Recursive Parameter Estimation procedures  

E-print Network

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We study rate of convergence of recursive estimation procedures for the general statistical model.

Sharia, Teo

2007-01-01

162

DEPTH PROPERTIES OF SCALED ATTACHMENT RANDOM RECURSIVE TREES  

E-print Network

FRAIMAN Abstract. We study depth properties of a general class of random recursive trees where each node i proof for the height of uniform random recursive trees Hn e log n that does not use branching random walks. 1. Introduction A uniform random recursive tree (urrt) Tn of order n is a tree with n + 1 nodes

Devroye, Luc

163

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

164

Constraint Propagation for Linear Recursive Rules  

E-print Network

and later rejection of facts which are not relevant to the query. This propagation of constraints is much, and hence reduce the number of tuples generated. Another approach is to use the context transformations [9, 11], which exploit the properties of a certain class of linear recursions in order to propagate

Harland, James

165

Unsupervised SAR Image Segmentation Recursive Partitioning  

E-print Network

Unsupervised SAR Image Segmentation using Recursive Partitioning Vidya Venkatachalama, Robert D~oes, and Instituto Superior Tecnico 1049-001 Lisboa, Portugal ABSTRACT We present a new approach to SAR image segmentation based on a Poisson approximation to the SAR amplitude image. It has been established that SAR

Figueiredo, Mário A. T.

166

SEMIMARTINGALE STOCHASTIC APPROXIMATION PROCEDURE AND RECURSIVE ESTIMATION  

Microsoft Academic Search

The semimartingale stochastic approximation procedure, na- mely, the Robbins-Monro type SDE is introduced which naturally includes both generalized stochastic approximation algorithms with martingale no- ises and recursive parameter estimation procedures for statistical models associated with semimartingales. General results concerning the asymp- totic behaviour of the solution are presented. In particular, the conditions ensuring the convergence, rate of convergence and asymptotic

N. LAZRIEVA; T. SHARIA; T. TORONJADZE

2007-01-01

167

Semimartingale Stochastic Approximation Procedures and Recursive Estimation  

Microsoft Academic Search

The semimartingale stochastic approximation procedure, namely, the Robbins-Monro type SDE is introduced which naturally includes both generalized stochastic approximation algorithms with martingale noises and recursive parameter estimation procedures for statistical models associated with semimartingales. General results concerning the asymptotic behaviour of the solution are presented. In particular, the conditions ensuring the convergence, rate of convergence and asymptotic expansion are established.

N. Lazrieva; T. Sharia; T. Toronjadze

2007-01-01

168

Semimartingale stochastic approximation procedure and recursive estimation  

Microsoft Academic Search

UDC 519.2 Abstract. The semimartingale stochastic approximation procedure, precisely, the Robbins-Monro type SDE, is introduced, which naturally includes both generalized stochastic approximation algorithms with martingale noises and recursive parameter estimation procedures for statistical models associated with semimartingales. General results concerning the asymptotic behavior of the solution are presented. In particular, the conditions ensuring the convergence, the rate of convergence, and

N. Lazrieva; T. Sharia; T. Toronjadze

2008-01-01

169

A Recursive Filter for Despeckling SAR Images  

Microsoft Academic Search

This correspondence proposes a recursive algorithm for noise reduction in synthetic aperture radar imagery. Excellent despeckling in conjunction with feature preservation is achieved by incorporating a discontinuity-adaptive Markov random field prior within the unscented Kalman filter framework through importance sampling. The performance of this method is demonstrated on both synthetic and real examples.

Gorthi R. K. S. Subrahmanyam; A. N. Rajagopalan; R. Aravind

2008-01-01

170

Recursive descent parsing for Boolean grammars  

Microsoft Academic Search

The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules and which are formally defined by language equations. The algorithm is applicable to a subset of Boolean grammars. The complexity of a direct implementation varies between linear and exponential, while memoization keeps it down

Alexander Okhotin

2007-01-01

171

Time domain recursive deconvolution in sound reproduction  

Microsoft Academic Search

A time domain recursive algorithm for multichannel inverse filter design in sound reproduction systems is presented. The method exploits the non-symmetric Toeplitz-block structure of the actual multichannel system matrix that is used to specify the electroacoustic transmission paths. The result is a matrix of causal finite impulse response filters which best approximate a given time domain response in the least

A. Gonzalez; J. J. Lopez

2000-01-01

172

Recursive syntactic pattern learning by songbirds.  

PubMed

Humans regularly produce new utterances that are understood by other members of the same language community. Linguistic theories account for this ability through the use of syntactic rules (or generative grammars) that describe the acceptable structure of utterances. The recursive, hierarchical embedding of language units (for example, words or phrases within shorter sentences) that is part of the ability to construct new utterances minimally requires a 'context-free' grammar that is more complex than the 'finite-state' grammars thought sufficient to specify the structure of all non-human communication signals. Recent hypotheses make the central claim that the capacity for syntactic recursion forms the computational core of a uniquely human language faculty. Here we show that European starlings (Sturnus vulgaris) accurately recognize acoustic patterns defined by a recursive, self-embedding, context-free grammar. They are also able to classify new patterns defined by the grammar and reliably exclude agrammatical patterns. Thus, the capacity to classify sequences from recursive, centre-embedded grammars is not uniquely human. This finding opens a new range of complex syntactic processing mechanisms to physiological investigation. PMID:16641998

Gentner, Timothy Q; Fenn, Kimberly M; Margoliash, Daniel; Nusbaum, Howard C

2006-04-27

173

Recursive syntactic pattern learning by songbirds  

PubMed Central

Humans regularly produce new utterances that are understood by other members of the same language community1. Linguistic theories account for this ability through the use of syntactic rules (or generative grammars) that describe the acceptable structure of utterances2. The recursive, hierarchical embedding of language units (for example, words or phrases within shorter sentences) that is part of the ability to construct new utterances minimally requires a ‘context-free’ grammar2,3 that is more complex than the ‘finite-state’ grammars thought sufficient to specify the structure of all non-human communication signals. Recent hypotheses make the central claim that the capacity for syntactic recursion forms the computational core of a uniquely human language faculty4,5. Here we show that European starlings (Sturnus vulgaris) accurately recognize acoustic patterns defined by a recursive, self-embedding, context-free grammar. They are also able to classify new patterns defined by the grammar and reliably exclude agrammatical patterns. Thus, the capacity to classify sequences from recursive, centre-embedded grammars is not uniquely human. This finding opens a new range of complex syntactic processing mechanisms to physiological investigation. PMID:16641998

Gentner, Timothy Q.; Fenn, Kimberly M.; Margoliash, Daniel; Nusbaum, Howard C.

2009-01-01

174

Supporting Efficient Recursive Query Processing in DHTs  

Microsoft Academic Search

Although various approaches have been proposed to process complex queries, such as range queries, join queries, aggregate queries and etc., in Peer-to-Peer data management research, we find currently there are no effi- cient techniques to support linear recursive queries, whic h is also one indispensable types of queries and exhibits cru- cial importance in many scenarios. In this paper, we

Shicong Meng; Cong Shi; Dingyi Han; Yong Yu

175

Face recognition using recursive Fisher linear discriminant  

Microsoft Academic Search

Fisher linear discriminant (FLD) has recently emerged as a more efficient approach for extracting features for many pattern classification problems as compared to traditional principal component analysis. However, the constraint on the total number of features available from FLD has seriously limited its application to a large class of problems. In order to overcome this disadvantage, a recursive procedure of

Cheng Xiang; Xaooan Fan; Tongheng Lee

2006-01-01

176

Analysis of partially observed recursive tile systems  

E-print Network

of opacity and diagnosability. Keywords: Diagnosability, Opacity, Discrete event systems, Recursive systems 1 relates to computer security, based on the notion of opacity. The opacity problem consists in determining systems. Regarding the opacity problem, Bryans et al. (2008); Badouel et al. (2007); Dubreil et al. (2009

Boyer, Edmond

177

Linking clinical data using XML topic maps.  

PubMed

Most clinical data is narrative text and often not accessible and searchable at the clinical workstation. We have therefore developed a search engine that allows indexing, searching and linking different kinds of data using web technologies. Text matching methods fail to represent implicit relationships between data, e.g. the relationship between HIV and AIDS. The international organization for standardization (ISO) topic maps standard provides a data model that allows representing arbitrary relationships between resources. Such relationships form the basis for a context sensitive search and accurate search results. The extensible markup language (XML) standards are used for the interchange of data relationships. The approach has been applied to medical classification systems and clinical practice guidelines. The search engine is compared to other XML retrieval methods and the prospect of a "semantic web" is discussed. PMID:12850316

Schweiger, Ralf; Hoelzer, Simon; Rudolf, Dirk; Rieger, Joerg; Dudeck, Joachim

2003-05-01

178

An Exponentiation Method for XML Element Retrieval  

PubMed Central

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

2014-01-01

179

MRM: An Adaptive Framework for XML Searching Division of Computer Studies,  

E-print Network

MRM: An Adaptive Framework for XML Searching Ho Lam Lau Division of Computer Studies, The Community XML properties and adapt the features to different XML search needs. The model consists of a novel, which we call it the MRM XML search engine. The MRM engine employs only a list of simple XML tagged

Ng, Wilfred Siu Hung

180

A Multi-Ranker Model for Adaptive XML Searching Ho Lam Lau and Wilfred Ng  

E-print Network

A Multi-Ranker Model for Adaptive XML Searching Ho Lam Lau and Wilfred Ng Department of Computer needs and preferences in searching XML data. In this paper, we employ a list of simple XML tagged keywords as a vehicle for searching XML fragments in a collection of XML documents. In order to deal

Ng, Wilfred Siu Hung

181

ONTOLOGY MAPPING BETWEEN PSLAND XML-BASED STANDARDS FOR PROJECT SCHEDULING  

E-print Network

XML, ifcXML, ontology, information exchange 1 PhD Student, Civil and Environmental Engineering DepartmentONTOLOGY 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

Stanford University

182

XML Based Markup Languages for Specific Domains  

NASA Astrophysics Data System (ADS)

A challenging area in web based support systems is the study of human activities in connection with the web, especially with reference to certain domains. This includes capturing human reasoning in information retrieval, facilitating the exchange of domain-specific knowledge through a common platform and developing tools for the analysis of data on the web from a domain expert's angle. Among the techniques and standards related to such work, we have XML, the eXtensible Markup Language. This serves as a medium of communication for storing and publishing textual, numeric and other forms of data seamlessly. XML tag sets are such that they preserve semantics and simplify the understanding of stored information by users. Often domain-specific markup languages are designed using XML, with a user-centric perspective. Standardization bodies and research communities may extend these to include additional semantics of areas within and related to the domain. This chapter outlines the issues to be considered in developing domain-specific markup languages: the motivation for development, the semantic considerations, the syntactic constraints and other relevant aspects, especially taking into account human factors. Illustrating examples are provided from domains such as Medicine, Finance and Materials Science. Particular emphasis in these examples is on the Materials Markup Language MatML and the semantics of one of its areas, namely, the Heat Treating of Materials. The focus of this chapter, however, is not the design of one particular language but rather the generic issues concerning the development of domain-specific markup languages.

Varde, Aparna; Rundensteiner, Elke; Fahrenholz, Sally

183

Recursive least-squares algorithms for fast discrete frequency domain equalization  

NASA Astrophysics Data System (ADS)

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.

Picchi, G.; Prati, G.

184

Intelligent Querying of Web Documents Using a Deductive XML Repository  

Microsoft Academic Search

In this paper, we present a deductive object-oriented database system, called X-DEVICE, WHICH is used as a repository for XML documents. X-DEVICE employs a powerful rule-based query language for intelligently querying stored Web documents and data and publishing the results. XML documents are stored into the OODB by automatically mapping the DTD to an object schema. XML elements are treated

Nick Bassiliades; Ioannis P. Vlahavas

2002-01-01

185

A typed representation for HTML and XML documents in Haskell  

Microsoft Academic Search

Abstract We dene,a family of embedded domain specic languages for generating HTML and XML documents. Each language,is implemented,as a combinator,library in Haskell. The generated HTML\\/XML documents are guaranteed to be well-formed. In addition, each library can guarantee,that the generated,documents,are valid XML documents,to a certain extent (for HTML only a weaker guarantee is possible). On top of the libraries, Haskell serves

Peter Thiemann

2002-01-01

186

No Tag, a Little Nesting, and Great XML Keyword Search  

Microsoft Academic Search

\\u000a Keyword search from Informational Retrieval (IR) can be seen as one most convenient processing mode catering for common users\\u000a to obtain interesting information. As XML data becomes more and more widespread, the trend of adapting keyword search on XML\\u000a data also becomes more and more active. In this paper, we first try nesting mechanism for XML keyword search, which just

Lingbo Kong; Shiwei Tang; Dongqing Yang; Tengjiao Wang; Jun Gao

2006-01-01

187

GRAMS3: An Efficient Framework for XML Structural Similarity Search  

Microsoft Academic Search

\\u000a Structural similarity search is a fundamental technology for XML data management. However, existing methods do not scale well\\u000a with large volume of XML document. The pq-gram is an efficient way of extracting substructure from the tree-structured data for approximate structural similarity search.\\u000a In this paper, we propose an effective framework GRAMS3 for evaluating structural similarity of XML data. First pq-grams

Peisen Yuan; Xiaoling Wang; Chaofeng Sha; Ming Gao; Aoying Zhou

2010-01-01

188

YAPI: Yet Another Path Index for XML Searching  

Microsoft Academic Search

\\u000a As many metadata are encoded in XML, and many digital libraries need to manage XML documents, efficient techniques for searching\\u000a in such formatted data are required. In order to efficiently process path expressions with wildcards on XML data, a new path\\u000a index is proposed. Extensive evaluation confirms better performance with respect to other techniques proposed in the literature.\\u000a An extension

Giuseppe Amato; Franca Debole; Pavel Zezula; Fausto Rabitti

189

XML — an opportunity for data standards in the geosciences  

NASA Astrophysics Data System (ADS)

Extensible markup language (XML) is a recently introduced meta-language standard on the Web. It provides the rules for development of metadata (markup) standards for information transfer in specific fields. XML allows development of markup languages that describe what information is rather than how it should be presented. This allows computer applications to process the information in intelligent ways. In contrast hypertext markup language (HTML), which fuelled the initial growth of the Web, is a metadata standard concerned exclusively with presentation of information. Besides its potential for revolutionizing Web activities, XML provides an opportunity for development of meaningful data standards in specific application fields. The rapid endorsement of XML by science, industry and e-commerce has already spawned new metadata standards in such fields as mathematics, chemistry, astronomy, multi-media and Web micro-payments. Development of XML-based data standards in the geosciences would significantly reduce the effort currently wasted on manipulating and reformatting data between different computer platforms and applications and would ensure compatibility with the new generation of Web browsers. This paper explores the evolution, benefits and status of XML and related standards in the more general context of Web activities and uses this as a platform for discussion of its potential for development of data standards in the geosciences. Some of the advantages of XML are illustrated by a simple, browser-compatible demonstration of XML functionality applied to a borehole log dataset. The XML dataset and the associated stylesheet and schema declarations are available for FTP download.

Houlding, Simon W.

2001-08-01

190

Software Development Of XML Parser Based On Algebraic Tools  

NASA Astrophysics Data System (ADS)

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.

Georgiev, Bozhidar; Georgieva, Adriana

2011-12-01

191

C:\\idrive\\web\\intro6e\\supplement\\Supplement6(d)JavaXML.doc Last printed Supplement VI.D: Java and XML  

E-print Network

C:\\idrive\\web\\intro6e\\supplement\\Supplement6(d)JavaXML.doc Last printed Supplement VI.D: Java and XML For Introduction to Java Programming By Y. Daniel Liang This supplement introduces how to use Java is required for this supplement. To learn XML, please read Supplement VI.C, "XML." 0 Introduction

Liang, Y. Daniel

192

Semimartingale Stochastic Approximation Procedures and Recursive Estimation  

E-print Network

The semimartingale stochastic approximation procedure, namely, the Robbins-Monro type SDE is introduced which naturally includes both generalized stochastic approximation algorithms with martingale noises and recursive parameter estimation procedures for statistical models associated with semimartingales. General results concerning the asymptotic behaviour of the solution are presented. In particular, the conditions ensuring the convergence, rate of convergence and asymptotic expansion are established. The results concerning the Polyak weighted averaging procedure are also presented.

Lazrieva, N; Toronjadze, T

2007-01-01

193

Representation and Recursion in the Archaeological Record  

Microsoft Academic Search

Living humans are unique among the animal kingdom with respect to their ability to externalize mental representations outside\\u000a the brain through a variety of media and in a recursive or creative manner (i.e., generating a potentially infinite array\\u000a of combinations). Earlier humans evolved two specialized organs—the hand and the vocal tract—as primary instruments for externalizing\\u000a artificial or semantic representations. These

John F. Hoffecker

2007-01-01

194

Experimental Evaluation of a Recursive Model Identification Technique for Type 1 Diabetes  

PubMed Central

Background A model-based controller for an artificial ? cell requires an accurate model of the glucose–insulin dynamics in type 1 diabetes subjects. To ensure the robustness of the controller for changing conditions (e.g., changes in insulin sensitivity due to illnesses, changes in exercise habits, or changes in stress levels), the model should be able to adapt to the new conditions by means of a recursive parameter estimation technique. Such an adaptive strategy will ensure that the most accurate model is used for the current conditions, and thus the most accurate model predictions are used in model-based control calculations. Methods In a retrospective analysis, empirical dynamic autoregressive exogenous input (ARX) models were identified from glucose–insulin data for nine type 1 diabetes subjects in ambulatory conditions. Data sets consisted of continuous (5-minute) glucose concentration measurements obtained from a continuous glucose monitor, basal insulin infusion rates and times and amounts of insulin boluses obtained from the subjects' insulin pumps, and subject-reported estimates of the times and carbohydrate content of meals. Two identification techniques were investigated: nonrecursive, or batch methods, and recursive methods. Batch models were identified from a set of training data, whereas recursively identified models were updated at each sampling instant. Both types of models were used to make predictions of new test data. For the purpose of comparison, model predictions were compared to zero-order hold (ZOH) predictions, which were made by simply holding the current glucose value constant for p steps into the future, where p is the prediction horizon. Thus, the ZOH predictions are model free and provide a base case for the prediction metrics used to quantify the accuracy of the model predictions. In theory, recursive identification techniques are needed only when there are changing conditions in the subject that require model adaptation. Thus, the identification and validation techniques were performed with both “normal” data and data collected during conditions of reduced insulin sensitivity. The latter were achieved by having the subjects self-administer a medication, prednisone, for 3 consecutive days. The recursive models were allowed to adapt to this condition of reduced insulin sensitivity, while the batch models were only identified from normal data. Results Data from nine type 1 diabetes subjects in ambulatory conditions were analyzed; six of these subjects also participated in the prednisone portion of the study. For normal test data, the batch ARX models produced 30-, 45-, and 60-minute-ahead predictions that had average root mean square error (RMSE) values of 26, 34, and 40 mg/dl, respectively. For test data characterized by reduced insulin sensitivity, the batch ARX models produced 30-, 60-, and 90-minute-ahead predictions with average RMSE values of 27, 46, and 59 mg/dl, respectively; the recursive ARX models demonstrated similar performance with corresponding values of 27, 45, and 61 mg/dl, respectively. The identified ARX models (batch and recursive) produced more accurate predictions than the model-free ZOH predictions, but only marginally. For test data characterized by reduced insulin sensitivity, RMSE values for the predictions of the batch ARX models were 9, 5, and 5% more accurate than the ZOH predictions for prediction horizons of 30, 60, and 90 minutes, respectively. In terms of RMSE values, the 30-, 60-, and 90-minute predictions of the recursive models were more accurate than the ZOH predictions, by 10, 5, and 2%, respectively. Conclusion In this experimental study, the recursively identified ARX models resulted in predictions of test data that were similar, but not superior, to the batch models. Even for the test data characteristic of reduced insulin sensitivity, the batch and recursive models demonstrated similar prediction accuracy. The predictions of the identified ARX models were only marginally more accurate than the model-free ZOH predictio

Finan, Daniel A.; Doyle, Francis J.; Palerm, Cesar C.; Bevier, Wendy C.; Zisser, Howard C.; Jovanovi?, Lois; Seborg, Dale E.

2009-01-01

195

A Simple XML Producer-Consumer Protocol  

NASA Technical Reports Server (NTRS)

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.

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

2001-01-01

196

Accurate searching using XML and topic maps.  

PubMed

Most clinical data is narrative text and often not accessible and searchable at the clinical workstation. We have therefore developed a search engine that allows indexing, searching and linking different kinds of data using web technologies. Text matching methods fail to represent implicit relationships between data, e.g. the relationship between HIV and AIDS. The ISO topic maps standard provides a data model that allows representing arbitrary relationships between resources. Such relationships form the basis for context sensitive searching and accurate search results. XML standards are used for the interchange of data relationships. Our approach has been applied to medical classification systems and clinical practice guidelines with promising results. PMID:14664036

Schweiger, Ralf; Hölzer, Simon; Dudeck, Joachim

2003-01-01

197

Efficient tethered aerostat model formulation using non-recursive and recursive rigid body dynamics  

NASA Astrophysics Data System (ADS)

A computationally efficient discrete model for low strain tethers used in many engineering applications is developed without the use of elastic elements. The tether is modeled using N links, with each link treated as a body of revolution where it is assumed the tether spin is negligible to the dynamics, resulting in each link having only two degrees of freedom. A recursive algorithm is developed for the dynamic equations, with the solution procedure being an order N method requiring only a 2 by 2 matrix inversion, resulting in approximately half the computations of the general recursive algorithm. A comparison between the proposed efficient recursive rigid body model and a lumped point mass model shows the absence of stiff elastic elements eliminates high frequency axial vibrations that appear in many lumped point mass tether models. Absence of high frequency axial vibration facilitates numerical integration of the equations, providing further improvements in computational speed. Furthermore, actual data acquired from UAHuntsville's Optical Tracking Laboratory (OTL) validates the proposed model. A tethered aerostat model is developed using the proposed recursive tether model. The tether is attached to a 6 degree of freedom aerostat model using a single visco-elastic element. The final recursive tether-aerostat model is well suited for a variety of trade studies required for design and analysis of such systems due to its low computational cost and numerical robustness. Simulations are used to show how the proposed recursive model can be used to investigate the dynamic response and tether loads for a 17 m tethered aerostat in response to varying winds.

Hembree, Bradley C.

198

A Typed Calculus for Querying Distributed XML Documents  

Microsoft Academic Search

There is by now little doubt that XML will succeed as a lingua-franca of data interchange on the Web. As a matter of fact, XML is a building block in the development of new models of concurrent applications, often referred to as SOA (for Service-Oriented Architecture) or Web Services, where computational resources are made available on a network as a

Lucia Acciai; Michele Boreale; Silvano Dal-zilio

2006-01-01

199

An Expressive and Efficient Language for XML Information Retrieval.  

ERIC Educational Resources Information Center

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

Chinenyanga, Taurai Tapiwa; Kushmerick, Nicholas

2002-01-01

200

Data Manipulation in an XML-Based Digital Image Library  

ERIC Educational Resources Information Center

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

Chang, Naicheng

2005-01-01

201

Adaptive Hypermedia Educational System Based on XML Technologies.  

ERIC Educational Resources Information Center

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

Baek, Yeongtae; Wang, Changjong; Lee, Sehoon

202

Chemical Markup, XML, and the Worldwide Web. 1. Basic Principles  

Microsoft Academic Search

Chemical markup language (CML) is an application of XML, the extensible markup language, developed for containing chemical information components within documents. Its design supports interoperability with the XML family of tools and protocols. It provides a base functionality for atomic, molecular, and crystallographic information and allows extensibility for other chemical applications. Legacy files can be imported into CML without information

Peter Murray-rust; Henry S. Rzepa

1999-01-01

203

Adding XML to the MIS Curriculum: Lessons from the Classroom  

ERIC Educational Resources Information Center

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

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

2008-01-01

204

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

ERIC Educational Resources Information Center

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

Sapienza, Filipp

2002-01-01

205

XML-Based Language for Specific Scientific Data Description  

Microsoft Academic Search

The scientific computing manages massive amounts of very large data sets. The development of description of the format, structure and semantic content of data is essential for the automatic manipulation of data. The aim of this paper is to define an XML-based language for describing the structure, semantic and annotation of scientific data. The XML Schema and the Document Type

Bogdan Shishedjiev; Mariana Goranova; Juliana Georgieva

2010-01-01

206

Fuzzy Duplicate Detection on XML Data Melanie Weis  

E-print Network

, 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

Weske, Mathias

207

XSeek: A Semantic XML Search Engine Using Keywords  

Microsoft Academic Search

We present XSeek, a keyword search engine that enables users to easily access XML data without the need of learn- ing XPath or XQuery and studying possibly complex data schemas. XSeek addresses a challenge in XML keyword search that has been neglected in the literature: how to determine the desired return information, analogous to in- ferring a \\

Ziyang Liu; Jeffrey Walker; Yi Chen

2007-01-01

208

An Extension of LCA Based XML Keyword Search  

Microsoft Academic Search

One of the most convenient ways to query XML data is a keyword search because it does not require any knowledge about XML structure and without the need to learn a new user interface. However, keyword search interface is very flexible. It is hard for a system to decide which node is likely to be chosen as a return node

U. Supasitthimethee; T. Shimizu; M. Yoshikawa; K. Porkaew

2008-01-01

209

Improving XML search by generating and utilizing informative result snippets  

Microsoft Academic Search

Snippets are used by almost every text search engine to complement the ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance semantics are difficult to assess. Despite the fact that XML is a standard representation format of Web data, research on generating result snippets for XML search remains limited. To tackle this important

Ziyang Liu; Yu Huang; Yi Chen

2010-01-01

210

The study of key techniques in intelligent XML search engine  

Microsoft Academic Search

With the rapid development of Internet, Web has been becoming a main information source. Search engine is the most important information retrieval tool. However, most popular search engines are based on HTML documents and lack of semantic retrieval and personalized service. This paper introduces the conception of XML search engine, gives a framework of an intelligent XML search engine, and

Fang Yuan; Ya-Nan Hao; Ge Yu

2004-01-01

211

XML Full-Text Search: Challenges and Opportunities  

Microsoft Academic Search

An ever growing number of XML repositories are being made available for search. A lot of activity has been deployed in the past few years to query such repositories. In particular, full-text querying of text-rich XML documents has generated a wealth of issues that are being addressed by both the database (DB) and information retrieval (IR) communities. The DB community

Sihem Amer-Yahia; Jayavel Shanmugasundaram

2005-01-01

212

Suggestion of promising result types for XML keyword search  

Microsoft Academic Search

Although keyword query enables inexperienced users to eas- ily search XML database with no specific knowledge of com- plex structured query languages or XML data schemas, the ambiguity of keyword query may result in generating a great number of results that may be classified into different types. For users, each result type implies a possible search inten- tion. To improve

Jianxin Li; Chengfei Liu; Rui Zhou; Wei Wang

2010-01-01

213

XML and information retrieval: a SIGIR 2000 workshop  

Microsoft Academic Search

XML - the eXtensible Markup Language has recently emerged as a new standard for data representation and exchange on the Interact. It is believed that it will become a universal format for data exchange on the Web and that in the near future we will find vast amounts of documents in XML format on the Web. As a result, it

David Carmel; Yoëlle S. Maarek; Aya Soffer

2001-01-01

214

Data Extraction of XML Files using Searching and Indexing Techniques  

Microsoft Academic Search

XML files contain data which is in well formatted manner. By studying the format or semantics of the grammar it will be helpful for fast retrieval of the data. There are many algorithms which describes about searching the data from XML files. There are no. of approaches which uses data structure or are related to the contents of the document.

Sushma Satpute; Vaishali Katkar; Nilesh Sahare

2008-01-01

215

XSemantic: An Extension of LCA Based XML Semantic Search  

Microsoft Academic Search

One of the most convenient ways to query XML data is a keyword search because it does not require any knowledge of XML structure or learning a new user interface. However, the keyword search is ambiguous. The users may use different terms to search for the same information. Furthermore, it is difficult for a system to decide which node is

Umaporn Supasitthimethee; Toshiyuki Shimizu; Masatoshi Yoshikawa; Kriengkrai Porkaew

2009-01-01

216

eXtract: a snippet generation system for XML search  

Microsoft Academic Search

Snippets are used by almost every text search engine to comple- ment ranking schemes in order to effectively handle user keyword search. Despite the fact that XML is a standard representation for- mat of web data, research on generating result snippets for XML search remains untouched. In this work, we present eXtract, a sys- tem that efficiently generates self-contained result

Yu Huang; Ziyang Liu; Yi Chen

2008-01-01

217

TargetSearch: A ranking friendly XML keyword search engine  

Microsoft Academic Search

This demo illustrates an XML search engine TargetSearch that addresses an open problem in XML keyword search: given relevant matches to keywords, how to compose query results properly so that they can be effectively ranked and easily digested by users. The approaches adopted in the literature generate either overwhelmingly large results or fragmentary results, both of which may cause the

Ziyang Liu; Yichuan Cai; Yi Chen

2010-01-01

218

Concrete uses of XML in software development and data analysis  

E-print Network

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

S. Patton

2003-06-11

219

Branch & Bound Algorithm with Partial Prediction for Use with Recursive and Non-recursive Criterion Forms  

Microsoft Academic Search

We introduce a novel algorithm for optimal feature selection. As opposed to our recent Fast Branch & Bound (FBB) algorithm [5] the new algorithm is well suitable for use with recursive criterion forms. Even if the new algorithm does not operate as\\u000a effectively as the FBB algorithm, it is able to find the optimum significantly faster than any other Branch

Petr Somol; Pavel Pudil; Jiri Grim

2001-01-01

220

Reflective Inductive Inference of Recursive Functions  

Microsoft Academic Search

In this paper, we investigate reflective inductive inference of recursive functions. A reflective IIM is a learning machine\\u000a that is additionally able to assess its own competence.\\u000a \\u000a First, we formalize reflective learning from arbitrary example sequences. Here, we arrive at four different types of reflection:\\u000a reflection in the limit, optimistic, pessimistic and exact reflection.\\u000a \\u000a \\u000a \\u000a Then, for learning in the limit,

Gunter Grieser

2002-01-01

221

Recursive estimator for OSO-8 attitude  

NASA Technical Reports Server (NTRS)

Modifications and enhancements that have been made to the Recursive Estimation Attitude Program (REAP) are discussed. Continuous attitudes for OSO-8 to + or - 0.05 degree accuracy are determined from Sun and star slit sensors mounted on the spinning portion of the spacecraft. The bulk of the attitude production is performed by a Weighted Least Squares (WLS) batch processor, but REAP is used for problem passes such as those involving gas jet maneuvers, sparse star fields, or star sensor saturation by high energy particles in the South Atlantic Anomaly.

Headrick, R. D.; Park, D. Y.

1978-01-01

222

Prune XML Before You Search It: XML Transformations for Query Optimization  

Microsoft Academic Search

\\u000a In this paper, we present a query optimization approach for XML document management environments loosely-coupled with the\\u000a storage system. Our technique is based on two main steps: first, based on the query, input documents are transformed, by pruning\\u000a parts that are irrelevant with respect to the query; then the query is executed on the pruned documents. An index structure\\u000a is

Stéphane Bressan; Zoé Lacroix; Ying Guang Li; Anna Maddalena

2004-01-01

223

A general technique for querying XML documents using a relational database system  

Microsoft Academic Search

There has been recent interest in using relational database systems to store and query XML documents. Each of the techniques proposed in this context works by (a) creating tables for the purpose of storing XML documents (also called relational schema generation), (b) storing XML documents by shredding them into rows in the created tables, and (c) converting queries over XML

Jayavel Shanmugasundaram; Eugene J. Shekita; Jerry Kiernan; Rajasekar Krishnamurthy; Efstratios Viglas; Jeffrey F. Naughton; Igor Tatarinov

2001-01-01

224

TwigTable: using semantics in XML twig pattern query processing  

E-print Network

in Section 2.1. Normally an XML query is composed of structural search and content search. Consider an XPathTwigTable: using semantics in XML twig pattern query processing Huayu Wu, Tok Wang Ling, Bo Chen class and relationship between object classes in XML data impacts XML query processing. We show

Ling, Tok Wang

225

An Adaptive Path Index for XML Data using the Query Workload  

E-print Network

searching. XML data is an instance of semistructured data [1]. XML documents comprise hierarchically nested or path indexes can speed up query evaluation on XML data by restricting the search to only relevantAn Adaptive Path Index for XML Data using the Query Workload Jun-Ki Min a,1 Chin-Wan Chung a,2

Chung, Chin-Wan

226

A Co-Training Framework for Searching XML Wilfred Ng and Lau Ho Lam  

E-print Network

A Co-Training Framework for Searching XML Documents Wilfred Ng and Lau Ho Lam Department}@cs.ust.hk Abstract In this paper, we study the use of XML tagged keywords (or simply key-tags) to search an XML as feedback and then to generate an adap- tive ranked list of XML fragments as the search results. First, we

Ng, Wilfred Siu Hung

227

FRAMEWORK FOR A XML BASED SEARCH SYSTEM: A COMPONENT OF THE PORTUGUESE PARLIAMENT DIGITAL LIBRARY  

Microsoft Academic Search

This article presents a framework for a XML based search system composed of three layers: data layer, logic layer and presentation layer. In all three layers XML related technologies are used to store, search, transport and present information like Native XML Databases, Web Services and XSLT. Two examples of an implementation of a XML based search system are presented and

Pedro Manuel Almeida; Joaquim Arnaldo Martins; Joaquim Sousa Pinto; Helder Troca Zagalo; JOAQUIM SOUSA

228

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

E-print Network

nature of XML documents for the purpose of their retrieval (e.g. [4, 8]). Searching XML documents re matching and regular expressions, which does not suffice for relevance-oriented search on XML doc- uments. Examples of query languages that provide relevance-oriented search of XML documents include e.g. [9, 18

Lalmas, Mounia

229

From Structure-based to Semantics-based: towards Effective XML Keyword Search  

E-print Network

From Structure-based to Semantics-based: towards Effective XML Keyword Search Thuy Ngoc Le@ruc.edu.cn Abstract. Existing XML keyword search approaches can be categorized into tree-based search and graph- mantics in XML keyword search and propose a semantics-based approach to pro- cess XML keyword queries

Ling, Tok Wang

230

Towards an Effective XML Keyword Search Zhifeng Bao, Jiaheng Lu, Tok Wang Ling and Bo Chen  

E-print Network

1 Towards an Effective XML Keyword Search Zhifeng Bao, Jiaheng Lu, Tok Wang Ling and Bo Chen, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: (1) Identify the user search intention, i.e. identify the XML node types that user

Ling, Tok Wang

231

Growing Triples on Trees: an XML-RDF Hybrid Model for Annotated Documents  

E-print Network

and effective search for information within large XML corpora is thus crucial. Optimizing the XML stor- age a newspaper publishing its articles in XML. To enhance the way readers search for information, the adminGrowing Triples on Trees: an XML-RDF Hybrid Model for Annotated Documents Franc¸ois Goasdou´e1

Paris-Sud XI, Université de

232

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

ERIC Educational Resources Information Center

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…

Merrill, Paul F.

2005-01-01

233

A Data Parallel Algorithm for XML DOM Parsing  

NASA Astrophysics Data System (ADS)

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.

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

234

The Advent of Recursion in Programming, 1950s-1960s  

E-print Network

The Advent of Recursion in Programming, 1950s-1960s Edgar G. Daylight Institute of Logic, Language away from the down- to-earth practicalities of their computing machines. By the end of the 1960s, some in this paper by focusing on the definition and implementation of the ALGOL60 program- ming language. Recursion

Amsterdam, University of

235

PLANE RECURSIVE TREES, STIRLING PERMUTATIONS AND AN URN MODEL  

E-print Network

PLANE RECURSIVE TREES, STIRLING PERMUTATIONS AND AN URN MODEL SVANTE JANSON Abstract. We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some and plateaux in a random Stirling permutation. The proof uses an interesting generalized P´olya urn. 1

Janson, Svante

236

PLANE RECURSIVE TREES, STIRLING PERMUTATIONS AND AN URN MODEL  

E-print Network

PLANE RECURSIVE TREES, STIRLING PERMUTATIONS AND AN URN MODEL SVANTE JANSON Abstract. We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some and plateaux in a random Stirling permutation. The proof uses an interesting generalized Pâ??olya urn. 1

Janson, Svante

237

Recursive estimation of parameters in Markov-modulated Poisson processes  

Microsoft Academic Search

A hidden Markov regime is a Markov process that governs the time or space dependent distributions of an observed stochastic process. Recursive algorithms can be used to estimate parameters in mixed distributions governed by a Markov regime. The authors derive a recursive algorithm for estimation of parameters in a Markov-modulated Poisson process also called a Cox point process. By this

Georg Lindgren; U. Hoist

1995-01-01

238

Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type  

E-print Network

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

Kågström, Bo

239

Toward a connectionist model of recursion in human linguistic performance  

Microsoft Academic Search

Naturally occurring speech contains only a limited amount of complex recursive structure, and this is reflected in the empirically documented difficulties that people experience when processing such structures. We present a connectionist model of human performance in processing recursive language structures. The model is trained on simple artificial languages. We find that the qualitative performance profile of the model matches

Morten H Christiansen; Nick Chater

1999-01-01

240

On Efficient and Effective Association Rule Mining from XML Data  

Microsoft Academic Search

\\u000a In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In\\u000a XAR-Miner, raw XML data are first transform ed to either an Indexed Content Tree (IX-tree) or M ulti-relational databases\\u000a (Multi-DB), depending on the size of XML document and memory constraint of the system, for efficient data selection in the\\u000a AR mining.

Ji Zhang; Tok Wang Ling; Robert M. Bruckner; A. Min Tjoa; Han Liu

2004-01-01

241

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

E-print Network

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

Pei, Jian

242

Taxonomy of XML Schema Languages Using Formal Language Theory  

Microsoft Academic Search

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

Makoto Murata; Dongwon Lee; Murali Mani

2001-01-01

243

The XML approach to implementing space link extension service management  

NASA Technical Reports Server (NTRS)

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.

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

2001-01-01

244

Algebraic Modeling of Information Retrieval in XML Documents  

NASA Astrophysics Data System (ADS)

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

Georgiev, Bozhidar; Georgieva, Adriana

2009-11-01

245

ELCA Evaluation for Keyword Search on Probabilistic XML Data  

E-print Network

As probabilistic data management is becoming one of the main research focuses and keyword search is turning into a more popular query means, it is natural to think how to support keyword queries on probabilistic XML data. With regards to keyword query on deterministic XML documents, ELCA (Exclusive Lowest Common Ancestor) semantics allows more relevant fragments rooted at the ELCAs to appear as results and is more popular compared with other keyword query result semantics (such as SLCAs). In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. After defining probabilistic ELCA semantics in terms of possible world semantics, we propose an approach to compute ELCA probabilities without generating possible worlds. Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. Finally, we experimentally evaluate the proposed ELCA algorithm ...

Zhou, Rui; Li, Jianxin; Yu, Jeffrey Xu

2011-01-01

246

Post's program and incomplete recursively enumerable sets.  

PubMed Central

A set A of nonnegative integers is recursively enumerable (r.e.) if A can be computably listed. It is shown that there is a first-order property, Q(X), definable in E, the lattice of r.e. sets under inclusion, such that (i) if A is any r.e. set satisfying Q(A) then A is nonrecursive and Turing incomplete and (ii) there exists an r.e. set A satisfying Q(A). This resolves a long open question stemming from Post's program of 1944, and it sheds light on the fundamental problem of the relationship between the algebraic structure of an r.e. set A and the (Turing) degree of information that A encodes. PMID:11607241

Harrington, L; Soare, R I

1991-01-01

247

A recursive approach to prony parameter estimation  

NASA Astrophysics Data System (ADS)

The Prony series method of fitting a series of complex exponentials to a time series can be applied to many acoustic and vibration signals. For example, in the analysis of a structure's response to transient excitation the Prony series method can be used to find the natural frequencies, damping ratios, amplitudes and relative phases of the modes of the structure. One of the main problems with this method is the need to calculate and invert matrices. In this paper an algorithm that combines the Prony series method with the recursive least squares algorithm is described. This eliminates the need to invert any matrices and also requires only part of the data to be available at one particular time. The method is applied to analyze a simulated structure's response and also to analyze the response of a beam to transient excitation.

Davies, P.

1983-08-01

248

An XML-based communication protocol for accelerator distributed controls  

Microsoft Academic Search

This paper presents the development of XMLvRPC, an RPC-like communication protocol based, for this particular application, on the TCP\\/IP and XML (eXtensible Markup Language) tools built-in in LabVIEW. XML is used to format commands and data passed between client and server while socket interface for communication uses either TCP or UDP transmission protocols. This implementation extends the features of these

L. Catani

2008-01-01

249

WEBBASED TEST MONITOR A Realtime Application of Java and XML  

E-print Network

WEB­BASED TEST MONITOR ­­­ A Real­time Application of Java and XML Yunlei Duan A Project Report December, 2000 #12; 2 ABSTRACT WEB­BASED TEST MONITOR ­­­ A Real­time Application of Java and XML Yunlei a big headache. Most of them do not support multithreading. #12; 3 Certainly with old technology

250

Personalizing XML Text Search in PimenT  

Microsoft Academic Search

A growing number of text-rich XML repositories are being made available. As a result, more efforts have been deployed to provide XML full-text search that combines querying structure with complex conditions on text ranging from simple keyword search to sophisticated proximity search composed with stemming and thesaurus. However, one of the key challenges in full-text search is to match users'

Sihem Amer-Yahia; Irini Fundulaki; Prateek Jain; Laks V. S. Lakshmanan

2005-01-01

251

An Effective Object-Level XML Keyword Search  

Microsoft Academic Search

\\u000a Keyword search is widely recognized as a convenient way to retrieve information from XML data. In order to precisely meet\\u000a users’ search concerns, we study how to effectively return the targets that users intend to search for. We model XML document\\u000a as a set of interconnected object-trees, where each object contains a subtree to represent a concept in the real

Zhifeng Bao; Jiaheng Lu; Tok Wang Ling; Liang Xu; Huayu Wu

2010-01-01

252

MCN: A New Semantics Towards Effective XML Keyword Search  

Microsoft Academic Search

We investigate the expressiveness of existing XML keyword search semantics and propose Meaningful Connected Network (MCN) as a new semantics to capture meaningful relationships of the given keywords from XML documents. Our evaluation method adopts\\u000a a two-step strategy to compute all MCNs. In the first step, we identify a set of query patterns from a new schema summary;\\u000a in the

Junfeng Zhou; Zhifeng Bao; Tok Wang Ling; Xiaofeng Meng

2009-01-01

253

XML Structural Similarity Search Using MapReduce  

Microsoft Academic Search

\\u000a XML is a de-facto standard for web data exchange and information representation. Efficient management of these large volumes\\u000a of XML data brings challenges to conventional technique. To cope with large scale data, MapReduce computing framework as an\\u000a efficient solution has attracted more and more attention in the database community recently. In this paper, an efficient and\\u000a scalable framework is proposed

Peisen Yuan; Chaofeng Sha; Xiaoling Wang; Bin Yang; Aoying Zhou; Su Yang

2010-01-01

254

Evaluation of Intelligent Component Technologies for VoiceXML Applications  

Microsoft Academic Search

VoiceXML offers the prospect of a streamlined deployment process of voice-interfaces for commercial applications, similar to the ease of web development. This in turn promises in- creased dynamism in the field of speech and language research. The aim of this work is to inves- tigate opportunities and constraints for the integration of intelligent component technologies into VoiceXML-based systems: candidate tasks

Markus Mittendorfer; Georg Niklfeld; Werner Winiwarter

255

A Wiener-process-based degradation model with a recursive filter algorithm for remaining useful life estimation  

NASA Astrophysics Data System (ADS)

Remaining useful life estimation (RUL) is an essential part in prognostics and health management. This paper addresses the problem of estimating the RUL from the observed degradation data. A Wiener-process-based degradation model with a recursive filter algorithm is developed to achieve the aim. A novel contribution made in this paper is the use of both a recursive filter to update the drift coefficient in the Wiener process and the expectation maximization (EM) algorithm to update all other parameters. Both updating are done at the time that a new piece of degradation data becomes available. This makes the model depend on the observed degradation data history, which the conventional Wiener-process-based models did not consider. Another contribution is to take into account the distribution in the drift coefficient when updating, rather than using a point estimate as an approximation. An exact RUL distribution considering the distribution of the drift coefficient is obtained based on the concept of the first hitting time. A practical case study for gyros in an inertial navigation system is provided to substantiate the superiority of the proposed model compared with competing models reported in the literature. The results show that our developed model can provide better RUL estimation accuracy.

Si, Xiao-Sheng; Wang, Wenbin; Hu, Chang-Hua; Chen, Mao-Yin; Zhou, Dong-Hua

2013-02-01

256

Container-component model and XML in ALMA ACS  

NASA Astrophysics Data System (ADS)

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

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

2004-09-01

257

Structural Query Optimization in Native XML Databases: A Hybrid Approach  

NASA Astrophysics Data System (ADS)

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

Haw, Su-Cheng; Lee, Chien-Sing

258

Path Query Processing in Large-Scale XML Databases  

NASA Astrophysics Data System (ADS)

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

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

259

C:\\idrive\\web\\intro6e\\supplement\\Supplement6(c)XML.doc Last printed Supplement VI.C: XML  

E-print Network

C:\\idrive\\web\\intro6e\\supplement\\Supplement6(c)XML.doc Last printed Supplement VI.C: XML For Introduction to Java Programming By Y. Daniel Liang This supplement covers the following topics: · Creating XML to format and display query results and process database operations in Oracle. 1 #12;C:\\idrive\\web\\intro6e\\supplement\\Supplement

Liang, Y. Daniel

260

Recursive hybrid algorithm for non-linear system identification using radial basis function networks  

Microsoft Academic Search

Recursive identification of non-linear systems is investigated using radial basis function networks. A novel approach is adopted which employs a hybrid clustering and least squares algorithm. The recursive clustering algorithm adjusts the centres of the radial basis function network while the recursive least squares algorithm estimates the connection weights of the network. Because these two recursive learning rules are both

S. CHEN; S. A. BILLINGS; P. M. GRANT

1992-01-01

261

Logic verification using recursive learning, ATPG and transformations  

E-print Network

We describe a new approach for formal verification of combinational logic circuits using Recursive learning, ATPG and Transformations. A logic verification tool, VeriLAT, was implemented based on this approach. Experimental results on the ISCAS85...

Paul, Debjyoti

2012-06-07

262

Design of recursive 1-D variable filters with guaranteed stability  

Microsoft Academic Search

The digital filters with adjustable frequency-domain characteristics are called variable filters. Variable filters are used in many signal processing fields, but the recursive variable filters are extremely difficult to design due to the stability problem. This paper proposes a new method for designing recursive one-dimensional (1-D) variable filters whose stability is guaranteed. The method finds the coefficients of the transfer

Tian-Bo Deng

1997-01-01

263

Recursion Hypothesis Considered as a Research Program for Cognitive Science  

Microsoft Academic Search

Humans grasp discrete infinities within several cognitive domains, such as in language, thought, social cognition and tool-making.\\u000a It is sometimes suggested that any such generative ability is based on a computational system processing hierarchical and\\u000a recursive mental representations. One view concerning such generativity has been that each of the mind’s modules defining\\u000a a cognitive domain implements its own recursive computational

Pauli Brattico

2010-01-01

264

Towards Analysis of Flexible and Collaborative Workflow Using Recursive ECATNets  

Microsoft Academic Search

In this paper we define a model, namely the recursive ECATNets (Recatnets) based on a sound combination of Extended Concurrent\\u000a Algebraic Term nets and Recursive Petri nets, allowing a concise modeling of dynamic reconfiguration mechanisms of flexible\\u000a workflow processes. The descriptive power of Recatnes is well-suited for collaborative workflows modeling. Moreover the use\\u000a of model checking techniques to prove liveness

Kamel Barkaoui; Awatef Hicheur

2007-01-01

265

Conceptual models and cognitive learning styles in teaching recursion  

Microsoft Academic Search

An experimental research design was implemented in an attempt to understand how different types of conceptual models and cognitive learning styles influence novice programmers when learning recursion. The results indicate that in teaching recursion to novice programmers:• concrete conceptual models are better than abstract conceptual models,• novices with abstract learning styles perform better than those with concrete learning styles,• abstract

Cheng-Chih Wu; Nell B. Dale; Lowell J. Bethel

1998-01-01

266

COMPARISON OF RECURSIVE ESTIMATION TECHNIQUES FOR POSITION TRACKING RADIOACTIVE SOURCES  

SciTech Connect

This paper compares the performance of recursive state estimation techniques for tracking the physical location of a radioactive source within a room based on radiation measurements obtained from a series of detectors at fixed locations. Specifically, the extended Kalman filter, algebraic observer, and nonlinear least squares techniques are investigated. The results of this study indicate that recursive least squares estimation significantly outperforms the other techniques due to the severe model nonlinearity.

K. MUSKE; J. HOWSE

2000-09-01

267

State reduction of recursive median filters  

NASA Astrophysics Data System (ADS)

We will discuss the simplified implementation of Recursive Median (RM) filters. It will be shown that every RM filter an alternative implementation. This implies a fast algorithm, [O(1) per pixel on average], for the one-dimensional RM filter. We also consider the case when RM filters are applied in a cascade of increasing filter window lengths, that is, the RM sieve. We will show that the RM sieve can be implemented in constant time per scale by applying only 3-point median operations. Both of the above mentioned fast implementations are viewed in a new light by constructing the corresponding Finite State Machines (FSM), and observing the achievable state reduction. Radical reduction of complexity takes place by implementing standard state reduction techniques. FSM models also open new possibilities for the analysis of these systems. Finally we discuss the benefits of using the RM sieve instead of the RM filter. We consider the streaking problem of the RM filter. It is demonstrated that the RM filter is not in itself a reliable estimator of location. As the cascading element in the structure of the sieve, however, it is very useful. It turns out that the use of RM sieve reduces the streaking problem to manageable level.

Yli-Harja, Olli P.; Bangham, J. Andrew; Harvey, Richard W.

1999-03-01

268

Realization Of Algebraic Processor For XML Documents Processing  

NASA Astrophysics Data System (ADS)

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.

Georgiev, Bozhidar; Georgieva, Adriana

2010-10-01

269

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

PubMed Central

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

2010-01-01

270

Kappa-Join: Efficient Execution of Existential Quantification in XML Query Languages  

E-print Network

Kappa-Join: Efficient Execution of Existential Quantification in XML Query Languages Matthias for formulating queries, involving comparison expressions which are existentially quantified. If such comparisons with existential quantification. In XML queries, a cor- relation predicate can occur conjunctively

Mannheim, Universität

271

Utilizing the Structure and Content Information for XML Document Clustering  

NASA Astrophysics Data System (ADS)

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.

Tran, Tien; Kutty, Sangeetha; Nayak, Richi

272

Robust Dialog Management Architecture Using VoiceXML for Car Telematics Systems  

Microsoft Academic Search

This chapter describes a dialog management architecture for car telematics systems. The system supports spontaneous user utterances and variable communication conditions between the in-car client and the remote server. The communication is based on VoiceXML over HTTP, and the design of the server-side application is based on DialogXML and ScenarioXML, which are layered extensions of VoiceXML. These extensions provide support

Yasunari Obuchi; Eric Nyberg; Teruko Mitamura; Scott Judy; Michael Duggan; Nobuo Hataoka

273

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

E-print Network

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

Brass, Stefan

274

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

E-print Network

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

Brass, Stefan

275

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

E-print Network

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

Brass, Stefan

276

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

E-print Network

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

Brass, Stefan

277

Distributed SLCA-Based XML Keyword Search by Map-Reduce  

Microsoft Academic Search

\\u000a Large scales of XML information comes continually from new Web applications, and SLCA (Smallest Lowest Common Ancestor)-based\\u000a XML keyword search is one of the most important information retrieval approaches. Previous approaches focus on building index\\u000a for XML documents. However in information dissemination scenario, it is impossible to build index in advance for continuous\\u000a XML document streams. This paper addresses SLCA-based

Chenjing Zhang; Qiang Ma; Xiaoling Wang; Aoying Zhou

2010-01-01

278

Knowledge Discovery over the Deep Web, Semantic Web and XML  

E-print Network

Abstract. In this tutorial we provide an insight into Web Mining, i.e., discovering knowledge from the World Wide Web, especially with reference to the latest developments in Web technology. The topics covered are: the Deep Web, also known as the Hidden Web or Invisible Web; the Semantic Web including standards such as RDFS and OWL; the eXtensible Markup Language XML, a widespread communication medium for the Web; and domain-specific markup languages defined within the context of XML We explain how each of these developments support knowledge discovery from data stored over the Web, thereby assisting several real-world applications. Keywords: Information Retrieval, Standards, Web Mining. 1

Aparna Varde; Fabian Suchanek; Richi Nayak; Pierre Senellart

279

XML in an Adaptive Framework for Instrument Control  

NASA Technical Reports Server (NTRS)

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.

Ames, Troy J.

2004-01-01

280

XML Algebras for Data Mining M. Zhang J.T. Yao  

E-print Network

XML Algebras for Data Mining M. Zhang J.T. Yao Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: [zhang2mi, jtyao]@cs.uregina.ca ABSTRACT The XML is a new for data mining due to partially the fact that there is no widely accepted definition of XML mining tasks

Yao, JingTao

281

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

282

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

E-print Network

to locate the talented ones? Yes. The pervasiveness of XML in our environment has lead to improvements to the EDI environment? Up to a certain point. You can take the developments that arise in the XML world and retrofit them to your EDI environment. You can transfer information from your enterprise systems to XML

283

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

ERIC Educational Resources Information Center

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…

Mitri, Michel

2012-01-01

284

An XML-Based Framework for Language Neutral Program Representation and Generic Analysis  

Microsoft Academic Search

Abstract XML applications are ,becoming ,increasingly popular to define ,structured or semi-structured constrained data in XML for special application areas. Inpursuit there is a growing momentum ,of activities related to XML representation of source code in the area of program ,comprehension and software reengineering. The source code and ,the artifacts extracted from a program ,are necessarily structured information that needs

Raihan Al-ekram; Kostas Kontogiannis

2004-01-01

285

An overview on XML similarity: Background, current trends and future directions  

Microsoft Academic Search

In recent years, XML has been established as a major means for information management, and has been broadly utilized for complex data representation (e.g. multimedia objects). Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in the database and information retrieval communities. In this paper, we provide an overview of

Joe Tekli; Richard Chbeir; Kokou Yétongnon

2009-01-01

286

QTPI:A quick terse path index for XML keyword search  

Microsoft Academic Search

The emergence of the Web has increased interests in XML data. XML query languages such as XQuery, XPath and NEXI, they use label paths to traverse the irregularly structured data. Without efficient indexes, query processing can be quite inefficient due to an exhaustive traversal on XML data. To overcome the inefficiency, we propose a novel index method, quick terse path

Xia Li; Zhanhuai Li; Peng Wang; Qun Chen

2010-01-01

287

Compressing and Searching XML Data Via Two Zips P. Ferragina, F. Luccio  

E-print Network

Compressing and Searching XML Data Via Two Zips P. Ferragina, F. Luccio Dip. Informatica Univ. Pisa larger than its native state) and the complexity of its search (XML search involves path and content and searching of XML documents. In particular, we adopt recently proposed theoretical algo- rithms [11

Manzini, Giovanni

288

APEX: An Adaptive Path Index for XML Data Chin-Wan Chung  

E-print Network

for the next generation Web applications including electronic commerce and intelligent Web searching. XML data or path indexes can speed up query evaluation on XML data by restricting the search to only relevantAPEX: An Adaptive Path Index for XML Data Chin-Wan Chung Div. of Computer Science Dept. of EECS

Chung, Chin-Wan

289

An Ontology-based Framework for XML Semantic Integration Isabel F. Cruz Huiyong Xiao Feihong Hsu  

E-print Network

search pat- terns refer to semantically equivalent concepts, they follow two distinct XML paths. 1An Ontology-based Framework for XML Semantic Integration Isabel F. Cruz Huiyong Xiao Feihong Hsu Department of Computer Science University of Illinois at Chicago {ifc, hxiao, fhsu}@cs.uic.edu Abstract XML

Cruz, Isabel F.

290

inria-00000183,version1-28Jul2005 Hybrid XML Retrieval: Combining Information Retrieval  

E-print Network

al., 2004), to handle both XML and full-text search. For the purpose of exploring the nature of XMLinria-00000183,version1-28Jul2005 Hybrid XML Retrieval: Combining Information Retrieval and a Native XML Database Jovan Pehcevski (jovanp@cs.rmit.edu.au) RMIT University, Melbourne, Australia James A

Boyer, Edmond

291

XML-Based Representation Formats of Local Grammars for the NLP Javier M. Sastre Martnez  

E-print Network

XML-Based Representation Formats of Local Grammars for the NLP Javier M. Sastre Martínez Institut in well-covered solid standards, like XML and XML-Schema, and conceived to serve as exchange formats allowing to search and extract them by means of grammar specific queries has already been conceived

Paris-Sud XI, Université de

292

Configurable Indexing and Ranking for XML Information Shaorong Liu, Qinghua Zou and Wesley W. Chu  

E-print Network

for the heterogeneous contents in XML documents to support various search predicates. Further, not all tags in an XMLConfigurable Indexing and Ranking for XML Information Retrieval Shaorong Liu, Qinghua Zou}@cs.ucla.edu ABSTRACT Indexing and ranking are two key factors for efficient and effective XML information retrieval

California at Los Angeles, University of

293

Keyword Proximity Search in XML Trees Vagelis Hristidis, Nick Koudas, Member, IEEE, Yannis Papakonstantinou, and  

E-print Network

Keyword Proximity Search in XML Trees Vagelis Hristidis, Nick Koudas, Member, IEEE, Yannis proximity search in querying XML documents in addition to text documents. For example, given query keywords--Lowest common ancestor, tree proximity search, XML keyword search. æ 1 INTRODUCTION KEYWORD search is a user

Hristidis, Vagelis

294

Searching for Efficient XML-to-Relational Mappings Maya Ramanath1  

E-print Network

Searching for Efficient XML-to-Relational Mappings Maya Ramanath1 , Juliana Freire2 , Jayant R is evaluated by a costing function on the SQL equivalents of the XML queries. Since the search space is large on search strategies for finding efficient XML- to-relational mappings. We have incorporated Flex

Utah, University of

295

LotusX: A Position-Aware XML Graphical Search System with Auto-Completion  

Microsoft Academic Search

The existing query languages for XML (e.g., XQuery) require professional programming skills to be formulated, however, such complex query languages burden the query processing. In addition, when issuing an XML query, users are required to be familiar with the content (including the structural and textual information) of the hierarchical XML, which is diffcult for common users. The need for designing

Chunbin Lin; Jiaheng Lu; Tok Wang Ling; Bogdan Cautis

2012-01-01

296

Hi and welcome to An Introduction to XML, part of IBM's Technical briefings series As XML is used in more applications and services, it is more important than ever to manage this  

E-print Network

easy search of data requests - XML publishing functions allow reports to be published easily Now here: Common subset of XQuery and XSLT XML Query, or XQuery, is a powerful way to search XML data for specific to define searches of XML documents and databases. XQuery is defined in terms of the data model

297

Challenges for View-Based Query Answering over Probabilistic XML  

E-print Network

Challenges for View-Based Query Answering over Probabilistic XML Bogdan Cautis1 and Evgeny Kharlamov2 1 Institut T´el´ecom; T´el´ecom ParisTech, France cautis@telecom-paristech.fr 2 KRDB Research with the nodes selected by the query. Over a p-document, the data fragments come #12;2 Bogdan Cautis and Evgeny

Cautis, Bogdan

298

Challenges for View-Based Query Answering over Probabilistic XML  

E-print Network

Challenges for View-Based Query Answering over Probabilistic XML Bogdan Cautis1 and Evgeny Kharlamov2 1 Institut T´el´ecom; T´el´ecom ParisTech, France cautis@telecom-paristech.fr 2 KRDB Research Management (AMW) (2011)" #12;2 Bogdan Cautis and Evgeny Kharlamov dPER : [1] IT- personnel [8] Rick [4] name

Paris-Sud XI, Université de

299

Challenges of View-Based Query Answering for Probabilistic XML  

E-print Network

D RA FT Challenges of View-Based Query Answering for Probabilistic XML Bogdan Cautis1 and Evgeny Kharlamov2 1 Institut T´el´ecom; T´el´ecom ParisTech, France cautis@telecom-paristech.fr 2 KRDB Research that computing probabilistic results is harder than in the deterministic setting. #12;D RA FT 2 Bogdan Cautis

Cautis, Bogdan

300

Implementing Incremental Code Migration with XML Wolfgang Emmerich, Cecilia Mascolo  

E-print Network

the network. We define the concept of incremental code mobil- ity as the ability to migrate and add, removeImplementing Incremental Code Migration with XML Wolfgang Emmerich, Cecilia Mascolo and Anthony-grained and incremental migration achieves a previously unavailable degree of flexibility. We examine the application

Finkelstein, Anthony

301

XMark: A Benchmark for XML Data Management Albrecht Schmidt1  

E-print Network

of the art. Permission to copy without fee all or part of this material is granted provided that the copies concentrated on schema issues and the theory of organizing data without a fixed schema, which seemed incompatible with exist- ing technology at first sight. However, as XML gained more and more momentum

Manolescu, Ioana

302

Sequencing XML Data and Query Twigs for Fast Pattern Matching  

E-print Network

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

Moon, Bongki

303

Extracting and Formatting Patent Data from USPTO XML Gabe Fierro  

E-print Network

Extracting and Formatting Patent Data from USPTO XML Gabe Fierro College of Engineering University leaders who can make insightful decisions with the con dence that comes from a synthesized understanding.funginstitute.berkeley.edu #12;1 Introduction The patent data available through the United States Patent and Trademark O ce

Sekhon, Jasjeet S.

304

Intelligent Data Entry Assistant for XML Using Ensemble Learning  

E-print Network

, the ensemble classifier determines which value to accept. As the system operates it learns which internal evaluated our system performance using data from eleven different XML domains. The results show. They are designed especially for login forms or online shopping forms, e.g. AOL, Roboform, and Google Toolbar

Kansas, University of

305

Chapter 57: Advanced XML Technologies: Schema, Xpath, XQuery, and XSL  

NASA Astrophysics Data System (ADS)

Much of what happens behind the scenes in the VO happens using XML A major reason for choosing to use XML is to take advantage of "off-the-shelf" standards and technologies that can help us manage our metadata. Most VO users will not need to know anything about various manipulations of XML going on underneath their applications. However, users who begin to delve into programming for the VO, be it scripting to gather data for a VO research project or developing a general application, will start to see some of these technologies at work under the hood. In four sections in this chapter, we'll look at four of the most useful XML technologies. With each one, we'll start by highlighting how you might find it useful. The intent is not to make you proficient in these tools. Rather, by getting a general sense how these technologies work you will at least have some ability to debug your application when things go wrong. In some cases, you may acquire enough familiarity to edit and use pre-existing samples. In this chapter, you will get a chance to make some of those edits and try out some tools you can find on the CD. We will use some tools from the adqllib package. If you tried out the exercises in Chapter 36, then you may have already built these tools. If not, you can do that now

Plante, R. L.

306

New NED XML/VOtable Services and Client Interface Applications  

NASA Astrophysics Data System (ADS)

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

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

2005-12-01

307

Demaq: A Foundation for Declarative XML Message Processing  

E-print Network

processing system operating on the foundation of transac- tional XML message queues. We focus on the syntax us- ing Web Services [3, 21], and even new end-user interface architectures such as AJAX [18 that is not related to the actual application domain. Asynchronous operation and dependability requirements add more

Mannheim, Universität

308

Materialized View Selection by Query Clustering in XML Data Warehouses  

E-print Network

to exploit jointly information under various forms: patient records (classical database), medical history contributed to the analysis of so-called complex data [8]. For instance, analyzing medical data may lead several join and aggregation operations. In addition, native XML database management systems (DBMSs

Paris-Sud XI, Université de

309

Which XML standards for multilevel corpus annotation? Adam Przepirkowski,  

E-print Network

Which XML standards for multilevel corpus annotation? Adam Przepiórkowski, and Piotr Ba into fine-grained word-level to- kens, 3) morphosyntactic analysis, 4) coarse-grained syn- tactic words (e.g-linguistic levels of annotation re- quired for each document are text structure (e.g., divi- sion into chapters

Przepiórkowski, Adam

310

Personalization of XML Content Browsing Based on User Preferences  

ERIC Educational Resources Information Center

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

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

2009-01-01

311

LCA-based Selection for XML Document Collections Georgia Koloniari  

E-print Network

-based results of a query. To improve storage and processing efficiency, we use appropriate summaries of the LCA of a collection of documents by aggregating over the similarities of each of its documents to the query. To avoid for XML document collections, that is, given a set of collec- tions and a user query, how to rank

Pitoura, Evaggelia

312

Effective XML Keyword Search with Relevance Oriented Ranking  

E-print Network

. Effectiveness in term of result relevance is the most crucial part in keyword search, which can be summarizedEffective XML Keyword Search with Relevance Oriented Ranking Zhifeng Bao # , Tok Wang Ling # , Bo-- Inspired by the great success of information re- trieval (IR) style keyword search on the web, keyword

313

Sound and Complete Relevance Assessment for XML Retrieval Benjamin Piwowarski  

E-print Network

) is not independent of that of related elements. This has major consequences for the gathering of relevance not only find relevant XML documents but must also determine where, within the document, this information is found, as well as the granularity (or size of the fragment) of relevant information. A consequence

Lalmas, Mounia

314

CXLEngine: a comprehensive XML loosely structured search engine  

Microsoft Academic Search

We proposed previously in [9] an XML semantic search engine called OOXSearch, which answers loosely structured queries. It takes into account the semantic relationships between data elements based on their contexts. The context of a data element is determined by its parent element. The framework of OOXSearch treats each parent-children set of elements as a single unified entity. OOXSearch works

Kamal Taha; Ramez Elmasri

2008-01-01

315

Identifying meaningful return information for XML keyword search  

Microsoft Academic Search

Keyword search enables web users to easily access XML data with- out the need to learn a structured query language and to study pos- sibly complex data schemas. Existing work has addressed the prob- lem of selecting qualied data nodes that match keywords and con- necting them in a meaningful way, in the spirit of inferring a where clause in

Ziyang Liu; Yi Chen

2007-01-01

316

Personalization of XML text search via search histories  

Microsoft Academic Search

Full-Text XML search is a difficult problem due to its structural and textual constrains. The latter being individually well explored topics, lack mechanisms of integration with each other. Different approaches were proposed to cope with this problem. A technique of personalization usage to enhance one of these methods is given. The usage of direct or indirect results assessment is presented.

George Chernishev

317

Meaningful Interrelated Object Tree for XML keyword search  

Microsoft Academic Search

In the research field of XML retrieval with keyword-based approach, a variant of Lowest Common Ancestors (LCAs) have been widely accepted to provide how keywords are connected by ancestor relationship. However, returning a whole subtree or a partial subtree based on LCA nodes is insufficient for identifying how subtrees are conceptually related under different tree structure such as ID\\/IDREF. On

Umaporn Supasitthimethee; T. Shimizu; M. Yoshikawa; Kriengkrai Porkaew

2010-01-01

318

XMLibrary Search: An XML Search Engine Oriented to Digital Libraries  

Microsoft Academic Search

The increase in the amount of data available in digital li- braries calls for the development of search engines that allow the users to nd quickly and eectiv ely what they are looking for. The XML tag- ging makes possible the addition of structural information in digitized content. These metadata oer new opportunities to a wide variety of new services.

Enrique Sánchez Villamil; Carlos González Muñoz; Rafael C. Carrasco

2005-01-01

319

Reasoning and identifying relevant matches for XML keyword search  

Microsoft Academic Search

Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches to query keywords that are relevant to the user. However, it is hard to directly evalu- ate the relevance of query results due to the inherent ambiguity of search semantics. In this work, we

Ziyang Liu; Yi Chen

2008-01-01

320

Integrating Text Retrieval and Image Retrieval in XML Document Searching  

Microsoft Academic Search

Many XML documents contain a mixture of text and images. Images play an important role in webpage or article presentation. However, popular Information Retrieval systems still largely depend on pure text retrieval as it is believed that text descriptions including body text and the caption of images contain precise information. On the other hand, images are more attractive and easier

Dian Tjondronegoro; Jinglan Zhang; Jinfeng Gu; Anthony Nguyen; Shlomo Geva

2005-01-01

321

Sound ranking algorithms for XML search in PF\\/Tijah  

Microsoft Academic Search

We argue that ranking algorithms for XML should reflect the actual combined content and structure constraints of queries, while at the same time producing equal rankings for queries that are semantically equal. Ranking algorithms that produce different rankings for queries that are semantically equal are easily detected by tests on large databases: We call such algorithms not sound. We report

Stefan Klinger; Henning Rode; Jan Flokstra; Peter Apers

2008-01-01

322

A multi-ranker model for adaptive XML searching  

Microsoft Academic Search

The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of inter- action devices such as PCs, laptops, palmtops, and so on. As XML has become a de- facto standard for exchanging Web data, an interesting and practical research problem is the development of models

Ho Lam Lau; Ng Wilfred

2008-01-01

323

Improving the performance of identifying contributors for XML keyword search  

Microsoft Academic Search

Keyword search is a friendly mechanism for users to identify desired information in XML databases, and LCA is a popular concept for locating the meaningful subtrees corresponding to query keywords. Among all the LCA-based approaches, MaxMatch [9] is the only one which could achieve the property of monotonicity and consistency, by outputting only contributors instead of the whole subtree. Although

Rung-Ren Lin; Ya-Hui Chang; Kun-Mao Chao

2011-01-01

324

Elucidating the stop bands of structurally colored systems through recursion  

NASA Astrophysics Data System (ADS)

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

Amir, Ariel; Vukusic, Peter

2013-04-01

325

Recursive computation of mutual potential between two polyhedra  

NASA Astrophysics Data System (ADS)

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

Hirabayashi, Masatoshi; Scheeres, Daniel J.

2013-11-01

326

Recursive flexible multibody system dynamics using spatial operators  

NASA Technical Reports Server (NTRS)

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

Jain, A.; Rodriguez, G.

1992-01-01

327

Theory and applications of sampled analog recursive CTD comb filters  

NASA Technical Reports Server (NTRS)

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.

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

1976-01-01

328

The limits on combining recursive horn rules with description logics  

SciTech Connect

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

Levy, A.Y.; Rousset, M.C. [Univ. of Paris-Sud (France)

1996-12-31

329

Recursive queries on trees and data trees Serge Abiteboul  

E-print Network

that the three aforementioned problems are unde- cidable for data trees. But in practice, data trees (e.g., XML that for bounded depth data trees, one can solve This work has been partially funded by the European Re- search No. 61100062 by the Engineering and Physical Sciences Re- search Council project "Query-Driven Data

Paris-Sud XI, Université de

330

XML-Based NLP Tools for Analysing and Annotating Medical Language Claire Grover, Ewan Klein, Alex Lascarides and Maria Lapata  

E-print Network

XML-Based NLP Tools for Analysing and Annotating Medical Language Claire Grover, Ewan Klein, Alex of a suite of highly flexible XML-based NLP tools in a project for processing and interpreting text in the medical domain. The main aim of the paper is to demonstrate the central role that XML mark-up and XML NLP

Lascarides, Alex

331

XML does Real Programmers a Service  

SciTech Connect

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

Gorton, Ian

2008-09-01

332

Methods and Technologies of XML Data Modeling for IP Mode Intelligent Measuring & Controlling System  

NASA Astrophysics Data System (ADS)

This paper presents the IP mode intelligent measuring & controlling system (IMIMCS). Based on object-oriented modeling technology of UML and XML Schema, the innovative methods and technologies of some key problems for XML data modeling in the IMIMCS were especially discussed, including refinement for systemic business by means of use-case diagram of UML, the confirmation of the content of XML data model and logic relationship of the objects of XML Schema with the aid of class diagram of UML, the mapping rules from the UML object model to XML Schema. Finally, the application of the IMIMCS based on XML for a modern greenhouse was presented. The results show that the modeling methods of the measuring & controlling data in the IMIMCS involving the multi-layer structure and many operating systems process strong reliability and flexibility, guarantee uniformity of complex XML documents and meet the requirement of data communication across platform.

Liu, G. X.; Hong, X. B.; Liu, J. G.

2006-10-01

333

A decoupled recursive approach for constrained flexible multibody system dynamics  

NASA Technical Reports Server (NTRS)

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

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

1989-01-01

334

Recursive Output Only Subspace Identification for In-flight Fl utter Monitoring  

Microsoft Academic Search

In this paper a new recursive output-only identification algorithm is proposed based on stochastic realization, a classical covariance driven subspace identification technique. The recursive algorithm yields results that are in close agreement with those of its non-recursive counterpart. Furthermore, the relatively low complexity of the algorithm makes it an excellent kandidate for use during in-flight flutter tests.

Ivan Goethals; Laurent Mevel; Albert Benveniste; Bart De Moor

2004-01-01

335

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

NASA Technical Reports Server (NTRS)

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.

Detter, Ryan; Mooney, Michael; Fatig, Curtis

2003-01-01

336

Learning incremental syntactic structures with recursive neural networks  

Microsoft Academic Search

Wedevelop novel algorithmic ideas for buildinga natural language parser grounded uponthe hypothesis of incrementality, which iswidely supported by experimental data as amodel of human parsing. Our proposal relieson a machine learning technique for predictingthe correctness of partial syntactic structuresthat are built during the parsing process.A recursive neural network architectureis employed for computing predictions after atraining phase on examples drawn from

Fabrizio Costa; Paolo Frasconi; Vincenzo Lombardo; Giovanni Soda

2000-01-01

337

Rocket ascent trajectory optimization via recursive quadratic programming  

Microsoft Academic Search

An algorithm for solving parameterized optimal control problems such as the ascent trajectory optimization problem of a multistage launch vehicle is developed. The implementation of this algorithm, designated as the Recursive Quadratic Programming Approach, for the pitch and yaw optimization of a multistage launch vehicle is discussed, and results are given for injection into a polar orbit from the Indian

K. H. Well; S. R. Tandon

1982-01-01

338

Recursivity: A Working Paper on Rhetoric and "Mnesis"  

ERIC Educational Resources Information Center

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…

Stormer, Nathan

2013-01-01

339

Toward a connectionist model of recursion in human linguistic performance  

Microsoft Academic Search

Naturally occurring speech contains only a limited amount of complex recursive structure,and this is reflected in the empirically documented difficulties that people experience whenprocessing such structures. We present a connectionist model of human performance in processingrecursive language structures. The model is trained on simple artificial languages. Wefind that the qualitative performance profile of the model matches human behavior, both onthe

Morten H. Christiansen; Nick Chater

1999-01-01

340

Recursion and the Competence/Performance Distinction in AGL Tasks  

ERIC Educational Resources Information Center

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

Lobina, David J.

2011-01-01

341

Recursive Partitioning Analysis of Lifetime Suicidal Behaviors in Asian Americans  

Microsoft Academic Search

Previous studies have shown that multiple factors predict suicidal behavior in Asian Americans but have provided little guidance on how to rate the relative impact of these risks. To increase our understanding of suicide in Asian Americans, recursive partitioning analysis was used to identify risk factors most relevant to predicting suicidal behaviors and enhance the decision-making process of clinicians faced

Yusuke Kuroki; Jacqueline L. Tilley

2012-01-01

342

Recursive Modeling of Stateflow as Input/Output-Extended Automaton  

E-print Network

1 Recursive Modeling of Stateflow as Input/Output-Extended Automaton Meng Li and Ratnesh Kumar Dept/O-EFA model that can itself be simulated in Matlab. Note to Practitioners: The paper presents a methodology of concurrent processes The research was supported in part by the National Science Foundation un- der the grants

Kumar, Ratnesh

343

Recursive subspace identification based on instrumental variable unconstrained quadratic optimization  

Microsoft Academic Search

The problem of the recursive formulation of the MOESP class of subspace identification algorithms is considered and two novel instrumental variable approaches are introduced. The first one leads to an RLS-like implementation, the second to a gradient type iteration. The relative merits of both approaches are analysed and discussed, while simulation results are used to compare their performance with the

G. Mercere; S. Lecoeuche; M. Lovera

2004-01-01

344

Source localization using recursively applied and projected (RAP) MUSIC  

Microsoft Academic Search

A new method for source localization is described that is based on a modification of the well-known MUSIC algorithm. In classical MUSIC, the array manifold vector is projected onto an estimate of the signal subspace, but errors in the estimate can make location of multiple sources difficult. Recursively applied and projected (RAP) MUSIC uses each successively located source to form

J. C. Mosher; Richard M. Leahy

1997-01-01

345

Source localization using recursively applied and projected (RAP) MUSIC  

Microsoft Academic Search

A new method for source localization is described that is based on a modification of the well-known MUSIC algorithm. In classical MUSIC, the array manifold vector is projected onto an estimate of the signal subspace. Errors in the estimate of the signal subspace can make localization of multiple sources difficult. Recursively applied and projected (RAP) MUSIC uses each successively located

John C. Mosher; Richard M. Leahy

1999-01-01

346

Recursive Types in Games: Axiomatics and Process Representation  

E-print Network

with in­ ternal structure reflecting its computational behaviour in an abstract way. In particular of this approach. First, game semantics offers a very precise abstract characteri­ sation of computationalRecursive Types in Games: Axiomatics and Process Representation (Extended Abstract) Marcelo Fiore

Fiore, Marcelo

347

On abstract computer virology from a recursion-theoretic perspective  

E-print Network

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

Paris-Sud XI, Université de

348

Exploring the Recursive Nature of Food and Family Communication  

ERIC Educational Resources Information Center

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

Manning, Linda D.

2006-01-01

349

HOMOGENEOUS APPROXIMATION RECURSIVE OBSERVER DESIGN AND OUTPUT FEEDBACK  

E-print Network

HOMOGENEOUS APPROXIMATION RECURSIVE OBSERVER DESIGN AND OUTPUT FEEDBACK VINCENT ANDRIEU, LAURENT observer and output feedback design. The first one is a simple extension of the notion of homogeneous approximation to make it valid both at the origin and at infinity (homogeneity in the bi-limit). Exploiting

Paris-Sud XI, Université de

350

Recursive Types in Games: Axiomatics and Process Representation  

Microsoft Academic Search

This paper presents two basic results on game-based se- mantics of FPC, a metalanguage with sums, products, ex- ponentials and recursive types. First we give an axiomatic account of the category of games G introduced in (15), of- fering a fundamental structural analysis of the category as well as a transparent way to prove computational adequacy. As a consequence we

Marcelo P. Fiore; Kohei Honda

1998-01-01

351

Experimental evaluation of teaching recursion in a video game  

Microsoft Academic Search

We present EleMental: The Recurrence, a novel game that provides computer science students the opportunity to write code and perform interactive visualizations to learn about recursion through depth-first search of a binary tree. We designed the game to facilitate maximum transfer of learning to writing real programs, while also providing for interactive visualizations. We conducted a study with computer science

Amanda Chaffin; Katelyn Doran; Drew Hicks; Tiffany Barnes

2009-01-01

352

Recursive Types in Games: Axiomatics and Process Representation (Extended Abstract)  

Microsoft Academic Search

This paper presents two basic results on game-based se- mantics of FPC, a metalanguage with sums, products, ex- ponentials and recursive types. First we give an axiomatic account of the category of games G introduced in (15), of- fering a fundamental structural analysis of the category as wellas a transparent wayto prove computationaladequacy. As a consequence we obtain an intensional

Marcelo Fiore

353

Efficient and Optimal Attitude Determination Using Recursive Global Positioning System  

E-print Network

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

Crassidis, John L.

354

Computing the Recursive Truth Predicate on Ordinal Register Machines  

E-print Network

Computing the Recursive Truth Predicate on Ordinal Register Machines Peter Koepke1 and Ryan Siders2- storing register machine. This brings us closer to "minimal" computation of set theoretic con from the machine or programming languge. These machines were designed to define and study run

Koepke, Peter

355

A recursive approach for the finite element computation of waveguides  

E-print Network

. In this paper a simple recursive method is presented to compute the global dynamic stiffness matrix of finite's principle or the transfer matrix and the objective it to compute propagation constants relating the forces the spectral finite element approach. This leads to efficient computations of dispersion relations and transfer

Paris-Sud XI, Université de

356

Recursive 3-D Road and Relative Ego-State Recognition  

Microsoft Academic Search

The general problem of recognizing both horizontal and vertical road curvature parameters while driving along the road has been solved recursively. A differential geometry representation decoupled for the two curvature components has been selected. Based on the planar solution of E.D. Dickmanns and A. Zapp (1986) and its refinements, a simple spatio-temporal model of the driving process makes it possible

Ernst D. Dickmanns; Birger D. Mysliwetz

1992-01-01

357

RAM Programs, Turing Machines, and the Partial Recursive Functions  

E-print Network

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

Gallier, Jean

358

Using Structural Recursion for Corecursion Yves Bertot1  

E-print Network

algorithms, like the ones used in the computation of Gr¨obner bases, the verification of the four- colour in a construc- tive type theory-based theorem prover with inductive and coinductive types, structural recursion, Guarded Corecursion, Coq 1 Introduction Interactive theorem provers with inductive types [27

Paris-Sud XI, Université de

359

Recursive Vocal Pattern Learning and Generalization in Starlings  

ERIC Educational Resources Information Center

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…

Bloomfield, Tiffany Corinna

2012-01-01

360

Recursive Least-Squares Source Tracking using One Acoustic  

E-print Network

Recursive Least-Squares Source Tracking using One Acoustic Vector Sensor MOHAMAD KHATTAR AWAD An acoustic vector-sensor (a.k.a. vector-hydrophone) is composed of three acoustic velocity-sensors, plus. This acoustic vector-sensor offers an azimuth-elevation response that is invariant with respect to the source

Wong, Kainam Thomas

361

The Category Theoretic Solution of Recursive Program Schemes  

Microsoft Academic Search

This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The overall assumptions needed are small indeed: working only in categories with \\

Stefan Milius; Lawrence S. Moss

2005-01-01

362

Traversing Recursive Object Structures: The Functional Visitor in Demeter  

E-print Network

Traversing Recursive Object Structures: The Functional Visitor in Demeter Pengcheng Wu College is difficult to adapt and reuse. The Adaptive Programming work (implemented in Demeter sys- tems: Demeter. In Demeter Permission to make digital or hard copies of all or part of this work for personal or classroom

Krishnamurthi, Shriram

363

A recursive method for functionals of Poisson processes  

Microsoft Academic Search

Functionals of Poisson processes arise in many statistical problems. They appear in problems involving heavy-tailed distributions in the study of limiting processes, while in Bayesian nonparametric statistics they are used as constructive representations for nonparametric priors. We describe a simple recursive method that is useful for characterizing Poisson process functionals and requires only the use of conditional probability. Applications of

Dragan Banjevic; Hemant Ishwaran; Mahmoud Zarepour

2002-01-01

364

A Recursive Random Search Algorithm for Network Parameter Optimization  

E-print Network

considered a black art and is normally performed based on network administrators' experience, trial and error Simulator Network Network Model Optimization Black-box Algorithm Experiment Parameters Performance MetricA Recursive Random Search Algorithm for Network Parameter Optimization Tao Ye 1 Shivkumar

Kalyanaraman, Shivkumar

365

Recursive Segmentation and Recognition Templates for Image Parsing  

E-print Network

1 Recursive Segmentation and Recognition Templates for Image Parsing Long (Leo) Zhu1 , Yuanhao Chen--In this paper, we propose a Hierarchical Image Model (HIM) which parses images to perform segmentation into a hierarchical representation. They have made great progress in both representa- tion and inference (i.e. parsing

Yuille, Alan L.

366

Recursive Segmentation and Recognition Templates for 2D Parsing  

E-print Network

Recursive Segmentation and Recognition Templates for 2D Parsing Long (Leo) Zhu CSAIL MIT leozhu formulated in terms of parsing the input signal into a hierarchical representation. Natural language- time parsing algorithms. By contrast, the two-dimensional nature of images makes it much harder

Yuille, Alan L.

367

Semantics Boosts Syntax in Artificial Grammar Learning Tasks with Recursion  

ERIC Educational Resources Information Center

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

Fedor, Anna; Varga, Mate; Szathmary, Eors

2012-01-01

368

Effects of quantization and overflow in recursive digital filters  

Microsoft Academic Search

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.

T. Claasen; W. Mecklenbrauker; J. Peek

1976-01-01

369

Recursion method for deriving an energy-independent effective interaction  

NASA Astrophysics Data System (ADS)

The effective-interaction theory has been one of the useful and practical methods for solving nuclear many-body problems based on the shell model. Various approaches have been proposed which are constructed in terms of the so-called Q? box and its energy derivatives introduced by Kuo et al. In order to find out a method of calculating them we make a decomposition of a full Hilbert space into subspaces (the Krylov subspaces) and transform a Hamiltonian to a block-tridiagonal form. This transformation brings about much simplification of the calculation of the Q? box. In the previous work a recursion method was derived for calculating the Q? box analytically on the basis of such transformation of the Hamiltonian. In the present study, by extending the recursion method for the Q? box, we derive another recursion relation to calculate the derivatives of the Q? box of arbitrary order. With the Q? box and its derivatives thus determined we apply them to the calculation of the E-independent effective interaction given in the so-called Lee-Suzuki (LS) method for a system with a degenerate unperturbed energy. We show that the recursion method can also be applied to the generalized LS scheme for a system with nondegenerate unperturbed energies. If the Hilbert space is taken to be sufficiently large, the theory provides an exact way of calculating the Q? box and its derivatives. This approach enables us to perform recursive calculations for the effective interaction to arbitrary order for both systems with degenerate and nondegenerate unperturbed energies.

Suzuki, Kenji; Kumagai, Hiroo; Okamoto, Ryoji; Matsuzaki, Masayuki

2014-04-01

370

Recursion Method for Deriving Energy-Independent Effective Interaction  

E-print Network

The effective-interaction theory has been one of the useful and practical methods for solving nuclear many-body problems based on the shell model. Various approaches have been proposed which are constructed in terms of the so-called $\\widehat{Q}$ box and its energy derivatives introduced by Kuo {\\it et al}. In order to find out a method of calculating them we make decomposition of a full Hilbert space into subspaces (the Krylov subspaces) and transform a Hamiltonian to a block-tridiagonal form. This transformation brings about much simplification of the calculation of the $\\widehat{Q}$ box. In the previous work a recursion method has been derived for calculating the $\\widehat{Q}$ box analytically on the basis of such transformation of the Hamiltonian. In the present study, by extending the recursion method for the $\\widehat{Q}$ box, we derive another recursion relation to calculate the derivatives of the $\\widehat{Q}$ box of arbitrary order. With the $\\widehat{Q}$ box and its derivatives thus determined we apply them to the calculation of the $E$-independent effective interaction given in the so-called Lee-Suzuki (LS) method for a system with a degenerate unperturbed energy. We show that the recursion method can also be applied to the generalized LS scheme for a system with non-degenerate unperturbed energies. If the Hilbert space is taken to be sufficiently large, the theory provides an exact way of calculating the $\\widehat{Q}$ box and its derivatives. This approach enables us to perform recursive calculations for the effective interaction to arbitrary order for both systems with degenerate and non-degenerate unperturbed energies.

Kenji Suzuki; Hiroo Kumagai; Ryoji Okamoto; Masayuki Matsuzaki

2014-02-12

371

XML-based product information processing method for product design  

NASA Astrophysics Data System (ADS)

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.

Zhang, Zhen Yu

2011-12-01

372

XML-based product information processing method for product design  

NASA Astrophysics Data System (ADS)

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.

Zhang, Zhen Yu

2012-01-01

373

T:XML: A Tool Supporting User Interface Model Transformation  

NASA Astrophysics Data System (ADS)

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

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

374

voevent-parse: Parse, manipulate, and generate VOEvent XML packets  

NASA Astrophysics Data System (ADS)

voevent-parse, written in Python, parses, manipulates, and generates VOEvent XML packets; it is built atop lxml.objectify. Details of transients detected by many projects, including Fermi, Swift, and the Catalina Sky Survey, are currently made available as VOEvents, which is also the standard alert format by future facilities such as LSST and SKA. However, working with XML and adhering to the sometimes lengthy VOEvent schema can be a tricky process. voevent-parse provides convenience routines for common tasks, while allowing the user to utilise the full power of the lxml library when required. An earlier version of voevent-parse was part of the pysovo (ascl:1411.002) library.

Staley, Tim D.

2014-11-01

375

National Marine Fisheries Service August 1997 SFA UpdateUpdateUpdateUpdateUpdate  

E-print Network

National Marine Fisheries Service August 1997 SFA UpdateUpdateUpdateUpdateUpdate This is the second in a series of updates on National Marine Fisheries Service implementation of Sustainable Fisheries Act (SFA Fish Habitat), FMP (fishery management plan), and HMS (Highly Migratory Species). Changing the National

376

XML Technologies in Computer Assisted Learning and Testing Systems  

Microsoft Academic Search

The learning and assessment activities have undergone major changes due to\\u000athe development of modern technologies. The computer-assisted learning and\\u000atesting has proven a number of advantages in the development of modern\\u000aeducational system. The paper suggests a solution for the computer-assisted\\u000atesting, which uses XML technologies, a solution that could make the basis for\\u000adeveloping a learning computer-assisted system.

Adrian Cojocariu; Cristina Ofelia Stanciu

2009-01-01

377

Development of a Digital Textbook Standard Format Based on XML  

Microsoft Academic Search

\\u000a This paper proposes a standard format for those digital textbooks which are used in Korean elementary and secondary school.\\u000a This standard format comprises an array of function and XML-based document formats. The format aims to maximize the effectiveness\\u000a of learning by combining the usual advantages of printed textbooks and the additional functions of digital media such as searching\\u000a and navigation,

Mihye Kim; Kwan-Hee Yoo; Chan Park; Jae-Soo Yoo

2010-01-01

378

An XML-Based Digital Textbook and Its Educational Effectiveness  

Microsoft Academic Search

\\u000a Textbooks are undergoinga transformation into digital textbooks, which can offer a diverse range of supplementary digital\\u000a media functions including sounds, audiovisuals, animations, 3D graphics and other state-of-the-art multimedia features. This\\u000a paper proposes such an XML-based digital textbook aiming to maximize the learning effectiveness by integrating the advantages\\u000a of traditional printed textbooks with additional digital media functions. The functions of the

Mihye Kim; Kwan-Hee Yoo; Chan Park; Jae-Soo Yoo; Hoseung Byun; Wanyoung Cho; Jeeheon Ryu; Namgyun Kim

2010-01-01

379

Bitmap Based Partition in Structural Join of XML  

Microsoft Academic Search

XML numbering scheme was analyzed. The advantages and disadvantages of RangePartitionJoin algorithm were analyzed. According to the feature of structural join, Bitmap based partition method was proposed. The determination method of partition boundaries was expounded. The corresponding structural join algorithms - Parent-Child structural join algorithm and Ancestor-Descendant structural join algorithm were presented. In order to test the performance of the

Yu Hong

2010-01-01

380

Parallel Scanning with Bitstream Addition: An XML Case Study  

Microsoft Academic Search

\\u000a A parallel scanning method using the concept of bitstream addition is introduced and studied in application to the problem\\u000a of XML parsing and well-formedness checking. On processors supporting W-bit addition operations, the method can perform up to W finite state transitions per instruction. The method is based on the concept of parallel bitstream technology, in which parallel\\u000a streams of bits

Robert D. Cameron; Ehsan Amiri; Kenneth S. Herdy; Dan Lin; Thomas C. Shermer; Fred P. Popowich

381

Linguistic database handling using XML in web environment  

Microsoft Academic Search

Rapid and explosive progress of Web-based technologies makes developers hard to follow new ones, every time they come out. Web developers don't have enough time to understand so many up-to-date technologies and to enhance their productivity. To reduce development time in Web environments, as well as to increase efficiency, the authors defined a new XML-based language for Web developers. This

Hwi woong Jeong; Aesun Yoon

2001-01-01

382

Coupling Fragments of XPath with XML Indexing and Query Decomposition  

Microsoft Academic Search

Recent studies have proposed structural summary techniques for path- query evaluation on semi-structured data sources. One major line of this research has been the introduction of the DataGuide, 1-index, 2-index, and A(k) indices, and subsequent investigations and generalizations. Another recent study has con- sidered structural characterizations of fragments of XPath, the standard path nav- igation language for XML documents. In

George H. L. Fletcher; Dirk Van Gucht; Yuqing Wu; Marc Gyssens; Jan Paredaens

2007-01-01

383

Massively parallel XML twig filtering using dynamic programming on FPGAs  

Microsoft Academic Search

In recent years, XML-based Publish-Subscribe Sys- tems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex profiles on the structure and content of the published messages. If a profile matches the message, the message is forwarded to the interested subscriber. As the amount of published content continues to grow, current software-based systems will

Roger Moussalli; Mariam Salloum; Walid A. Najjar; Vassilis J. Tsotras

2011-01-01

384

Efficient Filtering of XML Documents for Selective Dissemination of  

E-print Network

by considering user profiles. E.g.: timely received/collected new data such as stock quotes, traffic news, sports tickers and music #12;Introduction Key challenge in SDI is to efficiently and quickly search the huge set_document.xml Q1: /sports / nba //news [Q1-1] [Q1-2] [Q1-3] Q2: //nba/*/ news [Q2-1] [Q2-2] Q3: /stocks

Ives, Zachary G.

385

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

NASA Technical Reports Server (NTRS)

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.

Rice, Kevin; Kizzort, Brad

2008-01-01

386

Integrating Text Retrieval and Image Retrieval in XML Document Searching  

Microsoft Academic Search

\\u000a Many XML documents contain a mixture of text and images. Images play an important role in webpage or article presentation.\\u000a However, popular Information Retrieval systems still largely depend on pure text retrieval as it is believed that text descriptions\\u000a including body text and the caption of images contain precise information. On the other hand, images are more attractive and\\u000a easier

D. Tjondronegoro; J. Zhang; J. Gu; A. Nguyen; S. Geva

387

Effective XML Keyword Search through Valid Lowest Information Unit  

Microsoft Academic Search

\\u000a Keyword search for XML documents has attracted much attention recently. Existing approaches mainly retrieve search results\\u000a through identifying the Lowest Common Ancestor (LCA) of keyword match nodes. There are also techniques for removing redundant\\u000a and irrelevant search results. However, the problem of whether a LCA fragment contains complete information has not been adequately\\u000a investigated. To address this challenge, we first

Ying Lou; Peng Wang; Zhanhuai Li; Qun Chen; Xia Li

2010-01-01

388

XCDSearch: An XML Context-Driven Search Engine  

Microsoft Academic Search

We present in this paper, a context-driven search engine called XCDSearch for answering XML Keyword-based queries as well as Loosely Structured queries, using a stack-based sort-merge algorithm. Most current research is focused on building relationships between data elements based solely on their labels and proximity to one another, while overlooking the contexts of the elements, which may lead to erroneous

Kamal Taha; Ramez Elmasri

2010-01-01

389

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

NASA Technical Reports Server (NTRS)

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

Hsieh, Shih-Fu

1990-01-01

390

An XML Driven Graphical User Interface and Application Management Toolkit  

SciTech Connect

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

White, Greg R

2002-01-18

391

Element Retrieval using Namespace Based on keyword search over XML Documents  

E-print Network

Querying over XML elements using keyword search is steadily gaining popularity. The traditional similarity measure is widely employed in order to effectively retrieve various XML documents. A number of authors have already proposed different similarity-measure methods that take advantage of the structure and content of XML documents. They do not, however, consider the similarity between latent semantic information of element texts and that of keywords in a query. Although many algorithms on XML element search are available, some of them have the high computational complexity due to searching a huge number of elements. In this paper, we propose a new algorithm that makes use of the semantic similarity between elements instead of between entire XML documents, considering not only the structure and content of an XML document, but also semantic information of namespaces in elements. We compare our algorithm with the three other algorithms by testing on the real datasets. The experiments have demonstrated that our...

Wang, Yang; Huang, Xiaodi

2010-01-01

392

Framework and prototype for a secure XML-based electronic health records system.  

PubMed

Security of personal medical information has always been a challenge for the advancement of Electronic Health Records (EHRs) initiatives. eXtensible Markup Language (XML), is rapidly becoming the key standard for data representation and transportation. The widespread use of XML and the prospect of its use in the Electronic Health (e-health) domain highlights the need for flexible access control models for XML data and documents. This paper presents a declarative access control model for XML data repositories that utilises an expressive XML role control model. The operational semantics of this model are illustrated by Xplorer, a user interface generation engine which supports search-browse-navigate activities on XML repositories. PMID:18048267

Steele, Robert; Gardner, William; Chandra, Darius; Dillon, Tharam S

2007-01-01

393

Clustering Transactional XML Data with Semantically-Enriched Content and Structural Features  

Microsoft Academic Search

\\u000a We address the problem of clustering XML data according to semantically-enriched features extracted by analyzing content and\\u000a structural specifics in the data. Content features are selected from the textual contents of XML elements, while structure\\u000a features are extracted from XML tag paths on the basis of ontological knowledge. Moreover, we conceive a transactional model\\u000a for representing sets of semantically cohesive

Andrea Tagarelli; Sergio Greco

2004-01-01

394

Progressive Evaluation of XML Queries for Online Aggregation and Progress Indicator  

Microsoft Academic Search

With the rapid proliferation of XML data, large-scale online applications are emerging. In this research, we aim to enhance\\u000a the XML query processors with the ability to process queries progressively and report partial results and query progress continually.\\u000a The methodology lays its foundation on sampling. We shed light on how effective samples can be drawn from semi-structured\\u000a XML data, as

Cheng Luo; Zhewei Jiang; Wen-Chi Hou; Gultekin Özsoyoglu

2009-01-01

395

Adaptive Top-k Algorithm in SLCA-Based XML Keyword Search  

Microsoft Academic Search

Computing top-k results matching XML queries is gaining importance due to the increasing of large XML repositories. In this paper, we propose a novel two-layer-based index construction and associated algorithms for efficiently computing top-k results for SLCA-based XML keyword search. We have conducted expensive experiments and the results show great advantage on efficiency compared with existing approaches.

Hang Yu; Zhi-Hong Deng; Yong-Qing Xiang; Ning Gao; Ming Zhang; Shiwei Tang

2010-01-01

396

Structural Consistency: Enabling XML Keyword Search to Eliminate Spurious Results Consistently  

Microsoft Academic Search

XML keyword search is a user-friendly way to query XML data using only\\u000akeywords. In XML keyword search, to achieve high precision without sacrificing\\u000arecall, it is important to remove spurious results not intended by the user.\\u000aEfforts to eliminate spurious results have enjoyed some success by using the\\u000aconcepts of LCA or its variants, SLCA and MLCA. However, existing

Ki-Hoon Lee; Kyu-Young Whang; Wook-Shin Han; Min-Soo Kim

2009-01-01

397

Improving Search Quality of an XML Context-Driven Search Engine by Relabling of Canonical Trees  

Microsoft Academic Search

XCD Search-An XML Context-driven Search Engine answers both Keyword-based and Context-driven queries using stack-based sort merge algorithm. It performs well with all criteria of queries against XML trees, except queries submitted against a document, whose XML tree contains a parent node and child interior node, both having same Taxonomic Label and both have child\\/children data node(s) and\\/or attribute(s). In this

Suhas B. Bhagate

2011-01-01

398

Exact calculations of first-passage quantities on recursive networks.  

PubMed

We present general methods to exactly calculate mean first-passage quantities on self-similar networks defined recursively. In particular, we calculate the mean first-passage time and the splitting probabilities associated to a source and one or several targets; averaged quantities over a given set of sources (e.g., same-connectivity nodes) are also derived. The exact estimate of such quantities highlights the dependency of first-passage processes with respect to the source-target distance, which has recently revealed to be a key parameter in characterizing transport in complex media. We explicitly perform calculations for different classes of recursive networks [finitely ramified fractals, scale-free (trans)fractals, nonfractals, mixtures between fractals and nonfractals, nondecimable hierarchical graphs] of arbitrary size. Our approach unifies and significantly extends the available results in the field. PMID:22463285

Meyer, B; Agliari, E; Bénichou, O; Voituriez, R

2012-02-01

399

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

SciTech Connect

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

Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [University of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.

1996-12-31

400

ROOM: A recursive object oriented method for information systems development  

SciTech Connect

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.

Thelliez, T.; Donahue, S.

1994-02-09

401

Recursive utility in a Markov environment with stochastic growth.  

PubMed

Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron-Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility. PMID:22778428

Hansen, Lars Peter; Scheinkman, José A

2012-07-24

402

Risk Assessment Algorithms Based On Recursive Neural Networks  

E-print Network

The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In this paper we shall introduce a novel approach to compute risk functions by using a combination of a highly non-linear processing model in conjunction with a powerful information encoding procedure. Specifically, the elements of information either static or dynamic that appear in a road intersection scene are encoded by using directed positional acyclic labeled graphs. The risk assessment problem is then reformulated in terms of an inductive learning task carried out by a recursive neural network. Recursive neural networks are connectionist models capable of solving supervised and non-supervised learning problems represented by directed ordered acyclic graphs. The potential of this novel approach is demonstrated through well predefined scenarios. The major difference of our approach compared to others is expressed by the fact of learning t...

De Lara, Alejandro Chinea Manrique

2007-01-01

403

Recursive utility in a Markov environment with stochastic growth  

PubMed Central

Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron–Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility. PMID:22778428

Hansen, Lars Peter; Scheinkman, Jose A.

2012-01-01

404

Recursive track fusion for multi-sensor surveillance  

Microsoft Academic Search

Most of the track fusion work documented in the literature involves a post-processing, batch approach to track-to-track association. Also, it is generally assumed that, due to bandwidth constraints, sensor contacts are unavailable to the track fusion system. Our work differs in that we develop a real-time, recursive approach to the track fusion problem. Further, our algorithm was developed for a

Stefano Coraluppi; Craig Carthel

2004-01-01

405

Recursive Algorithms for Approximating Probabilities in Graphical Models  

Microsoft Academic Search

We develop a recursive node-elimination formalismfor efficiently approximating large probabilisticnetworks. No constraints are set on thenetwork topologies. Yet the formalism can bestraightforwardly integrated with exact methodswhenever they are\\/become applicable. Theapproximations we use are controlled: theymaintain consistently upper and lower boundson the desired quantities at all times. We showthat Boltzmann machines, sigmoid belief networks,or any combination (i.e., chain...

Tommi Jaakkola; Michael I. Jordan

1996-01-01

406

Twin-stack decoding of recursive systematic convolutional codes  

Microsoft Academic Search

We present a method for soft-in\\/soft-out sequential decoding of recursive systematic convolutional codes. The proposed decoder, the twin-stack decoder, is an extension of the well-known ZJ stack decoder, and it uses two stacks. The use of the two stacks lends itself to the generation of soft outputs, and the decoder is easily incorporated into the iterative “turbo” configuration. Under thresholded

Ravi Sivasankaran; Steven W. McLaughlin

2001-01-01

407

Recursion Method for Deriving Energy-Independent Effective Interaction  

E-print Network

The effective-interaction theory has been one of the useful and practical methods for solving nuclear many-body problems based on the shell model. Various approaches have been proposed which are constructed in terms of the so-called $\\widehat{Q}$ box and its energy derivatives introduced by Kuo {\\it et al}. In order to find out a method of calculating them we make decomposition of a full Hilbert space into subspaces (the Krylov subspaces) and transform a Hamiltonian to a block-tridiagonal form. This transformation brings about much simplification of the calculation of the $\\widehat{Q}$ box. In the previous work a recursion method has been derived for calculating the $\\widehat{Q}$ box analytically on the basis of such transformation of the Hamiltonian. In the present study, by extending the recursion method for the $\\widehat{Q}$ box, we derive another recursion relation to calculate the derivatives of the $\\widehat{Q}$ box of arbitrary order. With the $\\widehat{Q}$ box and its derivatives thus determined we ap...

Suzuki, Kenji; Okamoto, Ryoji; Matsuzaki, Masayuki

2014-01-01

408

An XML-based format for guideline interchange and execution.  

PubMed Central

In building a general purpose guideline system based on GLIF--the GuideLine Interchange Format, we encountered limitations in the GLIF specification. These limitations, while not so apparent in the static version of guideline content, became readily so in the context of real world implementation, and pertain not only to GLIF-based systems, but generally as well. These limitations can be described as being in one of five categories. In this paper, we describe each of these categories in detail, and show how an execution environment based on XML data structures addresses these concerns. PMID:11079874

Dubey, A. K.; Chueh, H. C.

2000-01-01

409

Data Entity Dictionary Specification Language: XML/DTD Syntax  

NSDL National Science Digital Library

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.

2002-01-01

410

JUMBO - An XML infrastructure for eScience  

E-print Network

Paint; and Dan Zaharevitz (NCI) for support for JUMBO. [1] J.D. Gale, GULP - a computer program for the symmetry adapted simulation of solids, JCS Faraday Trans., 93, 629, 1997. [2] A. Garcia, P. Murray-Rust, J. Wakelin, The use of XML and CML... in Computational Chemistry and Physics Programs, UK e- Science All Hands Meeting, September 2004. [3] P. Murray-Rust and H. S. Rzepa, CML Schema, J. Chem. Inf. Comp. Sci., 43, 2003. [4] P. Murray-Rust, R. C. Glen, Y. Zhang and J. Harter, The World Wide...

Yong, Zhang; Murray-Rust, Peter; Dove, Martin T; Glen, Robert C; Rzepa, Henry S; Townsend, Joseph A; Tyrrell, Simon M; Wakelin, Jon; Willighagen, Egon L

2008-06-26

411

An XML-based protocol for distributed event services  

SciTech Connect

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.

Gunter, Dan K.; Smith, Warren; Quesnel, Darcy

2001-06-25

412

An XML-Based Protocol for Distributed Event Services  

NASA Technical Reports Server (NTRS)

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.

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

2001-01-01

413

Hi and welcome to An Introduction to XML, part of IBM's Technical briefings series You're thinking about getting started with XML, and you're wondering where to begin, and maybe  

E-print Network

on XML. Well known vocabularies include XQuery and ATOM. Parsers read and process the content of an XML share structured data While HTML tells browsers how to present information for human use, XML is a meta Generalized Markup Language (SGML) Easy to understand and read Supported by a large number of platforms Used

414

Using XML and JSON with Android, Part 2: Deliver hybrid Android applications with JSON  

E-print Network

Using XML and JSON with Android, Part 2: Deliver hybrid Android applications with JSON Mix JavaScript, JSON, callback functions, Android-SDK Java code for flexible mobile apps Skill Level: IntermediateScript Object Notation (JSON), on the Android platform. Part 1 covered the basics of XML and JSON. Part 2

415

Using Intelligent Agents in Conjunction with Heuristic Model for Negotiating ebXML CPP  

Microsoft Academic Search

The Internet and the World Wide Web have provided a wealth of new opportunities for companies eager to do business electronically. For that purpose, electronic business XML (or ebXML) provides an open standard to help make those opportunities possible. When companies begin sharing information to conduct electronic business, there are a number of parameters that need to be negotiated before

Ouassila Hioual; Zizette Boufaida

2006-01-01

416

Automating Disk Forensic Processing with SleuthKit, XML and Python  

Microsoft Academic Search

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

Simson L. Garfinkel

2009-01-01

417

A Data Parallel Algorithm for XML DOM Parsing Bhavik Shah1  

E-print Network

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

Moon, Bongki

418

Self Managing Top-k (Summary, Keyword) Indexes in XML Retrieval  

Microsoft Academic Search

Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as efficiently and effectively as in traditional key- word search, while satisfying additional constraints. Sev- eral XML-retrieval systems support answering queries ex- haustively by storing both structural indexes and a key- word index. Other systems answer

Mariano P. Consens; Xin Gu; Yaron Kanza; Flavio Rizzolo

2007-01-01

419

From XML to Semantic Web Changqing Li and Tok Wang Ling  

E-print Network

on the translation from HTML to semantic web, but seldom on XML. In this paper, we design a method to translate XML on the annotations of the information in HTML. SHOE Knowledge Annotator [5] and Aero- DAML [7] are two tools to annotate HTML. SHOE Knowledge Annotator is a manual tool. The user needs to manually select ontologies

Ling, Tok Wang

420

Supporting Set-at-a-time Extensions for XML through DOM  

E-print Network

to process XML, documents need to be parsed and then users can access, manipulate, and retrieve the XML data-at-a-time processing, define and implement some suitable methods, and code some query application examples by using. Ken Salam and Prof. Grant Weddell for their great help on modifying this thesis. I am grateful

Waterloo, University of

421

An Ontology-Based HTML to XML Conversion Using Intelligent Agents  

Microsoft Academic Search

How to organize and classify large amounts of heterogeneous information accessible over the Internet is a major problem faced by industry, government, and military organizations. XML is clearly a potential solution to this problem, (1,2) however, a significant challenge is how to automatically convert information currently expressed in a standard HTML format to an XML format. Within the Virtual Information

Thomas E. Potok; Mark T. Elmore; Joel W. Reed; Nagiza F. Samatova

2002-01-01

422

Programming Language Inherent Support for Constrained XML Schema Definition Data Types and OWL DL  

Microsoft Academic Search

Recently, the Web Ontology Language (OWL) and XML schema definition (XSD) have become ever more important when it comes to conceptualize knowledge and to define programming language independent type systems. However, writing software that operates on ontological data and on XML instance documents still suffers from a lack of compile time support for OWL and XSD. Especially, obeying lexical- and

Alexander Paar; Walter F. Tichy

2006-01-01

423

Beyond Lazy XML Parsing1 Fernando Farfn, Vagelis Hristidis, Raju Rangaswami  

E-print Network

Beyond Lazy XML Parsing1 Fernando Farfán, Vagelis Hristidis, Raju Rangaswami School of Computer applications. However, wide adoption of XML is hindered by inefficient document-parsing methods. Recent work on lazy parsing is a major step towards alleviating this problem. However, lazy parsers must still read

Rangaswami, Raju

424

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

E-print Network

structure can be used to facilitate the search process of users. We investigate how users of an XML increasingly used in digital libraries (DL), retrieval engines that allow search within collections of XMLThe Use of Summaries in XML Retrieval Zolt´an Szl´avik, Anastasios Tombros, and Mounia Lalmas

Tombros, Tassos

425

ELCEA: An Entity-Based Semantics Towards Effective XML Keyword Search  

Microsoft Academic Search

Keyword search is a user-friendly way to query XML data, such that users do not need to understand the complex syntax of structured query languages and the complex structural information of the underlying XML data. However, existing semantics suffer from limited expressiveness, thus users cannot obtain desired information in many cases. We propose an entity-based semantics, namely ELCEA, to capture

Qingling Ji; Junfeng Zhou; Jingfeng Guo

2010-01-01

426

Effective access to digital assets: An XML-based EAD search system  

Microsoft Academic Search

This paper focuses on the question of effective access methods, by developing novel search tools that will be crucial on the massive scale of digital asset repositories. We illustrate concretely why XML matters in digital curation by describing an implementation of a baseline digital asset search system that is fully XML-driven. The system aims to provide better access to archival

Junte Zhang; Khairun Nisa Fachry; Jaap Kamps

2009-01-01

427

Multi-recursive Monte-Carlo method for nonlinear system state estimation  

Microsoft Academic Search

Nonlinear state estimation methods have the essential advantage over linear methods. For state-space model of the general SISO nonlinear system, single-recursive Monte-Carlo (MC) state estimation method was presented, and then multi-recursive MC estimation method was proposed. With a typical and designed mathematical model, simulation shows that the multi-recursive MC method has higher estimation precision at the cost of longer operation

Shenghong Xu; Jinhua Wu

2004-01-01

428

Structural Semi-Join: A light-weight structural join operator for efficient XML path query pattern matching  

Microsoft Academic Search

Optimal evaluation of structural relationships between XML nodes is crucial for efficient processing of XML queries. Though stack-based structural join algorithms showed improved performance over the merge-based algorithms, the algorithms still suffer potential overhead in processing XML path expressions. This is mainly because the existing structural join algorithms have been designed for returning (ancestor, descendant) node pairs even when the

Seokhyun Son; Hyoseop Shin; Zhiwei Xu

2007-01-01

429

Performing Grouping and Aggregate Functions in XML Huayu Wu, Tok Wang Ling, Liang Xu, and Zhifeng Bao  

E-print Network

in a query, how to efficiently compute grouping and aggregate functions over XML document is not well studiedPerforming Grouping and Aggregate Functions in XML Queries Huayu Wu, Tok Wang Ling, Liang Xu yet. In this paper, we extend our previous XML query processing algo- rithm, VERT, to efficiently

Ling, Tok Wang

430

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

E-print Network

Why (and how) I am using XML and MathML Richard Kaye, School of Mathematics, University be using XML and MathML much more, and outline my own attempts to make XML/MathML publishing accessible ASCII character set, and sadly unicode is incompatible with TeX's 7-bit kludge. Search engines, like

Kaye, Richard

431

DOM tree browsing of a very large XML document: Design and implementation Seung Min Kim, Suk I. Yoo *  

E-print Network

of the DOM tree to find some desired nodes without any knowledge for search. When the structure of the XMLDOM tree browsing of a very large XML document: Design and implementation Seung Min Kim, Suk I. Yoo Accepted 20 May 2009 Available online 2 June 2009 Keywords: XML DOM DOM tree Very large XML documents a b

Yoo, SukIn

432

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

E-print Network

From Revisiting the LCA-based Approach to a New Semantics-based Approach for XML Keyword Search keyword search approach, and propose an approach to perform XML keyword search based on semantics rather search has been studied for several years. Inspired by the hierarchical structure of XML data, most

Ling, Tok Wang

433

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

E-print Network

??We describe a new approach for formal verification of combinational logic circuits, and their switch-level transistor implementation. Our approach CODibines regression testing, hierarchical recursive learning,… (more)

Shao, Li

2012-01-01

434

Email Updates  

MedlinePLUS

... Health Topics Drugs & Supplements Videos & Cool Tools ESPAÑOL 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 ...

435

Rocket ascent trajectory optimization via recursive quadratic programming  

NASA Astrophysics Data System (ADS)

An algorithm for solving parameterized optimal control problems such as the ascent trajectory optimization problem of a multistage launch vehicle is developed. The implementation of this algorithm, designated as the Recursive Quadratic Programming Approach, for the pitch and yaw optimization of a multistage launch vehicle is discussed, and results are given for injection into a polar orbit from the Indian launch site where in order to satisfy safety conditions curved ascent trajectories are necessary. It is concluded that the algorithm provides relatively fast optimization, is easy to implement, and has a large convergence region.

Well, K. H.; Tandon, S. R.

1982-06-01

436

Recursive time-varying filter banks for subband image coding  

NASA Technical Reports Server (NTRS)

Filter banks and wavelet decompositions that employ recursive filters have been considered previously and are recognized for their efficiency in partitioning the frequency spectrum. This paper presents an analysis of a new infinite impulse response (IIR) filter bank in which these computationally efficient filters may be changed adaptively in response to the input. The filter bank is presented and discussed in the context of finite-support signals with the intended application in subband image coding. In the absence of quantization errors, exact reconstruction can be achieved and by the proper choice of an adaptation scheme, it is shown that IIR time-varying filter banks can yield improvement over conventional ones.

Smith, Mark J. T.; Chung, Wilson C.

1992-01-01

437

Recursive Search Method Applied to a Nonequilibrium Phase Transition  

NASA Astrophysics Data System (ADS)

In this work, we extend the recursive search method to locate the critical point and to obtain the relevant critical exponents of a nonequilibrium phase transition. In particular, the method is applied to the contact process which presents a nonequilibrium phase transition between a steady active to a single inactive absorbing state belonging to the directed percolation universality class. We present the appropriate scaling analysis which allows for precise estimates of the critical parameters with a relatively small computational effort. The proposed scheme can be directly applied to general model systems presenting nonequilibrium transitions into absorbing states including reaction-diffusion and pair contact processes.

da Silva, P. C.; Lyra, M. L.; Fulco, U. L.; da Silva, L. R.

438

Asian Updates  

NSDL National Science Digital Library

The Asia Society, a nonpofit educational institution charged with improving "communication between Americans and the peoples of Asia and the Pacific," provides these background papers on Asia and US-Asia relations. The four currently-available updates discuss such topics as Philippine economic and political reform, the 1997 Sino-American summit, the 1997 Korean elections, and the Association of Southeast Asian Nations (ASEAN). Authors include David Shambaugh, Chaibong Hahm, and Robert A. Scalapino. Forthcoming Updates will cover South and Central Asia.

1998-01-01

439

KEMB: A Keyword-Based XML Message Broker Guoliang Li, Jianhua Feng, Member, IEEE, Jianyong Wang, Senior Member, IEEE, and Lizhu Zhou  

E-print Network

that KEMB achieves high performance and scales very well. Index Terms--Keyword search, XML data stream, XML search has been proposed as an alternative means of querying XML documents [15], [28], [41], whichKEMB: A Keyword-Based XML Message Broker Guoliang Li, Jianhua Feng, Member, IEEE, Jianyong Wang

Li, Guoliang

440

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

applications on top of XMLDB, such as XBRL and XML-search integration The growth in the use of XML has createdThe Oracle XML Database Team* (Full time position only, no internships) Come join a team of energetic and easy going people with a passion to push the limits of SQL and XML further. We are looking

Plotkin, Joshua B.

441

XML Data Compression using Brevity Encoding Tel./Fax : 0-4336-2160 E-mail : (superjing@gmail.com) , (krunapon@kku.ac.th)  

E-print Network

] (Chemical Markup Language, CML) [10] BPEL, SVG, CML XML XML (Web Services) [16] Yahoo Search XML Data Compression using Brevity Encoding 40002 Tel./Fax : 0-4336-2160 E-mail : (superjing@gmail.com) , (krunapon@kku.ac.th) ABSTRACT - XML becomes the standard language for data

Runapongsa, Kanda

442

Measuring the Scalability of a XML-QL Relational Database Management Rebecca J. Cathey, Steven M. Beitzel, Eric C. Jensen, Angelo J. Pilotto,  

E-print Network

, efficient methods to store and search XML documents are needed. Our XML- QL to SQL translator, SQLGenerator, it has no rigid, predefined structure or schema. In order to search XML, a query language designedMeasuring the Scalability of a XML-QL Relational Database Management System Rebecca J. Cathey

443

Fine tuning points of generating function construction for linear recursions  

NASA Astrophysics Data System (ADS)

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

Yolcu, Bahar; Demiralp, Metin

2014-10-01

444

Optimal Recursive Digital Filters for Active Bending Stabilization  

NASA Technical Reports Server (NTRS)

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

Orr, Jeb S.

2013-01-01

445

A recursive least squares-based demodulator for electrical tomography.  

PubMed

In this paper, a recursive least squares (RLS)-based demodulator is proposed for Electrical Tomography (ET) that employs sinusoidal excitation. The new demodulator can output preliminary demodulation results on amplitude and phase of a sinusoidal signal by processing the first two sampling data, and the demodulation precision and signal-to-noise ratio can be further improved by involving more sampling data in a recursive way. Thus trade-off between the speed and precision in demodulation of electrical parameters can be flexibly made according to specific requirement of an ET system. The RLS-based demodulator is suitable to be implemented in a field programmable gate array (FPGA). Numerical simulation was carried out to prove its feasibility and optimize the relevant parameters for hardware implementation, e.g., the precision of the fixed-point parameters, sampling rate, and resolution of the analog to digital convertor. A FPGA-based capacitance measurement circuit for electrical capacitance tomography was constructed to implement and validate the RLS-based demodulator. Both simulation and experimental results demonstrate that the proposed demodulator is valid and capable of making trade-off between demodulation speed and precision and brings more flexibility to the hardware design of ET systems. PMID:23635217

Xu, Lijun; Zhou, Haili; Cao, Zhang

2013-04-01

446

Recursions of Symmetry Orbits and Reduction without Reduction  

NASA Astrophysics Data System (ADS)

We consider a four-dimensional PDE possessing partner symmetries mainly on the example of complex Monge-Ampère equation (CMA). We use simultaneously two pairs of symmetries related by a recursion relation, which are mutually complex conjugate for CMA. For both pairs of partner symmetries, using Lie equations, we introduce explicitly group parameters as additional variables, replacing symmetry characteristics and their complex conjugates by derivatives of the unknown with respect to group parameters. We study the resulting system of six equations in the eight-dimensional space, that includes CMA, four equations of the recursion between partner symmetries and one integrability condition of this system. We use point symmetries of this extended system for performing its symmetry reduction with respect to group parameters that facilitates solving the extended system. This procedure does not imply a reduction in the number of physical variables and hence we end up with orbits of non-invariant solutions of CMA, generated by one partner symmetry, not used in the reduction. These solutions are determined by six linear equations with constant coefficients in the five-dimensional space which are obtained by a three-dimensional Legendre transformation of the reduced extended system. We present algebraic and exponential examples of such solutions that govern Legendre-transformed Ricci-flat Kähler metrics with no Killing vectors. A similar procedure is briefly outlined for Husain equation.

Malykh, Andrei A.; Sheftel, Mikhail B.

2011-04-01

447

Adaptive model reduction for continuous systems via recursive rational interpolation  

NASA Technical Reports Server (NTRS)

A method for adaptive identification of reduced-order models for continuous stable SISO and MIMO plants is presented. The method recursively finds a model whose transfer function (matrix) matches that of the plant on a set of frequencies chosen by the designer. The algorithm utilizes the Moving Discrete Fourier Transform (MDFT) to continuously monitor the frequency-domain profile of the system input and output signals. The MDFT is an efficient method of monitoring discrete points in the frequency domain of an evolving function of time. The model parameters are estimated from MDFT data using standard recursive parameter estimation techniques. The algorithm has been shown in simulations to be quite robust to additive noise in the inputs and outputs. A significant advantage of the method is that it enables a type of on-line model validation. This is accomplished by simultaneously identifying a number of models and comparing each with the plant in the frequency domain. Simulations of the method applied to an 8th-order SISO plant and a 10-state 2-input 2-output plant are presented. An example of on-line model validation applied to the SISO plant is also presented.

Lilly, John H.

1994-01-01

448

Recursive Feature Selection with Significant Variables of Support Vectors  

PubMed Central

The development of DNA microarray makes researchers screen thousands of genes simultaneously and it also helps determine high- and low-expression level genes in normal and disease tissues. Selecting relevant genes for cancer classification is an important issue. Most of the gene selection methods use univariate ranking criteria and arbitrarily choose a threshold to choose genes. However, the parameter setting may not be compatible to the selected classification algorithms. In this paper, we propose a new gene selection method (SVM-t) based on the use of t-statistics embedded in support vector machine. We compared the performance to two similar SVM-based methods: SVM recursive feature elimination (SVMRFE) and recursive support vector machine (RSVM). The three methods were compared based on extensive simulation experiments and analyses of two published microarray datasets. In the simulation experiments, we found that the proposed method is more robust in selecting informative genes than SVMRFE and RSVM and capable to attain good classification performance when the variations of informative and noninformative genes are different. In the analysis of two microarray datasets, the proposed method yields better performance in identifying fewer genes with good prediction accuracy, compared to SVMRFE and RSVM. PMID:22927888

Tsai, Chen-An; Huang, Chien-Hsun; Chang, Ching-Wei; Chen, Chun-Houh

2012-01-01

449

Parsimonious extreme learning machine using recursive orthogonal least squares.  

PubMed

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

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

2014-10-01

450

DNA Data Bank of Japan (DDBJ) in XML.  

PubMed

The DNA Data Bank of Japan (DDBJ, http://www.ddbj.nig.ac.jp) has collected and released more entries and bases than last year. This is mainly due to large-scale submissions from Japanese sequencing teams on mouse, rice, chimpanzee, nematoda and other organisms. The contributions of DDBJ over the past year are 17.3% (entries) and 10.3% (bases) of the combined outputs of the International Nucleotide Sequence Databases (INSD). Our complete genome sequence database, Genome Information Broker (GIB), has been improved by incorporating XML. It is now possible to perform a more sophisticated database search against the new GIB than the ordinary BLAST or FASTA search. PMID:12519938

Miyazaki, S; Sugawara, H; Gojobori, T; Tateno, Y

2003-01-01

451

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

E-print Network

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

Devroye, Luc

452

Monotonous Trend Estimation using Recursive Prony Analysis Xilin Yang, Matt Garratt and Hemanshu Pota  

E-print Network

Monotonous Trend Estimation using Recursive Prony Analysis Xilin Yang, Matt Garratt and Hemanshu of a slow-varying oscillating system. A recursive Prony Analysis (PA) scheme is developed which involves obtaining a dynamic model with parameters identified by implementing the forgetting factor re- cursive least

Pota, Himanshu Roy

453

A Brief Tutorial On Recursive Estimation With Examples From Intelligent Vehicle  

E-print Network

A Brief Tutorial On Recursive Estimation With Examples From Intelligent Vehicle Applications (Part II): System Models Hao Li Abstract In the first article of the series "A brief tutorial on recursive the first article [1] of the series "A brief tutorial on recur- sive estimation", in which we have reviewed

Paris-Sud XI, Université de

454

Informatica 21 (1997) 1 Towards Recursive Models---A Computational Formalism for the  

E-print Network

, and compared with related work. Finally, the adequacy of Recursive Models is empirically verified: TOBIInformatica 21 (1997) 1 Towards Recursive Models---A Computational Formalism for the Semantics; they are studied empha­ sizing the various types of knowledge underlying them; and the fragment of language

Mizzaro, Stefano

455

Informatica 21 (1997) 1 Towards Recursive Models|A Computational Formalism for the  

E-print Network

of view, and compared with related work. Finally, the adequacy of Recursive Models is empirically veri edInformatica 21 (1997) 1 Towards Recursive Models|A Computational Formalism for the Semantics of examples they are studied empha- sizing the various types of knowledge underlying them and the fragment

Mizzaro, Stefano

456

Working Memory: A Cognitive Limit to Non-Human Primate Recursive Thinking Prior to Hominid Evolution?  

Microsoft Academic Search

In this paper I explore the possibility that recursion is not part of the cognitive repertoire of non-human primates due to a limitation on the size of working memory in non-human primates such as the chimpanzees. Multiple lines of data imply that chimpanzee working memory may be of size 2. If so, they lack the cognitive capacity for recursive thinking.

Dwight W. Read

457

An Efficient Implementation of the Recursive Approach to Flexible Multibody Dynamics  

Microsoft Academic Search

This paper deals with the efficient extension of the recursive formalism (articulated body inertia) for flexible multibody systems. Present recursive formalisms for flexible multibody systems require the inversion of the mass matrix with the dimension equal to the number of flexible degrees of freedom of particular bodies. This is completely removed. The paper describes the derivation of equations of motion

J. Znamená?ek; M. Valášek

1998-01-01

458

Recursive Bayesian Search-and-tracking using Coordinated UAVs for Lost Targets  

Microsoft Academic Search

This paper presents a coordinated control technique that allows heterogeneous vehicles to autonomously search for and track multiple targets using recursive Bayesian filtering. A unified sensor model and a unified objective function are proposed to enable search-and-tracking (SAT) within the recursive Bayesian filter framework. The strength of the proposed technique is that a vehicle can switch its task mode between

Tomonari Furukawa; Frédéric Bourgault; Benjamin Lavis; Hugh F. Durrant-whyte

2006-01-01

459

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

E-print Network

of recursive data constructions. We describe partially dead recursive data using liveness patterns based on general regular tree grammars extended with the notion of live and dead, and we formulate the analysis- plicitly involve live or dead code but rely on similar notions. Examples are program slicing [64

Liu, Yanhong Annie

460

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

E-print Network

of recursive data constructions. We describe partially dead recursive data using liveness patterns based on general regular tree grammars extended with the notion of live and dead, and we formulate the analysis- plicitly involve live or dead code but rely on similar notions. Examples are program slicing [64

Stoller, Scott

461

Eliminating Dead Code on Recursive Data Yanhong A. Liu \\Lambda and Scott D. Stoller ?  

E-print Network

of recursive data construc­ tions. We represent partially dead recursive data using liveness patterns based on general regular tree grammars extended with the notion of live and dead, and we formulate the analysis activities that do not explicitly involve live or dead code but rely on similar notions. Examples are program

Liu, Yanhong Annie

462

Using Canny's criteria to derive a recursively implemented optimal edge detector  

Microsoft Academic Search

A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented by two recursive filters moving in opposite directions. In addition to the noise truncature immunity

Rachid Deriche

1987-01-01

463

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

E-print Network

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

Yao, Yuan

464

Stable recursive algorithm for elastic wave propagation in layered anisotropic media: Stiffness matrix method  

Microsoft Academic Search

An efficient recursive algorithm, the stiffness matrix method, has been developed for wave propagation in multilayered generally anisotropic media. This algorithm has the computational efficiency and simplicity of the standard transfer matrix method and is unconditionally computationally stable for high frequency and layer thickness. In this algorithm, the stiffness (compliance) matrix is calculated for each layer and recursively applied to

S. I. Rokhlin; L. Wang

2002-01-01

465

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

Microsoft Academic Search

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

I. Stojmenovic; Binomial Coefficients

2000-01-01

466

What's Motivation Got to Do with It? A Survey of Recursion in the Computing Education Literature  

E-print Network

What's Motivation Got to Do with It? A Survey of Recursion in the Computing Education Literature attention has been paid to student motivation. This article summarizes results on teaching and learning recursion explored by the computing education community, noting the relative lack of interest in motivation

Schaefer, Marcus

467

DRAFT PAPER IN SUBMISSION 1 On Recursive Edit Distance Kernels with  

E-print Network

space endowed with the dot prod- uct in which edit distances or time warping algorithms can be defined the possi- bility of embedding time series in Time Warped Hilbert Spaces. The main contributions classical recursive definition of elastic distances, recursive edit distance (or time-warp) kernels

Recanati, Catherine

468

DRAFT PAPER IN SUBMISSION 1 On Recursive Edit Distance Kernels with  

E-print Network

space endowed with the dot prod- uct in which edit distances or time warping algorithms can be defined offering the possi- bility of embedding time series in Time Warped Hilbert Spaces. The main contributions classical recursive definition of elastic distances, recursive edit distance (or time-warp) kernels

469

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

Microsoft Academic Search

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

C. Xiang; D. Huang

2006-01-01

470

Knitting for fun: a recursive sweater Anna Bernasconi1, Chiara Bodei1, and Linda Pagli1  

E-print Network

Knitting for fun: a recursive sweater Anna Bernasconi1, Chiara Bodei1, and Linda Pagli1,chiara,pagli}@di.unipi.it Abstract. In this paper we investigate the relations between knitting and computer science. We show have not yet been used for creative knitting. The obtained results are short (optimal size) recursive

Bodei, Chiara

471

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

NASA Technical Reports Server (NTRS)

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

Verhaegen, M. H.

1987-01-01

472

4.3 Recursive Definitions and Structural Induction. (up to (not including) Generalized Induction)  

E-print Network

4.3 Recursive Definitions and Structural Induction. (up to (not including) Generalized Induction) 1, where w and x . 5. Stuctural Induction: To prove that P(n) is true for all elements n in some set, we of the recursive defn. · Inductive step: prove that if P(k) is true for each element k used to construct new

Gera, Ralucca

473

Using XML and Java Technologies for Astronomical Instrument Control  

NASA Technical Reports Server (NTRS)

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.

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

2001-01-01

474

Continuous closed-loop decoder adaptation with a recursive maximum likelihood algorithm allows for rapid performance acquisition in brain-machine interfaces.  

PubMed

Closed-loop decoder adaptation (CLDA) is an emerging paradigm for both improving and maintaining online performance in brain-machine interfaces (BMIs). The time required for initial decoder training and any subsequent decoder recalibrations could be potentially reduced by performing continuous adaptation, in which decoder parameters are updated at every time step during these procedures, rather than waiting to update the decoder at periodic intervals in a more batch-based process. Here, we present recursive maximum likelihood (RML), a CLDA algorithm that performs continuous adaptation of a Kalman filter decoder's parameters. We demonstrate that RML possesses a variety of useful properties and practical algorithmic advantages. First, we show how RML leverages the accuracy of updates based on a batch of data while still adapting parameters on every time step. Second, we illustrate how the RML algorithm is parameterized by a single, intuitive half-life parameter that can be used to adjust the rate of adaptation in real time. Third, we show how even when the number of neural features is very large, RML's memory-efficient recursive update rules can be reformulated to also be computationally fast so that continuous adaptation is still feasible. To test the algorithm in closed-loop experiments, we trained three macaque monkeys to perform a center-out reaching task by using either spiking activity or local field potentials to control a 2D computer cursor. RML achieved higher levels of performance more rapidly in comparison to a previous CLDA algorithm that adapts parameters on a more intermediate timescale. Overall, our results indicate that RML is an effective CLDA algorithm for achieving rapid performance acquisition using continuous adaptation. PMID:24922501

Dangi, Siddharth; Gowda, Suraj; Moorman, Helene G; Orsborn, Amy L; So, Kelvin; Shanechi, Maryam; Carmena, Jose M

2014-09-01

475

J.E. Fenstad. R.O. Gandy. G.E. Sacks (Eds.) GENERALIZED RECURSION THEORY 11  

E-print Network

in the search f o r the axioms needed to do Recursion Theory. made in these directions. To clarify the concepts 2. Basic Notions. The correct general setting for B-Recursion Theory is Jensen's S-Hierarchy for L c w #12;AN INTRODUCTION TO 6-RECURSION THEORY The S-Hierarchy is now defined by: S o = $ , sati = S

476

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

PubMed Central

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

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

2009-01-01

477

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

E-print Network

and XML. 1. Introduction Developing programs to simulate complex real world systems is a challenging real world system. To reduce the cost of developing and maintaining simulation models and facilitate

Miller, John A.

478

Indexing and querying XML using extended Dewey labeling scheme Jiaheng Lu a,  

E-print Network

for a book that has an author named by "Chen". In practice, XML data may be very large, complex and have deep.g. Data & Knowledge Engineering xxx (2010) xxx­xxx Corresponding author. School of Information, Renmin

Ling, Tok Wang

479

Status Update  

ERIC Educational Resources Information Center

This article offers some updates on the share of the higher education institutions in the billion-worth stimulus package and how institutions were assisted through this funding. Since the $787 billion stimulus package, formally known as the American Reinvestment and Recovery Act (ARRA), was signed into law in 2009, an estimated $50 billion to $75…

Hernandez, Arelis

2010-01-01

480

Update '98.  

ERIC Educational Resources Information Center

Updates cases and issues previously discussed in this regular column on human rights in Canada, including racism and anti-Semitism, laws on hate crimes, hate sites on the World Wide Web, the use of the "free speech" defense by hate groups, and legal challenges to antiracist groups by individuals criticized by them. (DSK)

Mock, Karen R.

1998-01-01

481

Space Update  

NSDL National Science Digital Library

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.

2006-01-01

482

Source localization using recursively applied and projected (RAP) MUSIC  

SciTech Connect

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

Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [Univ. of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.

1998-03-01

483

Flame Propagation Through Swirling Eddys, A Recursive Pattern  

E-print Network

Computed flame motion through and between swirling eddys exhibits a maximum advancement rate which is related to the time duration of flame motion between eddys. This eddy spatial structure effect upon the apparent turbulent flame speed appears to be similar to the square-root dependence observed in wrinkled flamelet data. The rate-limiting behavior at one eddy length-scale can be removed by inclusion of smaller eddys which reside between the larger eddys. This large-eddy, small-eddy concept yields a recursion relation and repeated functional iteration can be done to approximate a desired flame speed relation. As an example, an iteration to produce $S_T \\ln S_T = u'$ is given for the range of $u'$ observed in liquid flames. Currently, the iteration process is a post-diction of flame speed, but if a universality can be developed, then a predictive theory of turbulent flame propagation might be achieved.

Wm. T. Ashurst

1993-03-11

484

The uses of the refined matrix model recursion  

SciTech Connect

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

Brini, Andrea; Marino, Marcos; Stevan, Sebastien [Departement de Physique Theorique et Section de Mathematiques, Universite de Geneve, Geneve CH-1211 (Switzerland)

2011-05-15

485

Recursive least square vehicle mass estimation based on acceleration partition  

NASA Astrophysics Data System (ADS)

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

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

2014-05-01

486

Quantum gravity and $(\\min,+)$-type recursive distributional equations  

E-print Network

This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how it is possible to define a random metric on self-similar spaces which are the limit of nice finite graphs: these are the so-called hierarchical graphs. They possess a well-defined level structure and any level is built using a simple recursion. Stopping the construction at a given finite level, we have a discrete random metric space when we set the edges to have random length (using a multiplicative cascade with fixed law $m$). We introduce a tool, the cut-off process, that allows to show that it is possible to renormalize the sequence of distances by an exponential factor in such a way that they converge in law to a non-trivial distance on the limit space. Such limit law is stationary, in the sense that gluing together a certain number of copies of the random limit space, according to the combinatorics of the brick graph, the obtained new random distance has the same law. In other words, the stationary measure is the solution of a recursive distributional equation. Moreover, when the measure $m$ has a continuous positive density on $\\mathbf{R}_+$, we show that the stationary law is unique up to rescaling and that any other distribution tends to a rescaled stationary law under the iterations of the hierarchical transformation. We hope that the technique could be modified in order to deal with genuine 2D problems.

Mikhail Khristoforov; Victor Kleptsyn; Michele Triestino

2013-10-23

487

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

PubMed Central

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

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

2012-01-01

488

Runtime-Efficient Approach for Multiple Continuous Filtering in XML Message Brokers  

Microsoft Academic Search

XML message brokers play a key role in exchanging information in ubiquitous environments. One of their core technical issues\\u000a is difficulty associated with processing a set of XPath queries for multiple continuous filtering over incoming XML streams.\\u000a This paper proposes a novel system designed to provide an epochal solution to this problem. The proposed system provides efficient\\u000a data structures and

Hyunho Lee; Wonsuk Lee

2007-01-01

489

XML editor for search and retrieval of bibliographic records in the Z39.50 standard  

Microsoft Academic Search

Purpose – The purpose of this paper is modelling and implementation of the XML-based editor for search and retrieval of bibliographic records. Search and retrieval of bibliographic records are enabled by the editor from the remote databases via the Z39.50 protocol. The client application is realized in the Java environment and business logic is based on the XML technologies. Design\\/methodology\\/approach

Danijela Boberic; Dusan Surla

2009-01-01

490

Making the VoiceWeb Smarter - Integrating Intelligent Component Technologies and VoiceXML  

Microsoft Academic Search

VoiceXML offers the prospect of a streamlined deployment process of voice interfaces for commercial applications, similar to the ease of Web development. This in turn promises increased dynamism in the field of speech and language research. We investigate opportunities and constraints for the integration of intelligent component technologies into VoiceXML-based systems: such components will solve tasks from both sides of

Markus Mittendorfer; Georg Niklfeld; Werner Winiwarter

2001-01-01

491

An adaptable XML based approach for scientific data management and integration  

NASA Astrophysics Data System (ADS)

Increased complexity of scientific research poses new challenges to scientific data management. Meanwhile, scientific collaboration is becoming increasing important, which relies on integrating and sharing data from distributed institutions. We develop SciPort, a Web-based platform on supporting scientific data management and integration based on a central server based distributed architecture, where researchers can easily collect, publish, and share their complex scientific data across multi-institutions. SciPort provides an XML based general approach to model complex scientific data by representing them as XML documents. The documents capture not only hierarchical structured data, but also images and raw data through references. In addition, SciPort provides an XML based hierarchical organization of the overall data space to make it convenient for quick browsing. To provide generalization, schemas and hierarchies are customizable with XML-based definitions, thus it is possible to quickly adapt the system to different applications. While each institution can manage documents on a Local SciPort Server independently, selected documents can be published to a Central Server to form a global view of shared data across all sites. By storing documents in a native XML database, SciPort provides high schema extensibility and supports comprehensive queries through XQuery. By providing a unified and effective means for data modeling, data access and customization with XML, SciPort provides a flexible and powerful platform for sharing scientific data for scientific research communities, and has been successfully used in both biomedical research and clinical trials.

Wang, Fusheng; Thiel, Florian; Furrer, Daniel; Vergara-Niedermayr, Cristobal; Qin, Chen; Hackenberg, Georg; Bourgue, Pierre-Emmanuel; Kaltschmidt, David; Wang, Mo

2008-03-01

492

Using XML and Java for Astronomical Instrumentation Control  

NASA Technical Reports Server (NTRS)

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.

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

2000-01-01

493

Generic XML-based framework for metadata portals  

NASA Astrophysics Data System (ADS)

We present a generic and flexible framework for building geoscientific metadata portals independent of content standards for metadata and protocols. Data can be harvested with commonly used protocols (e.g., Open Archives Initiative Protocol for Metadata Harvesting) and metadata standards like DIF or ISO 19115. The new Java-based portal software supports any XML encoding and makes metadata searchable through Apache Lucene. Software administrators are free to define searchable fields independent of their type using XPath. In addition, by extending the full-text search engine (FTS) Apache Lucene, we have significantly improved queries for numerical and date/time ranges by supplying a new trie-based algorithm, thus, enabling high-performance space/time retrievals in FTS-based geo portals. The harvested metadata are stored in separate indexes, which makes it possible to combine these into different portals. The portal-specific Java API and web service interface is highly flexible and supports custom front-ends for users, provides automatic query completion (AJAX), and dynamic visualization with conventional mapping tools. The software has been made freely available through the open source concept.

Schindler, Uwe; Diepenbroek, Michael

2008-12-01

494

A preliminary XML-based search system for planetary data  

E-print Network

Planetary sciences can benefit from several different sources of information, i.e. ground-based or near Earth-based observations, space missions and laboratory experiments. The data collected from these sources, however, are spread over a number of smaller, separate communities and stored through different facilities: this makes it difficult to integrate them. The IDIS initiative, born in the context of the Europlanet project, performed a pilot study of the viability and the issues to be overcome in order to create an integrated search system for planetary data. As part of the results of such pilot study, the IDIS Small Bodies and Dust node developed a search system based on a preliminary XML data model. Here we introduce the goals of the IDIS initiative and describe the structure and the working of this search system. The source code of the search system is released under GPL license to allow people interested in participating to the IDIS initiative both as developers and as data providers to familiarise wit...

Carraro, Francesco; Turrini, Diego; De Sanctis, Maria Cristina; Giacomini, Livia

2009-01-01

495

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

NASA Technical Reports Server (NTRS)

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.

Gal-Edd, Jonathan; Fatig, Curtis C.

2005-01-01

496

Multi-Resolution Seismic Tomography Based on Recursive Tessellation Hierarchy  

SciTech Connect

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

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

2009-07-01

497

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

E-print Network

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

Shao, Li

2012-06-07

498

Recursive computation of certain derivatives&a study of error propagation  

Microsoft Academic Search

A brief study is made of the propagation of errors in linear first-order difference equations. The recursive computation of successive derivatives of ex\\/x and (cos x)\\/x is considered as an llustration.

WALTER GAUTSCI-II; Bruce J. Klein

1970-01-01

499

Modifications to recursion unfolding algorithms to find more appropriate neutron spectra.  

PubMed

Modifications were made to recursion unfolding algorithms which allow the incorporation of prior knowledge, such as cutoff energy or preferred spectral shape, into the solution. Using these modifications, more appropriate neutron spectra are obtained. PMID:6548987

Lowry, K A; Johnson, T L

1984-10-01

500

On the recursive parameter estimation in the general discrete time statistical model  

Microsoft Academic Search

The consistency and asymptotic linearity of recursive maximum likelihood estimator is proved under some regularity and ergodicity assumptions on the logarithmic derivative of a transition density for a general statistical model. ©1998 Elsevier Science B.V.

Teo Sharia

1998-01-01