Note: This page contains sample records for the topic updating recursive xml from Science.gov.
While these samples are representative of the content of Science.gov,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of Science.gov
to obtain the most current and comprehensive results.
Last update: November 12, 2013.
1

Optimizing updates of recursive XML views of relations  

Microsoft Academic Search

XML publishing has been an emerging technique for transforming (portions of) a relational database into an XML document, for\\u000a example, to facilitate interoperability between heterogeneous applications. Such applications may update the XML document\\u000a and the source relational database must be updated accordingly. In this paper, we consider such XML documents as (possibly)\\u000a recursively defined XML views of relations. We propose

Ramadhana Bramandia; Jiefeng Cheng; Byron Choi; Jeffrey Xu Yu

2009-01-01

2

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

Microsoft Academic Search

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

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

2004-01-01

3

U-Filter: A Lightweight XML View Update Checker  

Microsoft Academic Search

Both XML-relational systems and native XML sys-tems support creating XML wrapper views and querying against them. However, update operations against such virtual XML views in most cases are not supported yet. Two problems concerning updating XML views need to be tackled. First, update translatability concerns whether the given update to the view can be achieved by updates on the base

Ling Wang; Elke A. Rundensteiner; Murali Mani

2006-01-01

4

Extending XML Types Using Updates  

Microsoft Academic Search

The XML Messaging Protocol, a part of the Web service protocol stack, is responsible for encoding messages in a common XML format (or type), so that they can be understood at either end of a network connection. The evolution of an XML type may be required in order to reflect new communication needs, materialized by slightly different XML messages. For

Béatrice Bouchou; Rabelais Tours; Denio Duarte; Mírian Halfeld Ferrari

2009-01-01

5

From XML View Updates to Relational View Updates: old solutions to a new problem  

Microsoft Academic Search

This paper addresses the question of updating rela- tional databases through XML views. Using query trees to capture the notions of selection, projection, nesting, grouping, and heterogeneous sets found throughout most XML query languages, we show how XML views expressed using query trees can be mapped to a set of corresponding relational views. We then show how updates on the

Vanessa P. Braganholo; Susan B. Davidson; Carlos A. Heuser

2004-01-01

6

Valid Updates for Persistent XML Objects  

Microsoft Academic Search

XML has emerged as the industry standard for representing and exchanging data and is already predominant in several applications today. Business, analytic and structered data will be exchanged as XML between applications and web services. XQuery is a language designed and developed for querying, filtering and generating XML structured data and is currently being standardized by the World Wide Web

Henrike Schuhart; Volker Linnemann

2005-01-01

7

Adaptive beamforming using recursive eigenstructure updating with subspace constraint  

NASA Astrophysics Data System (ADS)

An algorithm is presented for updating the adaptive beamformer weights using recursive eigenvalue decomposition (EVD) of a covariance matrix and subspace constraint. This algorithm exploits the subspace structure that the covariance matrix of the interference sources and the noise is a low-rank matrix plus a diagonal matrix. This eigenspace characterization approach avoids the numerically unstable recursive procedure based on the matrix inversion lemma. Moreover, the subspace property makes it possible to develop a fast algorithm by monitoring only the principal eigenvalues and eigenvectors and the noise eigenvalue.

Yu, Kai-Bor

1991-12-01

8

Immediate and Partial Validation Mechanism for the Conflict Resolution of Update Operations in XML Databases  

Microsoft Academic Search

Recently, several researches have been performed for updating XML documents(1)(2)(12) stored in databases. These researches define update op- erations and resolve some semantic problems. However, because the update operations are usually validated after execution, conflicts can occur among them. Furthermore, in many studies for updating, they just validate whole XML documents and can't validate parts of them. If updates are

Sang-kyun Kim; Myungcheol Lee; Kyu-chul Lee

2002-01-01

9

An Optimized Two-Step Solution for Updating XML Views  

Microsoft Academic Search

View updating is a long standing difficult problem. Given a vi ew defined over base data sources and a view update, there are several different updates over the base data sources, called translations, that perform the update. A translation is said to be correct if it performs the update and at the same time does not update any portion of

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

2008-01-01

10

Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor  

Microsoft Academic Search

Continual updating of estimates required by most recursive estimation schemes often involves redundant usage of information and may result in system instabilities in the presence of bounded output disturbances. This paper investigates an algorithm which has the capability of eliminating these difficulties. Based on a set theoretic assumption, the algorithm yields modified least-squares estimates with a forgetting factor. It updates

S. Dasgupta; Y. F. Huang

1985-01-01

11

Rewriting Regular XPath Queries on XML Views  

Microsoft Academic Search

We study the problem of answering queries posed on virtual views of XML documents, a problem commonly en- countered when enforcing XMLaccess control and integrat- ing data. We approach the problem by rewriting queries on views into equivalent queries on the underlying docu- ment, and thus avoid the overhead of view materialization and maintenance. We consider possibly recursively defined XML

Wenfei Fan; Floris Geerts; Xibei Jia; Anastasios Kementsietsidis

2007-01-01

12

XML Files  

MedlinePLUS

... Topics Drugs & Supplements Videos & Cool Tools MedlinePlus XML Files To use the sharing features on this page, ... If you have questions about the MedlinePlus XML files, please contact us . For additional sources of MedlinePlus ...

13

Using XML  

Microsoft Academic Search

\\u000a This chapter covers the following topics:\\u000a \\u000a \\u000a \\u000a \\u000a  \\u000a \\u000a What XML and E4X are\\u000a \\u000a \\u000a \\u000a  \\u000a \\u000a How XML can be used with ActionScript 3.0\\u000a \\u000a \\u000a \\u000a  \\u000a \\u000a The different methods of constructing XML\\u000a \\u000a \\u000a \\u000a Extensible Markup Language (XML) is a simple, tag-based, descriptive language that can be created in any text editor. XML\\u000a allows users to describe complex, hierarchical data in simple, logical terms. It has

Sean McSharry

14

Assisting XML Schema Evolution that Preserves Validity  

Microsoft Academic Search

We consider the problem of XML schema evolution preserving t he va- lidity of existing documents related to the original schema . The aim of such schema evolution is to fit new needs without revalidating all e xisting valid XML documents. We propose an approach to assist users to specify schema updates that have no impact on existing document validity.

Béatrice Bouchou; Denio Duarte

2007-01-01

15

Binary XML Storage and Query Processing in Oracle 11g  

Microsoft Academic Search

Oracle RDBMS has supported XML data management for more than six years since version 9i. Prior to 11g, text- centric XML documents can be stored as-is in a CLOB column and schema-based data-centric documents can be shredded and stored in object-relational (OR) tables mapped from their XML Schema. However, both storage formats have intrinsic limitations|XML\\/CLOB has unacceptable query and update

Ning Zhang; Nipun Agarwal; Sivasankaran Chandrasekar; Sam Idicula; Vijay Medi; Sabina Petride; Balasubramanyam Sthanikam

2009-01-01

16

Recursive conditioning  

Microsoft Academic Search

We introduce an any-space algorithm for exact inference in Bayesian networks, called recursive conditioning. On one extreme, recursive conditioning takes O(n) space and O(n exp(w log n)) time— where n is the size of a Bayesian network and w is the width of a given elimination order—therefore, establishing a new complexity result for linear-space inference in Bayesian networks. On the

Adnan Darwiche

2001-01-01

17

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

18

BATCH-TO-BATCH OPTIMAL CONTROL OF BATCH PROCESSES BASED ON RECURSIVELY UPDATED NONLINEAR PARTIAL LEAST SQUARES MODELS  

Microsoft Academic Search

A batch-to-batch optimal control approach for batch processes based on batch-wise updated nonlinear partial least squares (NLPLS) models is presented in this article. To overcome the difficulty in developing mechanistic models for batch\\/semi-batch processes, a NLPLS model is developed to predict the final product quality from the batch control profile. Mismatch between the NLPLS model and the actual plant often

Chunfu Li; Jie Zhang; Guizeng Wang

2007-01-01

19

A recursive linear predictive vocoder  

NASA Astrophysics Data System (ADS)

A non-real time 10 pole recursive autocorrelation linear predictive coding vocoder was created for use in studying effects of recursive autocorrelation on speech. The vocoder is composed of two interchangeable pitch detectors, a speech analyzer, and speech synthesizer. The time between updating filter coefficients is allowed to vary from .125 msec to 20 msec. The best quality was found using .125 msec between each update. The greatest change in quality was noted when changing from 20 msec/update to 10 msec/update. Pitch period plots for the center clipping autocorrelation pitch detector and simplified inverse filtering technique are provided. Plots of speech into and out of the vocoder are given. Formant versus time three dimensional plots are shown. Effects of noise on pitch detection and formants are shown. Noise effects the voiced/unvoiced decision process causing voiced speech to be re-constructed as unvoiced.

Janssen, W. A.

1983-12-01

20

XML, RDF, and Relatives  

Microsoft Academic Search

Languages for representing data and knowledge are an important aspect of the Semantic Web, and there are a lot of languages around! Most languages are based on XML (eXtensible Markup Language) or use XML as syntax; some have connections to RDF (Resource Description Framework) or RDF schemas. This tutorial briefly introduces XML, XML schemas, RDF and RDF schemas.

Michel C. A. Klein

2001-01-01

21

Recursive Kernels  

Microsoft Academic Search

This paper is an extension of earlier papers [8, 9] on the “native” Hilbert spaces of functions on some domain ? ? R\\u000a \\u000a d\\u000a in which conditionally positive definite kernels are reproducing kernels. Here, the focus is on subspaces of native spaces\\u000a which are induced via subsets of ?, and we shall derive a recursive subspace structure of these, leading

Mohammed Mouattamid; Robert Schaback

2009-01-01

22

A peer-to-peer, value-oriented XML Store  

Microsoft Academic Search

This paper presents and evaluates XML Store, a dis- tributed and highly scalable storage system for XML documents that builds on the Chord peer-to-peer proto- col developed at MIT. The interface (API) to the stor- age system is simple and value-oriented, permitting no destructive updates, which permits simple solutions to replication, caching, and transaction management. Our experimental implementation of XML

Tine Thorn; Anders Baumann; Mikkel Fennestad; Peter Sestoft

2003-01-01

23

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

24

XML and DB2  

Microsoft Academic Search

The eXtensible Markup Language (XML) is a key technology that facilitates both information exchange and e-business transactions. Starting with DB2 UDB Net. Data V1, an application can generate XML documents from SQL queries against DB2 or any ODBC compliant databases. Today DB2 UDB XML Extender not only serves as a repository for both XML documents and their Document Type Definitions

Josephine M. Cheng; Jane Xu

2000-01-01

25

The XML Benchmark Project  

Microsoft Academic Search

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

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

2001-01-01

26

On Distributing XML Repositories  

Microsoft Academic Search

XML is increasingly used not only for data exchange but also to represent arbitrary data sources as virtual XML reposi- tories. In many application scenarios, fragments of such a repository are distributed over the Web. However, design and query models for distributed XML data have not yet been studied in detail. In this paper, we introduce a distribution approach for

Jan-marco Bremer; Michael Gertz

2003-01-01

27

Approximate XML joins  

Microsoft Academic Search

XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety sources. Hence, XML is likely to be the format through which data from multiple sources is integrated.In this paper we study the problem of integrating XML data sources through correlations realized as join operations. A challenging aspect of

Sudipto Guha; H. V. Jagadish; Nick Koudas; Divesh Srivastava; Ting Yu

2002-01-01

28

Schema Evolution for XML: A Consistency-Preserving Approach  

Microsoft Academic Search

This paper deals with updates of XML documents that sat- isfy a given schema, e.g., a DTD. In this context, when a given update violates the schema, it might be the case that this update is accepted, thus implying to change the schema. Our method is intended to be used by a data administrator who is an expert in the

Béatrice Bouchou; Denio Duarte; Mirian Halfeld Ferrari Alves; Dominique Laurent; Martin A. Musicante

2004-01-01

29

XML-BASED REPRESENTATION  

SciTech Connect

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

R. KELSEY

2001-02-01

30

Similarity of XML Schema Fragments Based on XML Data Statistics  

Microsoft Academic Search

As XML has become a standard for data representation, it can be found in plenty of information technologies. A possible optimization of XML-based approaches can be exploitation of similarity of XML data. In this paper we propose a technique for evaluating similarity of XML schema fragments focusing on two often omitted aspects - structural level of similarity and tuning of

Jaroslav Pokorny

2007-01-01

31

XML.org: The XML Industry Portal  

NSDL National Science Digital Library

The Extensible Markup Language (XML) is widely used for Web design and authoring, and its uses go far beyond the confines of the Internet. It is a versatile metalanguage that is spreading across many different industries. XML.org is one of the best resources of XML information for curious beginners or advanced users. For the first group of people, there are plenty of frequently asked questions lists, tutorials, and articles to get started. The registry contains many specifications and schemas that are specific to a particular industry. To make the collection as comprehensive as possible, developers can submit content to share with other users. In addition to these features, the Web site offers many more useful items.

2002-01-01

32

Compact XML grammar based compression  

Microsoft Academic Search

Extensible Markup Language (XML) is the standard format for content representation and sharing on the Web. XML is a highly verbose language, especially regarding the duplication of meta-data in the form of elements and attributes. As XML content is becoming more widespread so is the demand to compress XML data volume. This paper presents a new grammar, called D-grammar, which

S. Harrusi; A. Averbuch; A. Yehudai

33

Verification of the Security against Inference Attacks on XML Databases  

NASA Astrophysics Data System (ADS)

This paper discusses verification of the security against inference attacks on XML databases. First, a security definition called k-secrecy against inference attacks on XML databases is proposed. k-secrecy with an integer k > 1 (or k = ?) means that attackers cannot narrow down the candidates for the value of the sensitive information to k - 1 (or finite), using the results of given authorized queries and schema information. Secondly, an XML query model such that verification can be performed straightforwardly according to the security definition is presented. The query model can represent practical queries which extract some nodes according to any of their neighboring nodes such as ancestors, descendants, and siblings. Thirdly, another refinement of the verification method is presented, which produces much smaller intermediate results if a schema contains no arbitrarily recursive element. The correctness of the refinement is proved, and the effect of the refinement in time and space efficiency has been confirmed by experiment.

Hashimoto, Kenji; Sakano, Kimihide; Takasuka, Fumikazu; Ishihara, Yasunori; Fujiwara, Toru

34

Securing XML Documents with Author-X  

Microsoft Academic Search

Author-X is a Java-based system that addresses the security issues of access control and policy design for XML document administration. Author-X supports the specification of policies at varying granularity levels and the specification of user credentials as a way to enforce access control. Access control is available according to both push and pull document distribution policies, and document updates are

Elisa Bertino; Silvana Castano; Elena Ferrari

2001-01-01

35

Keys for XML  

Microsoft Academic Search

We discuss the deflnition of keys for XML documents, paying particular attention to the concept of a relative key, which is commonly used in hierarchically structured documents and scientiflc databases.

Peter Buneman; Susan B. Davidson; Wenfei Fan; Carmem S. Hara; Wang-Chiew Tan

2001-01-01

36

XML-RPC  

Microsoft Academic Search

\\u000a Drupal “plays well with others.” That is, if there’s an open standard out there, chances are that Drupal supports it either\\u000a natively or through a contributed module. XML-RPC is no exception; Drupal supports it natively. In this chapter, you’ll learn\\u000a how to take advantage of Drupal’s ability both to send and receive XML-RPC calls.

John K. VanDyk

37

Guarded recursive datatype constructors  

Microsoft Academic Search

We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell. We address both theoretical and practical issues resulted from this generalization. On one hand, we design a type system to formalize the notion of g.r. datatype constructors and then prove the soundness of the type

Hongwei Xi; Chiyan Chen; Gang Chen

2003-01-01

38

Language and Recursion  

Microsoft Academic Search

This paper examines whether the recursive structure imbedded in some exercises used in the Non Verbal Communication Device (NVCD) approach is actually the factor that enables this approach to favor language acquisition and reacquisition in the case of children with cerebral lesions. For that a definition of the principle of recursion as it is used by logicians is presented. The

Francis Lowenthal

2010-01-01

39

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…

Corballis, Michael C.

2007-01-01

40

Recursion in aphasia.  

PubMed

This study investigates how aphasic impairment impinges on syntactic and/or semantic recursivity of human language. A series of tests has been conducted with the participation of five Hungarian speaking aphasic subjects and 10 control subjects. Photographs representing simple situations were presented to subjects and questions were asked about them. The responses are supposed to involve formal structural recursion, but they contain semantic-pragmatic operations instead, with 'theory of mind' type embeddings. Aphasic individuals tend to exploit the parallel between 'theory of mind' embeddings and syntactic-structural embeddings in order to avoid formal structural recursion. Formal structural recursion may be more impaired in Broca's aphasia and semantic recursivity may remain selectively unimpaired in this type of aphasia. PMID:20964508

Bánréti, Zoltán

2010-11-01

41

Recursively speaking: analyzing students' discourse of recursive phenomena  

Microsoft Academic Search

Recursion is a powerful concept, appearing in almost every introductory course in computer-science (CS). CS educators and educational researchers often refer to difficulties in learning recursion, and suggest methods for teaching recursion. However, the research literature barely addresses the unique ways in which students relate to this interdisciplinary concept and the particular learners' language concerning recursive phenomena. The gap is

Dalit Levy; Tami Lapidot

2000-01-01

42

Web Mapping and XML Technologies \\  

Microsoft Academic Search

SUMMARY The role of XML technologies in GIS and Cartography becomes more and more critical offering great advantages in web-based applications. The objective of this study is to elaborate on the utilization of the XML specifications used in modern web cartographic applications. Emphasis is given to GML, XSL and SVG standards that constitute the major XML encodings used in web

Maria Spanaki; Byron Antoniou; Lysandros Tsoulos

43

XML-RPC  

Microsoft Academic Search

\\u000a After reading this chapter, you should\\u000a \\u000a \\u000a \\u000a \\u000a – \\u000a \\u000a Be able to send XML-RPC calls from a Drupal site to a different server.\\u000a \\u000a \\u000a \\u000a – \\u000a \\u000a Understand how Drupal maps XML-RPC methods to PHP functions.\\u000a \\u000a \\u000a \\u000a – \\u000a \\u000a Be able to implement simple and complex versions of the xmlrpc hook.\\u000a \\u000a \\u000a \\u000a – \\u000a \\u000a Know Drupal’s built-in XML-RPC methods.

Todd Tomlinson; John K. VanDyk

44

Introducing recursive complexity  

NASA Astrophysics Data System (ADS)

In this paper a possibility of introducing new software metric is explored. The new metric reflects the recursive complexity i.e., the complexity of recursive calls appearing in the source code for the purpose of maintainability analysis. The purpose of recursive complexity is to fulfill the gap in complexity and maintainability measurements. Intention of this paper is to provoke the discussion on the needs in the field of maintainability analysis regarding complexity measures. Therefore only the basic concepts of the new metric are discussed.

Raki?, Gordana; Budimac, Zoran; Bothe, Klaus

2013-10-01

45

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.

46

Classifying XML tags through \\  

Microsoft Academic Search

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

Xavier Tannier; Jean-Jacques Girardot; Mihaela Mathieu

2005-01-01

47

Trust Assertion XML Infrastructure  

Microsoft Academic Search

The Trust Assertion XML Infrastructure (TAXI) is described. TAXI is a PKI research project that had the objective of developing technology that would assist the deployment of PKI. Parts of the TAXI architecture have since been realized in open standards, notably the X KMS (X KMS) and SAML (SAML) specifications, ot her parts of the T AXI arc hitecture s

Phillip Hallam-Baker

48

Distinctive signatures of recursion  

PubMed Central

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

Martins, Mauricio Dias

2012-01-01

49

Comparative analysis of six XML schema languages  

Microsoft Academic Search

As XML [5] is emerging as the data format of the internet era, there is an substantial increase of the amount of data in XML format. To better describe such XML data structures and constraints, several XML schema languages have been proposed. In this paper, we present a comparative analysis of six noteworthy XML schema languages.

Dongwon Lee; Wesley W. Chu

2000-01-01

50

Generalized XML security views  

Microsoft Academic Search

