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

View update translation for XML Iovka Boneva  

E-print Network

View update translation for XML Iovka Boneva University Lille 1 Benoît Groz University Lille 1 Staworko University Lille 3 ABSTRACT We study the problem of update translation for views on XML documents update program that translates the view update without side effects on the view. Additionally, we require

Paris-Sud XI, Université de

2

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

E-print Network

Reengineering, Reverse Engineering, Software Reuse, Revision Recognition, XML-technology, Scien- tific Computing. Fundamentally, the user inter- face programmer rarely has the mathematical background to understand the complex changes that take place in nu- meric software packages as they are revised. Developers of numeric software

Petzold, Linda R.

3

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.

4

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

5

ModelicaXML A Modelica XML representation  

E-print Network

ModelicaXML ModelicaXML Applications Problems with XML Semantic Web Languages Conclusions and Future Work documentation All these utilities need easy access to the structure of the language should interoperate. #12 accessible from any programming language be easy to transform, query and manipulate support validation XML

Zhao, Yuxiao

6

XML under the Hood.  

ERIC Educational Resources Information Center

Discusses XML (extensible markup language), particularly as it relates to libraries. Topics include organizing information; cataloging; metadata; similarities to HTML; organizations dealing with XML; making XML useful; a history of XML; the semantic Web; related technologies; XML at the Library of Congress; and its role in improving the

Scharf, David

2002-01-01

7

On recursion  

PubMed Central

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

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

2014-01-01

8

Semantically Interoperable XML Data  

PubMed Central

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

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

2013-01-01

9

Semantically Interoperable XML Data.  

PubMed

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

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

2013-09-01

10

The XML Benchmark Project  

Microsoft Academic Search

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

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

2001-01-01

11

Rule-based XML  

Microsoft Academic Search

Legal contracts and litigation documents common to the American legal system were encoded in the eXtensible Markup Language (XML). XML also represents rules about the contracts and litigation procedure. In addition to an expert system tool that allows one to make inferences with that engine, a Graphical User Interface (GUI) generates the XML representing the rules. A rulebase is developed

Go Eguchi; Laurence L. Leff

2002-01-01

12

UNDERWATER PHOTOGRAMMETRY AND XML BASED DOCUMENTATION SYSTEM  

E-print Network

KEYWORDS: Archaeology, GIS, Underwater Photogrammetry, Internet, Multimedia, Updating, Visualization with experts of the investigated domain (here underwater archaeology) in order to build a relevant data modelUNDERWATER PHOTOGRAMMETRY AND XML BASED DOCUMENTATION SYSTEM: The case of the 'Grand Ribaud F

Paris-Sud XI, Université de

13

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

14

Effective Schema Conversion between XML  

E-print Network

XML Query SQL XML doc XML doc XML doc 2 1 4 RDB Knowledge book> 10 >XML book> .... 3 query processing query relaxation CPI #12;Difficulties No 1-to-1 mapping Set (a author gender (M|F) #REQUIRED married (Y|N) #IMPLIED> Cardinality constraint book (title

Lee, Dongwon

15

XML: A Publisher's Perspective.  

ERIC Educational Resources Information Center

Explains eXtensible Markup Language (XML) and describes how Dow Jones Interactive is using it to improve the news-gathering and dissemination process through intranets and the World Wide Web. Discusses benefits of using XML, the relationship to HyperText Markup Language (HTML), lack of available software tools and industry support, and future

Andrews, Timothy M.

1999-01-01

16

Fragmentation of XML Documents  

Microsoft Academic Search

The world-wide web (WWW) is often considered to be the world's largest database and the eXtensible Markup Language (XML) is then considered to provide its datamodel. Adopting this view we have to deal with a distributed database. This raises the question, how to obtain a suitable distribution design for XML documents. In this paper horizontal and vertical fragmentation techniques are

Hui Ma; Klaus-dieter Schewe

2003-01-01

17

Developpement Web -XML, DOM, XHTML Developpement Web -XML, DOM, XHTML  

E-print Network

D´eveloppement Web - XML, DOM, XHTML D´eveloppement Web - XML, DOM, XHTML Jean-Michel Richer jean-michel.richer@univ-angers.fr http://www.info.univ-angers.fr/pub/richer 2009 1 / 87 #12;D´eveloppement Web - XML, DOM, XHTML Plan Javascript 2 / 87 #12;D´eveloppement Web - XML, DOM, XHTML Rappels SGML, XML, XSL Qu'est ce que SGML

Richer, Jean-Michel

18

Localizing XML Documents through XSLT  

Microsoft Academic Search

Existing eorts on XML internationalization and lo- calization have been focusing on the contents of XML documents instead of on the meta presentations such as tags and attributes. Although XML standard allows the use of unicode throughout a document including the meta level presentations, most tags and attributes of XML documents are still defined in English, which makes it dicult

Yijun Yu; Jianguo Lu; Jing-hao Xue; Yi Zhang; Weiwei Sun

2003-01-01

19

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

20

Mental models of recursion: investigating students' understanding of recursion  

Microsoft Academic Search

Mental models of recursion provide some idea into a student's understanding of recursion. However there has been concern regarding whether viable trace mental models of recursion show students' true understanding of recursion. We have conducted an investigation to further examine the understanding of recursion of students with viable trace mental models. The investigation looked at students' understanding of the termination

Tamarisk Lurlyn Scholtz; Ian Sanders

2010-01-01

21

Keys for XML  

Microsoft Academic Search

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

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

2001-01-01

22

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.

23

Guarded recursive datatype constructors  

Microsoft Academic Search

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

Hongwei Xi; Chiyan Chen; Gang Chen

2003-01-01

24

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

25

Recursive inverse factorization.  

PubMed

A recursive algorithm for the inverse factorization S(-1)=ZZ(*) of Hermitian positive definite matrices S is proposed. The inverse factorization is based on iterative refinement [A.M.N. Niklasson, Phys. Rev. B 70, 193102 (2004)] combined with a recursive decomposition of S. As the computational kernel is matrix-matrix multiplication, the algorithm can be parallelized and the computational effort increases linearly with system size for systems with sufficiently sparse matrices. Recent advances in network theory are used to find appropriate recursive decompositions. We show that optimization of the so-called network modularity results in an improved partitioning compared to other approaches. In particular, when the recursive inverse factorization is applied to overlap matrices of irregularly structured three-dimensional molecules. PMID:18345875

Rubensson, Emanuel H; Bock, Nicolas; Holmstrm, Erik; Niklasson, Anders M N

2008-03-14

26

Prosody and recursion  

E-print Network

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

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

2005-01-01

27

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

E-print Network

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

Lyuu, Yuh-Dauh

28

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

Martins, Maurcio Dias

2012-01-01

29

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

30

Querying XML streams  

Microsoft Academic Search

Efficient querying of XML streams will be one of the fundamental features of next-generation information sys- tems. In this paper we propose the TurboXPath path proces- sor, which accepts a language equivalent to a subset of the for-let-where constructs of XQuery over a single document. TurboXPath can be extended to provide full XQuery support or used to augment federated database

Vanja Josifovski; Marcus Fontoura; Attila Barta

2005-01-01

31

Reconsidering recursion in syntactic theory  

Microsoft Academic Search

This paper considers the role of recursion in syntactic theory, and three particular aspects of this broad topic are addressed. The use of recursive devices in formal grammars in the 1950s is summarised, and the work of Bar-Hillel and Chomsky from this period is analysed in some detail. Having established this historical context, the role of recursive definitions within the

Marcus Tomalin

2007-01-01

32

RQL: A Recursive Query Language  

Microsoft Academic Search

Different classes of recursive queries in the relational databases are identified. It is shown that existing proposals to extend the relational query languages are either not powerful enough to express queries in many of these classes or use nonfirst normal form constructs. RQL, a recursive database query language that can be used to express recursive queries on all the classes

Rafiul Ahad; Bing Yao

1993-01-01

33

6.5. THE RECURSION THEOREM 417 6.5 The Recursion Theorem  

E-print Network

