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: August 15, 2014.
1

HUX: Handling Updates in XML  

Microsoft Academic Search

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

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

2006-01-01

2

Semantics, Types and Effects for XML Updates  

NASA Astrophysics Data System (ADS)

The W3C recently released the XQuery Update Facility 1.0, a Candidate Recommendation for an XML update language. It appears likely that this proposal will become standard. XQuery has been equip- ped with a formal semantics and sound type system, but there has been little work on static analysis or typechecking of XML updates, and the typing rules in the current W3C proposal appear unsound for “transform” queries that perform embedded updates. In this paper, we investigate the problem of schema alteration, or synthesizing an output schema describing the result of an update applied to a given input schema. We review regular expression type systems for XQuery, present a core language and semantics for W3C-style XML updates, and develop an effect analysis and schema alteration, which can be used as the basis for sound typechecking for queries involving “transform”.

Benedikt, Michael; Cheney, James

3

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

4

An Algorithm for Inferring K Optimum Transformations of XML Document from Update Script to DTD  

NASA Astrophysics Data System (ADS)

DTDs are continuously updated according to changes in the real world. Let t be an XML document valid against a DTD D, and suppose that D is updated by an update script s. In general, we cannot uniquely “infer” a transformation of t from s, i.e., we cannot uniquely determine the elements in t that should be deleted and/or the positions in t that new elements should be inserted into. In this paper, we consider inferring K optimum transformations of t from s so that a user finds the most desirable transformation more easily. We first show that the problem of inferring K optimum transformations of an XML document from an update script is NP-hard even if K = 1. Then, assuming that an update script is of length one, we show an algorithm for solving the problem, which runs in time polynomial of |D|, |t|, and K.

Suzuki, Nobutaka

5

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

Microsoft Academic Search

In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is a hierarchical form of mobile networks. Nested mobile networks suffer from a pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility, as

Ho-sik Cho; Eun Kyoung Paik; Yanghee Choi

2004-01-01

6

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

Microsoft Academic Search

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

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

2011-01-01

7

XML in Libraries.  

ERIC Educational Resources Information Center

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

Tennant, Roy, Ed.

8

Generic and Updatable XML Value Indices Covering Equality and Range Lookups.  

National Technical Information Service (NTIS)