We investigate a generalization of the notion of XML security view introduced by Stoica and Farkas (Proceedings of the 16th\\u000a International Conference on Data and Applications Security (IFIP’02). IFIP Conference Proceedings, vol. 256, pp. 133–146.\\u000a Kluwer, Dordrecht, 2002) and later refined by Fan et al. (Proceedings of the ACM SIG- MOD International Conference on Management\\u000a of Data (SIGMOD’04), pp. 587–598.

Gabriel M. Kuper; Fabio Massacci; Nataliya Rassadko

2009-01-01

51

XML Web Services  

Microsoft Academic Search

Web Services are the next hype been built which will undoubtedly revolutionize the IT world with the phenomenal support it provides for distributed computing through the use of standardized protocols which enables the seamless integration of heterogeneous systems across different platforms.\\u000d\\u000a\\u000d\\u000aThrough the use of protocols such as XML, SOAP, WSDL and UDDI, applications can exchange information and interoperate in

Mifla Mashood; G N Wikramanayake

2005-01-01

52

Language and Recursion  

NASA Astrophysics Data System (ADS)

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

Lowenthal, Francis

2010-11-01

53

Recursively Imputed Survival Trees.  

PubMed

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

Zhu, Ruoqing; Kosorok, Michael R

2011-12-01

54

Recursively Imputed Survival Trees  

PubMed Central

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

Zhu, Ruoqing; Kosorok, Michael R.

2011-01-01

55

XML Evolution: A Two-phase XML Processing Model Using XML Prefiltering Techniques  

Microsoft Academic Search

An implementation based on the two-phase XML processing model introduced in (3) is presented in this paper. The model employs a prefilter to remove uninteresting fragments of an input XML document by approximately executing a user's queries. The refined candidate-set XML document is then returned to the user's DOM- or SAX-based applications for further processing. In this demonstration, it is

Chia-hsin Huang; Tyng-ruey Chuang; James J. Lu; Hahn-ming Lee

2006-01-01

56

Diabatic initialization using recursive filters  

Microsoft Academic Search

Several initialization schemes based on recursive filters are formulated and tested with a numerical weather prediction model, HIRLAM. These have an advantage over schemes which use non-recursive filters in that they derive the initialized values from a diabatic trajectory passing through the original analysis. The changes to the analysed fields are comparable in size to typical observational errors. A non-recursive

Peter Lynch; Xiang-Yu Huang

1994-01-01

57

Recursion in Aphasia  

ERIC Educational Resources Information Center

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

Banreti, Zoltan

2010-01-01

58

Recursion, Computers and Art  

ERIC Educational Resources Information Center

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

Kemp, Andy

2007-01-01

59

Mapping XML to OWL Ontologies  

Microsoft Academic Search

By now, XML has reached a wide acceptance as data exchange format in E-Business. An efficient collaboration between different participants in E-Business thus, is only possible, when business partners agree on a common syntax and have a common understanding of the basic concepts in the domain. XML covers the syntactic level, but lacks support for efficient sharing of conceptualizations. The

Hannes Bohring; Sören Auer

2005-01-01

60

A Query Language for XML  

Microsoft Academic Search

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

Alin Deutsch; Mary F. Fernández; Daniela Florescu; Alon Y. Levy; Dan Suciu

1999-01-01

61

XML technologies and software engineering  

Microsoft Academic Search

aspects that characterize the relationship between these areas. The rst addresses the use of XML and related technolo- gies for the construction of software engineering tools and environments. The second focuses on the exploita- tion of XML for the development of a new generation of distributed software architectures and middleware that might provide new degrees of exibility in terms of

Cecilia Mascolo; Wolfgang Emmerich; Anthony Finkelstein

2001-01-01

62

TIMBER: A native XML database  

Microsoft Academic Search

The date of receipt and acceptance will be inserted by the editor Abstract This paper describes the overall design and ar- chitecture of the Timber XML database system currently being implemented at the University of Michigan. The sys- tem is based upon a bulk algebra for manipulating trees, and natively stores XML. New access methods have been developed to evaluate

H. V. Jagadish; Shurug Al-khalifa; Adriane Chapman; Laks V. S. Lakshmanan; Andrew Nierman; Stelios Paparizos; Jignesh M. Patel; Divesh Srivastava; Nuwee Wiwatwattana; Yuqing Wu; Cong Yu

2002-01-01

63

XML: some papers in a haystack  

Microsoft Academic Search

XML has been explored by both research and industry com- munities. More than 5500 papers were published on different aspects of XML. With so many publications, it is hard for someone to decide where to start. Hence, this paper presents some of the research topics on XML, namely: XML on re- lational databases, query processing, views, data matching, and schema

Mirella M. Moro; Vanessa P. Braganholo; Carina F. Dorneles; Denio Duarte; Renata de Matos Galante; Ronaldo S. Mello

2009-01-01

64

A Transaction Mechanism for Native XML Database  

Microsoft Academic Search

Concurrent accessing of XML data becomes more and more important for XML-based applications, especially for Native XML Database systems (NXD) because of the dramatic growth of number and complexity of such applications. Transaction is a potential solution for the concurent accessing of XML data. However, research on transaction of NXD is still very limited. This paper proposes a transaction model

HUI TAN; XINMENG CHEN; JINGUANG GU

2006-01-01

65

Conceptual Design of XML Document Warehouses  

Microsoft Academic Search

EXtensible Markup Language (XML) has emerged as the dominant standard in describing and exchanging data among heterogeneous data sources. XML with its self-describing hierarchical structure and its associated XML Schema (XSD) provides the flexibility and the manipulative power needed to accommodate complex, disconnected, heterogeneous data. The issue of large volume of data appearing deserves investigating XML Document Warehouses. But due

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

2004-01-01

66

Schema Based XML Security: RBAC Approach  

Microsoft Academic Search

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

Xinwen Zhang; Jaehong Park; Ravi S. Sandhu

2003-01-01

67

Efficient Integrity Checking for Databases with Recursive Views  

Microsoft Academic Search

Efficient and incremental maintenance of integrity constraints involving recursive views is a difficult issue that has received some atten- tion in the past years, but for which no widely accepted solution exists yet. In this paper a technique is proposed for compiling such integrity constraints into incremental and optimized tests specialized for given update patterns. These tests may involve the

Davide Martinenghi; Henning Christiansen

2005-01-01

68

Recursive scaled DCT  

NASA Astrophysics Data System (ADS)

Among the various image data compression methods, the discrete cosine transform (DCT) has become the most popular in performing gray-scale image compression and decomposition. However, the computational burden in performing a DCT is heavy. For example, in a regular DCT, at least 11 multiplications are required for processing an 8 X 1 image block. The idea of the scaled-DCT is that more than half the multiplications in a regular DCT are unnecessary, because they can be formulated as scaling factors of the DCT coefficients, and these coefficients may be scaled back in the quantization process. A fast recursive algorithm for computing the scaled-DCT is presented in this paper. The formulations are derived based on practical considerations of applying the scaled-DCT algorithm to image data compression and decompression. These include the considerations of flexibility of processing different sizes of DCT blocks and the actual savings of the required number of arithmetic operations. Due to the recursive nature of this algorithm, a higher-order scaled-DCT can be obtained from two lower-order scaled DCTs. Thus, a scaled-DCT VLSI chip designed according to this algorithm may process different sizes of DCT under software control. To illustrate the unique properties of this recursive scaled-DCT algorithm, the one-dimensional formulations are presented with several examples exhibited in signal flow-graph forms.

Hou, Hsieh-Sheng

1991-12-01

69

Health Topic XML File Description  

MedlinePLUS

... Supplements Videos & Cool Tools MedlinePlus Health Topic XML File Description To use the sharing features on this ... Tags - definitions of every possible tag in the file, with examples and their use on MedlinePlus. Example ...

70

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

71

Conceptual Design of an XML FACT Repository for Dispersed XML Document Warehouses and XML Marts  

Microsoft Academic Search

Since the introduction of extensible Markup Language (XML), XML repositories have gained a foothold in many global (and government) organizations, where, e-commerce and e-business models have maturated in handling daily transactional data among heterogeneous information systems in multi-data formats. Due to this, the amount of data available for enterprise decision-making process is increasing exponentially and are being stored and\\/or communicated

Rajagopal Rajugan; Elizabeth Chang; Tharam S. Dillon

2005-01-01

72

Diabatic Initialization Using Recursive Filters  

Microsoft Academic Search

A number of initialization schemes based on recursive lters are formulated and testedwith a numerical weather prediction model, HIRLAM. These have an advantage overschemes which use nonrecursive lters in that they derive the initialized values from a diabatictrajectory passing through the original analysis. The changes to the analysed eldsare comparable in size to typical observational errors. A non-recursive implementationof the

Peter Lynch; Xiang-yu Huang

1993-01-01

73

Translation using Minimal Recursion Semantics  

Microsoft Academic Search

We describe minimal recursion semantics (MRS), a framework for semantics within HPSG, which considerably simplifies transfer and generation. We discuss why, in gen- eral, a semantic representation with minimal structure is desirable for transfer and illustrate how a descriptively adequate representation with a non-recursive structure may be achieved. The paper illustrates the application of MRS to transfer with a series

Ann Copestake; Dan Flickinger; Rob Malouf; Susanne Riehemann; Ivan Sag

1995-01-01

74

Expressiveness of restricted recursive queries  

Microsoft Academic Search

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

Foto Afrati; S. S. Cosmadakis

1989-01-01

75

Recursive Patterns in Phonological Phrases  

Microsoft Academic Search

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

Maartje Schreuder; Dicky Gilbers

76

XML Based Scientific Data Management Facility.  

National Technical Information Service (NTIS)

The World Wide Web consortium has developed an Extensible Markup Language (XML) to support the building of better information management infrastructures. The scientific computing community realizing the benefits of XML has designed markup languages for sc...

P. Mehrotra M. Zubair

2002-01-01

77

View Definition and DTD Inference for XML  

Microsoft Academic Search

We present a query language and mediator architecture for XML data [XML98b]. The query language, called Xmas (XML Matching And Structuring Language) uses vertical and horizontal navigation. The horizontal navigation provides a powerful novel mechanism for using the order in the semistructured model underlying XML. This couples nicely with the well-known regular path expressions for vertical navigation [Suc, Abi97, Bun97,

Bertram Ludäscher; Yannis Papakonstantinou; Pavel Velikhov; Victor Vianu

1999-01-01

78

XFlavor: providing XML features in media representation  

Microsoft Academic Search

We present XFlavor, a framework for providing XML representation of multimedia data. XFlavor can be used to convert multimedia\\u000a data back and forth between binary and XML representations. Compared to bitstreams, XML documents are easier to access and\\u000a manipulate, and consequently, the development of multimedia processing software is greatly facilitated, as one generic XML\\u000a parser can be used to read

Danny Hong; Alexandros Eleftheriadis

2008-01-01

79

Structure and Content Scoring for XML  

Microsoft Academic Search

XML repositories are usually queried both on structure and content. Due to structural heterogeneity of XML, queries are often interpreted approximately and their answers are returned ranked by scores. Computing answer scores in XML is an active area of research that oscillates between pure content scoring such as the well-known query processing. We propose efficient data structures in order to

Sihem Amer-Yahia; Nick Koudas; Amélie Marian; Divesh Srivastava; David Toman

2005-01-01

80

A Binary XML for Scientific Applications  

Microsoft Academic Search

XML provides flexible, extensible data models and type systems for structured data, and has found wide-acceptance in many domains. XML processing can be slow, however, especially for scientific data, thus leading to the conven- tional wisdom that XML is not appropriate for such data. Instead, data is stored in specialized binary formats, and is transmitted via work-arounds such as attachments

Kenneth Chiu; Tharaka Devadithya; Wei Lu; Aleksander Slominski

2005-01-01

81

XML-based information mediation with MIX  

Microsoft Academic Search

The MIX mediator system, MIXm, is developed as part of the MIX Project at the San Diego Supercomputer Center, and the University of California, San Diego.1 MIXm uses XML as the common model for data exchange. Mediator views are expressed in XMAS (XML Matching And Structuring Language), a declarative XML query language. To facilitate user-friendly query formulation and for optimization

Chaitanya Baru; Amarnath Gupta; Bertram Ludäscher; Richard Marciano; Yannis Papakonstantinou; Pavel Velikhov; Vincent Chu

1999-01-01

82

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

83

Statistical Learning Techniques for Costing XML Queries  

Microsoft Academic Search

Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much more complex than relational operators such as table scans and joins. In this paper, we propose a new approach, called COMET, to modeling the cost of XML operators; to our knowledge, COMET is the

Ning Zhang; Peter J. Haas; Vanja Josifovski; Guy M. Lohman; Chun Zhang

2005-01-01

84

Supporting complex queries on multiversion XML documents  

Microsoft Academic Search

Managing multiple versions of XML documents represents a critical requirement for many appli- cations. Recently, there has been much work on supporting complex queries on XML data (e.g., regular path expressions, structural projections, etc.). In this paper, we examine the problem of implementing e-ciently such complex queries on multiversion XML documents. Our approach relies on a numbering scheme whereby durable

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

2006-01-01

85

XML Declarative Description with Negative Constraints  

Microsoft Academic Search

XML Declarative Description (XDD) theory employs XML's nested tree structure as its underlying data structure and Declarative Description theory as a framework to enhance its expressiveness. It enables direct representation of data items, encoded in XML applications, and extends their expressiveness by materializing succinct and uniform representation of implicit information, integrity constraints, conditional relationships and axioms. With the aim of

Chutiporn Anutariya; Vilas Wuwongse; Kiyoshi Akama

86

DSD: A schema language for XML  

Microsoft Academic Search

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

Nils Klarlund; Anders Møller; Michael I. Schwartzbach

2000-01-01

87

QUALITY CONTROL SYSTEM OF XML BIBLIOGRAPHIC RECORDS  

Microsoft Academic Search

The aim of this paper was not only to define the XML biblio- graphic records format, but also to describe the use of dierent XML stan- dards and o-the-shelf tools in library automation. The quality control system of bibliographic records within the BISIS library software system has been implemented using XML Schema, XSLT and XPath languages, according to UNIMARC bibliographic

Gordana Budimir; Dusan Surla

2004-01-01

88

XMark: A Benchmark for XML Data Management  

Microsoft Academic Search

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

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

2002-01-01

89

Matching XML Schemas: A Qualitative Analysis  

Microsoft Academic Search

Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing popularity of the XML model and the proliferation of XML documents on-line, automated matching of XML documents has become a critical research problem. We have developed qualitative and quantitative analysis techniques to classify both the

Vaishali N. Hegde; Kajal T. Claypool

90

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

91

The role of XML in TMN evolution  

Microsoft Academic Search

This paper reviews the potential of XML a key technology in the evolution of TMN. The current state and applications of XML is reviewed with respect to the communication management domain. XML is suggested as a way to build on TMN's strengths while addressing its weaknesses in terms of being overspecialized and difficult to mediate with. An example of a

David Lewis; Jens D. Mouritzsen

2001-01-01

92

Recursively speaking: analyzing students' discourse of recursive phenomena  

Microsoft Academic Search

Al~tract Reoursion is a powerful concept, appearing in almost every introductory course in computer-soience (CS). CS ocbwators and eda~cational researohets often refer to diff;oulties in learning recursion, and suggest methods for toaohing recursion. However, the researoh literature barely addresses the unique ways in whioh students relate to this intcrdisciplinmy conoept and the particular learners' language exm~ning reoursive phenomena. The gap

Dalit Levy; Tami Lapidot

2000-01-01

93

Recursive adaptive frame integration limited  

NASA Astrophysics Data System (ADS)

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

Rafailov, Michael K.

2006-06-01

94

XML4Lib Electronic Discussion  

NSDL National Science Digital Library

Sponsored by the Berkeley Digital Library SunSITE, this new discussion list will explore the "Extensible Markup Language (XML) and its use in, by, and for libraries and library users." The list is aimed specifically at librarians and library staff, but all are welcome to join. Subscription information and discussion logs are provided at the site.

2001-01-01

95

Querying and Ranking XML Documents.  

ERIC Educational Resources Information Center

|Discussion of XML, information retrieval, precision, and recall focuses on a retrieval technique that adopts the similarity measure of the vector space model, incorporates the document structure, and supports structured queries. Topics include a query model based on tree matching; structured queries and term-based ranking; and term frequency and…

Schlieder, Torsten; Meuss, Holger

2002-01-01

96

XML Node Semantic Weight Model Based on VSM  

Microsoft Academic Search

XML has become an important format for exchange data. Ranking of XML search results directly relates to XML information retrieval performance. Most of the existing ranking models consider words statistical characteristics in the XML document, but they do not consider position of the node a word belongs to. That is to say, all of nodes in XML document have the

Xinfeng Lai; Changxuan Wan; Dexi Liu

2008-01-01

97

DICOM involving XML path-tag  

NASA Astrophysics Data System (ADS)

Digital Imaging and Communications in Medicine (DICOM) is a standard for handling, storing, printing, and transmitting information in medical imaging. XML (Extensible Markup Language) is a set of rules for encoding documents in machine-readable form which has become more and more popular. The combination of these two is very necessary and promising. Using XML tags instead of numeric labels in DICOM files will effectively increase the readability and enhance the clear hierarchical structure of DICOM files. However, due to the fact that the XML tags rely heavily on the orders of the tags, the strong data dependency has a lot of influence on the flexibility of inserting and exchanging data. In order to improve the extensibility and sharing of DICOM files, this paper introduces XML Path-Tag to DICOM. When a DICOM file is converted to XML format, adding simple Path-Tag into the DICOM file in place of complex tags will keep the flexibility of a DICOM file while inserting data elements and give full play to the advantages of the structure and readability of an XML file. Our method can solve the weak readability problem of DICOM files and the tedious work of inserting data into an XML file. In addition, we set up a conversion engine that can transform among traditional DICOM files, XML-DCM and XML-DCM files involving XML Path-Tag efficiently.

Zeng, Qiang; Yao, Zhihong; Liu, Lei

2011-03-01

98

Real-time FPGA implementation of recursive wavelet packet transform  

NASA Astrophysics Data System (ADS)

To address the computational complexity of the wavelet packet transform of a moving window with a large amount of overlap between consecutive windows, the recursive computation approach was introduced previously1. In this work, this approach is extended to 2D or images. In addition, the FPGA implementation of the recursive approach for updating wavelet coefficients is performed by using the LabVIEW FPGA module. This programming approach is graphical and requires no knowledge of relatively involved hardware description languages. A number of optimization steps including both filter and wavelet stage pipelining are taken in order to achieve a real-time throughput. It is shown that the recursive approach reduces the computational complexity significantly as compared to the non-recursive or the classical computation of wavelet packet transform. For example, the number of multiplications is reduced by a factor of 3 for a 3-stage 1D transform of moving windows containing 128 samples and by a factor of 12 for a 3-stage 2D transform of moving window blocks of size 16×16 with 50% overlap.

Gopalakrishna, Vanishree; Kehtarnavaz, Nasser; Patlolla, Chandrasekhar; Carlsohn, Matthias F.

2012-05-01

99

Recursive least-squares learning algorithms for neural networks  

SciTech Connect

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

Lewis, P.S. (Los Alamos National Lab., NM (USA)); Hwang, Jenq-Neng (Washington Univ., Seattle, WA (USA). Dept. of Electrical Engineering)

1990-01-01

100

Generating Basic Units with XML  

NASA Astrophysics Data System (ADS)

A fundamental characteristic of any scientific data is its physical units. Unit comparisons and conversions are required in order to understand the meaning of the data and whether or not certain operations on the data are meaningful. For example, only data with equivalent units should be merged. Intelligent query of distributed systems, such as is envisioned for the NVO, will need to integrate or merge data with mixed conventions of units. It would be desirable to provide a standard process to enable machine understanding of units. We present a solution to this problem using XML entities. Our solution features a flexibility to encompass current unit systems, ease of human use, and interoperability (XML/MathML based) between heterogeneous operating systems.

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

2000-12-01

101

A Better XML Parser through Functional Programming  

Microsoft Academic Search

This paper demonstrates how a higher-level, declarative view of XML parsing as folding over XML documents has helped to design\\u000a and implement a better XML parser. By better we mean a full-featured, algorithmically optimal, pure-functional parser, which\\u000a can act as a stream processor. By better we mean an efficient SAX parser that is easy to use, a parser that does

Oleg Kiselyov

2002-01-01

102

Querying and Splicing of XML Workflows  

Microsoft Academic Search

In both industry and the research community it is now common to represent workflow schemas and enactments using XML. As a\\u000a matter of fact, more and more enterprise application integration platforms (e.g., Excelon, Bea, iPlanet, etc.) are using XML\\u000a to represent workflows within or across enterprise boundaries. In this paper we explore the ability of modern XML query languages\\u000a (specifically,

Vassilis Christophides; Richard Hull; Akhil Kumar

2001-01-01

103

XML Schemas from Computational Ontologies  

Microsoft Academic Search

Abstract Academic,researchers in artificial intelligence tend to use computational,ontologies for knowledge modeling whereas commercial developers tend to use XML schemas, even though there is considerable overlap,between,the two representations considered as models of knowledge domains.,Each representation has its own,advantages,and disadvantages,compared,to the other. There are active initiatives on the representation of knowledge for Web technologies, e.g., RDF (Resource Description Framework), and OWL

R. M. Malyankar; A. Baddam

2003-01-01

104

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

105

Cluster update for tensor network states  

Microsoft Academic Search

We propose a novel recursive way of updating the tensors in projected entangled pair states by evolving the tensor in imaginary time evolution on clusters of different sizes. This generalizes the so- called simple update method of Jiang et al. [Phys. Rev. Lett. 101, 090603 (2008)] and the updating schemes in the single layer picture of Pi\\\\v{z}orn et al. [Phys.

Ling Wang; Frank Verstraete

2011-01-01

106

Characterizations of flowchartable recursions short version  

Microsoft Academic Search

In this paper we give new characterizations for the flowchartability of recursive functionals. The general question of flowchartability is recursively undecidable. We present here an effective map from recursions to representatives for which the question is decidable. The decision provides a good approximation to a characterization for general flowchartability in the following senses: (1) if a representative is flowchartable then

S. A. Walker; H. Raymond Strong

1972-01-01

107

Toward General Analysis of Recursive Probability Models  

Microsoft Academic Search

There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and the fact that computing exact solutions can be intractable for many nonrecursive models. Although inference is undecidable in the general case for recursive problems, several research groups are actively developing computational techniques for recursive stochastic

Daniel Pless; George F. Luger

2001-01-01

108

How Learning Logic Programming Affects Recursion Comprehension  

ERIC Educational Resources Information Center

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

Haberman, Bruria

2004-01-01

109

A Novel Navigation Paradigm for XML Repositories.  

ERIC Educational Resources Information Center

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

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

2002-01-01

110

Get It Together: Integrating Data with XML.  

ERIC Educational Resources Information Center

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

Miller, Ron

2003-01-01

111

Active XML, Security and Access Control  

Microsoft Academic Search

XML and Web services are revolutioning the automatic management of distributed information, somewhat in the same way that HTML, Web browsers and search engines modified human access to world wide information. We argue in this paper that the combination of XML and Web services allows for a novel distributed data management paradigm, where the exchanged information mixes materialized and intensional,

Serge Abiteboul; Omar Benjelloun; Bogdan Cautis; Tova Milo

2004-01-01

112

XMILL: An Efficient Compressor for XML Data  

Microsoft Academic Search

We describe a tool for compressing XML data, with applications in data exchange and archiving, which usually achieves about twice the compression ratio of gzip at roughly the same speed. The compressor, called XMill, incorporates and combines existing compressors in order to apply them to heterogeneous XML data: it uses zlib, the library function for gzip, a collection of datatype

Hartmut Liefke; Dan Suciu

2000-01-01

113

Ontology-Based Secure XML Content Distribution  

NASA Astrophysics Data System (ADS)

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

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

114

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

115

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

116

Integrating Statically Typechecked XML Data Technologies into Pure Java  

Microsoft Academic Search

XML is the de facto standard for exchanging data be- tween aribtrary applications. There are many efforts to in- tegrate XML into object-oriented programming languages reaching from the simple document object model (DOM) to XML class generators or even to the introduction of new programming languages. Another as desired feature as XML is persistency. The integration of persistency into object-oriented

Henrike Schuhart; Beda Christoph Hammerschmidt; Volker Linnemann

2006-01-01

117

Vocabulary Use in XML Standards in the Financial Market Domain  

Microsoft Academic Search

Vocabulary issues are central to XML-based e-commerce standards. The rapid increase in the number of XML standards has made the vocabulary issues a critical area of XML applications. This paper reports the result from a study of the vocabulary use in XML standards. Choosing five DTDs from the financial and capital markets domain, we examined a total of 1346 elements

Jian Qin; Mary D. Taffet

2004-01-01

118

Securing XML Web Services with Elliptic Curve Cryptography  

Microsoft Academic Search

A method to provide secure XML Web services based on elliptic curve cryptography (ECC) is proposed. It adds an XML Web services security component to an existing virtual private network (VPN) gateway to provide integrated security solution for securing both XML Web services and traditional network-based applications. Both the XML Web services security component and the VPN server on the

Ying Liu; Tet H. Yeap; W. O'Brien

2007-01-01

119

Minimal Recursion Semantics: An Introduction  

Microsoft Academic Search

Minimal recursion semantics (MRS) is a framework for computational semantics that is suitable for parsing and generation and\\u000a that can be implemented in typed feature structure formalisms. We discuss why, in general, a semantic representation with\\u000a minimal structure is desirable and illustrate how a descriptively adequate representation with a nonrecursive structure may\\u000a be achieved. MRS enables a simple formulation of

Ann Copestake; Dan Flickinger; Carl Pollard; Ivan A. Sag

2005-01-01

120

General Recursion in Type Theory  

Microsoft Academic Search

In this work, a method to formalise general recursive algorithms in constructive type theory is presented throughout examples.\\u000a The method separates the computational and logical parts of the definitions. As a consequence, the resulting type-theoretic\\u000a algorithms are clear, compact and easy to understand. They are as simple as their equivalents in a functional programming\\u000a language, where there is no restriction

Ana Bove

2002-01-01

121

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

122

Workflow Mediation using VorteXML  

Microsoft Academic Search

Abstract: This paper presentsan original framework for specifying, enacting and supervising e-services on the Web. This framework isbased on XML and rules-based support for products\\/services description and workflow mediation acrossorganizations

Vassilis Christophides; Richard Hull; Akhil Kumar; Jérôme Siméon

2001-01-01

123

XML Document Classification Using Extended VSM  

Microsoft Academic Search

Structured link vector model (SLVM) is a representation recently proposed for modeling XML documents, which was extended from\\u000a the conventional vector space model (VSM) by incorporating document structures. In this paper, we describe the classification\\u000a approach for XML documents based on SLVM and Support Vector Machine (SVM) in INEX 2007 Document Mining Challenge. The experimental\\u000a results on the challenge’s data

Jianwu Yang; Fudong Zhang

2007-01-01

124

Efficient Structural Joins on Indexed XML Documents  

Microsoft Academic Search

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

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

2002-01-01

125

Reformulation of XML Queries and Constraints  

Microsoft Academic Search

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

Alin Deutsch; Val Tannen

2003-01-01

126

An evaluation of binary xml encoding optimizations for fast stream based xml processing  

Microsoft Academic Search

This paper provides an objective evaluation of the performance impacts of binary XML encodings, using a fast stream-based XQuery processor as our representative application. Instead of proposing one binary format and comparing it against standard XML parsers, we investigate the individual effects of several binary encoding techniques that are shared by many proposals. Our goal is to provide a deeper

Roberto J. Bayardo Jr.; Daniel Gruhl; Vanja Josifovski; Jussi Myllymaki

2004-01-01

127

Periodicity analysis of movement recursions.  

PubMed

Many animals adaptively use their environments by adjusting how long and how often they use specific areas of their home range. Whereas questions about residence times have been addressed for a long time, the study of movement recursions has only recently received due interest. A key question concerns the potential periodicity of such recursions, as many potential drivers of movement behaviour such as light, climate or plant-herbivore interactions can be periodic. We propose here to build upon well-established Fourier and wavelet analyses to extract periodic patterns from time-series of presence/absence, arrival or departure from areas of interest, and introduce reliable null models for assessing the statistical significance of the periods detected. We provide an illustrative example which shows how an impala (Aepyceros melampus) expressed periodic use of the main open area of its home range. The significant periods found (12 h using arrival times; 24h, 7 days, and 30 days using presence/absence records) were consistent with a use of this area linked to predation and disturbance, as the area was used more at night, closer to dark moon, and during week-days. Our approach is a further step towards building up a wider analytical framework for the study of movement ecology. PMID:23108209

Riotte-Lambert, Louise; Benhamou, Simon; Chamaillé-Jammes, Simon

2012-10-26

128

Missing data interpolation by recursive filter preconditioning  

Microsoft Academic Search

Missing data interpolation problems can be conveniently preconditioned by recursive in- verse filtering. A helix transform allows us to implement this idea in the multidimensional case. We show with examples that helix preconditioning can give a magnitude-order speedup in comparison with the older methods. In this paper, we show how recursive deconvolution can be applied for preconditioning interpolation problems. We

Sergey Fomel; Robert Clapp; Jon Claerbout

1997-01-01

129

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

130

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

131

Recursive identification of hysteresis in smart materials  

Microsoft Academic Search

This paper studies recursive identification of hysteresis in smart materials. A Preisach operator with a piece-wise uniform density function is used to model the hysteresis. Persistent excitation conditions for parameter convergence are discussed in terms of the input to the Preisach operator. Two classes of recursive identification schemes are explored, one based on the hysteresis output, the other based on

Xiaobo Tan; John S. Baras

2004-01-01

132

Explicit recursivity into reproducing kernel Hilbert spaces  

Microsoft Academic Search

Thispaper presentsa methodologyto developrecursivefilters in reproducing kernel Hilbert spaces (RKHS). Unlike previous approaches that exploit the kernel trick on filtered and then mapped samples, we explicitly define model recursivity in the Hilbert space. The method exploits some properties of functionalanalysis and recursive computation of dot products without the need of pre-imaging. We illustrate the feasibility of the methodology in the

Devis Tuia; Gustavo Camps-Valls; Manel Martinez-Ramon

2011-01-01

133

A Classification of Viruses Through Recursion Theorems  

Microsoft Academic Search

We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essen- tially based on Kleene's second recursion theorem. We show that we can classify viruses as solutions of fixed point equations which are obtained from dierent versions of Kleene's second recursion theorem. This lead us to consider four classes of viruses

Guillaume Bonfante; Matthieu Kaczmarek; Jean-yves Marion

2007-01-01

134

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

135

Higher Type Recursion, Ramification and Polynomial Time  

Microsoft Academic Search

It is shown how to restrict recursion on notation in all finite types so as to characterizethe polynomial time computable functions. The restrictions are obtained by enriching the typestructure with the formation of types !oe, and by adding linear concepts to the lambda calculus.1 IntroductionRecursion in all finite types was introduced by Hilbert [9] and later became known as the

H. Schwichtenberg; K. H Niggl; S. Bellantoni

1999-01-01

136

Time Domain Filter for Recursive Type Signals.  

National Technical Information Service (NTIS)

The patent application relates to a time domain filter which separates one or more recursive pulse signal trains from other signals, pulses or noise, regardless of whether those signals are recursive or not. An object of the invention is to reduce the red...

R. M. Miller J. J. Seti

1976-01-01

137

High-speed recursive digital filter realization  

Microsoft Academic Search

Pipeline techniques have been successfully applied to speeding up processing in both general- and special-purpose digital computers. Application of these techniques to nonrecursive (FIR) filters has been suggested and is quite straightforward. Application to recursive (IIR) filters has not previously been shown. In this paper, the technique for applying pipeline techniques to recursive filters is shown and the advantages and

Herschel H. Loomis; Bhaskar Sinha

1984-01-01

138

Recursive Utility and Preferences for Information  

Microsoft Academic Search

Summary. This paper presents an axiomatic foundation for recursive utility that captures the role of the timing of resolution of uncertainty without relying on exogenously specified objective beliefs. Two main representation results are proved. In the first one, future utility enters the recursion through the type of general aggregators considered in Skiadas (1997a), and as a result the formulation is

Costis Skiadas; J. L. Kellogg

1998-01-01

139

Interpreting XML Documents via an RDF Schema Ontology  

Microsoft Academic Search

Many business documents are represented in XML. However XML only describes the structure of data, not its meaning. The meaning of data is required for advanced automated processing, as is envisaged in the \\

Michel C. A. Klein

2002-01-01

140

Storage and Retrieval of XML Data Using Relational Databases  

Microsoft Academic Search

t Specification schemes for publishingneeded Storage and retrieval of native XML for"document-centric" applications Need to support XML API-s2001 9Architectural Alternatives for_11 Storing Native XML Relational Approach - exploit traditionalbenefits of databases Other Architectures (,not discussed) File Systems Native semistructured store e.g. eXcelon, LORE, NATIX2001 105Rationale for Relational_11 Representation for Native XM_I: Relational and native XML data can...

Surajit Chaudhuri; Kyuseok Shim

2001-01-01

141

Evaluation Techniques for Generalized Path Pattern Queries on XML Data  

Microsoft Academic Search

Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms\\u000a for this operation focus almost exclusively on path patterns or tree patterns. Current applications of XML require querying\\u000a of data whose structure is complex or is not fully known to the user, or integrating XML data sources with different structures.\\u000a These

Xiaoying Wu; Dimitri Theodoratos; Stefanos Souldatos; Theodore Dalamagas; Timos K. Sellis

2010-01-01

142

Towards Secure Content Based Dissemination of XML Documents  

Microsoft Academic Search

Collaborating on complex XML data structures is a nontrivial task in domains such as the public sector,healthcare or engineering. Specifically, providing scalable XML content dissemination services in a selective and secure fashion is a challenging task. This paper describes a publish\\/subscribe middleware infrastructure to achieve a content-based dissemination of XML documents. Our approach relies on the dissemination of XML documents

Mohammad Ashiqur Rahaman; Henrik Plate; Yves Roudier; Andreas Schaad

2009-01-01

143

XML Schema Element Similarity Measures: A Schema Matching Context  

NASA Astrophysics Data System (ADS)

In this paper, we classify, review, and experimentally compare major methods that are exploited in the definition, adoption, and utilization of element similarity measures in the context of XML schema matching. We aim at presenting a unified view which is useful when developing a new element similarity measure, when implementing an XML schema matching component, when using an XML schema matching system, and when comparing XML schema matching systems.

Algergawy, Alsayed; Nayak, Richi; Saake, Gunter

144

XR-Tree: Indexing XML Data for Efficient Structural Joins  

Microsoft Academic Search

XML documents are typically queried with a combina- tion of value search and structure search. While querying by values can leverage traditional database technologies, evaluating structural relationship, specically parent-child or ancestor-descendant relationship, between XML element sets has imposed a great challenge on efcient XML query processing. This paper proposes XR-tree, namely, XML Region Tree, which is a dynamic external memory

Haifeng Jiang; Hongjun Lu; Wei Wang; Beng Chin Ooi

2003-01-01

145

Mapping Rules to Convert from ODL to XML-SCHEMA  

Microsoft Academic Search

As new standards for technology specifications related to XML are unveiled, and stable tools to implement them become available, the widespread usage of XML as a universal format for data exchange between heterogeneous systems (using the Internet), will increasingly become a reality. Therefore, in order to deal efficiently with the large amounts of XML data that will be generated in

Artur Afonso De Sousa; José Luís Pereira; João Alvaro Carvalho

2002-01-01

146

System RX: one part relational, one part XML  

Microsoft Academic Search

This paper describes the overall architecture and design aspects of a hybrid relational and XML database system called System RX. We believe that such a system is fundamental in the evolution of enterprise data management solutions: XML and relational data will co-exist and complement each other in enterprise solutions. Furthermore, a successful XML repository requires much of the same infrastructure

Kevin S. Beyer; Roberta J. Cochrane; Vanja Josifovski; Jim Kleewein; George Lapis; Guy M. Lohman; Bob Lyle; Fatma Özcan; Hamid Pirahesh; Normen Seemann; Tuong C. Truong; Bert Van der Linden; Brian Vickery; Chun Zhang

2005-01-01

147

Efficient Complex Query Support for Multiversion XML Documents  

Microsoft Academic Search

Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML data (e.g., regular path expressions, structural projections, DIFF queries). In this paper, we examine the problem of supporting efficiently complex queries on multiversioned XML documents. Our approach relies on a scheme based on durable

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

2002-01-01

148

Implementing a database programming language for XML applications  

Microsoft Academic Search

There is an emerging amount of software for generating, manipulating and storing XML documents, which remain valid according to a given DTD or an XML Schema. Common solutions are often based on the W3C's Document Object Model (DOM), which has evolved to an important collection of language independent interfaces allowing to represent and manipulate any single XML document. Databases containing

Henrike Schuhart; Volker Linnemann

2005-01-01

149

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

150

Using XML as a flexible, portable test script language  

Microsoft Academic Search

This paper describes the objectives, rationale, implementation and benefits of using Extensible Markup Language (XML) as a test script language in support of a variety of US Army weapon systems. XML provides the ability to implement a simple, flexible, controllable and portable test script language. The use of third party XML parsing and development tools results in decreased test script

D. J. Johnson; P. Roselli

2003-01-01

151

An XML-Based Lightweight C++ Fact Extractor  

Microsoft Academic Search

A lightweight fact extractor is presented that utilizes XML tools, such as XPath and XSLT, to extract static information from C++ source code programs. The source code is first converted into an XML representation, srcML, to facilitate the use of a wide variety of XML tools. The method is deemed lightweight because only a partial parsing of the source is

Michael L. Collard; Huzefa H. Kagdi; Jonathan I. Maletic

2003-01-01

152

[XML/MathML version of above paper by Sevian  

NASA Astrophysics Data System (ADS)

An XML/MathML version of A. R. Sevian's recent article [J. Opt. Netw. 6, 144 (2003)] is provided as an alternative (and experimental) format for online viewing. View the XML/MathML file. The "View Full Text" link below references a PDF file with additional information on XML/MathML technology and its relevance to scientific publishing.

Sevian, A. R.

2003-06-01

153

eXist: An Open Source Native XML Database  

Microsoft Academic Search

With the advent of native and XML enabled database systems, tech- niques for efficiently storing, indexing and querying large collections of XML documents have become an important research topic. This paper presents the storage, indexing and query processing architecture of eXist, an Open Source native XML database system. eXist is tightly integrated with existing tools and covers most of the

Wolfgang Meier

2002-01-01

154

Structural Joins: A Primitive for Efficient XML Query Pattern Matching  

Microsoft Academic Search

XML queries typically specify patterns of selection pred- icates on multiple elements that have some specified tree structured relationships. The primitive tree structured re- lationships are parent-child and ancestor-descendant, and finding all occurrences of these relationships in an XML database is a core operation for XML query processing. In this paper, we develop two families of structural join algorithms for

Shurug Al-khalifa; H. V. Jagadish; Jignesh M. Patel; Yuqing Wu; Nick Koudas; Divesh Srivastava

2002-01-01

155

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

156

Systolic MVDR beamforming with inverse updating  

NASA Astrophysics Data System (ADS)

A stable alternative is described for the 'standard' systolic MVDR (minimum variance distortionless response) beamforming algorithm of McWhirter and Shepherd (1986), which is shown to be numerically unstable. This alternative algorithm is similar to covariance-type recursive least squares algorithms that employ 'inverse updating'. Required a posteriori residuals for updating are computed from the stored inverse matrix together with the Kalman gain vector. The beamforming problem is shown to fit on a systolic array for inverse updating.

Moonen, M.

1993-06-01

157

A recursive digital differentiator for ECG preprocessing.  

PubMed

A simple recursive digital low-pass differentiator is derived from a classical lossless resonator model. It is shown that the error behaviour of the proposed differentiator is more uniformly distributed with respect to an ideal differentiator than that of a typical non-recursive digital low-pass differentiator widely used in electrocardiogram processing. The recursive digital low-pass differentiator is implemented in the form of a correlation receiver model suitable for QRS detection. Three-cycle single-lead ECG test data are used to demonstrate low-pass filtering, baseline drift suppression, and R-wave detection. PMID:7952659

Ebenezer, D; Papa, F F

1994-07-01

158

DIR** XML 2 - unambiguous access to XML-based business documents in B2B e-commerce  

Microsoft Academic Search

XML-based vocabularies have become more and more popular in application-to-application exchanges. Like traditional EDI standards, XML-based formats require an additional agreement on rules to access XML-based data structures. It is our goal to define a machine-readable format for these agreements to accompany XML DTDs or schemas. We present our approach by using a simplified state machine to define access rules.

Christian Huemer

2001-01-01

159

Quantum Lower Bound for Recursive Fourier Sampling  

Microsoft Academic Search

One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algorithm is not far from optimal. The moral is that the need to \\

Scott Aaronson

2002-01-01

160

Background Subtraction in Video Using Recursive Mixture Models, Spatio-Temporal Filtering and Shadow Removal  

Microsoft Academic Search

We describe our approach to segmenting moving objects from the color video data supplied by a nominally stationary camera.\\u000a There are two main contributions in our work. The first contribution augments Zivkovic and Heijden’s recursively updated Gaussian\\u000a mixture model approach, with a multi-dimensional Gaussian kernel spatio-temporal smoothing transform. We show that this improves\\u000a the segmentation performance of the original approach,

Zezhi Chen; Nick Pears; Michael Freeman; Jim Austin

2009-01-01

161

Recursive utility and preferences for information  

Microsoft Academic Search

Summary.   This paper presents an axiomatic foundation for recursive utility that captures the role of the timing of resolution of uncertainty\\u000a without relying on exogenously specified objective beliefs. Two main representation results are proved. In the first one,\\u000a future utility enters the recursion through the type of general aggregators considered in Skiadas (1997a), and as a result\\u000a the formulation is

Costis Skiadas

1998-01-01

162

Quantification of Gas Mixtures with Active Recursive Estimation  

NASA Astrophysics Data System (ADS)

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

Gosangi, Rakesh; Gutierrez-Osuna, Ricardo

2011-09-01

163

Recursive identification of lung parameters.  

PubMed

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

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

1989-06-01

164

Implementing Distributed Workflow Systems from XML Specifications  

Microsoft Academic Search

In enterprise-wide distributed workflow, multiple users co op- erate towards some common goal following predefined task specifications. This paper presents an approach for constru ct- ing a distributed workflow system starting from its XML spec- ification in terms of various participants' roles, access ri ghts based on roles, shared objects, operations, and workflow con - straints. The specifications are integrated

Anand R. Tripathi; Tanvir Ahmed; Vineet Kakani; Shremattie Jaman

2000-01-01

165

XML zapis japonsko-slovenskega slovarja  

Microsoft Academic Search

In this paper we present the implementation of an XML encoding for a hypertext dictionary of Japanese lexical units for Slovene students of Japanese at the Faculty of Arts of Ljubljana University. The dictionary is planned as a long-term project in which a simple dictionary is to be gradually enlarged and enhanced, taking into account the needs of the students.

Toma Erjavec; Kristina Hmeljak Sangawa

166

XSEarch: A Semantic Search Engine for XML  

Microsoft Academic Search

XSEarch, a semantic search engine for XML, is presented. XSEarch has a simple query lan- guage, suitable for a naive user. It returns se- mantically related document fragments that satisfy the user's query. Query answers are ranked using extended information-retrieval techniques and are generated in an order sim- ilar to the ranking. Advanced indexing tech- niques were developed to facilitate

Sara Cohen; Jonathan Mamou; Yaron Kanza; Yehoshua Sagiv

2003-01-01

167

An XML model for electronic services  

Microsoft Academic Search

With the need for electronic services to be developed and deployed more and more rapidly, it is imperative that concrete models of electronic services are developed, to facilitate systematic work of electronic service stakeholders, concrete semantics and coherent representations across services developed within an organisation. Using the XML language to develop such a model, offers a number of additional advantages,

Costas Vassilakis; George Lepouras; Constantin Halatsis; Tomás Pariente Lobo

2005-01-01

168

Xquery 1. 0: an xml query language  

Microsoft Academic Search

The World Wide Web Consortium has convened a working group to design a query language for Extensible Markup Language (XML) data sources. This new query language, called XQuery, is still evolving and has been described in a series of drafts published by the working group. XQuery is a functional language comprised of several kinds of expressions that can be nested

D. Chamberlin; J. Clark; D. Florescu; J. Robie; M. Stefanescu

2001-01-01

169

XML Format for SESAME and LEOS.  

National Technical Information Service (NTIS)

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

J. K. Durrenberger J. R. Neely P. A. Sterne

2009-01-01

170

XGRIND: A Query-Friendly XML Compressor  

Microsoft Academic Search

Abstract: XML documents are extremely verbose since the"schema" is repeated for every "record" in the document.While a variety of compressors are available to address thisproblem, they are not designed to support direct querying ofthe compressed document, a useful feature from a databaseperspective. In this paper, we propose a new compressiontool called XGrind, that directly supports queries in thecompressed domain. A

Pankaj M. Tolani; Jayant R. Haritsa

2002-01-01

171

XML components ranking : Which relevant ranking criteria ? Which relevant criteria merging ?  

Microsoft Academic Search

Retrieving specific information becomes an important issue, especially in XML information retrieval (XML-IR). Indexing XML components (elements) rather than the entire XML document allows to target more effectively the relevant elements. In this paper, we consider the problem of ranking the relevant components returned in response to a user query. As opposed to ranking documents, ranking XML elements introduces new

F. Abbaci; P. Francq

2008-01-01

172

An adaptive, fast, and safe XML parser based on byte sequences memorization  

Microsoft Academic Search

XML (Extensible Markup Language) processing can incur significant runtime overhead in XML-based infrastructural middleware such as Web service application servers. This paper proposes a novel mechanism for efficiently processing similar XML documents. Given a new XML document as a byte sequence, the XML parser proposed in this paper normally avoids syntactic analysis but simply matches the document with previously processed

Toshiro Takase; Hisashi MIYASHITA; Toyotaro Suzumura; Michiaki Tatsubori

2005-01-01

173

The Research on data semantic description framework using RDF\\/XML  

Microsoft Academic Search

This paper gives a framework of data semantic description using RDF\\/XML. The paper first clarifies the Junctions and characters of XML and RDF, especially the XML Schema and RDF Schema which are important to the framework to put forward. Subsequently ,it proposes the RDF\\/XML data semantic description framework. In succession, solutions are brought forward to combine the XML Schema and

Ying Ding; Chunlan Wang; Maoguang Wang

2005-01-01

174

Pipeline architectures for recursive morphological operations.  

PubMed

Introduces efficient pipeline architectures for the recursive morphological operations. The standard morphological operation is applied directly on the original input image and produces an output image. The order of image scanning in which the operator is applied to the input pixels is irrelevant. However, the intent of the recursive morphological operations is to feed back the output at the current scanning pixel to overwrite its corresponding input pixel to be considered into computation at the following scanning pixels. The resultant output image by recursive morphology inherently depends on the image scanning sequence. Two pipelined implementations of the recursive morphological operations are presented. The design of an application-specific systolic array is first introduced. The systolic array uses 3 n cells to process an nxn image in 6 n-2 cycles. The cell utilization rate is 100%. Second, a parallel program implementing the recursive morphological operations and running on distributed-memory multicomputers is described. Performance of the program can be finely tuned by choosing appropriate partition parameters. PMID:18289955

Shih, F Y; King, C T; Pu, C C

1995-01-01

175

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

NASA Astrophysics Data System (ADS)

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

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

176

Clustering XML Documents Using Frequent Subtrees  

NASA Astrophysics Data System (ADS)

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

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

177

XML-based communication protocols for WebGIS  

Microsoft Academic Search

Aimed at the features of complex objects and massive data transmission, a new XML-based method to design and implement communication protocols for WebGIS is presented. The paper illustrates the mechanism in designing communication protocols following W3C's XML Schema specification, as well as provides main flow to embed them into WebGIS by packing and parsing XML-based protocols. This kind of protocol

Luo Yingwei; Liu Xinpeng; Wang Xiaolin; Xu Zhuoqun

2003-01-01

178

What Do Users Think of an XML Element Retrieval System?  

Microsoft Academic Search

We describe the University of Amsterdam's participation in the INEX 2005 Interactive Track, mainly focusing on a comparative ex- periment, in which the baseline system Daffodil\\/HyREX is compared to a home-grown XML element retrieval system (xmlfind). The xmlfind system provides an interface for an XML information retrieval search engine, using an index that contains all the individual XML elements in

Jaap Kamps; Börkur Sigurbjörnsson

2005-01-01

179

SSRS - An XML Information Retrieval System  

Microsoft Academic Search

In this paper, a novel XML information retrieval system is proposed. It supports our extended IR language, which integrates\\u000a our notion of relevance scoring. We develop the inverted index structure, which can efficiently term and phrase search. A\\u000a novel scoring method is also presented to filter the irrelevant nodes. As our system supports two kinds of formats for the\\u000a returning

Zhongming Han; Wenzheng Li; Mingyi Mao

2007-01-01

180

The Method of Recursive Counting: Can one go further?  

SciTech Connect

After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method`s limitations.

Creutz, M. [Brookhaven National Lab., Upton, NY (United States); Horvath, I. [Brookhaven National Lab., Upton, NY (United States)]|[Rochester Univ., NY (United States). Dept. of Physics; Mendris, R. [Slovak Technical Univ., Bratslava, (Slovakia)

1993-12-01

181

Recursive Subspace Identification Based on Principal Component Analysis  

Microsoft Academic Search

The problem of recursive subspace identification of state-space models is considered in this paper. A new recursive algorithm based on SA-PCA (stochastic approximation-principal component analysis) is proposed to estimate a basis of the extended observability matrix in the noise-free case. Besides, a recursive algorithm based on RLS (Recursive Least-Squares) is proposed to estimate the system matrices. The algorithm is evaluated

Yue-Ping Jiang; Hai-Tao Fang

2006-01-01

182

Recursive stochastic subspace identification for structural parameter estimation  

NASA Astrophysics Data System (ADS)

Identification of structural parameters under ambient condition is an important research topic for structural health monitoring and damage identification. This problem is especially challenging in practice as these structural parameters could vary with time under severe excitation. Among the techniques developed for this problem, the stochastic subspace identification (SSI) is a popular time-domain method. The SSI can perform parametric identification for systems with multiple outputs which cannot be easily done using other time-domain methods. The SSI uses the orthogonal-triangular decomposition (RQ) and the singular value decomposition (SVD) to process measured data, which makes the algorithm efficient and reliable. The SSI however processes data in one batch hence cannot be used in an on-line fashion. In this paper, a recursive SSI method is proposed for on-line tracking of time-varying modal parameters for a structure under ambient excitation. The Givens rotation technique, which can annihilate the designated matrix elements, is used to update the RQ decomposition. Instead of updating the SVD, the projection approximation subspace tracking technique which uses an unconstrained optimization technique to track the signal subspace is employed. The proposed technique is demonstrated on the Phase I ASCE benchmark structure. Results show that the technique can identify and track the time-varying modal properties of the building under ambient condition.

Chang, C. C.; Li, Z.

2009-03-01

183

Theory of recursive nuclear band spectra  

SciTech Connect

We first give a brief review of our earlier empirical work on parameter-free difference equations for nuclear spectra and discuss some of the implications. Then we show that a simple quantum mechanical model is capable of explaining and improving our previously suggested recursion relations.

Buck, B.; Merchant, A. C. [Department of Physics, University of Oxford, Theoretical Physics, 1 Keble Road, Oxford OX1 3NP (United Kingdom); Perez, S. M. [Department of Physics, University of Cape Town, Private Bag, Rondebosch 7700 (South Africa); iThemba LABS, P.O. Box 722, Somerset West 7129 (South Africa)

2010-03-15

184

Recursion Engineering for Reduction Incorporated Parsers  

Microsoft Academic Search

Reduction Incorporated (RI) recognisers and parsers deliver high performance by suppressing the stack activity except for those rules that generate fully embedded recursion. Automaton constructions for RI parsing have been presented by Aycock and Horspool [John Aycock and Nigel Horspool. Faster generalised LR parsing. In Compiler Construction, 8th Intnl. Conf, CC'99, volume 1575 of Lecture Notes in Computer Science, pages

Adrian Johnstone; Elizabeth Scott

2005-01-01

185

Evaluating and Improving Recursive Descent Parsers  

Microsoft Academic Search

Time formulas are symbolic formulas which express the execution time of a program as a function of its input data and of variables representing the time to execute individual operations (e.g., push, pop, transfer, etc.). It is shown that in many cases the time formulas for recursive descent parsers may be generated automatically by a simple inspection of the parser

Jacques Cohen; Robin Sitver; David Auty

1979-01-01

186

The tree equivalence of linear recursion schemes  

Microsoft Academic Search

Abstract: In the paper, a complete system of transformation rules preserving thetree equivalence and a polynomial-time algorithm deciding the tree equivalenceof linear polyadic recursion schemes are proposed. The algorithm isformulated as a sequential transformation process which brings togetherthe schemes in question. In the last step, the tree equivalence problemfor the given schemes is reduced to a global flow analysis problem

Viktor K. Sabelfeld

2000-01-01

187

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

188

Attitude tracking control using recursive passivation technique  

Microsoft Academic Search

The main problem addressed is the attitude tracking control of a rigid satellite. A nonlinear feedback control scheme is presented, based on recursive passivation through backstepping. The control structure designed consists of PID-like feedback plus some feedforward terms, which achieves enhancing the tracking performance by compensating for the plant dynamics. Quaternion attitude representation, which is four-parameter and void of singularity

Boqi Xi; Guoxing Yi; Bochang Shen

2006-01-01

189

Recursive GPR for nonlinear dynamic process modeling  

Microsoft Academic Search

With its added features in the measurement of confidence, and lower demands on the training parameters, the Gaussian process regression (GPR) model has been shown to be a powerful dynamic process model for nonlinear dynamic systems. The authors have developed a recursive GPR model which effectively tracks process dynamics in both sample-wise and block-wise manners. By incorporating an appropriate bias

Wangdong Ni; Soon Keat Tan; Wun Jern Ng

2011-01-01

190

The Principle of Recursive Genome Function  

Microsoft Academic Search

Responding to an open request, the principle of recursive genome function (PRGF) is put forward, effectively reversing two axioms of genomics as we used to know it, prior to the Encyclopedia of DNA Elements Project (ENCODE). The PRGF is based on the reversal of the interlocking but demonstrably invalid central dogma and \\

ANDRÁS J. PELLIONISZ

2008-01-01

191

New recursive methods for scan statistic probabilities  

Microsoft Academic Search

Glaz and Naus (1991) and Naus (1982) developed tight bounds and sharp approximations for the distribution of the maximum of moving sums of independent and identically distributed integer-valued random variables. These distributions are of importance in a wide variety of applications. To apply the bounds and approximations certain quantities need to be evaluated. We derive new recursive methods to compute

Vatsala V. Karwe; Joseph I. Naus

1997-01-01

192

Logo Recognition by Recursive Neural Networks  

Microsoft Academic Search

In this paper we propose an adaptive model, referred to as Recursive Neural Networks (RRNNs) for logo recognition by explicitly conveying logo item into -ary tree represen- tation, where symbolic and sub-symbolic information coexist. Each node in the contour- tree is associated with an exterior or interior contour extr acted from the logo instance. A feature vector, which includes the

Enrico Francesconi; Paolo Frasconi; Marco Gori; Simone Marinai; Jianqing Sheng; Giovanni Soda; Alessandro Sperduti

1997-01-01

193

Panjer recursion versus FFT for compound distributions  

Microsoft Academic Search

Numerical evaluation of compound distributions is an important task in insurance mathematics and quantitative risk management.\\u000a In practice, both recursive methods as well as transform based techniques are widely used. We give a survey of these tools,\\u000a point out the respective merits and provide some numerical examples.

Paul Embrechts; Marco Frei

2009-01-01

194

Computational Foundations of Basic Recursive Function Theory  

Microsoft Academic Search

The theory of computability, or basic recursive function theory as it is often called, is usually motivated and developed using Church's Thesis. Here we show that there is an alternative computability theory in which some of the basic results on unsolvability become more absolute, results on completeness become simpler, and many of the central concepts become more abstract. In this

Robert L. Constable; Scott Fraser Smith

1988-01-01

195

CHILDREN'S MENTAL MODELS OF RECURSIVE LOGO PROGRAMS  

Microsoft Academic Search

Children who had a year of Logo programming experience were asked to think- aloud about what brief Logo recursive programs will do, and then to predict with a hand-simulation of the programs what the Logo graphics turtle will draw when the program is executed. If discrepancies arose in this last phase, children were asked to explain them. A prevaient but

D. MlDlAN KURLAND; ROY D. PEA

1983-01-01

196

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

197

Pedro: a configurable data entry tool for XML  

Microsoft Academic Search

Summary: Pedro is a Java™ application that dynamically gen- erates data entry forms for data models expressed in XML Schema, producing XML data files that validate against this schema. The software uses an intuitive tree-based navigation system, can supply context-sensitive help to users and fea- tures a sophisticated interface for populating data fields with terms from controlled vocabularies. The software

Kevin L. Garwood; Chris F. Taylor; Kai J. Runte; Andy Brass; Stephen G. Oliver; Norman W. Paton

2004-01-01

198

XRules: an effective structural classifier for XML data  

Microsoft Academic Search

XML documents have recently become ubiquitous because of their varied applicability in a number of applications. Classification is an important problem in the data mining domain, but current classification methods for XML documents use IR-based methods in which each document is treated as a bag of words. Such techniques ignore a significant amount of information hidden inside the documents. In

Mohammed Javeed Zaki; Charu C. Aggarwal

2003-01-01

199

EquiX-A Search and Query Language for XML.  

ERIC Educational Resources Information Center

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

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

2002-01-01

200

Adaptive Processing of Top-K Queries in XML  

Microsoft Academic Search

The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efciency of top-k query evaluation relies on using scores to prune irrelevant answers as early as possible in the evaluation process. In this context, evalu- ating the same query plan for all answers might be too rigid because,

Amélie Marian; Sihem Amer-yahia; Nick Koudas; Divesh Srivastava

2005-01-01

201

Effective keyword search for valuable lcas over xml documents  

Microsoft Academic Search

In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valu- able Lowest Common Ancestor (VLCA) to accurately and effec- tively answer keyword queries over XML documents. We then propose the concept of Compact VLCA (CVLCA) and compute the meaningful compact connected trees rooted as CVLCAs as the answers

Guoliang Li; Jianhua Feng; Jianyong Wang; Lizhu Zhou

2007-01-01

202

XML Benchmarking - the State of the Art and Possible Enhancements  

Microsoft Academic Search

Since XML technologies have become a standard for data representation, numerous methods for processing XML data emerge every day. Consequently, it is necessary to compare the newly proposed methods with the existing ones, as well as analyze the effect of a particular method when applied to various types of data. In this chapter, we provide an overview of existing approaches

203

XML — an opportunity for data standards in the geosciences  

Microsoft Academic Search

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

Simon W Houlding

2001-01-01

204

TEI P5 as an XML Standard for Treebank Encoding  

Microsoft Academic Search

The aim of the paper is to show that a subset of Text Encoding Initiative Guidelines is a reasonable choice as a standard for stand-off XML encoding of syntactically annotated corpora. The proposed TEI schema — actually employed in the National Corpus of Polish — is compared to other such candidate standards, including TIGER-XML, SynAF and PAULA.

Adam Przepiórkowski

205

Efficient Relational Storage and Retrieval of XML Documents  

Microsoft Academic Search

In this paper, we present a data and an execution model that allow for efficient storage and retrieval of XML documents in a relational database. The data model is strictly based on the notion of binary associations: by decomposing XML documents into small, flexible and semantically homogeneous units we are able to exploit the performance potential of vertical fragmentation. Moreover,

Albrecht Schmidt; Martin L. Kersten; Menzo Windhouwer; Florian Waas

2000-01-01

206

Storing and Querying Multiversion XML Documents using Durable Node Numbers  

Microsoft Academic Search

Managing multiple versions of XML documents repre- sents an important problem for many traditional applica- tions, such as software configuration control, as well as new ones, such as link permanenceof web documents. Research on managing multiversion XML documentsseeks to provide efficient and robust techniques for storing, retrieving and querying such documents. In this paper, we present a novel approach to

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

2001-01-01

207

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

208

A bottom-up approach for XML documents classification  

Microsoft Academic Search

Extensible Markup Language (XML) is a simple and flexible text format derived from SGML [1]. It has been widely accepted as one of the crucial components in many information retrieval related applications, such as XML databases, web services, etc. One of the reasons for its wide acceptance is its customized format during data transmission or data storage. Classification is an

Junwei Wu; Jian Tang

2008-01-01

209

Pre-matching: Large XML Schemas Decomposition Approach  

NASA Astrophysics Data System (ADS)

We propose a decomposition approach, as a pre-matching phase, which break down large XML schemas into smaller sub-schemas to improve the quality of large schema matching. Our approach identifies and extracts common structures between and within XML schemas (inter and intra-schemas) and finds the sub-schemas candidates for matching.

Sellami, Sana; Benharkat, Aïcha-Nabila; Amghar, Youssef

210

The Semantic Web: The Roles of XML and RDF  

Microsoft Academic Search

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

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

2000-01-01

211

XML for Libraries, Archives, and Museums: The Project Covax  

Microsoft Academic Search

The purpose of COVAX is to analyze and create the technical solutions required to provide access through the Internet to homogeneously-encoded document descriptions of archive, library, and museum collections based in the application of XML. This paper describes the development of the project, and the main achievements in building an information system of distributed XML databases containing document descriptions from

Francisca Hernández; Carlos Wert; Ignacio Recio; Begoña Aguilera; Walter Koch; Martin Bogensperger; Peter Linde; Georg Günter; Bob Mulrenin; Xavier Agenjo; Robin Yeates; Luciana Bordoni; Fabrizio Poggi

2003-01-01

212

A Prime Number Labeling Scheme for Dynamic Ordered XML Trees  

Microsoft Academic Search

Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the element nodes such that the relationships between nodes can be easily determined by comparing their labels. With the increased popularity of XML on the Web, finding a labeling scheme that is able to

Xiaodong Wu; Mong-li Lee; Wynne Hsu

2004-01-01

213

FLUX: fuzzy content and structure matching of XML range queries  

Microsoft Academic Search

Range queries seek the objects residing in a constrained re- gion of the data space. An XML range query may impose predicates on the numerical or textual contents of the el- ements and\\/or their respective path structures. In order to handle content and structure range queries efficiently, an XML query processing engine needs to incorporate effective indexing and summarization techniques

Hua-gang Li; S. Alireza Aghili; Divyakant Agrawal; Amr El Abbadi

2006-01-01

214

A fuzzy XML database system: Data storage and query processing  

Microsoft Academic Search

Fuzzy logic reflects human nature to express and evaluate the world in a vague manner. This paper describes our approach to incorporate fuzzy logic into XML database systems. The system was built on top of traditional XML databases, while allows the storage of fuzzy data as well as crisp data. The paper describes the structure of the system, starting with

Ying Jin; Sangeetha Veerappan

2010-01-01

215

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

ERIC Educational Resources Information Center

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

Chang, Naicheng; Huang, Yuhui; Hopkinson, Alan

2011-01-01

216

A comprehensive solution to the XML-to-relational mapping problem  

Microsoft Academic Search

The use of relational database management systems (RDBMSs) to store and query XML data has attracted considerable interest with a view to leveraging their powerful and reliable data management services. Due to the mismatch between the relational and XML data models, it is necessary to first shred and load the XML data into relational tables, and then btranslate XML queries

Sihem Amer-Yahia; Fang Du; Juliana Freire

2004-01-01

217

A workload-aware approach for optimizing the XML schema design trade-off  

Microsoft Academic Search

In general, the design of XML schemas involves translating conceptual schemas into XML schemas which aim to be: (i) normalized schemas, and (ii) connected structures in order to achieve good performance on queries. However, these requirements address a trade-off because highly connected XML structures allow data redundancy, and normalized schemas generate disconnected XML structures. This paper describes a workload-based approach

Rebeca Schroeder; Denio Duarte; Ronaldo S. Mello

2011-01-01

218

Optimizing the Execution Time for Checking the Consistency of XML Documents  

Microsoft Academic Search

The problem of checking the consistency of the semantics associated with extensible markup language (XML) documents is considered. We propose a novel technique to add semantics to XML documents by attaching semantic information to the XML element tag attributes. We call this XML semantics. This approach is based on the same concept of attribute grammars (AGs), attaching and checking static

Yasser Kotb; Katsuhiko Gondow; Takuya Katayama

2004-01-01

219

XCG: A one-to-one class generator for XML languages  

Microsoft Academic Search

High-level XML integration into object oriented programming languages becomes more and more important for the development of web applications. In this paper we present a new XML Class Generator for Java (XCG), which transforms XML language descriptions like DTDs into an equivalent framework of Java classes and interfaces preserving the structure of XML elements. Moreover we present measurements demonstrating the

Henrike Schuhart; Martin Lipphardt; Volker Linnemann

2005-01-01

220

Automatic recursion engineering of reduction incorporated parsers  

Microsoft Academic Search

Reduction Incorporated (RI) parsers deliver high performance by suppressing the stack activity except for those rules that generate embedded recursion. Automaton constructions for RI parsing have been presented by Aycock and Horspool [J. Aycock, N. Horspool, Faster generalised LR parsing, in: Compiler Construction, 8th Intnl. Conf, CC’99, in: Lecture Notes in Computer Science, vol. 1575, Springer-Verlag, 1999, pp. 32–46] and

Adrian Johnstone; Elizabeth Scott

2007-01-01

221

Recursive estimation for CAD model recovery  

Microsoft Academic Search

We describe a system for semiautomatically extracting 3-D object models from raw, uncalibrated video. The system utilizes a recursive estimator to accurately recover camera motion, point-wise structure, and camera focal length. Recovered 3-D points are used to compute a piecewise-smooth surface model for the object. Recovered motion and camera geometry are then used along with the original video to texture

Ali J. Azarbayejani; Tinsley Galyean; Bradley Horowitz; Alex Pentland

1994-01-01

222

Recursiveness in Matrix Rational Interpolation Problems  

Microsoft Academic Search

We consider the problem of computing solutions to a variety of matrix rational interpolationproblems. These include the partial realization problem for matrix power series andNewton-Pad'e, Hermite-Pad'e, Simultaneous Pad'e, M-Pad'e and multipoint Pad'e approximationproblems along with their matrix generalizations. A general recurrence relation is givenfor solving these problems. Unlike other previous recursive methods, our recurrence worksalong arbitrary computational paths. When...

Bernhard Beckermann; George Labahn

1996-01-01

223

Recursiveness in matrix rational interpolation problems  

Microsoft Academic Search

We consider the problem of computing solutions to a variety of matrix rational interpolation problems. These include the partial realization problem for matrix power series and Newton-Padé, Hermite-Padé, simultaneous Padé, M-Padé and multipoint Padé approximation problems along with their matrix generalizations. A general recurrence relation is given for solving these problems. Unlike other previous recursive methods, our recurrence works along

Bernhard Beckermann; George Labahn

1997-01-01

224

Dual unbounded nondeterminacy, recursion, and fixpoints  

Microsoft Academic Search

In languages with unbounded demonic and angelic nondeterminacy, functions acquire a surprisingly rich set of fixpoints. We\\u000a show how to construct these fixpoints, and describe which ones are suitable for giving a meaning to recursively defined functions.\\u000a We present algebraic laws for reasoning about them at the language level, and construct a model to show that the laws are\\u000a sound.

Joseph M. Morris; Malcolm Tyrrell

2007-01-01

225

Generation of efficient parsers through direct compilation of XML Schema grammars  

Microsoft Academic Search

With the widespread adoption of SOAP and Web services, XML-based processing, and parsing of XML documents in particular, is becoming a performance-critical aspect of business computing. In such scenarios, XML is often constrained by an XML Schema grammar, which can be used during parsing to improve performance. Although traditional grammar-based parser generation techniques could be applied to the XML Schema

Eric Perkins; Morris Matsa; Margaret Gaitatzes Kostoulas; Abraham Heifets; Noah Mendelsohn

2006-01-01

226

Recursive regularization for inferring gene networks from time-course gene expression profiles  

PubMed Central

Background Inferring gene networks from time-course microarray experiments with vector autoregressive (VAR) model is the process of identifying functional associations between genes through multivariate time series. This problem can be cast as a variable selection problem in Statistics. One of the promising methods for variable selection is the elastic net proposed by Zou and Hastie (2005). However, VAR modeling with the elastic net succeeds in increasing the number of true positives while it also results in increasing the number of false positives. Results By incorporating relative importance of the VAR coefficients into the elastic net, we propose a new class of regularization, called recursive elastic net, to increase the capability of the elastic net and estimate gene networks based on the VAR model. The recursive elastic net can reduce the number of false positives gradually by updating the importance. Numerical simulations and comparisons demonstrate that the proposed method succeeds in reducing the number of false positives drastically while keeping the high number of true positives in the network inference and achieves two or more times higher true discovery rate (the proportion of true positives among the selected edges) than the competing methods even when the number of time points is small. We also compared our method with various reverse-engineering algorithms on experimental data of MCF-7 breast cancer cells stimulated with two ErbB ligands, EGF and HRG. Conclusion The recursive elastic net is a powerful tool for inferring gene networks from time-course gene expression profiles.

Shimamura, Teppei; Imoto, Seiya; Yamaguchi, Rui; Fujita, Andre; Nagasaki, Masao; Miyano, Satoru

2009-01-01

227

Recursive one-sided algorithm for subspace projection beamforming  

NASA Astrophysics Data System (ADS)

A recursive algorithm is described which performs approximate numerical rank estimation and subspace-projection of the least squares weight vector. Although it appears to work well in practice, being based upon a one-sided rank-revealing QR factorization, it lacks a formal guarantee to reveal the rank and it is more approximate than URV or Chan's rank-revealing QR factorization. However, it may be implemented very simply, requires little additional computation and, being based upon QR, it is able to exploit the established and numerically sound architecture of the Gentleman-Kung QRD-based RLS algorithm. It is implemented by redefining the cells in the array and performing additional updates so that the R matrix which is stored at any time approximates that which would be obtained for the QR factorization of the projected data matrix. Thus, the projected least-squares residual is output directly from the array and the projected weight vector is readily extracted if required.

Smith, Mark J.; Proudler, Ian K.

1997-10-01

228

Recursive definition of global cellular-automata mappings  

SciTech Connect

A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set of fixed points of cellular automata on an infinite lattice.

Feldberg, R.; Knudsen, C.; Rasmussen, S. (Physics Department and Center for Modeling, Nonlinear Dynamics Irreversible Thermodynamics, The Technical University of Denmark, DK-2800 Lyngby (Denmark) Analysis Division Office, Section for Simulation Applications, Center for Nonlinear Studies, and Theoretical Division, Complex Systems Group, MS-B258, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States) Santa Fe Institute, 1660 Old Pecos Trail, Santa Fe, New Mexico 87501 (United States))

1994-02-01

229

Recursiveness, switching, and fluctuations in a replicating catalytic network  

NASA Astrophysics Data System (ADS)

A protocell model consisting of mutually catalyzing molecules is studied, in order to investigate how chemical compositions are transferred recursively through cell divisions under replication errors. Depending on the numbers of molecules and species, and the path rate, three phases are found: fast switching state without recursive production, recursive production, and itinerancy between the above two states. The number distributions of the molecules in the recursive states are shown to be log-normal except for those species that form a core hypercycle, and are explained with the help of a heuristic argument.

Kaneko, Kunihiko

2003-09-01

230

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

231

Recursive deconvolution of combinatorial chemical libraries.  

PubMed

A recursive strategy that solves for the active members of a chemical library is presented. A pentapeptide library with an alphabet of Gly, Leu, Phe, and Tyr (1024 members) was constructed on a solid support by the method of split synthesis. One member of this library (NH2-Tyr-Gly-Gly-Phe-Leu) is a native binder to a beta-endorphin antibody. A variation of the split synthesis approach is used to build the combinatorial library. In four vials, a member of the library's alphabet is coupled to a solid support. After each coupling, a portion of the resin from each of the four reaction vials was set aside and catalogued. The solid support from each vial is then combined, mixed, and redivided. The steps of (i) coupling, (ii) saving and cataloging, and (iii) randomizing were repeated until a pentapeptide library was obtained. The four pentapeptide libraries where the N-terminal amino acid is defined were screened against the beta-endorphin antibody and quantitated via an ELISA. The amino acid of the four pools that demonstrated the most binding was then coupled to the four tetrapeptide partial libraries that had been set aside and catalogued during the split synthesis. This recursive deconvolution was repeated until the best binders were deduced. Besides the anticipated native binder, two other members of the library displayed significant binding. This recursive method of deconvolution does not use a molecular tag, requires only one split synthesis, and can be applied to the deconvolution of nonlinear small-molecule combinatorial libraries and linear oligomeric combinatorial libraries, since it is based only on the procedure of the synthesis. PMID:7972077

Erb, E; Janda, K D; Brenner, S

1994-11-22

232

Speech recognition by recursive stochastic modelling  

NASA Astrophysics Data System (ADS)

The application of algorithms for automatic speech recognition is described. Parameters to describe a speech signal were searched for from which log area ratio parameters were chosen. Based on these parameters, a segmentation algorithm was developed. The recognition process was then discussed. A new method was developed based on a new model: the Recursive Markov Model (RMM) which is an extension of the existing Hiddem Markov Model (HMM) and has the advantage of shorter computations, hierarchical modeling, and state sharing. Results of tests of the implemented algorithms are given and the relative merits of the methods of speech recognition are considered.

Nijtmans, Joannes Josephus

1992-06-01

233

Extended VSM for XML Document Classification Using Frequent Subtrees  

Microsoft Academic Search

\\u000a Structured link vector model (SLVM) is a representation proposed for modeling XML documents, which was extended from the conventional\\u000a vector space model (VSM) by incorporating document structures. In this paper, we describe the classification approach for\\u000a XML documents based on SLVM in the Document Mining Challenge of INEX 2009, where the closed frequent subtrees as structural\\u000a units are used for

Jianwu Yang; Songlin Wang

2009-01-01

234

Structure and Value Synopses for XML Data Graphs  

Microsoft Academic Search

All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XML data graph, and (2) pred- icates on the values of specific path\\/branch nodes, in order to reach the desired data elements. Optimizing such queries depends crucially on the existence of con- cise synopsis

Neoklis Polyzotis; Minos N. Garofalakis

2002-01-01

235

Searching Multi-hierarchical XML Documents: The Case of Fragmentation  

Microsoft Academic Search

\\u000a To properly encode properties of textual documents using XML, multiple markup hierarchies must be used, often leading to conflicting\\u000a markup in encodings. Text Encoding Initiative (TEI) Guidelines [1] recognize this problem and suggest a number of ways to\\u000a incorporate multiple hierarchies in a single well-formed XML document. In this paper, we present a framework for processing\\u000a XPath queries over multi-hierarchical

Alex Dekhtyar; Ionut Emil Iacob; Srikanth Methuku

2005-01-01

236

FVC: A Feature-Vector-Based Classification for XML Dissemination  

Microsoft Academic Search

\\u000a With the adoption of XML in a wide range of applications, efficient XML classification has become an important research topic.\\u000a In current studies, users’ interests are expressed by XPath or XQuery queries. However, such a query is hard to formulate,\\u000a because it requires a good knowledge of the structure and contents of the documents that will arrive and some knowledge

Xiaoling Wang; Martin Ester; Weining Qian; Aoying Zhou

2010-01-01

237

XDerive: a namespace for defining derived elements in XML Schema  

Microsoft Academic Search

XML is becoming the standard for document description in a B2B set- ting, and XML Schemais gaining wide acceptance as the schema language to de- fine the structure of these documents. Transactional documents as those currently found in B2B applications, frequently comprise derived elements, i.e. elements whose content can be calculated through deriving function that examines the con- tent of

Oscar Díaz; Felipe I. Anfurrutia

238

Structural joins: A primitive for efficient XML query pattern matching  

Microsoft Academic Search

This XQuery path expression can be represented as a node-labeled tree pattern with elements and string values as node labels. XML queries typically specify patterns of selection pred-icates on multiple elements that have some specified tree structured relationships. The primitive tree structured re-lationships are parent-child and ancestor-descendant, and finding all occurrences of these relationships in an XML database is a

Shurug Al-khalifa; H. V. Jagadish; Nick Koudas; Jignesh Patel; Divesh Srivastava; Yuqing Wu

2001-01-01

239

EDI, XML and e-business frameworks: A survey  

Microsoft Academic Search

Data formats and e-business frameworks are important standards for e-business. The ASC X12, EDIFACT and XML formats are utilized in e-business frameworks which are supported in information systems. The EDI formats have retained a position in cross-industry-document e-business frameworks, whereas the XML format dominates in cross-industry-process e-business frameworks and has gained a footing in industry- specific e-business frameworks. The use

Juha-miikka Nurmilaakso

2008-01-01

240

The Yin\\/Yang web: XML syntax and RDF semantics  

Microsoft Academic Search

XML is the W3C standard document format for writing and exchanging information on the Web. RDF is the W3C standard model for describing the semantics and reasoning about information on the Web. Unfortunately, RDF and XML---although very close to each other---are based on two different paradigms. We argue that in order to lead the Semantic Web to its full potential,

Peter F. Patel-Schneider; Jérôme Siméon

2002-01-01

241

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.

242

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

243

CONTENT-DRIVEN SPECIFICATIONS FOR RECURSIVE PROJECT PLANNING APPLICATIONS  

Microsoft Academic Search

This paper presents new effective solutions for critical path applications for directed acyclic graphs. We demon- strate that it is possible to solve these recursive problems using a data model without nested structures and a content-driven query language without explicit recursion, iteration, nesting or navigation. These solutions do not require the specification of unique start or finish nodes of the

J. H. TER BEKKE; J. A. BAKKER

244

Recursive dynamics algorithm for multibody systems with prescribed motion  

Microsoft Academic Search

This paper uses spatial operator techniques to develop a new algorithm for the dynamics of multibody systems with hinges undergoing prescribed motion. This algorithm is spatially recursive, and its computational complexity grows only linearly with the number of degrees of freedom in the system. Its structure is a hybrid of known recursive forward and inverse dynamics algorithms for regular multibody

Abhinandan Jain; Guillermo Rodriguez

1993-01-01

245

Recursion Relations and Functional Equations for the Riemann Zeta Function  

Microsoft Academic Search

New recursion relations for the Riemann zeta function are introduced. Their derivation started from the standard functional equation. The new functional equations have both real and imaginary increment versions and can be applied over the whole complex plane. We have developed various versions of the recursion relations eliminating each of the coefficient functions, leaving plain zeta functions

Henrik Stenlund

2011-01-01

246

A new recursive construction for optical orthogonal codes  

Microsoft Academic Search

We present a new recursive construction for (n,?,?a,?c) optical orthogonal codes. For the case of ?a = ?c = ?, this recursive construction enlarges the original family with ? unchanged, and produces a new family of asymptotically optimal codes, if the original family is asymptotically optimal. We call a code asymptotically optimal, following the definition of O. Moreno et al.

Wensong Chu; Solomon W. Golomb

2003-01-01

247

Fast recursive-least-squares algorithms for Toeplitz matrices  

NASA Astrophysics Data System (ADS)

A new derivation of the QR-based fast recursive least squares algorithms for Toeplitz matrices is presented. Algorithms for computing Q and R in the QR decomposition of the data matrix are proposed. These algorithms can be efficiently incorporated with the fast recursive least squares algorithm and can be performed only when they are needed.

Qiao, Sanzheng

1991-12-01

248

SRec: an animation system of recursion for algorithm courses  

Microsoft Academic Search

In this paper we describe SRec, a system to animate recursion in Java programs. It is intended to assist in algorithm courses to better understand and analyze algorithm behavior. We make several contributions. Firstly, SRec exhibits a comprehensive set of animation and educational features. It provides three complem- entary, coordinated views of recursion: traces, the execution stack and activation trees.

J. Ángel Velázquez-Iturbide; Antonio Pérez-Carrasco; Jaime Urquiza-Fuentes

2008-01-01

249

Testing Recursiveness in a Triangular Simultaneous Equation Model  

Microsoft Academic Search

In applied work in macroeconomics using simultaneous equation systems relationships between variables are sometimes described by means of a triangular model. However, in a simultaneous equation sprit the a priori assumption of full recursivity is typically not made. The purpose of this paper is to suggest a recursiveness test for models which are already written in a triangular form. It

Albert Holly

1979-01-01

250

Recursive construction of sequential algorithm for product quality control  

Microsoft Academic Search

This paper proposes a procedure recursive in two parameters for constructing a sequential product quality control algorithm. One of these parameters assures recursive approximation to the optimal N-truncated sequential algorithm, while the other provides construction of sets of measurement result chains on whose elements measurement has been concluded and a final decision has been made regarding membership of the test

N. G. Nazarov; E. A. Arkhangel'skaya

1993-01-01

251

An XML cytometry standard based on DICOM  

NASA Astrophysics Data System (ADS)

Introduction: The International Society for the Advancement of Cytometry (ISAC) Data Standards Task Force (DSTF) is developing a new Advanced Cytometry Specification (ACS). DICOM has developed and is extending a pathology extension. The work of both groups is complementary with some overlap. Interoperation would benefit both groups and permit each to benefit from the other's expertise. Methods: The design and implementation of the CytometryML version of the ACS schemas have been based on each schema describing one object (modularity), iterative (spiral) development, inheritance, and reuse of data-types and their definitions from DICOM, Flow Cytometry Standard, and other standards. Results: These schemas have been validated with two tools and XML pages were generated from highest level schemas. Binary image data and its associated metadata are stored together in a zip file based container. A schema for a table of contents, which is one of the metadata files of this container, has recently been developed and reported upon. The binary image data is placed in one file in the container; and the metadata associated with an image in another. The schema for the image metadata file includes elements that are based on the DICOM design. This image schema includes descriptions of the acquisition context, image (including information on compression), specimen, slide, transmission medium, major optical parts, optical elements in one or more optical channels, detectors, and pixel format. The image schema describes both conventional camera systems and scanning or confocal systems.

Leif, Robert C.

2009-02-01

252

Reasoning about Assignments in Recursive Data Structures  

NASA Astrophysics Data System (ADS)

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

Tamalet, Alejandro; Madlener, Ken

253

XAPiir: A recursive digital filtering package  

SciTech Connect

XAPiir is a basic recursive digital filtering package, containing both design and implementation subroutines. XAPiir was developed for the experimental array processor (XAP) software package, and is written in FORTRAN. However, it is intended to be incorporated into any general- or special-purpose signal analysis program. It replaces the older package RECFIL, offering several enhancements. RECFIL is used in several large analysis programs developed at LLNL, including the seismic analysis package SAC, several expert systems (NORSEA and NETSEA), and two general purpose signal analysis packages (SIG and VIEW). This report is divided into two sections: the first describes the use of the subroutine package, and the second, its internal organization. In the first section, the filter design problem is briefly reviewed, along with the definitions of the filter design parameters and their relationship to the subroutine input parameters. In the second section, the internal organization is documented to simplify maintenance and extensions to the package. 5 refs., 9 figs.

Harris, D.

1990-09-21

254

xml version="1.0" encoding="UTF-8" standalone="yes"?> ...  

Center for Biologics Evaluation and Research (CBER)

... ContentType="application/vnd.openxmlformats-officedocument.presentationml. slideLayout+xml"/>xml ... More results from www.fda.gov/downloads/advisorycommittees/committeesmeetingmaterials

255

Realization Of Algebraic Processor For XML Documents Processing  

SciTech Connect

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 [Fac. Computer Systems and Control Technical University of Sofia, TU-Sofia, Sofia (Bulgaria); Georgieva, Adriana [Fac. Applied Mathematics and Informatics Technical University of Sofia, TU-Sofia, Sofia (Bulgaria)

2010-10-25

256

agroXML Enabling Standardized, Platform-Independent Internet Data Exchange in Farm Management Information Systems  

Microsoft Academic Search

agroXML is a standardized language for data exchange in agriculture. It is based on the eXtensible Markup Language (XML) us- ing XML Schema as its definition language. agroXML is used to submit data from farm management information systems to external partners, like e. g. product processing industries in the food supply chain or agri- cultural service providers. In addition, data

Mario Schmitz; Daniel Martini; Martin Kunisch; Hans-jürgen Mösinger

2007-01-01

257

BUXMiner: An Efficient Bottom-Up Approach to Mining XML Query Patterns  

Microsoft Academic Search

Discovery of frequent XML query patterns in the history log of XML queries can be used to expedite XML query processing, as\\u000a the answers to these queries can be cached and reused when the future queries “hit” such frequent patterns. In this paper,\\u000a we propose an efficient bottom-up mining approach to finding frequent query patterns in XML queries. We merge

Yijun Bei; Gang Chen; Jinxiang Dong

2007-01-01

258

Voice User Interface Design for a Telephone Application Using VoiceXML  

Microsoft Academic Search

VoiceXML is a standard language for developing voice based applications. VoiceXML applications have more advantages over traditional Interactive Voice Response (IVR) systems because they can be used through any type of phones and also accessed via a computer. Voice User Interface (VUI) design is an integral part of developing any VoiceXML application. In this paper, the VUI for a VoiceXML

Daniel Mecanovic; Hao Shi

2005-01-01

259

A Probabilistic XML Approach to Data Integration  

Microsoft Academic Search

In mobile and ambient environments, devices need to be- come autonomous, managing and resolving problems with- out interference from a user. The database of a (mobile) device can be seen as its knowledge about objects in the 'real world'. Data exchange between small and\\/or large computing devices can be used to supplement and update this knowledge whenever a connection gets

Maurice Van Keulen; Ander De Keijzer; Wouter Alink

2005-01-01

260

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

261

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

Federal Register 2010, 2011, 2012, 2013

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

2012-08-07

262

Loosely Coupling Java Algorithms and XML Parsers: a Performance-Oriented Study  

Microsoft Academic Search

The adoption of XML to represent any kind of data and documents, even complex and huge, is becoming a matter of fact. However, interfacing algorithms and applications with XML Parsers requires to adapt algorithms and appli- cations: event-based SAX Parsers need algorithms that re- act to events generated by the parser. But parsing\\/loading XML documents provides poor per- formance (if

Giuseppe Psaila; Viale Marconi

2006-01-01

263

Using XML transactions to perform closed-loop diagnostics in network centric support environments  

Microsoft Academic Search

Extensible markup language (XML) transactions offer a methodology for defining standard communication interfaces as a means of promoting interoperability between network centric support (NCS) environments with the purpose of performing closed-loop diagnostics. Interoperability is established through the use of standardized XML schemas that define common XML constructs and then give these constructs context sensitive meaning via the use of an

A. L. Alwardt

2005-01-01

264

XStorM: A Scalable Storage Mapping Scheme for XML Data  

Microsoft Academic Search

With the increasing ubiquity of XML, an eXtensible Markup Language, the industry is racing to provide XML infrastructure for e–commerce, information interchange, effective query of diverse sources and yet more integration of diverse data. It is anticipated that large volumes of XML data will be created manually from HTML documents or generated using some WWW tools and electronic data interchange

Wen Qiang Wang; Mong Li Lee; Beng Chin Ooi

2001-01-01

265

An XML infrastructure for archives, libraries and museums: resource discovery in the COVAX project  

Microsoft Academic Search

Although the idea of collaborative distributed resource discovery systems in libraries, museums and archives is not new, XML (extensible markup language) offers a new technical basis for development. Contemporary Culture Virtual Archive in XML (COVAX) is a project that has used XML to build ‘’middleware” that enables integrated searches via the Web for materials held in libraries, archives and museums,

Robin Yeates

2002-01-01

266

Information Retrieval System for Japanese Standard Disease-Code Master Using XML Web Service  

PubMed Central

Information retrieval system of Japanese Standard Disease-Code Master Using XML Web Service is developed. XML Web Service is a new distributed processing system by standard internet technologies. With seamless remote method invocation of XML Web Service, users are able to get the latest disease code master information from their rich desktop applications or internet web sites, which refer to this service.

Hatano, Kenji; Ohe, Kazuhiko

2003-01-01

267

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

Microsoft Academic Search

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

Masatoshi Yoshikawa; Toshiyuki Amagasa; Takeyuki Shimura; Shunsuke Uemura

2001-01-01

268

Rich media indexing and retrieval in an Object XML database system  

Microsoft Academic Search

Rich media (including Flash, PowerPoint) presentations are gaining widespread usage nowadays, particularly in the domains of e-learning and digital entertainment. There are countless animation movies available now throughout the Internet. In order to allow animation movies to be queried, we present in this paper an Object XML model by converting animation movies into XML format, followed by storing XML data

Qing Li; Hon Chung Mak; Jianmin Zhao; Xinzhong Zhu

2009-01-01

269

Recursive-in-order least squares parameter estimation for 2D Gaussian Markov random field model  

Microsoft Academic Search

Presents two recursive-in-order least squares algorithms for parameter estimation of 2D Gaussian Markov random field (GMRF) models. Algorithm I implements the recursive computation by introducing auxiliary variables without changing the structure of the model, while algorithm II realizes the recursive computation by replacing the noncausal symmetric GMRF model by an equivalent causal nonsymmetric model. The concept of recursive path, which

C. R. ZoLVL; Z. Y. He; E. I. Plotkin; M. N. S. Swamy

1992-01-01

270

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

271

Development Life Cycle and Tools for XML Content Models  

SciTech Connect

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

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

2004-11-01

272

A standard XML Schema for computerised anaesthetic records.  

PubMed

We believe that one of the most influential developments for the practice of anaesthesia in this decade will be the introduction of a national (or possibly international) standard XML Schema for computerised anaesthetic records, and that such development should be actively promoted by appropriate professional groups. We discuss the implications of such a schema, and make suggestions regarding its requirements. We also report on one approach to the development of an XML Schema for anaesthetic records (provisionally named SnowSchema in honour of Dr John Snow), and compare the current version with the suggested requirements. PMID:12437708

Gardner, M; Peachey, T

2002-12-01

273

A standard transformation from XML to RDF via XSLT  

NASA Astrophysics Data System (ADS)

A generic transformation of XML data into the Resource Description Framework (RDF) and its implementation by XSLT transformations is presented. It was developed by the grid integration project for robotic telescopes of AstroGrid-D to provide network communication through the Remote Telescope Markup Language (RTML) to its RDF based information service. The transformation's generality is explained by this example. It automates the transformation of XML data into RDF and thus solves this problem of semantic computing. Its design also permits the inverse transformation but this is not yet implemented.

Breitling, F.

2009-07-01

274

The Tree Equivalence Problem for Linear Recursion Schemes  

Microsoft Academic Search

In the paper, a complete system of transformation rules preserving the tree equivalence and a polynomial-time algorithm deciding the tree equivalence of linear polyadic recursion schemes are proposed.

Viktor K. Sabelfeld; A. P. Ershov

1996-01-01

275

Improved Recursive Formula for Calculating Shock Response Spectra.  

National Technical Information Service (NTIS)

Currently used recursive formulas for calculating the shock response spectra are based on an impulse invariant digital simulation of a single degree of freedom system. This simulation can result in significant errors when the natural frequencies are great...

D. O. Smallwood

1980-01-01

276

Cluster update for tensor network states  

NASA Astrophysics Data System (ADS)

We propose a novel recursive way of updating the tensors in projected entangled pair states by evolving the tensor in imaginary time evolution on clusters of different sizes. This generalizes the so-called simple update method of Jiang et al. [Phys. Rev. Lett. 101, 090603 (2008)] and the updating schemes in the single layer picture of Pizorn et al. [Phys. Rev. A 83, 052321 (2011)]. A finite-size scaling of the observables as a function of the cluster size provides a remarkable improvement in the accuracy as compared to the simple update scheme. We benchmark our results on the hand of the spin 1/2 staggered dimerized antiferromagnetic model on the square lattice, and accurate results for the magnetization and the critical exponents are determined. Reference L. Wang and F. Verstraete, arXiv:1110.4362.

Wang, Ling; Verstraete, Frank

2012-02-01

277

RECURSIVE IDENTIFICATION OF PHYSICAL PARAMETERS IN A FLEXIBLE ROBOT ARM  

Microsoft Academic Search

ABSTRACT Recursive identification of a physically parameterized,model,of a sin- gle link flexible robot arm is considered. The parameters are estimated us- ing a recursive prediction error method,applied to a linear continuous time model,structure and discrete time data. The algorithm is applied ,to real data from an industrial robot, and three important parameters are identified using only measurements ,of the ,motor

Måns Östring; Svante Gunnarsson

2004-01-01

278

Recursive Sequence Mining to Discover Named Entity Relations  

Microsoft Academic Search

\\u000a Extraction of named entity relations in textual data is an important challenge in natural language processing. For that purpose,\\u000a we propose a new data mining approach based on recursive sequence mining. The contribution of this work is twofold. First,\\u000a we present a method based on a cross-fertilization of sequence mining under constraints and recursive pattern mining to produce\\u000a a user-manageable

Peggy Cellier; Thierry Charnois; Marc Plantevit; Bruno Crémilleux

2010-01-01

279

Recursive reconstruction of high resolution image from noisy undersampled multiframes  

Microsoft Academic Search

In several applications it is required to reconstruct a high-resolution noise-free image from multipath frames of undersampled low-resolution noisy images. Using the aliasing relationship between the undersamples frames and the reference image, an algorithm based on weighted recursive least-squares theory is developed in the wavenumber domain. This algorithm is efficient because interpolation and noise removal are performed recursively, and is

S. P. Kim; N. K. Bose; H. M. Valenzuela

1990-01-01

280

Microwave active filters based on transversal and recursive principles  

NASA Astrophysics Data System (ADS)

Transversal and recursive filter concepts, normally associated with discrete-time applications, are adapted for implementation in the microwave frequency range. Principal focus is on microwave active filter designs that permit realization of wide bandwidths, with microwave transistors used as active elements. A transversal-type and a recursive-type experimental filter, both of which exhibit 9-15-GHz bandpass responses, serve to illustrate aspects of physical implementation, while offering a convenient basis for comparing the two different approaches.

Rauscher, C.

1985-12-01

281

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

282

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

283

Microwave active filters based on transversal and recursive principles  

Microsoft Academic Search

Transversal and recursive filter concepts, normally associated with discrete-time applications, are adapted for implementation in the microwave frequency range. Principal focus is on microwave active filter designs that permit realization of wide bandwidths, with microwave transistors used as active elements. A transversal-type and a recursive-type experimental filter, both of which exhibit 9-15-GHz bandpass responses, serve to illustrate aspects of physical

C. Rauscher

1985-01-01

284

Recursive frame integration of limited data: RAFAIL  

NASA Astrophysics Data System (ADS)

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

Rafailov, Michael K.; Soli, Robert A.

2005-08-01

285

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

286

Effective Web data extraction with standard XML technologies  

Microsoft Academic Search

We describe an Extensible Markup Language (XML)-based methodology for Web data extraction that extends beyond simple “screen scraping”. An ideal data extraction process can digest target Web databases that are visible only as Hypertext Markup Language (HTML) pages, and create a local replica of those databases as a result. What is needed is more than a Web crawler and set

Jussi Myllymaki

2002-01-01

287

XIRS: an XML-based Image Retrieval System  

Microsoft Academic Search

This paper presents a formalization of an image retrieval system based on a notion of similarity between images in a multimedia database (namely XML-Enabled Database) and where a user request can be an image file or a keyword. The CBIR (Content Based Image Retrieval) system and the current search engines (e.g. Google, Yahoo….) make image search possible only when the

G. N. FANZOU TCHUISSANG; WANG N.

2007-01-01

288

Bridging relational database history and the web: the XML approach  

Microsoft Academic Search

The preservation of digital artifacts represents an unan- swered challenge for the modern information society: XML and its query languages provide an efiective environment to address this challenge because of their ability to support temporal information and queries, and make it easy to pub- lish database history to the Web. In this paper, we focus on the problem of preserving,

Fusheng Wang; Xin Zhou; Carlo Zaniolo

2006-01-01

289

Data Quality of Native XML Databases in the Healthcare Domain  

Microsoft Academic Search

As XML data is being widely adopted as a data and object exchange format for both structured and semi structured data, the need for quality control and measurement is only to be expected. This can be attributed to the increase in the need for data quality metrics in traditional databases over the past decade. The traditional model provide constraints mechanisms

Henry Addico

2006-01-01

290

Curriculum@UA - online xml based personal curriculum  

Microsoft Academic Search

This paper describes a project in development at Universidade de Aveiro concerning online filling and central storage of researchers' curriculum vitae (CV). This system enables anyone to have an up to date CV always avail- able for use anywhere. The major features in this site are its use of XML as the storage format for each individual CV and PDF

C. Teixeira; J. S. Pinto; J. Santos

291

Efficient LCA based keyword search in xml data  

Microsoft Academic Search

Keyword search in XML documents based on the notion of low- est common ancestors (LCAs) and modifications of it has recently gained research interest (2, 3, 4). In this paper we propose a n ef- ficient algorithm called Indexed Stack to find answers to keyw ord queries based on XRank's semantics to LCA (2). The complexit y of the Indexed

Yu Xu; Yannis Papakonstantinou

2007-01-01

292

Efficient keyword search for smallest LCAs in XML databases  

Microsoft Academic Search

Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe corresponding efficient algorithms. The proposed keyword search returns the set of smallest trees containing all keywords, where a tree is designated as \\

Yu Xu; Yannis Papakonstantinou

2005-01-01

293

Application of XML Database Technology to Biological Pathway Datasets  

Microsoft Academic Search

The study of biological systems has accumulated a significant amount of biological pathway data, which is evident through the continued growth in both the number of databases and amount of data available. The development of BioPAX standard leads to the increased availability of biological pathway datasets through the use of a special XML format, but the lack of standard storage

Keyuan Jiang; Christopher Nash

2006-01-01

294

Performance Enhancement through Structural Redundancy in Mapping XML into Relations  

Microsoft Academic Search

In designing a relational schema, we often consider that an attribute of a table is replicated into other table to reduce the join cost. And such a possible redundancy can be grasped by E\\/R model (i.e., semantic modeling). Similarly, in mapping XML into relations, we can consider some redundancy to enhance query performance and they can be grasped by the

Jaehoon Kim; Seog Park

2003-01-01

295

XML Content Management Based on Object-Relational Database Technology  

Microsoft Academic Search

XML (Extensible Markup Language) is a textual markup language designed for the creation of self-describing documents. Such documents contain textual data combined with structural information describing the structure of the textual data. Currently, products and approaches for document-oriented application domains focus mainly on the tex- tual representation when processing and analyzing documents. Usually, they do not take advantage of the

Budi Surjanto; Norbert Ritter; Henrik Loeser

2000-01-01

296

XML Text Interchange Format in the National Corpus of Polish  

Microsoft Academic Search

The aim of this paper is to describe and justify the XML encoding of texts within the National Corpus of Polish. Basic text encoding, rather than linguistic annotation, is considered here: the encoding of the primary data, the structural markup and the metadata. A set of schemata conformant with the Text Encoding Initiative Guidelines P5 is presented.

Adam Przepiórkowski

297

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

ERIC Educational Resources Information Center

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

Ragon, Bart

2003-01-01

298

Two-Variable Logic on Data Trees and XML Reasoning  

Microsoft Academic Search

Motivated by reasoning tasks for XML languages, the satisflability problem of logics on data trees is investigated. The nodes of a data tree have a label from a flnite set and a data value from a possibly inflnite set. It is shown that satisflability for two-variable flrst-order logic is decidable if the tree structure can be accessed only through the

Anca Muscholl; Thomas Schwentick; Luc Segoufln

299

Two-variable logic on data trees and XML reasoning  

Microsoft Academic Search

Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on data trees is investigated. The nodes of a data tree have a label from a finite set and a data value from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed only through the

Mikolaj Bojanczyk; Anca Muscholl; Thomas Schwentick; Luc Segoufin

2009-01-01

300

Two-Variable Logic on Data Trees and XML Reasoning  

Microsoft Academic Search

ABSTRACT Motivated by reasoning tasks in the context of XML lan- guages, the satisfiability problem of logics on data trees is investigated. The nodes of a data tree have a label from a finite set and a data value from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can

Mikoøaj Boja nczyk; Claire David; Anca Muscholl; Luc Segoufin

301

Two-variable logic on data trees and XML reasoning  

Microsoft Academic Search

Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on data trees is investigated. The nodes of a data tree have a label from a finite set and a data value from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed only through the

Mikolaj Bojanczyk; Claire David; Anca Muscholl; Thomas Schwentick; Luc Segoufin

2006-01-01

302

XML-Based Meta-Retrieval of Networked Data Sources  

Microsoft Academic Search

The XML-based meta-retrieval described in this paper is an integrated retrieval over multiple academic data sources on the premise that each data source has one web interface visible in the Internet environment. The goal of this model is to present an integrated retrieval interface in the Internet, to offer transparent accessing by formulating new queries suitable for heterogeneous data sources

Liang Xue; Tao Guan; Boqin Feng

2004-01-01

303

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

304

XVIP: An XML-Based Video Information Processing System  

Microsoft Academic Search

We describe XVIP, an XML-based video information processing system, which extracts information from video and stores the information in a multimedia digital video library. XVIP encapsulates a number of extraction techniques, including scene change detection, video optical character detection and recognition, and geometric coding. It also provides a seamless approach to scale up the contents created in and delivered by

Edith C. H. Ngai; Pat Pik-wah Chan; Edward Yau; Michael R. Lyu

2002-01-01

305

Using XML to map relationships in hacker forums  

Microsoft Academic Search

XML and the technologies that make use of it (XPath, XSL, etc.) have massive potential for information collection, storage, and visualization. One application in which their functionality stands out is the collection and visualization of social relationships in hacker forums. This information can be used by law enforcement to discover potential informants for a known suspect or by academia to

Jonathan F. Spencer

2008-01-01

306

INVESTIGATIONS ON METADATA ENCODING USING XML AND RDF  

Microsoft Academic Search

Metadata enables large collections of documents and data to function like organized libraries rather than disorganized clumps. The Portable Channel Description (PCR) is a metadata model designed to facilitate the replication of content between Web servers. We discuss the usage of PCR metadata encoding through a comparison of the Extended Markup Language (XML) and the Resource Description Framework (RDF) in

Manuel Palacio

2002-01-01

307

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

308

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

309

A Synthetic Recursive "+1" Pathway for Carbon Chain Elongation  

PubMed Central

Nature uses four methods of carbon chain elongation for the production of 2-ketoacids, fatty acids, polyketides, and isoprenoids. Using a combination of quantum mechanical (QM) modeling, protein–substrate modeling, and protein and metabolic engineering, we have engineered the enzymes involved in leucine biosynthesis for use as a synthetic “+1” recursive metabolic pathway to extend the carbon chain of 2-ketoacids. This modified pathway preferentially selects longer-chain substrates for catalysis, as compared to the non-recursive natural pathway, and can recursively catalyze five elongation cycles to synthesize bulk chemicals, such as 1-heptanol, 1-octanol, and phenylpropanol directly from glucose. The “+1” chemistry is a valuable metabolic tool in addition to the “+5” chemistry and “+2” chemistry for the biosynthesis of isoprenoids, fatty acids, or polyketides.

Marcheschi, Ryan J.; Li, Han; Zhang, Kechun; Noey, Elizabeth L.; Kim, Seonah; Chaubey, Asha; Houk, K. N.; Liao, James C.

2013-01-01

310

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

311

Use of XML and MathML for Scientific Documents and Data Sets  

NASA Astrophysics Data System (ADS)

The Extensible Markup Language is quickly becoming a part of the infrastructure of the Web and is the next "Web language", after HTML. We will provide an overview of the use of XML for modeling, exchange, and storage of document information. We will provide a brief overview of the basic features including, XML syntax, DTDs, and generic tools for authoring, validating, storing, and querying XML. We will focus on how XML technologies may affect future electronic versions of math and science documents and teaching materials. In particular, the use of MathML is permitting Web access to research and educational materials in which the mathematical equations and figures convey content in more than graphical form. This permits multi-modal access to the materials for diverse groups as well as user interactions with the equations and figures. We will provide examples of how one can develop flexible, interactive interfaces using XML data and open XML standards. note

Baru, Chaitan

2001-06-01

312

Ordered Backward XPath Axis Processing against XML Streams  

NASA Astrophysics Data System (ADS)

Processing of backward XPath axes against XML streams is challenging for two reasons: (i) Data is not cached for future access. (ii) Query contains steps specifying navigation to the data that already passed by. While there are some attempts to process parent and ancestor axes, there are very few proposals to process ordered backward axes namely, preceding and preceding-sibling. For ordered backward axis processing, the algorithm, in addition to overcoming the limitations on data availability, has to take care of ordering constraints imposed by these axes. In this paper, we show how backward ordered axes can be effectively represented using forward constraints. We then discuss an algorithm for XML stream processing of XPath expressions containing ordered backward axes. The algorithm uses a layered cache structure to systematically accumulate query results. Our experiments show that the new algorithm gains remarkable speed up over the existing algorithm without compromising on bufferspace requirement.

Nizar M., Abdul; Kumar, P. Sreenivasa

313

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

314

XQSuggest: An Interactive XML Keyword Search System  

NASA Astrophysics Data System (ADS)

Query suggestion is extensively used in web search engines to suggest relevant queries, which can help users better express their information needs. In this paper, we explore the application of query suggestion in xml keyword search and propose a novel interactive xml query system XQSuggest, which mainly targets non-professional users who roughly know the contents of the database. Our system extends conventional keyword search systems by instantly suggesting several understandable semantic strings after each keyword is typed in, so that the users can easily select their desired semantic string, which represents a specific meaning of the keyword, to replace the ambiguous keyword. We provide a novel algorithm to compute the final results. Experimental results are provided to verify the better effectiveness of our system.

Li, Jiang; Wang, Junhu

315

A Generalized Recursive Algorithm for a Class of Non-stationary Regeneration (Scheduling) Problems.  

National Technical Information Service (NTIS)

Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems pos...

F. Glover T. D. Klastorin

1974-01-01

316

Recursive Hybrid Algorithm for Non-Linear System Identification Using Radial Basis Function Networks.  

National Technical Information Service (NTIS)

Recursive identification of nonlinear 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 centers of the ra...

S. Chen S. A. Billings P. M. Grant

1991-01-01

317

A Recursive Lagrangian Formulation of Manipulator Dynamics and a Comparative Study of Dynamics Formulation Complexity.  

National Technical Information Service (NTIS)

A recursive formulation of manipulator dynamics based on the Lagrange equations has been developed. The efficiency of this formulation allows the dynamics to be computed in real time. The formulation is analogous to recently developed recursive Newton-Eul...

J. M. Hollerbach

1979-01-01

318

Modeling and Querying E-Commerce Data in Hybrid Relational-XML DBMSs  

Microsoft Academic Search

Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured\\u000a data models such as XML have become popular as a lowest common denominator to manage such data. The problem is that although\\u000a XML is adequate to represent the flexible portion of the data, it fails to exploit the highly structured portion of the data.\\u000a XML

Lipyeow Lim; Haixun Wang; Min Wang

2008-01-01

319

Melting Pot XML: Bringing File Systems and Databases One Step Closer  

Microsoft Academic Search

Ever-growing data volumes demand for storage systems beyond current file systems abilities, particularly, a powerful querying capability. With the rise of XML, the database community has been challenged by semi-structured data processing, en- hancing their field of activity. Since file systems are structured hierarchically they can be mapped to XML and as such stored in and queried by an XML-aware

Alexander Holupirek; Christian Grün; Marc H. Scholl

2007-01-01

320

ERX: An Experience in Integrating Entity-Relationship Models, Relational Databases, and XML Technologies  

Microsoft Academic Search

The need for managing large repositories of data coming from XML documents is increasing, in particular to support new EDI\\u000a applications and information systems which provide e-commerce functionality. In fact, XML is emerging as the standard format\\u000a for documents exchanged over the internet; then information systems will have to deal with XML documents, both incoming and\\u000a outcoming.\\u000a \\u000a This is an

Giuseppe Psaila; Viale Marconi

2002-01-01

321

Extracting knowledge from XML document repository: a semantic Web-based approach  

Microsoft Academic Search

XML plays an important role as the standard language for representing structured data for the traditional Web, and hence many\\u000a Web-based knowledge management repositories store data and documents in XML. If semantics about the data are formally represented\\u000a in an ontology, then it is possible to extract knowledge: This is done as ontology definitions and axioms are applied to XML

Henry M. Kim; Arijit Sengupta

2007-01-01

322

Ontology and XML-based Specifications for Collaborative B2B Relationships  

Microsoft Academic Search

A collaborative B2B relationship implies jointly executing business processes. This relationship demands a complete access to available information and knowledge to support decision-making activities between trading partners. To support information interchange between enterprises in collaborative B2B e- commerce there are some XML-based standards technologies, like RosettaNet, ebXML and OAGIS. However, XML does not express semantics by itself. So, these standards

María Laura Caliusco; María Rosa Galli; Omar Chiotti

2004-01-01

323

Efficient LCA based keyword search in XML data  

Microsoft Academic Search

ABSTRACT Keyword,search in XML documents,based on the notion of lowest common,ancestors (LCAs) and modifications of it has recently gained research interest [10, 14, 20]. In this paper we propose an efficient algorithm called Indexed Stack to find answers to ke yword queries based on XRank’s semantics to LCA [10]. The complexity of the Indexed Stack algorithm is O(kd|S1| log |S|)

Yu Xu; Yannis Papakonstantinou

2008-01-01

324

A Model Driven Approach for XML Database Development  

Microsoft Academic Search

\\u000a In this paper we propose a methodological approach for the development of XML databases. Our proposal is framed in MIDAS,\\u000a a model driven methodology for the development of Web Information Systems (WISs) based on the Model Driven Architecture (MDA)\\u000a proposed by the Object Management Group (OMG). So, in this framework, the proposed data Platform Independent Model (PIM) is\\u000a the conceptual

Belén Vela; César J. Acuña; Esperanza Marcos

2004-01-01

325

Enhance Reuse of Standard e-Business XML Schema Documents  

SciTech Connect

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

Buhwan, Jeong [POSTECH University, South Korea; Kulvatunyou, Boonserm [ORNL; Ivezic, Nenad [ORNL; Jones, Albert [National Institute of Standards and Technology (NIST)

2005-07-01

326

The XBabelPhish MAGE-ML and XML Translator  

PubMed Central

Background MAGE-ML has been promoted as a standard format for describing microarray experiments and the data they produce. Two characteristics of the MAGE-ML format compromise its use as a universal standard: First, MAGE-ML files are exceptionally large – too large to be easily read by most people, and often too large to be read by most software programs. Second, the MAGE-ML standard permits many ways of representing the same information. As a result, different producers of MAGE-ML create different documents describing the same experiment and its data. Recognizing all the variants is an unwieldy software engineering task, resulting in software packages that can read and process MAGE-ML from some, but not all producers. This Tower of MAGE-ML Babel bars the unencumbered exchange of microarray experiment descriptions couched in MAGE-ML. Results We have developed XBabelPhish – an XQuery-based technology for translating one MAGE-ML variant into another. XBabelPhish's use is not restricted to translating MAGE-ML documents. It can transform XML files independent of their DTD, XML schema, or semantic content. Moreover, it is designed to work on very large (> 200 Mb.) files, which are common in the world of MAGE-ML. Conclusion XBabelPhish provides a way to inter-translate MAGE-ML variants for improved interchange of microarray experiment information. More generally, it can be used to transform most XML files, including very large ones that exceed the capacity of most XML tools.

Maier, Don; Wymore, Farrell; Sherlock, Gavin; Ball, Catherine A

2008-01-01

327

Using MusicXML to Evaluate Accuracy of OMR Systems  

Microsoft Academic Search

In this paper a methodology for automatic accuracy evaluation in optical music recognition (OMR) applications is proposed.\\u000a Presented approach assumes using ground truth images together with digital music scores describing their content. The automatic\\u000a evaluation algorithm measures differences between the tested score and the reference one, both stored in MusicXML format.\\u000a Some preliminary test results of this approach are presented

Mariusz Szwoch

2008-01-01

328

Compiler support for efficient processing of XML datasets  

Microsoft Academic Search

Declarative, high-level, and\\/or application-class specific languages are often successful in easing application development. In this paper, we report our experiences in compiling a recently developed XML Query Language, XQuery for applications that process scientific datasets.Though scientific data processing applications can be conveniently represented in XQuery, compiling them to achieve efficient execution involves a number of challenges. These are, 1) analysis

Xiaogang Li; Renato Ferreira; Gagan Agrawal

2003-01-01

329

SAWSDL: Semantic Annotations for WSDL and XML Schema  

Microsoft Academic Search

Web services are important for creating distributed applications on the Web. In fact, they're a key enabler for service-oriented architectures that focus on service reuse and interoperability. The World Wide Web Consortium (W3C) has recently finished work on two important standards for describing Web services the Web Services Description Language (WSDL) 2.0 and Semantic Annotations for WSDL and XML Schema

Jacek Kopecký; Tomas Vitvar; Carine Bournez; Joel Farrell

2007-01-01

330

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

331

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

332

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

Microsoft Academic Search

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

Adam Goodie; Prashant Doshi; Diana Young

2009-01-01

333

A new recursion operator for Adler?s equation in the Viallet form  

NASA Astrophysics Data System (ADS)

For Adler's equation in the Viallet form and Yamilov's discretisation of the Krichever–Novikov equation we present new recursion and Hamiltonian operators. This new recursion operator and the recursion operator found in [A.V. Mikhailov, et al., Theor. Math. Phys. 167 (2011) 421, arXiv:1004.5346] satisfy the spectral curve associated with the equation.

Mikhailov, A. V.; Wang, J. P.

2011-10-01

334

Operation-oriented query language approach for recursive queries - Part 1. Functional definition  

Microsoft Academic Search

So far the aspects related to efficient processing have dominated the research on recursive queries. In this paper we consider how the formulation of recursive queries can be made easier from the view point of the non-professional user - also in the context of complex recursive queries. It is obvious that the conventional rule-based way of defining is too hard

Timo Niemi; Kalervo Järvelin

1992-01-01

335

Using Computer Algebra techniques for the specification, verification and synthesis of recursive programs  

Microsoft Academic Search

We describe an innovative method for proving total correctness of tail recursive programs having a specific structure, namely programs in which an auxiliary tail recursive function is driven by a main nonrecursive function, and only the specification of the main function is provided. The specification of the auxiliary function is obtained almost fully automatically by solving coupled linear recursive sequences

Nikolaj Popov; Tudor Jebelean

2009-01-01

336

Narrow-band recursive filters with error spectrum shaping  

Microsoft Academic Search

Earrrs due to Finite wordlength can be quite large in narrowband recursive digital filters. It has been shown that these errors may be considerably reduced by using a technique known as error spectrum shaping (ESS), which utilizes quantizer feedback. In this letter we first derive closed-formn bounds on the amplitude of zero-input limit cycles in ESS filters. An expression is

DAVID C. MUNSON; B. Liu

1981-01-01

337

Recursive Estimation of Motion, Structure, and Focal Length  

Microsoft Academic Search

We present a formulation for recursive recoveryof motion, pointwise structure, and focal length from featurecorrespondences tracked through an image sequence.In addition to adding focal length to the state vector, severalrepresentational improvements are made over earlierstructure from motion formulations, yielding a stable andaccurate estimation framework which applies uniformly toboth true perspective and orthographic projection. Resultson synthetic and real imagery illustrate the...

Ali Azarbayejani; Alex P. Pentland

1995-01-01

338

Applications of Recursive Segmentation to the Analysis of DNA Sequences  

Microsoft Academic Search

Recursive segmentation is a procedure that partitions a DNA sequence into domains with a homogeneous composition of the four nucleotides A, C, G and T. This procedure can also be applied to any sequence converted from a DNA sequence, such as to a binary strong(G + C)\\/weak(A+ T) sequence, to a binary sequence indicating the presence or absence of the

Wentian Li; Pedro Bernaola-galván; Fatameh Haghighi; Ivo Grosse

2002-01-01

339

Stabilization of unstable procedures: The recursive projection method  

Microsoft Academic Search

Fixed-point iterative procedures for solving nonlinear parameter dependent problems can converge for some interval of parameter values and diverge as the parameter changes. The Recursive Projection Method (RPM), which stabilizes such procedures by computing a projection onto the unstable subspace is presented. On this subspace a Newton or special Newton iteration is performed, and the fixed-point iteration is used on

Gautam M. Shroff; Herbert B. Keller

1993-01-01

340

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

341

Description of an exact, recursive method to simplify shading calculations  

Microsoft Academic Search

An exact, recursive method called SHADE is described which attempts to simplify shading calculations as performed by a programmable calculator or microcomputer. Preliminary applications of SHADE using a Hewlett Packard HP-41C programmable calculator are outlined. For a given solar hour, SHADE is used to compute the following quantities for overhang and side fin combinations which shade various openings: the percentage

A. D. Nawrocki; R. Kammerud

1981-01-01

342

Sharpening of partially non-recursive CIC decimation filters  

Microsoft Academic Search

The cascaded integrator comb filter is commonly used as a first stage decimation filter in communications systems. This paper reviews sharpening techniques for correcting the passband 'droop' present in the frequency response of these filters. A variation on an existing technique that would allow a partially non-recursive (and, therefore, potentially higher speed) implementation is presented for CIC filters with power

G. Stephen; R. W. Stewart

2004-01-01

343

Ab initio electronic-structure computations with the recursion method  

Microsoft Academic Search

An accurate and efficient algorithm for using the recursion method in ab initio electronic-structure calculations with nonorthogonal real-space basis sets is presented. The matrix representation of the Hamiltonian operator in a localized basis is shown to possess a sparse represention, and is constructed from the Hamiltonian and overlap matrices, but without the full inverse of the overlap matrix. A method

Andrew Gibson; Roger Haydock; John P. Lafemina

1993-01-01

344

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

345

Recursive Governance: Contemporary Political Communication and Public Policy  

Microsoft Academic Search

This article investigates aspects of the new relationships that are emerging between contemporary trends in political communication and public policy. In particular, it identifies and analyzes how these relationships are extending beyond the traditional domain of political communication as information and persuasion. This is traced through a consideration of the notion of political communication as “recursive governance”—a form of governance

Michael Crozier

2007-01-01

346

Analysis of recursive gene selection approaches from microarray data  

Microsoft Academic Search

Motivation: Finding a small subset of most predictive genes from microarray for disease prediction is a challenging pro- blem. Support Vector Machines (SVMs) have been found successful with a recursive procedure in selecting important genes for cancer prediction. It is not well understood, howe- ver, how much the success depends on the choice of the specific classifier, and how much

Fan Li; Yiming Yang

2005-01-01

347

Generalized linear recursive networks: topological and routing properties  

Microsoft Academic Search

This paper presents a methodology for generalizing the class of linear recursive networks (LRN) reported by Hsu et al. [IEEE Trans Parallel Distrib Syst 1997; 8(7)]. The proposed generalization relaxes the restriction on the number of isomorphic subgraphs of LRNs, which is at most 1 by Hsu et al. [IEEE Trans Parallel Distrib Syst 1997; 8(7)]. Hence, our methodology permits

H. C. Wasserman; S. A. Ghozati

2003-01-01

348

Market equilibrium with heterogeneous recursive-utility-maximizing agents  

Microsoft Academic Search

Summary This paper considers a heterogeneous agent Lucas style exchange economy. For a class of recursive utility functions containing the standard additive expected utility functions, I demonstrate that there exist market equilibria characterized by stationary (ergodic) Markov processes for consumption, portfolio holdings, asset prices and the unobserved utilities. No assumptions about market completeness are made, and there are no restrictions

Chenghu Ma

1993-01-01

349

On Representing Recursively Enumerable Languages by Internal Contextual Languages  

Microsoft Academic Search

We prove that each recursively enumerable language L can be written in the form L = cutc(L0 ? R), where L0 is an internal contextual language, R is a regular language, and cutc is the operation which for a word x removes the prefix of x to the left of the unique occurrence of ± in x.As corollaries of this

Andrzej Ehrenfeucht; Gheorghe Paun; Grzegorz Rozenberg

1998-01-01

350

Efficient Recursive Generation of the Scalar Spherical Multipole Translation Matrix  

Microsoft Academic Search

New efficient recursive procedures for generating the translation matrix of the scalar spherical multipole field are described. They are based on a new set of recurrence relations that result when the angular-momentum operator is applied to the spherical multipole field. Their efficiency and accuracy are compared analytically and through a computer experiment with those of the brute-force method and an

Kristopher T. Kim

2007-01-01

351

Recursive photometric stereo when multiple shadows and highlights are present  

Microsoft Academic Search

We present a recursive algorithm for 3D surface recon- struction based on Photometric Stereo in the presence of highlights, and self and cast shadows. We assume that the surface reflectance outside the highlights can be approxi- mated by the Lambertian model. The algorithm works with as few as three light sources, and it can be generalised for N without any

Vasileios Argyriou; Maria Petrou

2008-01-01

352

Gibbs Recursive Sampler: finding transcription factor binding sites  

Microsoft Academic Search

The Gibbs Motif Sampler is a software package for locating common elements in collections of biopoly- mer sequences. In this paper we describe a new variation of the Gibbs Motif Sampler, the Gibbs Recursive Sampler, which has been developed specifically for locating multiple transcription factor binding sites for multiple transcription factors simultaneously in unaligned DNA sequences that may be heterogeneous

William A. Thompson; Eric C. Rouchka; Charles E. Lawrence

2003-01-01

353

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

354

Fixed Points of Type Constructors and Primitive Recursion  

Microsoft Academic Search

For nested or heterogeneous datatypes, terminating recur- sion schemes considered so far have been instances of iteration, exclud- ing ecien t denitions of xed-p oint unfolding. Two solutions of this problem are proposed: The rst one is a system with equi-recursive non- strictly positive type constructors of arbitrary nite kinds, where xed- point unfolding is computationally invisible due to its

Andreas Abel; Ralph Matthes

2004-01-01

355

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

356

Text Segmentation Approach Based on Recursive Particle Filter  

Microsoft Academic Search

In order to solving segment text accurately and robustly from a video sequences. This paper presents a new approach for text segmentation in video sequences by using recursive particle filter. This approach presents a probabilistic algorithm for segmenting text in video sequences based on adaptive thresholding using a Bayes filtering method. First, we describe adaptive mixture model for video text

Shi Zhen-gang; He Li-li

2009-01-01

357

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

358

Optimally eating a stochastic cake: a recursive utility approach  

Microsoft Academic Search

In this short paper, uncertainties on resource stock and on technical progress are introduced into an intertemporal equilibrium model of optimal extraction of a non-renewable resource. The representative consumer maximizes a recursive utility function which disentangles between intertemporal elasticity of substitution and risk aversion. A closed-form solution is derived for both the optimal extraction and price paths. The value of

Anne Epaulard; Aude Pommeretb

2003-01-01

359

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

NASA Astrophysics Data System (ADS)

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

Liang, Wenxin; Takahashi, Akihiro; Yokota, Haruo

360

Implementing a scalable XML publish\\/subscribe system using relational database systems  

Microsoft Academic Search

An XML publish\\/subscribe system needs to match many XPath queries (subscriptions) over published XML documents. The performance and scalability of the matching algorithm is essential for the system when the number of XPath subscriptions is large. Earlier solutions to this problem usually built large finite state automata for all the XPath subscriptions in memory. The scalability of this approach is

Feng Tian; Berthold Reinwald; Hamid Pirahesh; Tobias Mayr; Jussi Myllymaki

2004-01-01

361

Efficient SLCA Computing Service for XML Filtering in IaaS  

Microsoft Academic Search

Cloud provides dynamically computing services for large scales of data over the Internet. IaaS(information as a service) is one of utilities to provide information service in Cloud computing. Large scales of XML data are produced continually in Internet. Efficient information filtering services are needed. Previous XML filter approaches aim at XPath queries. However, many users tend to use keywords to

Chenjing Zhang; Xiaoling Wang; Aoying Zhou

2010-01-01

362

diffX: an algorithm to detect changes in multi-version XML documents  

Microsoft Academic Search

We present the diX algorithm for detecting changes between two versions of an XML document. The identi…ed changes are reported as a script of edit operations. The script, when applied to the …rst version of the XML document, will produce the second version. The goal is to optimize the runtime of mapping the nodes between the two versions and to

Raihan Al-ekram; Archana Adma; Olga Baysal

2005-01-01

363

Publishing and Querying the Histories of Archived Relational Databases in XML  

Microsoft Academic Search

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

Fusheng Wang; Carlo Zaniolo

2003-01-01

364

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

Microsoft Academic Search

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

Octavio Santana Suárez; Francisco J. Carreras Riudavets; Zenón José Hernández Figueroa; Antonio C. González Cabrera

2007-01-01

365

Extending Tree Automata to Model XML Validation Under Element and Attribute Constraints  

Microsoft Academic Search

Algorithms for validation play a crucial role in the use of XML. Although much effort has been made for formalizing the treatment of elements, attributes have been neglected. This paper presents a validation model for XML documents that takes into account element and attribute constraints imposed by a given DTD. Our main contribution is the introduction of a new formalism

Béatrice Bouchou; Mirian Halfeld Ferrari Alves; Dominique Laurent; Denio Duarte

2003-01-01

366

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

ERIC Educational Resources Information Center

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

Snyder, Robin

2004-01-01

367

The SphereSearch Engine for Unified Ranked Retrieval of Heterogeneous XML and Web Documents  

Microsoft Academic Search

This paper presents the novel SphereSearch Engine that provides unified ranked retrieval on heterogeneous XML and Web data. Its search capabilities include vague structure conditions, text content conditions, and relevance ranking based on IR statistics and statistically quantified ontological relationships. Web pages in HTML or PDF are automatically converted into XML format, with the option of generating semantic tags by

Jens Graupmann; Ralf Schenkel; Gerhard Weikum

2005-01-01

368

Conceptual modeling and specification generation for B2B business processes based on ebXML  

Microsoft Academic Search

In order to support dynamic setup of business processes among independent organizations, a formal standard schema for describing the business processes is basically required. The ebXML framework provides such a specification schema called BPSS (Business Process Specification Schema) which is available in two stand-alone representations: a UML version, and an XML version. The former, however, is not intended for the

HyoungDo Kim

2002-01-01

369

Conceptual Modeling and Specification Generation for B2B Business Processes based on ebXML  

Microsoft Academic Search

In order to support dynamic setup of business processes among independent organizations, a formal standard schema for describing the business processes is basically required. The ebXML framework provides such a specification schema called BPSS (Business Process Specification Schema) which is available in two stand- alone representations: a UML version, and an XML version. The former, however, is not intended for

HyoungDo Kim

370

ebXML Business Processes - Defined both in UMM and BPSS  

Microsoft Academic Search

The ebXML framework consists of eight specifications for conducting e- Business. The loosely coupled specifications span over the topics of messaging, reg- istries, profiles & agreements, business processes, and core (data) components. The choreography of business processes is defined by instances of the business processes specification schema (BPSS). The BPSS is defined as an XML schema used by busi- ness

Birgit Hofreiter; Christian Huemer

371

Construction of an XML/RDF Schema for Description and Automated Severity Assessment of Ophthalmic Images  

PubMed Central

We have built an Extensible Markup Language (XML) schema to describe ophthalmic images using the Resource Description Framework (RDF), an XML application for encoding and exchange of structured metadata. The schema describes the types of resources and property values allowed for a wide variety of images commonly used in clinical ophthalmology and is being used to populate an ophthalmic image database.

Michon, JJ; Dev, Parvati

2001-01-01

372

Improving the workflow while reducing the costs: using XML for web site content management in government agencies  

Microsoft Academic Search

XML seems to be a promising alternative for developing and managing e-government web sites. However, there is a lack of empirical research about the use of XML for web site content management in government settings. Based on a multi-method research study, this poster will describe some of the advantages and challenges of using XML. Specifically, it will highlight its potential

José Ramón Gil-garcía; Donna S. Canestraro; Jim Costello; Andrea Baker; Derek Werthmuller

2006-01-01

373

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

374

Associating Style Sheets with XML documents Version 1.0  

NSDL National Science Digital Library

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

1999-01-01

375

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

376

An XML-based format for guideline interchange and execution.  

PubMed

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

377

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

378

Model-based dispersive wave processing: A recursive Bayesian solution  

SciTech Connect

Wave propagation through dispersive media represents a significant problem in many acoustic applications, especially in ocean acoustics, seismology, and nondestructive evaluation. In this paper we propose a propagation model that can easily represent many classes of dispersive waves and proceed to develop the model-based solution to the wave processing problem. It is shown that the underlying wave system is nonlinear and time-variable requiring a recursive processor. Thus the general solution to the model-based dispersive wave enhancement problem is developed using a Bayesian {ital maximum a posteriori} (MAP) approach and shown to lead to the recursive, nonlinear extended Kalman filter (EKF) processor. The problem of internal wave estimation is cast within this framework. The specific processor is developed and applied to data synthesized by a sophisticated simulator demonstrating the feasibility of this approach. {copyright} {ital 1999 Acoustical Society of America.}

Candy, J.V.; Chambers, D.H. [University of California, Lawrence Livermore National Laboratory, P.O. Box 808, L-156 Livermore, California 94551 (United States)

1999-06-01

379

Exact calculations of first-passage quantities on recursive networks  

NASA Astrophysics Data System (ADS)

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.

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

2012-02-01

380

A recursive method to calculate nuclear level densities  

NASA Astrophysics Data System (ADS)

With the help of a recursive method, the number of levels of a many-fermion system confined by a harmonic oscillator potential is computed as a function of excitation energy. Due to its exact nature the formalism accounts for effects of shell structure on the level density. The method is easily extended to a variety of situations such as the inclusion of isospin and of deformation effects or the calculation of the fraction of spurious states. The recursive method can be generalised to a system of fermions distributed over a set of single-particle levels with arbitrary energies and degeneracies. Its potential applications in the calculation of level densities in nuclei far from stability will be pointed out.

van Isacker, Piet

2002-10-01

381

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

382

Experimental Evaluation of Different Realizations of Recursive CIC Filters  

Microsoft Academic Search

Bit-serial and bit-parallel arithmetic for parallel realization of CIC (cascaded integrator-comb) filters for decimation in DeltaSigma converters are described. This paper goes forward by realizing a CIC filter, which is designed for use as the first stage of a four-stage decimation filter with down-sampling factor of 128. It is a fifth-order recursive CIC filter which reduces the sampling rate by

S. M. Mortazavi Zanjani; S. Rahimian Omam; Seid Mehdi Fakhraie; Omid Shoaei

2006-01-01

383

Recursion formula for electron repulsion integrals over Hermite polynomials  

NASA Astrophysics Data System (ADS)

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

Fletcher, G. D.

384

A survey of max-type recursive distributional equations  

Microsoft Academic Search

In certain problems in a variety of applied probability settings (from probabilistic analysis of algorithms to statistical physics), the central requirement is to solve a recursive distributional equation of the form $X\\\\mathop{=}\\\\limits^{d}\\\\,g((\\\\xi_{i},X_{i}),i\\\\geq 1)$ . Here (?i<\\/sub>) and g(?) are given and the Xi<\\/sub> are independent copies of the unknown distribution X. We survey this area, emphasizing examples where the function

David J. Aldous; Antar Bandyopadhyay

2005-01-01

385

Recursion operators for dispersionless integrable systems in any dimension  

NASA Astrophysics Data System (ADS)

We present a new approach to construction of recursion operators for multidimensional integrable systems which have a Lax-type representation in terms of a pair of commuting vector fields. It is illustrated by the examples of the Manakov-Santini system which is a hyperbolic system in N dependent and (N + 4) independent variables, where N is an arbitrary natural number, the six-dimensional generalization of the first heavenly equation, the modified heavenly equation and the dispersionless Hirota equation.

Marvan, M.; Sergyeyev, A.

2012-02-01

386

The design and applications of a recursive molecular modeling framework.  

PubMed

In this paper, we present a recursive molecular model suitable for multiresolution analysis in a variety of application areas. Our approach allows ease of use by computer scientists and biologists by proposing a software interface for molecular analysis that hides programming details. We demonstrate that our design is flexible enough for use in desktop analytical applications, in large-scale parallel simulations, and as a server for remote molecular analysis across wide-area networks. PMID:10866415

Lisle, C; Parsons, R

2000-06-01

387

Structural properties of the noncommutative KdV recursion operator  

NASA Astrophysics Data System (ADS)

The present work studies structural properties of the recursion operator of the noncommutative KdV equation. As the main result, it is proved that this operator is hereditary. The notion of hereditary operators was introduced by Fuchssteiner for infinite-dimensional integrable systems, building on classical concepts from differential topology. As an illustration for the consequences of this property, it is deduced that the flows of the noncommutative KdV hierarchy mutually commute.

Schiebold, C.

2011-11-01

388

A novel recursive Bayesian learning-based method for the efficient and accurate segmentation of video with dynamic background.  

PubMed

Segmentation of video with dynamic background is an important research topic in image analysis and computer vision domains. In this paper, we present a novel recursive Bayesian learning-based method for the efficient and accurate segmentation of video with dynamic background. In the algorithm, each frame pixel is represented as the layered normal distributions which correspond to different background contents in the scene. The layers are associated with a confident term and only the layers satisfy the given confidence which will be updated via the recursive Bayesian estimation. This makes learning of background motion trajectories more accurate and efficient. To improve the segmentation quality, the coarse foreground is obtained via simple background subtraction first. Then, a local texture correlation operator is introduced to fill the vacancies and remove the fractional false foreground regions. Extensive experiments on a variety of public video datasets and comparisons with some classical and recent algorithms are used to demonstrate its improvements in both segmentation accuracy and efficiency. PMID:22614652

Zhu, Qingsong; Song, Zhan; Xie, Yaoqin; Wang, Lei

2012-05-15

389

Dynamics of deformable multibody systems using recursive projection methods  

NASA Astrophysics Data System (ADS)

In this investigation, generalized Newton-Euler equations are developed for deformable bodies that undergo large translational and rotational displacements. The configuration of the deformable body is identified using coupled sets of reference and elastic variables. The nonlinear generalized Newton-Euler equations are formulated in terms of a set of time invariant scalars and matrices that depend on the spatial coordinates as well as the assumed displacement field. These time-invariant quantities appear in the nonlinear terms that represent the dynamic coupling between the rigid body modes and the elastic deformation. A set of recursive kinematic equations, in which the absolute accelerations are expressed in terms of the joint and elastic accelerations are developed for several joint types. The recursive kinematic equations and the joint reaction relationships are combined with the generalized Newton-Euler equations in order to obtain a system of loosely coupled equations which have sparse matrix structure. Using matrix partitioning and recursive projection techniques based on optimal block factorization an order n solution for the system equations is obtained.

Shabana, A. A.

1992-12-01

390

Identifying clusters in genomics data by recursive partitioning.  

PubMed

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

Nilsen, Gro; Borgan, Ornulf; Liestøl, Knut; Lingjærde, Ole Christian

2013-10-01

391

Recursion relations for AdS/CFT correlators  

SciTech Connect

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

Raju, Suvrat [Harish-Chandra Research Institute, Jhunsi, Allahabad, 211019 (India)

2011-06-15

392

XML-based description and presentation of multimedia radiological data  

NASA Astrophysics Data System (ADS)

An XML-based application was developed, allowing to access multimedia/radiological data over a network and to visualize them in an integrated way within a standard web browser. Four types of data are considered: radiological images, the corresponding speech and text files produced by the radiologist, and administrative data concerning the study (patient name, radiologist's name, date, etc.). Although these different types of data are typically stored on different file systems, their relationship (e.g., image file X corresponds to speech file Y) is described in a global relational database. The administrative data are referred to in an XML file, while links between the corresponding images, speech, and text files (e.g., links between limited text fragments within the text tile, the corresponding fragment in the speech file, and the corresponding subset of images) are described as well. Users are able to access all data through a web browser by submitting a form-based request to the server. By using scripting technology, a HTML document containing all data is produced on the fly, which can be presented within the browser of the user. Our application was tested for a real set of clinical data, and it was proven that the goals that were defined above are realized.

Van de Walle, Rik; Rogge, Boris; Dreelinck, Koen; Lemahieu, Ignace L.

2000-10-01

393

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

PubMed Central

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

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

2011-01-01

394

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

395

Engineering synthetic recursive pathways to generate non-natural small molecules.  

PubMed

Recursive pathways are broadly defined as those that catalyze a series of reactions such that the key, bond-forming functional group of the substrate is always regenerated in each cycle, allowing for a new cycle of reactions to begin. Recursive carbon-chain elongation pathways in nature produce fatty acids, polyketides, isoprenoids and ?-keto acids (?KAs), which all use modular or iterative approaches for chain elongation. Recently, an artificial pathway for ?KA elongation has been built that uses an engineered isopropylmalate synthase to recursively condense acetyl-CoA with ?KAs. This synthetic approach expands the possibilities for recursive pathways beyond the modular or iterative synthesis of natural products and serves as a case study for understanding the challenges of building recursive pathways from nonrecursive enzymes. There exists the potential to design synthetic recursive pathways far beyond what nature has evolved. PMID:22596203

Felnagle, Elizabeth A; Chaubey, Asha; Noey, Elizabeth L; Houk, Kendall N; Liao, James C

2012-05-17

396

Lessons in scientific data interoperability: XML and the eMinerals project.  

PubMed

A collaborative environmental eScience project produces a broad range of data, notable as much for its diversity, in source and format, as its quantity. We find that extensible markup language (XML) and associated technologies are invaluable in managing this deluge of data. We describe Fo X, a toolkit for allowing Fortran codes to read and write XML, thus allowing existing scientific tools to be easily re-used in an XML-centric workflow. PMID:19087946

White, T O H; Bruin, R P; Chiang, G-T; Dove, M T; Tyer, R P; Walker, A M

2009-03-13

397

Performance evaluation of a recursive LA\\/IR protocol for MC-CDMA power line communications  

Microsoft Academic Search

The performance evaluation of a recursive link adaptation\\/incremental redundancy (LA\\/IR) protocol is made on a power line channel for communication purposes. The recursive LA\\/IR protocol has been tested for a wireless channel and proved to have an improved performance compared to other pure IR protocols or hybrid non-recursive LA\\/IR. The communication medium is the power line in buildings grid where

C. Assimakopoulos; F.-N. Pavlidou

2002-01-01

398

Efficient Recursive Algorithms for Computing the Mean Diffusion Tensor and Applications to DTI Segmentation?  

PubMed Central

Computation of the mean of a collection of symmetric positive definite (SPD) matrices is a fundamental ingredient of many algorithms in diffusion tensor image (DTI) processing. For instance, in DTI segmentation, clustering, etc. In this paper, we present novel recursive algorithms for computing the mean of a set of diffusion tensors using several distance/divergence measures commonly used in DTI segmentation and clustering such as the Riemannian distance and symmetrized Kullback-Leibler divergence. To the best of our knowledge, to date, there are no recursive algorithms for computing the mean using these measures in literature. Recursive algorithms lead to a gain in computation time of several orders in magnitude over existing non-recursive algorithms. The key contributions of this paper are: (i) we present novel theoretical results on a recursive estimator for Karcher expectation in the space of SPD matrices, which in effect is a proof of the law of large numbers (with some restrictions) for the manifold of SPD matrices. (ii) We also present a recursive version of the symmetrized KL-divergence for computing the mean of a collection of SPD matrices. (iii) We present comparative timing results for computing the mean of a group of SPD matrices (diffusion tensors) depicting the gains in compute time using the proposed recursive algorithms over existing non-recursive counter parts. Finally, we also show results on gains in compute times obtained by applying these recursive algorithms to the task of DTI segmentation.

Cheng, Guang; Salehian, Hesamoddin

2013-01-01

399

Managing and querying image annotation and markup in XML  

NASA Astrophysics Data System (ADS)

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

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

2010-03-01

400

Teaching object concepts for XML-based representations.  

SciTech Connect

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

Kelsey, R. L. (Robert L.)

2002-01-01

401

XML-based Gating Descriptions in Flow Cytometry  

PubMed Central

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

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

2008-01-01

402

Simulation framework and XML detector description for the CMS experiment  

NASA Astrophysics Data System (ADS)

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

Arce, P.; Banerjee, S.; Boccali, T.; Case, M.; de Roeck, A.; Lara, V.; Liendl, M.; Nikitenko, A.; Schroder, M.; Straessner, A.; Wellisch, H. P.; Wenzel, H.

2003-04-01

403

Common Data Format: New XML and Conversion Tools  

NASA Astrophysics Data System (ADS)

Common Data Format (CDF) is a self-describing platform-independent data format for storing, accessing, and manipulating scalar and multidimensional scientific data sets. Significant benefit has accrued to specific science communities from their use of standard formats within those communities. Examples include the International Solar Terrestrial Physics (ISTP) community in using CDF for traditional space physics data (fields, particles and plasma, waves, and images), the worldwide astronomical community in using FITS (Flexible Image Transport System) for solar data (primarily spectral images), the NASA Planetary community in using Planetary Data System (PDS) Labels, and the earth science community in using Hierarchical Data Format (HDF). Scientific progress in solar-terrestrial physics continues to be impeded by the multiplicity of available standards for data formats and dearth of general data format translators. As a result, scientists today spend a significant amount of time translating data into the format they are familiar with for their research. To minimize this unnecessary data translation time and to allow more research time, the CDF office located at GSFC National Space Science Data Center (NSSDC) has developed HDF-to-CDF and FITS-to-CDF translators, and employed the eXtensible Markup Language (XML) technology to facilitate and promote data interoperability within the space science community. We will present the current status of the CDF work including the conversion tools that have been recently developed, conversion tools that are planned in the near future, share some of the XML experiences, and use the discussion to gain community feedback to our planned future work.

Han, D. B.; Liu, M. H.; McGuire, R. E.

2002-12-01

404

Using recursive partitioning analysis to evaluate compound selection methods.  

PubMed

The design and analysis of a screening set for high throughput screening is complex. We examine three statistical strategies for compound selection, random, clustering, and space-filling. We examine two types of chemical descriptors, BCUTs and principal components of Dragon Constitutional descriptors. Based on the predictive power of multiple tree recursive partitioning, we reached the following tentative conclusions. Random designs appear to be as good as clustering and space-filling designs. For analysis, BCUTs appear to be better than principal components scores based upon Constitutional Descriptors. We confirm previous results that model-based selection of compounds can lead to improved screening hit rates. PMID:15141119

Young, S Stanley; Hawkins, Douglas M

2004-01-01

405

Bridging Two Biomedical Journal Databases with XML-A Case Study  

Microsoft Academic Search

For transferring data between heterogeneous databases, XML is becoming a method of choice. While deployment is generally successfully, there are barriers to overcome. A recent example at NLM involved transfers between \\

Glenn Pearson; Chan Moon

2001-01-01

406

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.

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

2009-01-01

407

XML-Based Knowledge Management System of Port Information for U.S. Coast Guard Cutters.  

National Technical Information Service (NTIS)

This thesis describes the development of a prototype application that collects, manages, and distributes knowledge gained by Coast Guard cutter crews making port calls throughout the world. The system uses XML technologies in server/client and stand alone...

J. D. Stewart

2003-01-01

408

xml version="1.0" encoding="UTF-8" standalone="yes"?> ...  

Center for Biologics Evaluation and Research (CBER)

... application/vnd.openxmlformats-officedocument.theme+xml"/> More results from www.fda.gov/downloads/advisorycommittees/committeesmeetingmaterials

409

xml version="1.0" encoding="UTF-8" ?> ...  

Center for Drug Evaluation (CDER)

xml version="1.0" encoding="UTF-8" ?> Fri, 04 Oct 2013 18:32:00 -0400

410

On boosting holism in XML twig pattern matching using structural indexing techniques  

Microsoft Academic Search

Searching for all occurrences of a twig pattern in an XML document is an important operation in XML query processing. Recently a holistic method TwigStack. [2] has been proposed. The method avoids generating large intermediate results which do not contribute to the final answer and is CPU and I\\/O optimal when twig patterns only have ancestor-descendant relationships. Another important direction

Ting Chen; Jiaheng Lu; Tok Wang Ling

2005-01-01

411

eXtended cumulated gain measures for the evaluation of content-oriented XML retrieval  

Microsoft Academic Search

We propose and evaluate a family of measures, the eXtended Cumulated Gain (XCG) measures, for the evaluation of content-oriented XML retrieval approaches. Our aim is to provide an evaluation framework that allows the consideration of dependency among XML document components. In particular, two aspects of dependency are considered: (1) near-misses, which are document components that are structurally related to relevant

Gabriella Kazai; Mounia Lalmas

2006-01-01

412

GaXsearch: An XML Information Retrieval Mechanism Using Genetic Algorithms  

Microsoft Academic Search

\\u000a The XML technology, with its self-describing and extensible tags, is significantly contributing to the next generation semantic\\u000a web. The present search techniques used for HTML and text documents are not efficient to retrieve relevant XML documents.\\u000a In this paper, Genetic Algorithms are presented to learn about the tags, which are useful in indexing. The indices and relationship\\u000a strength metric are

K. G. Srinivasa; S. Sharath; K. R. Venugopal; Lalit M. Patnaik

2005-01-01

413

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

414

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

Microsoft Academic Search

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

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

2008-01-01

415

A Lock Manager for Collaborative Processing of Natively Stored XML Documents  

Microsoft Academic Search

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

Michael Peter Haustein; Theo Härder

2004-01-01

416

An Evolutionary Algorithm for Optimization of XML Publish\\/Subscribe Middleware in Electronics Production  

Microsoft Academic Search

Computer aided manufacturing using XML (CAMX) production systems are built on Message-Oriented Middleware Frameworks, offering standards-based communication among machines and control software applications. CAMX Frameworks implement Publish\\/Subscribe of XML messages through an entity called the Message Broker (MSB). In order to create scalable frameworks, distributed MSB systems need to be deployed. In the distributed case, the topology optimization problem arises,

Ivan M. Delamer; Jose L. Martinez Lastra; Oscar Perez

2006-01-01

417

An Analysis of Integration Problems of XML-Based Catalogs for B2B Electronic Commerce  

Microsoft Academic Search

Electronic B2B marketplaces bring together many online suppliers and buyers, each of which can potentially use his own format to represent the products in his product catalog. The marketplaces have to perform non-trivial mappings of these catalogs. In this paper we analyze the problems which occur during integration, taking several leading XML and non-XML formats as examples. We discuss the

Borys Omelayenko; Dieter Fensel

2001-01-01

418

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

PubMed

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-02-22

419

A Systematic Design Approach for XML-View Driven Web Document Warehouses  

Microsoft Academic Search

\\u000a EXtensible Markup Language (XML) has emerged as the dominant standard in describing and exchanging data among heterogeneous\\u000a data sources. The ever increasing presence of XML web contents in large volumes creates the need to investigate Web Document\\u000a Warehouses (WDW) and Web Document Marts, as a means of archiving and analysing large web contents for context-aware web\\/business\\u000a intelligence. To address such

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

2005-01-01

420

An Adaptable XML Based Approach for Scientific Data Management and Integration  

PubMed Central

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

2011-01-01

421

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

422

A recursive fast algorithm for the linear canonical transform  

NASA Astrophysics Data System (ADS)

The Linear Canonical Transform (LCT) describes the effect of any Quadratic Phase System (QPS) on an input optical wavefield. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT) and the Fresnel Transform (FST) describing free space propagation. We have recently published theory for the Discrete Linear Canonical Transform (DLCT), which is to the LCT what the Discrete Fourier Transform (DFT) is to the FT and we have derived the Fast Linear Canonical Transform (FLCT), a NlogN, algorithm for its numerical implementation using an approach similar to that used in deriving the FFT from the DFT. The algorithm is significantly different to the FFT and is based purely on the properties of the LCT and can be used for fast FT, FRT and FST calculations and in the most general case to rapidly calculate the effect of any QPS. In this paper we develop theory making the algorithm recursive for ease of implementation. We derive the FLCT butterfly and graph a flowchart for the recursive algorithm.

Hennelly, B. M.; Sheridan, J. T.

2005-06-01

423

Recursive partitioning for monotone missing at random longitudinal markers.  

PubMed

The development of HIV resistance mutations reduces the efficacy of specific antiretroviral drugs used to treat HIV infection and cross-resistance within classes of drugs is common. Recursive partitioning has been extensively used to identify resistance mutations associated with a reduced virologic response measured at a single time point; here we describe a statistical method that accommodates a large set of genetic or other covariates and a longitudinal response. This recursive partitioning approach for continuous longitudinal data uses the kernel of a U-statistic as the splitting criterion and avoids the need for parametric assumptions regarding the relationship between observed response trajectories and covariates. We propose an extension of this approach that allows longitudinal measurements to be monotone missing at random by making use of inverse probability weights. We assess the performance of our method using extensive simulation studies and apply them to data collected by the Forum for Collaborative HIV Research as part of an investigation of the viral genetic mutations associated with reduced clinical efficacy of the drug abacavir. PMID:22941582

Stock, Shannon; DeGruttola, Victor

2012-09-02

424

ASIC implementation of recursive scaled discrete cosine transform algorithm  

NASA Astrophysics Data System (ADS)

A program to implement the Recursive Scaled Discrete Cosine Transform (DCT) algorithm as proposed by H. S. Hou has been undertaken at the Institute of Microelectronics. Implementation of the design was done using top-down design methodology with VHDL (VHSIC Hardware Description Language) for chip modeling. When the VHDL simulation has been satisfactorily completed, the design is synthesized into gates using a synthesis tool. The architecture of the design consists of two processing units together with a memory module for data storage and transpose. Each processing unit is composed of four pipelined stages which allow the internal clock to run at one-eighth (1/8) the speed of the pixel clock. Each stage operates on eight pixels in parallel. As the data flows through each stage, there are various adders and multipliers to transform them into the desired coefficients. The Scaled IDCT was implemented in a similar fashion with the adders and multipliers rearranged to perform the inverse DCT algorithm. The chip has been verified using Field Programmable Gate Array devices. The design is operational. The combination of fewer multiplications required and pipelined architecture give Hou's Recursive Scaled DCT good potential of achieving high performance at a low cost in using Very Large Scale Integration implementation.

On, Bill N.; Narasimhan, Sam; Huang, Victor K.

1994-05-01

425

Recursive three-dimensional model reconstruction based on Kalman filtering.  

PubMed

A recursive two-step method to recover structure and motion from image sequences based on Kalman filtering is described in this paper. The algorithm consists of two major steps. The first step is an extended Kalman filter (EKF) for the estimation of the object's pose. The second step is a set of EKFs, one for each model point, for the refinement of the positions of the model features in the three-dimensional (3-D) space. These two steps alternate from frame to frame. The initial model converges to the final structure as the image sequence is scanned sequentially. The performance of the algorithm is demonstrated with both synthetic data and real-world objects. Analytical and empirical comparisons are made among our approach, the interleaved bundle adjustment method, and the Kalman filtering-based recursive algorithm by Azarbayejani and Pentland. Our approach outperformed the other two algorithms in terms of computation speed without loss in the quality of model reconstruction. PMID:15971927

Yu, Ying Kin; Wong, Kin Hong; Chang, Michael Ming Yuen

2005-06-01

426

Recursive feature selection with significant variables of support vectors.  

PubMed

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

427

A Recursion Technique for Deriving Renormalized Perturbation Expansions for One-Dimensional Anharmonic Oscillator  

Microsoft Academic Search

A new recursion procedure for deriving renormalized perturbation expansions for the one-dimensional anharmonic oscillator is offered. Based upon the h-expansions and suitable quantization conditions, the recursion formulae obtained have the same simple form both for ground and excited states and can be easily applied to any renormalization scheme. As an example, the renormalized expansions for the sextic anharmonic oscillator are

I. V. Dobrovolska; R. S. Tutik

2001-01-01

428

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

429

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

430

Some topological and combinatorial properties of WK-recursive mesh and WK-pyramid interconnection networks  

Microsoft Academic Search

The WK-recursive mesh and WK-pyramid networks are recursively defined hierarchical interconnection networks with excellent properties which well idealize them as alternatives for mesh and traditional pyr- amid interconnection topologies. They have received much attention due to their favorable attributes such as small diameter, large connectivity, and high degree of scalability and expandability. In this paper, we deal with pancyclicity and

M. Hoseiny Farahabady; Navid Imani; Hamid Sarbazi-azad

2008-01-01

431

Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking  

Microsoft Academic Search

Two recent developments in the fleld of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but deflnes syntax in terms of recognizing strings, rather than constructing them. It is, in fact, precise speciflcation of a backtracking recursive- descent parser. Packrat parsing is a general method to handle backtracking in recursive-descent parsers.

Roman R. Redziejowski

2007-01-01

432

Why structural recursion should be taught before arrays in CS 1  

Microsoft Academic Search

The approach to teaching recursion in introductory programming courses has changed little during the transition from procedural to object-oriented languages. It is still common to present recursion late in the course and to focus on traditional, procedural examples such as calculating factorials or solving the Towers of Hanoi puzzle. In this paper, we propose that the shift to object-oriented programming

Kim B. Bruce; Andrea Danyluk; Thomas Murtagh

2005-01-01

433

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

ERIC Educational Resources Information Center

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

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

2006-01-01

434

Adaptability of Methods for Processing XML Data using Relational Databases - the State of the Art and Open Problems  

Microsoft Academic Search

As XML technologies have become a standard for data representation, it is inevitable to propose and implement e-cient techniques for managing XML data. A natural alternative is to exploit tools and functions ofiered by (object-)relational database systems. Unfortunately, this approach has many objectors, especially due to ine-ciency caused by structural difierences between XML data and relations. On the other hand,

Jaroslav Pokorný

2007-01-01

435

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

436

Recursive estimation for the tracking of radioactive sources  

SciTech Connect

This paper describes a recursive estimation algorithm used for tracking the physical location of radioactive sources in real-time as they are moved around in a facility. The algorithm is related to a nonlinear least squares estimation that minimizes the change in the source location and the deviation between measurements and model predictions simultaneously. The measurements used to estimate position consist of four count rates reported by four different gamma ray detectors. There is an uncertainty in the source location due to the large variance of the detected count rate. This work represents part of a suite of tools which will partially automate security and safety assessments, allow some assessments to be done remotely, and provide additional sensor modalities with which to make assessments.

Howse, J.W.; Ticknor, L.O. [Los Alamos National Lab., NM (United States); Muske, K.R. [Villanova Univ., PA (United States). Dept. of Chemical Engineering

1998-12-31

437

Recursive Estimation for the Tracking of Radioactive Sources  

SciTech Connect

This paper describes a recursive estimation algorithm used for tracking the physical location of radioactive sources in real-time as they are moved around in a facility. The al- gorithm is a nonlinear least squares estimation that mini- mizes the change in, the source location and the deviation between measurements and model predictions simultane- ously. The measurements used to estimate position consist of four count rates reported by four different gamma ray de tectors. There is an uncertainty in the source location due to the variance of the detected count rate. This work repre- sents part of a suite of tools which will partially automate security and safety assessments, allow some assessments to be done remotely, and provide additional sensor modalities with which to make assessments.

Howse, J.W.; Muske, K.R.; Ticknor, L.O.

1999-02-01

438

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

439

Decentralized Job Shop Scheduling by Recursive Propagation Method  

NASA Astrophysics Data System (ADS)

A new information exchange method named recursive propagation is proposed in order to solve job shop scheduling problems in decentralized manufacturing systems. Each machine only has to notify the change of its plan to other machines which are directly influenced by the change. The effect of the change in the plan is directly fed back to the machine which notified the change. The change in the plan is notified to all the machines concerned by simple one-to-one communication among the machines, and the influence of the change caused by its action can be reported to the initiator through the same communication path. The proposed method is applied to a 20×10 job shop scheduling problem, and the feasibility of this approach is verified by simulations.

Hino, Rei; Moriwaki, Toshimichi

440

Dynamics of flexible multibody space cranes using recursive projection methods  

NASA Astrophysics Data System (ADS)

A computer implementation of recursive projection methods in flexible multibody dynamics is discussed. The computer program consists of three main modules: constraint module, mass module, and force module. In the constraint module, the relationships between the absolute, joint, and elastic accelerations are developed. In the mass module, the mass matrix of each body in the system as well as the nonlinear Coriolis and centrifugal forces associated with the absolute and elastic coordinates are evaluated. The force module is used to evaluate the externally applied forces and elastic forces associated with the absolute, joint, and elastic coordinates. Elimination of the elastic coordinates and projection of the inertia of the child (leaf) bodies into the space of coordinates of the parent (root) bodies lead to a small number of equations which can be solved for the joint accelerations. The problem of the multibody space crane is considered as an example.

Hwang, Y. L.; Shabana, A. A.

1992-05-01

441

Recurrent networks with recursive processing elements: paradigm for dynamical computing  

NASA Astrophysics Data System (ADS)

It was shown earlier that models of cortical neurons can, under certain conditions of coherence in their input, behave as recursive processing elements (PEs) that are characterized by an iterative map on the phase interval and by bifurcation diagrams that demonstrate the complex encoding cortical neurons might be able to perform on their input. Here we present results of numerical experiments carried on a recurrent network of such recursive PEs modeled by the logistic map. Network behavior is studied under a novel scheme for generating complex spatio-temporal input patterns that could range from being coherent to partially coherent to being completely incoherent. A nontraditional nonlinear coupling scheme between neurons is employed to incorporate recent findings in brain science, namely that neurons use more than one kind of neurotransmitter in their chemical signaling. It is shown that such network shave the capacity to 'self-anneal' or collapse into period-m attractors that are uniquely related to the stimulus pattern following a transient 'chaotic' period during which the network searches it state-space for the associated dynamic attractor. The network accepts naturally both dynamical or stationary input patterns. Moreover we find that the use of quantized coupling strengths, introduced to reflect recent molecular biology and neurophysiological reports on synapse dynamics, endows the network with clustering ability wherein, depending ont eh stimulus pattern, PEs in the network with clustering ability wherein, depending on the stimulus pattern, PEs in the network divide into phase- locked groups with the PEs in each group being synchronized in period-m orbits. The value of m is found to be the same for all clusters and the number of clusters gives the dimension of the periodic attractor. The implications of these findings for higher-level processing such as feature- binding and for the development of novel learning algorithms are briefly discussed.

Farhat, Nabil H.; del Moral Hernandez, Emilio

1996-11-01

442

Learning to play Go using recursive neural networks.  

PubMed

Go is an ancient board game that poses unique opportunities and challenges for artificial intelligence. Currently, there are no computer Go programs that can play at the level of a good human player. However, the emergence of large repositories of games is opening the door for new machine learning approaches to address this challenge. Here we develop a machine learning approach to Go, and related board games, focusing primarily on the problem of learning a good evaluation function in a scalable way. Scalability is essential at multiple levels, from the library of local tactical patterns, to the integration of patterns across the board, to the size of the board itself. The system we propose is capable of automatically learning the propensity of local patterns from a library of games. Propensity and other local tactical information are fed into recursive neural networks, derived from a probabilistic Bayesian network architecture. The recursive neural networks in turn integrate local information across the board in all four cardinal directions and produce local outputs that represent local territory ownership probabilities. The aggregation of these probabilities provides an effective strategic evaluation function that is an estimate of the expected area at the end, or at various other stages, of the game. Local area targets for training can be derived from datasets of games played by human players. In this approach, while requiring a learning time proportional to N(4), skills learned on a board of size N(2) can easily be transferred to boards of other sizes. A system trained using only 9 x 9 amateur game data performs surprisingly well on a test set derived from 19 x 19 professional game data. Possible directions for further improvements are briefly discussed. PMID:18420381

Wu, Lin; Baldi, Pierre

2008-03-04

443

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

NASA Astrophysics Data System (ADS)

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

Rafailov, Michael K.

2006-09-01

444

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

PubMed

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

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

2012-11-21

445

Nonconvex variational problem with recursive integral functionals in Sobolev spaces: Existence and representation  

NASA Astrophysics Data System (ADS)

The purpose of this paper is twofold. First, we present the existence theorem of an optimal trajectory in a nonconvex variational problem with recursive integral functionals by employing the norm-topology of a weighted Sobolev space. We show the continuity of the integral functional and the compactness of the set of admissible trajectories. Second, we show that a recursive integrand is represented by a normal integrand under the conditions guaranteeing the existence of optimal trajectories. We also demonstrate that if the recursive integrand satisfies the convexity conditions, then the normal integrand is a convex function. These results are achieved by the application of the representation theorem in Lp-spaces.

Sagara, Nobusumi

2007-03-01

446

Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach  

Microsoft Academic Search

We propose a new, highly scalable and e- cient technique for evaluating node-selecting queries on XML trees which is based on re- cent advances in the theory of tree automata. Our query processing techniques require only two linear passes over the XML data on disk, and their main memory requirements are in principle independent of the size of the data.

Christoph Koch

2003-01-01

447

Interface Ecology Lab Technical Report 08-06 Expressive, Efficient, Embedded, and Component-based XML-Java Data Binding Framework  

Microsoft Academic Search

Writing efficient, correct programs to process complex XML documents can be time-consuming and difficult. While data binding frameworks automate translating untyped, structured XML data into strongly typed data structures, their overhead, in terms of configuration during development and maintenance, and CPU at runtime, may be prohibitive. We present an open source XML-Java data binding framework to optimize the efficiency and

Andruid Kerne; Zachary O. Toups; Blake Dworaczyk; Madhur Khandelwal

448

DataStaR: Bridging XML and OWL in Science Metadata Management  

NASA Astrophysics Data System (ADS)

DataStaR is a science data “staging repository” developed by Albert R. Mann Library at Cornell University that produces semantic metadata while enabling the publication of data sets and accompanying metadata to discipline-specific data centers or to Cornell’s institutional repository. DataStaR, which employs OWL and RDF in its metadata store, serves as a Web-based platform for production and management of metadata and aims to reduce redundant manual input by reusing named ontology individuals. A key requirement of DataStaR is the ability to produce metadata records conforming to existing XML schemas that have been adopted by scientific communities. To facilitate this, DataStaR integrates ontologies that directly reflect XML schemas, generates HTML editing forms, and “lowers” ontology axioms into XML documents compliant with existing schemas. This paper describes our approach and implementation, and discusses the challenges involved.

Lowe, Brian

449

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

NASA Astrophysics Data System (ADS)

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

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

2003-07-01

450

Recursive Formulation for the Dynamic Analysis of Open Loop Deformable Multibody Systems,  

National Technical Information Service (NTIS)

In this paper, a recursive formulation for the spatial kinematic and dynamic analysis of open chain mechanical systems containing interconnected deformable bodies, each of which may undergo large translational and rotational displacements, is developed. T...

K. Changizi A. A. Shabana

1988-01-01

451

Using Structural Joins and Holistic Twig Joins for Native XML Query Optimization  

NASA Astrophysics Data System (ADS)

One of the most important factors for success of native XML database systems is a powerful query optimizer. Surprisingly, little has been done to develop cost models to enable cost-based optimization in such systems. Since the entire optimization process is so complex, only a stepwise approach will lead to a satisfying (future) solution. In this work, we are paving the way for cost-based XML query optimization by developing cost formulae for two important join operators, which allow to perform join reordering and join fusion in a cost-aware way, and, therefore, make joint application of Structural Joins and Holistic Twig Joins possible.

Weiner, Andreas M.; Härder, Theo

452

Development and Validation of XML-based Calculations within Order Sets  

PubMed Central

We have developed two XML Schemas to support the implementation of calculations within XML-based order sets for use within a physician order entry system. The models support the representation of variable-based algorithms and include data elements designed to support ancillary functions such as input range checking, rounding, and minimum/maximum value constraints. Two clinicians successfully authored 57 unique calculated orders derived from a set of 11 calculations using the models within our authoring environment. The resultant knowledge base content was subsequently tested and found to produce the desired results within the electronic physician order entry environment.

Hulse, Nathan C.; Del Fiol, Guilherme; Rocha, Roberto A.

2005-01-01

453

ebIOP: An ebXML Compliant B2B Interoperability Platform  

Microsoft Academic Search

\\u000a Interoperability has become one of the big problems of e-commerce since it was born. A number of B2B standards like ebXML,\\u000a UDDI, RosettaNet, xCBL, etc. emerged recently to solve the interoperability problem. UDDI and ebXML are the leading standards\\u000a in the area of e-commerce that provide different solutions for interoperability. UDDI standard provides a service based solution\\u000a that proposes a

Yusuf Tambag; Ahmet Cosar

2003-01-01

454

Non-recursive cascaded integrator-comb decimation filters with integer multiple factors  

Microsoft Academic Search

In this paper, multi-rate non-recursive architecture for Cascaded Integrator-Comb (CIC) decimation filters with an arbitrary factor is proposed. The CIC filters are widely used in high speed wireless communication systems since they have multiplier-less and multi-rate low-power structure. Even conventional non-recursive CIC structure is multi-rate, this architecture can be structured only in case of M-th power-of-two decimation factor. This paper

Youngbeom Jang; Sejung Yang

2001-01-01

455

Recursive computation of moments of 2D objects represented by elliptic Fourier descriptors  

Microsoft Academic Search

This paper develops a recursive method for computing moments of 2D objects described by elliptic Fourier descriptors (EFD). To this end, Green’s theorem is utilized to transform 2D surface integrals into 1D line integrals and EFD description is employed to derive recursions for moments computations. A complexity analysis is provided to demonstrate space and time efficiency of our proposed technique.

Octavian Soldea; Mustafa Unel; Aytül Erçil

2010-01-01

456

Finite-difference Time-domain Algorithm for Plasma Based on Trapezoidal Recursive Convolution Technique  

Microsoft Academic Search

The electromagnetic wave propagation in plasma media is modeled using finite-difference time-domain (FDTD) method based on\\u000a the trapezoidal recursive convolution (TRC) Technique. The TRC Technique requires single convolution integral in the formulation\\u000a as in the recursive convolution (RC) method, while maintaining the accuracy comparable to the piecewise linear convolution\\u000a integral (PLRC) method with two convolution integrals. The three dimensional (3-D)

Song Liu; Sanqiu Liu; Shaobin Liu

2010-01-01

457

Learning indexed families of recursive languages from positive data: A survey  

Microsoft Academic Search

Abstract In the past 40 years, research on inductive inference has developed along dierent lines, e.g., in the formalizations used, and in the classes of target concepts considered. One common,root of many of these formalizations is Gold’s model of identication in the limit. This model has been studied for learning recursive functions, recur- sively enumerable languages, and recursive languages, reecting

Steffen Lange; Thomas Zeugmann; Sandra Zilles

2008-01-01

458

A Generalized Recursive Algorithm for Binary Multiplication based on Vedic Mathematics  

Microsoft Academic Search

A generalized algorithm for multiplication is proposed through recursive\\u000aapplication of the Nikhilam Sutra from Vedic Mathematics, operating in radix -\\u000a2 number system environment suitable for digital platforms. Statistical\\u000aanalysis has been carried out based on the number of recursions profile as a\\u000afunction of the smaller multiplicand. The proposed algorithm is efficient for\\u000asmaller multiplicands as well, unlike

Ajinkya Kale; Shaunak Vaidya; Ashish Joglekar

2009-01-01

459

Posterior analysis of restricted seemingly unrelated regression equation models: a recursive analytical approach  

Microsoft Academic Search

The scope of exact analytical results in Bayesian econometrics is known to be quite limited. It is, however, shown here to be broader than the simple natural-conjugare framework. Restricting the coefficients of a SURE model in a recursive linear way can not be accommodated in a natural-conjugate analysis,but still allows for analytical ingerence, exploiting the recursive characteristics over equations. These

Mark F. J. Steel

1992-01-01

460

Partial and Nested Recursive Function Definitions in Higher-order Logic  

Microsoft Academic Search

Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order\\u000a logic (HOL) and provides appropriate proof rules for reasoning about them. Termination is modeled by an inductive domain predicate\\u000a which follows the structure of the recursion. Since a partial induction rule is available immediately, partial correctness\\u000a properties can be proved before termination

Alexander Krauss

2010-01-01

461

Ethics Updates  

NSDL National Science Digital Library

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

Hinman, Lawrence M.

462

Description of an exact recursive method to simplify shading calculations  

SciTech Connect

An exact, recursive method called SHADE is described which attempts to simplify shading calculations as performed by a programmable calculator or microcomputer. Preliminary applications of SHADE using a Hewlett Packard HP-41C programmable calculation are outlined. In particular, for a given solar hour, SHADE is used to compute the following quantities for overhang and side fin combinations which shade various openings: the percentage of the total area of the opening which is shaded; the shaded area itself; the cosine of the angle of incidence between sun and glazing surface; the direct insolation at this surface, with and without shading; and the direct solar power at this surface, with and without shading. Hence, in its present HP-41C application, SHADE can be used in preliminary design and comparative analyses of shading devices on an hourly, daily, or seasonal basis, provided that: (1) the fins and overhangs be square or rectangular, and lie in planes perpendicular to the plane of the opening; and (2) the opening itself be vertical and rectangular with arbitrary building azimuths. Design candidates include conventional overhangs and side fins, porches, and reveals. In principle, SHADE can be extended to awnings, slatted sun screens, and bevelled recesses; in addition, its HP-41C application can be extended to calculations of direct solar gain through vertical and non-vertical glazings, thereby providing a more useful tool in building heating and cooling load calculations.

Nawrocki, A.D.; Kammerud, R.

1981-04-01

463

Implicit Learning of Recursive Context-Free Grammars  

PubMed Central

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

Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

2012-01-01

464

Cosmic Acceleration and Concordance from Causal Backreaction with Recursive Nonlinearities  

NASA Astrophysics Data System (ADS)

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

Bochner, Brett

2013-11-01

465

Recursive recovery of Markov transition probabilities from boundary value data  

SciTech Connect

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

Patch, S.K.

1994-04-01

466

SPIRIX: A Peer-to-Peer Search Engine for XML-Retrieval  

NASA Astrophysics Data System (ADS)

At INEX 2008 we presented SPIRIX, a Peer-to-Peer search engine developed to investigate distributed XML-Retrieval. Such investigations have been neglected by INEX so far: while there is a variety of successful and effective XML-Retrieval approaches, all current solutions are centralized search engines. They do not consider distributed scenarios, where it is undesired or impossible to hold the whole collection on one single machine. Such scenarios include search in large-scale collections, where the load of computations and storage consumption is too high for one server. Other systems consist of different owners of heterogeneous collections willing to share their documents without giving up full control over their documents by uploading them on a central server. Currently, there are research solutions for distributed text-retrieval or multimedia-retrieval. With INEX and innovative techniques for exploiting XML-structure, it is now time to extend research to distributed XML-Retrieval. This paper reports on SPIRIX’ performance at INEX’08.

Winter, Judith; Drobnik, Oswald

467

Implementing A Scalable XML Publish\\/Subscribe System Using Relational Database Systems  

Microsoft Academic Search

An XM L publish\\/su bscribe system needs to match many XPath queries (subscriptions) over published XML documents. The performance and scalability of the matching algorithm is essential for the system when the number of XPath subscriptions is large. Earlier solutions to this problem usually built large finite state automata for all the XPath subscriptions in memory. The scalability of t

Feng Tian; Berthold Reinwald; Hamid Pirahesh; Tobias Mayr; Jussi Myllymaki

468

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

National Technical Information Service (NTIS)

ArchGenXML is a tool that allows easy creation of Zope products through the use of Archetypes. The Integrated Design and Production Reference (IDPR) should be highly configurable in order to meet the needs of a diverse engineering community. Ease of confi...

R. H. Barter

2004-01-01

469

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

ERIC Educational Resources Information Center

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

Roberts, Gary

2005-01-01

470

Realization of XML-Based ETL Process of the Regional Health Information System  

Microsoft Academic Search

Regional Health Information System (RHIS) plays a vital role in health information building in which the crucial and difficult part is how to effectively integrate data from heterogeneous database. XML (eXtensible Markup Language) can solve the problem when it has been put into RHIS because of it has the function to integrate massive data and HL7, the exchange standard of

He Youshi; Wang Xiaobing

2010-01-01

471

Using XML to improve the productivity and robustness in application development in geosciences  

Microsoft Academic Search

In this paper, we describe an approach to apply Extensible Markup Language (XML) technologies to improve the robustness of geological and geophysical applications as well as to increase the efficacy in the application development process. Geological and geophysical applications are often data centric, I\\/O intensive and their development is incremental. Therefore, significant amount of development resources is devoted to the

Ulisses T. Mello; Liqing Xu

2006-01-01

472

Migrating Language Resources from SGML to XML: the Text Encoding Initiative Recommendations  

Microsoft Academic Search

The largest effort in the area of standardisation of computer encoding of language resources has been the Text Encoding Initiative (TEI), established in 1987. TEI chose as its underlying standard SGML (Standard Generalized Markup Language), and in the years before the inception of XML, a number of projects encoded their data according to some SGML DTD, TEI compliant, or otherwise.

Syd Bauman; Toma Erjavec; Alejandro Bia; Christine Ruotolo; Lou Burnard; Susan Schreibman

2002-01-01

473

XML for a Unified Processing of Multilingual Corpora and Corresponding Translation Rules  

Microsoft Academic Search

Our aim is to determine the rules which govern the order of the French modifiers. It also has a comparative dimension where French is the target language. Consequently, we formalized bilingual corpora, as well as translation rules and lexicons. To achieve this aim, we exploited the XML language as well as other languages of the same family: XPath and XLink.

Pascaline Merten

2005-01-01

474

The Application of Web Data Mining Technique in Competitive Intelligence System of Enterprise Based on XML  

Microsoft Academic Search

In order to response the increased competition, improve the correctness and timeliness of decision-making, enterprises need to make efficient data analysis techniques and methods used in competitive intelligence system. XML combines with Web data mining technology can effectively solve many problems faced by Web data mining, significantly improve the efficiency and effect of collection and analysis of competitive intelligence system

Chen Ting; Niu Xiao; Yang Weiping

2009-01-01

475

An Aspect-to-Class Advising Architecture Based on XML in Aspect Oriented Programming  

Microsoft Academic Search

In aspect oriented programming, cross-cutting concerns are represented as aspects. These aspects can advise classes as well as other aspects. This paper defines an XML schema to express aspect information for the aspects advising classes. Defining such schema provides a platform that is implementation independent and can be used for further research like aspect weaver development. In aspect weaving, conflicts

T. Hussain; M. M. Awais; S. Shamail; M. A. Adnan

476

JXPL: an XML-based scripting language for workflow execution in a grid environment  

Microsoft Academic Search

JXPL is a new functional scripting language that uses XML syntax. JXPL is intended to be a workflow language that easily interacts with web and grid services. There are built in web and grid clients that can communicate with a variety of services. This facilitates the creation of workflow editors and other applications designed for grid environments and leaves application

Carla S. Hunt; Clayton S. Ferner; Jeff L. Brown

2005-01-01

477

A first approach to the automatic recognition of structural patterns in XML documents  

Microsoft Academic Search

XML is among the preferred formats for storing the structure of documents such as scientific articles, manuals, documentation, literary works, etc. Sometimes publishers adopt established and well-known vocabularies such as DocBook and TEI, other times they create partially or entirely new ones that better deal with the particular requirements of their documents. The (explicit and implicit) requirements of use in

Angelo Di Iorio; Silvio Peroni; Francesco Poggi; Fabio Vitali

2012-01-01

478

Application of Information Technology: An XML-based System for Synthesis of Data from Disparate Databases  

Microsoft Academic Search

Diverse data sets have become key building blocks of translational biomedical research. Data types captured and referenced by sophisticated research studies include high throughput genomic and proteomic data, laboratory data, data from imagery, and outcome data. In this paper, the authors present the application of an XML-based data management system to support integration of data from disparate data sources and

Tahsin M. Kurç; Daniel A Janies; Andrew D. Johnson; Stephen Langella; Scott Oster; Shannon Hastings; Farhat Habib; Terry Camerlengo; David Ervin; Ümit V. Çatalyürek; Joel H. Saltz

2006-01-01

479

Land use information release system based on Google Maps API and XML  

Microsoft Academic Search

Web map service is a new map service mode actualized by the use of internet technology, computer technology and GIS technology. This article applies Web map service to the release of land use information, and tries to use Google Maps API and XML to build a network release system of regional land use information. The system integrates Google Maps data

Hao Zhang; Manchun Li; Zhenjie Chen; Zhiliang Bao; Qiuhao Huang; Dong Cai

2010-01-01

480

IVOA Recommendation: VOResource: an XML Encoding Schema for Resource Metadata Version 1.03  

Microsoft Academic Search

This document describes an XML encoding standard for IVOA Resource Metadata, referred to as VOResource. This schema is primarily intended to support interoperable registries used for discovering resources; however, any application that needs to describe resources may use this schema. In this document, we define the types and elements that make up the schema as representations of metadata terms defined

Raymond Plante; Kevin Benson; Matthew Graham; Gretchen Greene; Paul Harrison; Gerard Lemson; Tony Linde; Guy Rixon; Aurelien Stebe

2011-01-01

481

Frameworks on New XML\\/EDI System for B2B Shipping Companies in Korea  

Microsoft Academic Search

In this paper, we survey and analyze the actual conditions of EDI system for B2B business of transport companies in Korea. As the result of our analyses, it comes an old fashioned EDI system at harbor and logistics industry, and the VAN based systems are still widely used in Korea. In conclusion, the next generation EDI, XML\\/EDI, is very effective

Soung Won Kim; Ran Jung; Myoung Soo Kim

2005-01-01

482

Defining the XML Schema Matching Problem for a Personal Schema Based Query Answering System  

Microsoft Academic Search

In this report, we analyze the problem of personal schema matching. We define the ingredients of the XML schema matching problem using constraint logic programming. This allows us to thourougly investigate specific matching problems. We do not have the ambition to provide for a formalism that covers all kinds of schema matching problems. The target is specifically personal schema matching

Marko Smiljanic; Keulen van Maurice; Willem Jonker

2004-01-01

483

A Semantic Analysis of XML Schema Matching for B2B Systems Integration  

ERIC Educational Resources Information Center

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

Kim, Jaewook

2011-01-01

484

Experimental Study of Voice User Interface (VUI) System Using VoiceXML  

Microsoft Academic Search

Web applications supporting voice user interface (VUI) are gaining much attention for human-machine interaction. In this paper, we first build VoiceXML systems different technologies, and conduct experimental study to quantify their performances. Experimental results demonstrate that ASP.NET 2.0 shows the highest communication success rate and the lowest response time for Web surfing.

Byung-Seok Kang; Sangheon Pack; Han-Shik Kim; Chul-Hee Kang

2007-01-01

485

Analysis of the Benchmark while Extracting Data from Database or XML File for Different Platforms  

Microsoft Academic Search

The purpose of the research is the comparison between the extracting time of the Database Management System (DMS) and XML files for two different platforms - .NET Framework 1.1 and .NET Framework 2.0. The two latest versions of the Microsoft database server are used as Database Management System - SQL Server 2000 and SQL Server 2005. The extraction from the

Ognian Nakov; Desislava Petrova

486

From XML to RDF: how semantic web technologies will change the design of 'omic' standards  

Microsoft Academic Search

With the ongoing rapid increase in both volume and diversity of 'omic' data (genomics, transcriptomics, proteomics, and others), the development and adoption of data standards is of paramount importance to realize the promise of systems biology. A recent trend in data standard development has been to use extensible markup language (XML) as the preferred mechanism to define data representations. But

Xiaoshu Wang; Robert Gorlitsky; Jonas S Almeida

2005-01-01

487

XML-SQL Query Translation Literature: The State of the Art and Open Problems  

Microsoft Academic Search

Recently, the database research literature has seen an explo- sion of publications with the goal of using an RDBMS to store and\\/or query XML data. The problems addressed and solved in this area are diverse. This diversity renders it dicult to know how the various re- sults presented t together, and even makes it hard to know what open problems

Rajasekar Krishnamurthy; Raghav Kaushik; Jeffrey F. Naughton

2003-01-01

488

Application of XML Topic Maps to knowledge navigation and information retrieval for urban traffic information portal  

Microsoft Academic Search

Along with stocks of traffic information grows rapidly, knowledge navigation is the future development trend for managing urban traffic information resource. Topic Maps (TM) are standardized by ISO 13250 for the purpose of semantic annotation of WWW resources. XML Topic Maps (XTM) is straightforwardly usable over the Internet and support a wide variety of applications. This paper presents the knowledge

Zhai Jun; Wang Qinglian; Lv Miao

2008-01-01

489

An Approach for Managing Service Dependencies with XML and the Resource Description Framework  

Microsoft Academic Search

We describe a novel approach for applying XML, XPath, and Resource Description Framework (RDF) to the problem of describing, querying and computing the dependencies among services in a distributed computing system. This becomes increasingly important in today's networked environments where applications and services rely on both local and outsourced sub-services. However, service dependencies are not made explicit in today's systems,

Christian Ensel; Alexander Keller

2002-01-01

490

Managing application service dependencies with XML and the resource description framework  

Microsoft Academic Search

This paper describes a novel approach for applying XML, XPath and RDF to the problem of describing, querying and computing the dependencies among services in a distributed computing system. This becomes increasingly important in today's networked environments where applications and services rely on both local and outsourced sub-services. However, service dependencies are not made explicit in today's systems, thus making

Christian Ensel; Alexander Keller

2001-01-01

491

xml version="1.0" encoding="us-ascii"?>  

Center for Drug Evaluation (CDER)

xml version="1.0" encoding="us-ascii"?> Food ... More results from www.fda.gov/downloads/drugs/drugsafety</p> <div class="credits"> <p class="dwt_author"></p> <p class="dwt_publisher"></p> <p class="publishDate"></p> </div> </div> </div> </div> <div class="floatContainer result " lang="en"> <div class="resultNumber element">492</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://adsabs.harvard.edu/abs/2003EAEJA....13438B"> <span id="translatedtitle">Development of the Plate Tectonics and Seismology markup languages with <span class="hlt">XML</span></span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://adsabs.harvard.edu/abstract_service.html">NASA Astrophysics Data System (ADS)</a></p> <p class="result-summary">The Extensible Markup Language (<span class="hlt">XML</span>) and its specifications such as the XSD Schema, allow geologists to design discipline-specific vocabularies such as Seismology Markup Language (SeismML) or Plate Tectonics Markup Language (TectML). These languages make it possible to store and interchange structured geological information over the Web. Development of a geological markup language requires mapping geological concepts, such as "Earthquake" or "Plate" into a UML object model, applying a modeling and design environment. We have selected four inter-related geological concepts: earthquake, fault, plate, and orogeny, and developed four <span class="hlt">XML</span> Schema Definitions (XSD), that define the relationships, cardinalities, hierarchies, and semantics of these concepts. In such a geological concept model, the UML object "Earthquake" is related to one or more "Wave" objects, each arriving to a seismic station at a specific "DateTime", and relating to a specific "Epicenter" object that lies at a unique "Location". The "Earthquake" object occurs along a "Segment" of a "Fault" object, which is related to a specific "Plate" object. The "Fault" has its own associations with such things as "Bend", "Step", and "Segment", and could be of any kind (e.g., "Thrust", "Transform'). The "Plate" is related to many other objects such as "MOR", "Subduction", and "Forearc", and is associated with an "Orogeny" object that relates to "Deformation" and "Strain" and several other objects. These UML objects were mapped into <span class="hlt">XML</span> Metadata Interchange (XMI) formats, which were then converted into four XSD Schemas. The schemas were used to create and validate the <span class="hlt">XML</span> instance documents, and to create a relational database hosting the plate tectonics and seismological data in the Microsoft Access format. The SeismML and TectML allow seismologists and structural geologists, among others, to submit and retrieve structured geological data on the Internet. A seismologist, for example, can submit peer-reviewed and reliable data about a specific earthquake to a Java Server Page on our web site hosting the <span class="hlt">XML</span> application. Other geologists can readily retrieve the submitted data, saved in files or special tables of the designed database, through a search engine designed with J2EE (JSP, servlet, Java Bean) and <span class="hlt">XML</span> specifications such as XPath, XPointer, and XSLT. When extended to include all the important concepts of seismology and plate tectonics, the two markup languages will make global interchange of geological data a reality.</p> <div class="credits"> <p class="dwt_author">Babaie, H.; Babaei, A.</p> <p class="dwt_publisher"></p> <p class="publishDate">2003-04-01</p> </div> </div> </div> </div> <div class="floatContainer result odd" lang="en"> <div class="resultNumber element">493</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://academic.research.microsoft.com/Publication/4008490"> <span id="translatedtitle">Towards Open Standards: The Evolution of an <span class="hlt">XML</span>\\/JSP\\/WebDAV Based Collaborative Courseware Generating System</span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://academic.research.microsoft.com/">Microsoft Academic Search </a></p> <p class="result-summary">In this paper we present the evolution of a collaborative courseware generating system which is featured by <span class="hlt">XML</span>-based course structure representation, JSP-based dynamic courseware presentation, and WebDAV-based collaborative courseware authoring. While the first system implementation employs a proprietary design which uses a self-defined <span class="hlt">XML</span> DTD to represent course structure, the second and the third system implementation take an open standard</p> <div class="credits"> <p class="dwt_author">Changtao Qu; Wolfgang Nejdl</p> <p class="dwt_publisher"></p> <p class="publishDate">2002-01-01</p> </div> </div> </div> </div> <div class="floatContainer result " lang="en"> <div class="resultNumber element">494</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://academic.research.microsoft.com/Publication/57545391"> <span id="translatedtitle">An SVG-based method to support spatial analysis in <span class="hlt">XML</span>\\/GML\\/SVG-based WebGIS</span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://academic.research.microsoft.com/">Microsoft Academic Search </a></p> <p class="result-summary"><span class="hlt">XML</span>\\/GML\\/SVG-based approaches are promising for building Web-based geographic information systems (WebGIS). However, current <span class="hlt">XML</span>\\/GML\\/SVG-based WebGISs are lacking in spatial analysis. Some of them are designed for web mapping only. Others adopt a server-side solution for spatial analysis, which suffers from the ‘bottleneck’ problem and results in a high network transmission load. Load-balancing spatial analysis between server side and browser side</p> <div class="credits"> <p class="dwt_author">Haosheng Huang; Yan Li; Georg Gartner; Yunpeng Wang</p> <p class="dwt_publisher"></p> <p class="publishDate">2011-01-01</p> </div> </div> </div> </div> <div class="floatContainer result odd" lang="en"> <div class="resultNumber element">495</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://academic.research.microsoft.com/Publication/2170858"> <span id="translatedtitle">Integrating XQuery-enabled SCORM <span class="hlt">XML</span> Metadata Repositories into an RDF-based E-Learning P2P Network</span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://academic.research.microsoft.com/">Microsoft Academic Search </a></p> <p class="result-summary">Edutella is an RDF-based E-Learning P2P network that is aimed to accommodate heterogeneous learning resource metadata repositories in a P2P manner and further facilitate the exchange of metadata between these repositories based on RDF. Whereas Edutella provides RDF metadata repositories with a quite natural integration approach, <span class="hlt">XML</span> metadata repositories have to overcome considerable incompatibility between <span class="hlt">XML</span>'s tree-like hierarchical data model</p> <div class="credits"> <p class="dwt_author">Changtao Qu; Wolfgang Nejdl</p> <p class="dwt_publisher"></p> <p class="publishDate">2004-01-01</p> </div> </div> </div> </div> <div class="floatContainer result " lang="en"> <div class="resultNumber element">496</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://academic.research.microsoft.com/Publication/53181358"> <span id="translatedtitle">Towards an Ontology for the Global Geodynamics Project: Automated Extraction of Resource Descriptions from an <span class="hlt">XML</span>-Based Data Model</span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://academic.research.microsoft.com/">Microsoft Academic Search </a></p> <p class="result-summary">Using the Earth Science Markup Language (ESML), an <span class="hlt">XML</span>-based data model for the Global Geodynamics Project (GGP) was recently introduced [Lumb & Aldridge, Proc. HPCS 2005, Kotsireas & Stacey, eds., IEEE, 2005, 216-222]. This data model possesses several key attributes -i.e., it: makes use of <span class="hlt">XML</span> schema; supports semi-structured ASCII format files; includes Earth Science affinities; and is on track</p> <div class="credits"> <p class="dwt_author">L. I. Lumb; K. D. Aldridge</p> <p class="dwt_publisher"></p> <p class="publishDate">2005-01-01</p> </div> </div> </div> </div> <div class="floatContainer result odd" lang="en"> <div class="resultNumber element">497</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://adsabs.harvard.edu/abs/2003IJMPA..18..607A"> <span id="translatedtitle">Pseudo-Cuntz Algebra and <span class="hlt">Recursive</span> FP Ghost System in String Theory</span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://adsabs.harvard.edu/abstract_service.html">NASA Astrophysics Data System (ADS)</a></p> <p class="result-summary">Representation of the algebra of FP (anti)ghosts in string theory is studied by generalizing the <span class="hlt">recursive</span> fermion system in the Cuntz algebra constructed previously. For that purpose, the pseudo-Cuntz algebra, which is a *-algebra generalizing the Cuntz algebra and acting on indefinite-metric vector spaces, is introduced. The algebra of FP (anti)ghosts in string theory is embedded into the pseudo-Cuntz algebra <span class="hlt">recursively</span> in two different ways. Restricting a certain permutation representation of the pseudo-Cuntz algebra, representations of these two <span class="hlt">recursive</span> FP ghost systems are obtained. With respect to the zero-mode operators of FP (anti)ghosts, it is shown that one corresponds to the four-dimensional representation found recently by one of the present authors (M. Abe) and Nakanishi, while the other corresponds to the two-dimensional one by Kato and Ogawa.</p> <div class="credits"> <p class="dwt_author">Abe, Mitsuo; Kawamura, Katsunori</p> <p class="dwt_publisher"></p> <p class="publishDate"></p> </div> </div> </div> </div> <div class="floatContainer result " lang="en"> <div class="resultNumber element">498</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://www.osti.gov/scitech/servlets/purl/960959"> <span id="translatedtitle">Extended <span class="hlt">recursion</span> in operator space (EROS), a new impurity solver for the single impurity Anderson model</span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://www.osti.gov/scitech">SciTech Connect</a></p> <p class="result-summary">We have developed a new efficient and accurate impurity solver for the single impurity Anderson model (SIAM), which is based on a non-perturbative <span class="hlt">recursion</span> technique in a space of operators and involves expanding the self-energy as a continued fraction. The method has no special occupation number or temperature restrictions; the only approximation is the number of levels of the continued fraction retained in the expansion. We also show how this approach can be used as a new approach to Dynamical Mean Field Theory (DMTF) and illustrate this with the Hubbard model. The three lowest orders of <span class="hlt">recursion</span> give the Hartree-Fock, Hubbard I, and Hubbard III approximations. A higher level of <span class="hlt">recursion</span> is able to reproduce the expected 3-peak structure in the spectral function and Fermi liquid behavior.</p> <div class="credits"> <p class="dwt_author">Albers, Robert C [Los Alamos National Laboratory; Julien, Jean P [Los Alamos National Laboratory</p> <p class="dwt_publisher"></p> <p class="publishDate">2008-01-01</p> </div> </div> </div> </div> <div class="floatContainer result odd" lang="en"> <div class="resultNumber element">499</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://www.osti.gov/scitech/biblio/6669733"> <span id="translatedtitle">[ital Ab] [ital initio] electronic-structure computations with the <span class="hlt">recursion</span> method</span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://www.osti.gov/scitech">SciTech Connect</a></p> <p class="result-summary">An accurate and efficient algorithm for using the <span class="hlt">recursion</span> method in [ital ab] [ital initio] electronic-structure calculations with nonorthogonal real-space basis sets is presented. The matrix representation of the Hamiltonian operator in a localized basis is shown to possess a sparse represention, and is constructed from the Hamiltonian and overlap matrices, but without the full inverse of the overlap matrix. A method for calculating the change in the charge density due to a point defect is described. The mathematical structure of the <span class="hlt">recursion</span> method is used to show that some local physical quantities, which are related to integrals over the local density of states, converge exponentially with the size of the cluster that surrounds the region of interest. The computation of these local properties scales independently of the number of atoms in the solid. As an illustration, the <span class="hlt">recursion</span> method is used to compute the band-structure component of the cohesive energy of MgO.</p> <div class="credits"> <p class="dwt_author">Gibson, A.; Haydock, R. (Materials Science Institute, University of Oregon, Eugene, Oregon 97403 (United States)); LaFemina, J.P. (Molecular Science Research Center, Pacific Northwest Laboratory, Richland, Washington 99352 (United States))</p> <p class="dwt_publisher"></p> <p class="publishDate">1993-04-15</p> </div> </div> </div> </div> <div class="floatContainer result " lang="en"> <div class="resultNumber element">500</div> <div class="resultBody element"> <p class="result-title"><a target="resultTitleLink" href="http://science.gov/scigov/link.html?type=RESULT&redirectUrl=http://www.osti.gov/scitech/biblio/21408742"> <span id="translatedtitle"><span class="hlt">Recursion</span> relations for generalized Fresnel coefficients: Casimir force in a planar cavity</span></a>  </p> <div class="result-meta"> <p class="source"><a target="_blank" id="logoLink" href="http://www.osti.gov/scitech">SciTech Connect</a></p> <p class="result-summary">We emphasize and demonstrate that besides using the usual <span class="hlt">recursion</span> relations involving successive layers, generalized Fresnel coefficients of a multilayer can equivalently be calculated using the <span class="hlt">recursion</span> relations involving stacks of layers, as introduced some time ago [M. S. Tomas, Phys. Rev. A 51, 2545 (1995)]. Moreover, since the definition of the generalized Fresnel coefficients employed does not imply properties of the stacks, these nonstandard <span class="hlt">recursion</span> relations can be used to calculate Fresnel coefficients not only for a local but also for a general multilayer consisting of various types (local, nonlocal, inhomogeneous, etc.) of layers. Their utility is illustrated by deriving a few simple algorithms for calculating the reflectivity of a Bragg mirror and extending the formula for the Casimir force in a planar cavity to arbitrary media.</p> <div class="credits"> <p class="dwt_author">Tomas, Marin-Slobodan [Rudjer Boskovic Institute, Post Office Box 180, HR-10002 Zagreb (Croatia)</p> <p class="dwt_publisher"></p> <p class="publishDate">2010-04-15</p> </div> </div> </div> </div> <div id="filter_results_form" class="filter_results_form floatContainer" style="visibility: visible;"> <div style="width:100%" id="PaginatedNavigation" class="paginatedNavigationElement"> <a id="FirstPageLink" onclick='return showDiv("page_1");' href="#" title="First Page"> <img id="FirstPageLinkImage" class="Icon" src="http://www.science.gov/scigov/images/icon.first.18x20.png" alt="First Page" /></a> <a id="PreviousPageLink" onclick='return showDiv("page_24");' href="#" title="Previous Page"> <img id="PreviousPageLinkImage" class="Icon" src="http://www.science.gov/scigov/images/icon.previous.18x20.png" alt="Previous Page" /></a> <span id="PageLinks" class="pageLinks"> <span> <a onClick='return showDiv("page_1");' href="#">1</a> <a onClick='return showDiv("page_2");' href="#">2</a> <a onClick='return showDiv("page_3");' href="#">3</a> <a onClick='return showDiv("page_4");' href="#">4</a> <a onClick='return showDiv("page_5");' href="#">5</a> <a onClick='return showDiv("page_6");' href="#">6</a> <a onClick='return showDiv("page_7");' href="#">7</a> <a onClick='return showDiv("page_8");' href="#">8</a> <a onClick='return showDiv("page_9");' href="#">9</a> <a onClick='return showDiv("page_10");' href="#">10</a> <a onClick='return showDiv("page_11");' href="#">11</a> <a onClick='return showDiv("page_12");' href="#">12</a> <a onClick='return showDiv("page_13");' href="#">13</a> <a onClick='return showDiv("page_14");' href="#">14</a> <a onClick='return showDiv("page_15");' href="#">15</a> <a onClick='return showDiv("page_16");' href="#">16</a> <a onClick='return showDiv("page_17");' href="#">17</a> <a onClick='return showDiv("page_18");' href="#">18</a> <a onClick='return showDiv("page_19");' href="#">19</a> <a onClick='return showDiv("page_20");' href="#">20</a> <a onClick='return showDiv("page_21");' href="#">21</a> <a onClick='return showDiv("page_22");' href="#">22</a> <a onClick='return showDiv("page_23");' href="#">23</a> <a onClick='return showDiv("page_24");' href="#">24</a> <a style="font-weight: bold;">25</a> </span> </span> <a id="NextPageLink" onclick='return showDiv("page_25.0");' href="#" title="Next Page"> <img id="NextPageLinkImage" class="Icon" src="http://www.science.gov/scigov/images/icon.next.18x20.png" alt="Next Page" /></a> <a id="LastPageLink" onclick='return showDiv("page_25.0");' href="#" title="Last Page"> <img id="LastPageLinkImage" class="Icon" src="http://www.science.gov/scigov/images/icon.last.18x20.png" alt="Last Page" /></a> </div> </div> </div><!-- page_25 div --> <!-- Column 1 end --> </div> </div> </div> </div> </div> </div> </div> <!-- BEGIN: footer --> <div id="footer_inner" class="osti" style="margin-left:auto;margin-right:auto;"> <div class="osti twoColLiqRtHdr"> <div id="container" class="osti"> <div id="mainContent" class="osti"> <div id="footer" class="osti"> Search capabilities provided by <a href="http://www.osti.gov">DOE/OSTI</a><br> Websites by Topic maintained by <a href="http://www.cendi.gov/">CENDI</a><br> <div align="center"><span style="font-weight:bold; font-size:9px; color:#666; line-height:14px">Some links on this page may take you to non-federal websites. <br> Their policies may differ from this site.</span></div> <div align="center"><a href="http://www.science.gov/disclaimer.html">Privacy & Security</a><br></div> <table align="center" cellpadding="2" cellspacing="0" height="14" width="178"> <tbody> <tr> <td width="124"><div align="center"><a href="http://www.usa.gov"><img src="http://www.science.gov/images/USAgov.jpg" alt="USA.gov" border="0" height="14" width="42"></a></div></td> <td width="129"><div align="center"><a href="http://worldwidescience.org"><img src="http://www.science.gov/images/wws.jpg" alt="WorldWideScience.org" border="0" height="14" width="108"></a></div></td> </tr> </tbody> </table> <a href="http://www.usajobs.gov/">USAJOBS</a> :: <a href="http://www.grants.gov/">Grants</a> :: <a href="http://www.regulations.gov/search/Regs/home.html#home">Regulations.gov</a><br> </div> </div> </div> </div> </div> <!-- END: footer --> </body> </html>