6.5. THE RECURSION THEOREM 417 6.5 The Recursion Theorem The recursion Theorem, due to Kleene, is a fundamental result in recursion theory. Theorem 6.5.1 (Recursion Theorem, Version 1) Let 0, 1, . . . be any ac such that n = f(n). The recursion Theorem can be strengthened as follows. Theorem 6.5.2 (Recursion Theorem

Gallier, Jean

34

Recursive heuristic classification  

NASA Technical Reports Server (NTRS)

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

Wilkins, David C.

1994-01-01

35

The Recursion . . . Extended Rice . . .  

E-print Network

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

Gallier, Jean

36

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; Jrme Vouillon; Benjamin C. Pierce

2000-01-01

37

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

38

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

39

XML Prefiltering as a String Matching Problem  

Microsoft Academic Search

We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword search in flat strings into the second dimension, to navigate in tree structured data. We consider the important XML data man- agement task of prefiltering XML documents (also called XML projection) as an application

Christoph Koch; Stefanie Scherzinger; Michael Schmidt

2008-01-01

40

Recursive Distributed Representations  

Microsoft Academic Search

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

Jordan B. Pollack

1990-01-01

41

Recursive Microstates Model  

NSDL National Science Digital Library

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

Christian, Wolfgang; Salagaram, Trisha; Chetty, Nithaya

2011-08-08

42

Deriving Ontologies from XML Schema  

E-print Network

In this paper, we present a method and a tool for deriving a skeleton of an ontology from XML schema files. We first recall what an is ontology and its relationships with XML schemas. Next, we focus on ontology building methodology and associated tool requirements. Then, we introduce Janus, a tool for building an ontology from various XML schemas in a given domain. We summarize the main features of Janus and illustrate its functionalities through a simple example. Finally, we compare our approach to other existing ontology building tools.

Bedini, Ivan; Nguyen, Benjamin

2010-01-01

43

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

E-print Network

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

Mousavi, Mohammad

44

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

45

Recursive Objects--An Object Oriented Presentation of Recursion  

ERIC Educational Resources Information Center

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

Sher, David B.

2004-01-01

46

Decidability Properties of Recursive Types  

Microsoft Academic Search

In this paper we study decision problems and invertibility for two notions of equivalence of recursive types. In particular, for re- cursive types presented by means of a recursion operator , we describe an algorithm showing that the natural equivalence generated by finitely many steps of folding and unfolding of -types is decidable. For recur- sive types presented by finite

Felice Cardone; Mario Coppo

2003-01-01

47

XMark: A Benchmark for XML Data Management  

Microsoft Academic Search

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

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

2002-01-01

48

An XML Adoption Framework for Electronic Business  

Microsoft Academic Search

One of the recent phenomena information systems (IS) practitioners are currently facing in their continuous process of adopting new technology is the utilization of Extensible Markup Language (XML). In this paper we propose an XML adoption framework, a corresponding adoption space model, and a probit model of technology diffusion to examine the decision of adopting XML-based applications in the context

Andrew N. K. Chen; Ryan C. Labrie; Benjamin B. M. Shao

2003-01-01

49

A distributed editing environment for XML Claude Pasquier and Laurent Th ery  

E-print Network

document is typically a serialization of a tree with every node and leaf tagged. It is a convenient user on two essential aspects: the modelization of data in a tree like structure and the separation between, they are serialized in XML and transmitted to a server which applies them to the document and broad- casts updates

Recanati, Catherine

50

A distributed editing environment for XML Claude Pasquier and Laurent Thery  

E-print Network

document is typically a serialization of a tree with every node and leaf tagged. It is a convenient user essential aspects: the modelization of data in a tree like structure and the separation between, they are serialized in XML and transmitted to a server which applies them to the document and broad- casts updates

Paris-Sud XI, Université de

51

XML: a very brief introduction  

E-print Network

CDATA #FIXED "TITLE STATEMENT" obsolete CDATA #FIXED "no" repeatable CDAT #FIXED "no" i1 (i1-0 | i1-1) #REQUIRED i2 (i2-0 | i2-1 | i2-2 | i2-3 | i2-4 | i2-5 | i2-6 | i2-7 | i2-8 | i2-9) #REQUIRED > LCs MARC 245...? Examples Q & A Its an acronym soup ... DC PICS CSS VRA DOM XML Schema MARC XHTML DTD EAD HTML XSLT TEI SGML XSL RDF W3C XML some of the ingredients XML: What is it? eXtensible Markup Language Language? conveys meaning -- provides...

Miller, John S.

2004-12-21

52

Recursive adaptive frame integration limited  

NASA Astrophysics Data System (ADS)

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

Rafailov, Michael K.

2006-05-01

53

Filtering XPath expressions for XML access control  

Microsoft Academic Search

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

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

2004-01-01

54

Flexible authentication of XML documents  

Microsoft Academic Search

XML is increasingly becoming the format of choice for information exchange, in critical areas such as government, finance, healthcare and law, where integrity is of the essence. As this trend grows, one can expect that documents (or collections thereof) may get quite large, and clients may wish to query for specific segments of these documents. In critical applications, clients must

Premkumar T. Devanbu; Michael Gertz; April Kwong; Charles U. Martel; Glen Nuckolls; Stuart G. Stubblebine

2001-01-01

55

Speed up of XML parsers with PHP language implementation  

NASA Astrophysics Data System (ADS)

In this paper, authors introduce PHP5's XML implementation and show how to read, parse, and write a short and uncomplicated XML file using Simple XML in a PHP environment. The possibilities for mutual work of PHP5 language and XML standard are described. The details of parsing process with Simple XML are also cleared. A practical project PHP-XML-MySQL presents the advantages of XML implementation in PHP modules. This approach allows comparatively simple search of XML hierarchical data by means of PHP software tools. The proposed project includes database, which can be extended with new data and new XML parsing functions.

Georgiev, Bozhidar; Georgieva, Adriana

2012-11-01

56

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

57

Real-time FPGA implementation of recursive wavelet packet transform  

NASA Astrophysics Data System (ADS)

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

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

2012-06-01

58

Efficient Evaluation of Regular Path Expressions on Streaming XML Data  

Microsoft Academic Search

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

Zachary Ives; Alon Levy; Daniel Weld

2000-01-01

59

XML technology planning database : lessons learned  

NASA Technical Reports Server (NTRS)

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

Some, Raphael R.; Neff, Jon M.

2005-01-01

60

Quantization based Recursive Importance Sampling Noufel Frikha  

E-print Network

, importance sampling and stratified sampling. Adaptive variance reduction methods have been recentlyQuantization based Recursive Importance Sampling Noufel Frikha Abass Sagna September 19, 2011 Abstract We investigate in this paper an alternative method to simulation based recursive importance

Paris-Sud XI, Université de

61

Representing UML Snowflake Diagram from Integrating XML Data Using XML Schema  

Microsoft Academic Search

We present a UML conceptual-level integration framework for supporting OLAP operations on diverse XML data sources. Our integration framework takes advantage of the constructs and relationships existing within XML schemas. Two processes are involved in our integration framework. The first one is to convert XML schemas into UML class diagrams. The second is to build a multidimensional model from the

Yu Li; An Aijun

2005-01-01

62

A Conceptual Model for XML  

Microsoft Academic Search

\\u000a We claim that document engineering (the systematic development of document presentations, representations and document tools)\\u000a should be firmly based on explicit, formal and abstract document models. This precept is well accepted and practiced in, for\\u000a example, the database community but it is, apparently, less accepted in the XML community. We want to change this position.\\u000a \\u000a \\u000a As a first step in

Anne Brggemann-klein; Derick Wood

2000-01-01

63

XML Schema Representation of DICOM Structured Reporting  

PubMed Central

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

Lee, K. P.; Hu, Jingkun

2003-01-01

64

RECURSIVE VALUATION AND SENTIMENTS Lars Peter Hansen  

E-print Network

RECURSIVE VALUATION AND SENTIMENTS Lars Peter Hansen Bendheim Lectures, Princeton University 1 / 32 #12;RECURSIVE VALUATION AND SENTIMENTS ABSTRACT Expectations and uncertainty about growth rates-looking nature of the recursive utility model provides an additional channel for which sentiments about

Hansen, Lars Peter

65

Larger context Syntactic recursion is semantic  

E-print Network

not syntax-specific References Language syntax and human planning abilities seem disparate from external view planning, i-intentions, and we-intentions (Searle, 1990). What evidence do we have that language (or syntax Planning: recursion not species-specific Human recursion not syntax-specific References Recursion

Bozsahin, Cem

66

The counting recursive digital filter.  

NASA Technical Reports Server (NTRS)

Analysis of the bit-level operations involved in the convolutions realizing recursive digital filters leads to hardware designs of such filters based on the operation of counting. Various designs realizing both the canonic and 'direct' forms are presented with particular emphasis on low-cost low-speed high-flexibility machines.

Zohar, S.

1973-01-01

67

Recursive Video Matting and Denoising  

Microsoft Academic Search

In this paper, we propose a video matting method with simultaneous noise reduction based on the Unscented Kalman filter (UKF). This recursive approach extracts the alpha mattes and denoised foregrounds from noisy videos, in a unified framework. No assumptions are made about the type of motion of the camera or of the foreground object in the video. Moreover, user-specified trimaps

Sahana M. Prabhu; A. N. Rajagopalan

2010-01-01

68

Compressing Aviation Data in XML Format  

NASA Technical Reports Server (NTRS)

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

Patel, Hemil; Lau, Derek; Kulkarni, Deepak

2003-01-01

69

Fancy Types for XML: Benjamin C. Pierce  

E-print Network

Fancy Types for XML: Benjamin C. Pierce University of Pennsylvania meeting, Edinburgh,April 2005 #12;Fancy Types for XML: Friend or Foe? Benjamin C. Pierce University of Pennsylvania matching are both very useful, in different situations · it appears [cf. Benzaken et al 2005, Gapeyev&Pierce

Pierce, Benjamin C.

70

XML for Video Games CS 297 Report  

E-print Network

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

Pollett, Chris

71

TIJAH: Embracing IR Methods in XML Databases  

Microsoft Academic Search

This paper discusses our participation in INEX (the Initiative for the Evaluation of XML Retrieval) using the TIJAH XML-IR system. TIJAH's system design follows a 'standard' layered database architecture, carefully separating the conceptual, logical and physical levels. At the conceptual level, we classify the INEX XPath-based query expressions into three dierent query patterns. For each pattern, we present its mapping

Johan A. List; Vojkan Mihajlovic; Georgina Ramrez; Arjen P. De Vries; Djoerd Hiemstra; Henk Ernst Blok

2005-01-01

72

ONYX: Towards an Internet-Scale XML  

E-print Network

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

Loo, Boon Thau

73

Experincia de Utilizao de XML no SMS  

E-print Network

Experiência de Utilização de XML no SMS Roberto Hiroshi Higa1 Christian Baudet2 Esther Manoela de Kit. #12;Experiência de Utilização de XML no SMS2 A comunidade científica de biologia molecular e

Neshich, Goran

74

A Dynamic SNMP to XML Proxy Solution  

Microsoft Academic Search

The network management area has some proposals to use XML to encode information models and managed object instances. In this paper we present a solution to dynamically create SNMP to XML proxies using a SAX parser and the translation facilities from the libsmi tools. We also present an analysis system that uses the management information provided by the proxies in

Ricardo Neisse; Lisandro Zambenedetti Granville; Diego Osrio Ballv; Maria Janilce B. Almeida; Liane Margarida Rockenbach Tarouco

2003-01-01

75

Visibly pushdown automata for streaming XML  

Microsoft Academic Search

We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown au- tomata where the input determines the stack operation, and XML documents are naturally visibly pushdown with the Vpa pushing onto the stack on open-tags and popping the stack on close-tags. In this paper we demonstrate the power and ease visibly pushdown automata give

Viraj Kumar; P. Madhusudan; Mahesh Viswanathan

2007-01-01

76

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

77

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

78

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

79

A Quantitative Summary of XML Structures , Bingsheng He2  

E-print Network

is that it may provide xml researchers (i.e. human) insights on xml documents. The advantage of quantitativeA Quantitative Summary of XML Structures Zi Lin1 , Bingsheng He2 and Byron Choi1 1 Nanyang a quantitative summary of an xml structure. By using our approach, we illustrate that some popular real

Choi, Byron "Koon Kau"

80

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

81

An XML query engine for network-bound data  

Microsoft Academic Search

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

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

2002-01-01

82

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

83

Development of SNMP-XML translator and gateway for XML-based integrated network management  

Microsoft Academic Search

The research objective of our work is to develop a SNMP MIB to XML translation algorithm and to implement an SNMP-XML gateway using this algorithm. The gateway is used to transfer management information between an XML-based manager and SNMP-based agents. SNMP is widely used for Internet management, but SNMP is insufficient to manage continuously expanding networks because of constraints in

Jeong-hyuk Yoon; Hong-taek Ju; James W. Hong

2003-01-01

84

Capturing Chemistry in XML/CML  

E-print Network

Chemical Markup Language (CML) is an XML-conformant Schema that describes molecules, spectra, reactions, and computational chemistry. It is capable of capturing the chemistry in a variety of current publications and is becoming adopted by many...

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

85

XML Fragments Extended with Database Operators  

Microsoft Academic Search

XML documents represent a middle range between unstructured data such as textual documents and fully structured data encoded in databases. Typically, information retrieval techniques are used to support search on the \\

Yosi Mass; Dafna Sheinwald; Benjamin Sznajder; Sivan Yogev

2007-01-01

86

SYSTRAN New Generation: The XML Translation Workflow  

E-print Network

SYSTRAN New Generation: The XML Translation Workflow Jean Senellart Christian Boitet Laurent Romary Customization of Machine Translation (MT) is a prerequisite for corporations to adopt the technology called the SYSTRAN Translation Stylesheet, this method is coherent with the current evolution

Paris-Sud XI, Université de

87

MedlinePlus XML Data Sources  

MedlinePLUS

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

88

Deploy XML-based network management approach  

Microsoft Academic Search

The trend of Internet-working applications has created a demand for a more decentralized yet dynamic approach to the network and distribution systems. To deploy an XML-based network, with its core technologies, presents an effective solution to the network and distribution systems management task. While SNMP falls short in meeting the challenges and the dynamic changes on the network, XML-based technologies

J. Bih

2005-01-01

89

Towards XML and SNMP Integrated Network Management  

Microsoft Academic Search

Abstract SNMP has been the dominating management,framework,for managing,networks and systems on the IP networks. Recently, XML-based network management has been proposed as an alternative orto complement ,the shortcomings ,of SNMP-based network management. ,This paper examine the weaknesses ,of SNMP-based network ,management ,and ,proposes ,several approaches ,to compensate,the shortcoming ,of SNMP using XML technologies. We also ,present ways to fully take

Towards Xml; Mi-jung Choi; Hong-taek Ju; James W. Hong

90

XML data compression in web publishing  

NASA Astrophysics Data System (ADS)

XML is widely used in various document formats on the web. But it has caused negative impacts such as expensive document distribution time over the web, and long content jumping and rendering delay, especially on mobile devices. Hence we proposed a Schema-based efficient queryable XML compressor, called XTrim, which significantly improves compression ratio by utilizing optimized information in XML Schema while supporting efficient queries. Firstly, XTrim draws structure information from XML document and corresponding XML Schema. Then a novel technique is used to transform the XML tree-like structure into a compact indexed form to support efficient queries. At the same time, text values are obtained, and a language-based text trim method (LTT) that facilitates language-specific text compressors is adopted to reduce the size of text values in various languages. In LTT a word composition detection method is proposed to better process text in non-Latin languages. To evaluate the performance of XTrim, we have implemented a compressor and query engine prototype. Via extensive experiments, results show that XTrim outperforms XMill and existing queryable alternatives in terms of compression ratio, as well as the query efficiency. By applying XTrim to documents, the storage space can save up to 30% and the content jumping and rendering delay is reduced to less than 100ms from 4 seconds.

Qiu, Ruiheng; Hu, Wei; Tang, Zhi; Lu, Xiaoqing; Zhang, Lei

2012-03-01

91

XML Flight/Ground Data Dictionary Management  

NASA Technical Reports Server (NTRS)

A computer program generates Extensible Markup Language (XML) files that effect coupling between the command- and telemetry-handling software running aboard a spacecraft and the corresponding software running in ground support systems. The XML files are produced by use of information from the flight software and from flight-system engineering. The XML files are converted to legacy ground-system data formats for command and telemetry, transformed into Web-based and printed documentation, and used in developing new ground-system data-handling software. Previously, the information about telemetry and command was scattered in various paper documents that were not synchronized. The process of searching and reading the documents was time-consuming and introduced errors. In contrast, the XML files contain all of the information in one place. XML structures can evolve in such a manner as to enable the addition, to the XML files, of the metadata necessary to track the changes and the associated documentation. The use of this software has reduced the extent of manual operations in developing a ground data system, thereby saving considerable time and removing errors that previously arose in the translation and transcription of software information from the flight to the ground system.

Wright, Jesse; Wiklow, Colette

2007-01-01

92

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

E-print Network

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

Lyuu, Yuh-Dauh

93

Decidability and Recursive Languages Let L ( -{ })  

E-print Network

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

Lyuu, Yuh-Dauh

94

Recursive Turtle Programs and Iterated Affine Transformations  

E-print Network

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

Schaefer, Scott

95

Relatively Recursive Reals and Real Functions  

Microsoft Academic Search

Intuitively, a real number is recursive if we can get as accurate an approximation as we like, using a mechanical procedure such as a Turing machine. A real function is recursive if its value at a point x in its domain can be approximated effectively given an approximation to x. However, since there are only countably many Turing machines, there

Chun-kuen Ho

1999-01-01

96

Recursive formulation of operational space control  

NASA Technical Reports Server (NTRS)

A recently developed spatial operator algebra approach to modeling and analysis of multibody robotic systems is used to develop O(n) recursive algorithms that compute the operational space mass matrix and the operational space coriolis/centrifugal and gravity terms of an n-link serial manipulator. These algorithms enable an O(n) recursive implementation of operational space control.

Kreutz-Delgado, K.; Jain, A.; Rodriguez, G.

1992-01-01

97

A Fast Recursive Algorithm Molecular Dynamics Simulation  

E-print Network

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

98

Interaction Translation Methods for XML\\/SNMP Gateway  

Microsoft Academic Search

XML-based network management has been proposed as an alternative or to complement SNMP-based network management. But the XML-based network management does not yet provide a method to manage networks equipped with legacy SNMP agents in the integrated management system. This integrated management system must include an XML\\/SNMP gateway, which translates and relays messages between the XML-based manager and the SNMP

Oh Yoon-jung; Hong-taek Ju; Mi-jung Choi; James Won-ki Hong

2002-01-01

99

XML/Update Advanced Data Mining and Applications  

E-print Network

in Geographic Information Systems (ACM SIGSPATIAL GIS 2009):256-265, November 4-6, 2009, Seattle, Washington. 2-Dimensional Index for Cloud Data Management. In Proceedings of the CIKM Workshop on Cloud Data Management (Cloud

100

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

101

SilkRoute: trading between relations and XML  

Microsoft Academic Search

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

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

2000-01-01

102

A Survey in Indexing and Searching XML Documents.  

ERIC Educational Resources Information Center

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

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

2002-01-01

103

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

104

Score Region Algebra: Building a Transparant XML-IR Databases  

Microsoft Academic Search

A unified database framework that will enable better comprehension of ranked XML retrieval is still a challenge in the XML database eld. We propose a logical algebra, named score region algebra, that enables transparent specification of information retrieval (IR) models for XML databases. The transparency is achieved by a possibility to instantiate various retrieval models, using abstract score functions within

Vojkan Mihajlovic; Henk Ernst Blok; Djoerd Hiemstra; Peter M. G. Apers

2005-01-01

105

Storing and querying ordered XML using a relational database system  

Microsoft Academic Search

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

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

2002-01-01

106

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

107

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

108

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

109

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

110

Considering Network Recursion and Bartok's "Fourths"  

E-print Network

Notions of network recursion, as they have been designated in music analyses, may be organized into five categories that range from exact self-similarity to self-dissimilarity. This perspective reveals that Michael ...

Murphy, Scott

2007-09-01

111

Gaussian process based recursive system identification  

NASA Astrophysics Data System (ADS)

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

Prher, Jakub; imandl, Miroslav

2014-12-01

112

Can recursive bisection alone produce routable placements?  

Microsoft Academic Search

This work focuses on congestion-driven placement of standard cells into rows in the fixed-die context. We summarize the state-of-the-art after two decades of research in recursive bisection placement and implement a new placer, called Capo, to empirically study the achievable limits of the approach. From among recently proposed improvements to recursive bisection, Capo incorporates a leading-edge multilevel min-cut partitioner [7],

Andrew E. Caldwell; Andrew B. Kahng; Igor L. Markov

2000-01-01

113

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

114

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

115

Comparative Analysis of XML Compression Technologies  

E-print Network

compres- sion technologies in terms of compression ratio, compression and decompression times, memory important goals at the same time. First, they aim at achieving a good compression ratio and time compared that is able to support efficient evaluation of queries over the data. In our survey of XML

Ng, Wilfred Siu Hung

116

Presentation of XML content using WYSIWYG templates  

E-print Network

content has been an area of research ever since its introduction. We discuss the state of the art in XML content presentation, and then describe a new method for user designed transformation using WYSIWYG templates in HTML, that will allow users to design...

Joarder, Arif

2008-01-01

117

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

118

Shuttle-Data-Tape XML Translator  

NASA Technical Reports Server (NTRS)

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

Barry, Matthew R.; Osborne, Richard N.

2005-01-01

119

XOR -XML Oriented Retrieval Language Shlomo Geva  

E-print Network

unstructured to highly structured documents. The gap between IR and traditional Database approaches is closing. Indeed, many approaches to XML-IR rely on database tech- nology as a back-end system, rather than rely that exists between Information Retrieval and Database Retrieval. On the structured database retrieval side

Tannier, Xavier

120

XOR XML Oriented Retrieval Language Shlomo Geva  

E-print Network

Database approaches is closing. Indeed, many approaches to XML­IR rely on database tech­ nology as a back­ torical divide that exists between Information Retrieval and Database Retrieval. On the structured database retrieval side it is now possible to support highly structured access to documents using XML

Tannier, Xavier

121

Generating Synthetic Complex-Structured XML Data  

Microsoft Academic Search

Synthetically generated data has always been important for evaluating and understanding new ideas in database research. In this paper, we describe a data generator for generating synthetic complex-structured XML data that allows for a high level of control over the characteristics of the generated data. This data generator is certainly not the ultimate solution to the problem of generating synthetic

Ashraf Aboulnaga; Jeffrey F. Naughton; Chun Zhang

2001-01-01

122

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

123

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

124

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

125

Recursive stochastic subspace identification for structural parameter estimation  

NASA Astrophysics Data System (ADS)

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

Chang, C. C.; Li, Z.

2009-03-01

126

A Recursive Method for Calculating Certain Partition Functions.  

ERIC Educational Resources Information Center

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

Woodrum, Luther; And Others

1978-01-01

127

Recursive algorithms for implementing digital image filters.  

PubMed

The B-spline functions are used to develop recursive algorithms for the efficient implementation of two-dimensional linear digital image filters. These filters may be spatially varying. The B-splines are used in a representation of the desired point spread function. We show that this leads to recursive algorithms and hardware implementations which are more efficient than either direct spatial domain filter realizations or FFT implementations. The Z-transform is used to develop a discrete version of Duhamel's theorem. A computer architecture for B-spline image filters is proposed and a complexity analysis and comparison to other approaches is provided. PMID:22516640

Ferrari, L A; Sankar, P V; Shinnaka, S; Sklansky, J

1987-03-01

128

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

129

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

130

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

131

An exponentiation method for XML element retrieval.  

PubMed

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

Wichaiwong, Tanakorn

2014-01-01

132

An Exponentiation Method for XML Element Retrieval  

PubMed Central

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

2014-01-01

133

Internet-based data interchange with XML  

NASA Astrophysics Data System (ADS)

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

Fuerst, Karl; Schmidt, Thomas

2000-12-01

134

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

135

?-dependency for privacy-preserving XML data publishing.  

PubMed

An ever increasing amount of medical data such as electronic health records, is being collected, stored, shared and managed in large online health information systems and electronic medical record systems (EMR) (Williams et al., 2001; Virtanen, 2009; Huang and Liou, 2007) [1-3]. From such rich collections, data is often published in the form of census and statistical data sets for the purpose of knowledge sharing and enabling medical research. This brings with it an increasing need for protecting individual people privacy, and it becomes an issue of great importance especially when information about patients is exposed to the public. While the concept of data privacy has been comprehensively studied for relational data, models and algorithms addressing the distinct differences and complex structure of XML data are yet to be explored. Currently, the common compromise method is to convert private XML data into relational data for publication. This ad hoc approach results in significant loss of useful semantic information previously carried in the private XML data. Health data often has very complex structure, which is best expressed in XML. In fact, XML is the standard format for exchanging (e.g. HL7 version 3(1)) and publishing health information. Lack of means to deal directly with data in XML format is inevitably a serious drawback. In this paper we propose a novel privacy protection model for XML, and an algorithm for implementing this model. We provide general rules, both for transforming a private XML schema into a published XML schema, and for mapping private XML data to the new privacy-protected published XML data. In addition, we propose a new privacy property, ?-dependency, which can be applied to both relational and XML data, and that takes into consideration the hierarchical nature of sensitive data (as opposed to "quasi-identifiers"). Lastly, we provide an implementation of our model, algorithm and privacy property, and perform an experimental analysis, to demonstrate the proposed privacy scheme in practical application. PMID:24518557

Landberg, Anders H; Nguyen, Kinh; Pardede, Eric; Rahayu, J Wenny

2014-08-01

136

Syntax-directed Transformations of XML Streams  

Microsoft Academic Search

We discuss the TransformX framework for syntax-directed transformations of XML streams. In this framework, we define stream transforma- tions as a special form of attributed extended regu- lar tree grammars where all attributes can be eval- uated in a single pass over the input, a necessity in stream processing. In the tradition of tools such as Yacc, the TransformX parser

Stefanie Scherzinger; Alfons Kemper

137

Unordered XML Pattern Matching with Tree Signatures  

Microsoft Academic Search

Abstract: Pavel Zezula, Federica Mandreoli, and Riccardo MartogliaMasaryk University, Brno, Czech Republiczezula@fi.muni.czUniversity of Modena and Reggio Emilia, Modena, Italy{mandreoli.federica,martoglia.riccardo}@unimo.itAbstract. We propose an efficient approach for finding relevant XML data twigs definedby unordered query tree specifications. We use the tree signatures as the index structureand find qualifying patterns through integration of structurally consistent query...

Federica Mandreoli; Riccardo Martoglia; Pavel Zezula

2004-01-01

138

Fast Reachability Test on DAGs for XML  

NASA Astrophysics Data System (ADS)

We propose an efficient algorithm for deciding the reachability between any nodes on XML data represented by connected directed graphs. We develop a technique to reduce the size of the reference table for the reachability test. Using the small table and the standard range labeling method for rooted ordered trees, we show that our algorithm answers almost queries in a constant time preserving the space efficiency and a reasonable preprocessing time.

Nakamura, Yusaku; Maita, Tetsuya; Sakamoto, Hiroshi

139

Efficient XML Interchange in factory automation systems  

Microsoft Academic Search

The advent of Service-Oriented Architecture (SOA) in the automation domain has made possible the cross-layer vertical integration of devices, manufacturing systems and business processes. However, the use of standard web service technologies is not always possible in an industrial environment with high real-time requirements and limited hardware resources due to the overhead connected to XML processing. The work presented in

Rumen Kyusakov; Henrik Makitaavola; Jerker Delsing; Jens Eliasson

2011-01-01

140

EVOLVING THE NARROW LANGUAGE FACULTY: WAS RECURSION THE PIVOTAL STEP?  

Microsoft Academic Search

A recent proposal (Hauser, Chomsky & Fitch, 2002) suggests that the crucial defining property of human language is recursion. In this paper, following a critical analysis of what is meant by the term, I examine three reasons why the recursion-only hypothesis a cannot be correct: (i) recursion is neither unique to language in humans, nor unique to our species, (ii)

ANNA R. PARKER

141

A recursive Meat-axe algorithm Stephen P. Glasby  

E-print Network

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

Glasby, Stephen

142

XML an opportunity for data standards in the geosciences  

NASA Astrophysics Data System (ADS)

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

Houlding, Simon W.

2001-08-01

143

Optimizing Recursive Queries in SQL Carlos Ordonez  

E-print Network

Optimizing Recursive Queries in SQL Carlos Ordonez Teradata, NCR San Diego, CA, USA ABSTRACT for discussion we use graphs. Let G = (V, E) be a directed graph with n vertices and m edges. An edge in E links then there is no corresponding element in the list. Each edge has an associated weight (e.g. distance, capacity or cost). A path

Ordonez, Carlos

144

REUNITE: A Recursive Unicast Approach to Multicast  

Microsoft Academic Search

Abstract We propose a new multicast protocol called REUNITE .T he key idea of REUNITE is to use recursive unicast trees to implement mul- ticast service. REUNITE does not use class D IP addresses. Instead, both group identification and data forwarding are based on unicast IP ad- dresses. Compared with existing IP multicast protocols, REUNITE has sev- eral unique properties.

Ion Stoica; T. S. Eugene Ng; Hui Zhang

2000-01-01

145

Blocked recursive image composition with exclusion zones  

Microsoft Academic Search

Photo collages are a popular and powerful storytelling mechanism. They are often enhanced with background artwork that sets the theme for the story. However, layout algorithms for photo collage creation typically do not take this artwork into account, which can result in collages where photos overlay important artwork elements. To address this, we extend our previous Blocked Recursive Image Composition

Hui Chao; Daniel R. Tretter; Xuemei Zhang; Clayton Brian Atkins

2010-01-01

146

On the design of recursive digital filters  

NASA Technical Reports Server (NTRS)

A change of variables is described which transforms the problem of designing a recursive digital filter to that of approximation by a ratio of polynomials on a finite interval. Some analytic techniques for the design of low-pass filters are presented, illustrating the use of the transformation. Also considered are methods for the design of phase equalizers.

Shenoi, K.; Narasimha, M. J.; Peterson, A. M.

1976-01-01

147

A Recursive Filter for Despeckling SAR Images  

Microsoft Academic Search

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

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

2008-01-01

148

A recursive filter for despeckling SAR images.  

PubMed

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

Subrahmanyam, G R K S; Rajagopalan, A N; Aravind, R

2008-10-01

149

Narrowband recursive filters with error spectrum shaping  

Microsoft Academic Search

Errors due to finite wordlength can in general be quite large in narrowband recursive digital filters. It has been shown that the mean squared roundoff error may be considerably reduced by using a technique known as error spectrum shaping (ESS), which utilizes quantizer feedback. In this paper it is shown that ESS can also significantly reduce the amplitude of zero

Bede Liu

1979-01-01

150

Data Manipulation in an XML-Based Digital Image Library  

ERIC Educational Resources Information Center

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

Chang, Naicheng

2005-01-01

151

Data Quality of Native XML Databases in the Healthcare Domain  

E-print Network

are not foolproof. This report reviews work on data quality in both database and management research areas research works of data quality in relational databases and XML databases but also show how very little Key Words and Phrases: data quality, health care, native XML databases 1. INTRODUCTION This research

North, Siobhán

152

An Efficient Approach to Support Querying Secure Outsourced XML Information  

Microsoft Academic Search

Data security is well-recognized a vital issue in an informa- tion system that is supported in an outsource environment. However, most of conventional XML encryption proposals treat confidential parts of an XML document as whole blocks of text and apply encryption algo- rithms directly on them. As a result, queries involving the encrypted part cannot be efficiently processed. In order

Yin Yang; Ng Wilfred; Ho Lam Lau; James Cheng

2006-01-01

153

The Semantic Web: The Roles of XML and RDF  

Microsoft Academic Search

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

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

2000-01-01

154

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

155

Revolutionary impact of XML on biomedical information interoperability  

Microsoft Academic Search

The use of Extensible Markup Language (XML) to implement data sharing and semantic interoperability in healthcare and life sciences has become ubiquitous in recent years. Because in many areas there was no preexisting data format, XML has been readily embraced and is having a great impact. Biomedical data is very heterogeneous, varying from administrative information to clinical data, and recently

Amnon Shabo; Simona Rabinovici-cohen; Pnina Vortman

2006-01-01

156

Programming Systems Lab, Columbia University XML Universal Event Service  

E-print Network

or multiple sources, and can even notify if a specified event or event pattern has not occurred within a givenProgramming Systems Lab, Columbia University XML Universal Event Service KX: XUES Introduction The XML-based Universal Event Service (XUES) consists of three main services that collectively provide

Kaiser, Gail E.

157

Attribute Grammars for Scalable Query Processing on XML Streams  

Microsoft Academic Search

We introduce the new notion of XML Stream Attribute Grammars (XSAGs). XSAGs are the rst scalable query language for XML streams (running strictly in linear time with bounded memory consumption independent of the size of the stream) that allows for actual data transformations rather than just docu- ment ltering. XSAGs are also relatively easy to use for humans. Moreover, the

Christoph Koch; Stefanie Scherzinger

2003-01-01

158

Fuzzy Duplicate Detection on XML Data Melanie Weis  

E-print Network

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

Weske, Mathias

159

XEDU, A Framework for Developing XML-Based Didactic Resources  

Microsoft Academic Search

Recent educational software applications use Web technologies like XML to improve teaching methods in distance learning environments. Though XML has been already used to implement a high number of didactic resources, specification methodologies to develop these resources are rarely applied. As a consequence, the reuse and maintenance of those resources become a difficult task. This paper emphasises the use of

Flix Buenda; Julio Sahuquillo; J. V. Benlloch; Jos A. Gil; M. Agust; Paloma Daz

2001-01-01

160

XMill: an Efficient Compressor for XML Data Hartmut Liefke \\Lambda  

E-print Network

, with applications in data exchange and archiving, which usually achieves about twice the compression ratio of gzip. By migrating data from other, more space­ efficient formats to XML, the size of the compressed data decreases format. In summary, by converting to XML, one gains both flexibility and efficiency (when compression

Suciu, Dan

161

EquiX-A Search and Query Language for XML.  

ERIC Educational Resources Information Center

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

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

2002-01-01

162

A Typed Text Retrieval Query Language for XML Documents.  

ERIC Educational Resources Information Center

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

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

2002-01-01

163

Distance Education Using XML Technology Senay Kafkas and Zeki Bayram  

E-print Network

of the WWW allows new developments in the way instructors transfer knowledge to their students [2]. A wide a detailed description of the XML files and their schemas used in the system. Sections IV and V provide and tests from instructor PC's in the form of XML documents. At the same time, students ac­ cess the online

Bayram, Zeki

164

Advanced R Programming for Bioinformatics Exercises for session 6: XML.  

E-print Network

to read in the airport locations from the file airportlocation.csv used in session 2, and write out a KML Google Earth installed but do have internet access, you can put your KML file on a website, and write a KML file for that point. 2. Read in the XML file phiSITE767857.xml, which describes promoter

Rice, Ken

165

Advanced R Programming for Bioinformatics. Exercises for session 6: XML.  

E-print Network

to read in the airport locations from the file airportlocations.csv used in session 2, and write out a KML Google Earth installed but do have internet access, you can put your KML file on a website, and write a KML file for that point. 2. Read in the XML file phiSITE767857.xml, which describes promoter

Rice, Ken

166

Student Project Business Process Modeling Using ebXML  

E-print Network

XML?.............................................................................................. 13 2.2. Electronic Business Collaboration to Negotiate, Evaluate, and Execute Electronic Business Processes... 37 3.1. Four-Layer Electronic BusinessStudent Project Business Process Modeling Using ebXML: Case Study Aivaras Pigaga Matr. Nr.: 20726

167

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

168

An XML-Based Protocol for Distributed Event Services  

NASA Technical Reports Server (NTRS)

This viewgraph presentation provides information on the application of an XML (extensible mark-up language)-based protocol to the developing field of distributed processing by way of a computational grid which resembles an electric power grid. XML tags would be used to transmit events between the participants of a transaction, namely, the consumer and the producer of the grid scheme.

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

2001-01-01

169

Score Region Algebra: Building a Transparent XML-IR Database  

E-print Network

Score Region Algebra: Building a Transparent XML-IR Database Vojkan Mihajlovi´c Henk Ernst Blok of information retrieval (IR) models for XML databases. The transparency is achieved by a possibility to instanti, The Netherlands {v.mihajlovic, h.e.blok, d.hiemstra, p.m.g.apers}@utwente.nl ABSTRACT A unified database framework

Hiemstra, Djoerd

170

Adding XML to the MIS Curriculum: Lessons from the Classroom  

ERIC Educational Resources Information Center

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

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

2008-01-01

171

Integrating SNMP agents with XML-based management systems  

Microsoft Academic Search

XML-based network management systems are becoming more and more popular these days. However, it has to be taken into account that there is a broad existing management infrastructure based on non-XML protocols. Today, the most dominant technology in Internet management is based on the SNMP framework. This article presents an approach for seamless integration of management information supplied by SNMP

Klie Torsten; F. Straub

2004-01-01

172

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

173

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

E-print Network

XML 052159104Xc42.xml CU979-Baldwin March 18, 2003 19:50 42 THE RENAISSANCE OF EPISTEMOLOGY luciano floridi The renaissance of epistemology between the two world wars forms a bridge between early modern in epistemology through an anti-metaphysical, naturalist, reaction against the nineteenth-century devel- opment

Floridi, Luciano

174

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

E-print Network

IX-Cubes: Iceberg Cubes for Data Warehousing and OLAP on XML Data Fianny Ming-fei Jian The Chinese is not available. In this paper, we introduce the IX-cube (Iceberg XML cube) over XML data to tackle the problem. We extend OLAP operations to XML data. We also develop efficient approaches to IX-Cube computation

Pei, Jian

175

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

ERIC Educational Resources Information Center

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

Merrill, Paul F.

2005-01-01

176

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

177

Decidability and Recursive Languages Let L ( -{ })  

E-print Network

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

Lyuu, Yuh-Dauh

178

Weighted Laplacians, cocycles and recursion relations  

NASA Astrophysics Data System (ADS)

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

Krasnov, Kirill; Scarinci, Carlos

2013-11-01

179

Robust Recursive H ? DOA Estimation Using Spatial Forward Linear Predictor  

Microsoft Academic Search

This letter deals with robust direction of arrival (DOA) estimation based on the recursive H\\u000a ? algorithm for the forward linear predictor. This recursive H\\u000a ? criterion is different from traditional H\\u000a 2 estimation criterions which minimize the squared prediction error. The forward linear predictor with recursive H\\u000a ? algorithm is a worst case optimization approach, which minimizes the total

Ann-Chen Chang; Chun Hsu; Ing-Jiunn Su

2008-01-01

180

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

181

Syntax-directed Transformations of XML Streams Stefanie Scherzinger,  

E-print Network

Syntax-directed Transformations of XML Streams Stefanie Scherzinger, Alfons Kemper Technische Universit¨at Wien, Vienna, Austria, scherzinger@wit.tuwien.ac.at Technische Universit¨at M¨unchen, Munich

182

XML Schema Computations: Schema Compatibility Testing and Subschema Extraction  

E-print Network

equivalence testing, sub- schema testing and subschema extraction. We have con- ducted experiments on an e of schema files in four formats, which are XSD, DTD, RelaxNG XML (RNG), and RelaxNG compact (RNC), published

Cheung, David Wai-lok

183

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

184

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

185

5Storage and Access Control Policies for XML George Pallis  

E-print Network

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

Pallis, George

186

Fast bilateral filtering using recursive moving sum  

NASA Astrophysics Data System (ADS)

We propose a constant-time algorithm for a bilateral filter. Bilateral filter can be converted into the operation of three-dimensional (3D) convolution. By using recursive moving sum, we can reduce the number of calculations needed to construct a pseudo-Gaussian filter. Applying one-dimensional Gaussian filter to the 3D convolution, we achieved a constant-time bilateral filter. We used a 3-GHz CPU without SIMD instructions, or multi-thread operations. We confirmed our proposed bilateral filter to be processed in constant time. In practical conditions, high PSNR values over 40 dB are obtained.

Igarashi, Masaki; Ikebe, Masayuki; Shimoyama, Sohsuke; Motohisa, Junichi

187

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

188

XML Structural Join Based on Extended Region Coding  

NASA Astrophysics Data System (ADS)

XML has become a standard technology in exchange of a wide variety of data on web and internet for its structure, label, portability and expansibility. To efficiently query XML documents has been the primary urgent task. At the present time, most of XML index and query are based on encoding the XML document tree, so all kinds of XML encoding schemes are proposed, and region coding is the mainstream coding and used most commonly, such as Dietz coding, Li-Moon coding, Zhang coding, Wan coding, etc. The paper proposes an extended region coding based on region coding. Preorder XML document tree, and take preorder numerical orders of a node's all descendants as the region. When carrying out structural join, if preorder numerical order of a node is in this region, structural relation can be ensured. So this extended region coding can help effectively judge structural relation and the XML document tree needn't be traversed. Furthermore, the better structural join algorithms of XML path queries have received considerable attention recently, and some researchers have proposed some fine algorithms to solve the problem. Stack-Tree-Desc algorithm is one of these fine algorithms, it need separately scan ancestor list and descendant list one time to decide ancestor/descendant structural relation, but some unneeded join nodes still be scanned. For this reason, if some element nodes of ancestor list and descendant list which don't need participate in structural join can be jumped, the query efficiency is enhanced. Therefore, based on Stack-Tree-Desc algorithm an improved algorithm which introduces index structure to avoid scanning unwanted nodes, so ordered scanning is unnecessary, the consuming time of query shortens accordingly. And this improved algorithm can quickly judge structural relation based on extended region coding presented in this paper. Experiment is conducted to test the effectiveness of the extended region coding and the Indexed Stack-Tree-Desc algorithm. Experiment results show that the method in this paper is effective.

Yang, YANG; Hai-ge, LI

189

Static Analysis for Event-Based XML Processing  

Microsoft Academic Search

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

Anders Mller

190

The CANopen Markup Language representing fieldbus data with XML  

Microsoft Academic Search

This paper presents the CANopen Markup Language (CoML). CoML is an XML application developed to represent controller area network (CAN) fieldbus system and process data in a generic and platform independent manner. Due to the intrinsic interchangeability of XML structured data, fieldbus data becomes accessible not only by dedicated CoML tools but also by a wide variety of common general

D. Buhler

2000-01-01

191

A Metadata Tool for Retrieval from Heterogeneous Distributed XML Documents  

Microsoft Academic Search

A metadata approach for retrieval from heterogeneous distributed XML documents is given. A prototype system uses distributed\\u000a metadata to generate a GUI data integration tool, for describing mappings between master and local DTDs, by assigning index\\u000a numbers and specifying conversion functions. A DDXMI (Distributed Document XML Metadata Interchange) file is generated based\\u000a on the mappings, and used to translate queries

Young-kwang Nam; Joseph A. Goguen; Guilian Wang

2003-01-01

192

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

193

FIBONACCI'S SEQUENCE OBTAINED BY A GENERAL RECURSIVE FORMULA  

E-print Network

FIBONACCI'S SEQUENCE OBTAINED BY A GENERAL RECURSIVE FORMULA By Ezio Marchi and Gustavo D. Olgu: 612-626-7370 URL: http://www.ima.umn.edu #12;1 FIBONACCI'S SEQUENCE OBTAINED BY A GENERAL RECURSIVE the population grows and the individuals do not die, and the second application is the classical Fibonacci

194

The (Non)Necessity of Recursion in Natural Language Processing  

Microsoft Academic Search

The prima facie unbounded nature of natural language, contrasted with the finite character of our memory and computational resources, is often taken to warrant a recursive language processing mechanism. The widely held distinction between an idealized infinite grammatical competence and the actual finite natural language performance pro- vides further support for a recursive processor. In this paper, I argue that

Morten H. Christiansen

1992-01-01

195

Extended Kalman Filter Using a Kernel Recursive Least Squares Observer  

E-print Network

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

Slatton, Clint

196

Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type  

E-print Network

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

Kågström, Bo

197

The Hausdorff dimension of some snowflake-like recursive constructions  

E-print Network

The Hausdorff dimension of some snowflake-like recursive constructions By S. D. Jacka and J. C Condition (OSC). We present a class of random recursive constructions which resemble snowflake structures occurring phenomena, such as snowflake crystals. Restricting our attention to Rn from now on, in its

Jacka, Saul

198

Proof systems for Hennessy-Milner Logic with recursion  

Microsoft Academic Search

An extension of Hennessy-Milner Logic with recursion is presented. A recursively specified formula will have two standard interpretations: a minimal one and a maximal one. Minimal interpretations of formulas are useful for expressing liveness properties of processes, whereas maximal interpretations are useful for expressing safety properties. We present sound and complete proof systems for both interpretations for when a process

Kim G. Larsen; Aalborg U

199

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

200

Inductive Synthesis of Recursive Logic Programs: Achievements and Prospects  

Microsoft Academic Search

The inductive synthesis of recursive logic programs from incomplete information, such as input\\/output examples, is a challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in general) of logic programs from formal specifications. We first overview past and present achievements, focusing on the techniques that were de- signed specifically for the inductive synthesis of recursive logic programs,

Pierre Flener; Serap Yilmaz

1999-01-01

201

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

202

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, Jrgen A.; Tomov, Borislav

2006-03-01

203

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

204

A WEB-BASED QUIZ DELIVERY SYSTEM USING AJAX (ASYNCHRONOUS JAVASCRIPT AND XML)  

E-print Network

A WEB-BASED QUIZ DELIVERY SYSTEM USING AJAX (ASYNCHRONOUS JAVASCRIPT AND XML) by Rance Scott Harmon delivery system uses Ajax (Asynchronous JavaScript and XML)--a combination of technologies that can make

Dyer, Bill

205

Recursive Stochastic Effects in Valley Hybrid Inflation  

E-print Network

Hybrid Inflation is a two-field model where inflation ends by 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 Ref. [1], these effects are consistently computed. Through an analysis of back-reaction, this method is shown to converge in the valley but points toward an (expected) instability in the waterfall. It is further shown that quasi-stationarity of the auxiliary field distribution breaks down in the case of a short-lived waterfall. It is found 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, it is found that stochastic effects worsen the blue tilt of the curvature perturbations by an order one factor when compared with the usual slow-roll contribution.

Levasseur, Laurence Perreault; Brandenberger, Robert

2013-01-01

206

Post's program and incomplete recursively enumerable sets.  

PubMed Central

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

Harrington, L; Soare, R I

1991-01-01

207

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

208

Structural and semantic aspects of similarity of Document Type Definitions and XML schemas  

Microsoft Academic Search

The natural optimization strategy for XML-to-relational mapping methods is exploitation of similarity of XML data. However, none of the current similarity evaluation approaches is suitable for this purpose. While the key emphasis is currently put on semantic similarity of XML data, the main aspect of XML-to-relational mapping methods is analysis of their structure.In this paper we propose an approach that

Ales Wojnar; Jir Dokulil

2010-01-01

209

A General Framework for Recursive Decompositions of Unitary Quantum Evolutions  

E-print Network

Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been proposed in the literature to express unitary operators as products of simple operators with properties relevant in entanglement dynamics. In this paper, using the concept of grading of a Lie algebra, we cast these decompositions in a unifying scheme and show how new recursive decompositions can be obtained. In particular, we propose a new recursive decomposition of the unitary operator on $N$ qubits, and we give a numerical example.

Mehmet Dagli; Domenico D'Alessandro; Jonathan D. H. Smith

2007-01-26

210

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

211

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 Ytongnon

2009-01-01

212

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

213

Integrating Automation Design Information with XML and Web Services Mika Viinikkala  

E-print Network

Integrating Automation Design Information with XML and Web Services Mika Viinikkala Tampere.kuikka@tut.fi KEYWORDS systems integration, XML, web services, automation design ABSTRACT This paper presents results obtained when applying XML and web service technologies in systems integration in order to improve

214

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

E-print Network

the matching task and ensures timely deliv- ery of published data to all interested subscribers. With XML have been studied for searching useful information from ordinary and probabilistic XML documentsDirect Information Sciences journal homepage: www.elsevier.com/locate/ins #12;However in real applications, XML

Liu, Chengfei

215

XML-Based Middleware of Quick Response System in Textile & Apparel Supply Chain  

Microsoft Academic Search

This paper presents a XML-based middleware framework of the quick response system for textile and apparel supply chain, and describes the middleware used in the system .Through the example of the retailer estimate the delay time of a order cycle, this article introduces the XML-based process design of the quick response system, the XML documents linking mechanism for the integration

Xiaoxu Fan; Qi Xu

2008-01-01

216

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

E-print Network

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

217

Flexible Similarity Assessment for XML Documents Based on XQL and Java Reflection  

Microsoft Academic Search

In this paper we present a flexible similarity assessment framework for XML documents and describe its usage on the exam- ple of XML-based fault diagnosis for remote fieldbus automation sys- tems. Our approach combines the expressive power of both XQL and Java to overcome the limitations of standard XML query languages and to provide a convenient platform for rapid definition

Dieter Bhler; Wolfgang Kchlin

2001-01-01

218

A case study on alternate representations of data structures in XML  

Microsoft Academic Search

XML provides a universal and portable format for document and data exchange. While the syntax and specification of XML makes documents both human readable and machine parsable, it is often at the expense of efficiency when representing simple data structures.We investigate the ``costs'' associated with XML serialization from several resource perspectives: storage, transport, processing and human readability. These experiments are

Daniel Gruhl; Daniel N. Meredith; Jan Pieper

2005-01-01

219

NeT and CoT: Translating Relational Schemas to XML Schemas using Semantic Constraints  

Microsoft Academic Search

ABSTRACT Two algorithms, called NeT and CoT, to translate relational schemas to XML schemas using various semantic constraints are presented The XML schema representation we use is a language - independent formalism named XSchema , that is both precise and concise A given XSchema can be mapped to a schema in any of the existing XML schema language proposals Our

Dongwon Lee; Frank Chiu; Murali Mani; Wesley W. Chu

2001-01-01

220

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

PubMed

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

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

2014-08-01

221

Development Life Cycle and Tools for XML Content Models  

SciTech Connect

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

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

2004-11-01

222

Recursive Formulas for the Characteristic Numbers of Rational Plane Curves  

Microsoft Academic Search

We derive recursive equations for the characteristic numbers of rational nodal plane curves with at most one cusp, subject to point conditions, tangent conditions and flag conditions, developing techniques akin to quantum cohomology on a moduli space of stable lifts.

Lars Ernstrm; Gary Kennedy

1996-01-01

223

Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning  

E-print Network

Alva Edison Program (EES­529769). 1 #12; Task Allocation by Recursive Bipartitioning 2 Proposed running­SBIR program through Universal Energy Systems, Inc. (S­776­000­001) and by the State of Ohio through the Thomas

Ramanujam, J. "Ram"

224

Recursion operators and bi-Hamiltonian structures in multidimensions. I  

Microsoft Academic Search

The algebraic properties of exactly solvable evolution equations in one spatial and one temporal dimensions have been well studied. In particular, the factorization of certain operators, called recursion operators, establishes the bi-Hamiltonian nature of all these equations. Recently, we have presented the recursion operator and the bi-Hamiltonian formulation of the Kadomtsev-Petviashvili equation, a two spatial dimensional analogue of the Korteweg-deVries

P. M. Santini; A. S. Fokas

1988-01-01

225

Recursion Hypothesis Considered as a Research Program for Cognitive Science  

Microsoft Academic Search

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

Pauli Brattico

2010-01-01

226

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

227

The redundancy of recursion and infinity for natural language  

Microsoft Academic Search

An influential line of thought claims that natural language and arithmetic processing require recursion, a putative hallmark\\u000a of human cognitive processing (Chomsky in Evolution of human language: biolinguistic perspectives. Cambridge University Press,\\u000a Cambridge, pp 4561, 2010; Fitch et al. in Cognition 97(2):179210, 2005; Hauser et al. in Science 298(5598):15691579, 2002). First, we question the need for recursion in human cognitive

Erkki LuukHendrik Luuk; Hendrik Luuk

2011-01-01

228

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

229

The Eynard--Orantin recursion for the total ancestor potential  

E-print Network

It was proved recently that the correlation functions of a semi-simple cohomological field theory satisfy the so called Eynard--Orantin topological recursion. We prove that in the settings of singularity theory, the relations can be expressed in terms of periods integrals and the so called phase forms. In particular, we prove that the Eynard-Orantin recursion is equivalent to $N$ copies of Virasoro constraints for the ancestor potential, which follow easily from the definition of the potential.

Milanov, Todor

2012-01-01

230

The Eynard--Orantin recursion for the total ancestor potential  

E-print Network

It was proved recently that the correlation functions of a semi-simple cohomological field theory satisfy the so called Eynard--Orantin topological recursion. We prove that in the settings of singularity theory, the relations can be expressed in terms of periods integrals and the so called phase forms. In particular, we prove that the Eynard-Orantin recursion is equivalent to $N$ copies of Virasoro constraints for the ancestor potential, which follow easily from the definition of the potential.

Todor Milanov

2012-11-26

231

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

232

Recursive frame integration of limited data: RAFAIL  

NASA Astrophysics Data System (ADS)

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

Rafailov, Michael K.; Soli, Robert A.

2005-08-01

233

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

234

A generic negotiation model for MAS using XML  

Microsoft Academic Search

In this paper, we present a generic negotiation model for multi-agent systems (MAS), built in three levels: a communication level, a negotiation level and a strategic level, which is the only level specific to the application. XML files are used to configure the system, freeing the end-user with recompilations each time he wants to change a parameter. The aim of

Philippe Mathieu; Marie-h El Ene Verrons

2003-01-01

235

XML and Context Structural Features Relevant to Search Tasks  

E-print Network

[about(., book review context IR)] The structural constraints of the librarian may help the retrieval systemXML and Context Structural Features Relevant to Search Tasks Georgina Ram´irez and Arjen P. de tasks in structured document collections based on two dimensions: the type of information a user

de Vries, Arjen P.

236

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

237

Managing the software design documents with XML Junichi Suzuki  

E-print Network

Managing the software design documents with XML Junichi Suzuki Department of Computer Science the software design documents within a distributed development team. The issues include the format, and addresses how we can manage the software design documents for the distributed software development

Suzuki, Jun

238

XMark: A Benchmark for XML Data Management Albrecht Schmidt1  

E-print Network

, Inc., USA, mcarey@bea.com 4 INRIA-Rocquencourt, 78153 Le Chesnay Cedex, France, Ioana standardization efforts for XML query languages have been progressing, researchers and users increasingly focus, major and minor database vendors (see [4] for a seemingly ever-growing list) are scram- bling

Manolescu, Ioana

239

The Michigan Benchmark: A Microbenchmark for XML Query Processing Systems  

E-print Network

The Michigan Benchmark: A Microbenchmark for XML Query Processing Systems£ Kanda Runapongsa Jignesh The University of Michigan, Ann Arbor, MI 48109, USA krunapon, jignesh, jag, shurug @eecs is called the Michigan benchmark. In the Michigan benchmark, we primarily attempt to capture the rich

Runapongsa, Kanda

240

An efficient infrastructure for native transactional XML processing  

Microsoft Academic Search

Implementation techniques for relational database management systems (DBMSs) have proven their efficiency and robustness in many existing systems. However, many of these conceptsandmechanismscannotbeusedwhenimplementinganativeXMLDBMS(XDBMS) because of substantial differences in the processing properties of natively stored XML doc- uments as compared to relational tables. Therefore, we have to develop new and appropriate techniques with ACID transaction guarantees tailored to the processing characteristics

Michael Peter Haustein; Theo Hrder

2007-01-01

241

Peer to Peer Collaborative Editing on XML-like trees  

Microsoft Academic Search

Peer to peer collaborative editing allows distinct sites to work concurrently on a common document without the need of a centralization process, contrary to classical systems like CVS or SVN that rely on this centralization to detect con- icts. In this so-called optimistic approach, we investigate how one can perform collaborative edition on a XML doc- ument like data-structure which

Martin Stphane; Denis Lugiez

242

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

243

Automatic Web-Based EFP Studio System with XML Documents  

Microsoft Academic Search

The rising wave of internet applications has led to the rapid development of streaming media technology. This paper proposes time-triggered events algorithm using a script object transformation to XML documents to create the automatic EFP studio system for real-time editing and broadcasting of audio\\/ video on media server. The system provides the user access to web multiple cameras and AV

Wei Chen; Rong-Chi Chang

2012-01-01

244

An XML\\/SVG platform for document analysis  

Microsoft Academic Search

In this paper, a DTD (Document Type Definition) XmlLayout for document layout analysis is presented. The paper will focus on its finality and on the role that it can play in a document recognition framework. At first, we shall show how this DTD can interact in the communication between the system processes, and second, we shall explain its implementation into

L. Pierron; A. Belad

2001-01-01

245

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

246

The Publication of Archaeological Excavation Reports Using XML  

Microsoft Academic Search

This paper looks at the usability of {XML} for the electronic publication of field reports by commercial archaeological units. The field reports fall into the field of grey literature as they are produced as client reports by commercial units as part of the planning process and do not receive official publication or widespread dissemination. The paper uses a small commercial

Christiane Meckseper; Claire Warwick

2003-01-01

247

XML Content Management Based on Object-Relational Database Technology  

Microsoft Academic Search

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

Budi Surjanto; Norbert Ritter; Henrik Loeser

2000-01-01

248

Personalization of XML Content Browsing Based on User Preferences  

ERIC Educational Resources Information Center

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

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

2009-01-01

249

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

250

Knot Invariants from Topological Recursion on Augmentation Varieties  

NASA Astrophysics Data System (ADS)

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

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

2014-12-01

251

The redundancy of recursion and infinity for natural language.  

PubMed

An influential line of thought claims that natural language and arithmetic processing require recursion, a putative hallmark of human cognitive processing (Chomsky in Evolution of human language: biolinguistic perspectives. Cambridge University Press, Cambridge, pp 45-61, 2010; Fitch et al. in Cognition 97(2):179-210, 2005; Hauser et al. in Science 298(5598):1569-1579, 2002). First, we question the need for recursion in human cognitive processing by arguing that a generally simpler and less resource demanding process--iteration--is sufficient to account for human natural language and arithmetic performance. We argue that the only motivation for recursion, the infinity in natural language and arithmetic competence, is equally approachable by iteration and recursion. Second, we submit that the infinity in natural language and arithmetic competence reduces to imagining infinite embedding or concatenation, which is completely independent from the ability to implement infinite processing, and thus, independent from both recursion and iteration. Furthermore, we claim that a property of natural language is physically uncountable finity and not discrete infinity. PMID:20652723

Luuk, Erkki; Luuk, Hendrik

2011-02-01

252

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 Posts seminal Real Programmers Dont Use Pascal (Datamation, 1983). My follow-up ("Real programmers do use Delphi," Software, IEEE , vol.12, no.6, pp.8, 10, 12-, Nov 1995) charted their evolution from FORTRAN-only programmers to embracing a wider range of mainstream languages and tools that still afforded ample opportunity for creativity, game-playing, irregular work hours, and importantly, long-term job security.

Gorton, Ian

2008-09-01

253

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

254

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

255

The limits on combining recursive horn rules with description logics  

SciTech Connect

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

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

1996-12-31

256

A Synthetic Recursive +1 Pathway for Carbon Chain Elongation  

PubMed Central

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

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

2013-01-01

257

Elucidating the stop bands of structurally colored systems through recursion  

NASA Astrophysics Data System (ADS)

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

Amir, Ariel; Vukusic, Peter

2013-04-01

258

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

E-print Network

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

Moss, Lawrence S.

259

Ward Identity Implies Recursion Relation at Tree and Loop Level  

E-print Network

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

Yun Zhang; Gang Chen

2012-07-15

260

XML-based product information processing method for product design  

NASA Astrophysics Data System (ADS)

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

Zhang, Zhen Yu

2012-01-01

261

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

262

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

PubMed Central

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

Hatano, Kenji; Ohe, Kazuhiko

2003-01-01

263

FluXQuery: An Optimizing XQuery Processor for Streaming XML Data  

Microsoft Academic Search

Abstract: Introduction and MotivationXML has established itself as the ubiquitous formatfor data exchange on the Internet. An imminent developmentis that of streams of XML data being exchangedand queried. Data management scenarioswhere XQuery [11] is evaluated on XML streams arebecoming increasingly important and realistic, e.g. ine-commerce settings.Naturally, query engines employed for stream processingare main-memory-based, yet contemporaryXQuery engines consume main memory in

Christoph Koch; Stefanie Scherzinger; Nicole Schweikardt; Bernhard Stegmaier

2004-01-01

264

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

265

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

266

ToXgene: An extensible template-based data generator for XML  

Microsoft Academic Search

Synthetic collections of XML documents are useful in many applications, such as benchmarking (e.g., Xmark), and algorithm testing and evaluation. We present ToXgene, a template-based generator for large, consistent collections of synthetic XML documents. Templates are annotated XML Schema specifications describing both the structure and the content of the data to be generated. Our tool was designed to be declarative,

Denilson Barbosa; Alberto O. Mendelzon; John Keenleyside; Kelly A. Lyons

2002-01-01

267

NeT & CoT: translating relational schemas to XML schemas using semantic constraints  

Microsoft Academic Search

Two algorithms, called NeT and CoT, to translate relational schemas to XML schemas using various semantic constraints are presented. The XML schema representation we use is a language-independent formalism named XSchema, that is both precise and concise. A given XSchema can be mapped to a schema in any of the existing XML schema language proposals. Our proposed algorithms have the

Dongwon Lee; Murali Mani; Frank Chiu; Wesley W. Chu

2002-01-01

268

USING THE FORCE: HOW STAR WARS CAN HELP YOU TEACH RECURSION  

E-print Network

recursive functions, go through one of the simple examples to demonstrate how recursion works. Present, and then demonstrate how their solution works. The key to the success of this approach, as well as its uniqueness277 USING THE FORCE: HOW STAR WARS CAN HELP YOU TEACH RECURSION Jennifer S. Kay Department

Kay, Jennifer S.

269

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

E-print Network

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

Janson, Svante

270

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

E-print Network

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

Rüschendorf, Ludger

271

Handling Conceptual Multidimensional Models Using XML through DTDs  

Microsoft Academic Search

In the last years, several approaches have been proposed to easily capture main multidimensional (MD) properties at the conceptual\\u000a level. In this paper, we present how to handle MD models by using the eXtensible Markup Language (XML) through a Document\\u000a Type Definition (DTD) and the eXtensible Stylesheet Language Transformations (XSLT). To accomplish this objective, we start\\u000a by providing a DTD

Enrique Medina; Sergio Lujn-mora; Juan Trujillo

2002-01-01

272

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

273

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

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

2008-01-01

274

Linguistic database handling using XML in web environment  

Microsoft Academic Search

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

Hwi woong Jeong; Aesun Yoon

2001-01-01

275

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

NASA Technical Reports Server (NTRS)

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

Hsieh, Shih-Fu

1990-01-01

276

Optical Ethernet span protection using an XML-based multiprotocol framework  

NASA Astrophysics Data System (ADS)

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

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

2004-09-01

277

An Augmented Space Recursion Approach to Rough Surfaces  

NASA Astrophysics Data System (ADS)

We describe a technique which combines the local density functional based tight-binding linearized muffin-tin orbitals method, the recursion method of Haydock, Heine and Kelly and the augmented space method introduced by us. We indicate the usefulness of this method for the study of itinerant magnetism in rough surfaces and interfaces

Mookerjee, A.

2000-09-01

278

Recursive windowing for generating autocorrelation coefficients for LPC analysis  

Microsoft Academic Search

A method for recursively computing the autocorrelation estimates needed for LPC analysis in a vocoder environment has been developed theoretically and studied experimentally. The method has three specific advantages: 1) it requires very little memory for its implementation; 2) it is realized by a structure consisting of several identical modules; and 3) the effective window length may be changed without