We describe a collection of indices for XML text, element, and attribute node values that: (1) consume little storage; (2) have low maintenance overhead; (3) permit fast equi-lookup on string values; and (4) support range-lookup on any XML typed value (e....

E. Sidirourgos P. A. Boncz

2008-01-01

9

New non-interpolative kernel for pel-recursion with integer estimate updates  

Microsoft Academic Search

Pel-recursive motion compensation, in its original form, is based on a continuous formulation. However, it has been shown previously that the implementation of pel-recursion in a sampled (digital) domain inevitably involves two distinct steps: estimation of integral part of the motion and fractional estimation. A class of four-dimensional LS-optimum operators have been introduced for fractional estimation. In this paper, we

Aria Nosratinia; Michael T. Orchard

1993-01-01

10

Atomicity for XML Databases  

NASA Astrophysics Data System (ADS)

With more and more data stored into XML databases, there is a need to provide the same level of failure resilience and robustness that users have come to expect from relational database systems. In this work, we discuss strategies to provide the transactional aspect of atomicity to XML databases. The main contribution of this paper is to propose a novel approach for performing updates-in-place on XML databases, with the undo statements stored in the same high level language as the update statements. Finally, we give experimental results to study the performance/storage trade-off of the updates-in-place strategy (based on our undo proposal) against the deferred updates strategy to providing atomicity.

Biswas, Debmalya; Jiwane, Ashwin; Genest, Blaise

11

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

12

XML Machines  

NASA Astrophysics Data System (ADS)

In order to capture the dynamics of XML databases a general model of tree-based database transformations is required. In this paper such an abstract computational model is presented, which brings together ideas from Abstract State Machines and monadic second-order logic. The model captures all XML database transformations.

Wang, Qing; Ferrarotti, Flavio A.

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

Exploiting XML technologies for intelligent document routing  

Microsoft Academic Search

Today, XML is increasingly becoming a standard for representation of semi-structured information such as documents that combines content and metadata. Typical document management applications include document representation, authoring, validation, and document routing in support of a business process. We propose a framework for intelligent document routing that exploits and extends XML technologies to automate dynamic document routing and real-time update

Isaac Cheng; Savitha Srinivasan; Neil Boyette

2005-01-01

15

Recursion Mathematics.  

ERIC Educational Resources Information Center

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

Olson, Alton T.

1989-01-01

16

Querying XML Data  

Microsoft Academic Search

this paper we address the problem of querying XML databases. Westart spelling out some requirements for an XML query language in Section2. Next we describe in some detail XML-QL in Section 3, a querylanguage specially designed for XML, and also illustrate how it satisfiessome of the requirements. Section 4 briefly reviews some other languages.We conclude in Section 5

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

1999-01-01

17

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

18

XML Based Course Websites.  

ERIC Educational Resources Information Center

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

Wollowski, Michael

19

Plug-and-Play XML  

PubMed Central

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

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

2002-01-01

20

Heterogeneous Collaboration Using XML  

Microsoft Academic Search

The recent proliferation of computing devices and use contexts demand equivalent diversity in collaborative applications. Our work on the DISCIPLE and Manifold frameworks supports the development of collaborative applications for these heterogeneous environments. Using eXtensible Markup Language (XML) for the communication medium provides for the heterogeneity. Collaborators share the same data or a subset of the data, represented in XML,

Ivan Marsic; Allan Krebs; Helmuth Trefftz; Bogdan Dorohonceanu; Marilyn Tremaine

2000-01-01

21

Adaptable Iterative and Recursive Kalman Filter Schemes  

NASA Technical Reports Server (NTRS)

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

Zanetti, Renato

2014-01-01

22

XML graphs in program analysis  

Microsoft Academic Search

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

Anders Møller; Michael I. Schwartzbach

2011-01-01

23

XML graphs in program analysis  

Microsoft Academic Search

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

Anders Møller; Michael I. Schwartzbach

2007-01-01

24

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

25

Multivalued Dependencies in XML  

Microsoft Academic Search

Functional dependencies (FDs) and multivalued dependencies (MVDs) play a fundamental role in relational databases where they\\u000a provide semantics for the data and at the same time are the foundation for database design. Since XML documents are closely\\u000a coupled with relational databases in that XML documents are typically exported and imported from relational databases, the\\u000a study of FDs and MVDs in

Millist W. Vincent; Jixue Liu

2003-01-01

26

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

27

IBM Developers Portal: XML Zone  

NSDL National Science Digital Library

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

28

XML Benchmark Project. Information Systems.  

National Technical Information Service (NTIS)

With standardization efforts of 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 sheer amount of XML documents produced ...

A. R. Schmidt F. Waas M. L. Kersten D. Florescu I. Manolescu

2001-01-01

29

ALGEBRAIC LANGUAGES FOR XML DATABASES  

Microsoft Academic Search

XML becoming increasingly popular means exchanging wide variety data web. anticipated future, many websites will built from XML documents. XML databases would required manage these websites provide a way for users search their contents. In paper give an overview development query algebras from the original relational algebra algebras extended-relational, object-oriented semi-structured XML data models. discuss in detail provide a cross

MARIA G. CHINWALA; JOHN A. MILLER

30

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.

31

Towards an enterprise XML architecture  

Microsoft Academic Search

XML is being increasingly used in diverse domains ranging from data and application integration to content management. Oracle provides an enterprise wide platform for managing all types of XML content. Within the Oracle database and the application server, the XML content can be efficiently stored using a variety of storage and indexing methods and it can be processed using multiple

Ravi Murthy; Zhen Hua Liu; Muralidhar Krishnaprasad; Sivasankaran Chandrasekar; Anh-Tuan Tran; Eric Sedlar; Daniela Florescu; Susan Kotsovolos; Nipun Agarwal; Vikas Arora; Viswanathan Krishnamurthy

2005-01-01

32

XML: An Introduction.  

ERIC Educational Resources Information Center

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

Lewis, John D.

1998-01-01

33

Recursive Deadbeat Controller Design  

NASA Technical Reports Server (NTRS)

This paper presents a recursive algorithm for a deadbeat predictive controller design. The method combines together the concepts of system identification and deadbeat controller designs. It starts with the multi-step output prediction equation and derives the control force in terms of past input and output time histories. The formulation thus derived satisfies simultaneously system identification and deadbeat controller design requirements. As soon as the coefficient matrices are identified satisfying the output prediction equation, no further work is required to compute the deadbeat control gain matrices. The method can be implemented recursively just as any typical recursive system identification techniques.

Juang, Jer-Nan; Phan, Minh Q.

1997-01-01

34

XML.com  

NSDL National Science Digital Library

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

35

Removing Redundant Recursion.  

National Technical Information Service (NTIS)

This paper presents an algorithm that rewrites into efficient form some recursive functions that contain redundant calls (e.g. the Fibonacci function). This paper generalizes one method and eliminates the need for the user intervention. Formal definitions...

S. Sickel

1978-01-01

36

Meta-XML Specification  

Microsoft Academic Search

The task of keeping any form of consistency in websites is difficult. Websites exist for long periods. Over this period of\\u000a time, many people author webpages for a given website. People are not good at consistently following sets of rules. XML can\\u000a assist webpage authors by ensuring that webpages of the same type have the same kinds of semantic content.

Stephen C. Arnold; Leo Mark

2001-01-01

37

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

38

Document image representation using XML technologies  

NASA Astrophysics Data System (ADS)

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

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

2001-12-01

39

Querying XML Data with SPARQL  

NASA Astrophysics Data System (ADS)

SPARQL is today the standard access language for Semantic Web data. In the recent years XML databases have also acquired industrial importance due to the widespread applicability of XML in the Web. In this paper we present a framework that bridges the heterogeneity gap and creates an interoperable environment where SPARQL queries are used to access XML databases. Our approach assumes that fairly generic mappings between ontology constructs and XML Schema constructs have been automatically derived or manually specified. The mappings are used to automatically translate SPARQL queries to semantically equivalent XQuery queries which are used to access the XML databases. We present the algorithms and the implementation of SPARQL2XQuery framework, which is used for answering SPARQL queries over XML databases.

Bikakis, Nikos; Gioldasis, Nektarios; Tsinaraki, Chrisa; Christodoulakis, Stavros

40

Expressiveness Considerations of XML Signatures  

Microsoft Academic Search

XML Signatures are used to protect XML-based Web Service communication against a broad range of attacks related to man-in-the-middle scenarios. However, due to the complexity of the Web Services specification landscape, the task of applying XML Signatures in a robust and reliable manner becomes more and more challenging. In this paper, we investigate this issue, describing how an attacker can

Meiko Jensen; Christopher Meyer

2011-01-01

41

Regular expression types for XML  

Microsoft Academic Search

We propose regular expression types as a foundation for XML processing languages. Regular expression types are a natural generalization of Document Type Definitions (DTDs), describing structures in XML documents using regular expression operators (i.e., *, ?, |, etc.) and supporting a simple but powerful notion of subtyping.The decision problem for the subtype relation is EXPTIME-hard, but it can be checked

Haruo Hosoya; Jérôme Vouillon; Benjamin C. Pierce

2000-01-01

42

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

43

XML Schema Languages: Beyond DTD.  

ERIC Educational Resources Information Center

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

Ioannides, Demetrios

2000-01-01

44

Recursive quantum detector tomography  

NASA Astrophysics Data System (ADS)

Conventional tomographic techniques are becoming increasingly infeasible for reconstructing the operators of quantum devices of growing sophistication. We describe a novel tomographic procedure using coherent states, which begins by reconstructing the diagonals of the operator and then each successive off-diagonal in a recursive manner. Each recursion is considerably more efficient than reconstructing the operator in its entirety, and each successive recursion involves fewer parameters. We apply our technique to reconstruct the positive-operator-valued measure corresponding to a recently developed coherent optical detector with phase sensitivity and number resolution. We discuss the effect of various parameters on the reconstruction accuracy. The results show the efficiency of the method and its robustness to experimental noise.

Zhang, Lijian; Datta, Animesh; Coldenstrodt-Ronge, Hendrik B.; Jin, Xian-Min; Eisert, Jens; Plenio, Martin B.; Walmsley, Ian A.

2012-11-01

45

Indexing Temporal XML Using FIX  

NASA Astrophysics Data System (ADS)

XML has become an important criterion for description and exchange of information. It is of practical significance to introduce the temporal information on this basis, because time has penetrated into all walks of life as an important property information .Such kind of database can track document history and recover information to state of any time before, and is called Temporal XML database. We advise a new feature vector on the basis of FIX which is a feature-based XML index, and build an index on temporal XML database using B+ tree, donated TFIX. We also put forward a new query algorithm upon it for temporal query. Our experiments proved that this index has better performance over other kinds of XML indexes. The index can satisfy all TXPath queries with depth up to K(>0).

Zheng, Tiankun; Wang, Xinjun; Zhou, Yingchun

46

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

47

A Recursive Network Architecture  

Microsoft Academic Search

The Recursive Network Architecture (RNA) explores the relationship of layering to protocol and network architecture. RNA examines the implications of using a single, tunable protocol for different layers of the protocol stack, reusing basic protocol operations across different protocol layers to avoid reimplementation. Its primary goal is to encourage cleaner cross-layer interaction and to support dynamic service composition, and to

Joseph D. Touch; Yu-Shun Wang; Venkata Pingali

2006-01-01

48

Recursive SAR imaging  

Microsoft Academic Search

We investigate a recursive procedure for synthetic aperture imaging. We consider a concept in which a SAR system persistently interrogates a scene, for example as it flies along or around that scene. In traditional SAR imaging, the radar measurements are processed in blocks, by partitioning the data into a set of non-overlapping or overlapping azimuth angles, then processing each block.

Randolph L. Moses; Joshua N. Ash

2008-01-01

49

TAX: A Tree Algebra for XML  

Microsoft Academic Search

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

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

2001-01-01

50

Pushing XML Queries inside Relational Databases  

Microsoft Academic Search

: Due to the increasing usage of XML as an exchange format, querying XMLdocuments is also gaining attention. While several languages exist, work is under way todene the W3C standard for an XML query language. To take full advantage of the strengthof the RDBMS, XML queries on XML virtual documents need to be translated to SQLqueries to be executed by

Ioana Manolescu; Daniela Florescu; Donald Kossmann

2001-01-01

51

XML Index Recommendation with Tight Optimizer Coupling  

Microsoft Academic Search

XML database systems are expected to handle increas- ingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved for these systems is how to choose the best set of indexes for a given workload. In this paper, we present an XML Index Advisor that solves this XML index recommendation problem, and

Iman Elghandour; Ashraf Aboulnaga; Daniel C. Zilio; Fei Chiang; Andrey Balmin; Kevin S. Beyer; Calisto Zuzarte

2008-01-01

52

The XML Astronomical Data Center  

NASA Astrophysics Data System (ADS)

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

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

1999-12-01

53

Publishing Scientific Articles in XML.  

NASA Astrophysics Data System (ADS)

Most publication houses are using SGML for electronic mark up of pages intended for hardcopy. Since XML is a major subset of SGML with W3C backing and greater database compatibility, many publication houses are naturally considering switching to or including XML. Now, if authors were also to switch to XML for their manuscripts, it would greatly reduce the work load at the publication houses and reduce the number of errors that are introduced in the translation process. XML is also a logical progression for authors since it is rapidly becoming incorporated into editors such as Word Perfect, Notepad, Emacs, etc. There is an XML standard for equation markup, MathML, and equation editors exist for it. It is easy to put these manuscripts onto the Web; all one needs is to link to a standard cascade style sheet (CSS2). Leveraging our experience with encapsulating scientific data in XML the ADC (Astronomical Data Center) staff are working out details of a scientific XML article format called "AXML" (Article XML Markup Language). We foresee using AXML eventually as an end to end solution for data from experiment/observation through analysis to publication. With fewer transformations needed on article text, equations, and tables, less human intervention will be required and fewer human errors will be introduced, for example, proofing of XML documents by publication houses could someday be unnecessary or (at least) vastly more efficient. In this poster we discuss examine several important aspects of this technology, give the technical details of AXML (including a DTD) and give examples which show the power of AXML.

Shaya, E.; Borne, K.; Thomas, B.; Cheung, C. Y.

2001-12-01

54

Adaptive XML Shredding: Architecture, Implementation, and Challenges  

Microsoft Academic Search

As XML data becomes central to business-critical applications, there is a growing need for efficient and reliable XML storage.\\u000a Two main approaches have been proposed for storing XML data: native and colonial systems. Native systems (e.g., [19], [20]) are designed from the ground up specifically for XML and XML query languages. Colonial systems (e.g., [5],[7], [19]), on the other hand,

Juliana Freireand; Jérôme Siméon

2002-01-01

55

Recursive Microstates Model  

NSDL National Science Digital Library

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

Christian, Wolfgang; Salagaram, Trisha; Chetty, Nithaya

2011-08-08

56

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

PubMed

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

Misztal, I; Legarra, A; Aguilar, I

2014-06-01

57

A recursive technique for adaptive vector quantization  

NASA Technical Reports Server (NTRS)

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

Lindsay, Robert A.

1989-01-01

58

XWeB: The XML Warehouse Benchmark  

NASA Astrophysics Data System (ADS)

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

Mahboubi, Hadj; Darmont, Jérôme

59

XML: a lingua franca for science?  

PubMed

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

Barillot, E; Achard, F

2000-08-01

60

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

61

Mesh-based content routing using XML  

Microsoft Academic Search

We have developed a new approach for reliably multicasting time-critical data to heterogeneous clients over mesh-based overlay networks. To facilitate intelligent content pruning, data streams are comprised of a sequence of XML packets and forwarded by application-level XML routers. XML routers perform content-based routing of individual XML packets to other routers or clients based upon queries that describe the information

Alex C. Snoeren; Kenneth Conley; David K. Gifford

2001-01-01

62

Embedding rings in recursive networks  

Microsoft Academic Search

The WK-Recursive network (WKRN) is a hierarchical interconnection network that is recursively defined and has excellent properties for scalable message-passing computer systems. In this paper we describe the ability of a WKRN to implement algorithms that use the communication pattern of rings. We first describe how rings of arbitrary size can be embedded in WKRNs. We then describe how Hamiltonian

Ronald Fernandes; Donald K. Friesen; Arkady Kanevsky

1994-01-01

63

Setting the Standard: XML on Campus.  

ERIC Educational Resources Information Center

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

Rawlins, Mike

2001-01-01

64

Towards Schema-Guided XML Query Induction  

Microsoft Academic Search

XML query induction is a key task in Web information extraction. Recent approaches based on grammatical inference represent node selection queries in XML trees by de- terministic tree automata. In this paper, we show how to guide RPNI-based learning algo- rithms by XML schemas which we can infer in a preprocessing step. We hope that schema guidance will help to

Jerome Champavere; Remi Gilleron; Aurélien Lemay; Joachim Niehren

65

XML Native Storage and Query Processing  

Microsoft Academic Search

As XML has evolved as a data model for semi-structured data and the de facto standard for data exchange (e.g., Atom, RSS, and XBRL), XML data management has been the subject of extensive research and development in both academia and industry. Among the XML data management issues, storage and query processing are the most critical ones with respect to system

Ning Zhang; M. Tamer Özsu

66

Mapping XML to a Wide Sparse Table  

Microsoft Academic Search

XML is commonly supported by SQL database systems. However, existing mappings of XML to tables can only deliver satisfactory query performance for limited use cases. In this paper, we propose a novel mapping of XML data into one wide table whose columns are sparsely populated. This mapping provides good performance for document types and queries that are observed in enterprise

Liang Jeff Chen; Philip A. Bernstein; Peter Carlin; Dimitrije Filipovic; Michael Rys; Nikita Shamgunov; James F. Terwilliger; Milos Todic; Sasa Tomasevic; Dragan Tomic

2012-01-01

67

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

68

The Xylia Toolkit: Editing XML with Java  

Microsoft Academic Search

This paper presents an overview of the Xylia software library, this library is being designed for the development of user friendly visual editors for the eXtensible Markup Language (XML)(1). XML is a standard for markup languages. Each language conforming to XML is similar in structure to HTML, but has its own set of permissible tags, and rules about how they

Jonathan Milley; Theodore S. Norvell; Dennis K. Peters

69

Dynamic XML documents with distribution and replication  

Microsoft Academic Search

The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML documents. These are XML documents where some data is given explicitly while other parts are given only intensionally by means of embedded calls to web services that can be

Serge Abiteboul; Angela Bonifati; Grégory Cobéna; Ioana Manolescu; Tova Milo

2003-01-01

70

Lazy query evaluation for Active XML  

Microsoft Academic Search

In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML documents whose content is given partly extensionally, by explicit data elements, and partly intensionally, by embedded calls to Web services, which can be invoked to generate data.A major challenge in the

Serge Abiteboul; Omar Benjelloun; Bogdan Cautis; Ioana Manolescu; Tova Milo; Nicoleta Preda

2004-01-01

71

Wrapping web data into XML  

Microsoft Academic Search

The vast majority of online information is part of the World Wide Web. In order to use this information for more than human browsing, web pages in HTML must be converted into a format meaningful to software programs. Wrappers have been a useful technique to convert HTML documents into semantically meaningful XML files. However, developing wrappers is slow and labor-intensive.

Wei Han; David Buttler; Calton Pu

2001-01-01

72

Cubing Algorithms for XML Data  

Microsoft Academic Search

The problem of effectively and efficiently building OLAP data cubes over XML data sources is prominent in next-generation Enterprise Information Systems. The latter is the goal of so-called cubing algorithms, which have attracted a great deal of attention from the Database and Data Warehousing research community. On the basis of this breaking evidence, in this paper we provide a comprehensive

Alfredo Cuzzocrea

2009-01-01

73

Blind Recursive Tracking of Carrier Frequency Offset (CFO) Vector in MC-CDMA Systems  

Microsoft Academic Search

A recursive algorithm for estimating and updating the effective carrier frequency offset (CFO) vector in a multicarrier code-division multiple-access (MC-CDMA) system is proposed in this work. The recursive relation is derived based on the expectation maximization (EM) algorithm with a quadratic constraint. This new approach enables the use of linear estimation theory to tackle the CFO estimation problem with or

Feng-tsun Chien; C. C. Jay Kuo

2007-01-01

74

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

75

Adjustable Transaction Isolation in XML Database Management Systems  

Microsoft Academic Search

Processing XML documents in multi-user database management environments requires a suitable storage model of XML data, support of typ- ical XML document processing (XDP) interfaces, and concurrency control (CC) mechanisms tailored to the XML data model. In this paper, we sketch the architecture and interfaces of our prototype native XML database man- agement system which can be connected to any

Michael Peter Haustein; Theo Härder

2004-01-01

76

Querying XML Documents in Xyleme  

Microsoft Academic Search

this paper on queryprocessing. The query language supporting Xyleme graphical user interface is an extension ofOQL [6, 10] and provides a mix of database and information retrieval characteristics. It is consistentwith the requirements published by the W3C XML Query Working Group [20] and similar to manylanguages proposed by the database community for text or semistructured databases [1, 5, 7, 11].Still,

Vincent Aguilera; Sophie Cluet; Pierangelo Veltri; Dan Vodislav; Fanny Wattez

2000-01-01

77

XML Translator for Interface Descriptions  

NASA Technical Reports Server (NTRS)

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

Boroson, Elizabeth R.

2009-01-01

78

Keyword Retrieval Technology Research of XML Document  

Microsoft Academic Search

At present many commercial database using Xpath and XQuery as XML retrieval standard, grammar about XPath and XQuery is complicated , it is difficult for general user to use. In this paper, the research work is focused on the keyword retrieval technology of XML document, designs a XML full-text information retrieval similar to HTML full-text information retrieval,proposes inverted-file retrieval method

Ji-xin Zhang; Xia Sun

2011-01-01

79

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

80

Vectorizing and Querying Large XML Repositories  

Microsoft Academic Search

Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to store each col- umn separately. We use a generalization of vectorization as the basis for a native XML store. The idea is to decompose an XML document into a set of vectors that contain the

Peter Buneman; Byron Choi; Wenfei Fan; Robert Hutchison; Robert Mann; Stratis D. Viglas

2005-01-01

81

XML Content Finally Arrives on the Web!  

ERIC Educational Resources Information Center

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

Funke, Susan

1998-01-01

82

RRXF: Redundancy reducing XML storage in relations  

Microsoft Academic Search

Current techniques for storing XML using relational technology consider the structure of an XML docu- ment but ignore its semantics as expressed by keys or functional dependencies. However, when the seman- tics of a document are considered redundancy may be reduced, node identifiers removed where value-based keys are available, and semantic constraints validated using relational primary key technology. In this

Yi Chen; Susan B. Davidson; Carmem S. Hara; Yifeng Zheng

2003-01-01

83

Metadata Engineering for Corporate Portals Using XML  

Microsoft Academic Search

Careful analysis and preparation is required in order to prepare for XML-based delivery of data via Corporate Portals. This\\u000a process is refereed to as Metadata Engineering. This presentation describes the use of the metadata model to guide the metadata\\u000a engineering as a precursor to metadata implementation in preparation for XML-based delivery.

Peter H. Aiken; Kathi Hogshead Davis

2000-01-01

84

An authorization model for XML databases  

Microsoft Academic Search

In this paper, we define a security model for a native XML database which supports the Xupdate language. Our model is inspired by the SQL security model which is the most famous security model for database. We first define a generic access control model for tree data structures. Then, we apply our model to an XML database which supports the

Alban Gabillon

2004-01-01

85

Data Independent Recursion in Deductive Databases.  

National Technical Information Service (NTIS)

Some recursive definitions in deductive database systems can be replaced by equivalent nonrecursive definitions. In this paper we give a linear-time algorithm that detects many such definitions, and specify a useful subset of recursive definitions for whi...

J. Naughton

1986-01-01

86

Recursivity of Global Normmaking: A Sociolegal Agenda  

Microsoft Academic Search

This review proposes that the recursivity of law offers a promising framework for sociolegal and interdisciplinary research on global norm-making. The recursivity approach is systematic, generates hypotheses and questions about global actors and mechanisms, takes seriously historical contingency, and is inherently comparative across issue areas and different levels of governance. In global lawmaking, recursivity proceeds principally through the intersection of

Terence C. Halliday

2009-01-01

87

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

88

Recursive Bayesian recurrent neural networks for time-series modeling.  

PubMed

This paper develops a probabilistic approach to recursive second-order training of recurrent neural networks (RNNs) for improved time-series modeling. A general recursive Bayesian Levenberg-Marquardt algorithm is derived to sequentially update the weights and the covariance (Hessian) matrix. The main strengths of the approach are a principled handling of the regularization hyperparameters that leads to better generalization, and stable numerical performance. The framework involves the adaptation of a noise hyperparameter and local weight prior hyperparameters, which represent the noise in the data and the uncertainties in the model parameters. Experimental investigations using artificial and real-world data sets show that RNNs equipped with the proposed approach outperform standard real-time recurrent learning and extended Kalman training algorithms for recurrent networks, as well as other contemporary nonlinear neural models, on time-series modeling. PMID:20040415

Mirikitani, Derrick T; Nikolaev, Nikolay

2010-02-01

89

Recursion Schemes as Abstract Interfaces  

Microsoft Academic Search

Many typed functional languages provide excellent support for defining and manipulating concrete instances of induc- tively defined recursive types. However, few of these lan- guages provide good support for treating these types in a more abstract way. There have been a number of lan- guage extensions proposed to provide abstract facilities for manipulating types. Unfortunately none have been widely adopted.

Tom Murphy

90

Recursive calculation of hansen coefficients  

Microsoft Academic Search

Hansen coefficients are used in expansions of the elliptic motion. Three methods for calculating the coefficients are studied: Tisserand's method, the Von Zeipel-Andoyer (VZA) method with explicit representation of the polynomials required to compute the Hansen coefficients, and the VZA method with the values of the polynomials calculated recursively. The VZA method with explicit polynomials is by far the most

Richard L. Branham

1990-01-01

91

Recursive binary valued image filters  

Microsoft Academic Search

Recursive spatially invariant and spatially varying filter algorithms were developed for image filters with binary valued point spread functions. The nonzero extent of the point spread function is restricted to four connected regions of the image plane which are referred to as digital blobs. Graph theoretic arguments are used to show how to partition a digital blob into minimum number

L. A. Ferrari

1980-01-01

92

Lessons in Contingent, Recursive Humility  

ERIC Educational Resources Information Center

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

Vagle, Mark D.

2011-01-01

93

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

94

Information Retrieval of Sequential Data in Heterogeneous XML Databases  

Microsoft Academic Search

The XML language is a W3C standard sustained by both the industry and the scientific community. Therefore, the available information annotated in XML keeps and will keep increasing in size. Nonetheless, not only the volume of the XML information is increasing but also its complexity. The XML documents evolved from plain structured text representations, to documents having complex and heterogeneous

Eugen Popovici; Pierre-francois Marteau; Gildas Ménier

2005-01-01

95

Pragmatic XML Access Control Using Off-the-Shelf RDBMS  

Microsoft Academic Search

As the XML model gets more popular, new needs arise to specify access control within XML model. To meet these needs, various XML access control models and enforcement methods have been proposed recently. However, by and large, these approaches either assume the support of security features from XML databases or use proprietary tools outside of databases. Since there are currently

Bo Luo; Dongwon Lee; Peng Liu

2007-01-01

96

XML, TEI, and Digital Libraries in the Humanities.  

ERIC Educational Resources Information Center

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

Nellhaus, Tobin

2001-01-01

97

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

98

Anatomy of a native XML base management system  

Microsoft Academic Search

Several alternatives to manage large XML docu- ment collections exist, ranging from file systems over rela- tional or other database systems to specifically tailored XML base management systems. In this paper we give a tour of Natix, a database management system designed from scratch for storing and processing XML data. Contrary to the com- mon belief that management of XML

Thorsten Fiebig; Sven Helmer; Carl-christian Kanne; Guido Moerkotte; Julia Neumann; Robert Schiele; Till Westmann

2002-01-01

99

A Framework for Learning Comprehensible Theories in XML Document Classification  

Microsoft Academic Search

XML has become the universal data format for a wide variety of information systems. The large number of XML documents existing on the web and in other information storage systems makes classification an important task. As a typical type of semistructured data, XML documents have both structures and contents. Traditional text learning techniques are not very suitable for XML document

Jemma Wu

2012-01-01

100

XML and relational database management systems: the inside story  

Microsoft Academic Search

As XML has evolved from a document markup language to a widely-used format for exchange of structured and semistructured data, managing large amounts of XML data has become increasingly important. A number of companies, including both established database vendors and startups, have recently announced new XML database systems or new XML functionality integrated into existing database systems. This tutorial will

Michael Rys; Donald D. Chamberlin; Daniela Florescu

2005-01-01

101

An Introduction to the Extensible Markup Language (XML).  

ERIC Educational Resources Information Center

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

Bryan, Martin

1998-01-01

102

Schema extraction and levelization for XML data  

NASA Astrophysics Data System (ADS)

XML is a new standard for representing and exchanging information on the Internet. An XML data is a data that is tagged by XML elements. Such an XML data can be retrieved not only by a Boolean connection with keywords on the Internet. Keyword-based information retrieval does not precisely result in user requests partly because user requests cannot be properly conveyed. Either too many or too few matches are produced. It is not trivial to formulate what to retrieve for a good-sized query-result. In conventional approaches, a database schema is useful for users to formulate queries and for query processing. Likewise, this paper proposes a method of schema extraction for XML data collection. Obtaining one single schema is not sufficient to serve for the good size of information retrieval and adaptively for the various requests from Internet users. To support this, schemas are then levelized with respect to the frequency of topological data structures in a database. The topological structural information of these schemas is used to formulate queries and further to rewrite queries for relaxation and restriction. Without modification, the method proposed in this paper is used not only for multimedia XML data collections but also for general XML databases.

Yoon, Jong P.; Kim, Sung-Rim

2001-03-01

103

An XML portable chart format.  

PubMed

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

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

1998-01-01

104

DTDs go XML schema--a tools perspective.  

PubMed

Document Type Definitions (DTDs) are widely used to describe the structure of XML documents. The Clinical Document Architecture (CDA) and the Guideline Element Model (GEM) are examples from the healthcare domain. XML schemas provide another way to describe types of XML documents. In this paper we aim to advocate XML schemas from the perspective of an ANSI standard, the XML based CDA from HL7 (ANSI/HL7 CDA R1.0-2000). It turned out that existing tools do not fully exploit the knowledge contained in DTDs and XML schemas. The result of this study is a set of tools (DTD to XML Schema translator, DTD and XML schema browser, XML editor), which can be downloaded from the official W3C site and which work with any DTD and XML schema. PMID:11783713

Schweiger, R; Hoelzer, S; Heitmann, K U; Dudeck, J

2001-01-01

105

An Overview of Research on Reverse Engineering XML Schemas into UML Diagrams  

Microsoft Academic Search

Extensible Markup Language (XML) has become a standard for data representation and exchange over the Internet. XML schemas are often used to define vocabularies of XML document types and to validate whether the XML documents adhere to the rules defined in the XML schemas. Since XML schemas are textual, programmatic, logical-level schemas, users of XML schemas often find it difficult

Augustin Yu; Robert Steele

2005-01-01

106

Application of the recursive convolution technique to modeling lumped circuit elements in FDTD simulations  

Microsoft Academic Search

This paper presents a simple approach for extending the basic Yee FDTD algorithm to allow for modeling combinations of resistors, capacitors and inductors as lumped elements. This approach uses the recursive convolution (RC) technique previously applied in FDTD for simulating pulse propagation in frequency dependent dielectric media. In the application presented, the potential across the lumped load is updated by

Joseph W. Schuster; Raymond I. Luebbers; Thomas G. Livernois

1998-01-01

107

Schema-Based Constrained XML Data Indexing and Storage Technique  

Microsoft Academic Search

The XML Schema describes XML document pattern information standard as a W3C formulation; it is not only integrated and exchanges XML document data to provide valid confirmation for different enterprise information, supporting document renewal effectively.The article proposes a schema based on XML Schema memory and index XML document technology and avoids the connection operation which the multi-tables save, when inquiry

Xuebin Chen; Guolin Duan; Hongcan Yan; Shufen Zhang; Yuee Che

2009-01-01

108

Core Recursive Hierarchical Image Segmentation  

NASA Technical Reports Server (NTRS)

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

Tilton, James

2011-01-01

109

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

110

MedlinePlus XML Data Sources  

MedlinePLUS

... Web service provides access to all English and Spanish MedlinePlus health topics and offers a variety of ... Group XML These files cover all English and Spanish health topics and can be found on the ...

111

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

112

Tree Components Programming: An Application to XML  

Microsoft Academic Search

We present a new programming approach based on a contextual component specification. The language we propose integrates XML\\u000a and functional aspects in a coherent and homogeneous framework. This enables us to fully have static typing and to specify\\u000a formal properties with respect to interactions.\\u000a \\u000a Our language FICX, Functional Interactive and Compositional XML, defines a new kind of data structure called

Pascal Coupey; Christophe Fouqueré; Jean-vincent Loddo

2007-01-01

113

Efficient Query Evaluation over Compressed XML Data  

Microsoft Academic Search

XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried in an efficient way. To address this prob- lem, we propose XQueC ,a n (XQue)ry processor and (C)ompressor, which covers a large set of XQuery queries in the compressed domain. We

Andrei Arion; Angela Bonifati; Gianni Costa; Sandra D’Aguanno; Ioana Manolescu; Andrea Pugliese

2004-01-01

114

Parallel Evaluation of Recursive Rule Queries  

Microsoft Academic Search

We investigate the parallel computational complexity of recursive rule queries. These queries are a subset of first-order relational queries augmented with recursion. They form an important psrt of the PROLOG language aud can be eva!uated in PTIME. In (32) Sagiv has shown that it is decidable whether a typed recursive rule query is equivalent to a first-order relational query. We

Stavros S. Cosmadakis; Paris C. Kanellakis

1986-01-01

115

XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme  

NASA Astrophysics Data System (ADS)

Query evaluation in an XML database requires reconstructing XML subtrees rooted at nodes found by an XML query. Since XML subtree reconstruction can be expensive, one approach to improve query response time is to use reconstruction views - materialized XML subtrees of an XML document, whose nodes are frequently accessed by XML queries. For this approach to be efficient, the principal requirement is a framework for view selection. In this work, we are the first to formalize and study the problem of XML reconstruction view selection. The input is a tree T, in which every node i has a size c i and profit p i , and the size limitation C. The target is to find a subset of subtrees rooted at nodes i 1, ? , i k respectively such that c_{i_1}+\\cdots +c_{i_k}le C, and p_{i_1}+\\cdots +p_{i_k} is maximal. Furthermore, there is no overlap between any two subtrees selected in the solution. We prove that this problem is NP-hard and present a fully polynomial-time approximation scheme (FPTAS) as a solution.

Chebotko, Artem; Fu, Bin

116

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

2013-01-21

117

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

118

Efficient Induction of Recursive Prolog Definitons  

Microsoft Academic Search

The ability to learn recursive definitions is a desirable characteristic of a learner. This paper presents Clam, a system that efficiently learns Prolog purely and left-recursive definitions from small data sets by using inverse implication. A learning curve for Clam shows that the accuracy grows with the increase of both positive and negative examples. We believe our system can be

Riverson Rios; Stan Matwin

1996-01-01

119

Recursive Fisher Linear Discriminant for BCI Applications  

Microsoft Academic Search

A novel recursive procedure for extracting discriminant features, termed Recursive Fisher Linear Discriminant (RFLD), is applied to brain-computer interface (BCI) problems. Compared to traditional Fisher Linear Discriminant (FLD), RFLD relaxes the constraint on the total number of features that can be extracted. The new RFLD has been tested on motor imagery classification with the electrocorticography (ECoG) signals. The resulting improvement

D. Huang; C. Xiang; S. S. Ge

2007-01-01

120

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

121

XML Based Scientific Data Management Facility  

NASA Technical Reports Server (NTRS)

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

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

2002-01-01

122

Efficiently Querying Large XML Data Repositories: A Survey  

Microsoft Academic Search

Abstract—Extensible Markup Language,(XML) is emerging,as a de facto standard,for information exchange,among,various applications on the World Wide Web. There has been a growing,need for developing,high-performance,techniques,to query large XML data repositories efficiently. One important problem in XML query processing is twig pattern matching, that is, finding in an XML data tree D all matches that satisfy a specified twig (or path) query

Gang Gou; Rada Chirkova

2007-01-01

123

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

124

Automated Testing of XML\\/SOAP based Web Services  

Microsoft Academic Search

Abstract Web services provide seamless connections from one software application to another over private intranets and the Internet The major communication protocol used is SOAP being mainly XML over HTTP The exchanged data follow precise format rules in the form of XML Document Type Definitions or more recently the proposed XML Schemas Web service testing considers functionality and load aspects

Ina Schieferdecker; Bernard Stepien

2003-01-01

125

XML access control: from XACML to annotated schemas  

Microsoft Academic Search

XML became the de facto standard for the data representation and exchange on the internet. Regarding XML documents access control policy definition, OASIS ratified the XACML standard. It is a declarative language allowing the specification of authorizations as rules. Furthermore, it is common to formally represent XML documents as labeled trees and to handle secure requests through “user views”. A

Ryma Abassi; F. Jacquemard; M. Rusinowitch; S. G. El Fatmi

2010-01-01

126

XML and E-Journals: The State of Play.  

ERIC Educational Resources Information Center

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

Wusteman, Judith

2003-01-01

127

Data Management for XML: Research Directions  

Microsoft Academic Search

This paper is a July 1999 snapshot of a "whitepaper" that I've been working on. The purpose of thewhitepaper, which I initially drafted in April 1999, was to formulate and put into prose my thoughts onthe research opportunities XML brings to the general area of data management. It is important to knowthat this paper is not a survey. It offers

Jennifer Widom

1999-01-01

128

Fuzzy Semantic Annotation of XML Documents  

Microsoft Academic Search

The e.dot project consists in the semi-automatic construction of an XML data warehouse in the field of food safety. The constructi on and the query- ing of the data warehouse are guided by an ontology. We are working on the annotation of tables extracted from scientific articles in m icrobiology with terms of the ontology. Terms from those articles may

Gaelle Hignette; Patrice Buche; Juliette Dibie-Barthelemy

129

Type-Based Compression of XML Data  

Microsoft Academic Search

The extensible markup language XML has become indispensable in many areas, but a significant disadvantage is its size: tagging a set of data increases the space needed to store it, the bandwidth needed to transmit it, and the time needed to parse it. We present a new compression technique based on the document type, expressed as a Relax NG schema.

Kenjone Eng

2007-01-01

130

XTCE. XML Telemetry and Command Exchange Tutorial  

NASA Technical Reports Server (NTRS)

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

Rice, Kevin; Kizzort, Brad; Simon, Jerry

2010-01-01

131

XML Schema Mappings for Heterogeneous Database Access  

Microsoft Academic Search

The unprecedented increase in the availability of information, due to the success of the World Wide Web, has generated an urgent need for new and robust methods that simplify the querying and integration of data. In this research, we investigate a practical framework for data access to heterogeneous data sources. The framework utilizes the extensible markup language (XML) Schema as

Samuel Robert Collins; Shamkant B. Navathe; Leo Mark

2002-01-01

132

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

133

Template Resolution in XML\\/HTML  

Microsoft Academic Search

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

Anders Kristensen

1998-01-01

134

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

135

Flight Dynamic Model Exchange using XML  

NASA Technical Reports Server (NTRS)

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

Jackson, E. Bruce; Hildreth, Bruce L.

2002-01-01

136

Converting from XML to HDF-EOS  

NASA Technical Reports Server (NTRS)

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

Ullman, Richard; Bane, Bob; Yang, Jingli

2008-01-01

137

Xquec: Pushing Queries to Compressed XML Data  

Microsoft Academic Search

Abstract: this paper is organized as follows. In section2, we motivate the choice of our storage structures forcompressed XML, and of the compression algorithms employed.Section 3 describes the XQueC query processor,its set of physical operators, and outline its optimization algorithm.Section 4 briefly presents the demonstration scenariowe intend to show

Andrei Arion; Angela Bonifati; Gianni Costa; Sandra D'aguanno; Ioana Manolescu; Andrea Pugliese

2003-01-01

138

Why and how to benchmark XML databases  

Microsoft Academic Search

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

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

2001-01-01

139

Implementing XML Schema Naming and Design Rules  

SciTech Connect

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

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

2006-08-01

140

Application of XML to Journal Table Archiving  

NASA Astrophysics Data System (ADS)

The Astronomical Data Center (ADC) at the NASA Goddard Space Flight Center is a major archive for machine-readable astronomical data tables. Many ADC tables are derived from published journal articles. Article tables are reformatted to be machine-readable and documentation is crafted to facilitate proper reuse by researchers. The recent switch of journals to web based electronic format has resulted in the generation of large amounts of tabular data that could be captured into machine-readable archive format at fairly low cost. The large data flow of the tables from all major North American astronomical journals (a factor of 100 greater than the present rate at the ADC) necessitates the development of rigorous standards for the exchange of data between researchers, publishers, and the archives. We have selected a suitable markup language that can fully describe the large variety of astronomical information contained in ADC tables. The eXtensible Markup Language XML is a powerful internet-ready documentation format for data. It provides a precise and clear data description language that is both machine- and human-readable. It is rapidly becoming the standard format for business and information transactions on the internet and it is an ideal common metadata exchange format. By labelling, or "marking up", all elements of the information content, documents are created that computers can easily parse. An XML archive can easily and automatically be maintained, ingested into standard databases or custom software, and even totally restructured whenever necessary. Structuring astronomical data into XML format will enable efficient and focused search capabilities via off-the-shelf software. The ADC is investigating XML's expanded hyperlinking power to enhance connectivity within the ADC data/metadata and developing XSL display scripts to enhance display of astronomical data. The ADC XML Definition Type Document can be viewed at http://messier.gsfc.nasa.gov/dtdhtml/DTD-TREE.html

Shaya, E. J.; Blackwell, J. H.; Gass, J. E.; Kargatis, V. E.; Schneider, G. L.; Weiland, J. L.; Borne, K. D.; White, R. A.; Cheung, C. Y.

1998-12-01

141

Method for implementation of recursive hierarchical segmentation on parallel computers  

NASA Technical Reports Server (NTRS)

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

Tilton, James C. (Inventor)

2005-01-01

142

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

PubMed

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

Vicari, Giuseppe; Adenzato, Mauro

2014-05-01

143

Semantics of Higher-Order Recursion Schemes  

NASA Astrophysics Data System (ADS)

Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least interpreted semantics in every Scott’s model of ?-calculus in which the terminals are interpreted as continuous operations. For the uninterpreted semantics based on infinite ?-terms we follow the idea of Fiore, Plotkin and Turi and work in the category of sets in context, which are presheaves on the category of finite sets. Whereas Fiore et al proved that the presheaf F ? of ?-terms is an initial H ? -monoid, we work with the presheaf R ? of rational infinite ?-terms and prove that this is an initial iterative H ? -monoid. We conclude that every guarded higher-order recursion scheme has a unique uninterpreted solution in R ? .

Adámek, Ji?í; Milius, Stefan; Velebil, Ji?í

144

Tracking of Nonstationary Noise Based on Data-Driven Recursive Noise Power Estimation  

Microsoft Academic Search

This paper considers estimation of the noise spectral variance from speech signals contaminated by highly nonsta- tionary noise sources. The method can accurately track fast changes in noise power level (up to about 10 dB\\/s). In each time frame, for each frequency bin, the noise variance estimate is updated recursively with the minimum mean-square error (mmse) estimate of the current

Jan S. Erkelens; Richard Heusdens

2008-01-01

145

Powerlist: a structure for parallel recursion  

Microsoft Academic Search

Many data-parallel algorithms—Fast Fourier Transform, Batcher's sorting schemes, and the prefix-sum—exhibit recursive structure. We propose a data structure called powerlist that permits succinct descriptions of such algorithms, highlighting the roles of both parallelism and recursion. Simple algebraic properties of this data structure can be explotied to derive properties of these algorithms and to establish equivalence of different algorithms that solve

Jayadev Misra

1994-01-01

146

Recursive Inversion Of Externally Defined Linear Systems  

NASA Technical Reports Server (NTRS)

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

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

1992-01-01

147

Recursive updating the eigenvalue decomposition of a covariance matrix  

Microsoft Academic Search

The author addresses the problem of computing the eigensystem of the modified Hermitian matrix, given the prior knowledge of the eigensystem of the original Hermitian matrix. Specifically, an additive rank-k modification corresponding to adding and deleting blocks of data to and from the covariance matrix is considered. An efficient and parallel algorithm which makes use of a generalized spectrum-slicing theorem

K.-B. Yu

1991-01-01

148

Using Heaps in Recursive Hierarchical Segmentation of Data  

NASA Technical Reports Server (NTRS)

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

Tilton, James C.

2006-01-01

149

Linking clinical data using XML topic maps.  

PubMed

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

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

2003-05-01

150

A Simple XML Producer-Consumer Protocol  

NASA Technical Reports Server (NTRS)

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

Smith, Warren; Gunter, Dan; Quesnel, Darcy

2000-01-01

151

XML Based Scientific Data Management Facility  

NASA Technical Reports Server (NTRS)

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

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

2001-01-01

152

Structural Caching XML data for Wireless Accesses  

Microsoft Academic Search

Recent web cache replacement policies incorporate information such as document size, frequency, and age in the decision process. In this paper, we propose a new caching algorithm, StructCache, for wireless accesses of XML data. The algorithm is an enhancement of the Greedy-Dual-Size (GDS) policy and the Greedy-Dual- Frequency-Size (GDFS) policy. It would consider document sizes, access frequency and exploits the

Shiu Hin Wang; Vincent Ng

153

XML Based Markup Languages for Specific Domains  

NASA Astrophysics Data System (ADS)

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

Varde, Aparna; Rundensteiner, Elke; Fahrenholz, Sally

154

Recursive Branching Simulated Annealing Algorithm  

NASA Technical Reports Server (NTRS)

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

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

2012-01-01

155

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

156

Formatting Journal Tables in XML at the ADC  

NASA Astrophysics Data System (ADS)

The eXtensible Markup Language (XML) is a powerful, internet-ready storage format for data. It provides a precise and clear data description language that is both machine- and human-readable. Documents marked up with XML can be easily parsed for efficient and focused searching. XML's expanded hyperlinking power can be used to enhance connectivity among archive documents. It is fast becoming the standard format for business and information transactions on the Internet and it is an ideal common metadata exchange format. The Astronomical Data Center (ADC) plans to develop scripts to explore and display table data and metadata. The ADC is also developing XML authoring tools for scientists to convert their data and metadata into XML and to create conversion software for the ingest of journal tables into the ADC XML archive.

Shaya, Edward; Blackwell, Jim; Gass, Jim; Kargatis, Vincent; Schneider, Gail; Borne, Kirk; Cheung, Cynthia; White, Richard

157

From XML DTDs to Entity-Relationship Schemas  

Microsoft Academic Search

\\u000a The need for managing large repositories of data coming from XML documents is increasing; in fact, XML is emerging as the\\u000a standard format for documents exchanged over the internet.\\u000a \\u000a \\u000a At University of Bergamo, recently we developed the ERX Data Management System, to study issues concerning the management\\u000a of data coming from XML documents; its data model, called ERX (Entity Relationship

Giuseppe Psaila; Viale Marconi

2003-01-01

158

Recursive unsupervised learning of finite mixture models.  

PubMed

There are two open problems when finite mixture densities are used to model multivariate data: the selection of the number of components and the initialization. In this paper, we propose an online (recursive) algorithm that estimates the parameters of the mixture and that simultaneously selects the number of components. The new algorithm starts with a large number of randomly initialized components. A prior is used as a bias for maximally structured models. A stochastic approximation recursive learning algorithm is proposed to search for the maximum a posteriori (MAP) solution and to discard the irrelevant components. PMID:15460286

Zivkovic, Zoran; van der Heijden, Ferdinand

2004-05-01

159

Recursive Implementations of the Consider Filter  

NASA Technical Reports Server (NTRS)

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

Zanetti, Renato; DSouza, Chris

2012-01-01

160

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

161

Information persistence using XML database technology  

NASA Astrophysics Data System (ADS)

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

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

2005-05-01

162

A Simple XML Producer-Consumer Protocol  

NASA Technical Reports Server (NTRS)

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

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

2001-01-01

163

Accurate searching using XML and topic maps.  

PubMed

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

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

2003-01-01

164

Wrapping Legacy COBOL Programs behind an XML-Interface  

Microsoft Academic Search

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

Harry M. Sneed

2001-01-01

165

Interfacing environmental simulation models and databases using XML  

Microsoft Academic Search

Typically in environmental management tasks one needs to examine and explore data from several sources, use simulation models, develop scenarios, assess impacts, and provide support for decision makers. Here we consider the eXtensible Markup Language (XML) standard in developing information transfer techniques between databases and simulation models. Suitability of XML as the agreed data transfer format is studied in a

Teemu Kokkonen; Ari Jolma; Harri Koivusalo

2003-01-01

166

XML-based ISO9000 electronic document management system  

Microsoft Academic Search

Maintaining, customizing, sharing and reusing ISO9000 quality documents are essential for many organizations, especially those who work as virtual enterprises (VE). In a VE, the documents must be shared among organizations to take the full advantages of the recent Internet advances. XML is a new browser-based language standard. The purpose of this research is to explore the capabilities of XML

Yin-Ho Yao; Amy J. C Trappey; Pei-Shun Ho

2003-01-01

167

An Expressive and Efficient Language for XML Information Retrieval.  

ERIC Educational Resources Information Center

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

Chinenyanga, Taurai Tapiwa; Kushmerick, Nicholas

2002-01-01

168

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

169

Locating XML Documents Using Content and Structure Synopses  

Microsoft Academic Search

In this paper, we present a novel framework for locating schema-less XML documents based on concise data synopses extracted from the documents. We introduce two novel data synopses, content synopsis and positional filter, to summa- rize the text data in an XML document for the query eval- uation. These two data synopses correlate textual with po- sitional information and consider

Weimin He; Leonidas Fegaras; David Levine

2007-01-01

170

DXEC: integrating database, XML and email for collaboration  

Microsoft Academic Search

This paper introduces DXEC, a database, XML and email enabled framework for better collaborative work. The framework use emails as the main collaboration medium, which are mainly generated automatically by OA applications and groupware systems. But instead of using them naively, each email in the system are wrapped in a XML envelop, which provides superior searching and filtering ability. Emails

Yuan Wang; Gang Chen; Jin-Xiang Dong

2005-01-01

171

Comparative Analysis of ASCII and XML Logging Systems.  

National Technical Information Service (NTIS)

This research compares XML and ASCII based event logging systems in terms of their storage and processing efficiency. XML has been an emerging technology, even for security. Therefore, it is researched as a logging system with the mitigation of its verbos...

E. Hanington

2010-01-01

172

A Typed Calculus for Querying Distributed XML Documents  

Microsoft Academic Search

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

Lucia Acciai; Michele Boreale; Silvano Dal-zilio

2006-01-01

173

Fast and simple XML tree differencing by sequence alignment  

Microsoft Academic Search

With the advent of XML we have seen a renewed interest in methods for computing the dierence between trees. Meth- ods that include heuristic elements play an important role in practical applications due to the inherent complexity of the problem. We present a method for dierencing XML as ordered trees based on mapping the problem to the domain of sequence

Tancred Lindholm; Jaakko Kangasharju; Sasu Tarkoma

2006-01-01

174

XML-based Web information extraction system design and implementation  

Microsoft Academic Search

Based on the research of the existing Web information extraction techniques, this paper proposes a XML-based Web information extraction system design. This design can extract the interested information points from HTML pages and express the extracted results by using structured XML with strong scalability. The system has certain versatility and flexibility, users can quickly customize for the Web information extraction

Ma Jun; Li Tihong

2010-01-01

175

XML-Based Language for Specific Scientific Data Description  

Microsoft Academic Search

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

Bogdan Shishedjiev; Mariana Goranova; Juliana Georgieva

2010-01-01

176

A horizon-recursive form for predictors and their computation  

Microsoft Academic Search

Concerns the design of self-tuning controllers using output predictors. A simple, horizon-recursive expression for output predictors is obtained for both SISO and MIMO systems described by ARMAX models. This expression reveals that the predictors for the different prediction horizons are recursively related by a key parameter vector. Thus, by recursively computing this key parameter vector, an efficient algorithm for generating

Y. Dong; Howard J. Chizeck

1990-01-01

177

Scheduling Topics for Improved Student Comprehension of Recursion  

ERIC Educational Resources Information Center

This paper presents the results of an experiment conducted to assess the affects of teaching recursion in two disjoint, non-consecutive units of instruction. One group of students was taught basic and advanced recursion topics in four consecutive class periods, while a second group was taught recursion in two two-period blocks that were separated…

Zmuda, Michael; Hatch, Melanie

2007-01-01

178

Recursive definitions of partial functions and their computations  

Microsoft Academic Search

The object of this paper is to present a syntactic and semantic model for recursive definitions, and to study the relation between their computed functions and their fixpoints. The recursive definitions that we consider are syntactic generalizations of those introduced in [2] by Kleene and in [5] by McCarthy. Each recursive definition yields two classes of fixpoint partial functions (“fixpoints

J. M. Cadiou; Zohar Manna

1972-01-01

179

Recursive backstepping control of chaotic Duffing oscillators  

Microsoft Academic Search

In this paper, the dynamics of a forced Duffing oscillator is studied by means of modern nonlinear, bifurcation and chaos theories and shows that the system is ultimately experiencing chaos. The main objective is to characterize and control chaotic behavior. A nonlinear recursive backstepping controller is proposed and the transient performance is investigated. Systematic following of a reference model is

Ahmad M. Harb; Ashraf A. Zaher; Ahmad A. Al-Qaisia; Mohammad A. Zohdy

2007-01-01

180

Recursive inversion of externally defined linear systems  

NASA Technical Reports Server (NTRS)

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

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

1988-01-01

181

Unbiased Recursive Partitioning: A Conditional Inference Framework  

Microsoft Academic Search

Recursive binary partitioning is a popular tool for regression analysis. Two fundamental problems of exhaustive search procedures usually applied to fit such models have been known for a long time: overfitting and a selection bias towards covariates with many possible splits or missing values. While pruning procedures are able to solve the overfitting problem, the variable selection bias still seriously

Torsten Hothorn; Kurt Hornik; Wirtschaftsuniversitat Wien; Achim Zeileis

2006-01-01

182

Recursive Array Layouts and Fast Matrix Multiplication  

Microsoft Academic Search

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

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

2002-01-01

183

Face recognition using recursive Fisher linear discriminant  

Microsoft Academic Search

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

Cheng Xiang; Xaooan Fan; Tongheng Lee

2006-01-01

184

Recursive Filtering And Smoothing In Robot Dynamics  

NASA Technical Reports Server (NTRS)

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

Rodriguez, Guillermo

1992-01-01

185

Substructure Allocation in Recursive Interconnection Networks  

Microsoft Academic Search

In a multiuser message passing MIMD sys tem, substructure allocation is an important aspect of sys tem design. In this paper, we present four substructure al location algorithms for a multiuser WK-Recursive network. Two algorithms are bit-map based and two are tree based. The algorithms are compared using simulation.

Ronald Fernandes; Arkady Kanevsky

1993-01-01

186

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

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

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

189

Lehmer Matrix and Its Recursive Analogue.  

National Technical Information Service (NTIS)

This paper considers the Lehmer matrix and its recursive analogue. The determinant of Lehmer matrix is derived explicitly by both its LU and Cholesky factorizations. We further define a generalized Lehmer matrix with (i; j) entries gij = min (ui+1, uj+1) ...

E. Kilic P. Stanica

2010-01-01

190

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

191

A performance evaluation of storing XML data in relational database management systems  

Microsoft Academic Search

XML is an emerging standard for the representation and exchange of Internet data. Along with document type definition (DTD), XML permits the execution of a collection of queries, using XPath to identify data in XML documents. In this paper we examine how XML data can be stored and queried using a standard relational database management system (RDBMS). For this, we

Latifur Khan; Yan Rao

2001-01-01

192

A Data Parallel Algorithm for XML DOM Parsing  

NASA Astrophysics Data System (ADS)

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

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

193

Geomagnetic modeling by optimal recursive filtering  

NASA Technical Reports Server (NTRS)

The results of a preliminary study to determine the feasibility of using Kalman filter techniques for geomagnetic field modeling are given. Specifically, five separate field models were computed using observatory annual means, satellite, survey and airborne data for the years 1950 to 1976. Each of the individual field models used approximately five years of data. These five models were combined using a recursive information filter (a Kalman filter written in terms of information matrices rather than covariance matrices.) The resulting estimate of the geomagnetic field and its secular variation was propogated four years past the data to the time of the MAGSAT data. The accuracy with which this field model matched the MAGSAT data was evaluated by comparisons with predictions from other pre-MAGSAT field models. The field estimate obtained by recursive estimation was found to be superior to all other models.

Gibbs, B. P.; Estes, R. H.

1981-01-01

194

Recursive dynamics for geared robot manipulators  

NASA Technical Reports Server (NTRS)

The authors consider the dynamical modeling of robot manipulators whose joint actuators consist of motors driving the joints through gears. The dynamical models for such manipulators are significantly more complex than those for direct drive manipulators. The authors develop recursive O(n) inverse and forward dynamics algorithms as well as recursive O(n2) algorithms for the computation of the mass matrix for geared manipulators. It is shown that, despite the added complexity of the dynamical models for geared manipulators, the algorithms closely resemble the corresponding algorithms for direct drive manipulators, and that the additional algorithmic or computational complexity is relatively insignificant. As a consequence, with little additional cost, existing direct drive algorithms can be easily extended to handle the effects of gearing at the joints.

Jain, A.; Rodriguez, G.

1990-01-01

195

LCM: A new approach to parse XML documents through loose coupling between XML document design and the corresponding application code  

NASA Astrophysics Data System (ADS)

XML (eXtensible Markup Language) is a widely used language for communication between heterogeneous, homogeneous, and internet software applications. Currently available binding and parsing techniques for XML documents involve tight coupling of the document with the application code and require a redesign of the application code for any change in the document design. This paper proposes a 'Loosely Coupled Model (LCM)' for XML document parsing, which eliminates the need to redesign the application code for moderately large changes in the XML document design. LCM takes a token based approach, which is very different from the existing methodologies for XML parsing. LCM is implemented in Java using Sun's JDK 1.5. The dataset includes 24 XML documents categorized into two sets- (a) deeply nested and (b) non-deeply nested XMLs. Each set contains 12 documents ranging from 2 KB up to 4 MB. A performance comparison for LCM is obtained and is noticed to be comparable or better against this dataset with (a) Sun's Java XML Binding (JAXB), (b) Apache's XMLBeans, and (c) JDOM parser.

Chandu, Vaddadi P.

196

VLSI recursive motion estimator chip set  

Microsoft Academic Search

The design of a VLSI chip set implementing a recursive motion estimator (ME) for video applications is described. This chip set can be used to compress the information of a full-motion video source for applications where low-bit-rate or very-low-bit-rate coding is required. The ME block provides for a set of motion vectors describing the displacement of two consecutive frames. The

S. Brofferio; M. Monti; V. Rampa; M. Taliercio

1990-01-01

197

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

198

Nonlinear recursive identification of electrically stimulated muscle  

Microsoft Academic Search

A recursive constrained least-squares (RCLS) identification method is applied to the identification of electrically stimulated quadriceps muscles in paraplegic human subjects, using percutaneous intramuscular electrodes. The nonlinear time-varying steady-state torque vs. pulsewidth recruitment characteristic of the electrode and muscle is identified simultaneously with the time-varying input\\/output muscle response dynamics, using a Hammerstein-type model which has been modified to include the

Po-Chuan Chow; Howard Jay Chizeck

1989-01-01

199

LTL Model Checking for Recursive Programs  

Microsoft Academic Search

We propose a complete algorithm to model check LTL (Linear Temporal Logic) formulas with recursive programs. Our program models\\u000a are control flow graphs extended with procedure calls. The LTL formulas may then be used to specify constraints on the global\\u000a variables and the local variables in the current scope. Our algorithm is based on semi-symbolic simulation of control-flow\\u000a graphs to

Geng-dian Huang; Lin-zan Cai; Farn Wang

2009-01-01

200

A recursion equation for prime numbers  

Microsoft Academic Search

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\\\\lim\\\\limits_{s\\\\to +\\\\infty} [\\\\prod\\\\limits^n_{k=1} (1-\\\\frac{1}{p^s_k}) \\\\sum\\\\limits^\\\\infty_{j=1} \\\\frac{1}{j^s} -1]^{-1\\/s}. $$ The upper limit on the sum can be replaced by $2p_n -1$, and the result still holds.

Joseph B. Keller

2007-01-01

201

XML Tactical Chat (XTC): The Way Ahead for Navy Chat.  

National Technical Information Service (NTIS)

The motivation for pursuing XML-based tactical chat includes the great potential of this technology and fixing limitations of current chat programs. XTC capabilities have the potential to completely upgrade and restructure all tactical military communicat...

D. DeVos

2007-01-01

202

XML DTD and Schemas for HDF-EOS  

NASA Technical Reports Server (NTRS)

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

Ullman, Richard; Yang, Jingli

2008-01-01

203

XPath+: A Tool for Linked XML Documents Navigation  

NASA Astrophysics Data System (ADS)

Links are basic elements in the World Wide Web. The use of links in XML documents goes further than in the WWW, since XML links express the semantics of a relationship. XLink has been proposed by the W3C as a standard for representing links in XML. However, most of the current query languages found in literature, like XPath, do not support navigation over XML links, making its adoption difficult by software developers. In this paper, an extension for the XPath query language is proposed, namely XPath+, which provides a means of navigating through both internal and external links. Particularly, both the syntax and semantics of XPath+ are given, along with some results derived from the implementation of our work.

Caetano da Silva, Paulo; Cesário Times, Valéria

204

Taxonomy of XML Schema Languages Using Formal Language Theory  

Microsoft Academic Search

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

Makoto Murata; Dongwon Lee; Murali Mani

2001-01-01

205

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.

206

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

207

Darboux transformations and recursion operators for differential-difference equations  

NASA Astrophysics Data System (ADS)

We review two concepts directly related to the Lax representations of integrable systems: Darboux transformations and recursion operators. We present an extensive list of integrable differential-difference equations with their Hamiltonian structures, recursion operators, nontrivial generalized symmetries, and Darboux-Lax representations. The new results include multi-Hamiltonian structures and recursion operators for integrable Volterra-type equations and integrable discretizations of derivative nonlinear Schrödinger equations such as the Kaup-Newell, Chen-Lee-Liu, and Ablowitz-Ramani-Segur (Gerdjikov-Ivanov) lattices. We also compute the weakly nonlocal inverse recursion operators.

Khanizadeh, F.; Mikhailov, A. V.; Wang, Jing Ping

2013-12-01

208

Modified Recursive Hierarchical Segmentation of Data  

NASA Technical Reports Server (NTRS)

An algorithm and a computer program that implements the algorithm that performs recursive hierarchical segmentation (RHSEG) of data have been developed. While the current implementation is for two-dimensional data having spatial characteristics (e.g., image, spectral, or spectral-image data), the generalized algorithm also applies to three-dimensional or higher dimensional data and also to data with no spatial characteristics. The algorithm and software are modified versions of a prior RHSEG algorithm and software, the outputs of which often contain processing-window artifacts including, for example, spurious segmentation-image regions along the boundaries of processing-window edges.

Tilton, James C.

2006-01-01

209

A recursion equation for prime numbers  

Microsoft Academic Search

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next\\u000aone by the recursion equation $$ p_{n+1} =\\\\lim\\\\limits_{s\\\\to +\\\\infty}\\u000a[\\\\prod\\\\limits^n_{k=1} (1-\\\\frac{1}{p^s_k}) \\\\sum\\\\limits^\\\\infty_{j=1}\\u000a\\\\frac{1}{j^s} -1]^{-1\\/s}. $$ The upper limit on the sum can be replaced by\\u000a$2p_n -1$, and the result still holds.

Joseph B. Keller

2007-01-01

210

A recursive algorithm for Zernike polynomials  

NASA Technical Reports Server (NTRS)

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

Davenport, J. W.

1982-01-01

211

Recursive delay calculation unit for parametric beamformer  

NASA Astrophysics Data System (ADS)

This paper presents a recursive approach for parametric delay calculations for a beamformer. The suggested calculation procedure is capable of calculating the delays for any image line defined by an origin and arbitrary direction. It involves only add and shift operations making it suitable for hardware implementation. One delaycalculation unit (DCU) needs 4 parameters, and all operations can be implemented using fixed-point arithmetics. An N-channel system needs N+ 1 DCUs per line - one for the distance from the transmit origin to the image point and N for the distances from the image point to each of the receivers. Each DCU recursively calculates the square of the distance between a transducer element and a point on the beamformed line. Then it finds the approximate square root. The distance to point i is used as an initial guess for point i + 1. Using fixed-point calculations with 36-bit precision gives an error in the delay calculations on the order of 1/64 samples, at a sampling frequency of f s = 40 MHz. The circuit has been synthesized for a Virtex II Pro device speed grade 6 in two versions - a pipelined and a non-pipelined producing 150 and 30 million delays per second, respectively. The non-pipelined circuit occupies about 0.5 % of the FPGA resources and the pipelined one about 1 %. When the square root is found with a pipelined CORDIC processor, 2 % of the FPGA slices are used to deliver 150 million delays per second.

Nikolov, Svetoslav I.; Jensen, Jørgen A.; Tomov, Borislav

2006-03-01

212

Improvement in Recursive Hierarchical Segmentation of Data  

NASA Technical Reports Server (NTRS)

A further modification has been made in the algorithm and implementing software reported in Modified Recursive Hierarchical Segmentation of Data (GSC- 14681-1), NASA Tech Briefs, Vol. 30, No. 6 (June 2006), page 51. That software performs recursive hierarchical segmentation of data having spatial characteristics (e.g., spectral-image data). The output of a prior version of the software contained artifacts, including spurious segmentation-image regions bounded by processing-window edges. The modification for suppressing the artifacts, mentioned in the cited article, was addition of a subroutine that analyzes data in the vicinities of seams to find pairs of regions that tend to lie adjacent to each other on opposite sides of the seams. Within each such pair, pixels in one region that are more similar to pixels in the other region are reassigned to the other region. The present modification provides for a parameter ranging from 0 to 1 for controlling the relative priority of merges between spatially adjacent and spatially non-adjacent regions. At 1, spatially-adjacent-/spatially- non-adjacent-region merges have equal priority. At 0, only spatially-adjacent-region merges (no spectral clustering) are allowed. Between 0 and 1, spatially-adjacent- region merges have priority over spatially- non-adjacent ones.

Tilton, James C.

2006-01-01

213

Improved recursive formula for calculating shock response spectra  

Microsoft Academic Search

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 results in significant errors when the natural frequencies are greater than 1\\/6 the sample rate. It is shown that a ramp invariant simulation results in a recursive filter with one additional filter weight

D. O. Smallwood

1980-01-01

214

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

215

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

ERIC Educational Resources Information Center

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

Josephson, Marika

2011-01-01

216

Hierarchical and Recursive State Machines with Context-Dependent Properties  

Microsoft Academic Search

Hierarchical and recursive state machines are suitable abstract mod- els for many software systems. In this paper we extend a model recently in- troduced in literature, by allowing atomic propositions to label all the kinds of vertices and not only basic nodes. We call the obtained models context-dependent hierarchical\\/recursive state machines. We study on such models cycle detection, reachability and

Salvatore La Torre; Margherita Napoli; Mimmo Parente; Gennaro Parlato

2003-01-01

217

The Learning of Recursive Algorithms from a Psychogenetic Perspective  

Microsoft Academic Search

The ideas presented in this paper concern computer science education research within Jean Piaget's theory genetic epistemology. Re- sults from Piaget and collaborators investigations about the recursive reasoning on the series of natural numbers are extended to learn about entering students recursive reasoning on other inductively defined struc- tures. In this paper the main aspects of that extension are described

Sylvia da Rosa

218

Recursive Bayesian Levenberg-Marquardt Training of Recurrent Neural Networks  

Microsoft Academic Search

This paper develops a Bayesian approach to recursive second order training of recurrent neural networks. A general recursive Levenberg-Marquardt algorithm is elaborated using Bayesian regularization. Individual local regularization hyperparameters as well as an output noise hyper-parameter are reestimated in order to maximize the weight posterior distribution and to produce a well generalizing network model. The proposed algorithm performs a computationally

Derrick Takeshi Mirikitani; Nikolay Nikolaev

2007-01-01

219

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

220

Recursive speed and parameter estimation for induction machines  

Microsoft Academic Search

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

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

1989-01-01

221

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

222

Realization Of Algebraic Processor For XML Documents Processing  

NASA Astrophysics Data System (ADS)

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

Georgiev, Bozhidar; Georgieva, Adriana

2010-10-01

223

The SGML Standardization Framework and the Introduction of XML  

PubMed Central

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

Grutter, Rolf

2000-01-01

224

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

NASA Astrophysics Data System (ADS)

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

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

2013-02-01

225

Pushing Predicates into Recursive SQL Common Table Expressions  

NASA Astrophysics Data System (ADS)

A recursive SQL-1999 query consists of a recursive CTE (Common Table Expression) and a query which uses it. If such a recursive query is used in a context of a selection predicate, this predicate can possibly be pushed into the CTE thus limiting the breadth and/or depth of the recursive search. This can happen e.g. after the definition of a view containing recursive query has been expanded in place. In this paper we propose a method of pushing predicates and other query operators into a CTE. This allows executing the query with smaller temporary data structures, since query operators external w.r.t. the CTE can be computed on the fly together with the CTE. Our method is inspired on the deforestation (a.k.a. program fusion) successfully applied in functional programming languages.

Burza?ska, Marta; Stencel, Krzysztof; Wi?niewski, Piotr

226

Application of XML database technology to biological pathway datasets.  

PubMed

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

Jiang, Keyuan; Nash, Christopher

2006-01-01

227

Overview of the INEX 2008 XML Mining Track  

NASA Astrophysics Data System (ADS)

We describe here the XML Mining Track at INEX 2008. This track was launched for exploring two main ideas: first identifying key problems for mining semi-structured documents and new challenges of this emerging field and second studying and assessing the potential of machine learning techniques for dealing with generic Machine Learning (ML) tasks in the structured domain i.e. classification and clustering of semi structured documents. This year, the track focuses on the supervised classification and the unsupervised clustering of XML documents using link information. We consider a corpus of about 100,000 Wikipedia pages with the associated hyperlinks. The participants have developed models using the content information, the internal structure information of the XML documents and also the link information between documents.

Denoyer, Ludovic; Gallinari, Patrick

228

Recursive fuzzy c-means clustering for recursive fuzzy identification of time-varying processes.  

PubMed

In this paper we propose a new approach to on-line Takagi-Sugeno fuzzy model identification. It combines a recursive fuzzy c-means algorithm and recursive least squares. First the method is derived and than it is tested and compared on a benchmark problem of the Mackey-Glass time series with other established on-line identification methods. We showed that the developed algorithm gives a comparable degree of accuracy to other algorithms. The proposed algorithm can be used in a number of fields, including adaptive nonlinear control, model predictive control, fault detection, diagnostics and robotics. An example of identification based on a real data of the waste-water treatment process is also presented. PMID:21292263

Dovžan, Dejan; Skrjanc, Igor

2011-04-01

229

XML in an Adaptive Framework for Instrument Control  

NASA Technical Reports Server (NTRS)

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

Ames, Troy J.

2004-01-01

230

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

ERIC Educational Resources Information Center

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

Mitri, Michel

2012-01-01

231

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

232

Service-Centric Object Fragmentation for Efficient Retrieval and Management of Huge XML Documents  

Microsoft Academic Search

Vast amount of XML documents raise interests in how they will be used and how far their usage can be expanded. This paper has two central goals: 1) easy and fast retrieval of XML documents or relevant elements; and 2) efficient and stable management of large-size XML documents. The keys to develop such a practical system are how to segment

Chang-hoo Jeong; Yunsoo Choi; Du-seok Jin; Minho Lee; Sung-pil Choi; Kwang-young Kim; Min-hee Cho; Won-kyun Joo; Hwa-mook Yoon; Jeong-hyun Seo; Jinsuk Kim

2007-01-01

233

MARS: A System for Publishing XML from Mixed and Redundant Storage  

Microsoft Academic Search

We present a system for publishing as XML data from mixed (relational+XML) propri- etary storage, while supporting redundancy in storage for tuning purposes. The cor- respondence between public and proprietary schemas is given by a combination of LAV- and GAV-style views expressed in XQuery. XML and relational integrity constraints are also taken into consideration. Starting with client XQueries formulated against

Alin Deutsch; Val Tannen

2003-01-01

234

SEDA: a system for search, exploration, discovery, and analysis of XML Data  

Microsoft Academic Search

Keyword search in XML repositories is a powerful tool for interac- tive data exploration. Much work has recently been done on mak- ing XML search aware of relationship information embedded in XML document structure, but without a clear winner in all data and query scenarios. Furthermore, due to its imprecise nature, search results cannot easily be analyzed and summarized to

Andrey Balmin; Latha S. Colby; Emiran Curtmola; Quanzhong Li; Fatma Özcan; Sharath Srinivas; Zografoula Vagena

2008-01-01

235

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

ERIC Educational Resources Information Center

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

Davis-Tanous, Jennifer R.

236

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

237

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

238

Detecting recursive and nonrecursive filters using chaos.  

PubMed

Filtering a chaotic signal through a recursive [or infinite impulse response (IIR)] filter has been shown to increase the dimension of chaos under certain conditions. Filtering with a nonrecursive [or finite impulse response (FIR)] filter should not increase dimension, but it has been shown that if the FIR filter has a long tail, measurements of actual signals may appear to show a dimension increase. I simulate IIR and FIR filters that correspond to naturally occurring resonant objects, and I show that using dimension measurements, I can distinguish the filter type. These measurements could be used to detect resonances using radar, sonar, or laser signals, or to determine if a resonance is due to an IIR or an FIR filter. PMID:20370278

Carroll, T L

2010-03-01

239

Recursive nonlinear estimation for relative navigation in elliptical orbits  

NASA Astrophysics Data System (ADS)

Several nonlinear recursive suboptimal estimators are applied to the problem of determining the relative motion of one satellite with respect to another, both in close elliptical orbits. Only relative measurements of range, range rate and angles are used. The two-step filter, iterated extended Kalman filter, and a Kalman filter using a change of variables that makes the measurement equation linear are all derived from different approximations to the same global least squares cost function. The potential for the two-step estimator to generate numerically rank deficient covariance matrices is shown. A test matrix composed of the partial derivatives between the first and second step states and a set of constant vectors is derived to identify points in which this anomaly could occur. This rank deficiency can be interpreted geometrically in the first step state space. It is shown that the existence of low eigenvalues of this covariance matrix does correspond to situations in which the first step state vector has very low error in some direction in that state space. A simple example problem is used to demonstrate these findings. It is also shown that a two-step filter defined with an equal number of first and second step states is the same as a Kalman filter using a change of variables, except that a better approximation is made to the first step covariance time update. The dynamics and measurement equations are derived for the elliptical orbit relative navigation problem. Additionally, a closed form state transition matrix for the linearized equations of motion is derived and used to assess the magnitude of the linearization errors. The two-step filters applied to this problem produced a lower mean square error than the other filters under two situations. The first is when a large observation vector was used giving good observability of the state, but initialized with a large error. The second is for scalar observations and a statistically distributed set of initial errors.

Garrison, James Levi, Jr.

240

Recursive parametrization and invariant phases of unitary matrices  

SciTech Connect

We present further properties of a previously proposed recursive scheme for parametrization of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study the invariant phases of unitary matrices. The case of four-by-four unitary matrices is investigated in detail. We also address the question of how to construct symmetric unitary matrices (i.e., unitary matrices U that satisfy the condition U{sub ij}=U{sub ji}) using the recursive approach.

Jarlskog, C. [Division of Mathematical Physics, LTH, Lund University, Box 118, S-22100 Lund (Sweden)

2006-01-15

241

XML Web Services Automation: A Software Engineering Approach  

Microsoft Academic Search

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

Nicholas Nicoloudis; Christine Mingins

2002-01-01

242

Materialized views for P2P XML warehousing  

Microsoft Academic Search

We consider the efficient, scalable management of XML documents in structured peer-to-peer networks based on distributed hash table (DHT) indices. We present an approach for exploiting materialized views deployed in the DHT network independently by the peers, to answer an interesting dialect of tree pattern queries. We provide algorithms to index and materialize views in the DHT, show that the

Ioana Manolescu; Spyros Zoupanos; INRIA Saclay

2009-01-01

243

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

244

An XML-based communication protocol for accelerator distributed controls  

NASA Astrophysics Data System (ADS)

This paper presents the development of XMLvRPC, an RPC-like communication protocol based, for this particular application, on the TCP/IP and XML (eXtensible Markup Language) tools built-in in LabVIEW. XML is used to format commands and data passed between client and server while socket interface for communication uses either TCP or UDP transmission protocols. This implementation extends the features of these general purpose libraries and incorporates solutions that might provide, with limited modifications, full compatibility with well established and more general communication protocol, i.e. XML-RPC, while preserving portability to different platforms supported by LabVIEW. The XMLvRPC suite of software has been equipped with specific tools for its deployment in distributed control systems as, for instance, a quasi-automatic configuration and registration of the distributed components and a simple plug-and-play approach to the installation of new services. Key feature is the management of large binary arrays that allow coding of large binary data set, e.g. raw images, more efficiently with respect to the standard XML coding.

Catani, L.

2008-03-01

245

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

246

Identifying meaningful return information for XML keyword search  

Microsoft Academic Search

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

Ziyang Liu; Yi Chen

2007-01-01

247

Towards Smart Style: Combining RDF Semantics with XML Document Transformations.  

National Technical Information Service (NTIS)

The 'Document Web' has established itself through the creation of an impressive family of XML and related languages. In addition to this, the 'Semantic Web' is developing its own family of languages based primarily on RDF. Although these families were bot...

J. R. van Ossenbruggen L. Hardman L. W. Rutledge

2003-01-01

248

A dynamic warehouse for XML Data of the Web  

Microsoft Academic Search

Xyleme is a dynamic warehouse for XML data of the Web supporting query evaluation, change control and data integration. We briefly present our motivations, the general architecture and some aspects of Xyleme. The project we describe here was completed at the end of 2000. A prototype has been implemented. This prototype is now being turned into a product by a

Lucie Xyleme

2001-01-01

249

Cumulative Path Summary for Structurally Dynamic XML Documents  

Microsoft Academic Search

In XML filtering systems, if the structure is not known, user may input structurally invalid queries. The filtering system wastes its precious time in evaluating these invalid queries before it eventually finds that the queries are structurally invalid. In this paper we propose a technique to guide the user in formulating queries, which are more likely to succeed.

R. Gururaj; P. Sreenivasa Kumar

2006-01-01

250

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

251

XML Stream Processing Using a Lazy Concurrent Language  

Microsoft Academic Search

Motivated by previous work on XML stream processing, we no- ticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provides the pos- sibility of reducing space usage in many programs. With lower garbage-collection overhead resulting from concurrent execution, the elapsed time of programs, stream processing ones in particular, is tremendously decreased. The challenge is

Shin-cheng Mu; Ta-chung Tsai; Keisuke Nakano

2008-01-01

252

Management of XML Documents in an Integrated Digital Library  

Microsoft Academic Search

We describe a generalized toolset developed by the Perseus Project to manage XML documents in the context of a large, heterogeneous digital library. The system manages multiple DTDs through mappings from el- ements in the DTD to abstract document structures. The abstraction of document metadata, both structural and descriptive, facilitates the de- velopment of application-level tools for knowledge management and

David A. Smith; Anne Mahoney; A. Rydberg-Cox; Perseus Project

253

SAL: An Algebra for Semistructured Data and XML  

Microsoft Academic Search

This paper is a preliminary report on SAL, a Semistructured ALgebra. SAL is an algebraic querylanguage that we are designing to serve as a target language for translation from declarative user-orientedquery languages for XML. Like existing algebras, it can serve to provide a concise representation of queryexecution, that still leaves room for various decisions about actual execution plans, and supports

Catriel Beeri; Yariv Tzaban

1999-01-01

254

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

255

Three-Dimensional Recursive Filter Objective Analysis of Meteorological Fields,  

National Technical Information Service (NTIS)

Thiebaux and Pedder (1987) have categorized types of objective analysis used in the atmospheric sciences into three classes: surface fitting, empirical linear interpolation, and statistical objective analysis. The recursive filter method described here fa...

C. M. Hayden R. J. Purser

1988-01-01

256

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

257

Recursive encoding and decoding of the noiseless subsystem for qudits  

NASA Astrophysics Data System (ADS)

We give a full explanation of the noiseless subsystem that protects a single qubit against collective errors and the corresponding recursive scheme described by C.-K. Li et al. [Phys. Rev. A 84, 044301 (2011), 10.1103/PhysRevA.84.044301] from a representation theory point of view. Furthermore, we extend the construction to qudits under the influence of collective SU(d) errors. We find that under this recursive scheme, the asymptotic encoding rate is 1/d.

Güngördü, Utkan; Li, Chi-Kwong; Nakahara, Mikio; Poon, Yiu-Tung; Sze, Nung-Sing

2014-04-01

258

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

259

Conceptual models and cognitive learning styles in teaching recursion  

Microsoft Academic Search

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

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

1998-01-01

260

Recursive and flat partitioning for VLSI circuit design  

Microsoft Academic Search

Circuit partitioning is a subproblem of the physical design phase and considered to be a very important tool for circuit layout. Recent work of Cong and Lim (1998) suggests that multi-way bi-partitioning is more effective than hierarchical bi-partitioning based on a recursive scheme, in addition to the limitation of recursive multi-way partitioners to minimize absorption cost metrics but not hyper-edge

Shawki Areibi

2001-01-01

261

Efficient Routing and Broadcasting in Recursive Interconnection Networks  

Microsoft Academic Search

The WK-Recursive Network (WKRN) is a hierarchical interconnection network that is recursively defined and has excellent properties for scalable message-passing multicomputer systems. In this paper, we present efficient routing and broadcasting schemes in a WKRN. For efficient routing, we define the MP-graph between the source and destination nodes of the message. For efficient broadcasting, we define the EDHP-graph and the

Ronald Fernandes; Donald K. Friesen; Arkady Kanevsky

1994-01-01

262

Optimal Recursive Bidirection Prediction for Hyperspectral Image Compression  

Microsoft Academic Search

In this paper, we propose a new algorithm named Optimal Recursive Bidirection Prediction (ORBP) for HyperSpetral Image (HSI) compression. Recursive Bidirection Prediction (RBP) is a good algorithm for HSI inter-band prediction. It's simple, efficient. But the algorithm can't get optimal prediction result under the sense of SNR. In this paper, the linear model of HSI is established, and the best

Y S Chen; Y Zhang; J P Zhang; Y F Gu

2006-01-01

263

Stability and synthesis of two-dimensional recursive filters  

Microsoft Academic Search

Two-dimensional recursive filters are conveniently described in terms of two-dimensional z transforms. The designer of these filters faces two fundamental problems, their stability and their synthesis. Stability is determined by the location of the zero-valued region of the filter's denominator polynomial. A conjecture based on a one-dimensional stability theorem leads to a useful empirical stabilization procedure. Two-dimensional recursive filters can

JOHN L. SHANKS; SVEN TREITEL; JAMES H. JUSTICE

1972-01-01

264

State reduction of recursive median filters  

NASA Astrophysics Data System (ADS)

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

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

1999-03-01

265

New architectures for feedthrough SAW recursive devices.  

PubMed

This paper presents an analysis of a new type of feedthrough recursive surface acoustic wave (SAW) device. The device combines a conventional SAW structure with positive feedback in a way that allows use of selective properties of the SAW structure, control of the central frequency and bandwidth, achieving significantly higher quality factors for given dimensions of the structure, and reduction of the sidelobe level. Several possible implementations are discussed from a simple one that uses external circuitry to the most advanced that includes digital supervisory control. Equations are presented that relate the central frequency, bandwidth, and sidelobe level to the parameters of the SAW structure and feedback loop. The simulation results were found to be in good agreement with experimental data. These data show the control of the central frequency within 1%, a 10-fold increase in the quality factor compared to the original SAW structure, and a reduction of the side-lobe level by 20 dB irrespective of the influence of second order effects and random manufacturing fluctuations. PMID:15742568

Kalashnikov, Alexander N; Challis, Richard E

2005-01-01

266

Recursive stochastic effects in valley hybrid inflation  

NASA Astrophysics Data System (ADS)

Hybrid inflation is a two-field model where inflation ends because of a tachyonic instability, the duration of which is determined by stochastic effects and has important observational implications. Making use of the recursive approach to the stochastic formalism presented in [L. P. Levasseur, preceding article, Phys. Rev. D 88, 083537 (2013)], these effects are consistently computed. Through an analysis of backreaction, this method is shown to converge in the valley but points toward an (expected) instability in the waterfall. It is further shown that the quasistationarity of the auxiliary field distribution breaks down in the case of a short-lived waterfall. We find that the typical dispersion of the waterfall field at the critical point is then diminished, thus increasing the duration of the waterfall phase and jeopardizing the possibility of a short transition. Finally, we find that stochastic effects worsen the blue tilt of the curvature perturbations by an O(1) factor when compared with the usual slow-roll contribution.

Levasseur, Laurence Perreault; Vennin, Vincent; Brandenberger, Robert

2013-10-01

267

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

NASA Technical Reports Server (NTRS)

This paper will present the current concept using extensible Markup Language (XML) as the underlying structure for the James Webb Space Telescope (JWST) database. The purpose of using XML is to provide a JWST database, independent of any portion of the ground system, yet still compatible with the various systems using a variety of different structures. The testing of the JWST Flight Software (FSW) started in 2002, yet the launch is scheduled for 2011 with a planned 5-year mission and a 5-year follow on option. The initial database and ground system elements, including the commands, telemetry, and ground system tools will be used for 19 years, plus post mission activities. During the Integration and Test (I&T) phases of the JWST development, 24 distinct laboratories, each geographically dispersed, will have local database tools with an XML database. Each of these laboratories database tools will be used for the exporting and importing of data both locally and to a central database system, inputting data to the database certification process, and providing various reports. A centralized certified database repository will be maintained by the Space Telescope Science Institute (STScI), in Baltimore, Maryland, USA. One of the challenges for the database is to be flexible enough to allow for the upgrade, addition or changing of individual items without effecting the entire ground system. Also, using XML should allow for the altering of the import and export formats needed by the various elements, tracking the verification/validation of each database item, allow many organizations to provide database inputs, and the merging of the many existing database processes into one central database structure throughout the JWST program. Many National Aeronautics and Space Administration (NASA) projects have attempted to take advantage of open source and commercial technology. Often this causes a greater reliance on the use of Commercial-Off-The-Shelf (COTS), which is often limiting. In our review of the database requirements and the COTS software available, only very expensive COTS software will meet 90% of requirements. Even with the high projected initial cost of COTS, the development and support for custom code over the 19-year mission period was forecasted to be higher than the total licensing costs. A group did look at reusing existing database tools and formats. If the JWST database was already in a mature state, the reuse made sense, but with the database still needing to handing the addition of different types of command and telemetry structures, defining new spacecraft systems, accept input and export to systems which has not been defined yet, XML provided the flexibility desired. It remains to be determined whether the XML database will reduce the over all cost for the JWST mission.

Detter, Ryan; Mooney, Michael; Fatig, Curtis

2003-01-01

268

Experiments with recursive estimation in astronomical image processing  

NASA Technical Reports Server (NTRS)

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

Busko, I.

1992-01-01

269

Bioinformatics data distribution and integration via Web Services and XML.  

PubMed

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

Li, Xiao; Zhang, Yizheng

2003-11-01

270

XML schemas and mark-up practices of taxonomic literature  

PubMed Central

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

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

2011-01-01

271

XML-based product information processing method for product design  

NASA Astrophysics Data System (ADS)

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

Zhang, Zhen Yu

2011-12-01

272

On Ecient Part-match Querying of XML Data ? Michal Kratky, Marek Andrt Department of Computer Science, V? SB - Technical University of Ostrava  

Microsoft Academic Search

The XML language have been becoming de-facto a standard for representation of heterogeneous data in the Internet. From database point of view, XML is a new approach to data modelling. Implementation of a system enabling us to store and query XML documents eciently (so called native XML databases) require a development of new tech- niques. The most of XML query

273

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

274

SOFTWARE ADAPTIVITY THROUGH XML-BASED BUSINESS RULES AND AGENTS  

Microsoft Academic Search

XML Key Results: The combination of agent and business rule provides adaptivity in software systems. Business rules capture requirements and are made executable by agents. Through three developed editors, rules can be changed on demand very easily. Up-to-date requirements are implemented immediately by agents, without the need for frequent system rebuilds. How does the work advance the state-of-the-art? The work

L Xiao; D Greer

275

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

NASA Technical Reports Server (NTRS)

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

Rice, Kevin; Kizzort, Brad

2008-01-01

276

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

277

A Method for Extracting Keywords from XML Documents by Using DTD  

NASA Astrophysics Data System (ADS)

Since computerized documents, e.g. XML documents, have been increased, it is desired to find particular information from a huge amount of XML documents. This paper proposes an automatic method for extracting keywords from the valid XML documents. Structured elements of an XML document are defined by DTD. We consider that a certain element of the structure represents importance for the document. First, the importance of an element is determined by the definition in DTD. For example, elements that cannot be omitted and elements that appear only once at the maximum in their parent elements are considered important ones. Second, all elements in the target XML document are scored by the tree structure of elements and contained texts in the document. Third, candidates of the keywords are extracted from elements with the scores. Finally, scores are summed up and candidates ranked higher are selected as keywords of the XML document. The validity of this method is examined.

Asabuki, Taku; Nagata, Morio

278

A Relational Nested Interval Encoding Scheme for XML Storage and Retrieval  

Microsoft Academic Search

\\u000a The XML data is a typical kind of tree-data. However, the XML research community has given little attention to the traditional\\u000a Relational database Management System(RDBMS) based encoding schemes for tree-data. In this paper, we will investigate one\\u000a of the traditional RDBMS-based encoding schemes, called Nested Interval, for storage and retrieval of XML data. Especially,\\u000a our approach is very robust for

Gap-joo Na; Sang-won Lee

2005-01-01

279

Constructing and Querying Peer-to-Peer Warehouses of XML Resources  

Microsoft Academic Search

We present KadoP, a distributed infrastructure for ware- housing XML resources in a peer-to-peer framework. KadoP allows users to build a shared, distributed repository of resources such as XML doc- uments, semantic information about such documents, Web services, and collections of such items. KadoP2P builds on distributed hash tables as a peer communication layer, and ActiveXML as a model for

Serge Abiteboul; Ioana Manolescu; Nicoleta Preda

2005-01-01

280

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

281

ERX-QL: Querying an Entity-Relationship DB to Obtain XML Documents  

Microsoft Academic Search

Perspective scenarios of e-commerce applications, in particular B2B applications, based on the exchange of XML documents open\\u000a new research issues in the field of information systems and XML data management. In fact, information systems will have to\\u000a generate XML documents, obtained by querying the underlying DBMS.\\u000a \\u000a This paper informally introduces the ERX-Query Language (ERX-QL), under development as part of ERX

Giuseppe Psaila; Viale Marconi

2001-01-01

282

Topological analysis of multibody systems for recursive dynamics formulations  

SciTech Connect

Graph theory is used to characterize the topology of multibody systems for high speed parallel computer dynamic simulation. Decoupled loops are defined for use in the recursive dynamics formulations, wherein Lagrange multipliers can be eliminated concurrently within each decoupled loop. A row-scanning process for the non-directed adjacency matrix of a graph is described, to generate an identification array that facilitates compact storage and defines system connectivities. A decision tree search algorithm is employed to generate all spanning trees associated with a closed loop graph. For each spanning tree generated from the decision tree search algorithm, a precedence array is defined. A path matrix for the spanning tree and an outdegree of junction nodes are defined to assist in parallel implementation of recursive dynamics algorithms and are then constructed from the precedence array. An optimal tree search algorithm that identifies a spanning tree that leads to best solution sequences for parallel implementation of recursive dynamics formulations is presented.

Hwang, R.S.; Haug, E.J. (Center for Simulation and Design Optimization and Dept. of Mechanical Engineering, The Univ. of Iowa, Iowa City, IA (US))

1989-01-01

283

Recursive flexible multibody system dynamics using spatial operators  

NASA Technical Reports Server (NTRS)

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

Jain, A.; Rodriguez, G.

1992-01-01

284

Theory and applications of sampled analog recursive CTD comb filters  

NASA Technical Reports Server (NTRS)

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

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

1976-01-01

285

Well-poised generation of Apery-like recursions  

NASA Astrophysics Data System (ADS)

The idea to use classical hypergeometric series and, in particular, well-poised hypergeometric series in diophantine problems of the values of the polylogarithms has led to several novelties in number theory and neighbouring areas of mathematics. Here, we present a systematic approach to derive second-order polynomial recursions for approximations to some values of the Lerch zeta function, depending on the fixed (but not necessarily real) parameter [alpha] satisfying the condition Re([alpha]). Substituting [alpha]=0 into the resulting recurrence equations produces the famous recursions for rational approximations to [zeta](2), [zeta](3) due to Apery, as well as the known recursion for rational approximations to [zeta](4). Multiple integral representations for solutions of the constructed recurrences are also given.

Zudilin, Wadim

2005-06-01

286

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

NASA Astrophysics Data System (ADS)

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

Fong, Joseph; Cheung, San Kuen

287

A decoupled recursive approach for constrained flexible multibody system dynamics  

NASA Technical Reports Server (NTRS)

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

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

1989-01-01

288

Recursive dynamics algorithm for multibody systems with prescribed motion  

NASA Technical Reports Server (NTRS)

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 systems. Changes to the prescribed/nonprescribed nature of hinges can be implemented during run time since they are handled with very low overhead in the algorithm.

Jain, Abhinandan; Rodriguez, Guillermo

1993-01-01

289

Recursive dynamics algorithm for multibody systems with prescribed motion  

NASA Astrophysics Data System (ADS)

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 systems. Changes to the prescribed/nonprescribed nature of hinges can be implemented during run time since they are handled with very low overhead in the algorithm.

Jain, Abhinandan; Rodriguez, Guillermo

1993-10-01

290

Detection of small target using recursive higher order statistics  

NASA Astrophysics Data System (ADS)

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

Hou, Wang; Sun, Hongyuan; Lei, Zhihui

2014-02-01

291

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

292

Recursive Frequency Offset Estimation for MIMO System in Flat-Fading Channels  

NASA Astrophysics Data System (ADS)

This letter presents recursive frequency offset estimation for MIMO (Multiple Input Multiple Output) system in flat-fading channels. With the recursive estimation, the frequency offset range in MIMO system can be extended compared with normal estimation. Simulation results show that the recursive frequency offset estimation is valid for large frequency offset.

Chen, Xiaoxu; Liu, Tao; Gong, Yaohuan

293

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

294

An XML-Based Protocol for Distributed Event Services  

NASA Technical Reports Server (NTRS)

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

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

2001-01-01

295

Research on Heterogeneous Data Exchange based on XML  

NASA Astrophysics Data System (ADS)

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

Li, Huanqin; Liu, Jinfeng

296

Recursive partial least squares algorithms for monitoring complex industrial processes  

Microsoft Academic Search

The monitoring of processes that exhibit non-stationary and\\/or time varying behaviour is discussed in this paper. It is shown that the application of recursive partial least squares (RPLS) algorithms together with adaptive confidence limits can lead to a considerable reduction in the number of false alarms. The integration of these algorithms into the multivariate statistical process control (MSPC) framework is

Xun Wang; Uwe Kruger; Barry Lennox

2003-01-01

297

Optimum digital recursive filters for step scan phased array radars  

Microsoft Academic Search

A design method for recursive filters with optimum clutter rejection is presented. The designed filters are suitable for MTI (moving target indication) systems in step scan phased array radars. The designed filters are optimized for a given clutter power spectrum and a finite number of samples without initialization. The performance of the designed filters was studied by considering their clutter

Hussian Al-Ahmad; Gordon B. Lockhart

1991-01-01

298

A Novel Recursive Algorithm for Area Location Using Isothetic Polygons  

Microsoft Academic Search

In this paper, a novel recursive algorithm is presented for binary image area location. The result of an image segmentation task is usually a set of connected components that belong to certain categories, such as texts, images, fines, etc. A challenging task is to restrict all connected components inside simple geometric shapes. For this purpose, isothetic polygons with minimum number

Basilios Gatos; S. I. Mantazaris

2000-01-01

299

Recursive 3-D motion estimation from a monocular image sequence  

Microsoft Academic Search

Consideration is given to the design and application of a recursive algorithm to a sequence of images of a moving object to estimate both its structure and kinematics. The object is assumed to be rigid, and its motion is assumed to be smooth in the sense that it can be modeled by retaining an arbitrary number of terms in the

T. J. Broida; S. Chandrashekhar; R. Chellappa

1990-01-01

300

Efficient Reinforcement Learning Using Recursive Least-Squares Methods  

Microsoft Academic Search

The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is mainly due to its fast convergence speed, which is considered to be optimal in practice. In this paper, RLS methods are used to solve reinforcement learning problems, where two new reinforcement learning algorithms using linear value

Xin Xu; Han-gen He; Dewen Hu

2002-01-01

301

A Comparison between Recursive Neural Networks and Graph Neural Networks  

Microsoft Academic Search

Recursive Neural Networks (RNNs) and Graph Neural Networks (GNNs) are two connectionist models that can directly process graphs. RNNs and GNNs exploit a similar processing framework, but they can be applied to different input domains. RNNs require the input graphs to be directed and acyclic, whereas GNNs can process any kind of graphs. The aim of this paper consists in

Vincenzo Di Massa; Gabriele Monfardini; Lorenzo Sarti; Franco Scarselli; Marco Maggini; Marco Gori

2006-01-01

302

Chasing trends: recursive moving average trading rules and internet stocks  

Microsoft Academic Search

The recent rise and fall of Internet stock prices has led to popular impressions of a speculative bubble in the Internet sector. We investigate whether investors could have exploited the momentum in Internet stocks using simple moving average (MA) trading rules. We simulate real time technical trading using a recursive trading strategy applied to over 800 moving average rules. Statistical

Wai Mun Fong; Lawrence H. M. Yong

2005-01-01

303

Recursive inversion of externally defined linear systems by FIR filters  

NASA Technical Reports Server (NTRS)

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

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

1989-01-01

304

Recursive Inversion By Finite-Impulse-Response Filters  

NASA Technical Reports Server (NTRS)

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

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

1991-01-01

305

Non-uniform Recursion: The solution (minimal sorting for fold)  

Microsoft Academic Search

A central data structure in functional programming languages like ML or Haskell are algebraic data types. I argue in this paper that the natural program structure to deal with algebraic data types is not yet provided either in Haskell or in ML. One might think that that pattern matching together with general recursion is the natural program structure to deal

Martin Wehr

2000-01-01

306

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

307

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

308

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

309

Analysis of Recursive Algorithms By the Contraction Method  

Microsoft Academic Search

Several examples of the asymptotic analysis of recursive algorithmsare investigated by the contraction method. The examples concernrandom permutations and binary search trees. In these examples it isdemonstrated that the contraction method can be applied successfully toproblems with contraction constants converging to one and with nonregularnormalizations as logarithmic normalizations, which are typical in searchtype algorithms. An advantage of this approach is

M. Cramer; L. Rüschendorf

1996-01-01

310

Toward a connectionist model of recursion in human linguistic performance  

Microsoft Academic Search

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

Morten H. Christiansen; Nick Chater

1999-01-01

311

Recursive LLR Combining in Iterative Multiuser Decoding of Coded CDMA  

Microsoft Academic Search

Due to the prohibitive complexity of optimal mul- tiuser detection, suboptimal structures are commonly suggested for use in iterative multiuser decoders. The use of suboptimal components in the iterative structure leads to performance losses in terms of system load, bit error rate (BER), and convergence speed. In this paper, we introduce a simple recursive filtering structure into the iterative multiuser

Rob Milner; Lars K. Rasmussen; Fredrik Brannstr

2007-01-01

312

Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars  

Microsoft Academic Search

An insertion grammar is based on pure rules of the form uv ? uxv (the string x is inserted in the context (u, v)). A strict subfamily of the context-sensitive family is obtained, incomparable with the family of linear languages. We prove here that each recursively enumerable language can be written as the weak coding of the image by an

Carlos Martín-vide; Gheorghe Paun; Arto Salomaa

1998-01-01

313

Recursive Partitioning Analysis of Lifetime Suicidal Behaviors in Asian Americans  

Microsoft Academic Search

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

Yusuke Kuroki; Jacqueline L. Tilley

2012-01-01

314

Hierarchical WK-Recursive Topologies for Multicomputer Systems  

Microsoft Academic Search

We present two Hierarchical networks that use the WKR network as a basic module. The new net works retain the recursive structure of the WKR net work, at the same time have reduced diameter. Various properties of the new networks are discussed and are compared with those of other hierarchical networks.

Ronald Fernandes; Arkady Kanevsky

1993-01-01

315

Recursive quadrature mirror filters--Criteria specification and design method  

Microsoft Academic Search

Criteria are found for a pair of recursive infinite impluse response (IIR) filters which have mirror image amplitude responses and whose outputs are in phase quadrature at all frequencies. A method is suggested for designing filters with these characteristics, and their performance and processing requirements are compared with a typical nonrecursive finite impluse response (FIR) realization. A particular filter is

P. Millar

1985-01-01

316

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

317

Recursive flow based structure from parallax with automatic rescaling  

Microsoft Academic Search

In this paper we propose a technique to recursively estimate structure and motion from a sequence of images acquired by an hand held camera. The algorithm is based on estimation of instantaneous optical flo w for each frame of the sequence and on the use of the differential epipolar constraint to com- pute motion and structure. An alternative procedure to

Marco Zucchelli; Henrik I. Christensen

2001-01-01

318

Dynamically Ordered Semi-Naive Evaluation of Recursive Queries  

Microsoft Academic Search

Conventional fixed point evaluation techniques evaluate recursions by applying all rules repeatedly using an initial set of tuples (i.e., a given extensional database instance) until no new tuples are generated, but there is no specific order in which rules are applied. We can speed up the evaluation by applying rules in an appropriate order. In this paper, we propose a

Ki-hyung Hong; Yoon-joon Lee; Kyu-young Whang

1997-01-01

319

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

320

A recursive interpolation algorithm for particle tracking velocimetry  

Microsoft Academic Search

A new type of interpolation algorithm for particle tracking velocimetry is proposed. The algorithm is established based on a combination of ellipsoidal differential equations, i.e. a recursive process from a lower to a higher order interpolation. Each equation is solved as a boundary value problem by using the discrete velocity vector information as boundary conditions. In this paper the performance

Takehiro Ido; Yuichi Murai

2006-01-01

321

A recursive Bayesian beamforming for steering vector uncertainties  

NASA Astrophysics Data System (ADS)

A recursive Bayesian approach to narrowband beamforming for an uncertain steering vector of interest signal is presented. In this paper, the interference-plus-noise covariance matrix and signal power are assumed to be known. The steering vector is modeled as a complex Gaussian random vector that characterizes the level of steering vector uncertainty. Applying the Bayesian model, a recursive algorithm for minimum mean square error (MMSE) estimation is developed. It can be viewed as a mixture of conditional MMSE estimates weighted by the posterior probability density function of the random steering vector given the observed data. The proposed recursive Bayesian beamformer can make use of the information about the steering vector brought by all the observed data until the current short-term integration window and can estimate the mean and covariance of the steering vector recursively. Numerical simulations show that the proposed beamformer with the known signal power and interference-plus-noise covariance matrix outperforms the linearly constrained minimum variance, subspace projection, and other three Bayesian beamformers. After convergence, it has similar performance to the optimal Max-SINR beamformer with the true steering vector.

Han, Yubing; Zhang, Dongqing

2013-12-01

322

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

323

Email Updates  

MedlinePLUS

... Health Topics Drugs & Supplements Videos & Cool Tools ESPAÑOL Email Updates To use the sharing features on this ... view your email history or unsubscribe. Prevent MedlinePlus emails from being marked as "spam" or "junk" To ...

324

Leadership Update  

Cancer.gov

Letter from the Director The NCI's Clinical Proteomic Technology for Cancer Initiative (CPTC) has been actively overcoming the technological barriers to advance the science of proteomics. 1 Print This Page Leadership UpdateRSS News and Events

325

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

326

WaterML: an XML Language for Communicating Water Observations Data  

Microsoft Academic Search

One of the great impediments to the synthesis of water information is the plethora of formats used to publish such data. Each water agency uses its own approach. XML (eXtended Markup Languages) are generalizations of Hypertext Markup Language to communicate specific kinds of information via the internet. WaterML is an XML language for water observations data - streamflow, water quality,

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

2007-01-01

327

Visual exploration and retrieval of XML document collections with the generic system X2  

Microsoft Academic Search

This article reports on the XML retrieval system X2 which has been developed at the University of Munich over the last five years. In a typical session with X 2, the user first browses a structural summary of the XML database in order to select interesting elements and keywords occurring in documents. Using this intermediate result, queries com- bining structure

Holger Meuss; Klaus U. Schulz; Felix Weigel; Simone Leonardi; François Bry

2005-01-01

328

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

329

XML and Knowledge Technologies for Semantic-Based Indexing of Paper Documents  

Microsoft Academic Search

Effective daily processing of large amounts of paper documents in office environments requires the application of semantic-based indexing techniques during the transformation of paper documents to electronic format. For this purpose a combination of both XML and knowledge technologies can be used. XML distinguishes between data, its structure and semantics, allowing the exchange of data elements that carry descriptions of

Donato Malerba; Michelangelo Ceci; Margherita Berardi

2003-01-01

330

Ix-cubes: iceberg cubes for data warehousing and olap on xml data  

Microsoft Academic Search

With increasing amount of data being stored in XML for- mat, OLAP queries over these data become important. OLAP queries have been well studied in the relational database sys- tems. However, the evaluation of OLAP queries over XML data is not a trivial extension of the relational solutions, especially when a schema is not available. In this paper, we introduce

Fianny Ming-fei Jiang; Jian Pei; Ada Wai-chee Fu

2007-01-01

331

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

National Technical Information Service (NTIS)

The James Webb Space Telescope (JWST) Project has been defining, developing, and exercising the use of a common eXtensible Markup Language (XML) for the command and telemetry (C&T) database structure. JWST is the first large NASA space mission to use XML ...

J. Gal-Edd C. C. Fatig

2005-01-01

332

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

National Technical Information Service (NTIS)

This paper will present the current concept using extensible Markup Language (XML) as the underlying structure for the James Webb Space Telescope (JWST) database. The purpose of using XML is to provide a JWST database, independent of any portion of the gr...

R. Detter M. Mooney C. C. Fatig

2004-01-01

333

Efficient Dynamic Indexing and Retrieval of XML Documents using Three Dimensional Quasi-BitCube  

Microsoft Academic Search

XML is a new standard for exchanging and representing data on the Internet. Techniques for indexing and retrieval of XML data is drawing increasing attention since they enable one to access certain parts of retrieved documents easily. However, they provide little or no support for adding new documents to an existing document collection, requiring instead that the entire collection be

Biren Shah; Abhilash Gummadi; Jong P. Yoon; Vijay Raghavan

334

An Ontology-Based HTML to XML Conversion Using Intelligent Agents  

Microsoft Academic Search

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

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

2002-01-01

335

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

336

Virtual DOM: An Efficient Virtual Memory Representation for Large XML Documents  

Microsoft Academic Search

Standardized main memory representation methods (DOM) are quite inadequate to represent large XML documents, both in terms of space (necessary amount of memory) and, consequently, in time: it easily happens that it is not possible to load large XML documents in main memory. In this paper, we present virtual DOM, a Java package that provides an efficient representation technique for

Giuseppe Psaila; Viale Marconi

2008-01-01

337

On the Problem of Coupling Java Algorithms and XML Parsers (Invited Paper)  

Microsoft Academic Search

The joint use of Java and XML is a matter of fact for new developments, even in hard contexts. A recent research area is trying to address how to improve techniques for coupling Java programs and XML parsers and API. This paper briefly show the current state of the art of this young research area. Two perspectives are considered: efficiency

Giuseppe Psaila; Viale Marconi

2006-01-01

338

Integrating Schema-specific Native XML Repositories into a RDF-based E-Learning P2P Network  

Microsoft Academic Search

As its name implies, a native XML repository supports storage and management of XML in the original hierarchical form rather than in some other representations. In this paper we present our approach for integrating native XML repositories into Edutella, a RDF-based E-learning P2P network, through mapping native XML database schemas onto the Edutella Common Data Model (ECDM) and further translating

Changtao Qu; Wolfgang Nejdl

2002-01-01

339

Recursion method for deriving an energy-independent effective interaction  

NASA Astrophysics Data System (ADS)

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

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

2014-04-01

340

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

PubMed

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

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

2001-01-01

341

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

Microsoft Academic Search

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

Roberto Di Cosmo; Delia Kesner

1993-01-01

342

Creating preservation metadata from XML-metadata profiles  

NASA Astrophysics Data System (ADS)

Registration of dataset DOIs at DataCite makes research data citable and comes with the obligation to keep data accessible in the future. In addition, many universities and research institutions measure data that is unique and not repeatable like the data produced by an observational network and they want to keep these data for future generations. In consequence, such data should be ingested in preservation systems, that automatically care for file format changes. Open source preservation software that is developed along the definitions of the ISO OAIS reference model is available but during ingest of data and metadata there are still problems to be solved. File format validation is difficult, because format validators are not only remarkably slow - due to variety in file formats different validators return conflicting identification profiles for identical data. These conflicts are hard to resolve. Preservation systems have a deficit in the support of custom metadata. Furthermore, data producers are sometimes not aware that quality metadata is a key issue for the re-use of data. In the project EWIG an university institute and a research institute work together with Zuse-Institute Berlin, that is acting as an infrastructure facility, to generate exemplary workflows for research data into OAIS compliant archives with emphasis on the geosciences. The Institute for Meteorology provides timeseries data from an urban monitoring network whereas GFZ Potsdam delivers file based data from research projects. To identify problems in existing preservation workflows the technical work is complemented by interviews with data practitioners. Policies for handling data and metadata are developed. Furthermore, university teaching material is created to raise the future scientists awareness of research data management. As a testbed for ingest workflows the digital preservation system Archivematica [1] is used. During the ingest process metadata is generated that is compliant to the Metadata Encoding and Transmission Standard (METS). To find datasets in future portals and to make use of this data in own scientific work, proper selection of discovery metadata and application metadata is very important. Some XML-metadata profiles are not suitable for preservation, because version changes are very fast and make it nearly impossible to automate the migration. For other XML-metadata profiles schema definitions are changed after publication of the profile or the schema definitions become inaccessible, which might cause problems during validation of the metadata inside the preservation system [2]. Some metadata profiles are not used widely enough and might not even exist in the future. Eventually, discovery and application metadata have to be embedded into the mdWrap-subtree of the METS-XML. [1] http://www.archivematica.org [2] http://dx.doi.org/10.2218/ijdc.v7i1.215

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

2014-05-01

343

Recursive utility in a Markov environment with stochastic growth.  

PubMed

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

Hansen, Lars Peter; Scheinkman, José A

2012-07-24

344

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

345

ROOM: A recursive object oriented method for information systems development  

SciTech Connect

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

Thelliez, T.; Donahue, S.

1994-02-09

346

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)] [University of California, Lawrence Livermore National Laboratory, P.O. Box 808, L-156 Livermore, California 94551 (United States)

1999-06-01

347

One loop integration with hypergeometric series by using recursion relations  

NASA Astrophysics Data System (ADS)

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

Watanabe, Norihisa; Kaneko, Toshiaki

2014-06-01

348

Optimal Recursive Bidirection Prediction for Hyperspectral Image Compression  

NASA Astrophysics Data System (ADS)

In this paper, we propose a new algorithm named Optimal Recursive Bidirection Prediction (ORBP) for HyperSpetral Image (HSI) compression. Recursive Bidirection Prediction (RBP) is a good algorithm for HSI inter-band prediction. It's simple, efficient. But the algorithm can't get optimal prediction result under the sense of SNR. In this paper, the linear model of HSI is established, and the best prediction is deduced under the sense of SNR. The proposed method can get lower entropy after prediction. Computer simulation results show that compared with the traditional algorithm RBP, the proposed method ORBP has a great improvement by about 9.2738dB in SNR in average.

Chen, Y. S.; Zhang, Y.; Zhang, J. P.; Gu, Y. F.

2006-10-01

349

Random Numbers and an Incomplete Immune Recursive Set  

Microsoft Academic Search

Generalizing the notion of a recursively enumerable (r.e.) set to sets of real numbers and other metric spaces is an important\\u000a topic in computable analysis (which is the Turing machine based theory of computable real number functions). A closed subset\\u000a of a computable metric space is called r. e. closed, if all open rational balls which intersect the set can

Vasco Brattka

2002-01-01

350

The recursive pyramid algorithm for the discrete wavelet transform  

Microsoft Academic Search

The recursive pyramid algorithm (RPA) is a reformulation of the classical pyramid algorithm (PA) for computing the discrete wavelet transform (DWT). The RPA computes the N-point DWT in real time (running DWT) using just L(log N-1) words of storage, as compared with O(N) words required by the PA. L is the length of the wavelet filter. The RPA is combined

Mohan Vishwanath

1994-01-01

351

Model Checking Recursive Programs with Numeric Data Types  

Microsoft Academic Search

\\u000a Pushdown systems (PDS) naturally model sequential recursive programs. Numeric data types also often arise in real-world programs.\\u000a We study the extension of PDS with unbounded counters, which naturally model numeric data types. Although this extension is\\u000a Turing-powerful, reachability is known to be decidable when the number of reversals between incrementing and decrementing\\u000a modes is bounded. In this paper, we (1)

Matthew Hague; Anthony Widjaja Lin

352

A fast recursive algorithm for molecular dynamics simulation  

NASA Technical Reports Server (NTRS)

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

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

1993-01-01

353

Scattering amplitudes and BCFW recursion in twistor space  

Microsoft Academic Search

Twistor ideas have led to a number of recent advances in our understanding of scattering amplitudes. Much of this work has\\u000a been indirect, determining the twistor space support of scattering amplitudes by examining the amplitudes in momentum space.\\u000a In this paper, we construct the actual twistor scattering amplitudes themselves. We show that the recursion relations of Britto,\\u000a Cachazo, Feng and

Lionel Mason; David Skinner

2010-01-01

354

Recursive Robot-Arm Dynamics via Filtering and Smoothing  

NASA Technical Reports Server (NTRS)

Forward and inverse dynamics solved using Kalman filtering and Bryson-Frazier smoothing. Dynamics of serial-link robot arm solved by using recursive techniques from linear filtering and smoothing theory. Solutions of dynamical equations give forces, moments, and accelerations at joints between links, and multilink inertia matrix and its inverse. Theoretical developments lay foundation for use of filtering and smoothing techniques in design of robot controls.

Rodriguez, Guillermo

1987-01-01

355

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

356

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

357

P-recursive sequence and key-dependent multimedia scrambling  

NASA Astrophysics Data System (ADS)

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

Zhou, Yicong; Panetta, Karen; Agaian, Sos

2008-05-01

358

An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems  

SciTech Connect

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

Seal, Sudip K [ORNL] [ORNL

2014-01-01

359

Integration Update.  

ERIC Educational Resources Information Center

In this update of the integration efforts of the Riverside Unified School District, it is shown that the district continues to be committed to the integration of the staff. It is also committed to search for minority heritage staff. Along with staffing changes, there have been major program developments such as finding and using ethnic oriented…

Berry, Ray

360

UPDATE SCIENTIFIC  

Microsoft Academic Search

Reducing diabetic morbidity and mortality remains a major challenge in the management of diabetes. The achievement of optimal glycemic control in both type 1 and type 2 diabetes is often limited by difficulties associated with insulin replacement. This issue of Endocrinology Scientific Update reports on current treatment options for treating diabetes including intensive insu- lin therapy with newer insulin analogues

David Owens; Geremia Bolli; Julio Rosenstock; Derek LeRoith; Greet Van den Berghe; Nancy JMV Bohannon; Philip Levy; Ramachandiran Cooppan

361

Telematics Update  

NSDL National Science Digital Library

Telematics Update summarizes recent news coverage related to telematics and posts summaries of research reports that are available to purchase. Through this site, visitors can also access Telematics Magazine after registering for free, read about upcoming conferences and events, and read press releases in the telematics industry. Be sure to sign up for the free electronic newsletter as well.

2008-02-06

362

Status Update  

ERIC Educational Resources Information Center

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

Hernandez, Arelis

2010-01-01

363

Developing a relational XML schema for sharing HIV clinical data.  

PubMed

Access to multi-site clinical data regarding treatment and outcomes of HIV-infected patients in routine care is required to support clinical research to improve the treatment of HIV. As part of the NIAID-funded CFAR Network of Integrated Clinical Systems (CNICS), we have developed a relational XML Schema to extend the existing observational research repository and to integrate real-time clinical information from electronic medical records (EMRs) at six Centers for AIDS Research (CFAR) into the repository. The schema will aid the expansion of the research repository beyond the initial sites, and the development process may facilitate the use of multi-site repositories to study other chronic diseases. PMID:16779230

Drozd, D R; Lober, W B; Kitahata, M M; Smith, K I; Van Rompaey, S E

2005-01-01

364

Managing and Querying Image Annotation and Markup in XML  

PubMed Central

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

365

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

366

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

SciTech Connect

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

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

2011-11-01

367

Using XML technology for the ontology-based semantic integration of life science databases.  

PubMed

Several hundred internet accessible life science databases with constantly growing contents and varying areas of specialization are publicly available via the internet. Database integration, consequently, is a fundamental prerequisite to be able to answer complex biological questions. Due to the presence of syntactic, schematic, and semantic heterogeneities, large scale database integration at present takes considerable efforts. As there is a growing apprehension of extensible markup language (XML) as a means for data exchange in the life sciences, this article focuses on the impact of XML technology on database integration in this area. In detail, a general architecture for ontology-driven data integration based on XML technology is introduced, which overcomes some of the traditional problems in this area. As a proof of concept, a prototypical implementation of this architecture based on a native XML database and an expert system shell is described for the realization of a real world integration scenario. PMID:15217260

Philippi, Stephan; Köhler, Jacob

2004-06-01

368

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

NASA Technical Reports Server (NTRS)

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

Some, Raphael R.; Weisbin, Charles

2004-01-01

369

A Tool Kit for Implementing XML Schema Naming and Design Rules  

SciTech Connect

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

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

2005-11-01

370

Efficient training of neural nets for nonlinear adaptive filtering using a recursive Levenberg-Marquardt algorithm  

Microsoft Academic Search

The Levenberg-Marquardt algorithm is often superior to other training algorithms in off-line applications. This motivates the proposal of using a recursive version of the algorithm for on-line training of neural nets for nonlinear adaptive filtering. The performance of the suggested algorithm is compared with other alternative recursive algorithms, such as the recursive version of the off-line steepest-descent and Gauss-Newton algorithms.

Lester S. H. Ngia; Jonas Sjöberg

2000-01-01

371

Customizing an XML-Haskell data binding with type isomorphism inference in Generic Haskell  

Microsoft Academic Search

This paper introduces a type-preserving XML Schema-Haskell data binding (or, translation) UUXML, and shows how to customize it by exploiting the theory of canonical isomorphisms to automatically in- fer coercions between the machine-generated types and an equivalent, more natural, user-defined set of types. We show how to implement the inference mechanism in Generic Haskell. An XML data binding is a

Frank Atanassow; Johan Jeuring

2007-01-01

372

XML-Based Tools for Creating, Mapping, and Transforming Usability Engineering Requirements  

Microsoft Academic Search

This paper introduces a set of XML-based and XMI-based tools for creating usability engineering requirements and automatically\\u000a transforming them into software engineering specifications. Each of these tools is data-driven and uses XML to maximize flexibility,\\u000a accessibility, and translatability. These tools are primarily intended for use by usability engineers to create usability\\u000a engineering (UE) requirements, analyze accessibility issues, and automatically transform

Fei Huang; Jon Titus; Allan Wolinski; Kevin Schneider; Jim A. Carter

2009-01-01

373

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

374

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

Microsoft Academic Search

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

Danijela Boberic; Dusan Surla

2009-01-01

375

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

376

Extensible markup language (XML) in health care: integration of structured reporting and decision support.  

PubMed Central

The Extensible Markup Language (XML) is a newly adopted Internet protocol for data interchange designed to bring the key features of the Standard Generalized Markup Language (SGML; ISO 8879:1986)--extensibility, complex structures, and validation--to the World Wide Web. In this paper, we describe an architecture that uses XML to mediate between disparate client-server systems for structured reporting and decision support. Images Figure 2

Kahn, C. E.; de la Cruz, N. B.

1998-01-01

377

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

378

An Adaptable XML Based Approach for Scientific Data Management and Integration.  

PubMed

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

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

2008-02-20

379

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

380

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

381

Using XML and Java for Astronomical Instrument Control  

NASA Astrophysics Data System (ADS)

Traditionally, instrument command and control systems have been highly specialized, consisting mostly of custom code that is difficult to develop, maintain, and extend. Such solutions are initially very costly and are inflexible to subsequent engineering change requests. Instrument description is too tightly coupled with details of implementation. NASA/Goddard Space Flight Center and AppNet, Inc. are developing a very general and highly extensible framework that applies to virtually any kind of instrument that can be controlled by a computer (e.g., telescopes, microscopes and printers). A key aspect of the object-oriented architecture, implemented in Java, involves software that is driven by an instrument description. The Astronomical Instrument Markup Language (AIML) is a domain-specific implementation of the more generalized Instrument Markup Language (IML). The software architecture combines the platform-independent processing capabilities of Java with the vendor-independent data description syntax of Extensible Markup Language (XML), a human-readable and machine-understandable way to describe structured data. IML is used to describe command sets (including parameters, datatypes, and constraints) and their associated formats, telemetry, and communication mechanisms. The software uses this description to present graphical user interfaces to control and monitor the instrument. Recent efforts have extended to command procedures (scripting) and representation of data pipeline inputs, outputs, and connections. Near future efforts are likely to include an XML description of data visualizations, as well as the potential use of XSL (Extensible Stylesheet Language) to permit astronomers to customize the user interface on several levels: per user, instrument, subsystem, or observatory-wide. Our initial prototyping effort was targeted for HAWC (High-resolution Airborne Wideband Camera), a first-light instrument of SOFIA (the Stratospheric Observatory for Infrared Astronomy). A production-level application of this technology is for one of the three candidate detectors of SPIRE (Spectral and Photometric Imaging REceiver), a focal plane instrument proposed for the European Space Agency's Far Infrared Space Telescope. The detectors are being developed by the Infrared Astrophysics Branch of NASA/GSFC.

Koons, L.; Ames, T.; Evans, R.; Warsaw, C.; Sall, K.

1999-12-01

382

Recursive time-varying filter banks for subband image coding  

NASA Technical Reports Server (NTRS)

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

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

1992-01-01

383

Recursive Ant Colony Global Optimization: a new technique for the inversion of geophysical data  

NASA Astrophysics Data System (ADS)

We present a new method called Recursive Ant Colony Global Optimization (RACO) technique, a modified form of general ACO, which can be used to find the best solutions to inversion problems in geophysics. RACO simulates the social behaviour of ants to find the best path between the nest and the food source. A new term depth has been introduced, which controls the extent of recursion. A selective number of cities get qualified for the successive depth. The results of one depth are used to construct the models for the next depth and the range of values for each of the parameters is reduced without any change to the number of models. The three additional steps performed after each depth, are the pheromone tracking, pheromone updating and city selection. One of the advantages of RACO over ACO is that if a problem has multiple solutions, then pheromone accumulation will take place at more than one city thereby leading to formation of multiple nested ACO loops within the ACO loop of the previous depth. Also, while the convergence of ACO is almost linear, RACO shows exponential convergence and hence is faster than the ACO. RACO proves better over some other global optimization techniques, as it does not require any initial values to be assigned to the parameters function. The method has been tested on some mathematical functions, synthetic self-potential (SP) and synthetic gravity data. The obtained results reveal the efficiency and practicability of the method. The method is found to be efficient enough to solve the problems of SP and gravity anomalies due to a horizontal cylinder, a sphere, an inclined sheet and multiple idealized bodies buried inside the earth. These anomalies with and without noise were inverted using the RACO algorithm. The obtained results were compared with those obtained from the conventional methods and it was found that RACO results are more accurate. Finally this optimization technique was applied to real field data collected over the Surda Valley region of India and we get encouraging results that is in good agreement with the available results.

Gupta, D. K.; Gupta, J. P.; Arora, Y.; Singh, U. K.

2011-12-01

384

Drawing Updates From Derivations  

Microsoft Academic Search

We propose a method for satisfying update requests in deductive databases. The setting is a generalization of the view update problem in relational databases. Updates can be drawn from goals and input clauses in derivations that are rooted at the request. An update may be invalidated by negation or integrity constraints. Thus, it may be necessary to try other updates,

Hendrik Decker; Siemens ZFE

1990-01-01

385

Accessing genomic data through XML-based remote procedure calls.  

PubMed

As the amount of data in public genomic databases grows, interoperability among them is becoming an increasingly critical feature. The ability for automated systems to mine and integrate data will be crucial to extracting knowledge from sources of data whose volume far exceeds the capabilities of human researchers. The currently dominant paradigm of presenting information as Web pages and using hyperlinks to describe relationships between pieces of information favors usability, but makes interoperability and automated data exchange more difficult. In this paper we describe how SNPper, a web-based system for the retrieval and analysis of Single Nucleotide Polymorphisms (SNPs), was augmented with a Remote Procedure Call interface, allowing client applications to query our program for SNP data and to receive the response as an XML document. Data represented in this form can be easily parsed by the requesting program, and thus reused for other applications. In this paper we describe the implementation of the interface and we show examples of its usage in a number of existing applications. PMID:12463907

Riva, Alberto; Kohane, Isaac S

2002-01-01

386

Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures  

NASA Astrophysics Data System (ADS)

Quicksort (Commun. ACM 4(7):321-322, 1961) remains one of the most studied algorithms in computer science. It is important not only as a practical sorting method, but also as a splendid teaching aid for introducing recursion and systematic algorithm development. The algorithm has been studied extensively; so, it is natural to assume that everything that needs to be said about it has already been said. Yet, in attempting to code it using a recent programming language of our design, we discovered that its structure is more clearly expressed as a concurrent program that manipulates a shared mutable store, without any locking or explicit synchronization. In this paper, we describe the essential aspects of our programming language Orc (Proceedings of FMOODS/FORTE, vol. 5522 of LNCS, pp. 1-25. Springer 2009), show a number of examples that combine its features in various forms, and then develop a concise description of Quicksort. We hope to highlight the importance of including concurrency, recursion and mutability within a single theory.

Kitchin, David; Quark, Adrian; Misra, Jayadev

387

Recursive partitioning models for linkage in COGA data  

PubMed Central

We have developed a recursive-partitioning (RP) algorithm for identifying phenotype and covariate groupings that interact with the evidence for linkage. This data-mining approach for detecting gene × environment interactions uses genotype and covariate data on affected relative pairs to find evidence for linkage heterogeneity across covariate-defined subgroups. We adapted a likelihood-ratio based test of linkage parameterized with relative risks to a recursive partitioning framework, including a cross-validation based deviance measurement for choosing optimal tree size and a bootstrap sampling procedure for choosing robust tree structure. ALDX2 category 5 individuals were considered affected, categories 1 and 3 unaffected, and all others unknown. We sampled non-overlapping affected relative pairs from each family; therefore, we used 144 affected pairs in the RP model. Twenty pair-level covariates were defined from smoking status, maximum drinks, ethnicity, sex, and age at onset. Using the all-pairs score in GENEHUNTER, the nonparametric linkage tests showed no regions with suggestive linkage evidence. However, using the RP model, several suggestive regions were found on chromosomes 2, 4, 6, 14, and 20, with detection of associated covariates such as sex and age at onset.

Xu, Wei; Taylor, Chelsea; Veenstra, Justin; Bull, Shelley B; Corey, Mary; Greenwood, Celia MT

2005-01-01

388

A fast recursive algorithm for molecular dynamics simulation  

SciTech Connect

In this paper, we develop a recursive algorithm for solving the dynamical equations of motion for molecular systems. We make use of internal variable models which have been shown to reduce the computation times of molecular dynamics simulations by an order of magnitude when compared with Cartesian models. The O(N) algorithm described in this paper for solving the equations of motion provides additional significant improvements in computational speed. We make extensive use of the spatial operator methods which have been developed recently for the analysis and simulation of the dynamics of multibody systems. The spatial operators are used to derive the equations of motion and obtain an operator expression for the system mass matrix. An alternative square factorization of the mass matrix leads to a closed form expression for its inverse. From this follows the recursive algorithm for computing the generalized accelerations. The computational cost of this algorithm grows only linearly with the number of degrees of freedom. This is in contrast to conventional constrained dynamics algorithms whose cost is a cubic function of the number of degrees of freedom. For the case of a polypeptide molecule with 400 residues, the O(N) algorithm provides computational speedup by a factor of 450 over the conventional O(N[sup 3]) algorithm. We also describe a simplified method for computing and handling the potential function gradients within the dynamics computations. 21 refs., 3 figs.

Jain, A.; Vaidehi, N.; Rodriguez, G. (California Institute of Technology, Pasadena (United States))

1993-06-01

389

REQUEST: A Recursive QUEST Algorithm for Sequential Attitude Determination  

NASA Technical Reports Server (NTRS)

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

Bar-Itzhack, Itzhack Y.

1996-01-01

390

A recursive least squares-based demodulator for electrical tomography.  

PubMed

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

Xu, Lijun; Zhou, Haili; Cao, Zhang

2013-04-01

391

Recursive Feature Selection with Significant Variables of Support Vectors  

PubMed Central

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

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

2012-01-01

392

Electronic transport of graphene nanoribbons within recursive Green's function  

NASA Astrophysics Data System (ADS)

In this work, we introduce a recursive Green's function method for investigating electronic transport in a graphene nanoribbons (GNRs) quantum wire with armchair (AGNR) and zigzag (ZGNR) edges which attached to two semi-infinite square lattice leads. This model reduces numerical calculations time and enables us to use Green's function method to investigate transport in a supperlattice device. Therefore, we consider AGNR and ZGNR devices attached to metallic semi-infinite square lattice leads, taking into account the effects of longitudinal and wide of the wire. Our calculations are based on the tight-binding model, which the recursive Green's function method is used to solve inhomogeneous differential equations. We concentrate on the electrical conductance and current for various length and wide size of the wire. Our numerical results show that the transport properties are strongly affected by the quantum interference effect and the lead interface geometry to the device. By controlling the type of contact and wire geometry, this kind of system can explain the antiresonance states at the Fermi energy. Our results can serve as a base for developments in designing nano-electronic devices.

Shokri, A. A.; Mosavat, A. H.

2012-04-01

393

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

NASA Technical Reports Server (NTRS)

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

Gal-Edd, Jonathan; Fatig, Curtis C.

2005-01-01

394

A Robust UART Architecture Based on Recursive Running Sum Filter for Better Noise Performance  

Microsoft Academic Search

This paper describes a novel architecture of universal asynchronous receiver transmitter (UART) based on recursive running sum (RRS) filter. UARTs are used for asynchronous serial data communication between remote embedded systems. If physical channel is noisy then, serial data bits get corrupted during transmission. The robust UART core described here, utilizes recursive running sum filter to remove noisy samples. Input

Himanshu Patel; Sanjay Trivedi; R. Neelkanthan; V. R. Gujraty

2007-01-01

395

LETTER TO THE EDITOR: Recursion operator for the stationary Nizhnik-Veselov-Novikov equation  

NASA Astrophysics Data System (ADS)

We present a new general construction of a recursion operator from the zero-curvature representation. Using it, we find a recursion operator for the stationary Nizhnik-Veselov-Novikov equation and present a few low-order symmetries generated with the help of this operator.

Marvan, M.; Sergyeyev, A.

2003-02-01

396

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

397

Collision avoidance in a recursive nested behaviour control structure for Unmanned Aerial Vehicles  

Microsoft Academic Search

In this paper, the collision avoidance behaviour in a recursive nested behaviour control structure for Unmanned Aerial Vehicles will be discussed. The architecture is an extension of the behaviour-based recursive control structure, which has been applied successfully to mobile robot applications. The system structure, as an abstraction of multiple cascaded control loops with feedback mechanisms, is robust against disturbances and

Amr A. Kandil; Achim Wagner; Alexander Gotta; Essameddin Badreddin

2010-01-01

398

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

Microsoft Academic Search

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

C. Xiang; D. Huang

2006-01-01

399

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

400

Hyperspectral image compression based on adaptive recursive bidirection prediction\\/JPEG  

Microsoft Academic Search

This paper proposes a new recursive bidirection prediction (RBP)\\/JPEG method for hyperspectral image compression. The compression is achieved by using this novel RBP scheme for spectral decorrelation followed by the standard JPEG algorithm for coding the resulting decorrelated residual images. The key feature of the new method is that it presents a recursive algorithm to reduce the interband correlation. This

Ye Zhang; Mita D. Desai

2000-01-01

401

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

NASA Technical Reports Server (NTRS)

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

Verhaegen, M. H.

1987-01-01

402

Daily load forecasting using recursive Artificial Neural Network vs. classic forecasting approaches  

Microsoft Academic Search

The aspects presented in the paper refer to the recursive artificial neural network (ANN) architecture for short term daily load forecasting. The paper emphasizes the importance of choosing the right training set used to teach the recursive ANN (RANN). Using specific data from the Banat region (situated in South-Western Romania), some daily load forecasts based on the proposed method are

Dan Jigoria-Oprea; Bucur Lustrea; Stefan Kilyeni; Constantin Barbulescu; Annamaria Kilyeni; Attila Simo

2009-01-01

403

Technical Note: Recursive Algorithm for Inbreeding Coefficients Assuming Nonzero Inbreeding of Unknown Parents  

Microsoft Academic Search

A recursive algorithm to calculate inbreeding coeffi- cients was modified to account for nonzero inbreeding of unknown parents. The modification was done by changing one part of a recursive formula in which the inbreeding of an animal with at least one unknown parent is not zero and replacing it by the mean inbreed- ing of all animals born the same

I. Aguilar; I. Misztal

2008-01-01

404

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.

405

[Pharmacovigilance update].  

PubMed

The main pharmacovigilance updates in 2013 are reviewed. Nitrofurantoin: lower efficacy and an increased risk of adverse events when creatinine clearance is below 60 ml/min. Dabigatran: contraindicated in patients with mechanical heart valves. Azithromycin: QT prolongation and increased risk of death. Zolpidem: towards a lower dosage. Roflumilast: avoid in patients known or at risk for mood disorders. Retigabine: indication restricted to last-line use and new monitoring requirements after reports of pigment changes in retina and other tissues. Telaprevir and rituximab: severe mucocutaneous reactions. Fingolimod: rare cases of progressive multifocal leucoencephalopathy. Tolvaptan: potential for hepatotoxicity. Nicotinic acid/laropiprant: suspension of marketing authorization as benefits no longer outweigh risks. PMID:24558915

Diezi, Léonore; Renard, Delphine; Rothuizen, Laura E; Livio, Françoise

2014-01-15

406

Content-Aware DataGuide with Incremental Index Update using Frequently Used Paths  

NASA Astrophysics Data System (ADS)

Size of the WWW is increasing day by day. Due to the absence of structured data on the Web, it becomes very difficult for information retrieval tools to fully utilize the Web information. As a solution to this problem, XML pages come into play, which provide structural information to the users to some extent. Without efficient indexes, query processing can be quite inefficient due to an exhaustive traversal on XML data. In this paper an improved content-centric approach of Content-Aware DataGuide, which is an indexing technique for XML databases, is being proposed that uses frequently used paths from historical query logs to improve query performance. The index can be updated incrementally according to the changes in query workload and thus, the overhead of reconstruction can be minimized. Frequently used paths are extracted using any Sequential Pattern mining algorithm on subsequent queries in the query workload. After this, the data structures are incrementally updated. This indexing technique proves to be efficient as partial matching queries can be executed efficiently and users can now get the more relevant documents in results.

Sharma, A. K.; Duhan, Neelam; Khattar, Priyanka

2010-11-01

407

Recursive dynamics for flexible multibody systems using spatial operators  

NASA Technical Reports Server (NTRS)

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

Jain, A.; Rodriguez, G.

1990-01-01

408

Performance of fir adaptive filters using recursive algorithms  

NASA Astrophysics Data System (ADS)

Adaptive digital filters used for speech and data processing are investigated. The algorithms use either a least mean square recursively in time. Only the all-zero transversal and lattice filter structures are considered. A geometric or Hilbert space formalism is used to derive the LMS lattice, LS lattice, and "Fast" Kalman algorithms in a cohesive manner. Convergence properties of the LMS adaptive lattice filter are discussed. A deterministic model for multistage convergence is described which gives filter coefficient mean-values an output mean squared error as functions of time. The model is then extended to the LMS and LS lattice joint process estimators and to the "Fast" Kalman algorithm. In each case calculated curves obtained from the model are compared with simulation results. The performance of each adaptive predictor in the context of adaptive differential pulse code modulation of speech is compared.

Honig, M. L.

1981-11-01

409

Adaptive control of large space structures using recursive lattice filters  

NASA Technical Reports Server (NTRS)

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

Sundararajan, N.; Goglia, G. L.

1985-01-01

410

Adaptive control of large space structures using recursive lattice filters  

NASA Technical Reports Server (NTRS)

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

Goglia, G. L.

1985-01-01

411

Structure damage detection based on random forest recursive feature elimination  

NASA Astrophysics Data System (ADS)

Feature extraction is a key former step in structural damage detection. In this paper, a structural damage detection method based on wavelet packet decomposition (WPD) and random forest recursive feature elimination (RF-RFE) is proposed. In order to gain the most effective feature subset and to improve the identification accuracy a two-stage feature selection method is adopted after WPD. First, the damage features are sorted according to original random forest variable importance analysis. Second, using RF-RFE to eliminate the least important feature and reorder the feature list each time, then get the new feature importance sequence. Finally, k-nearest neighbor (KNN) algorithm, as a benchmark classifier, is used to evaluate the extracted feature subset. A four-storey steel shear building model is chosen as an example in method verification. The experimental results show that using the fewer features got from proposed method can achieve higher identification accuracy and reduce the detection time cost.

Zhou, Qifeng; Zhou, Hao; Zhou, Qingqing; Yang, Fan; Luo, Linkai

2014-05-01

412

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

413

Spatially recursive filtering and smoothing for multibody dynamics  

NASA Technical Reports Server (NTRS)

Methods developed recently by the author to solve the problem of forward dynamics for nonlinear joint-connected multibody systems are summarized. Solution of this problem is of interest in such application areas as robotics, deploying structures, ground vehicles, and pointing of antennas and instrumented platforms. The problem is solved by the recursive filtering and smoothing techniques of state estimation theory. The filtering stage takes the applied joint moments as inputs to produce a sequence of spatial constraint forces acting at the joints of the system. The smoothing stage takes the innovations process resulting from the filter as an input and produces a set of spatial accelerations and a corresponding set of joint-angle accelerations.

Rodriguez, G.

1988-01-01

414

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

415

Powers of the Vandermonde determinant, Schur functions and recursive formulas  

NASA Astrophysics Data System (ADS)

The decomposition of an even power of the Vandermonde determinant in terms of the basis of Schur functions matches the decomposition of the Laughlin wavefunction as a linear combination of Slater wavefunctions and thus contributes to the understanding of the quantum Hall effect. We investigate several combinatorial properties of the coefficients in the decomposition. In particular, we give recursive formulas for the coefficient of the Schur function s? in the decomposition of an even power of the Vandermonde determinant in n + 1 variables in terms of the coefficient of the Schur function s? in the decomposition of the same even power of the Vandermonde determinant in n variables if the Young diagram of ? is obtained from the Young diagram of ? by adding a tetris type shape to the top or to the left.

Ballantine, C.

2012-08-01

416

A degree by degree recursive construction of Hermite spline interpolants  

NASA Astrophysics Data System (ADS)

Based on the classical Hermite spline interpolant H2n-1, which is the piecewise interpolation polynomial of class Cn-1 and degree 2n-1, a piecewise interpolation polynomial H2n of degree 2n is given. The formulas for computing H2n by H2n-1 and computing H2n+1 by H2n are shown. Thus a simple recursive method for the construction of the piecewise interpolation polynomial set {Hj} is presented. The piecewise interpolation polynomial H2n satisfies the same interpolation conditions as the interpolant H2n-1, and is an optimal approximation of the interpolant H2n+1. Some interesting properties are also proved.

Han, Xuli

2009-03-01

417

Direct recursive identification of the Preisach hysteresis density function  

NASA Astrophysics Data System (ADS)

In this paper, a novel direct method of recursive identification of the Preisach hysteresis density function is proposed. Using the discrete dynamic Preisach model, which is a state-space realization of the classical scalar Preisach model, the method is designed based on the output increment error. After giving the general formulation, the identification scheme implemented for a discretized Preisach plane is introduced and evaluated through the use of numerical simulations. Two cases of Gaussian mixtures are considered for mapping the hysteresis system to be identified. The parameter convergence is shown for a low-pass filtered white-noise input. Further, the proposed identification method is applied to a magnetism-related application example, where the flux linkage hysteresis of a proportional solenoid is assumed from the measurements, and then the inverse of a standard demagnetization procedure is utilized as the identification sequence.

Ruderman, Michael

2013-12-01

418

A recursive algorithm for the rectangular guillotine strip packing problem  

NASA Astrophysics Data System (ADS)

This article presents a recursive heuristic algorithm to generate cutting patterns for the rectangular guillotine strip packing problem in which a set of rectangular items must be cut from the strip such that the consumed strip length is minimized. The strip is placed with its length along the horizontal direction, and is divided into several segments with vertical cuts. The length of a segment is determined by the item placed at the bottom. Orthogonal cuts divide the segments into blocks and finished items. For the current block considered, the algorithm selects an item, puts it at the bottom-left corner of the block, and divides the unoccupied region into two smaller blocks with an orthogonal cut. Rotation of the items by 90 is allowed. Both lower and upper bounds are used to prune unpromising branches. The computational results indicate that the algorithm performs better than several recently published algorithms.

Cui, Y.; Gu, T.; Zhong, Y.

2008-04-01

419

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

NASA Technical Reports Server (NTRS)

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

Lin, Risheng; Afjeh, Abdollah A.

2003-01-01

420

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

421

Study of WebGIS based on XML database and SVG  

NASA Astrophysics Data System (ADS)

With the fast development of WebGIS, data fast transmission and browsing the electronic map by way of vector in WebGIS become the focus of present WebGIS research. This paper proposes a method of establishing a Web-based system that can visualize geographic data. In terms of the graphics format, our proposed system uses Scalable Vector Graphics (SVG) that XML-based 2D vector graphics, and geographic data stored on Web Server with XML database. SVG is a language for describing two-dimensional graphics based on XML, and it can be used to describe the point, line and polygon. The schema has a small amount of data transferred, faster performance, low development costs and so on.

Lian, Jianbo; Sun, Bianfu

2011-01-01

422

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

NASA Technical Reports Server (NTRS)

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

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

2007-01-01

423

Damped model updating using complex updating parameters  

NASA Astrophysics Data System (ADS)

Most of the model updating techniques do not employ damping matrices and hence cannot be used for the accurate prediction of complex frequency response functions (FRFs) and complex mode shapes. In this paper, the response function method (RFM) is extended to deal with the complexity of FRF and modal data using complex updating parameters. In the proposed model updating procedure, the finite element model is updated in such a way that the updated model reflects general damping in the experimental model by considering the updating parameters as complex. The effectiveness of the proposed finite element updating procedure is demonstrated by numerical examples as well as by actual laboratory experiments. First, a study is performed using numerical simulation based on a fixed-fixed beam structure with structural damping, viscous damping and structural and viscous damping models. Various levels of damping and noise are assumed in the data. The numerical study is followed by a case involving actual measured data for the case of an F-shaped test structure. The updated results have shown that the complex updating finite element model updating procedure can be used to derive an accurate model of the system. This is illustrated by matching of the complex FRFs obtained from the updated model with that of experimental data.

Arora, Vikas; Singh, S. P.; Kundra, T. K.

2009-02-01

424

Recursive least square vehicle mass estimation based on acceleration partition  

NASA Astrophysics Data System (ADS)

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

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

2014-05-01

425

Integrating clinical alerts into an XML-based health care framework for the neonatal intensive care unit  

Microsoft Academic Search

This work extends the functionality of our earlier XML-based health care framework for integrating clinical decision support systems (CDSSs) with capabilities for defining, detecting, and generating clinical alerts in the neonatal intensive care unit (NICU). A first step in this work involved creating a complete NICU XML schema for defining and constraining medical device data, CDSS inputs and outputs, and

C. Catley; M. Frize; C. R. Walker; L. StGermain

2003-01-01

426

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

427

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

428

Recursive Calculation of Geopotential Acceleration Calculo Recursivo DA Aceleracao Do Geopotencial.  

National Technical Information Service (NTIS)

FORTRAN routines to calculate geopotential, which is modelled using Goddard Earth Model 10 (GEM10) spherical harmonic coefficients, are presented. Recursive equations are utilized in order to calculate the fully normalized Legendre polinomials in order to...

H. K. Kuga V. M. Demedeiros V. Carrara

1983-01-01

429

Rotorcraft Blade Mode Damping Identification from Random Responses Using a Recursive Maximum Likelihood Algorithm.  

National Technical Information Service (NTIS)

An on line technique is presented for the identification of rotor blade modal damping and frequency from rotorcraft random response test data. The identification technique is based upon a recursive maximum likelihood (RML) algorithm, which is demonstrated...

J. A. Molusis

1982-01-01

430

Rotorcraft Blade Mode Damping Identification from Random Responses Using a Recursive Maximum Likelihood Algorithm.  

National Technical Information Service (NTIS)

An on-line technique is presented for the identification of rotor blade modal damping and frequency from rotorcraft random response test data. The identification technique is based upon a recursive maximum likelihood (RML) algorithm, which is demonstrated...

J. A. Molusis

1982-01-01

431

Kalman filtering, smoothing and recursive robot arm forward and inverse dynamics  

NASA Technical Reports Server (NTRS)

The inverse and forward dynamics problems for multi-link serial manipulators are solved by using recursive techniques from linear filtering and smoothing theory. The pivotal step is to cast the system dynamics and kinematics as a two-point boundary-value problem. Solution of this problem leads to filtering and smoothing techniques identical to the equations of Kalman filtering and Bryson-Frazier fixed time-interval smoothing. The solutions prescribe an inward filtering recursion to compute a sequence of constraint moments and forces followed by an outward recursion to determine a corresponding sequence of angular and linear accelerations. In addition to providing techniques to compute joint accelerations from applied joint moments (and vice versa), the report provides an approach to evaluate recursively the composite multi-link system inertia matrix and its inverse. The report lays the foundation for the potential use of filtering and smoothing techniques in robot inverse and forward dynamics and in robot control design.

Rodriguez, G.

1986-01-01

432

An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators  

Microsoft Academic Search

this paper is to explain the implementation of a software package for analyzingthe lattice structure of linear congruential or multiple recursive random number generators.Such generators are based on linear recurrences of the form

Pierre L'ecuyer; Raymond Couture

1997-01-01

433

A Parallel Implementation of Multilevel Recursive Spectral Bisection for Application to Adaptive Unstructured Meshes. Chapter 1  

NASA Technical Reports Server (NTRS)

The design of a parallel implementation of multilevel recursive spectral bisection is described. The goal is to implement a code that is fast enough to enable dynamic repartitioning of adaptive meshes.

Barnard, Stephen T.; Simon, Horst; Lasinski, T. A. (Technical Monitor)

1994-01-01

434

Multi-Resolution Seismic Tomography Based on Recursive Tessellation Hierarchy  

SciTech Connect

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

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

2009-07-01

435

An XML-based framework for the validation and verification of electronic structure codes  

Microsoft Academic Search

The process of validation and verification of the results of electronic structure calculations involves comparisons of data sets obtained with widely disparate software packages, including a large diversity of data formats. We present a web-based framework aimed at facilitating automatic comparison between electronic structure computation results and first-principles molecular dynamics simulations. The framework makes extensive use of XML in the

Gary Yuan; Francois Gygi

2010-01-01

436

On specifying security policies for web documents with an XML-based language  

Microsoft Academic Search

The rapid growth of the Web and the ease with which data can be accessed facilitate the distribution and sharing of information. Information dissemination often takes the form of documents that are made available at Web servers, or that are actively broadcasted by Web servers to interested clients. In this paper, we present an XML-compliant formalism for specifying security-related information

Elisa Bertino; Silvana Castano; Elena Ferrari

2001-01-01

437

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

ERIC Educational Resources Information Center

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

Menne-Haritz, Angelika

2005-01-01

438

A novel method for measuring semantic similarity for XML schema matching  

Microsoft Academic Search

Enterprises integration has recently gained great attentions, as never before. The paper deals with an essential activity enabling seam- less enterprises integration, that is, a similarity-based schema matching. To this end, we present a supervised approach to measure seman- tic similarity between XML schema documents, and, more importantly, address a novel approach to augment reliably labeled training data from a

Buhwan Jeong; Daewon Lee; Hyunbo Cho; Jaewook Lee

2008-01-01

439

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

440

XML3D and Xflow: Combining Declarative 3D for the Web with Generic Data Flows.  

PubMed

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

Klein, F; Sons, K; Rubinstein, D; Slusallek, P

2013-01-01

441

An Electronic Finding Aid Using Extensible Markup Language (XML) and Encoded Archival Description (EAD).  

ERIC Educational Resources Information Center

Describes the development of electronic finding aids for archives at the University of Illinois, Urbana-Champaign that used XML (extensible markup language) and EAD (encoded archival description) to enable more flexible information management and retrieval than using MARC or a relational database management system. EAD template is appended.…

Chang, May

2000-01-01

442

SGML/XML-Based Electronic Theses and Dissertations: Existing Projects and Standards.  

ERIC Educational Resources Information Center

Discusses the capability of masters and doctoral students to create electronic theses or dissertations (ETD) that can integrate multimedia, sound, pictures, and animation. Addresses issues connected with the development of standards, copyright, and format, including SGML, XML, and DTDs (document type definitions), and provides an overview of ETD…

Dobratz, Susanne; Schulz, Matthias; Potter, Phil; Strabala, Patty

2001-01-01

443

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

ERIC Educational Resources Information Center

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

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

2005-01-01

444

Strategic industrial alliances in paper industry : XML vs Ontology-based integration platforms  

Microsoft Academic Search

Purpose – To identify cases related to design of ICT platforms for industrial alliances, where the use of Ontology-driven architectures based on Semantic web standards is more advantageous than application of conventional modeling together with XML standards. Design\\/methodology\\/approach – A comparative analysis of the two latest and the most obvious use cases (NASA and Nordic Process Industry Data Exchange Alliance)

Anton Naumenko; Sergiy Nikitin; Vagan Terziyan; Andriy Zharko

2005-01-01

445

An XML-based Data Interchange Protocol and Supporting Systems for Online Customs Declaration  

Microsoft Academic Search

Online customs declaration is becoming popular for international logistics through airports and seaports. This paper proposes a dedicated data interchange protocol and presents the supporting systems being developed for express post. Compared with the traditional Electronic Data Interchange, the proposed protocol and systems is based on XML, and supports RFID, Harmonized System codes, and image processing. The protocol and systems

Yinsheng Li; Fangyuan Kang; Weiming Shen; Mu Zhu

2009-01-01

446

MolDIA: XML based system of molecular diversity analysis towards virtual screening and QSPR  

Microsoft Academic Search

In this paper a new chemoinformatics tool for Molecular Diversity Analysis (MolDIA) is introduced. The objective of this system is the analysis of molecular similarity and diversity through the treatment of structural and physicochemical information. Current needs for chemical databases include the analysis, the management and the retrieval of chemical information. The implementation of eXtended Markup Languages (XML) is proposed

A. G. Maldonado; M. Petitjean; J.-P. Doucet; A. Panaye; B. T. Fan

2006-01-01

447

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

PubMed

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

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

2014-01-01

448

JAFER ToolKit project: interfacing Z39.50 and XML  

Microsoft Academic Search

In this paper, we describe the JAFER ToolKit project which is developing a simplified XML based API above the Z39.50 protocol[1]. The ToolKit allows the development of both Z39.50 based applications (both clients and servers) without detailed knowledge of the complexities of the protocol.

Antony Corfield; Matthew J. Dovey; Richard Mawby; Colin Tatham

2002-01-01

449

PrefixSummary: A Directory Structure for Selective Probing on Wireless Stream of Heterogeneous XML Data  

NASA Astrophysics Data System (ADS)

Wireless broadcasting of heterogeneous XML data has become popular in many applications, where energy-efficient processing of user queries at the mobile client is a critical issue. This paper proposes a new index structure for wireless stream of heterogeneous XML data to enhance tuning time performance in processing path queries on the stream. The index called PrefixSummary stores for each location path in the XML data the address of a bucket in the stream which contains an XML node satisfying the location path and appearing first in the stream. We present algorithms to generate broadcast stream with the proposed index and to process a path query on the stream efficiently by exploiting the index. We also suggest a replication scheme of PrefixSummary within a broadcast cycle to reduce latency in query processing. By analysis and experiment we show the proposed PrefixSummary approach can reduce tuning time for processing path queries significantly while it can also achieve reasonable access time performance by means of replication of the index over the broadcast stream.

Park, Chang-Sup; Park, Jun Pyo; Chung, Yon Dohn

450

A recursive moving-target-indication algorithm for optical image sequences  

Microsoft Academic Search

A recursive track-before-detect algorithm, producing potentially large signal-to-noise ratio (SNR) gains under realizable conditions, is described. The basic relation has the form of a linear, constant-coefficient difference equation with a unity magnitude damping factor. Known as recursive moving-target-indication (RMTI), this procedure adapts easily to digital processing and achieves SNR gains comparable to those from other robust track-before-detect algorithms. Examples are

I. S. Reed; R. M. Gagliardi; L. B. Stotts

1990-01-01

451

A recursive algorithm for evaluating Molodenskii-type truncation error coefficients at altitude  

NASA Astrophysics Data System (ADS)

A recursive method is derived for computing the Molodenskii truncation error coefficients at altitude for the altitude-generalized Stokes integral. Furthermore, the Cook truncation error coefficients at altitude corresponding to the generalized Vening-Meinesz integral are derived in terms of the Molodenskii coefficients. Also, the gravity disturbance truncation error coefficients at altitude are related to the Molodenskii coefficients. By combining these results, it is shown how the truncation error for the complete gravity disturbance vector at altitude may be computed recursively.

Shepperd, Stanley W.

1982-06-01

452

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

453

On the Complexity of Ltl Model-Checking of Recursive State Machines  

Microsoft Academic Search

Recursive state machines (rsms) are models for programs with recursive procedural calls. While Ltl model-checking is Exptime-complete on such models, on finite-state machines, it is Pspace-complete in general and becomes Np-complete for interesting fragments. In this paper, we systematically study the computational complexity of model-checking\\u000a rsm s against several syntactic fragments of Ltl. Our main result shows that if in

Salvatore La Torre; Gennaro Parlato

454

A symmetry and bi-recursive algorithm of accurately computing Krawtchouk moments  

Microsoft Academic Search

Few scientific studies have discussed the accuracy of the Krawtchouk moments for the common case of p?0.5. In the paper, a novel symmetry and bi-recursive algorithm is proposed to accurately calculate the Krawtchouk moments for the case of p? (0, 1). The numerical propagation error mechanism of direct recursively calculating the Krawtchouk moments is first analyzed. It reveals that the

Guojun Zhang; Luo Zhu; Bo Fu; Bo Li; Jiaping Liao; XiuXiang Fan; Zheng Xi

2010-01-01

455

Recursive structure in the definitions of gauge-invariant variables for any order perturbations  

NASA Astrophysics Data System (ADS)

The construction of gauge-invariant variables for any order perturbations is discussed. Explicit constructions of the gauge-invariant variables for perturbations to the forth order are shown. From these explicit constructions, the recursive structure in the definitions of gauge-invariant variables for any order perturbations is found. Through this recursive structure, the correspondence with the fully non-linear exact perturbations is briefly discussed.

Nakamura, Kouji

2014-07-01

456

Intervention-based multidimensional phase unwrapping using recursive orthogonal referring.  

PubMed

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

Liu, Junmin; Drangova, Maria

2012-10-01

457

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

458

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

459

Censored quantile regression with recursive partitioning-based weights.  

PubMed

Censored quantile regression provides a useful alternative to the Cox proportional hazards model for analyzing survival data. It directly models the conditional quantile of the survival time and hence is easy to interpret. Moreover, it relaxes the proportionality constraint on the hazard function associated with the popular Cox model and is natural for modeling heterogeneity of the data. Recently, Wang and Wang (2009. Locally weighted censored quantile regression. Journal of the American Statistical Association 103, 1117-1128) proposed a locally weighted censored quantile regression approach that allows for covariate-dependent censoring and is less restrictive than other censored quantile regression methods. However, their kernel smoothing-based weighting scheme requires all covariates to be continuous and encounters practical difficulty with even a moderate number of covariates. We propose a new weighting approach that uses recursive partitioning, e.g. survival trees, that offers greater flexibility in handling covariate-dependent censoring in moderately high dimensions and can incorporate both continuous and discrete covariates. We prove that this new weighting scheme leads to consistent estimation of the quantile regression coefficients and demonstrate its effectiveness via Monte Carlo simulations. We also illustrate the new method using a widely recognized data set from a clinical trial on primary biliary cirrhosis. PMID:23975800

Wey, Andrew; Wang, Lan; Rudser, Kyle

2014-01-01

460

An overview of the recursive polynomial methods for reactive dynamics  

NASA Astrophysics Data System (ADS)

We review some recently developed iterative numerical techniques of solving the inhomogeneous time-independent Schrödinger equation (E-hat H)?=\\chi, which are especially suitable for calculations associated with a large many body scattering problem, requiring large basis sets (grids). The methods we consider take advantage of the particular way the wave equation depends on the energy E. Namely, when global polynomial expansions of the resolvent operator are used the energy-dependent solution can be generated simultaneously at many energies from essentially a single iterative procedure. A general problem in constructing a well behaved polynomial expansion of a function of operator argument, f(hat H), is how to incorporate absorbing boundary conditions (ABC) which would eliminate reflection effects caused by an artificial truncation of an infinite grid where hat H is defined. We show how this problem can be solved naturally by modifying the auxiliary equations (recursion relations) used to generate the interpolating polynomials; this avoids using non-Hermitian operators. In particular Chebyshev and Newtonian interpolation schemes are considered. Several applications of the method will be also discussed.

Mandelshtam, Vladimir

1996-05-01

461

Glaucoma Medical Updates  

MedlinePLUS

... for Change Get Involved Research Grants Special Events Glaucoma Medical Updates Latest Medical News Updates BrightFocus Reports ... 3, 2014 Nanodiamond-Embedded Contact Lenses May Improve Glaucoma Treatment February 19, 2014 Researchers Discover Potential Drug ...

462

Updating Distributed Materialized Views  

Microsoft Academic Search

The problem of updating materialized views in distributed database systems is discussed. An architecture and detailed procedures for updating a collection of remote views with arbitrary refresh times by using a single differential file are described. The efficiency of the update procedure is enhanced by adopting s multiquery optimization approach and by introducing a powerful prescreening procedure to eliminate differential

Arie Segev

1989-01-01

463

Updating Situation Models  

ERIC Educational Resources Information Center

The authors examined how situation models are updated during text comprehension. If comprehenders keep track of the evolving situation, they should update their models such that the most current information, the here and now, is more available than outdated information. Contrary to this updating hypothesis, E. J. O'Brien, M. L. Rizzella, J. E.…

Zwaan, Rolf A.; Madden, Carol J.

2004-01-01

464

A spectral approach to recursive end-to-end distortion estimation for sub-pixel motion-compensated video coding  

Microsoft Academic Search

Error resilient video coding critically relies on the accuracy of endto-end distortion estimation. An established solution, the recursive optimal per-pixel estimate (ROPE), is based on tracking the first and second moments of the decoder reconstructed pixels. This paper is focused on an alternative estimation approach, the spectral coefficient-wise optimal recursive estimate (SCORE), whose recursion is performed in the transform domain.

Jingning Han; Vinay Melkote; Kenneth Rose

2011-01-01

465

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

Microsoft Academic Search

Edutella is an RDF-based E-Learning P2P network that is aimed to accommodate heterogeneous learning resource metadata repositories in a P2P manner and further facilitate the exchange of metadata between these repositories based on RDF. Whereas Edutella provides RDF metadata repositories with a quite natural integration approach, XML metadata repositories have to overcome considerable incompatibility between XML's tree-like hierarchical data model

Changtao Qu; Wolfgang Nejdl

2004-01-01

466

Towards Open Standards: The Evolution of an XML\\/JSP\\/WebDAV Based Collaborative Courseware Generating System  

Microsoft Academic Search

In this paper we present the evolution of a collaborative courseware generating system which is featured by XML-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 XML DTD to represent course structure, the second and the third system implementation take an open standard

Changtao Qu; Wolfgang Nejdl

2002-01-01

467

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

PubMed

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 as illustrated here with a few examples from proteomics data, the syntactic and document-centric XML cannot achieve the level of interoperability required by the highly dynamic and integrated bioinformatics applications. In the present article, we discuss why semantic web technologies, as recommended by the World Wide Web consortium (W3C), expand current data standard technology for biological data representation and management. PMID:16151403

Wang, Xiaoshu; Gorlitsky, Robert; Almeida, Jonas S

2005-09-01

468

Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases  

NASA Astrophysics Data System (ADS)

Since the extensible markup language XML emerged as a new standard for information representation and exchange on the Internet, the problem of storing, indexing, and querying XML documents has been among the major issues of database research. In this paper, we study the twig pattern matching and discuss a new algorithm for processing ordered twig pattern queries. The time complexity of the algorithmis bounded by O(|D|·|Q| + |T|·leaf Q ) and its space overhead is by O(leaf T ·leaf Q ), where T stands for a document tree, Q for a twig pattern and D is a largest data stream associated with a node q of Q, which contains the database nodes that match the node predicate at q. leaf T (leaf Q ) represents the number of the leaf nodes of T (resp. Q). In addition, the algorithm can be adapted to an indexing environment with XB-trees being used.

Chen, Yangjun

469

Generic architecture for professional authoring environments to export XML-based formats  

NASA Astrophysics Data System (ADS)

Professional authoring environments are used by Graphic Artists (GA) during the design phase of any publication type. With the increasing demand for supporting Variable Data Print (VDP) designs, these authoring environments require enhanced capabilities. The recurring challenge is to provide flexible VDP features that can be represented using several VDP enabling XML based formats. Considering the different internal structure of the authoring environments, a common platform needs to be developed. The solution must, at the same time, empower the GA with a rich VDP feature set, as well as, generating a range of output formats that drive their respective VDP workflows. We have designed a common architecture to collect the required data from the hosting application and a generic internal representation that enables multiple XML output formats.

Giannetti, Fabio

2007-01-01

470

Using the extensible markup language (XML) in automated clinical practice guidelines.  

PubMed Central

Much work has been done in the area of web-based clinical practice guidelines. Issues such as representation, description, architectures, and implementation have been explored previously. Most if not all of these web-based applications rely exclusively on HTML, the HyperText Markup Language. In the process of prototyping a guideline service to be used in a diabetes operations improvement project, we developed a model for a guideline engine that makes use of the Extensible Markup Language (XML), both as an interface to the engine and as a vehicle for delivering structured guideline content. We feel that XML may offer advantages in implementing guideline services that are difficult (if not impossible) to accomplish with HTML alone.

Dubey, A. K.; Chueh, H.

1998-01-01

471

Web Ecology: Recycling HTML Pages as XML Documents Using W4F  

Microsoft Academic Search

In this paper we present the World-Wide Web Wrapper Factory(W4F), a Java toolkit to generate wrappers for Webdata sources. Some key features of W4F are an expressivelanguage to extract information from HTML pages in astructured way, a mapping to export it as XML documentsand some visual tools to assist the user during wrapper creation.Moreover, the entire description of wrappers is

Arnaud Sahuguet; Fabien Azavant

1999-01-01

472

Customizing an XML-Haskell data binding with type isomorphism inference in Generic Haskell  

Microsoft Academic Search

This paper introduces a type-preserving XML Schema–Haskell\\u000adata binding (or, translation) UUXML, and shows how to customize it\\u000aby exploiting the theory of canonical isomorphisms to automatically infer\\u000acoercions between the machine-generated types and an equivalent,\\u000amore natural, user-defined set of types. We show how to implement the\\u000ainference mechanism in Generic Haskell.

Frank Atanassow; Johan Jeuring

2006-01-01

473

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

NASA Technical Reports Server (NTRS)

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

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

2008-01-01

474

XML-Format für den Software-in-the-Loop-Test  

Microsoft Academic Search

This paper presents a new XML test format developed for the SiLEST project. Auto- mated regression tests at software-in-the-loop level were the main focus of interest for the development. The article uses a simplified example to describe the contents and interactions of the different files. It presents therefore an overview of the tech- nology used in SiLEST and its possibilities.

Thomas Liebezeit; Holger Schumann

475

Comparing Emerging XML Based Formats from a Multi-discipline Perspective  

NASA Astrophysics Data System (ADS)

This paper analyzes the similarity and differences among several examples of an emerging generation of Scientific Data Formats that are based on XML technologies. Some of the factors evaluated include the goals of these efforts, the data models, and XML technologies used, and the maturity of currently available software. This paper then investigates the practicality of developing a single set of structural data objects and basic scientific concepts, such as units, that could be used across discipline boundaries and extended by disciplines and missions to create Scientific Data Formats for their communities. This analysis is partly based on an effort sponsored by the ESDIS office at GSFC to compare the Earth Science Markup Language (ESML) and the eXtensible Data Format( XDF), two members of this new generation of XML based Data Description Languages that have been developed by NASA funded efforts in recent years. This paper adds FITSML and potentially CDFML to the list of XML based Scientific Data Formats discussed. This paper draws heavily a Formats Evolution Process Committee (http://ssdoo.gsfc.nasa.gov/nost/fep/) draft white paper primarily developed by Lou Reich, Mike Folk and Don Sawyer to assist the Space Science community in understanding Scientific Data Formats. One of primary conclusions of that paper is that a scientific data format object model should be examined along two basic axes. The first is the complexity of the computer/mathematical data types supported and the second is the level of scientific domain specialization incorporated. This paper also discusses several of the issues that affect the decision on whether to implement a discipline or project specific Scientific Data Format as a formal extension of a general purpose Scientific Data Format or to implement the APIs independently.

Sawyer, D. M.; Reich, L. I.; Nikhinson, S.

2002-12-01

476

Prototype for wrapping and visualizing geo-referenced data in a distributed environment using XML technology  

Microsoft Academic Search

This paper proposes a prototype for integration and visualization of geo-referenced information (GRI) in a distributed environment in general and World Wide Web in particular. This prototype adopts a three-tier architecture and includes three main components: GRI wrapper for distributed GRI web sites, GRI integration mediator and client side visualization interface.In this prototype, XML is used as a communication protocol

Jianting Zhang; Muhammad Javed; Amir Shaheen; Le Gruenwald

2000-01-01

477

XML Schema Design and Management for e-Government Data Interoperability  

Microsoft Academic Search

One-stop public services and single window systems are primary goals of many e-government initiatives. How to facilitate the technical and data interoperability among the systems in different government agencies is a key of meeting these goals. While many software standards, such as Web Services and ebXML, have been formulated to address the interoperability between different technical platforms, the data interoperability

Thomas Lee; C. T. Hon; David Cheung

478

Development of a XML-based Ubiquitous System for Testing Using Smartphones  

Microsoft Academic Search

In this paper, authors introduce a novelty XML-based m-learning author tool running on Windows mobile-based smartphones which allows students to take different stored test. This mobile-based application runs off-line and only connects through Internet whenever should be required. Initial performance was evaluated requesting user feed-back through informal interview, as a result a summarize evaluation of usability, user performance and behaviour

Antonio Peñalver Benavent; Oscar Martínez Bonastre; Miguel Martínez Girona

2006-01-01

479

WaterML: an XML Language for Communicating Water Observations Data  

NASA Astrophysics Data System (ADS)

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

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

2007-12-01

480

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

NASA Astrophysics Data System (ADS)

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

Leif, Robert C.; Leif, Suzanne B.

2001-05-01

481

Generic data modelling and use of XML standard for home telemonitoring of chronically ill patients.  

PubMed

In recent years, internet-based home telemonitoring systems that allow transmission of patient data to a central database and offer immediate access to the data by the care providers have become available. The adoption of Extensible Mark-up Language (XML) as a W3C standard has generated a lot of interest in the potential value of this language in health informatics. However the telemonitoring systems often work with only one or a few types of medical devices and thus are limited in the types of diseases they can monitor. This is because different medical devices produce different types of data and the existing telemonitoring systems are generally built around a proprietary data schema specific for the device used. In this paper, we describe a generic data schema for a telemonitoring system that is applicable to different types of medical devices and different diseases, and then we present an architecture for the exchange of clinical information as data, signals of telemonitoring and clinical reports in the XML standard, up-to-date information in each electronic patient record and integration in real time with the information collected during the telemonitoring activities in the XML schema, between all the structures involved in the health care process of the patient. PMID:15460681

Di Giacomo, Paola; Ricci, Fabrizio L

2002-01-01

482

An XML-based System for Synthesis of Data from Disparate Databases  

PubMed Central

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 large data sets. This system facilitates management of XML schemas and on-demand creation and management of XML databases that conform to these schemas. They illustrate the use of this system in an application for genotype–phenotype correlation analyses. This application implements a method of phenotype–genotype correlation based on phylogenetic optimization of large data sets of mouse SNPs and phenotypic data. The application workflow requires the management and integration of genomic information and phenotypic data from external data repositories and from the results of phenotype–genotype correlation analyses. Our implementation supports the process of carrying out a complex workflow that includes large-scale phylogenetic tree optimizations and application of Maddison's concentrated changes test to large phylogenetic tree data sets. The data management system also allows collaborators to share data in a uniform way and supports complex queries that target data sets.

Kurc, Tahsin; Janies, Daniel A.; Johnson, Andrew D.; Langella, Stephen; Oster, Scott; Hastings, Shannon; Habib, Farhat; Camerlengo, Terry; Ervin, David; Catalyurek, Umit V.; Saltz, Joel H.

2006-01-01

483

Construction of a nasopharyngeal carcinoma 2D/MS repository with Open Source XML Database - Xindice  

PubMed Central

Background Many proteomics initiatives require integration of all information with uniformcriteria from collection of samples and data display to publication of experimental results. The integration and exchanging of these data of different formats and structure imposes a great challenge to us. The XML technology presents a promise in handling this task due to its simplicity and flexibility. Nasopharyngeal carcinoma (NPC) is one of the most common cancers in southern China and Southeast Asia, which has marked geographic and racial differences in incidence. Although there are some cancer proteome databases now, there is still no NPC proteome database. Results The raw NPC proteome experiment data were captured into one XML document with Human Proteome Markup Language (HUP-ML) editor and imported into native XML database Xindice. The 2D/MS repository of NPC proteome was constructed with Apache, PHP and Xindice to provide access to the database via Internet. On our website, two methods, keyword query and click query, were provided at the same time to access the entries of the NPC proteome database. Conclusion Our 2D/MS repository can be used to share the raw NPC proteomics data that are generated from gel-based proteomics experiments. The database, as well as the PHP source codes for constructing users' own proteome repository, can be accessed at .

Li, Feng; Li, Maoyu; Xiao, Zhiqiang; Zhang, Pengfei; Li, Jianling; Chen, Zhuchu

2006-01-01

484

An XML-Java system for HL7-based healthcare informatics.  

PubMed

Health-Level (HL) 7 message semantics allows effective functional implementation of Electronic Medical Record (EMR)--encompassing both clinical and administrative (i.e. demographic and financial) information--interchange systems, at the expense of complexity with respect the Protocol Data Unit (PDU) structure and the client-side application architecture. In this paper we feature the usage of the Extensible Markup Language (XML) document-object modelling and Java client-server connectivity towards the implementation of a Web-based system for EMR transaction processing. Our solution features an XML-based description of EMR templates, which are subsequently transcribed into a Hypertext Markup Language (HTML)-Javascript form. This allows client-side user interfaceability and server-side functionality--i.e. message validation, authentication and database connectivity--to be handled through standard Web client-server mechanisms, the primary assumption being availability of a browser capable of XML documents and the associated stylesheets. We assume usage of the Internet as the interchange medium, hence the necessity for authentication and data privacy mechanisms, both of which can be constructed using standard Java-based building blocks. PMID:11187482

Goh, A; Kum, Y L; Mak, S Y; Quek, Y T

2000-01-01

485

A Novel Air Index Scheme for Twig Queries in On-Demand XML Data Broadcast  

NASA Astrophysics Data System (ADS)

Data broadcast is an efficient way for information dissemination in wireless mobile environments, and on-demand XML data broadcast is one of the most important research issues in this area. Indexing XML data on wireless channel is critical for this issue since energy management is very important in wireless mobile environments. Previous works have focused on air index schemes for single path queries. In this paper, we propose a novel air index scheme that builds concise air indexes for twig queries in on-demand XML data broadcast. We adopt the Document Tree structure as the basic air index structure for twig queries and propose to prune redundant structures of the basic Document Tree indexes to reduce the energy consumption. Then we propose to combine all the pruned indexes into one which can eliminate structure redundancy among the indexes to further reduce the energy consumption. Our preliminary experiments show that our air index scheme is very effective and efficient, as it builds concise air indexes and supports twig queries without losing any precision.

Qin, Yongrui; Sun, Weiwei; Zhang, Zhuoyao; Yu, Ping; He, Zhenying; Chen, Weiyu

486

Alignment-free supervised classification of metagenomes by recursive SVM  

PubMed Central

Background Comparison and classification of metagenome samples is one of the major tasks in the study of microbial communities of natural environments or niches on human bodies. Bioinformatics methods play important roles on this task, including 16S rRNA gene analysis and some alignment-based or alignment-free methods on metagenomic data. Alignment-free methods have the advantage of not depending on known genome annotations and therefore have high potential in studying complicated microbiomes. However, the existing alignment-free methods are all based on unsupervised learning strategy (e.g., PCA or hierarchical clustering). These types of methods are powerful in revealing major similarities and grouping relations between microbiome samples, but cannot be applied for discriminating predefined classes of interest which might not be the dominating assortment in the data. Supervised classification is needed in the latter scenario, with the goal of classifying samples into predefined classes and finding the features that can discriminate the classes. The effectiveness of supervised classification with alignment-based features on metagenomic data have been shown in some recent studies. The application of alignment-free supervised classification methods on metagenome data has not been well explored yet. Results We developed a method for this task using k-tuple frequencies as features counted directly from metagenome short reads and the R-SVM (Recursive SVM) for feature selection and classification. We tested our method on a simulation dataset, a real dataset composed of several known genomes, and a real metagenome NGS short reads dataset. Experiments on simulated data showed that the method can classify the classes almost perfectly and can recover major sequence signatures that distinguish the two classes. On the real human gut metagenome data, the method can discriminate samples of inflammatory bowel disease (IBD) patients from control samples with high accuracy, which cannot be separated when comparing the samples with unsupervised clustering approaches. Conclusions The proposed alignment-free supervised classification method can perform well in discriminating of metagenomic samples of predefined classes and in selecting characteristic sequence features for the discrimination. This study shows as an example on the feasibility of using metagenome sequence features of microbiomes on human bodies to study specific human health conditions using supervised machine learning methods.

2013-01-01

487

Recursive algorithms for two-dimensional smoothing using bicubic hermite polynomial  

NASA Technical Reports Server (NTRS)

It is noted that in the past, smoothing splines originated from approximation theory have been successfully applied to data filtering and image smoothing problems. Even though the nonrecursive technique of smoothing splines gives an optimal solution, the amount of computation increases rapidly with the size of the two-dimensional data. A derivation is presented here of quarter-plane filtering algorithms that provide smoothed estimates of function values and their derivatives by fitting two-dimensional smoothing splines in a recursive manner. The derivation procedure sheds light on specific problems encountered in two-dimensional filtering problems. What is more, the amount of computation for this recursive processor increases only linearly with the size of the two-dimensional data. Because of certain approximations introduced in its derivation, this recursive processor becomes suboptimal.

Kim, C. S.; Shen, C. N.

1981-01-01

488

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

PubMed

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

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

2013-12-17

489

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

USGS Publications Warehouse

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

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

2009-01-01

490

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

PubMed Central

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

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

2011-01-01

491

Simplified recursive algorithm for Wigner 3j and 6j symbols  

SciTech Connect

We present a highly accurate, {ital ab initio} recursive algorithm for evaluating the Wigner 3j and 6j symbols. Our method makes use of two-term, nonlinear recurrence relations that are obtained from the standard three-term recurrence relations satisfied by these quantities. The use of two-term recurrence relations eliminates the need for rescaling of iterates to control numerical overflows and thereby simplifies the widely used recursive algorithm of Schulten and Gordon. {copyright} {ital 1998} {ital The American Physical Society}

Luscombe, J.H. [Department of Physics, Naval Postgraduate School, Monterey, California 93943 (United States)] [Department of Physics, Naval Postgraduate School, Monterey, California 93943 (United States); Luban, M. [Ames Laboratory and Department of Physics and Astronomy, Iowa State University, Ames, Iowa 50011 (United States)] [Ames Laboratory and Department of Physics and Astronomy, Iowa State University, Ames, Iowa 50011 (United States)

1998-06-01

492

Theory of concave gratings based on a recursive definition of facet positions.  

PubMed

A general theory for concave gratings is presented that is based on a recursion formula for the facet positions and that differs from previous theories that are based on a power-series expansion of the light path function. In the recursion formula approach the facet positions are determined from a numerical solution for the roots of two constraint functions. Facet positions are determined in sequence, starting from the grating pole. One constraint function may be chosen to give a stigmatic point. A variety of grating designs are discussed, including a design that cannot be generated with the power-series approach. PMID:21127601

McGreer, K A

1996-10-20

493

High-rate systematic recursive convolutional encoders: minimal trellis and code search  

NASA Astrophysics Data System (ADS)

We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. Douillard and Berrou showed that, despite its complexity, the construction of high-rate turbo codes by means of high-rate constituent encoders is advantageous over the construction based on puncturing rate-1/2 constituent encoders. To reduce the decoding complexity of high-rate codes, we introduce the construction of the minimal trellis for a systematic recursive convolutional encoding matrix. A code search is conducted and examples are provided which indicate that a more finely grained decoding complexity-error performance trade-off is obtained.

Benchimol, Isaac; Pimentel, Cecilio; Souza, Richard Demo; Uchôa-Filho, Bartolomeu F.

2012-12-01

494

Kalman filtering, smoothing, and recursive robot arm forward and inverse dynamics  

NASA Technical Reports Server (NTRS)

The recursive difference equations of Kalman filtering and Bryson-Frazier fixed time-interval smoothing, arising in the state estimation theory for linear state space systems, are used here to solve problems of serial manipulator inverse and forward dynamics. The configuration analyzed is that of a joint connected N-link serial manipulator attached to an immobile base. The equivalence between the filtering and smoothing techniques from state estimation theory and recursive robot dynamics methods is demonstrated. Several areas for future research are suggested.

Rodriguez, Guillermo

1987-01-01

495

Polarization demultiplexing by recursive least squares constant modulus algorithm based on QR decomposition  

NASA Astrophysics Data System (ADS)

Recursive least squares constant modulus algorithm based on QR decomposition (QR-RLS-CMA) is first proposed as the polarization demultiplexing method. We compare its performance with the stochastic gradient descent constant modulus algorithm (SGD-CMA) and the recursive least squares constant modulus algorithm (RLS-CMA) in a polarization-division-multiplexing system with coherent detection. It is demonstrated that QR-RLS-CMA is an efficient demultiplexing algorithm which can avoid the problem of step-length choice in SGD-CMA. Meanwhile, it also has better symbol error rate (SER) performance and more stable convergence property.

Ling, Zhao; Yeling, Wang; Guijun, Hu; Yunpeng, Cui; Jian, Shi; Li, Li

2013-07-01

496

Theory of concave gratings based on a recursive definition of facet positions  

NASA Astrophysics Data System (ADS)

A general theory for concave gratings is presented that is based on a recursion formula for the facet positions and that differs from previous theories that are based on a power-series expansion of the light path function. In the recursion formula approach the facet positions are determined from a numerical solution for the roots of two constraint functions. Facet positions are determined in sequence, starting from the grating pole. One constraint function may be chosen to give a stigmatic point. A variety of grating designs are discussed, including a design that cannot be generated with the power-series approach.

McGreer, K. A.

1996-10-01

497

ISS Update: Suitport  

NASA Video Gallery

ISS Update commentator Lynnette Madison interviews Mallory Jennings, Suitport Human Testing Lead, about making spacewalks easier and more efficient with the Suitport. Questions? Ask us on Twitter @...

498

Bifurcating Pulsed Neural Networks, Chaotic Neural Networks and Parametric Recursions: Conciliating Different Frameworks in Neuro-Like Computing  

Microsoft Academic Search

This paper addresses the concept of parametric recursions in the context of neuro-like architectures and relates it to different classes of neural networks, including pulsed models and chaotic neural networks. It also addresses the contrast between the dynamical states exhibited by networks of parametric recursive elements and the fixed point attractors used in traditional neural networks, as well as presents

Emílio Del Moral Hernandez

2000-01-01

499

Shallow and deep impurity levels in multivalley semiconductors: A Green-function study of silicon by the recursion method  

Microsoft Academic Search

Shallow and deep impurity levels in silicon are studied by a single Green-function formalism based on the recursion method. The ability of this method to include arbitrary-range potentials without increasing the computational effort is illustrated. We first show that the recursion method accurately reproduces the results of the model of Hjalmarson et al. [Phys. Rev. Lett. 44, 810 (1980)] when

Dieter J. Lohrmann; Lorenzo Resca; Giuseppe Pastori Parravicini; Ronald D. Graft

1989-01-01

500