THOMAS P. BARNWELL

1981-01-01

279

" Recursive and Iterative Queries " Resource record and DNS query  

E-print Network

9/9/14 1 Chapter 2 Outline DNS " Overview " Recursive and Iterative Queries " Resource record and DNS query " DNS Protocol " DNS Caching " DNS Services " Reverse DNS lookup #12;9/9/14 2 DNS (Domain Name System) Internet host's and router interfaces: " IPv4 address (32 bit): used

280

Typed Closure Conversion for RecursivelyDefined Functions  

E-print Network

Typed Closure Conversion for Recursively­Defined Functions (Extended Abstract) Greg Morrisett 1 Cornell University Robert Harper 2 Carnegie Mellon University Abstract 1 Introduction Closure conversion­class functions or procedures. In particular, closure conversion translates each function definition f into a clo

Morrisett, Greg

281

Recursive confidence band construction for an unknown distribution function.  

PubMed

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

Kiatsupaibul, Seksan; Hayter, Anthony J

2015-01-01

282

Validating and Animating Higher-Order Recursive Functions in B  

Microsoft Academic Search

ProB is an animation and model checking tool for the B Method, which can deal with many interesting specications. Some spec- ications, however, contain complicated functions which cannot be repre- sented explicitly by a tool. We present a scheme with which higher-order recursive functions can be encoded in B, and establish soundness of this scheme. We then describe a symbolic

Michael Leuschel; Dominique Cansell; Michael J. Butler

2009-01-01

283

Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions  

E-print Network

Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions Richard Socher of sentiment label distributions. Our method learns vector space representations for multi-word phrases. In sentiment prediction tasks these represen- tations outperform other state-of-the-art ap- proaches

284

NORMAL LINEAR REGRESSION MODELS WITH RECURSIVE GRAPHICAL MARKOV STRUCTURE  

Microsoft Academic Search

A multivariate normal statistical model defined by the Markov properties determined by an acyclic digraph admits a recursive factorization of its likelihood function (LF) into the product of conditional LFs, each factor having the form of a classical mul- tivariate linear regression model (? MANOVA model). Here these models are ex- tended in a natural way to normal linear regression

Steen A. Andersson; Michael D. Perlman

285

Improved Decision-Directed Recursive Least Squares MIMO Channel Tracking  

Microsoft Academic Search

This paper presents a comparative study of different Recursive Least Squares algorithms to track a Rayleigh flat fading MIMO channel. We investigate the effect of the initializa- tion and training of these algorithms on their performance. We propose a new training scheme which can deliver a lower mean squared estimation error without loss of bandwidth efficiency.

Emna Eitel; Rana H. Ahmed Salem; Joachim Speidel

2009-01-01

286

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-galvn; Fatameh Haghighi; Ivo Grosse

2002-01-01

287

Pattern Discovery by Residual Analysis and Recursive Partitioning  

Microsoft Academic Search

In this paper, a novel method of pattern discovery is proposed. It is based on the theoretical formulation of a contingency table of events. Using residual analysis and recursive partitioning, statistically significant events are identified in a data set. These events constitute the important information contained in the data set and are easily interpretable as simple rules, contour plots, or

Tom Chau; Andrew K. C. Wong

1999-01-01

288

Recursive Vocal Pattern Learning and Generalization in Starlings  

ERIC Educational Resources Information Center

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

Bloomfield, Tiffany Corinna

2012-01-01

289

Gibbs Recursive Sampler: finding transcription factor binding sites  

Microsoft Academic Search

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

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

2003-01-01

290

A Batch\\/Recursive Algorithm for 3D Scene Reconstruction  

Microsoft Academic Search

We present a new formulation of sequential least-squares applied to scene and motion reconstruction from image fea- tures. We argue that recursive techniques will become more important both for real-time control applications and also interactive vision applications. The aim is to approximate as well as possible the result of the batch bundle adjustment method. In previously published work we described

Philip F. Mclauchlan; Guildford GU

2000-01-01

291

Efficient and Optimal Attitude Determination Using Recursive Global Positioning System  

E-print Network

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

Crassidis, John L.

292

Complex cooperative robot actions based on recursive optimal motion composition  

Microsoft Academic Search

This work is concerned with complex cooperative robot actions by recursive optimal motion composition. According to the intelligent composite motion control (ICMC), a complex action is gradually realized from fundamental motions. It, is not easy to obtain the action intelligence of such a complex cooperation at once, hence in this work the intelligence is constructed through multi-stage action intelligence optimization.

Masakazu Suzuki; Yusuke Takada

2008-01-01

293

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

294

Linearizing some recursive logic programs Ir`ene Guessarian  

E-print Network

Linearizing some recursive logic programs Ir`ene Guessarian and Jean-Eric Pin E-mail: guessarian in recent deductive database research; we survey in the Support from the PRC Math intensional database predicates (i.e. relations defined by logical rules) or extensional database predicates

Paris-Sud XI, Université de

295

Recursive Information Hiding in Visual Cryptography Sandeep Katta  

E-print Network

, Oklahoma State University Stillwater, OK 74078 ABSTRACT: Visual Cryptography is a secret sharing scheme for 3 out of 5 secret sharing. The idea used is to hide smaller secrets in the shares of a larger secret without an expansion in the size of the latter. KEYWORDS: visual cryptography, secret sharing, recursive

296

Automatic track formation in clutter with a recursive algorithm  

Microsoft Academic Search

A recursive algorithm for forming tracks in a cluttered environment is presented. The approach combines the interacting multiple model algorithm with the probabilistic data association filter. The track formation is accomplished by considering two models: one is the true target, with a certain probability of detection PD ; the other is an unobservable target (or no target) with the same

Y. Bar-Shalom; K. C. Chang; H. A. P. Blom

1989-01-01

297

A Java Reinforcement Learning Module for the Recursive Porous  

E-print Network

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

Tesfatsion, Leigh

298

Lambda Calculus with Explicit Recursion Zena M. Ariola  

E-print Network

\\Gamma\\Gamma! M(YM) : Thus, the above data structure ones becomes: Y(??x:1 : x) ; which leadsLambda Calculus with Explicit Recursion Zena M. Ariola Computer and Information Science Department in the ??­calculus using the fixed point combinator Y, whose behavior is captured by the following rewrite rule: YM

Ariola, Zena M.

299

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

300

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

301

Space Update  

NSDL National Science Digital Library

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

2006-01-01

302

Assessment of security extended XML-based Management V. Cridlig H. Abdelnur R. State O. Festor  

E-print Network

Assessment of security extended XML-based Management V. Cridlig H. Abdelnur R. State O. Festor July 5, 2006 Abstract The emergence of new management paradigms having XML as a core foundation block demands a comprehensive analysis of their security and performance issues. This paper presents an ex

Paris-Sud XI, Université de

303

Development of surgical operation data interchange model using XML and relational database  

Microsoft Academic Search

This research was focused on development of a surgical operation data interchange model using XML and relational database and development of a Web application to store, retrieve and transfer operative note data between database and XML file. In system analysis phase, surgeon requirement were collected using Delphi method, 27 expert surgeons for 9 specialty groups were selected. Three rounds of

Wansa Paoin; Pranot Boonchai-Apisit

2009-01-01

304

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

E-print Network

are applicable to a static scenario wherein the underlying XML data does not change subsequent to the collection problematic for statis- tics collection techniques that make multiple passes over the data (e.g., [20IMAX: Incremental Maintenance of Schema-based XML Statistics Maya Ramanath1 Lingzhi Zhang2 Juliana

Utah, University of

305

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

306

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

307

An XML-Based Approach to Publishing and Querying the History of Databases  

Microsoft Academic Search

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

Fusheng Wang; Carlo Zaniolo

2005-01-01

308

Publishing and Querying the Histories of Archived Relational Databases in XML  

Microsoft Academic Search

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

Fusheng Wang; Carlo Zaniolo

2003-01-01

309

Querying XML Using Structures and Keywords in Timber Department of EECS  

E-print Network

and IR systems. The challenge for database sys- tem resides in that IR-style queries are not exact. There will describe how Timber, a native XML database system, has been extended with the capability to answer XML-style structured queries (e.g., XQuery) with embedded IR-style keyword-based non-boolean conditions

Michigan, University of

310

An XML-IR-DB Sandwich: Is it Better With an Algebra in Between?  

E-print Network

the problem of immediate trans- lation of XPath+IR queries to relational database expres- sions and exert of a database enables a level of abstraction from both query languages for IR in XML documents-like (IR-like) queries over XML databases is still an open issue [1]. An IR-like query (an example is given

Hiemstra, Djoerd

311

Content Authoring in an XML-based and Author-Friendly Environment  

E-print Network

Content Authoring in an XML-based and Author-Friendly Environment Roelof van Zwol Astrid Callista.cs.uu.nl #12;Content Authoring in an XML-based and Author-Friendly Environment Roelof van Zwol Astrid Callista, content should be reusable for publication on different media and platforms. Authoring content digitally

Utrecht, Universiteit

312

XML Document Classification using SVM Samaneh Chagheri*, Catherine Roussey**, Sylvie Calabretto*, Cyril Dumoulin***  

E-print Network

based on content and document structure like the work of Vercoustre, our vector features are differentXML Document Classification using SVM Samaneh Chagheri*, Catherine Roussey**, Sylvie Calabretto. This paper describes a representation for XML documents in order to classify them. Document classification

Boyer, Edmond

313

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

ERIC Educational Resources Information Center

Data integration is a critical component of enterprise system integration, and XML data validation is the foundation for sound data integration of XML-based information systems. Since B2B e-commerce relies on data validation as one of the critical components for enterprise integration, it is imperative for financial industries and e-commerce

Golikov, Steven

2013-01-01

314

ORDPATHs: Insert-Friendly XML Node Labels Patrick O'Neil, Elizabeth O'Neil1  

E-print Network

Frogs All right-thinking people love tree frogs. Figure 2 ServerTM. ORDPATH labels nodes of an XML tree without requiring a schema (the most general case--a schema in the XML tree, their ORDPATH values "careted in" between ORDPATHs of sibling nodes, without relabeling any

O'Neil, Patrick

315

ToXgene: a template-based data generator for XML  

Microsoft Academic Search

note that the structure does not have to be regular). Themain features of our tool are:Generation of complex XML content: our tool supportsall XML element content models (CDATA, element andmixed) and allows the generation of attributes as well. CDATAvalues are generated according to a type declaration; variousstring, numeric and date types are supported.Skewed probability distributions: the user can specifyprobability distributions

Denilson Barbosa; Alberto O. Mendelzon; John Keenleyside; Kelly A. Lyons

2002-01-01

316

NeT & CoT: Inferring XML Schemas from Relational World Dongwon Lee Murali Mani  

E-print Network

NeT & CoT: Inferring XML Schemas from Relational World Dongwon Lee Murali Mani Frank Chiu Wesley documents will grow substantially as well. Two conversion algorithms, called NeT and CoT, to translate that the resulting XML schema becomes hier- archical, and (2) CoT considers not only the structure of relational

Lee, Dongwon

317

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

PubMed Central

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

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

2011-01-01

318

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

319

Data Entity Dictionary Specification Language: XML/DTD Syntax  

NSDL National Science Digital Library

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

2002-01-01

320

An XML-based format for guideline interchange and execution.  

PubMed Central

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

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

2000-01-01

321

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

322

An XML-based protocol for distributed event services  

SciTech Connect

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

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

2001-06-25

323

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

PubMed Central

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

Phillips, Steven; Wilson, William H.

2012-01-01

324

Fully flexible unit cell simulation with recursive thermostat chains  

NASA Astrophysics Data System (ADS)

The recursive thermostat chained fully flexible cell molecular dynamic simulation (N?T ensemble) is performed. The ensemble is based on the metric tensor, whose components are used as extended variables. These variables are combined with Nos-Poincar recursive thermostat chains. This extended Hamiltonian approach preserves Hamiltonian in structure, and the partition function satisfies the N?T ensemble state in phase space. In the present study, the generalized leap frog method was employed for time integration. The resulting molecular dynamics simulation was performed for bulk and thin film solid materials in the face-centered-cubic crystal structure. Uniaxial tension test and simple shear test are performed to predict the behaviors of a solid material in the bulk state and nanoscale thin film state. The proposed flexible cell method should serve as a powerful tool for the prediction of mechanical and thermal properties of solid materials including nanoscale behavior.

Choi, Kwangseok; Cho, Maenghyo

2006-11-01

325

One loop integration with hypergeometric series by using recursion relations  

E-print Network

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

2013-01-01

326

Recursive generalized predictive control for systems with disturbance measurements  

NASA Astrophysics Data System (ADS)

The recursive generalized predictive control (RGPC), which combines the process of system identification using recursive least-squares (RLS) algorithm and the process of generalized predictive feedback control design, has been presented and successfully implemented on testbeds. In this research, the RGPC algorithm is extended when the disturbance measurement signal is available for feedforward control. First, the feedback and feedforward RGPC design algorithm is presented when the disturbance is stochastic or random, and is applied to an optical jitter suppression testbed. Second, the feedback and feedforward algorithm is further extended when the disturbance is deterministic or periodic. The deterministic disturbance measurement is used to estimate the future disturbance values that are then used in the control design to enhance the performance. The RGPC with future disturbance estimation algorithm is applied to a structural system and an acoustic system.

Moon, Suk-Min; Clark, Robert L.; Cole, Daniel G.

2004-07-01

327

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

328

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

329

Structural properties of the noncommutative KdV recursion operator  

NASA Astrophysics Data System (ADS)

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

Schiebold, C.

2011-11-01

330

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

331

The recursive structure of the distribution of primes  

E-print Network

In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a recursive relationship between primes of different ranges and so to describe some inner structure of this special set of numbers.

Carolin Zbelein

2014-11-07

332

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

333

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

334

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

335

Recursive linearization of multibody dynamics equations of motion  

NASA Technical Reports Server (NTRS)

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

Lin, Tsung-Chieh; Yae, K. Harold

1989-01-01

336

Recursive Bayesian synthetic aperture geoacoustic inversion in the presence of motion dynamics.  

PubMed

A low signal to noise ratio (SNR), single source/receiver, broadband, frequency-coherent matched-field inversion procedure recently has been proposed. It exploits coherently repeated transmissions to improve estimation of the geoacoustic parameters. The long observation time improves the SNR and creates a synthetic aperture due to relative source-receiver motion. To model constant velocity source/receiver horizontal motion, waveguide Doppler theory for normal modes is necessary. However, the inversion performance degrades when source/receiver acceleration exists. Furthermore processing a train of pulses all at once does not take advantage of the natural incremental acquisition of data along with the ability to assess the temporal evolution of parameter uncertainty. Here a recursive Bayesian estimation approach is developed that coherently processes the data pulse by pulse and incrementally updates estimates of parameter uncertainty. It also approximates source/receiver acceleration by assuming piecewise constant but linearly changing source/receiver velocities. When the source/receiver acceleration exists, it is shown that modeling acceleration can reduce further the parameter estimation biases and uncertainties. The method is demonstrated in simulation and in the analysis of low SNR, 100-900?Hz linear frequency modulated (LFM) pulses from the Shallow Water 2006 experiment. PMID:25190393

Tan, Bien Aik; Gerstoft, Peter; Yardim, Caglar; Hodgkiss, William S

2014-09-01

337

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

Technology Transfer Automated Retrieval System (TEKTRAN)

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

338

XML-Based Visual Specification of Multidisciplinary Applications  

NASA Technical Reports Server (NTRS)

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

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

2001-01-01

339

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

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

340

Metaphor, recursive systems, and paradox in science and developmental theory.  

PubMed

The contradictions found at any level of abstraction among concepts such as subject-object, whole-part, synthesis-analysis, metaphor-observation, organicism-mechanism, and interpretationism-realism cannot be eliminated or resolved at that level. They can, however, be reconciled into productive paradoxes by recognizing them as components of recursive systems. The resolution of the paradox occurs only at the next higher level of abstraction where a synthesis can be established. However, this synthesis at the next higher level entails its own contradictions. These can again be reconciled into productive paradoxes through the recognition of broader recursive systems. This progressive solution continues at each iteration, or level or recursion, and it is illustrated in Fig. 5. In the figure, the innermost cycle represents the knowing organism, knowing in the paradoxical cycle of metaphor-assumptions-concepts-observations. This knowing organism is explained and hence understood, and the paradoxes reconciled, only by moving to the next level of recursive cycle. At this next level, the first level of abstraction, psychological theories operate to explain the phenomenological knowing organism of the first cycle. In fact, it is only by moving to this level that we transcend the paradox of man knowing and explaining himself. And only by moving to this level do we avoid the vicious circularity that could befall the use of recursive systems. However, the theories themselves involve a new paradoxical cycle of metaphor-assumptions-concepts-observation. Thus, explanation of this level requires movement to the next level of abstraction or next outer cycle. Here metatheoretical assumptions provide the transcendence and the opportunity to reconcile the paradoxes of psychological theory. But this level too operates in a cycle of paradoxes and consequently the process continues as it does for any dialectic process. In closing, I should in fairness note that I have outlined only one type of solution to contradictions that are found among approaches to the game called science and the game called developmental psychology. It is a solution that draws heavily on the categories of dialectical method, and it is just this method that is both the reason for, and the consequence of, the organismic metaphor. Thus, my solution generates its own contradiction for I have again, as Scholnick argues, based my solution at some level of organicism: a point that will not escape the discerning realist or, for that matter, the discerning rationalist. PMID:1767726

Overton, W F

1991-01-01

341

Glaucoma Medical Updates  

MedlinePLUS

... Change Get Involved Research Grants Special Events Glaucoma Medical Updates Latest Medical News Updates From the Outside Looking In: Sophisticated ... Informed Sign up to receive the most recent medical and research updates . Further Information The most recent ...

342

Adaptive Linear Predictive Coding of Time-Varying Images Using Multidimensional Recursive Least Squares Ladder Filters  

Microsoft Academic Search

This paper presents several adaptive linear predictive coding techniques based upon extension of recursive ladder filters to two and three dimensions (2-D\\/3-D). A 2-D quarter-plane autoregressive ladder filter is developed using a least square criterion in an exact recursive fashion. The 2-D recursive ladder filter is extended to a 3-D case which can adaptively track the variation of both spatial

MAN K. NAM; WILLIAM D. O'NEILL

1987-01-01

343

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

344

Teaching object concepts for XML-based representations.  

SciTech Connect

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

Kelsey, R. L. (Robert L.)

2002-01-01

345

New Recursive Least Squares Algorithms without Using the Initial Information  

NASA Astrophysics Data System (ADS)

In this letter, we propose a new type of recursive least squares (RLS) algorithms without using the initial information of a parameter or a state to be estimated. The proposed RLS algorithm is first obtained for a generic linear model and is then extended to a state estimator for a stochastic state-space model. Compared with the existing algorithms, the proposed RLS, algorithms are simpler and more numerically stable. It is shown through simulation that the proposed RLS algorithms have better numerical stability for digital computations than existing algorithms.

Park, Jung Hun; Quan, Zhonghua; Han, Soohee; Kwon, Wook Hyun

346

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

347

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.

348

Industrial update.  

PubMed

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

Oak, Mayura; Mandke, Rhishikesh

2014-11-01

349

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

350

Democratic community-based search with XML full-text queries  

E-print Network

Work and Conclusion In database and IR research, severalthe databases (DB) and the information retrieval (IR) com-IR: Integrating XML Document and Data Retrieval. In International Workshop on the Web and Databases (

Curtmola, Emiran

2009-01-01

351

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

Federal Register 2010, 2011, 2012, 2013

...below for details. DATES: The XML is now available at the links mentioned below. FOR FURTHER INFORMATION CONTACT: Christina Switzer, Office of the General Counsel, Federal Energy Regulatory Commission, 888 First St. NE., Washington, DC 20426,...

2013-05-16

352

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

Federal Register 2010, 2011, 2012, 2013

...DATES: The draft XML Schema is now available at the links mentioned below. FOR FURTHER INFORMATION CONTACT: Christina Switzer, Office of the General Counsel, Federal Energy Regulatory Commission, 888 First St. NE., Washington, DC 20426,...

2012-08-07

353

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

354

Developing content-intensive applications with XML documents, document transformations and software components  

Microsoft Academic Search

This paper describes DTC (documents, transformations and components), our approach to the XML-based development of content-intensive applications. According to this approach, the contents of an application and other customizable features (e.g. the properties of its user interface) are represented in terms of XML documents. In DTC, the software of the application is organized in terms of reusable components capable of

Jos Luis Sierra; Alfredo Fernndez-Valmayor; Baltasar Fernndez-Manjn; Antonio Navarro

2005-01-01

355

Developing Content-Intensive Applications with XML Documents, Document Transformations and Software Components  

Microsoft Academic Search

This paper describes DTC (Documents, Transformations and Components), our approach to the XML-based development of content-intensive applications. According to this approach, the contents of an application and other customizable features (e.g. the properties of its user interface) are represented in terms of XML documents. In DTC, the software of the application is organized in terms of reusable components capable of

Jos Luis Sierra; Alfredo Fernndez-valmayor; Baltasar Fernndez-manjn; Antonio Navarro

2005-01-01

356

Content-Based Overlay Networks for XML Peers Based on Multilevel Bloom Filters  

Microsoft Academic Search

Peer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. In this paper, we consider XML peers, that is, peers that store XML documents. We show how an extension of traditional Bloom filters, called multi-level Bloom filters, can be used to route path queries in such a system. In addition, we propose building content-based

Georgia Koloniari; Yannis Petrakis; Evaggelia Pitoura

2003-01-01

357

Un modle de stockage de donnes XML bas sur les squences  

E-print Network

Un modèle de stockage de données XML basé sur les séquences Ioana Manolescu * --- Andrei Arion présentons le modèle de stockage XML basé sur les chemins du document. Ce modèle sépare la structure du contenu du document, et utilise des séquences comme structures logiques et physiques de stockage. Il

Manolescu, Ioana

358

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

PubMed Central

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

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

2012-01-01

359

Integration WebGIS with AJAX and XML Based on Google Maps  

Microsoft Academic Search

AJAX, a core technology of Web 2.0, is aroused attention by both industry and academia. Google Maps is a classical Web application service based on AJAX. This paper presents a WebGIS framework of web application with AJAX and XML data. Based on Google Maps service, the framework uses XMLHttpRequest objects which call the XML data and load the geographic information

Xiaojun Tan; Mu Zhou; Xiang Zuo; Yuyong Cui

2008-01-01

360

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

E-print Network

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

Bodei, Chiara

361

The Autoconfiguration of Recursive DNS Server and the Optimization of DNS Name Resolution  

E-print Network

The Autoconfiguration of Recursive DNS Server and the Optimization of DNS Name Resolution provides the mechanism for the auto- configuration of recursive DNS server in mobile node and the optimization of DNS name resolution in the hierarchical mobile IPv6 network. Whenever the mobile node moves

Jeong, Jaehoon "Paul"

362

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

363

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

Microsoft Academic Search

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

I. Stojmenovic; Binomial Coefficients

2000-01-01

364

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

365

TRANSITORY MINIMAL SOLUTIONS OF HYPERGEOMETRIC RECURSIONS AND PSEUDOCONVERGENCE OF ASSOCIATED CONTINUED FRACTIONS  

Microsoft Academic Search

Three term recurrence relations yn+1 + bnyn + anyn?1 =0c an be used for computing recursively a great number of special functions. Depending on the asymptotic nature of the function to be computed, different recursion directions need to be considered: backward for minimal solutions and forward for dominant solutions. However, some solutions interchange their role for finite values of n

ALFREDO DEA; JAVIER SEGURA

366

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; Frdric Bourgault; Benjamin Lavis; Hugh F. Durrant-whyte

2006-01-01

367

Efficient parsing using recursive transition networks with output Javier M. Sastre  

E-print Network

of recursive transition networks (RTN) called recursive transition networks with string output (RTNSO). RTNSO of RTN with string output1 (RTNSOs) given in section 2., which corresponds to a spe- cial type element (e.g.: to wear the pants). There exists a technique to semiautomatically build a RTN- based

Forcada, Mikel L.

368

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

E-print Network

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

Boley, Daniel

369

Why structural recursion should be taught before arrays in CS 1  

Microsoft Academic Search

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

Kim B. Bruce; Andrea Danyluk; Thomas Murtagh

2005-01-01

370

Technical Report BUCSTR2010035, Computer Science Department, Boston University On Supporting Mobility and Multihoming in Recursive  

E-print Network

Technical Report BUCS­TR­2010­035, Computer Science Department, Boston University On Supporting of the process of ROuting in Recursive Architectures (RORA). We also perform an average­case cost analysis · mobility support · Multihoming · Loc/id split · recursive architecture · performance analysis · simulation

371

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

E-print Network

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

Yao, Yuan

372

Direct proof of the tree-level scattering amplitude recursion relation in Yang-mills theory.  

PubMed

Recently, by using the known structure of one-loop scattering amplitudes for gluons in Yang-Mills theory, a recursion relation for tree-level scattering amplitudes has been deduced. Here, we give a short and direct proof of this recursion relation based on properties of tree-level amplitudes only. PMID:15904356

Britto, Ruth; Cachazo, Freddy; Feng, Bo; Witten, Edward

2005-05-13

373

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

374

A Recursive Threshold Visual Cryptography Scheme Abhishek Parakh and Subhash Kak  

E-print Network

of Computer Science Oklahoma State University Stillwater, OK 74078 Abstract: This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size

375

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

Microsoft Academic Search

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

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

2009-01-01

376

WAVELET DENOISING BY RECURSIVE CYCLE SPINNING Alyson K. Fletcher and Kannan Ramchandran  

E-print Network

WAVELET DENOISING BY RECURSIVE CYCLE SPINNING Alyson K. Fletcher and Kannan Ramchandran University addressed via many tech- niques. Previously, Coifman and Donoho introduced cycle spin- ning, a technique improved upon. The proposed algo- rithm recursively "cycle spins" by repeatedly translating and de- noising

Goyal, Vivek K

377

A recursive least squares-based demodulator for electrical tomography  

NASA Astrophysics Data System (ADS)

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.

Xu, Lijun; Zhou, Haili; Cao, Zhang

2013-04-01

378

Recursive Feature Selection with Significant Variables of Support Vectors  

PubMed Central

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

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

2012-01-01

379

Adaptive model reduction for continuous systems via recursive rational interpolation  

NASA Technical Reports Server (NTRS)

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

Lilly, John H.

1994-01-01

380

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

381

Fine tuning points of generating function construction for linear recursions  

NASA Astrophysics Data System (ADS)

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

Yolcu, Bahar; Demiralp, Metin

2014-10-01

382

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

383

XML-based information system for planetary sciences  

NASA Astrophysics Data System (ADS)

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

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

2009-04-01

384

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

385

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

NASA Astrophysics Data System (ADS)

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

Rafailov, Michael K.

2006-08-01

386

Recursive Projection Profiling for Text-Image Separation  

NASA Astrophysics Data System (ADS)

This paper presents an efficient and very simple method for separating text characters from graphical images in a given document image. This is based on a Recursive Projection Profiling (RPP) of the document image. The algorithm tries to use the projection profiling method [4] [6] to its maximum bent to bring out almost all that is possible with the method. The projection profile reveals the empty space along the horizontal and vertical axes, projecting the gaps between the characters/images. The algorithm turned out to be quite efficient, accurate and least complex in nature. Though some exceptional cases were encountered owing to the drawbacks of projection profiling, they were well handled with some simple heuristics thus resulting in a very efficient method for text-image separation.

Krishnamoorthy, Shivsubramani; Loganathan, R.; Soman, K. P.

387

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

388

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

389

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

390

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

391

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

392

Priors in sparse recursive decompositions of hyperspectral images  

NASA Astrophysics Data System (ADS)

Nonnegative matrix factorization and its variants are powerful techniques for the analysis of hyperspectral images (HSI). Nonnegative matrix underapproximation (NMU) is a recent closely related model that uses additional underapproximation constraints enabling the extraction of features (e.g., abundance maps in HSI) in a recursive way while preserving nonnegativity. We propose to further improve NMU by using the spatial information: we incorporate into the model the fact that neighboring pixels are likely to contain the same materials. This approach thus incorporates structural and textural information from neighboring pixels. We use an l1-norm penalty term more suitable to preserving sharp changes, and solve the corresponding optimization problem using iteratively reweighted least squares. The effectiveness of the approach is illustrated with analysis of the real-world cuprite dataset.

Gillis, Nicolas; Plemmons, Robert J.; Zhang, Qiang

2012-06-01

393

Decentralized Job Shop Scheduling by Recursive Propagation Method  

NASA Astrophysics Data System (ADS)

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

Hino, Rei; Moriwaki, Toshimichi

394

Applying GRID Technologies to XML Based OLAP Cube Construction  

E-print Network

On-Line Analytical Processing (OLAP) is a powerful method for analysing large data warehouse data. Typically, the data for an OLAP database is collected from a set of data repositories such as e.g. operational databases. This data set is often huge, and it may not be known in advance what data is required and when to perform the desired data analysis tasks. Sometimes it may happen that some parts of the data are only needed occasionally. Therefore, storing all data to the OLAP database and keeping this database constantly up-to-date is not only a highly demanding task but it also may be overkill in practice. This suggests that in some applications it would be more feasible to form the OLAP cubes only when they are actually needed. However, the OLAP cube construction can be a slow process. Thus, we present a system that applies Grid technologies to distribute the computation. As the data sources may well be heterogeneous, we propose an XML language for data collection. The user's definition for a OLAP new cube...

Niemi, Tapio Petteri; Nummenmaa, J; Thanisch, P

2002-01-01

395

Converting biomolecular modelling data based on an XML representation.  

PubMed

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

Sun, Yudong; McKeever, Steve

2008-01-01

396

An XML based middleware for ECG format conversion.  

PubMed

With the rapid development of information and communication technologies, various e-health solutions have been proposed. The digitized medical images as well as the mono-dimension medical signals are two major forms of medical information that are stored and manipulated within an electronic medical environment. Though a variety of industrial and international standards such as DICOM and HL7 have been proposed, many proprietary formats are still pervasively used by many Hospital Information System (HIS) and Picture Archiving and Communication System (PACS) vendors. Those proprietary formats are the big hurdle to form a nationwide or even worldwide e-health network. Thus there is an imperative need to solve the medical data integration problem. Moreover, many small clinics, many hospitals in developing countries and some regional hospitals in developed countries, which have limited budget, have been shunned from embracing the latest medical information technologies due to their high costs. In this paper, we propose an XML based middleware which acts as a translation engine to seamlessly integrate clinical ECG data from a variety of proprietary data formats. Furthermore, this ECG translation engine is designed in a way that it can be integrated into an existing PACS to provide a low cost medical information integration and storage solution. PMID:19964551

Li, Xuchen; Vojisavljevic, Vuk; Fang, Qiang

2009-01-01

397

Using XML and Java for Astronomical Instrumentation Control  

NASA Technical Reports Server (NTRS)

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

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

2000-01-01

398

Generic XML-based framework for metadata portals  

NASA Astrophysics Data System (ADS)

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

Schindler, Uwe; Diepenbroek, Michael

2008-12-01

399

Geospatial data and services semantic share based on ebXML registry  

NASA Astrophysics Data System (ADS)

Nowadays, huge volumes of geospatial data and services are available and accessible to people all over the world. However, they are searched mostly based on keyword, which is inherently restricted by the ambiguities of natural language, which can lead to low precision and recall. In this paper, semantic share of geospatial data and services are studied based on ebXML registry. But ebXML registry specification doesn't take into account the registration of the semantic information. So we define how OWL DL constructs are mapped to ebXML registry information model (ebRIM) constructs without causing any changes in the core ebXML registry specification. After that, predefined stored procedures are provided in the ebXML registry for semantic search, which provide necessary means to exploit the enhanced semantics stored in the Registry. Then, geospatial ontologies in change detection application of remote sensing based on Global Change Master Directory, ISO19119 and ISO19115 are established. Finally, a prototype system is developed based on an open source-ebxmlrr to demonstrate the proposed model and approach.

Chen, Xu; Zhu, Xinyan; Zhang, Xia; Du, Daosheng

2007-11-01

400

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

PubMed

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

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

2013-04-01

401

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

E-print Network

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

Boyer, Edmond

402

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

E-print Network

of this workshop has been to bring together researchers of the database (DB) and information retrieval (IR) fields by a (layered) database architecture that may enable efficient processing of complex XML-IR queries, or, where Hawking, "A Panoptic View on Databases, XML and IR" David Hawking from CSIRO in Canberra, Australia

de Vries, Arjen P.

403

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

404

DataStaR: Bridging XML and OWL in Science Metadata Management  

NASA Astrophysics Data System (ADS)

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

Lowe, Brian

405

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

E-print Network

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

Paolo Rossi

2014-07-02

406

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

407

The Alexander Method - A Technique for The Processing of Recursive Axioms in Deductive Databases  

Microsoft Academic Search

We propose a technique for handling recursive axioms in deductive databases. More precisely, we solve the following problem:\\u000a \\u000a Given a relational query including virtual relations defined from axioms (Horn clauses, with variables in the conclusion predefined\\u000a in the hypotheses), which can be recursive, how to translate this query into arelational program, i. e. a set of relational operations concerning only

J. Rohmer; R. Lescoeur; Jean-marc Kerisit

1986-01-01

408

Two-dimensional Yang-Mills theory on recursive infinite genus surfaces  

NASA Astrophysics Data System (ADS)

The partition function of Euclidean Yang-Mills theory on two dimensional surfaces is given by the Migdal formula. It involves the area and topological characteristics of the surface. We consider this theory on a class of infinite genus surfaces that are constructed recursively. We make use of this recursive structure to compute the partition functions (with or without additional Wilson loops) on such surfaces. Our method also works for the quantum deformed Yang-Mills theory.

Kumar, Dushyant

2014-09-01

409

Sub-band coding of images with Quadtree guided recursive polynomial decomposition  

E-print Network

SUB-BAND CODING OF IMAGES WITII QUADTREE GUIDED RECURSIVE POLYNOMIAL DECOMPOSITION A Thesis by EMIL ALFRED B. RAMIREZ Submitted to the Office of Graduate Studies of Texas ARM University in partial fulfillment of the requirements.... (August 1993) Emil Alfred B. Ramirez, B. S. , Texas ARM University Chair of Advisory Committee: Dr. Vinay Vaishampayan In this thesis, we develop a recursive polynomial transform coder and incorporate it in a sub-band coding (SBC) system...

Ramirez, Emil Alfred B

1993-01-01

410

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

411

Development of Updated ABsorption SIMulation Software (ABSIM)  

SciTech Connect

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

Yang, Zhiyao [Purdue University, West Lafayette, IN; Tang, Xin [Purdue University, West Lafayette, IN; Qu, Ming [Purdue University, West Lafayette, IN; Abdelaziz, Omar [ORNL; Gluesenkamp, Kyle R [ORNL

2014-01-01

412

Recursive SAM-based band selection for hyperspectral anomaly detection  

NASA Astrophysics Data System (ADS)

Band selection has been widely used in hyperspectral image processing for dimension reduction. In this paper, a recursive SAM-based band selection (RSAM-BBS) method is proposed. Once two initial bands are given, RSAM-BBS is performed in a sequential manner, and at each step the band that can best describe the spectral separation of two hyperspectral signatures is added to the bands already selected until the spectral angle reaches its maximum. In order to demonstrate the utility of the proposed band selection method, an anomaly detection algorithm is developed, which first extracts the anomalous target spectrum from the original image using automatic target detection and classification algorithm (ATDCA), followed by maximum spectral screening (MSS) to estimate the background average spectrum, then implements RSAM-BBS to select bands that participate in the subsequent adaptive cosine estimator (ACE) target detection. As shown in the experimental result on the AVIRIS dataset, less than five bands selected by the RSAM-BBS can achieve comparable detection performance using the full bands.

He, Yuanlei; Liu, Daizhi; Yi, Shihua

2010-10-01

413

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

Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

2012-01-01

414

A pruning method for the recursive least squared algorithm.  

PubMed

The recursive least squared (RLS) algorithm is an effective online training method for neural networks. However, its conjunctions with weight decay and pruning have not been well studied. This paper elucidates how generalization ability can be improved by selecting an appropriate initial value of the error covariance matrix in the RLS algorithm. Moreover, how the pruning of neural networks can be benefited by using the final value of the error covariance matrix will also be investigated. Our study found that the RLS algorithm is implicitly a weight decay method, where the weight decay effect is controlled by the initial value of the error covariance matrix; and that the inverse of the error covariance matrix is approximately equal to the Hessian matrix of the network being trained. We propose that neural networks are first trained by the RLS algorithm and then some unimportant weights are removed based on the approximate Hessian matrix. Simulation results show that our approach is an effective training and pruning method for neural networks. PMID:11316231

Leung, C S; Wong, K W; Sum, P F; Chan, L W

2001-03-01

415

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

416

Recursive recovery of Markov transition probabilities from boundary value data  

SciTech Connect

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

Patch, S.K.

1994-04-01

417

Fragment-based prediction of skin sensitization using recursive partitioning.  

PubMed

Skin sensitization is an important toxic endpoint in the risk assessment of chemicals. In this paper, structure-activity relationships analysis was performed on the skin sensitization potential of 357 compounds with local lymph node assay data. Structural fragments were extracted by GASTON (GrAph/Sequence/Tree extractiON) from the training set. Eight fragments with accuracy significantly higher than 0.73 (p<0.1) were retained to make up an indicator descriptor fragment. The fragment descriptor and eight other physicochemical descriptors closely related to the endpoint were calculated to construct the recursive partitioning tree (RP tree) for classification. The balanced accuracy of the training set, test set I, and test set II in the leave-one-out model were 0.846, 0.800, and 0.809, respectively. The results highlight that fragment-based RP tree is a preferable method for identifying skin sensitizers. Moreover, the selected fragments provide useful structural information for exploring sensitization mechanisms, and RP tree creates a graphic tree to identify the most important properties associated with skin sensitization. They can provide some guidance for designing of drugs with lower sensitization level. PMID:21932057

Lu, Jing; Zheng, Mingyue; Wang, Yong; Shen, Qiancheng; Luo, Xiaomin; Jiang, Hualiang; Chen, Kaixian

2011-09-01

418

Implementing Knowledge Update Sequences  

Microsoft Academic Search

Update of knowledge bases is becoming an important topic in Artificial Intelligence and a key problem in knowledge representation\\u000a and reasoning. One of the latest ideas to update logic programs is choosing between models of Minimal Generalised Answer Sets\\u000a to overcome disadvantages of previous approaches. This paper describes an implementation of the declarative version of updates\\u000a sequences that has been

Juan Carlos Acosta Guadarrama

2007-01-01

419

Performance evaluation of object serialization libraries in XML, JSON and binary formats  

Microsoft Academic Search

This paper compares twelve libraries of object serialization from qualitative and quantitative aspects. Those are object serialization in XML, JSON and binary formats. Using each library, a common example is serialized to a file. The size of the serialized file and the processing time are measured during the execution to compare all object serialization libraries. Some libraries show the performance

Kazuaki Maeda

2012-01-01

420

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

421

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

422

The Design of Publishing CRM System Based on J2EE and XML  

Microsoft Academic Search

With the opening of the publishing market, China's publishing industry is facing more and more fierce competition. And it has become a trend to research and develop the Customer Relationship Management (CRM) system for publishing houses in order to improve their integrated competitive power. The authors in this essay, after analyzing J2EE and XML technologies, put forward a framework of

Ling-Bo LIU; Da-Ke Ding; Huai-Li Zheng

2008-01-01

423

Experience with integrating Java with new technologies: C#, XML and web services  

Microsoft Academic Search

Java programmers cannot but be aware of Microsoft's new initiative - a complete language, network environment, and a host of supporting technologies under the title of C# .NET. We highlight the advantages of C# by presenting our experiences connecting it to Java in three ways. The first is by providing a platform and language-independent XML-based API called Views for developing

Judith Bishop; R. Nigel Horspool; Basil Worrall

2002-01-01

424

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

425

Texas A&M Libraries: DSpace XML UI Project Technical Overview  

E-print Network

This presentation describes the modifications to DSpace by Texas A&M Libraries to support an XML-based user interface. The purpose is to enable the establishment of a unique look-and-feel for each community & collection in DSpace; this may include...

Phillips, Scott

2005-07-07

426

Materialized views for P2P XML warehousing Ioana Manolescu Spyros Zoupanos  

E-print Network

1 Materialized views for P2P XML warehousing Ioana Manolescu Spyros Zoupanos INRIA Saclay 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

Manolescu, Ioana

427

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

428

A Semantic Analysis of XML Schema Matching for B2B Systems Integration  

ERIC Educational Resources Information Center

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

Kim, Jaewook

2011-01-01

429

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

E-print Network

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

Wang, Xiaoyang "Sean"

430

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

431

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

E-print Network

, Performance Keywords Deep Web, Domain-Specific Markup Languages, Hidden Web, Multidisciplinary workThe Hidden Web, XML and the Semantic Web: Scientific Data Management Perspectives Fabian M Télécom; Télécom Paristech; CNRS LTCI Paris France pierre@xsenellart.com ABSTRACT The World Wide Web

Paris-Sud XI, Université de

432

Association Rule Extraction from XML Stream Data for Wireless Sensor Networks  

PubMed Central

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

433

A database approach to content-based XML retrieval Djoerd Hiemstra  

E-print Network

and information retrieval (IR) function- ality into a database system. We describe a first prototype system)Extension Extension Object algebra for language model IR extensions Figure 1: Database internals Figure 1 shows-model database approach. 2.1 All of XPath and modern IR queries The conceptual level should support XML and IR

Hiemstra, Djoerd

434

Query Processing for Large-Scale XML Message Brokering Yanlei Diao  

E-print Network

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

Diao, Yanlei

435

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

Microsoft Academic Search

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

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

2006-01-01

436

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, Felix; Sons, Kristian; Rubinstein, Dmitri; Slusallek, Philipp

2013-01-01

437

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

E-print Network

Build a digital book with EPUB The open XML-based eBook format Skill Level: Intermediate Liza Daly documentation, create an eBook, or just archive your favorite blog posts? EPUB is an open specification revised the content of Listing 3 and refreshed the epub-raw-files.zip file (see Downloads). 27 Apr 2010

Silber, Georges-André

438

An XML-based multimedia document processing model for content adaptation  

E-print Network

An XML-based multimedia document processing model for content adaptation Lionel Villard, Cécile. This presentation process is based on XSLT transformation techniques and constraint technologies for document framework of our approach for multimedia document processing. We present then the multimedia document model

Joseph Fourier Grenoble-I, Université

439

Study of an API migration for two XML APIs Thiago Tonelli Bartolomei1, Krzysztof Czarnecki1,  

E-print Network

Study of an API migration for two XML APIs Thiago Tonelli Bartolomei1, Krzysztof Czarnecki1, Ralf L Abstract. API migration refers to adapting an application such that its depen- dence on a given API (the source API) is eliminated in favor of depending on an alternative API (the target API) with the source

Czarnecki, Krzysztof

440

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

E-print Network

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

Aboulnaga, Ashraf

441

Rapid Development of Web-Based Query Interfaces for XML Datasets with QURSED  

E-print Network

. of Computer Science and Engineering, SUNY at Buffalo, Buffalo, NY rk39@buffalo.edu Michalis Petropoulos Dept. of Computer Science and Engineering, SUNY at Buffalo, Buffalo, NY mpetropo@buffalo.edu ABSTRACT We present-based QFRs over XML data. The QURSED system is available online at http://db.cse.buffalo

Petropoulos, Michalis

442

Chapter 12 Fuzzy data mining for the semantic web: Building XML mediator schemas  

Microsoft Academic Search

As highlighted by the World Wide Web Consortium, XML has been proposed to deal with huge volumes of electronic documents and is playing an increasing important role in the exchange of a wide variety of data on the Web. However, when dealing with such large and heterogeneous data sources, it is necessary to have an idea on the way these

P. Poncelet; M TEISSEIRE

2006-01-01

443

XML-Based Generator of C++ Code for Integration With GUIs  

NASA Technical Reports Server (NTRS)

An open source computer program has been developed to satisfy a need for simplified organization of structured input data for scientific simulation programs. Typically, such input data are parsed in from a flat American Standard Code for Information Interchange (ASCII) text file into computational data structures. Also typically, when a graphical user interface (GUI) is used, there is a need to completely duplicate the input information while providing it to a user in a more structured form. Heretofore, the duplication of the input information has entailed duplication of software efforts and increases in susceptibility to software errors because of the concomitant need to maintain two independent input-handling mechanisms. The present program implements a method in which the input data for a simulation program are completely specified in an Extensible Markup Language (XML)-based text file. The key benefit for XML is storing input data in a structured manner. More importantly, XML allows not just storing of data but also describing what each of the data items are. That XML file contains information useful for rendering the data by other applications. It also then generates data structures in the C++ language that are to be used in the simulation program. In this method, all input data are specified in one place only, and it is easy to integrate the data structures into both the simulation program and the GUI. XML-to-C is useful in two ways: 1. As an executable, it generates the corresponding C++ classes and 2. As a library, it automatically fills the objects with the input data values.

Hua, Hook; Oyafuso, Fabiano; Klimeck, Gerhard

2003-01-01

444

Updating Semantic Web Data  

Microsoft Academic Search

The basic data model for the Semantic Web is the Resource Description Framework (RDF). From a data management point of view, it resembles a lightweight knowledge base. In this paper we address updates in RDF. It is known that the semantics of updates for data models becomes unclear when the model turns, even slightly, more general than a simple relational

Claudio Gutierrez

445

Country Update: Israel 2005  

ERIC Educational Resources Information Center

Country Updates is a new section of "Intercultural Education." Starting in "Intercultural Education," Volume 16 No. 5, this column will focus on recent developments during the last two to three years in the field of intercultural education in one particular country. These updates can include recent policy decisions, the main results of important

Marar, Marianne Maurice

2005-01-01

446

K*SQL: A Unifying Engine for Sequence Patterns and XML Barzan Mozafari Kai Zeng Carlo Zaniolo  

E-print Network

-friendly interfaces. We also present several K*SQL queries from stock market, XML, software trace analysis and genomic patterns in online-user behavior, RFID data pro- cessing, asset tracking, weather forecast, fraud detection

447

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

448

Parameter Estimation of a Closed Loop Coupled Tank Time Varying System using Recursive Methods  

NASA Astrophysics Data System (ADS)

This project investigates the direct identification of closed loop plant using discrete-time approach. The uses of Recursive Least Squares (RLS), Recursive Instrumental Variable (RIV) and Recursive Instrumental Variable with Centre-Of-Triangle (RIV + COT) in the parameter estimation of closed loop time varying system have been considered. The algorithms were applied in a coupled tank system that employs covariance resetting technique where the time of parameter changes occur is unknown. The performances of all the parameter estimation methods, RLS, RIV and RIV + COT were compared. The estimation of the system whose output was corrupted with white and coloured noises were investigated. Covariance resetting technique successfully executed when the parameters change. RIV + COT gives better estimates than RLS and RIV in terms of convergence and maximum overshoot.

Basir, Siti Nora; Selamat, Hazlina; Yussof, Hanafiah; Ismarrubie Zahari, Nur; Shamsuddin, Syamimi

2013-12-01

449

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

450

Frame recursive dynamic mean bias removal technique for robust environment-aware speech recognition in real world applications  

Microsoft Academic Search

In this paper, we investigated and simulated the frame recursive dynamic mean bias removing technique in the cepstral domain with a time smoothing parameter in order to improve the robustness of automatic speech recognition (ASR) in realtime environments. The objective of this simulation was to examine the suitability of the frame recursive cepstral mean bias removal technique as a part

M. F. R. Chowdhury; S.-A. Selouani; D. O'Shaughnessy

2010-01-01

451

Recursively Enumerable Languages: Examples The set of C program-input pairs that do not run into  

E-print Network

string x ( - { }) , M(x) = f(x). · We call f a recursive functiona if such an M exists. aKurt G¨odel (1931, 1934). c2012 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 46 #12;Kurt G¨odela (1906 (concluded) · Many other computation models have been proposed. ­ Recursive function (G¨odel), calculus

Lyuu, Yuh-Dauh

452

Recursively Enumerable Languages: Examples The set of C program-input pairs that do not run into  

E-print Network

string x ( - { }) , M(x) = f(x). · We call f a recursive functiona if such an M exists. aKurt G¨odel (1931, 1934). c2013 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 46 #12;Kurt G¨odela (1906 (concluded) · Many other computation models have been proposed. ­ Recursive function (G¨odel), calculus

Lyuu, Yuh-Dauh

453

In Neurocomputing 20(1-3): 279-294 (1998). A recursive algorithm based on the extended Kalman filter  

E-print Network

In Neurocomputing 20(1-3): 279-294 (1998). A recursive algorithm based on the extended Kalman The Extended Kalman Filter (EKF) is a well known tool for the recursive parameter estimation of static: Feedforward Neural Networks; Process Modeling; Second-Order Training Algorithms; Extended Kalman Filter. 1

Paris-Sud XI, Université de

454

Technical Report BUCS-TR-2010-035, Computer Science Department, Boston University On Supporting Mobility and Multihoming in Recursive  

E-print Network

Technical Report BUCS-TR-2010-035, Computer Science Department, Boston University On Supporting of the process of ROuting in Recursive Architectures (RORA). We also perform an average-case cost analysis · mobility support · Multihoming · Loc/id split · recursive architecture · performance analysis · simulation

455

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

NASA Technical Reports Server (NTRS)

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

Mueller, A. C.

1977-01-01

456

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

457

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

458

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

459

XML standards as the basis for data interoperability among military C2 systems and beyond  

Microsoft Academic Search

Today's battlefield requires agility in a matter of minutes, not hours or days, but there is a critical data sharing gap at the tactical edge. Implementation of the DOD Net-Centric Data Strategy through XML-based data standards is essential to fixing this problem and providing an environment where interoperable data is available to the war-fighter wherever and whenever needed. To address

R. Beardsworth; D. O'Neill; P. Barry; S. Renner; J. Wandelt

2010-01-01

460

Design of Automation Systems for Web Based Courseware Using XML and XSLT  

Microsoft Academic Search

\\u000a Reported is our approach for Web based mathematical courseware generation. To decrease development costs of the courseware,\\u000a we have developed a system e-Math Interaction Agent that automatically generates learning materials using Semantic Web\\u000a technologies, such as XML and XSLT. Knowledge databases containing math formulas and basic economic knowledge form the core\\u000a mechanism of the system. Given the necessary

Yukari Shirota

2005-01-01

461

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 genotypephenotype correlation analyses. This application implements a method of phenotypegenotype 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 phenotypegenotype 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. PMID:16501185

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

462

Social Research Update  

NSDL National Science Digital Library

Social Research Update is a quarterly publication of the Department of Sociology at the University of Surrey, UK. Its purpose is to help social researchers keep up to date with developments in their field. Each issue covers developments in one specific topic. Past Updates have covered such issues as focus groups, correspondence analysis, visual research methods, archiving qualitative research data, and analyzing qualitative data by computer, among others. Each issue is accompanied by a bibliography for further research.

463

Should Iteration and Recursion Be Part of the Secondary Student's Mathematics Toolbox?  

ERIC Educational Resources Information Center

Presents examples to illustrate that iteration and recursion are useful pedagogical tools that can be used in many areas of mathematics, make models traditionally taught in upper levels accessible in grades 9-14, and provide alternative problem solving approaches less dependent upon ready-made formulas. (Author/MM)

Quesada, Antonio

1999-01-01

464

MODIFIED-CS-RESIDUAL FOR RECURSIVE RECONSTRUCTION OF HIGHLY UNDERSAMPLED FUNCTIONAL MRI SEQUENCES  

E-print Network

MODIFIED-CS-RESIDUAL FOR RECURSIVE RECONSTRUCTION OF HIGHLY UNDERSAMPLED FUNCTIONAL MRI SEQUENCES) based approaches for blood oxygenation level dependent (BOLD) contrast functional MR imaging (fMRI). In particular, we show, via exhaustive experiments on actual MR scanner data for brain fMRI, that our recently

Vaswani, Namrata

465

Novel Hardware-Software Architecture for the Recursive Merge Filtering Algorithm  

Microsoft Academic Search

As reconfigurable devices move to the forefront of mainstream processing, the spectrum of application areas for such devices is also increasing. One such area is image processing. In this paper we present a novel hardware-software codesign architecture for the computation of the Discrete Wavelet Transform (DWT), based on a new Recursive Merge Filtering (RMF) algorithm. The architecture aims at reducing

Piyush S Jamkhandi; Amar Mukherjee; Kunal Mukherjee; Robert Franceschini

466

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

E-print Network

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

Huber, Manfred

467

Recursive least-squares lattices and trigonometry in the spherical triangle  

Microsoft Academic Search

The three fundamental planar biorthogonalization steps which underlie the geometric derivation of the fast recursive least squares (FRLS) adaptive lattices are gathered into a unit-length 3-D tetrahedron. The inverse of Yule's PARCOR Identity (YPII) then admits a nice geometric interpretation in terms of projections into this tetrahedron. Since tetrahedrons are closely related to spherical triangles, YPII is recognized as the

F. Desbouvries

1993-01-01

468

Conditions for tangent plane continuity over recursively generated B-spline surfaces  

Microsoft Academic Search

The continuity properties of recursively generated B-spline surfaces over an arbitrary topology have been related to the eigenproperties of the local subdivision transformation. In this paper a discrete Fourier transform technique is employed to derive these eigenproperties for a general choice of subdivision weightings. Conditions on these weightings are identified for tangent plane continuity at the extraordinary points and a

D. J. T. Storry; A. A. Ball

1988-01-01

469

A recursive construction of joint eigenfunctions for the hyperbolic nonrelativistic Calogero-Moser Hamiltonians  

E-print Network

We obtain symmetric joint eigenfunctions for the commuting PDOs associated to the hyperbolic Calogero-Moser N-particle system. The eigenfunctions are constructed via a recursion scheme, which leads to representations by multidimensional integrals whose integrands are elementary functions. We also tie in these eigenfunctions with the Heckman-Opdam hypergeometric function for the root system A_{N-1}.

Martin Hallns; Simon Ruijsenaars

2014-10-02

470

Pathways to Early Coital Debut for Adolescent Girls: A Recursive Partitioning Analysis  

Microsoft Academic Search

This study examined pathways to early coital debut among early to middle adolescent girls in the United States. In a two-year longitudinal study of 104 adolescent girls, recursive partitioning (RP) analyses were conducted to examine the specific factors that were related to engaging in first intercourse by the 10th grade among adolescent girls who had not yet engaged in sexual

Matthew R. Pearson; Tatyana Kholodkov; James M. Henson; Emily A. Impett

2012-01-01

471

Pathways to Early Coital Debut for Adolescent Girls: A Recursive Partitioning Analysis  

Microsoft Academic Search

This study examined pathways to early coital debut among early to middle adolescent girls in the United States. In a two-year longitudinal study of 104 adolescent girls, recursive partitioning (RP) analyses were conducted to examine the specific factors that were related to engaging in first intercourse by the 10th grade among adolescent girls who had not yet engaged in sexual

Matthew R. Pearson; Tatyana Kholodkov; James M. Henson; Emily A. Impett

2011-01-01

472

A Brief Tutorial On Recursive Estimation With Examples From Intelligent Vehicle  

E-print Network

A Brief Tutorial On Recursive Estimation With Examples From Intelligent Vehicle Applications (Part intelligent vehicle applications. In this article, we focus rather on a "local" issue, i.e. the system model estimation, state, system model, Kalman filter (KF), intelligent vehicles 1 Introduction This article follows

Paris-Sud XI, Université de

473

On integral and local limit theorems for recursive Markov renewal processes  

Microsoft Academic Search

i=1 under the natural conditions that the MRP under consideration is recursive. We obtain integral and local limit theorems that can be regarded as a generalization of the central limit theorem (CLT) for MRP's. Improvements of these theorems are also obtained: an estimate of Berry-Esseen type and asymptotic expansions in powers of t -1\\/2.

V. K. Malinovskii

1991-01-01

474

Identification of the Givental Formula with the Spectral Curve Topological Recursion Procedure  

NASA Astrophysics Data System (ADS)

We identify the Givental formula for the ancestor formal Gromov-Witten potential with a version of the topological recursion procedure for a collection of isolated local germs of the spectral curve. As an application we prove a conjecture of Norbury and Scott on the reconstruction of the stationary sector of the Gromov-Witten potential of via a particular spectral curve.

Dunin-Barkowski, P.; Orantin, N.; Shadrin, S.; Spitz, L.

2014-06-01

475

Recursive Total Least Squares: An Alternative to the Discrete Kalman Filter  

E-print Network

Recursive Total Least Squares: An Alternative to the Discrete Kalman Filter Daniel L. Boley The discrete Kalman lter, which is becoming a common tool for reducing uncertainty in robot navigation, su ers total least squares estimator (RTLS) as an alternative to the Kalman lter, and compare

Boley, Daniel

476

Pseudo Cuntz Algebra and Recursive FP Ghost System in String Theory  

E-print Network

RIMS­1333 Pseudo Cuntz Algebra and Recursive FP Ghost System in String Theory Mitsuo Abe a Abstract Representation of the algebra of FP (anti)ghosts in string theory is studied by generalizing, is introduced. The algebra of FP (anti)ghosts in string theory is embedded into the pseudo Cuntz algebra

477

Recursive Output Only Subspace Identification for In-flight Flutter Ivan Goethals  

E-print Network

Recursive Output Only Subspace Identification for In-flight Flutter Monitoring Ivan Goethals it an excellent kandidate for use during in-flight flutter tests. 1 INTRODUCTION In-flight flutter tests require of flutter, the quality of the fault detection algorithm, and hence also of the nominal model that it uses

478

The Recursive NanoBox Processor Grid: A Reliable System Architecture for Unreliable Nanotechnology Devices  

E-print Network

The Recursive NanoBox Processor Grid: A Reliable System Architecture for Unreliable Nanotechnology, Minneapolis, MN 55455 Telephone: 612-625-5007 Fax: 612-625-4583 Abstract Advanced molecular nanotechnology designed for fabrication with unreliable nanotechnology devices. This architecture is composed of many

Minnesota, University of

479

Innovative Methodology Recursive Bayesian Decoding of Motor Cortical Signals by Particle Filtering  

E-print Network

Innovative Methodology Recursive Bayesian Decoding of Motor Cortical Signals by Particle Filtering for the Neural Basis of Cognition, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213 Submitted 26 of action and also for its potential use in controlling robotic devices (Black et al. 2003; Chapin et al

Kass, Rob

480

Identification of dynamic parameters of an industrial robot using a recursively-optimized trajectory  

Microsoft Academic Search

Dynamic parameters of a robot affect the performance of advanced control schemes significantly. In this study experiments to identify the dynamic parameters of AT2 robot are carried out. The excitation trajectory for identification is parameterized with Fourier series. The trajectory is optimized to minimize effects of uncertainty using condition number as the index. Recursive optimization is proposed so that the

Yunjin Gu; Hyuk Wang; Jang Ho Cho; Doo Yong Lee

2010-01-01

481

RANGE RECURSIVE SPACE TIME ADAPTIVE PROCESSING (STAP) FOR MIMO AIRBORNE RADAR  

E-print Network

RANGE RECURSIVE SPACE TIME ADAPTIVE PROCESSING (STAP) FOR MIMO AIRBORNE RADAR Sylvie Marcos) of multi input multi output (MIMO) airborne radar signals involved in clutter rejection for the detection. INTRODUCTION Space time adaptive processing (STAP) of airborne radar signals received on an array of antennas

482

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

NASA Technical Reports Server (NTRS)

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

Vanrooy, D. L.

1976-01-01

483

Underdetermined-order recursive least-squares adaptive filtering: the concept and algorithms  

Microsoft Academic Search

Underdetermined recursive least-squares (URLS) adaptive filtering is introduced. In particular, the URLS algorithm is derived and shown to be a direct consequence of the principle of minimal disturbance. By exploiting the Hankel structure of the filter input matrix, the fast transversal filter (FTF) version of the URLS algorithm (URLS-FTF) is derived including sliding window and growing window types. The computational

Buyurman Baykal; Anthony G. Constantinides

1997-01-01

484

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

ERIC Educational Resources Information Center

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

Keeney, Hillary; Keeney, Bradford

2012-01-01

485

A recursion formula for the correlation functions of an inhomogeneous XXX model  

Microsoft Academic Search

A new recursion formula is presented for the correlation functions of the integrable spin 1\\/2 XXX chain with inhomogeneity. It relates the correlators involving n consecutive lattice sites to those with n-1 and n-2 sites. In a series of papers by V. Korepin and two of the present authors, it was discovered that the correlators have a certain specific structure

H. Boos; M. Jimbo; T. Miwa; F. Smirnov; Y. Takeyama

2004-01-01

486

Computational Soundness of a Call by Name Calculus of Recursively-scoped Records.  

E-print Network

Computational Soundness of a Call by Name Calculus of Recursively-scoped Records. UMM Working the meaning of a record as defined by the evaluation relation. The computational soundness property implies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2 Call-by-Name Calculus of Records 3 2.1 Term Level Calculus

Machkasova, Elena

487

Recursive least squares adaptive noise cancellation filtering for heart sound reduction in lung sounds recordings  

Microsoft Academic Search

It is rarely possible to obtain recordings of lung sounds that are 100% free of contaminating sounds from non-respiratory sources, such as the heart. Depending on pulmonary airflow, sensor location, and individual physiology, heart sounds may obscure lung sounds in both time and frequency domains, and thus pose a challenge for development of semi-automated diagnostic techniques. In this study, recursive

J. Gnitecki; Z. Moussavi; H. Pasterkamp

2003-01-01

488

Computational Soundness of a Call by Name Calculus of Recursively-scoped Records  

E-print Network

WRS 2007 Computational Soundness of a Call by Name Calculus of Recursively-scoped Records Elena the meaning of a record as defined by the evaluation relation. The computational soundness property implies a record, specialization, etc. The computational soundness result implies that all such transformations

Machkasova, Elena

489

A General Recursion Method for Calculating Diffracted Intensities from Crystals Containing Planar Faults  

NASA Astrophysics Data System (ADS)

A general recursion algorithm is described for calculating kinematical diffraction intensities from crystals containing coherent planar faults. The method exploits the self-similar stacking sequences that occur when layers stack non-deterministically. Recursion gives a set of simple relations between average interference terms from a statistical crystal, which can be solved as a set of simultaneous equations. The diffracted intensity for a polycrystalline sample is given by the incoherent sum of scattered intensities over an ensemble of crystallites. The relations between this and previous approaches, namely the Hendricks-Teller matrix formulation, the difference equation method, the summed series formula of Cowley, and Michalski's recurrence relations between average phase factors, are discussed. Although formally identical to these previous methods, the present recursive description has an intuitive appeal and proves easier to apply to complex crystal structure types. The method is valid for all types of planar faults, can accommodate long-range stacking correlations, and is applicable to crystals that contain only a finite number of layers. A FORTRAN program DIFFaX, based on this recursion algorithm, has been written and used to simulate powder X-ray (and neutron) diffraction patterns and single crystal electron (kinematical) diffraction patterns. Calculations for diamond-lonsdaleite and for several synthetic zeolite systems that contain high densities of stacking faults are presented as examples.

Treacy, M. M. J.; Newsam, J. M.; Deem, M. W.

1991-06-01

490

Recursive Estimation of the Preisach Density function for a Smart Actuator  

E-print Network

Recursive Estimation of the Preisach Density function for a Smart Actuator Ram V. Iyer Department the approximate density function. These methods can be implemented in real-time controllers for smart actuators in ferromagnetism or electric field intensity E and polarization P in ferroelectricity, is described by a hysteresis

Iyer, Ram Venkataraman

491

Unsupervised Mitochondria Segmentation using Recursive Spectral Clustering and Adaptive Similarity Models  

E-print Network

Unsupervised Mitochondria Segmentation using Recursive Spectral Clustering and Adaptive Similarity of the mitochondria in less than 15 hours. A highly active research direction towards the automation pursuit such as mitochondria, for example, is yet to become available and up to date only a few applied solutions have been

Whelan, Paul F.

492

Recursive Least-Squares Adaptive Channel Estimation for Spatial Modulation Systems  

E-print Network

Recursive Least-Squares Adaptive Channel Estimation for Spatial Modulation Systems Mohammed Mujahid for spatial modulation (SM) system over a block fading multiple-input­multiple-output (MIMO) channel. The performance of spatial modulation with channel estimation is compared to vertical Bell Labs layered space

Al-Ghadhban, Samir

493

LARSON--MATH 556SAGE WORKSHEET 04 Recursion--Graph Theory  

E-print Network

Last name First name LARSON--MATH 556­SAGE WORKSHEET 04 Recursion--Graph Theory 1. Log in to your Sage Cloud account. (a) Start Firefox or Chrome browser. (b) Go to http://cloud.sagemath.com (c) Click "Sign In". (d) Click project Classroom Worksheets. (e) Click "New", call it s04, then click "Sage

Larson, Craig E.

494

Text Document Topical Recursive Clustering and Automatic Labeling of a Hierarchy of  

E-print Network

borrows Community Mining from Social Net- work Analysis to discover different topical coherent document gives overall good labels for document clusters. 2 Related Work 2.1 Attempts in improving the rankedText Document Topical Recursive Clustering and Automatic Labeling of a Hierarchy of Document

Zaiane, Osmar R.

495

A robust, parallelizable, O(m), a posteriori recursive least squares algorithm for efficient adaptive filtering  

Microsoft Academic Search

This article presents a new recursive least squares (RLS) adaptive algorithm. The proposed computational scheme uses a finite window by means of a lemma for the system matrix inversion that is, for the first time, stated and proven here. The new algorithm has excellent tracking capabilities. Moreover, its particular structure allows for stabilization by means of a quite simple method.

C. Papaodysseus

1999-01-01

496

Finite-stage stochastic decision processes with recursive reward structure I: optimality equations and deterministic strategies  

Microsoft Academic Search

In this paper we examine an N-stage stochastic decision model with a recursive reward structure whose state and action spaces are standard Borel ones. The central results relate to the validity of the optimality equations and to the sufficiency of deterministic strategies. The results expand statements known for classical dynamic programming problems with additive total rewards to a wide class

H. D. Dahlke

1992-01-01

497

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

NASA Technical Reports Server (NTRS)

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

Tilton, James C. (Inventor)

2010-01-01

498

2-D ROBUST RECURSIVE LEAST SQUARES LATTICE ALGORITHM FOR DEFECT INSPECTION OF TEXTILE PRODUCTS*  

E-print Network

2-D ROBUST RECURSIVE LEAST SQUARES LATTICE ALGORITHM FOR DEFECT INSPECTION OF TEXTILE PRODUCTS* Ruen Meylani1 , Ayin Ertüzün1 , Aytül Erçil 2 1 Department of Electrical and Electronic Engineering, 2

499

Combination of Multiple Handwritten Text Line Recognition Systems with a Recursive Approach  

E-print Network

Combination of Multiple Handwritten Text Line Recognition Systems with a Recursive Approach Roman In this paper we propose a novel method to combine the results of multiple text line recognition systems based on the initial combination of the base recognisers' results. By means of the new method

Paris-Sud XI, Université de

500

A recursive method for the dynamic analysis of mechanical systems in spatial motion  

Microsoft Academic Search

Summary In the present study, a recursive method for generating the equations of motion of mechanical systems that undergo spatial motion is presented. The method uses the force and moment equations to generate the rigid body equations of motion in terms of the Cartesian coordinates of a dynamically equivalent constrained system of particles, without introducing any rotational coordinates and the

H. A. Attia

2004-01-01