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

Updating XML views published over relational databases: Towards the existence of a correct update mapping  

Microsoft Academic Search

XML data management using relational database systems has been intensively stud- ied in the last few years. However, in order for such systems to be viable, they must support not only queries, but also updates over virtual XML views that wrap the relational data. While view updating is a long-standing difficult issue in the rela- tional context, the flexible XML

Ling Wang; Elke A. Rundensteiner; Murali Mani

2006-01-01

2

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

NASA Astrophysics Data System (ADS)

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

Suzuki, Nobutaka

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

An XML Transformation Algorithm Inferred from an Update Script between DTDs  

NASA Astrophysics Data System (ADS)

Finding an appropriate data transformation between two schemas has been an important problem. In this paper, assuming that an update script between original and updated DTDs is available, we consider inferring a transformation algorithm from the original DTD and the update script such that the algorithm transforms each document valid against the original DTD into a document valid against the updated DTD. We first show a transformation algorithm inferred from a DTD and an update script. We next show a sufficient condition under which the transformation algorithm inferred from a DTD d and an update script is unambiguous, i.e., for any document t valid against d, elements to be deleted/inserted can unambiguously be determined. Finally, we show a polynomial-time algorithm for testing the sufficient condition.

Suzuki, Nobutaka; Fukushima, Yuji

5

XML Files  

MedlinePLUS

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

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

EXRT: Towards a Simple Benchmark for XML Readiness Testing  

NASA Astrophysics Data System (ADS)

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

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

8

XML for Bioinformatics XML for Bioinformatics  

E-print Network

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

Richer, Jean-Michel

9

XML, RDF, and Relatives  

Microsoft Academic Search

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

Michel C. A. Klein

2001-01-01

10

Recursive ?_{1,infty} Group Lasso  

NASA Astrophysics Data System (ADS)

We introduce a recursive adaptive group lasso algorithm for real-time penalized least squares prediction that produces a time sequence of optimal sparse predictor coefficient vectors. At each time index the proposed algorithm computes an exact update of the optimal $\\ell_{1,\\infty}$-penalized recursive least squares (RLS) predictor. Each update minimizes a convex but nondifferentiable function optimization problem. We develop an online homotopy method to reduce the computational complexity. Numerical simulations demonstrate that the proposed algorithm outperforms the $\\ell_1$ regularized RLS algorithm for a group sparse system identification problem and has lower implementation complexity than direct group lasso solvers.

Chen, Yilun; Hero, Alfred O.

2012-08-01

11

On recursion  

PubMed Central

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

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

2014-01-01

12

ScotlandsPlaces XML: Bespoke XML or XML Mapping?  

ERIC Educational Resources Information Center

Purpose: The purpose of this paper is to investigate web services (in the form of parameterised URLs), specifically in the context of the ScotlandsPlaces project. This involves cross-domain querying, data retrieval and display via the development of a bespoke XML standard rather than existing XML formats and mapping between them.…

Beamer, Ashley; Gillick, Mark

2010-01-01

13

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

E-print Network

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

Gray, Alexander

14

XML Based Course Websites.  

ERIC Educational Resources Information Center

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

Wollowski, Michael

15

On Distributing XML Repositories  

Microsoft Academic Search

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

Jan-marco Bremer; Michael Gertz

2003-01-01

16

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

17

RECURSIVE TREES Michael Drmota  

E-print Network

copies of ancient texts · convex hull algorithms · ... #12;Enumeration of Recursive Trees All recursiveRECURSIVE TREES Michael Drmota Institue of Discrete Mathematics and Geometry Vienna University School on GROWTH AND SHAPES, Paris, IHP, June 2­6, 2008 #12;Contents · Combinatorics on Recursive Trees

Drmota, Michael

18

The complexity of recursion schemes and recursive programming languages  

Microsoft Academic Search

Deterministic exponential lower time bounds are obtained for analyzing monadic recursion schemes, multi-variable recursion schemes, and recursive programs. The lower bound for multivariable recursion schemes holds for any domain of interpretation with at least two elements. The lower bound for recursive programs holds for any recursive programming language with a nontrivial predicate test (i.e. a predicate test that is neither

Harry B. Hunt; Daniel J. Rosenkrantz

1980-01-01

19

Mixed Mode XML Query Processing  

Microsoft Academic Search

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

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

2003-01-01

20

XML Applications in the Sciences  

Microsoft Academic Search

The Extensible Markup Language (XML) is emerging as a standard format for structured data. Various scientific disciplines are in the process of defining XML document type definitions (DTDs) for communication among specialists. XML applications in the fields of chemistry, molecular biology, and mathematics are described and the relevance of such applications to science librarianship is discussed.

Ronald W. Gilmour

2000-01-01

21

VoiceXML Forum  

NSDL National Science Digital Library

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

22

Recursive Functions in Iris  

Microsoft Academic Search

A complete and efficient implementation of linear, one-side recursive queries in Iris, an object-oriented database management system, is described. It is shown that recursion can be easily and efficiently added to a large class of existing database management systems. A B-tree type access path called the B++ tree that has been implemented to support the computation of recursive functions in

Philippe De Smedt; Stefano Ceri; Marie-anne Neimat; Ming-chien Shan; Rafi Ahmed

1993-01-01

23

Inclusion Dependencies in XML: Extending Relational Semantics  

Microsoft Academic Search

In this article we define a new type of integrity constraint in XML, called an XML inclusion constraint (XIND), and show that it extends the semantics of a relational inclusion dependency. This property is important in areas such as XML publishing and 'data-centric' XML, and is one that is not possessed by other proposals for XML inclusion constraints. We also

Michael Karlinger; Millist W. Vincent; Michael Schrefl

2009-01-01

24

Document image representation using XML technologies  

NASA Astrophysics Data System (ADS)

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

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

2001-12-01

25

L-Tree: a Dynamic Labeling Structure for Ordered XML Data  

E-print Network

Research Center, ¤ mihaila,srp,bordaw¥ @us.ibm.com Abstract. With the ever growing use of XML as a data updates. To speed up query processing, various labeling schemes have been proposed. However, the vast and O(log n) bits per label. L-Tree has good performance on updates without compromising the performance

Pennsylvania, University of

26

Modeling Recursive RNA Interference  

PubMed Central

An important application of the RNA interference (RNAi) pathway is its use as a small RNA-based regulatory system commonly exploited to suppress expression of target genes to test their function in vivo. In several published experiments, RNAi has been used to inactivate components of the RNAi pathway itself, a procedure termed recursive RNAi in this report. The theoretical basis of recursive RNAi is unclear since the procedure could potentially be self-defeating, and in practice the effectiveness of recursive RNAi in published experiments is highly variable. A mathematical model for recursive RNAi was developed and used to investigate the range of conditions under which the procedure should be effective. The model predicts that the effectiveness of recursive RNAi is strongly dependent on the efficacy of RNAi at knocking down target gene expression. This efficacy is known to vary highly between different cell types, and comparison of the model predictions to published experimental data suggests that variation in RNAi efficacy may be the main cause of discrepancies between published recursive RNAi experiments in different organisms. The model suggests potential ways to optimize the effectiveness of recursive RNAi both for screening of RNAi components as well as for improved temporal control of gene expression in switch off–switch on experiments. PMID:18802453

Marshall, Wallace F.

2008-01-01

27

XML technologies and software engineering  

Microsoft Academic Search

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

Cecilia Mascolo; Wolfgang Emmerich; Anthony Finkelstein

2001-01-01

28

TIMBER: A native XML database  

Microsoft Academic Search

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

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

2002-01-01

29

XML Databases and Biomedical Informatics  

E-print Network

, or specific medical domain topics. The paper will look at the various properties of medical data in general and how it utilizes XML database technology. Medical Data Research On June 3, 1999 the Working Group of the long standing open problems is finding a way to share medical data across a variety of mediums. XML has

Demurjian, Steven A.

30

Recursive relational urban design  

E-print Network

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

Hillman, Dessen

2014-01-01

31

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

32

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

33

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, Maurício Dias

2012-01-01

34

XRANK: ranked keyword search over XML documents  

Microsoft Academic Search

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

Lin Guo; Feng Shao; Chavdar Botev; Jayavel Shanmugasundaram

2003-01-01

35

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

36

XML Publishing: Bridging Theory and Practice  

Microsoft Academic Search

Transforming relational data into XML, as known as XML publishing, is often necessary when one wants to exchange data residing in databases or to create an XML interface of a traditional database. This paper aims to provide an overview of recent advances in XML publish- ing. We present a notion of publishing transducers recently developed for studying the expressive power

Wenfei Fan

2007-01-01

37

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

38

Recursively Imputed Survival Trees  

PubMed Central

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

Zhu, Ruoqing; Kosorok, Michael R.

2011-01-01

39

Recursion, Computers and Art  

ERIC Educational Resources Information Center

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

Kemp, Andy

2007-01-01

40

Recursive rational choice  

SciTech Connect

It is the purpose of the present study to indicate the means by which Kramer's results may be generalized to considerations of stronger computing devices than the finite state automata considered in Kramer's approach, and to domains of alternatives having the cardinality of the continuum. The means we employ in the approach makes use of the theory of recursive functions in the context of Church's Thesis. The result, which we consider as a preliminary result to a more general research program, shows that a choice function that is rational in the sense of Richter (not necessarily regular) when defined on a restricted family of subsets of a continuum of alternatives, when recursively represented by a partial predicate on equivalence classes of approximations by rational numbers, is recursively unsolvable. By way of Church's Thesis, therefore, such a function cannot be realized by means of a very general class of effectively computable procedures. An additional consequence that can be derived from the result of recursive unsolvability of rational choice in this setting is the placement of a minimal bound on the amount of computational complexity entailed by effective realizations of rational choice.

Lewis, A.A.

1981-11-01

41

Recursion in Aphasia  

ERIC Educational Resources Information Center

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

Banreti, Zoltan

2010-01-01

42

Recursive quantum repeater networks  

E-print Network

Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving flexibility and reducing redundant engineering effort. Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined. We propose a unifying framework that can be used with all existing repeater designs. We introduce the notion of a Quantum Recursive Network Architecture, developed from the emerging classical concept of 'recursive networks', extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework. Recursion abstracts independent transit networks as single relay nodes, unifies software layering, and virtualizes the addresses of resources to improve information hiding and resource management. Our architecture is useful for building arbitrary distributed states, including fundamental distributed states such as Bell pairs and GHZ, W, and cluster states.

Rodney Van Meter; Joe Touch; Clare Horsman

2011-05-06

43

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

44

Modeling Recursive RNA Interference  

Microsoft Academic Search

An important application of the RNA interference (RNAi) pathway is its use as a small RNA-based regulatory system commonly exploited to suppress expression of target genes to test their function in vivo. In several published experiments, RNAi has been used to inactivate components of the RNAi pathway itself, a procedure termed recursive RNAi in this report. The theoretical basis of

Wallace F. Marshall

2008-01-01

45

Tailoring Recursion for Complexity  

Microsoft Academic Search

We design functional algebras that characterize various complexity classes of global functions. For this purpose, classical schemata from recursion theory are tailored for capturing complexity. In particular we present a functional analog of first-order logic and describe algebras of the functions computable in nondeterministic logarithmic space, deterministic and nondeterministic polynomial time, and for the functions computable by $\\\\mathrm{AC}^1$-circuits.

Erich Grädel; Yuri Gurevich

1995-01-01

46

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

47

Web address: http://www.sciencedaily.com/upi/index.php?feed=Science&article=UPI-1-20070530-10412700-bc-us-monitor.xml  

E-print Network

-10412700-bc-us-monitor.xml Breaking News Updated every 15 minutes (powered by UPI) All News Top News Business: editor@sciencedaily.com About This Site | Editorial Staff | Awards & Reviews | Contribute News

Chiao, Jung-Chih

48

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

PubMed

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

Misztal, I; Legarra, A; Aguilar, I

2014-06-01

49

XWeB: The XML Warehouse Benchmark  

NASA Astrophysics Data System (ADS)

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

Mahboubi, Hadj; Darmont, Jérôme

50

Presentation of XML content using WYSIWYG templates  

E-print Network

XML has gained worldwide popularity for its ability to represent very general structured content. It is a platform independent format that has been successfully used for both media and more traditional textual data. However, the presentation of XML...

Joarder, Arif

2008-01-01

51

Typechecking Top-Down XML Transformations  

E-print Network

Typechecking Top-Down XML Transformations Wim Martens, Frank Neven University of Limburg Typechecking Top-Down XML Transformations ­ p.1/24 #12;Overview Introduction Schema : Tree Languages Tree Top-Down XML Transformations ­ p.2/24 #12;Importance of Typechecking An example: Suppose

Martens, Wim

52

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

53

XML Schemas Admitting 1-Pass Preorder Typing  

E-print Network

): store guitar guitar guitar maker price XML Schemas Admitting 1-Pass Preorder Typing ­ p.3/31 #12;XML Schema Languages: DTDs DTDs (Document Type Definitions): store guitar guitar guitar maker price store guitar maker "Fender" price 1000 guitar maker "Gibson" price 2500 XML Schemas Admitting 1-Pass Preorder

Martens, Wim

54

Setting the Standard: XML on Campus.  

ERIC Educational Resources Information Center

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

Rawlins, Mike

2001-01-01

55

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

Federal Register 2010, 2011, 2012, 2013, 2014

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

2013-05-16

56

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

57

Specifying recursive agents with GDTs  

Microsoft Academic Search

The purpose of this article is to formalise the notion of recursive agent by extending the Goal Decomposition Tree formalism (GDT). A formal semantics of this decomposition is given, as well as the\\u000a definition of operators to introduce various ways of recursively defining agents. Design patterns, that show various use cases\\u000a for recursive agents, are also presented. Finally, to preserve

Bruno Mermet; Gaële Simon

2011-01-01

58

XML processing in DHT networks  

Microsoft Academic Search

We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of techniques to lift them. First, we adapt the DHT platform's index store and communication primitives to the needs of massive data processing. Second, we introduce a distributed hierarchical index and associated

Serge Abiteboul; Ioana Manolescu; Neoklis Polyzotis; Nicoleta Preda; Chong Sun

2008-01-01

59

Distributed XML Design Serge Abiteboul  

E-print Network

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

Paris-Sud XI, Université de

60

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

61

Preserving Referential Integrity Constraints in XML Data Transformation  

Microsoft Academic Search

We study the transformation and preservation of XML referential integrity constraints in XML data transformation for integration\\u000a purposes in this paper. In transformation and preservation, we consider XML inclusion dependency and XML foreign key. We show\\u000a how XML referential constraints should be transformed and preserved using important transformation operations with sufficient\\u000a conditions.

Jixue Liu

62

DICOM involving XML path-tag  

NASA Astrophysics Data System (ADS)

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

Zeng, Qiang; Yao, Zhihong; Liu, Lei

2011-03-01

63

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

64

Choreography of ebXML business collaborations  

Microsoft Academic Search

The ebXML framework consists of eight loosely coupled speciflcations for conducting e-Business. The choreography of ebXML business processes is deflned by instances of the business process speciflcation schema (BPSS). The BPSS is de- flned as an XML schema. It specifles elements describing the inter-organizational business processes, called business collaborations, but does not concentrate on intra- organizational business processes. Most of

Birgit Hofreiter; Christian Huemer; Ja-hee Kim

2006-01-01

65

StatiX: making XML count  

Microsoft Academic Search

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

Juliana Freire; Jayant R. Haritsa; Maya Ramanath; Prasan Roy; Jérôme Siméon

2002-01-01

66

One-multiplier adaptive lattice algorithm for recursive filters  

Microsoft Academic Search

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

Murali Tummala

1989-01-01

67

Querying XML Documents in Xyleme  

Microsoft Academic Search

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

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

2000-01-01

68

XClust: clustering XML schemas for effective integration  

Microsoft Academic Search

It is increasingly important to develop scalable integration techniques for the growing number of XML data sources. A practical starting point for the integration of large numbers of Document Type Definitions (DTDs) of XML sources would be to first find clusters of DTDs that are similar in structure and semantics. Reconciling similar DTDs within such a cluster will be an

Mong-Li Lee; Liang Huai Yang; Wynne Hsu; Xia Yang

2002-01-01

69

XML  

Microsoft Academic Search

XML, as defined by the World Wide Web Consortium in 1998, is a method of marking up a document or character stream to identify structural or other units within the data. XML makes several contributions to solving the problem of semi-structured data, the term database theorists use to denote data that exhibits any of the following characteristics:

C. M. Sperberg-mcqueen

2005-01-01

70

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

71

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

72

INTEGRATING AUTOMATION DESIGN INFORMATION WITH XML  

E-print Network

INTEGRATING AUTOMATION DESIGN INFORMATION WITH XML Mika Viinikkala, Seppo Kuikka Institute of Automation and Control, Tampere University of Technology, P.O. Box 692, 33101 Tampere, Finland Email: mika.viinikkala@tut.fi, seppo.kuikka@tut.fi Keywords: Systems integration, XML, automation design Abstract: This paper presents

73

XMILL: An Efficient Compressor for XML Data  

Microsoft Academic Search

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

Hartmut Liefke; Dan Suciu

2000-01-01

74

XML and Databases for Internet Applications  

Microsoft Academic Search

This brief paper describes the relationship between XML andrelational databases and its potential as an enabling technology tosupport spatial information exchange between different softwareapplications through the Internet. Readers should note that it isnot the intention of this paper to present any new and significantresearch results. Rather it is the intention of this paper to sharesome current application of XML in

Gerardo Trinidad

75

Statistical synopses for graph-structured XML databases  

Microsoft Academic Search

Effective support for XML query languages is becoming increasingly important with the emergence of new applications that access large volumes of XML data. All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows path navigation and branching through the XML data graph in order to reach the desired data elements. Optimizing such queries depends crucially

Neoklis Polyzotis; Minos N. Garofalakis

2002-01-01

76

Efficient Top-k Search Across Heterogeneous XML Data Sources  

E-print Network

Efficient Top-k Search Across Heterogeneous XML Data Sources Jianxin Li1 , Chengfei Liu1 , Jeffrey XML query relaxation is how to efficiently search the top-k best answers from a large number of XML a bound-threshold based scheduling strategy. It can answer a top-k XML query as early as possible

Liu, Chengfei

77

Comparing Top-k XML Lists Ramakrishna Varadarajana  

E-print Network

-aware extensions [9] of XPath that provide keyword search on XML or other semi-structured data, and produce ranked that provide keyword search on XML or other semistructured data, and produce ranked lists of XML sub the proposed measures on real data using three popular XML keyword proximity search systems. Keywords: Total

Hristidis, Vagelis

78

Finding errors in components that exchange xml data  

Microsoft Academic Search

Two or more components (e.g., objects, modules, or programs) in- teroperate when they exchange data, such as XML data. Using Application Programming Interface (API) calls exported by XML parsers remains a primary mode of accessing and manipulating XML, and these API calls lead to various run-time errors in compo- nents that exchange XML data. Currently, no tool checks the source

Mark Grechanik

2007-01-01

79

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

80

MULTIFRACTAL DECOMPOSITIONS OF DIGRAPH RECURSIVE FRACTALS  

E-print Network

MULTIFRACTAL DECOMPOSITIONS OF DIGRAPH RECURSIVE that the multifractal decomposition behaves as expected* * for a family of sets K known as digraph recursive is roughly equal to (2")d, the dth power of the * *diameter #12; MULTIFRACTAL DECOMPOSITIONS OF DIGRAPH

Edgar, Gerald

81

Recursive computer architecture for VLSI  

SciTech Connect

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

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

1982-01-01

82

Recursive approximation of the bilateral filter.  

PubMed

This paper presents a complete proof that the bilateral filter can be implemented recursively, as long as: 1) the spatial filter can be implemented recursively and 2) the range filter can be decomposed into a recursive product. As a result, an O(ND) solution can be obtained for bilateral filtering, where N is the image size and D is the dimensionality. PMID:25700449

Yang, Qingxiong

2015-06-01

83

MULTIFRACTAL DECOMPOSITIONS OF DIGRAPH RECURSIVE FRACTALS  

E-print Network

MULTIFRACTAL DECOMPOSITIONS OF DIGRAPH RECURSIVE FRACTALS G. A. Edgar and R. Daniel Mauldin that the multifractal decomposition behaves as expected for a family of sets K known as digraph recursive fractals OF DIGRAPH RECURSIVE FRACTALS 3 for all x 2 K. Multifractal decomposition will be interesting exactly when

Mauldin, R. Daniel

84

MULTIFRACTAL DECOMPOSITIONS OF DIGRAPH RECURSIVE FRACTALS  

E-print Network

MULTIFRACTAL DECOMPOSITIONS OF DIGRAPH RECURSIVE FRACTALS G. A. Edgar and R. Daniel Mauldin that the multifractal decomposition behaves as expected for a family of sets K known as digraph recursive fractals OF DIGRAPH RECURSIVE FRACTALS 3 of the ball. This might mean that 0 ! lim sup ''#0 ÂŻ \\Gamma B '' (x) \\Delta

Edgar, Gerald

85

How Learning Logic Programming Affects Recursion Comprehension  

ERIC Educational Resources Information Center

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

Haberman, Bruria

2004-01-01

86

Safe software standards and XML schemas  

NASA Astrophysics Data System (ADS)

The goal of this work is to develop a safe software construction means for an XML based data standard for a class of medical devices, cytometry instruments. Unfortunately, the amount of empirical evidence to archive this goal is minimal. Therefore, technologies associated with high reliability were employed together with reuse of existing designs. The basis for a major part of the design was the Digital Imaging and Communications in Medicine (DICOM) standard and the Flow Cytometry Standard (FCS). Since the DICOM Standard is a Class II device, the safety of software should be maximized. The XML Schema Definition Language (XSDL) has been used to develop schemas that maximize readability, modularity, strong typing, and reuse. An instance and an instrument XML schema were created for data obtained with a microscope by importing multiple schemas that each consisted of a class that described one object. This design was checked by validating the schemas and creating XML pages from them.

Leif, Robert C.

2010-02-01

87

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

88

XML Format for SESAME and LEOS  

SciTech Connect

The objective of this document is to describe the XML format used by LLNL and LANL to represent the equation-of-state and related material information in the LEOS and SESAME data libraries. The primary purpose of this document is to describe a specific XML format for representing EOS data that is tailored to the nature of the underlying data and is amenable to conversion to both legacy SESAME and LEOS binary formats. The secondary purpose is to describe an XML format that lends itself to a 'natural' representation in a binary file format of the SESAME, pdb or hdf5 form so that this format and related tools can be used for the rapid and efficient development and implementation of prototype data structures. This document describes the XML format only. A working knowledge of LEOS and SESAME formats is assumed.

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

2009-04-29

89

Rodina formt XML1 Karel Richta  

E-print Network

nástroj XSLT. Jako píklad aplikace jsou zde uvedeny protokoly zalozené na XML (nap. SOAP). 1 �vod Formát), nap.: Josef Znacky slouzí k oznacení urcitých prvk v dokumentu. Uvazme nap. níze mze být dohodnuta pedem. Znacky v XML slouzí k vymezení logické struktury dokumentu. Mzeme nap

90

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

91

Sound and Complete Relevance Assessment for XML Retrieval Benjamin Piwowarski  

E-print Network

America Santiago, Chile Andrew Trotman University of Otago Dunedin, New Zealand Mounia Lalmas Queen Mary of XML Retrieval. The initiative aims to establish an infrastructure and means, in the form of large XML

Lalmas, Mounia

92

Interpreting XML Documents via an RDF Schema Ontology  

Microsoft Academic Search

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

Michel C. A. Klein

2002-01-01

93

Hybrid approach for XML access control (HyXAC)  

E-print Network

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

Thimma, Manogna

2012-08-31

94

Bitmap-Based Indexing for Multidimensional Multimedia XML Documents  

Microsoft Academic Search

XML is a new standard for exchanging and representing information on the Internet. Documents can be hierarchically represented\\u000a in XML-elements and also available for sophisticated content-based retrieval. For fast retrieval, XML documents may be indexed.\\u000a Typical indexing techniques, however, are not satisfactory for multi-dimensional and irregularly hierarchical XML documents.\\u000a In this paper, we propose a scalable bitmap indexing that can

Jong P. Yoon; Sung H. Kim; Go U. Kim; Venu Chakilam

2002-01-01

95

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

96

Effective XML Keyword Search with Relevance Oriented Ranking  

Microsoft Academic Search

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

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

2009-01-01

97

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

98

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

99

Automata-based Multiple Queries Handling over XML Streams  

Microsoft Academic Search

(Abstract)The problem of processing streaming XML data is gaining widespread attention from the research community. This paper proposes a novel algorithm for handling of multiple queries over the XML streams. The approach merges the multiple queries into a single prefix sharing query tree, and combines the automata with the runtime stack structure to answer multiple XML path queries through scanning

ZHANG Bing-ling

100

The GLOSS system for transformations from plain text to XML  

E-print Network

-to-detail. This asks a lot of a mere mortal required to enter mathematical data. But the potential of the web and XML-to-XML processor, to my mind, would be one that is fully con- figurable and able to produce arbitrary XML. Its

Kaye, Richard

101

The Application of XML Languages for Integrating Molecular Resources  

E-print Network

The Application of XML Languages for Integrating Molecular Resources Content 1) The Application of XML Languages for Integrating Molecular Resources 2) Georgios V. Gkoutos,a Peter Murray-Rust,b Henry S of Molecular Resources 7) Molecular Integration based on XML 8) The ChemDig Project 9) Chemical Markup Language

Rzepa, Henry S.

102

Structural Joins: A Primitive for Efficient XML Query Pattern Matching  

Microsoft Academic Search

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

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

2002-01-01

103

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

104

Semantic Mappings for the Integration of XML and RDF Sources  

E-print Network

Semantic Mappings for the Integration of XML and RDF Sources Huiyong Xiao Isabel F. Cruz Feihong and semantics. For instance, XML and RDF provide two completely different paradigms for modeling Web data at integrating XML and RDF sources. We propose a solution that utilizes a new mapping language called RDF Mapping

Cruz, Isabel F.

105

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

Microsoft Academic Search

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

Christian Huemer

2001-01-01

106

XML-based DICOM data format.  

PubMed

To enhance the readability, improve the structure, and facilitate the sharing of digital imaging and communications in medicine (DICOM) files, this research proposed one kind of XML-based DICOM data format. Because XML Schema offers great flexibility for expressing constraints on the content model of elements, we used it to describe the new format, thus making it consistent with the one originally defined by DICOM. Meanwhile, such schemas can be used in the creation and validation of the XML-encoded DICOM files, acting as a standard for data transmission and sharing on the Web. Upon defining the new data format, we started with representing a single data element and further improved the whole data structure with the method of modularization. In contrast to the original format, the new one possesses better structure without loss of related information. In addition, we demonstrated the application of XSLT and XQuery. All of the advantages mentioned above resulted from this new data format. PMID:19184223

Yu, Cong; Yao, Zhihong

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

Instance-based XML data binding for mobile devices  

E-print Network

XML and XML Schema are widely used in different domains for the definition of standards that enhance the interoperability between parts exchanging information through the Internet. The size and complexity of some standards, and their associated schemas, have been growing with time as new use case scenarios and data models are added to them. The common approach to deal with the complexity of producing XML processing code based on these schemas is the use of XML data binding generators. Unfortunately, these tools do not always produce code that ?ts the limitations of resource-constrained devices, such as mobile phones, in the presence of large schemas. In this paper we present Instance-based XML data binding, an approach to produce compact application-specific XML processing code for mobile devices. The approach utilises information extracted from a set of XML documents about how the application make use of the schemas.

Tamayo, Alain; Huerta, Joaquín

2011-01-01

109

XML in Action for VO Solutions  

NASA Astrophysics Data System (ADS)

Efficient interoperability tools between the astronomical data servers are one of the key elements of the Virtual Observatory. The HTTP protocol combined with the XML syntax is a pragmatic solution to increase this interoperability. The CDS approach is to build progressively a set of operational descriptions for information exchanged between astronomy on-line services, which takes into account specific aspects of the described data. This approach started with astronomical catalogs of the VizieR service and the establishment of the XML Astrores standard. The XML description of information about astronomical objects (SIMBAD) is the second step of this process. The next step is under development for images (Aladin). Additionally, the GLU CDS system - a distributed resource dictionary - is now ready to provide its records in XML. This means that any software, such as future VO applications, can know the astronomical resources available and how to query them, with a simple HTTP query to the nearest GLU site. This opens the path to further integration of heterogeneous distributed information.

Fernique, Pierre; Bonnarel, François; Louys, Mireille; Ochsenbein, François; Wenger, Marc

110

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

111

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

112

XGRIND: A Query-Friendly XML Compressor  

Microsoft Academic Search

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

Pankaj M. Tolani; Jayant R. Haritsa

2002-01-01

113

James Webb Space Telescope use of XML  

Microsoft Academic Search

James Webb Space Telescope (JWST) has been defining, developing, and exercising the use of a common extensible markup language (XML) since 2002 for the central Project Reference Database (PRD) that would not only include the basic command and telemetry database structures, but also table definitions, pages, scripts, and other items needed for the real-time operations, archive, and planning systems. As

Jonathan Gal-Edd; Curtis Fatig

2006-01-01

114

Expanding the Web: Is XML Sufficient?  

Microsoft Academic Search

The first elements of the web infrastructure includes HTML tagging, simple hypertext linking and hardcoded representa- tion. It had scalability problem when Internet became more popular and the number of applications provided by the web increased steadily. This scaling limitation gave the birth of XML to suffice to the huge demands of the web. This pa- per explores the cost

Sharmistha Chatterjee

115

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

116

XML/Update Advanced Data Mining and Applications  

E-print Network

Data Mining and Applications Xiaofeng Meng (ADMA 2009) 2009 8 17 -19 Springer , #12; 1. X. Pan 2-6, 2009, Hong Kong, China. 5. Y. Li, X. Meng: Supporting Context-based Query in Personal Data 2-6, 2009, Hong Kong, China. 6. X. Zhang, Z. Wang, J. Ai, J. Lu, X. Meng: An Efficient Multi

117

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

118

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

119

Hypothetical Datalog: Negation and Linear Recursion \\Lambda  

E-print Network

Hypothetical Datalog: Negation and Linear Recursion \\Lambda Anthony J. Bonner Department complexity. These restrictions are based on two ideas from Horn­clause logic: linear recursion and stratified negation. In particular, a notion of stratification is developed in which negation­as­failure alternates

Bonner, Anthony

120

The recursive suppression algorithm for adaptive superresolution  

Microsoft Academic Search

The recursive suppression algorithm is an adaptive algorithm that is one of the simplest superresolution algorithms to implement but, nevertheless, converges approximately as rapidly as the computationally intensive MUSIC algorithm. Simulation results verify the effectiveness of this algorithm in resolving closely spaced signals. Necessary and sufficient conditions for the convergence of the mean weight vector in the recursive suppression algorithm

Don Torrieri; Kesh Bakhru

1992-01-01

121

The recursive suppression algorithm for adaptive superresolution  

Microsoft Academic Search

The recursive suppression algorithm is an adaptive algorithm that is one of the simplest superresolution algorithms to implement but, nevertheless, converges almost as rapidly as the computationally intensive MUSIC algorithm. Simulation results verify the effectiveness of this algorithm in resolving closely spaced signals. Necessary and sufficient conditions for the convergence of the mean weight vector in the recursive suppression algorithm

Don Torrieri; Kesh Bakhru

1991-01-01

122

Recursive calculations for processes with n gluons  

Microsoft Academic Search

A method is presented in which multigluon processes are calculated recursively. The technique is explicitly developed for processes where only gluons are produced and processes where in addition to the gluons also a quark-antiquark pair with or without a vector boson or e+e- pair are present. The recursion relations are used to derive rigorously amplitudes for certain configurations, where most

F. A. Berends; W. T. Giele

1988-01-01

123

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

124

T owards the Preservation of Referential Constraints in XML Data Transformation for Integration  

Microsoft Academic Search

We investigate the transformation and the preservation of XML referential constraints in XML data transformation for integration purposes in this paper. In the transformation and the preser- vation, we consider XML inclusion dependencies and XML foreign keys. We show how XML referential constraints should be transformed and preserved using important transformation op- erators with sufficient conditions.

Jixue Liu

2010-01-01

125

A Performance Evaluation of Alternative Mapping Schemes for Storing XML Data in a Relational Database  

Microsoft Academic Search

Abstract XML is emerging as one of the dominant data formats for data processing on the Internet To query XML data, query languages like XQL, Lorel, XML - QL, or XML - GL have been proposed In this paper, we study how XML data can be stored and queried using a standard relational database system For this purpose, we present

Daniela Florescu; Donald Kossmann; Projet Rodin

2001-01-01

126

Improving query performance on XML documents: a workload-driven design approach  

Microsoft Academic Search

As XML has emerged as a data representation format and as great quantities of data have been stored in the XML for- mat, XML document design has become an important and evident issue in several application contexts. Methodologies based on conceptual modeling are being tightly applied for designing XML documents. However, the conversion of a conceptual schema to an XML

Rebeca Schroeder; Ronaldo Dos Santos Mello

2008-01-01

127

Establishing an XML Metadata Knowledge Base to Assist Integration of Structured and Semi-structured Databases  

Microsoft Academic Search

This paper describes the establishment of an XML Metadata Knowledge Base (XMKB) to assist integration of distributed heterogeneous structured data residing in relational databases and semi-structured data held in well- formed XML documents (XML documents that conform to the XML syntax rules but have no referenced DTD or XML schema) produced by internet applications. We propose an approach to combine

Fahad M. Al-Wasil; W. A. Gray; N. J. Fiddian

128

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

129

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

130

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

131

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

132

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

133

Towards Evolving Constraints in Data Transformation for XML Data Warehousing  

Microsoft Academic Search

\\u000a Transformation of data is considered as one of the important tasks in data warehousing and data integration. With the massive\\u000a use of XML as data representation and exchange format over the web in recent years, transformation of data in XML for integration\\u000a purposes becomes necessary. In XML data transformation, a source schema and its conforming data is transformed to a

Jixue Liu

2009-01-01

134

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

135

Incremental maintenance of XML structural indexes  

Microsoft Academic Search

Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many structural indexes have been proposed. The most popular ones are the 1-index, based on the notion of graph bisimilarity, and the recently proposed A(k)-index, based on the notion of local similarity to provide a trade-off

Ke Yi; Hao He; Ioana Stanoi; Jun Yang

2004-01-01

136

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

137

XML Based Markup Languages for Specific Domains  

NASA Astrophysics Data System (ADS)

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

Varde, Aparna; Rundensteiner, Elke; Fahrenholz, Sally

138

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.

Prüher, Jakub; Šimandl, Miroslav

2014-12-01

139

MITOSIS RECURSION FOR COEFFICIENTS OF SCHUBERT POLYNOMIALS  

E-print Network

MITOSIS RECURSION FOR COEFFICIENTS OF SCHUBERT POLYNOMIALS EZRA MILLER Abstract.Mitosis is a rule introduced in [KM02a] for manipulating subsets proof of these properties of mitosis. 1. Introduction It has been

Miller, Ezra N.

140

A Concrete Approach to Abstract Recursive Definitions  

E-print Network

We introduce a non-categorical alternative to Wagner's Abstract Recursive Definitions [Wg-1,2] using a generalization of the notion of clone called a u-clone. Our more concrete approach yields two new theorems: 1.) the ...

Wand, Mitchell

1972-06-01

141

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

PubMed

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

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

2011-09-01

142

Recursive least-squares learning algorithms for neural networks  

NASA Astrophysics Data System (ADS)

This paper presents the development of a pair of recursive least squares (ItLS) algorithms for online training of multilayer perceptrons which are a class of feedforward artificial neural networks. These algorithms incorporate second order information about the training error surface in order to achieve faster learning rates than are possible using first order gradient descent algorithms such as the generalized delta rule. A least squares formulation is derived from a linearization of the training error function. Individual training pattern errors are linearized about the network parameters that were in effect when the pattern was presented. This permits the recursive solution of the least squares approximation either via conventional RLS recursions or by recursive QR decomposition-based techniques. The computational complexity of the update is 0(N2) where N is the number of network parameters. This is due to the estimation of the N x N inverse Hessian matrix. Less computationally intensive approximations of the ilLS algorithms can be easily derived by using only block diagonal elements of this matrix thereby partitioning the learning into independent sets. A simulation example is presented in which a neural network is trained to approximate a two dimensional Gaussian bump. In this example RLS training required an order of magnitude fewer iterations on average (527) than did training with the generalized delta rule (6 1 BACKGROUND Artificial neural networks (ANNs) offer an interesting and potentially useful paradigm for signal processing and pattern recognition. The majority of ANN applications employ the feed-forward multilayer perceptron (MLP) network architecture in which network parameters are " trained" by a supervised learning algorithm employing the generalized delta rule (GDIt) [1 2]. The GDR algorithm approximates a fixed step steepest descent algorithm using derivatives computed by error backpropagatiori. The GDII algorithm is sometimes referred to as the backpropagation algorithm. However in this paper we will use the term backpropagation to refer only to the process of computing error derivatives. While multilayer perceptrons provide a very powerful nonlinear modeling capability GDR training can be very slow and inefficient. In linear adaptive filtering the analog of the GDR algorithm is the leastmean- squares (LMS) algorithm. Steepest descent-based algorithms such as GDR or LMS are first order because they use only first derivative or gradient information about the training error to be minimized. To speed up the training process second order algorithms may be employed that take advantage of second derivative or Hessian matrix information. Second order information can be incorporated into MLP training in different ways. In many applications especially in the area of pattern recognition the training set is finite. In these cases block learning can be applied using standard nonlinear optimization techniques [3 4 5].

Lewis, Paul S.; Hwang, Jenq N.

1990-11-01

143

A recursive Bayesian approach for fatigue damage prognosis: An experimental validation at the reliability component level  

NASA Astrophysics Data System (ADS)

Fatigue-induced damage is one of the most uncertain and highly unpredictable failure mechanisms for a large variety of mechanical and structural systems subjected to cyclic and random loads during their service life. A health monitoring system capable of (i) monitoring the critical components of these systems through non-destructive evaluation (NDE) techniques, (ii) assessing their structural integrity, (iii) recursively predicting their remaining fatigue life (RFL), and (iv) providing a cost-efficient reliability-based inspection and maintenance plan (RBIM) is therefore ultimately needed. In contribution to these objectives, the first part of the paper provides an overview and extension of a comprehensive reliability-based fatigue damage prognosis methodology — previously developed by the authors — for recursively predicting and updating the RFL of critical structural components and/or sub-components in aerospace structures. In the second part of the paper, a set of experimental fatigue test data, available in the literature, is used to provide a numerical verification and an experimental validation of the proposed framework at the reliability component level (i.e., single damage mechanism evolving at a single damage location). The results obtained from this study demonstrate (i) the importance and the benefits of a nearly continuous NDE monitoring system, (ii) the efficiency of the recursive Bayesian updating scheme, and (iii) the robustness of the proposed framework in recursively updating and improving the RFL estimations. This study also demonstrates that the proposed methodology can lead to either an extent of the RFL (with a consequent economical gain without compromising the minimum safety requirements) or an increase of safety by detecting a premature fault and therefore avoiding a very costly catastrophic failure.

Gobbato, Maurizio; Kosmatka, John B.; Conte, Joel P.

2014-04-01

144

Recursive Sketching For Frequency Moments  

E-print Network

In a ground-breaking paper, Indyk and Woodruff (STOC 05) showed how to compute $F_k$ (for $k>2$) in space complexity $O(\\mbox{\\em poly-log}(n,m)\\cdot n^{1-\\frac2k})$, which is optimal up to (large) poly-logarithmic factors in $n$ and $m$, where $m$ is the length of the stream and $n$ is the upper bound on the number of distinct elements in a stream. The best known lower bound for large moments is $\\Omega(\\log(n)n^{1-\\frac2k})$. A follow-up work of Bhuvanagiri, Ganguly, Kesh and Saha (SODA 2006) reduced the poly-logarithmic factors of Indyk and Woodruff to $O(\\log^2(m)\\cdot (\\log n+ \\log m)\\cdot n^{1-{2\\over k}})$. Further reduction of poly-log factors has been an elusive goal since 2006, when Indyk and Woodruff method seemed to hit a natural "barrier." Using our simple recursive sketch, we provide a different yet simple approach to obtain a $O(\\log(m)\\log(nm)\\cdot (\\log\\log n)^4\\cdot n^{1-{2\\over k}})$ algorithm for constant $\\epsilon$ (our bound is, in fact, somewhat stronger, where the $(\\log\\log n)$ term c...

Braverman, Vladimir

2010-01-01

145

The potential of XML encoding in geomatics converting raster images to XML and SVG  

Microsoft Academic Search

The evolution of open standards and especially those pertaining to the family of XML technologies, have a considerable impact on the way the Geomatics community addresses the acquisition, storage, analysis and display of spatial data. The most recent version of the GML specification enables the merging of vector and raster data into a single “open” format. The notion of “coverage”

Byron Antoniou; Lysandros Tsoulos

2006-01-01

146

Storing and Querying XML Documents Without Using Schema Information  

E-print Network

Storing and Querying XML Documents Without Using Schema Information Kanda Runapongsa Department schemes, we demonstrate that the PAID mapping scheme results in less response times by up to several Language) [4] for representing easily sharable data continues to grow, large repositories of XML data

Runapongsa, Kanda

147

High-Performance Complex Event Processing over XML Streams  

E-print Network

on semi-structured information. However, XML-like streams repre- sent a very popular form of data exchange as the underlying model also enables XSeq go beyond XML streams and be easily appli- cable to any data with both sequential and hierarchical structures, including JSON messages, RNA sequences, and software traces. We

148

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

149

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

150

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

151

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

152

Change-Centric Management of Versions in an XML Warehouse  

Microsoft Academic Search

Abstract: We present a change - centric method to manage ver - sions in a Web WareHouse of XML data The starting points is a sequence of snapshots of XML documents we obtain from the web By running a di algorithm, we compute the changes between two consecutive ver - sions We then represent the sequence using a novel representation

Amélie Marian; Serge Abiteboul; Gregory Cobena; Laurent Mignet

2001-01-01

153

A Prime Number Labeling Scheme for Dynamic Ordered XML Trees  

Microsoft Academic Search

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

Xiaodong Wu; Mong-li Lee; Wynne Hsu

2004-01-01

154

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

155

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

156

Intelligent Data Entry Assistant for XML Using Ensemble Learning  

E-print Network

. The data for online input form is mostly simple, e.g. login, password, address, and credit card number into the XML documents. Current form filling technologies are mostly for simple data entry and do not provideXAutofill, an intelligent data entry assistant for predicting and automating inputs for XML documents based on the contents

Kansas, University of

157

ENABLING FLEXIBLE SERVICES USING XML Luis Velasco, Ian Marshall  

E-print Network

ENABLING FLEXIBLE SERVICES USING XML METADATA Luis Velasco, Ian Marshall BT-Labs, Martlesham Heath, SUFFOLK, IP5 3RE, UK velascol@drake.bt.co.uk, marshall@drake.bt.co.uk Abstract. Combining eXtensible Markup Language (XML) and Active Layer Networking may yield strong benefits for networked services

Marshall, Ian W.

158

Unifying the Processing of XML Streams and Relational Data Streams  

Microsoft Academic Search

Relational data streams and XML streams have previ- ously provided two separate research foci, but their uni- fied support by a single Data Stream Management System (DSMS) is very desirable from an application viewpoint. In this paper, we propose a simple approach to extend rela- tional DSMSs to support both kinds of streams efficiently. In our Stream Mill system, XML

Xin Zhou; Hetal Thakkar; Carlo Zaniolo

2006-01-01

159

XML - James Webb space telescope database issues, lessons, and status  

Microsoft Academic Search

This paper presents the current concept using extensible markup language (XML) as the underlying structure for the James Webb space telescope (JWST) database. The purpose of using XML is to provide a JWST database, independent of any portion of the ground system, yet still compatible with the various systems using a variety of different structures. The testing of the JWST

R. Detter; M. Mooney; C. C. Fatig

2004-01-01

160

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

161

QIS-XML: A metadata specification for Quantum Information Science  

E-print Network

While Quantum Information Science (QIS) is still in its infancy, the ability for quantum based hardware or computers to communicate and integrate with their classical counterparts will be a major requirement towards their success. Little attention however has been paid to this aspect of QIS. To manage and exchange information between systems, today's classic Information Technology (IT) commonly uses the eXtensible Markup Language (XML) and its related tools. XML is composed of numerous specifications related to various fields of expertise. No such global specification however has been defined for quantum computers. QIS-XML is a proposed XML metadata specification for the description of fundamental components of QIS (gates & circuits) and a platform for the development of a hardware independent low level pseudo-code for quantum algorithms. This paper lays out the general characteristics of the QIS-XML specification and outlines practical applications through prototype use cases.

Heus, Pascal

2007-01-01

162

QIS-XML: A metadata specification for Quantum Information Science  

E-print Network

While Quantum Information Science (QIS) is still in its infancy, the ability for quantum based hardware or computers to communicate and integrate with their classical counterparts will be a major requirement towards their success. Little attention however has been paid to this aspect of QIS. To manage and exchange information between systems, today's classic Information Technology (IT) commonly uses the eXtensible Markup Language (XML) and its related tools. XML is composed of numerous specifications related to various fields of expertise. No such global specification however has been defined for quantum computers. QIS-XML is a proposed XML metadata specification for the description of fundamental components of QIS (gates & circuits) and a platform for the development of a hardware independent low level pseudo-code for quantum algorithms. This paper lays out the general characteristics of the QIS-XML specification and outlines practical applications through prototype use cases.

Pascal Heus; Richard Gomez

2007-12-23

163

Concrete uses of XML in software development and data analysis  

E-print Network

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

S. Patton

2003-06-11

164

Information persistence using XML database technology  

NASA Astrophysics Data System (ADS)

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

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

2005-05-01

165

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

166

Recursive Branching Simulated Annealing Algorithm  

NASA Technical Reports Server (NTRS)

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

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

2012-01-01

167

Contribution to graphical querying language for XML semi-structured data  

Microsoft Academic Search

Recently, XML has become a standard for data representation, manipulation and exchange on the web. The increase in the use of XML in many applicative domains induces a strong need for providing XML query capabilities to many users. In this paper, we propose a solution of XML graphical querying based on the XQuery language. In our approach, we propose to

Sameh Ammar; Ikram Amous; Faďez Gargouri

2005-01-01

168

Dual Syntax for XML Languages Claus Brabrand, Anders Mller, and Michael I. Schwartzbach  

E-print Network

Dual Syntax for XML Languages Claus Brabrand, Anders Møller, and Michael I. Schwartzbach Department, many XML languages permit an alter- native more legible non-XML syntax. XSLT stylesheets are often used to convert from the XML syntax to the alternative syntax; however, such transformations are not reversible

Møller, Anders

169

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

Microsoft Academic Search

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

Latifur Khan; Yan Rao

2001-01-01

170

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

171

Pure connection formalism for gravity: Recursion relations  

E-print Network

In the gauge-theoretic formulation of gravity the cubic vertex becomes simple enough for some graviton scattering amplitudes to be computed using Berends-Giele-type recursion relations. We present such a computation for the current with all same helicity on-shell gravitons. Once the recursion relation is set up and low graviton number cases are worked out, a natural guess for the solution in terms of a sum over trees presents itself readily. The solution can also be described either in terms of the half-soft function familiar from the 1998 paper by Bern, Dixon, Perelstein and Rozowsky or as a matrix determinant similar to one used by Hodges for MHV graviton amplitudes. This solution also immediate suggests the correct guess for the MHV graviton amplitude formula, as is contained in the already mentioned 1998 paper. We also obtain the recursion relation for the off-shell current with all but one same helicity gravitons.

Gianluca Delfino; Kirill Krasnov; Carlos Scarinci

2014-10-21

172

Pure connection formalism for gravity: Recursion relations  

E-print Network

In the gauge-theoretic formulation of gravity the cubic vertex becomes simple enough for some graviton scattering amplitudes to be computed using Berends-Giele-type recursion relations. We present such a computation for the current with all same helicity on-shell gravitons. Once the recursion relation is set up and low graviton number cases are worked out, a natural guess for the solution in terms of a sum over trees presents itself readily. The solution can also be described either in terms of the half-soft function familiar from the 1998 paper by Bern, Dixon, Perelstein and Rozowsky or as a matrix determinant similar to one used by Hodges for MHV graviton amplitudes. This solution also immediate suggests the correct guess for the MHV graviton amplitude formula, as is contained in the already mentioned 1998 paper. We also obtain the recursion relation for the off-shell current with all but one same helicity gravitons.

Delfino, Gianluca; Scarinci, Carlos

2014-01-01

173

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

174

UML for XML-GL Query Using Class Diagram and OCL  

Microsoft Academic Search

Nowadays, XML has been favored as a means of sharing and distributing data, due to its open-architectural feature. XML-GL, a graphical query language for XML document, has the advantage of structuring and defining itself. By incorporating UML, an XML document can become object-oriented and can be represented by graphical means. This paper proposes an efficient query modelling of XML-GL using

Bong-Jin Choi; Yong-Sung Kim; Yan Ha

2009-01-01

175

Establishing an XML metadata klnowledge base to assist integration of structured and semi-structured databases  

Microsoft Academic Search

Abstract This paper ,describes the establishment ,of an ,XML Metadata Knowledge ,Base (XMKB) to assist integration ofdistributed heterogeneous ,structured data residing in relational databases and semi-structured data held in well- formed XML documents ,(XML documents ,that conform tothe XML syntax rules but have no referenced,DTD or XML schema) produced ,by internet ,applications. We propose,an approach ,to combine ,and query ,the

Fahad M. Al-wasil; W. A. Gray; N. J. Fiddian

2006-01-01

176

On 2-D recursive LMS algorithms using ARMA prediction for ADPCM encoding of images.  

PubMed

A two-dimensional (2D) linear predictor which has an autoregressive moving average (ARMA) representation well as a bias term is adapted for adaptive differential pulse code modulation (ADPCM) encoding of nonnegative images. The predictor coefficients are updated by using a 2D recursive LMS (TRLMS) algorithm. A constraint on optimum values for the convergence factors and an updating algorithm based on the constraint are developed. The coefficient updating algorithm can be modified with a stability control factor. This realization can operate in real time and in the spatial domain. A comparison of three different types of predictors is made for real images. ARMA predictors show improved performance relative to an AR algorithm. PMID:18296174

Chung, Y S; Kanefsky, M

1992-01-01

177

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

178

Limits of Recursive Triangle and Polygon Tunnels  

E-print Network

In this paper we present unsolved problems that involve infinite tunnels of recursive triangles or recursive polygons, either in a decreasing or in an increasing way. The "nedians or order i in a triangle" are generalized to "nedians of ratio r" and "nedians of angle {\\alpha}" or "nedians at angle {\\beta}", and afterwards one considers their corresponding "nedian triangles" and "nedian polygons". This tunneling idea came from physics. Further research would be to construct similar tunnel of 3-D solids (and generally tunnels of n-D solids).

Florentin Smarandache

2010-06-01

179

Fast Integer Multiplication by Block Recursive, Number Theoretical Transforms  

Microsoft Academic Search

The use of multidimensional techniques permits to increase the sequence length to powers of the word length, when Discrete Fourier Transforms are performed on congruences modulo a Fermat or a Mersenne Number. The number of dimensions is equivalent to the number of recursion levels in block-recursive techniques, so that we can interchange the concepts multidimensional techniques and block-recursive techniques.

Ricardo Ferré; Ricardo Ferr

1988-01-01

180

Design and Implementation of XML-based electronic patient record secure transmission in the Internet XML encryption applications in electronic cases  

Microsoft Academic Search

Electronic patient record based on XML involves the patient's personal secrets, how to transmit on the net safely, it is more important problem, this paper uses the encryption of XML, realize the security question of the electronic patient record.

Li Yan; Hou XiuPing

2010-01-01

181

Recursively indexed differential pulse code modulation  

Microsoft Academic Search

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

Khalid Sayood; Sangsin Na

1992-01-01

182

RECURSIVE PARAMETER ESTIMATION OF HYDROLOGIC MODELS  

EPA Science Inventory

Proposed is a nonlinear filtering approach to recursive parameter estimation of conceptual watershed response models in state-space form. he conceptual model state is augmented by the vector of free parameters which are to be estimated from input-output data, and the extended Kal...

183

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

184

Alias Types for Recursive Data Structures  

Microsoft Academic Search

Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a pseudo-linear type system that allows a degree of alias- ing and memory reuse as well as the ability to dene com- plex recursive data structures. Our type system can encode conventional linear

David Walker; J. Gregory Morrisett

2000-01-01

185

Alias types for recursive data structures  

Microsoft Academic Search

Abstract Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing This paper describes a pseudo - linear type system that allows a degree of alias - ing and memory reuse as well as the ability to de ne com - plex recursive data structures Our

David Walker; Greg Morrisett

2001-01-01

186

Robustized recursive estimators and adaptive partition detectors  

Microsoft Academic Search

Robustized recursive estimators and adaptive partition detectors are investigated for a mixture distribution composed of a low variance noise component and an impulsive noise component. In such a noise environment, nonparametric detectors have significant advantages. Specifically, the m-interval partition detector, which is a generalization of the classic sign test, has shown great promise. To implement this test, a finite number

P. R. Kersten

1976-01-01

187

RAMIFIED RECURSION AND INTUITIONISM Edward Nelson  

E-print Network

RAMIFIED RECURSION AND INTUITIONISM Edward Nelson Department of Mathematics Princeton University of a function'' would be more precise. We are dealing not http://www.math.princeton.edu/¸nelson/papers.html is the URL for this paper. It is in the public domain. #12; EDWARD NELSON with Platonic functions, two

Nelson, Edward

188

RAMIFIED RECURSION AND INTUITIONISM Edward Nelson  

E-print Network

RAMIFIED RECURSION AND INTUITIONISM Edward Nelson Department of Mathematics Princeton University be more precise. We are dealing not http://www.math.princeton.edu/nelson/papers.html is the URL for this paper. It is in the public domain. #12;EDWARD NELSON with Platonic functions, two of which are the same

Nelson, Edward

189

Recursive Filtering And Smoothing In Robot Dynamics  

NASA Technical Reports Server (NTRS)

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

Rodriguez, Guillermo

1992-01-01

190

Adaptive superresolution using the recursive suppression algorithm  

Microsoft Academic Search

Simulation results verify the effectiveness of the recursive suppression algorithm in resolving closely spaced signals and show that it achieves resolution approximately as rapidly as the computationally intensive MUSIC algorithm. The concept of resolution stability and the choice of the adaptation constant are explained. This algorithm has a parameter, ?, which can be adjusted to account for the degree of

Don Torrieri; Kesh Bakhru

1992-01-01

191

TORTIS (Toddler's Own Recursive Turtle Interpreter System).  

ERIC Educational Resources Information Center

TORTIS (Toddler's Own Recursive Turtle Interpreter System) is a device which can be used to study or nurture the cognitive development of preschool children. The device consists of a "turtle" which the child can control by use of buttons on a control panel. The "turtle" can be made to move in prescribed directions, to take a given number of paces,…

Perlman, Radia

192

Development of Recursive Thinking: Procedural Variations.  

ERIC Educational Resources Information Center

Describes two studies investigating the development of recursive thinking in 60 Dutch children five, seven, and nine years of age. The first study replicated earlier research employing a verbal production procedure. The second study used verbal comprehension procedures and concluded that development appears two years earlier than indicated by the…

Oppenheimer, Louis

1986-01-01

193

Query Rewriting Rules for Versioned XML Documents  

NASA Astrophysics Data System (ADS)

Shared and/or interactive contents such as office documents and wiki contents are often provided with both the latest version and all past versions. It is necessary to add version axes to XPath in order to trace version histories of fine-grained subdocuments of XML. Although research has been done on the containment and equivalence problems for XPath, which is a basic property of optimizing queries, there has been no research in the case for XPath extended with version axes. In this paper, we will propose query rewriting rules which can exchange between document axes and version axes, and prove that they are preserving query semantics. The rewriting rules enable us to swap path subexpressions between document axes and version axes to optimize queries.

Motomura, Tetsutaro; Iwaihara, Mizuho; Yoshikawa, Masatoshi

194

Expressing OLAP operators with the TAX XML algebra  

E-print Network

With the rise of XML as a standard for representing business data, XML data warehouses appear as suitable solutions for Web-based decision-support applications. In this context, it is necessary to allow OLAP analyses over XML data cubes (XOLAP). Thus, XQuery extensions are needed. To help define a formal framework and allow much-needed performance optimizations on analytical queries expressed in XQuery, having an algebra at one's disposal is desirable. However, XOLAP approaches and algebras from the literature still largely rely on the relational model and/or only feature a small number of OLAP operators. In opposition, we propose in this paper to express a broad set of OLAP operators with the TAX XML algebra.

Hachicha, Marouane; Darmont, Jérôme

2008-01-01

195

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

196

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

197

Algebraic Modeling of Information Retrieval in XML Documents  

NASA Astrophysics Data System (ADS)

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

Georgiev, Bozhidar; Georgieva, Adriana

2009-11-01

198

On the usage of XML file format in geodynamic calculations  

NASA Astrophysics Data System (ADS)

We recommend the extended usage of XML data format for the representation of geodynamic observations and processing results. A short introduction to the technology and a simple example for a Consolidated Laser Ranging Data Format (CRD) data file are presented.

Choliy, V.

2012-12-01

199

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

200

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

Microsoft Academic Search

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

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

2002-01-01

201

An introduction to on-shell recursion relations  

NASA Astrophysics Data System (ADS)

This article provides an introduction to on-shell recursion relations for calculations of tree-level amplitudes. Starting with the basics, such as spinor notations and color decompositions, we expose analytic properties of gauge-boson amplitudes, BCFW-deformations, the large z-behavior of amplitudes, and on-shell recursion relations of gluons. We discuss further developments of on-shell recursion relations, including generalization to other quantum field theories, supersymmetric theories in particular, recursion relations for off-shell currents, recursion relation with nonzero boundary contributions, bonus relations, relations for rational parts of one-loop amplitudes, recursion relations in 3D and a proof of CSW rules. Finally, we present samples of applications, including solutions of split helicity amplitudes and of N = 4 SYM theories, consequences of consistent conditions under recursion relation, Kleiss-Kuijf (KK) and Bern-Carrasco-Johansson (BCJ) relations for color-ordered gluon tree amplitudes, Kawai-Lewellen-Tye (KLT) relations.

Feng, Bo; Luo, Mingxing

2012-10-01

202

The recursion relation in Lagrangian perturbation theory  

SciTech Connect

We derive a recursion relation in the framework of Lagrangian perturbation theory, appropriate for studying the inhomogeneities of the large scale structure of the universe. We use the fact that the perturbative expansion of the matter density contrast is in one-to-one correspondence with standard perturbation theory (SPT) at any order. This correspondence has been recently shown to be valid up to fourth order for a non-relativistic, irrotational and dust-like component. Assuming it to be valid at arbitrary (higher) order, we express the Lagrangian displacement field in terms of the perturbative kernels of SPT, which are itself given by their own and well-known recursion relation. We argue that the Lagrangian solution always contains more non-linear information in comparison with the SPT solution, (mainly) if the non-perturbative density contrast is restored after the displacement field is obtained.

Rampf, Cornelius, E-mail: rampf@physik.rwth-aachen.de [Institut für Theoretische Teilchenphysik und Kosmologie, RWTH Aachen, D-52056 Aachen (Germany)

2012-12-01

203

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

204

Determination of boundary contributions in recursion relation  

NASA Astrophysics Data System (ADS)

In this paper, we propose a new algorithm to systematically determine the missing boundary contributions, when one uses the BCFW on-shell recursion relation to calculate tree amplitudes for general quantum field theories. After an instruction of the algorithm, we will use several examples to demonstrate its application, including amplitudes of color-ordered ? 4 theory, Yang-Mills theory, Einstein-Maxwell theory and color-ordered Yukawa theory with ? 4 interaction.

Feng, Bo; Zhou, Kang; Qiao, Chenkai; Rao, Junjie

2015-03-01

205

Recursively indexed differential pulse code modulation  

NASA Technical Reports Server (NTRS)

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

Sayood, Khalid; Na, Sangsin

1992-01-01

206

Consciousness as recursive, spatiotemporal self-location  

Microsoft Academic Search

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

Frederic Peters

2010-01-01

207

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

208

Weighted Laplacians, cocycles and recursion relations  

E-print Network

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

2013-01-01

209

Weighted Laplacians, cocycles and recursion relations  

E-print Network

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.

Kirill Krasnov; Carlos Scarinci

2013-10-02

210

Recursion relations for Double Ramification Hierarchies  

E-print Network

In this paper we study various properties of the double ramification hierarchy, an integrable hierarchy of hamiltonian PDEs introduced in [Bur14] using intersection theory of the double ramification cycle in the moduli space of stable curves. In particular, we prove a recursion formula that recovers the full hierarchy starting from just one of the Hamiltonians, the one associated to the first descendant of the unit of a cohomological field theory. Such recursion is reminiscent of the dilaton equation in Gromov-Witten theory. Moreover, we introduce anologues of the topological recursion relations and the divisor equation both for the hamiltonian densities and for the string solution of the double ramification hierarchy. This machinery is very efficient and we apply it to various computations for the trivial and Hodge cohomological field theories, and for the $r$-spin Witten's classes. Moreover we prove the Miura equivalence between the double ramification hierarchy and the Dubrovin-Zhang hierarchy for the Gromov-Witten theory of the complex projective line (extended Toda hierarchy).

A. Buryak; P. Rossi

2014-11-25

211

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

212

An XML cytometry standard based on DICOM  

NASA Astrophysics Data System (ADS)

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

Leif, Robert C.

2009-02-01

213

Voice User Interface Design for a Telephone Application Using VoiceXML  

Microsoft Academic Search

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

Daniel Mecanovic; Hao Shi

2005-01-01

214

The SGML Standardization Framework and the Introduction of XML  

PubMed Central

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

Grütter, Rolf

2000-01-01

215

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

216

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

217

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

Microsoft Academic Search

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

Joe Tekli; Richard Chbeir; Kokou Yétongnon

2009-01-01

218

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

219

Understanding the XML (Extensive MarkUp Language) Technologies: A Progress Report  

Microsoft Academic Search

A n Internet language called the Extensible Markup Language (XML)is rapidly becoming one of the most popular languages in the world. XML is being incorporated into the design and structure of many Internet Web pages and applications. It is particularly useful for those involving structured information exchanges, such as electronic commerce (E-commerce). XML is a language that describes information in

Mary Brady; Carmelo Montanez-Rivera; Richard Rivello; Lisa Carnahan

2001-01-01

220

A new method for maintaining semi-structured data described in XML  

Microsoft Academic Search

XML is a markup language for describing structured documents. Moreover, it has the capability to effectively represent semi-structured data. XML is expected to be widely used for exchanging semi-structured data over networks. In this paper, we study and propose a new method for maintaining a database of XML documents that can be queried for retrieval based on structure and content.

Takeya Kasukawa; Hideo Matsuda; Michio Nakanishi; Akihiro Hashimoto

1999-01-01

221

Based on Entity Recognition Link Related Structured Data and XML Document  

Microsoft Academic Search

Extensible Markup Language (XML) is fast emerging as the dominant standard for representing data on the Internet. Faced with growing knowledge management needs, enterprises are increasingly realizing the importance of interlinking critical business information distributed across structured data and XML documents. We bring up an algorithm link a given XML document with relevant structured data.

Kejun Zhao; Yang Liu; Qi Liu; Shanyong Yang

2010-01-01

222

Dual Syntax for XML Languages Claus Brabrand, Anders Mller , and Michael I. Schwartzbach  

E-print Network

Dual Syntax for XML Languages Claus Brabrand, Anders Møller , and Michael I. Schwartzbach BRICS languages permit an alternative more legible non-XML syntax. XSLT stylesheets are often used to convert from the XML syntax to the alternative syntax; however, such transformations are not reversible since

Møller, Anders

223

Dual Syntax for XML Languages Claus Brabrand, Anders Mller # , and Michael I. Schwartzbach  

E-print Network

Dual Syntax for XML Languages Claus Brabrand, Anders Møller # , and Michael I. Schwartzbach BRICS languages permit an alternative more legible non­XML syntax. XSLT stylesheets are often used to convert from the XML syntax to the alternative syntax; however, such transformations are not reversible since

Møller, Anders

224

Access Policy Sheet for Access Control in Fine-Grained XML  

E-print Network

access to an entire XML instance, while others would like to control access at the tag level. Developing development of web environments XML data access control has been intensively studied (e.g., [2, 8, 4, 5, 3, 1Access Policy Sheet for Access Control in Fine-Grained XML Jing Wu1 , and Yi Mu1 , Jennifer Seberry

Seberry, Jennifer

225

X-Diff: An Effective Change Detection Algorithm for XML Documents  

Microsoft Academic Search

XML has become the de facto standard format for web publishing and data transportation. Since online information changes frequently, being able to quickly detect changes in XML documents is important to Internet query systems, search engines, and continuous query systems. Previous work in change detection on XML, or other hierarchically structured documents, used an ordered tree model, in which left-to-right

Yuan Wang; David J. Dewitt; Jin-yi Cai

2003-01-01

226

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

227

'ARPENTEUR' AS WEB BASED PHOTOGRAMMETRIC PACKAGE: TOWARDS INTEROPERABILITY THROUGH A XML STRUCTURE FOR PHOTOGRAMMETRIC DATA  

Microsoft Academic Search

After a description of the new photogrammetric developments in ARPENTEUR and some examples of the use of the XML formalism in the general survey process, we'll finish this paper by a call to our community to discuss about a generic XML structure of photogrammetric data. We aim to develop a public JavaTM API to manage photogrammetric data through XML files.

Pierre Drap; Pierre Grussenmeyer; Gilles Gaillard

228

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

Microsoft Academic Search

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

Alin Deutsch; Val Tannen

2003-01-01

229

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

230

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

E-print Network

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

Lascarides, Alex

231

A Survey of XML Query Languages  

Microsoft Academic Search

Abstract: data types Yes No No No No YesType coercion Yes No No No Partially YesSupport of Schema No No No No No YesSupport of XPointer & XLink No No No No No PartiallyTag var i ab l es Yes Yes No No No NoUpdate language Yes No Yes No No No3XQuery is most directly a descendant of an XMLquery

Josh Spiegel

232

Limits of Recursive Triangle and Polygon Tunnels  

E-print Network

In this paper we present unsolved problems that involve infinite tunnels of recursive triangles or recursive polygons, either in a decreasing or in an increasing way. The “nedians or order i in a triangle ” are generalized to “nedians of ratio r ” and “nedians of angle ? ” or “nedians at angle ?”, and afterwards one considers their corresponding “nedian triangles ” and “nedian polygons”. This tunneling idea came from physics. A) Open Question 1 (Decreasing Tunnel). 1. Let ? ABC be a triangle and let ? A1B1C1 be its orthic triangle (i.e. the triangle formed by the feet of its altitudes) and H1 its orthocenter (the point on intersection of its altitudes). Then, let’s consider the triangle ? A2B2C2, which is the orthic triangle of triangle ? A1B1C1, and H2 its orthocenter. And the recursive tunneling process continues in the same way. Therefore, let’s consider the triangle ? AnBnCn, which is the orthic triangle of triangle ? An-1Bn-1Cn-1, and Hn its orthocenter. a) What is the geometric place of the orthocenter points H1, H2, …, Hn, …? b) Is this limit: lim ? AnBnCn n ? ? convergent to a point? If so, what is this point? c) Calculate the sequences ?n= area ( ?AnBnCn) area A B C ( ? n ? 1 n ? 1 n ? 1) and ?n= perimeter ( ?ABC n n n) perimeter A B C ( ? n ? 1 n ? 1 n ? 1) d) We generalize the problem from triangles to polygons. Let AB…M be a polygon with m ? 4 sides. From A we draw a perpendicular on the next polygon’s side BC, and note its intersection with this side by A1. And so on. We get another polygon A1B1…M1. We continue the recursive construction of this tunnel of polygons and we get the polygon sequence AnBn…Mn. d1) Calculate the limit: lim ? AnBn…Mn n ? ? d2) And the ratios of areas and perimeters as in question c). e) A version of this polygonal extension d) would be to draw a perpendicular from A not necessarily on the next polygon’s side, but on another side (say, for example, on the third polygon’s side) – and keep a similar procedure for the next perpendiculars from all polygon vertices B, C, etc. In order to tackle the problem in a easier way, one can start by firstly studying particular initial triangles ? ABC, such as the equilateral and then the isosceles.

233

Recursive estimator for OSO-8 attitude  

NASA Technical Reports Server (NTRS)

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

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

1978-01-01

234

A New Spectrum of Recursive Models Using An Amalgamation Construction  

E-print Network

A New Spectrum of Recursive Models Using An Amalgamation Construction Uri Andrews September 1, 2010 presentable models are the prime and saturated models, adds a new spectrum to the list of known possible recursively presentable model is saturated, gives the second non-trivial example of a spectrum produced

Andrews, Uri

235

Recursion in reconfigurable computing: A survey of implementation approaches  

Microsoft Academic Search

Reconfigurable systems are widely used nowadays to increase performance of computationally intensive applications. There exist a lot of synthesis tools that automatically generate customized hardware circuits from specifications in both high-level and hardware description languages. However, such tools have a limited applicability because they are unable to handle recursive functions whereas it is known that recursion is a powerful problem-

Iouliia Skliarova; Valery Sklyarov

2009-01-01

236

Relational Interpretations of Recursive Types in an Operational Setting  

E-print Network

Relational Interpretations of Recursive Types in an Operational Setting Lars Birkedal and Robert running head: Recursive Types in an Operational Setting Mailing address of corresponding author: Lars and a target language, each with a well-de ned syntax and seman- tics. The problem is then to prove

Harper, Robert

237

A SUFFICIENT CONDITION FOR REDUCING RECURSIONS IN HIDDEN MARKOV MODELS  

E-print Network

A SUFFICIENT CONDITION FOR REDUCING RECURSIONS IN HIDDEN MARKOV MODELS Yun S. Song Department of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK Abstract In hidden Markov models condition for simplifying the recursion relations for a certain class of hidden Markov models

Slatkin, Montgomery

238

On the distribution of distances in recursive trees  

E-print Network

of epidemics, family trees of ancient manuscripts, and pyramid schemes. A tree Tn with n labeled nodes (1982) use recursive trees to aid in the construction of the family trees of preserved copies of ancientOn the distribution of distances in recursive trees by Robert P. Dobrow1 National Institute

Dobrow, Bob

239

Performance of recursive suppression algorithm in nonstationary environments  

Microsoft Academic Search

Adaptive superresolution algorithms possess the inherent ability to adapt to nonstationary environments. The recursive suppression algorithm is shown to provide much better resolution than the MUSIC algorithm when the average signal-to-noise ratios at array outputs are low and there are power variations or there is relative motion between the array and closely spaced signal sources. An implementation of the recursive

Don Torrieri; Kesh Bakhru

1995-01-01

240

Recursion relations for the multiparton collinear limit and splitting functions  

E-print Network

We present a systematic method to evaluate the splitting functions for tree-level QCD processes where m partons approach the collinear limit. The splitting functions are computed by deriving on-shell recursion equations, which are similar to the Berends-Giele recursion relations for off-shell currents.

Catani, Stefano; Rodrigo, Germán

2012-01-01

241

Recursion relations for the multiparton collinear limit and splitting functions  

E-print Network

We present a systematic method to evaluate the splitting functions for tree-level QCD processes where m partons approach the collinear limit. The splitting functions are computed by deriving on-shell recursion equations, which are similar to the Berends-Giele recursion relations for off-shell currents.

Stefano Catani; Petros Draggiotis; Germán Rodrigo

2012-10-02

242

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

243

Recursive parameter estimation of hydrologic models  

NASA Astrophysics Data System (ADS)

Proposed is a nonlinear filtering approach to recursive parameter estimation of conceptual watershed response models in state-space form. The conceptual model state is augmented by the vector of free parameters which are to be estimated from input-output data, and the extended Kaiman filter is used to recursively estimate and predict the augmented state. The augmented model noise covariance is parameterized as the sum of two components: one due to errors in the augmented model input and another due to errors in the specification of augmented model constants that were estimated from other than input-output data (e.g., topographic and rating curve constants). These components depend on the sensitivity of the augmented model to input and uncertain constants. Such a novel parameterization allows for nonstationary model noise statistics that are consistent with the dynamics of watershed response as they are described by the conceptual watershed response model. Prior information regarding uncertainty in input and uncertain constants in the form of degree-of-belief estimates of hydrologists can be used directly within the proposed formulation. Even though model structure errors are not explicitly parameterized in the present formulation, such errors can be identified through the examination of the one-step ahead predicted normalized residuals and the parameter traces during convergence. The formulation is exemplified by the estimation of the parameters of a conceptual hydrologic model with data from the 2.1-km2 watershed of Woods Lake located in the Adirondack Mountains of New York.

Rajaram, Harihar; Georgakakos, Konstantine P.

1989-02-01

244

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

245

Recursive support vector machines for dimensionality reduction.  

PubMed

The usual dimensionality reduction technique in supervised learning is mainly based on linear discriminant analysis (LDA), but it suffers from singularity or undersampled problems. On the other hand, a regular support vector machine (SVM) separates the data only in terms of one single direction of maximum margin, and the classification accuracy may be not good enough. In this letter, a recursive SVM (RSVM) is presented, in which several orthogonal directions that best separate the data with the maximum margin are obtained. Theoretical analysis shows that a completely orthogonal basis can be derived in feature subspace spanned by the training samples and the margin is decreasing along the recursive components in linearly separable cases. As a result, a new dimensionality reduction technique based on multilevel maximum margin components and then a classifier with high accuracy are achieved. Experiments in synthetic and several real data sets show that RSVM using multilevel maximum margin features can do efficient dimensionality reduction and outperform regular SVM in binary classification problems. PMID:18269950

Tao, Qing; Chu, Dejun; Wang, Jue

2008-01-01

246

Recursive delay calculation unit for parametric beamformer  

NASA Astrophysics Data System (ADS)

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

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

2006-03-01

247

Blobbed topological recursion: properties and applications  

E-print Network

We study the set of solutions $(\\omega_{g,n})_{g \\geq 0,n \\geq 1}$ of abstract loop equations. We prove that $\\omega_{g,n}$ is determined by its purely holomorphic part: this results in a decomposition that we call "blobbed topological recursion". This is a generalization of the theory of the topological recursion, in which the initial data $(\\omega_{0,1},\\omega_{0,2})$ is enriched by non-zero symmetric holomorphic forms in $n$ variables $(\\phi_{g,n})_{2g - 2 + n > 0}$. In particular, we establish for any solution of abstract loop equations: (1) a graphical representation of $\\omega_{g,n}$ in terms of $\\phi_{g,n}$; (2) a graphical representation of $\\omega_{g,n}$ in terms of intersection numbers on the moduli space of curves; (3) variational formulae under infinitesimal transformation of $\\phi_{g,n}$ ; (4) a definition for the free energies $\\omega_{g,0} = F_g$ respecting the variational formulae. We discuss in detail the application to the multi-trace matrix model and enumeration of stuffed maps.

Gaëtan Borot; Sergey Shadrin

2015-02-18

248

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

249

Effective XML Keyword Search with Relevance Oriented Ranking  

E-print Network

Effective XML Keyword Search with Relevance Oriented Ranking Zhifeng Bao # , Tok Wang Ling # , Bo identification and relevance oriented ranking for search results. Then based on these guidelines, we design novel. Effectiveness in term of result relevance is the most crucial part in keyword search, which can be summarized

250

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

ERIC Educational Resources Information Center

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

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

2000-01-01

251

Identifying meaningful return information for XML keyword search  

Microsoft Academic Search

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

Ziyang Liu; Yi Chen

2007-01-01

252

A partition index for XML and semi-structured data  

Microsoft Academic Search

XML and other semi-structured data can be represented by a graph model. The paths in a data graph are used as a basic constructor of a query. Especially, by using patterns on paths, a user can formulate more expressive queries. Patterns in a path enlarge the search space of a data graph and current research for indexing semi-structured data focuses

Jongik Kim; Hyoung-joo Kim

2004-01-01

253

ebXML: Status, Research Issues, and Obstacles  

Microsoft Academic Search

Technologies and approaches in the field of Electronic Commerce are not mature enough in order to allow for their broad successful commercial application. Neither existing, successful approaches that are very much restricted to large companies, specific branches, and business domains, nor approaches just merging new technologies like Internet, WWW, and XML allow for scaling up electronic commerce by means of

Birgit Hofreiter; Christian Huemer; Wolfgang Klas

2002-01-01

254

FIX: Feature-based Indexing Technique for XML Martin Schloms  

E-print Network

1 FIX: Feature-based Indexing Technique for XML Documents Martin Schloms Seminar Datenbanken und. Alexander Hinneburg Lehrstuhl Datenbanken und Informationssysteme, Institut für Informatik Martin-Luther-Universität Halle-Wittenberg http://dbs.informatik.uni-halle.de/ 1 powered by LAT X Martin Schloms FIX: Feature

Hinneburg, Alexander

255

SAXM : Semi-automatic XML Schema Mapping Nuttakan Amarintrarak  

E-print Network

values between two XML schemas elements. Moreover, a user can verify the mapping to provide a more Order Product_ID cost unitName Schema A Schema B amount Figure 1. Example input schemas 3.1. Semantic accurate result. Experimental results show that our proposed method provides the highest recall

Runapongsa, Kanda

256

Integration of automation design information using XML technologies  

E-print Network

Integration of automation design information using XML technologies Master of Science Thesis Mika UNIVERSITY OF TECHNOLOGY DEPARTMENT OF AUTOMATION #12;2 Abstract TAMPERE UNIVERSITY OF TECHNOLOGY Automation Degree Program Institute of Automation and Control Viinikkala, Mika: Integration of automation design

257

An Efficient Approach to Support Querying Secure Outsourced XML Information  

E-print Network

storage [2], e.g. the hard drive may be stolen. The heterogeneous nature of XML data raises newInfo> John Smith CreditCard> 4019 2445 0277 5567 Bank of the Internet 04/09 CreditCard> Susan Smith CreditCard

Ng, Wilfred Siu Hung

258

XProj: A Framework for Projected Structural Clustering of XML Documents  

E-print Network

characteristic of data sets also makes it a chal- lenging problem for a variety of data mining problems. One is defined as follows. For a database D of records, we would like to segment the data into groups of objects Polytechnic Institute Troy, NY zaki@cs.rpi.edu ABSTRACT XML has become a popular method of data representation

Zaki, Mohammed Javeed

259

Security for XML messaging services - a component-based approach  

Microsoft Academic Search

The objective of this paper is to throw light on the application of component technology in deploying security models to protect web transactions. The proposed component-based security model is an alternative methodology for conventional methods that are vendor dependent. This model uses Extensible Markup Language (XML) format to represent web transactions, because of the multi-platform nature of modern web applications.

K. Komathy; V. Ramachandran; P. Vivekanandan

2003-01-01

260

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

261

An XML data representation model for power system reliability assessment  

Microsoft Academic Search

The main objective of this paper is to present an XML-based data representation model for the exchange of power system reliability information among the power system community. Legacy power system applications represent power system data as IEEE common data format, industry standard Common Information Model (CIM) and the huge number of proprietary formats that makes it difficult to exchange the

Anbalagan; Malarvizhi; Ponmagal

2010-01-01

262

Management of XML Documents in an Integrated Digital Library  

E-print Network

in the context of a large, heterogeneous digital library. The system manages multiple DTDs through mappings from in building a hypertextual digital library. This document management system is the back end for a productionManagement of XML Documents in an Integrated Digital Library David A. Smith Anne Mahoney Jeffrey A

Smith, David A.

263

XML-Based RDF Data Management for Efficient Query Processing  

E-print Network

XML-Based RDF Data Management for Efficient Query Processing Mo Zhou Indiana University, USA mozhou requires robust and scalable data repos- itories that can store RDF data and support efficient evaluation of SPARQL queries. Most of the existing RDF storage techniques rely on relation model and relational

Wu, Yuqing Melanie

264

Comparative analysis of reporting mechanisms based on XML technology  

Microsoft Academic Search

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

Dariusz Król; Jacek Oleksy

265

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

E-print Network

XMill: an Efficient Compressor for XML Data Hartmut Liefke \\Lambda Univ. of Pennsylvania liefke at roughly the same speed. The compressor, called XMill, incorporates and combines existing compressors of datatype specific compressors for simple data types, and, possibly, user defined compressors

Suciu, Dan

266

XML Stream Processing Using a Lazy Concurrent Language  

Microsoft Academic Search

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

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

2008-01-01

267

Link Detection in XML Documents: What about repeated links?  

E-print Network

Link Detection in XML Documents: What about repeated links? Junte Zhang University of Amsterdam kamps@uva.nl ABSTRACT Link detection is a special case of focused retrieval where potential links between documents have to be detected au- tomatically. The use case, as studied at INEX's Link the Wiki

Kamps, Jaap

268

Moving to XML: Latin texts XML conversion project at the Center for Electronic Texts in the Humanities  

Microsoft Academic Search

The delivery of documents on the Web has moved beyond the restrictions of the traditional Web markup language, HTML. HTML’s static tags cannot deal with the variety of data formats now beginning to be exchanged between various entities, whether corporate or institutional. XML solves many of the problems by allowing arbitrary tags, which describe the content for a particular audience

Brian Hancock; Michael J. Giarlo

2001-01-01

269

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

270

On Multi-step BCFW Recursion Relations  

E-print Network

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

Feng, Bo; Zhou, Kang

2015-01-01

271

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

Microsoft Academic Search

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

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

1992-01-01

272

XML does Real Programmers a Service  

SciTech Connect

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

Gorton, Ian

2008-09-01

273

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

2008-02-05

274

Recursive estimation of prior probabilities using the mixture approach  

NASA Technical Reports Server (NTRS)

The problem of estimating the prior probabilities q sub k of a mixture of known density functions f sub k(X), based on a sequence of N statistically independent observations is considered. It is shown that for very mild restrictions on f sub k(X), the maximum likelihood estimate of Q is asymptotically efficient. A recursive algorithm for estimating Q is proposed, analyzed, and optimized. For the M = 2 case, it is possible for the recursive algorithm to achieve the same performance with the maximum likelihood one. For M 2, slightly inferior performance is the price for having a recursive algorithm. However, the loss is computable and tolerable.

Kazakos, D.

1974-01-01

275

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

NASA Technical Reports Server (NTRS)

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

Detter, Ryan; Mooney, Michael; Fatig, Curtis

2003-01-01

276

Digital subtraction x-ray cardioangiography using a recursive background estimation algorithm  

NASA Astrophysics Data System (ADS)

The digital subtraction angiography (DSA) method is not directly applicable to cardiovascular sequences because of the anatomy motion. We have developed a simple cardiovascular extension of DSA that updates the mask in real time rather than applying the same mask on the whole sequence. The algorithm uses a velocity based segmentation to discriminate vessels and background. This discrimination is possible because of the cardiovascular sequences fundamental property of faster vessel motion compared to the background motion. The real time mask estimation is done as a recursively implemented generalized maximum operation over the sequence. This operation yields a sequence of masks which is subtracted from the original sequence. The algorithm is causal and can therefore be implemented in real time acquisition systems. We have applied it to x-ray fluoroscopic and radiographic cardiovascular sequences obtaining a nearly DSA-quality sequences with substantially improved vessel contrast. The algorithm de facto provides a simple cardia specific motion detection method which can be used in noise reduction algorithms. The recursive background estimation approach can be generalized to other cardiac imaging modalities.

Boutenko, Vladislav; Lebihen, Thierry; Perchant, Aymeric

1998-06-01

277

A new scene-based nonuniformity corrrection applied in boundary backward recursive reconstruction for arbitrary subpixel microscan  

NASA Astrophysics Data System (ADS)

A scene-based nonuiformity correction occurred in the operation of recursive reconstruction for high resolution extracted from subpixel microscan imaging (SMI) sequence are presented and analyzed. The reconstruction algorithm in terms of block-by-block method recursive from the prescient boundary to centre in uniform 2×2 SMI, is updated to the two-dimensional focus plane array (FPA) considering the arbitrary scan translation not equivalent to the accurate halfpixel. In this paper, the focus is concentrated to the nonuniform SMI model with fixed pattern noise (FPN), which corrupts the image by the gain and offset from the individual cell-detector. Then, we firstly demonstrate that once our backward recursive reconstruction implements to the undersampled sequence with FPN, the dramatic impact to the majority pixels is the elimination of the offset due to the quits efficiency by inverse iterative function in each 2×2 region belonging to the high resolution lattice. The final achievement is the nonuiformity correction (NUC) synchronously concomitant with the higher resolution, so our method fully takes account of the potential information of the scanned inter-frames. Application of proposed algorithm to the simulated SMI procedure has the obvious superiority, including the much better image quality indexes from the cleaned FPN, time-consumed saving within one scan period (4 frames), no requirements of statistical assumption so as to the avoidance of ghost artifact, and the inter-frames adaptive property.

Chen, Yi-nan; Jin, Wei-qi; Zhao, Lei; Zhao, Lin; Wang, Tan

2008-02-01

278

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

NASA Astrophysics Data System (ADS)

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

Staley, Tim D.

2014-11-01

279

Online Prediction of Semi-structured Data Streams and Its Application to XML Data Compression  

Microsoft Academic Search

Discrete sequence prediction has a wide range of applications, e.g., sequence pattern discovery, anomaly detection, biological sequence analysis, data compression. This paper studies online prediction of XML data streams. We present a probabilistic prediction model for XML data streams, called XPST (XML Prediction Sux Tree), which is a natural generalization of variable-length context-based prediction model PST (Probabilistic sux tree) for

Shotaro KAWANO; Hiroki ARIMURA; Setsuo ARIKAWA

2003-01-01

280

XPeer: A Self-Organizing XML P2P Database System  

Microsoft Academic Search

This paper describes XPeer, a zero-administration system for sharing and querying XML data. The system allows users to share XML data without significant human intervention, and to pose XQuery FLWR queries against them.The proposed system can be used in any application field, being a general purpose XML p2p DBMS, even though its main application is the management of resource descriptions

Carlo Sartiani; Paolo Manghi; Giorgio Ghelli; Giovanni Conforti

2004-01-01

281

Information retrieval system for Japanese Standard Disease-code Master Using XML Web Service.  

PubMed

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

282

Analog Computers and Recursive Functions Over Daniel Silva Graca  

E-print Network

/FCT, Universidade do Algarve, C. Gambelas, 8000­062 Faro, Portugal Josâ??e Fâ??elix Costa DM/IST, Universidade TAnalog Computers and Recursive Functions Over the Reals Daniel Silva Graâ?şca CLC and ADM

Lisboa, Universidade TĂ©cnica de

283

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"

284

Recursive Data Mining for Role Identification in Electronic Communications  

E-print Network

Recursive Data Mining for Role Identification in Electronic Communications Authors: Vineet Chaoji Data Mining (RDM). We demonstrate a novel application of RDM to role identification in electronic within different communication communities. Moreover, each individual exchange in electronic

Varela, Carlos

285

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 Ernström; Gary Kennedy

1996-01-01

286

Faster Algorithms for Searching Relevant Matches in XML Databases  

Microsoft Academic Search

\\u000a Keyword search is a friendly mechanism for the end user to identify interesting nodes in XML databases, and the SLCA (smallest\\u000a lowest common ancestor)-based keyword search is a popular concept for locating the desirable subtrees corresponding to the\\u000a given query keywords. However, it does not evaluate the importance of each node under those subtrees. Liu and Chen proposed\\u000a a new

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

2010-01-01

287

Enhance Reuse of Standard e-Business XML Schema Documents  

SciTech Connect

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

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

2005-07-01

288

QuakeML - An XML Schema for Seismology  

Microsoft Academic Search

We propose an extensible format-definition for seismic data (QuakeML). Sharing data and seismic information efficiently is one of the most important issues for research and observational seismology in the future. The eXtensible Markup Language (XML) is playing an increasingly important role in the exchange of a variety of data. Due to its extensible definition capabilities, its wide acceptance and the

A. Wyss; D. Schorlemmer; S. Maraini; M. Baer; S. Wiemer

2004-01-01

289

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

290

Quantum rings and recursion relations in 2D quantum gravity  

SciTech Connect

This paper discusses tachyon condensate perturbations to the action of the two-dimensional string theory corresponding to the c + 1 matrix model. These are shown to deform the action of the ground ring on the tachyon modules, confirming a conjecture of Witten. The ground ring structure is used to derive recursion relations which relate (N + 1) and N tachyon bulk scattering amplitudes. These recursion relations allow one to compute all bulk amplitudes.

Kachru, S. (Princeton Univ., NJ (United States). Dept. of Physics)

1992-05-30

291

Recursive encoding and decoding of the noiseless subsystem for qudits  

E-print Network

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

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

2014-04-04

292

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

293

Color-dressed recursive relations for multi-parton amplitudes  

E-print Network

Remarkable progress inspired by twistors has lead to very simple analytic expressions and to new recursive relations for multi-parton color-ordered amplitudes. We show how such relations can be extended to include color and present the corresponding color-dressed formulation for the Berends-Giele, BCF and a new kind of CSW recursive relations. A detailed comparison of the numerical efficiency of the different approaches to the calculation of multi-parton cross sections is performed.

Claude Duhr; Stefan Hoeche; Fabio Maltoni

2006-07-05

294

Color-dressed recursive relations for multi-parton amplitudes  

NASA Astrophysics Data System (ADS)

Remarkable progress inspired by twistors has lead to very simple analytic expressions and to new recursive relations for multi-parton color-ordered amplitudes. We show how such relations can be extended to include color and present the corresponding color-dressed formulation for the Berends-Giele, BCF and a new kind of CSW recursive relations. A detailed comparison of the numerical efficiency of the different approaches to the calculation of multi-parton cross sections is performed.

Duhr, Claude; Höche, Stefan; Maltoni, Fabio

2006-08-01

295

Recursive relations for processes with n photons of noncommutative QED  

NASA Astrophysics Data System (ADS)

Recursion relations are derived in the sense of Berends-Giele for the multi-photon processes of noncommutative QED. The relations concern purely photonic processes as well as the processes with two fermions involved, both for arbitrary number of photons at tree level. It is shown that despite of the dependence of noncommutative vertices on momentum, in contrast to momentum-independent color factors of QCD, the recursion relation method can be employed for multi-photon processes of noncommutative QED.

Jafari, Abolfazl

2007-10-01

296

Recursion Hypothesis Considered as a Research Program for Cognitive Science  

Microsoft Academic Search

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

Pauli Brattico

2010-01-01

297

An XML Driven Graphical User Interface and Application Management Toolkit  

SciTech Connect

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

White, Greg R

2002-01-18

298

Statistical Error Analysis for Digital Recursive Filters  

NASA Astrophysics Data System (ADS)

The study of arithmetic roundoff error has attracted many researchers to investigate how the signal-to-noise ratio (SNR) is affected by algorithmic parameters, especially since the VLSI (Very Large Scale Integrated circuits) technologies have become more promising for digital signal processing. Typically, digital signal processing involving, either with or without matrix inversion, will have tradeoffs on speed and processor cost. Hence, the problems of an area-time efficient matrix computation and roundoff error behavior analysis will play an important role in this dissertation. A newly developed non-Cholesky square-root matrix will be discussed which precludes the arithmetic roundoff error over some interesting operations, such as complex -valued matrix inversion with its SNR analysis and error propagation effects. A non-CORDIC parallelism approach for complex-valued matrix will be presented to upgrade speed at the cost of moderate increase of processor. The lattice filter will also be looked into, in such a way, that one can understand the SNR behavior under the conditions of different inputs in the joint process system. Pipelining technique will be demonstrated to manifest the possibility of high-speed non-matrix-inversion lattice filter. Floating point arithmetic modelings used in this study have been focused on effective methodologies that have been proved to be reliable and feasible. With the models in hand, we study the roundoff error behavior based on some statistical assumptions. Results are demonstrated by carrying out simulation to show the feasibility of SNR analysis. We will observe that non-Cholesky square-root matrix has advantage of saving a time of O(n^3) as well as a reduced realization cost. It will be apparent that for a Kalman filter the register size is increasing significantly, if pole of the system matrix is moving closer to the edge of the unit circle. By comparing roundoff error effect due to floating-point and fixed-point arithmetics, we can see that floating-point arithmetic is less sensitive to maximum/minimum value of a matrix. Implementation of parallelism on complex-valued matrix can be justified in the sense of simpler hardware and higher speed. It will be illustrated that the more correlated inputs are present in the lattice filter, the SNR of the order-recursive filter will be degraded faster. Pipelining technique will be proved to be effective in speed upgradation, especially for the order-recursive lattice filter whose order is usually very high.

Wu, Kevin Chi-Rung

299

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

300

Recursive Construction of Operator Product Expansion Coefficients  

NASA Astrophysics Data System (ADS)

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

Holland, Jan; Hollands, Stefan

2015-02-01

301

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

302

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

E-print Network

identification and relevance oriented ranking for search results. Then based on these guidelines, we design novel the relevance based ranking problem w.r.t. the search intention. Regarding to Issue 1 and Issue 2, XML keyword1 Towards an Effective XML Keyword Search Zhifeng Bao, Jiaheng Lu, Tok Wang Ling and Bo Chen

Ling, Tok Wang

303

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

E-print Network

Sound ranking algorithms for XML search in PF/Tijah Djoerd Hiemstra1 , Stefan Klinger2 , Henning@cs.utwente.nl Abstract We argue that ranking algorithms for XML should reflect the actual combined content and structure constraints of queries, while at the same time producing equal rankings for queries that are semantically

Hiemstra, Djoerd

304

From an ebXML BPSS choreography to a BPEL-based implementation  

Microsoft Academic Search

ebXML and Web Services are two well accepted technologies to implement business collaborations. In this paper we concentrate on the choreography of business collaborations. The corresponding standards of ebXML and Web Services are BPSS and BPEL, respectively. We present when and why we need to transform between these two standards. For the transformation we examine the difference between them. Furthermore,

Ja-hee Kim; Christian Huemer

2004-01-01

305

ebXML Business Processes - Defined both in UMM and BPSS  

Microsoft Academic Search

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

Birgit Hofreiter; Christian Huemer

306

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

E-print Network

enabled tool. XML appeals to users across the entire spectrum of enterprises from large enterprises to small and medium enterprises to the end-user creating XML documents in their word processor and logistics information into the information flow is critical to increased competitiveness. Can you obtain

307

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

E-print Network

search, lately, search engines such as Google Search and Microsoft Bing, let users reward search results and effective search for information within large XML corpora is thus crucial. Optimizing the XML stor- age Web data authored in a distributed, independent fashion, one could greatly improve search

Paris-Sud XI, Université de

308

CDE Technical Report 2003-1 1 Developing XML Vocabularies for Web Services  

E-print Network

CDE Technical Report 2003-1 1 Developing XML Vocabularies for Web Services Calvin Smith Patrick 2003-1 Abstract Web services depend on XML documents that can be understood by the parties (or of "easy integration" and "interoperability" with web services are undermined by the need for custom coding

Glushko, Robert J.

309

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time  

E-print Network

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time Joost Engelfriet transformations can be expressed by deterministic top-down tree trans- ducers. A normal form is presented, the normal form can be obtained in polynomial time as well. Key words: XML, top-down tree transducer

Seidl, Helmut

310

Deciding Equivalence of TopDown XML Transformations in Polynomial Time  

E-print Network

Deciding Equivalence of Top­Down XML Transformations in Polynomial Time Sebastian Maneth National transformations can be formulated through deterministic top­down tree transducers. A canonical form. Keywords Xml, top­down tree transducer, equivalence, minimization. 1. INTRODUCTION The transformation

Seidl, Helmut

311

Prototype for Wrapping and Visualizing Geo-Referenced Data in A Distributed Environment Using XML Technology  

E-print Network

Prototype for Wrapping and Visualizing Geo-Referenced Data in A Distributed Environment Using XML This paper proposes a prototype for integration and visualization of geo-referenced information (GRI XML document and draw it inside the browser window by using a Java applet. Keywords Geo

Gruenwald, Le

312

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

313

Articulating Information Needs in XML Query JAAP KAMPS, MAARTEN MARX, MAARTEN DE RIJKE  

E-print Network

Articulating Information Needs in XML Query Languages JAAP KAMPS, MAARTEN MARX, MAARTEN DE RIJKE through XML- Authors' addresses: J. Kamps, Archives and Information Studies, Faculty of Humanities, Univer, the Netherlands. Email: {kamps,marx,mdr,borkur}@science.uva.nl. Permission to make digital/hard copy of all

Kamps, Jaap

314

Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document  

E-print Network

Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document Hongzhi Wang1 document on some given schema. The query processing of graph- structured XML document brings new challenges. In this paper, for the processing of subgraph query, we design a sub- graph join algorithm based on reachability

Lin, Xuemin

315

Web Ecology: Recycling HTML pages as XML documents using W4F  

E-print Network

Web Ecology: Recycling HTML pages as XML documents using W4F Arnaud Sahuguet Department of Computer sources. Some key features of W4F are an expres­ sive language to extract information from HTML pages, we demonstrate how to use W4F to cre­ ate XML gateways, that serve transparently and on­the­fly HTML

Pennsylvania, University of

316

Web Ecology: Recycling HTML pages as XML documents using W4F  

E-print Network

Web Ecology: Recycling HTML pages as XML documents using W4F Arnaud Sahuguet Department of Computer key features of W4F are an expres- sive language to extract information from HTML pages, we demonstrate how to use W4F to cre- ate XML gateways, that serve transparently and on-the- y HTML

Pennsylvania, University of

317

Extensible Transcoder for HTML to VoiceXML Conversion Narayan Annamalai, B. Prabhakaran, and Gopal Gupta  

E-print Network

Extensible Transcoder for HTML to VoiceXML Conversion Narayan Annamalai, B. Prabhakaran, and Gopal. The data in the web is stored in HTML (Hyper Text Markup Language) format which cannot be delivered of audio. Thus it is imperative that a transcoder which converts HTML data to VoiceXML data is developed

Gupta, Gopal

318

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

E-print Network

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

van der Torre, Leon

319

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

E-print Network

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

320

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 Lagrangians—as 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 that—if an explicit form of the calibrated annulus kernel is provided for any other knot—the 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

321

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

322

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

323

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

324

Associating Style Sheets with XML documents Version 1.0  

NSDL National Science Digital Library

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

1999-01-01

325

Haydock's recursive solution of self-adjoint problems. Discrete spectrum  

NASA Astrophysics Data System (ADS)

Haydock's recursive solution is shown to underline a number of different concepts such as (i) quasi-exactly solvable models, (ii) exactly solvable models, (iii) three-term recurrence solutions based on Schweber's quantization criterion in Hilbert spaces of entire analytic functions, and (iv) a discrete quantum mechanics of Odake and Sasaki. A recurrent theme of Haydock's recursive solution is that the spectral properties of any self-adjoint problem can be mapped onto a corresponding sequence of polynomials {pn(E) } in energy variable E. The polynomials {pn(E) } are orthonormal with respect to the density of states n0(E) and energy eigenstate | E > is the generating function of {pn(E) } . The generality of Haydock's recursive solution enables one to see the different concepts from a unified perspective and mutually benefiting from each other. Some results obtained within the particular framework of any of (i) to (iv) may have much broader significance.

Moroz, Alexander

2014-12-01

326

Recursive form of the eigensystem realization algorithm for system identification  

NASA Technical Reports Server (NTRS)

An algorithm is developed for recursively calculating the minimum realization of a linear system from sampled impulse response data. The Gram-Schmidt orthonormalization technique is used to generate an orthonormal basis for factorization of the data matrix. The system matrix thus identified is in upper Hessenberg form, which has advantages for the identification of modal parameters including damping coefficients, frequencies, mode shapes, and modal participation factors. It also has the property that once an element of the system matrix is computed, it is never altered as the dimension of the model is increased in the recursive process. Numerical examples are presented for comparison of the recursive and nonrecursive forms of the eigensystem realization algorithm.

Longman, Richard W.; Juang, Jer-Nan

1989-01-01

327

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

328

COMPARING THE STRENGTH OF DIAGONALLY NON-RECURSIVE FUNCTIONS IN THE ABSENCE OF 0  

E-print Network

-recursive function, must be in want of a 2-bounded diag- onally non-recursive function [2]. An enduring project: January 15, 2014. Paul Shafer is an FWO Pegasus Long Postdoctoral Fellow, and he also acknowledges

Hirst, Jeff

329

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

2013-02-09

330

A decoupled recursive approach for constrained flexible multibody system dynamics  

NASA Technical Reports Server (NTRS)

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

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

1989-01-01

331

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

332

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

333

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

334

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

335

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

336

Email Updates  

MedlinePLUS

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

337

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

338

Recursion and the Competence/Performance Distinction in AGL Tasks  

ERIC Educational Resources Information Center

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

Lobina, David J.

2011-01-01

339

Transforming loops to recursion for multi-level memory hierarchies  

Microsoft Academic Search

Recently, there have been several experimental and theoretical results showing significant performance benefits of recursive algorithms on both multi-level memory hierarchies and on shared-memory systems. In particular, such algorithms have the data reuse characteristics of a blocked algorithm that is simultaneously blocked at many different levels. Most existing applications, however, are written using ordinary loops. We present a new compiler

Qing Yi; Vikram S. Adve; Ken Kennedy

2000-01-01

340

A recursive approach for the finite element computation of waveguides  

E-print Network

finite element software to be exploited. Similar techniques were also developed by [14A recursive approach for the finite element computation of waveguides Denis Duhamel a a Preprint submitted to Elsevier hal-00348390,version1-18Dec2008 #12;Abstract The finite element computation

Paris-Sud XI, Université de

341

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

342

Backstepping to passivity: recursive design of adaptive systems  

Microsoft Academic Search

A major obstacle to the wider use of the passivity concept has been its limitation to systems of relative degree one. The relative degree limitation has been effectively removed by various forms of a recursive procedure called backstepping. It is shown how backstepping is used to design a generation of adaptive controllers for nonlinear systems. The backstepping procedure provides a

Petar V. KokotoviC; Miroelav KrstiC; I. Kanellakopoulos

1992-01-01

343

CPSC 235 Fall 2013 Assignment 3: Drawing A Recursive Curve  

E-print Network

CPSC 235 ­ Fall 2013 Assignment 3: Drawing A Recursive Curve Due: October 23 2010, before mid a pattern along its route. Documentation on turtle graphics in QuickDraw can be found at #12;http://pages.cpsc to the instructor as an email attachment. For the title of the email, write `CPSC 235 A3 100345'. Name your program

Li, Zongpeng

344

An Efficient Recursive Factorization Method for Determining Structure from Motion  

Microsoft Academic Search

A recursive method is presented for recovering 3D ob- ject shape and camera motion under orthography from an extended sequence of video images. This may be viewed as a natural extension of both the original (9) and the sequen- tial (7) factorization methods. A critical aspect of these factorization approaches is the estimation of the so-called shape space (7), and

Yanhua Li; Michael J. Brooks

1999-01-01

345

Recursive Governance: Contemporary Political Communication and Public Policy  

Microsoft Academic Search

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

Michael Crozier

2007-01-01

346

Recursivity: A Working Paper on Rhetoric and "Mnesis"  

ERIC Educational Resources Information Center

This essay proposes the genealogical study of remembering and forgetting as recursive rhetorical capacities that enable discourse to place itself in an ever-changing present. "Mnesis" is a meta-concept for the arrangements of remembering and forgetting that enable rhetoric to function. Most of the essay defines the materiality of "mnesis", first…

Stormer, Nathan

2013-01-01

347

FIBONACCI'S SEQUENCE OBTAINED BY A GENERAL RECURSIVE FORMULA  

E-print Network

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

348

CPS Recursive Ascent Parsing Arthur Nunes-Harwitt  

E-print Network

CPS Recursive Ascent Parsing Arthur Nunes-Harwitt Nassau Community College One Education Drive Garden City, NY 11530 nunesa@newton.matcmp.ncc.edu ABSTRACT The parsing problem is ubiquitous in Computer. By writing a parser using con- tinuation passing style (CPS) it is possible to get both the benefit of being

Nunes-Harwitt, Arthur

349

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.

350

Static mapping by dual recursive bipartitioning of process architecture graphs  

Microsoft Academic Search

The combinatorial optimization problem of assigning the communicating processes of a parallel program onto a parallel machine so as to minimize its overall execution time is referred to as static mapping. This problem is NP-complete in general. We introduce a mapping algorithm based on the recursive bipartitioning of both the source process graph and the target architecture graph, whose divide

Francois Pellegrini; URA CNRS

1994-01-01

351

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

352

A new constant memory recursion for hidden Markov models.  

PubMed

We develop the recursion for hidden Markov (HM) models proposed by Bartolucci and Besag (2002), and we show how it may be used to implement an estimation algorithm for these models that requires an amount of memory not depending on the length of the observed series of data. This recursion allows us to obtain the conditional distribution of the latent state at every occasion, given the previous state and the observed data. With respect to the estimation algorithm based on the well-known Baum-Welch recursions, which requires an amount of memory that increases with the sample size, the proposed algorithm also has the advantage of not requiring dummy renormalizations to avoid numerical problems. Moreover, it directly allows us to perform global decoding of the latent sequence of states, without the need of a Viterbi method and with a consistent reduction of the memory requirement with respect to the latter. The proposed approach is compared, in terms of computing time and memory requirement, with the algorithm based on the Baum-Welch recursions and with the so-called linear memory algorithm of Churbanov and Winters-Hilt. The comparison is also based on a series of simulations involving an HM model for continuous time-series data. PMID:24160767

Bartolucci, Francesco; Pandolfi, Silvia

2014-02-01

353

Recursive identification of gesture inputs using hidden Markov models  

Microsoft Academic Search

Human-machine interfaces play a role of growing importance as computer technology continues to evolve. Motivated by the desire to provide users with an intuitive gesture input system, we describe the design of a recursive filter applied to the vision-based gesture interpretation problem. The gestures are modeled as a hidden Markov model with the state representing the gesture sequences, and the

Jennifer Schlenzig; Edd Hunter; Ramesh Jain

1994-01-01

354

A Recursive System Identification Method Based on Binary Measurements  

E-print Network

A Recursive System Identification Method Based on Binary Measurements Kian Jafari, Member, IEEE, such as This work was supported by the research grant of French Ministry of Higher Education and Research. K. Jafari-sur-Yvette Cedex, France (Phone: + 33 169851424, e-mail: Kian.Jafari@ieee.org). J. Juillard is with SUPELEC

Paris-Sud XI, Université de

355

Accurate recovery of recursion coefficients from Gaussian quadrature formulas  

E-print Network

Accurate recovery of recursion coefficients from Gaussian quadrature formulas@na-net.ornl.gov _____________________________________________________________________________ 1 Introduction Gaussian quadrature formulas are efficient and elegant. They are deservedly of view of the numerical analyst, the calculation of Gaussian quadrature formulas is a particularly

Laurie, Dirk

356

On abstract computer virology from a recursion-theoretic perspective  

E-print Network

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

Paris-Sud XI, Université de

357

Developing Middle School Students' Understanding of Recursive and Explicit Reasoning.  

ERIC Educational Resources Information Center

This study investigated students' generalizations of numeric situations through the use of a whole-class teaching experiment in which students were provided problem situations in order to: (1) trace students' understanding of recursive and explicit reasoning; and (2) describe the sociomathematical norms and classroom practices that were…

Lannin, John

358

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

359

Starchart: Hardware and Software Optimization Using Recursive Partitioning Regression Trees  

E-print Network

Starchart: Hardware and Software Optimization Using Recursive Partitioning Regression Trees Wenhao. This paper proposes and evaluates a statistical analysis technique, Starchart, that partitions the GPU-optimized parameter settings can save 47 W (26% of total GPU power) with little performance loss. Overall, Starchart

Martonosi, Margaret

360

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

361

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

362

Managing and Querying Image Annotation and Markup in XML  

PubMed Central

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

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

2010-01-01

363

Using XML and Java Technologies for Astronomical Instrument Control  

NASA Technical Reports Server (NTRS)

Traditionally, instrument command and control systems have been highly specialized, consisting mostly of custom code that is difficult to develop, maintain, and extend. Such solutions are initially very costly and are inflexible to subsequent engineering change requests, increasing software maintenance costs. Instrument description is too tightly coupled with details of implementation. NASA Goddard Space Flight Center, under the Instrument Remote Control (IRC) project, is developing a general and highly extensible framework that applies to any kind of instrument that can be controlled by a computer. The software architecture combines the platform independent processing capabilities of Java with the power of the Extensible Markup Language (XML), a human readable and machine understandable way to describe structured data. A key aspect of the object-oriented architecture is that the software is driven by an instrument description, written using the Instrument Markup Language (IML), a dialect of XML. IML is used to describe the command sets and command formats of the instrument, communication mechanisms, format of the data coming from the instrument, and characteristics of the graphical user interface to control and monitor the instrument. The IRC framework allows the users to define a data analysis pipeline which converts data coming out of the instrument. The data can be used in visualizations in order for the user to assess the data in real-time, if necessary. The data analysis pipeline algorithms can be supplied by the user in a variety of forms or programming languages. Although the current integration effort is targeted for the High-resolution Airborne Wideband Camera (HAWC) and the Submillimeter and Far Infrared Experiment (SAFIRE), first-light instruments of the Stratospheric Observatory for Infrared Astronomy (SOFIA), the framework is designed to be generic and extensible so that it can be applied to any instrument. Plans are underway to test the framework with other types of instruments, such as remote sensing earth science instruments.

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

2001-01-01

364

Mixed Mode XML Query Processing Alan Halverson, Josef Burger, Leonidas Galanis, Ameet Kini, Rajasekar Krishnamurthy,  

E-print Network

this problem, the database community utilizes inverted list filtering, since the problem is so similar. In the XML query processing literature to date, there has been a sharp line demarcating the use of inverted

Naughton, Jeffrey F.

365

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

366

The carbohydrate sequence markup language (CabosML): an XML description of carbohydrate structures  

Microsoft Academic Search

Abstract Summary: Bioinformaticsresources for glycomics are very poor as compared,with them for genomics,and proteomics. The complexity of carbohydrate sequences makes it difficult to define a common language to represent them, and the development of bioinformaticstools for glycomics has not progressed. In this study, we developed a carbohydrate sequence markup language (CabosML), anXML description of carbohydrate structures. Availability:The language definition (XML

Norihiro Kikuchi; Akihiko Kameyama; Shuuichi Nakaya; Hiromi Ito; Takashi Sato; Toshihide Shikanai; Yoriko Takahashi; Hisashi Narimatsu

2005-01-01

367

Semi-Structure Data Management by BiDirectional Integration Between XML and RDB  

Microsoft Academic Search

Nowadays, swirling around most businesses is not structure information but semi-structure information, such as spreadsheets, and documents created by an individual or company. To fully manage and use semi-structure information as structure information does, we propose a technology based on the bi-directional integration between XML and RDB in a three-tiered structure. Through undertaking research at the intersection of XML and

Jingtao Zhou; Mingwei Wang; Shusheng Zhang; Hongwei Sun

2006-01-01

368

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

PubMed Central

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

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

2012-01-01

369

On requirements for management of mobile XML Web services and a corresponding management system  

Microsoft Academic Search

Management of mobile\\/embedded XML Web services has to take into account specifics of their execution environments, including scarce run-time memory, relatively low processing power, limited available electrical power, and slow wireless links. It also has to handle distinctive situations, such as context-sensitive operation and relatively frequent run-time communication disturbances or even disconnections. The existing solutions for management of non-mobile\\/non-embedded XML

Vladimir Tosic; H. Lutfiyya; Yazhe Tang; K. Sherdil; A. Dimitrijevic

2005-01-01

370

A Data Locating Mechanism for Distributed XML Data over P2P Networks  

Microsoft Academic Search

Abstract Many emerging applications that use XML are distributed, usually over the Internet or over large Peer-to-Peer (P2P) networks. A fundamental problem of XML query processing in these systems is how to locate the data relevant to the queries so that only useful data are involved in query evaluation. In this paper, we address this problem within the context of

Q. Wang; M. Oszu

2004-01-01

371

select h.*, p.Price as Price, NestXML(p.PricingConditions,  

E-print Network

select h.*, p.Price as Price, NestXML(p.PricingConditions, p.PNGImage) as AdditionalData from Hyper Passau, Germany New Supplier Market Place select p.ProductDescription, c.Supplier, c.AdditionalData, c.Price by p.ProductDescription, c.Price expires Friday, March 29, 2002 5:00:00 PM CET Register Products XML

Kemper, Alfons

372

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

E-print Network

Growing Triples on Trees: an XML-RDF Hybrid Model for Annotated Documents Fran¸cois Goasdou´e1, RDF, et RDFS) pour d´ecrire des documents et des annota- tions. Le concept central dans XR est que chaque noeud XML est une ressource qui peut ^etre annot´ee par des triplets RDF. Nous d´efinissons le mod

Paris-Sud XI, Université de

373

Using XML and XSLT for flexible elicitation of mental-health risk knowledge.  

PubMed

Current tools for assessing risks associated with mental-health problems require assessors to make high-level judgements based on clinical experience. This paper describes how new technologies can enhance qualitative research methods to identify lower-level cues underlying these judgements, which can be collected by people without a specialist mental-health background. Content analysis of interviews with 46 multidisciplinary mental-health experts exposed the cues and their interrelationships, which were represented by a mind map using software that stores maps as XML. All 46 mind maps were integrated into a single XML knowledge structure and analysed by a Lisp program to generate quantitative information about the numbers of experts associated with each part of it. The knowledge was refined by the experts, using software developed in Flash to record their collective views within the XML itself. These views specified how the XML should be transformed by XSLT, a technology for rendering XML, which resulted in a validated hierarchical knowledge structure associating patient cues with risks. Changing knowledge elicitation requirements were accommodated by flexible transformations of XML data using XSLT, which also facilitated generation of multiple data-gathering tools suiting different assessment circumstances and levels of mental-health knowledge. PMID:17365646

Buckingham, C D; Ahmed, A; Adams, A E

2007-03-01

374

Development of a deterministic XML schema by resolving structure ambiguity of HL7 messages.  

PubMed

Health level 7 (HL7) is a standard for medical information exchange. It defines data transfers for the application systems in the healthcare environment. Alternatively, the extensible markup language (XML) is a standard for data exchange using the Internet. If exchange messages follow the content and the sequence defined by HL7 and are expressed in the XML format, the system may benefit from the advantages of both standards. In creating the XML schema, we found ambiguities in HL7 message structures that cause the XML schema to be non-deterministic. These ambiguous expressions are summarized within 12 structures and can be replaced with equivalent or similar unambiguous structures. The finite state automata are used to verify expression equivalence. Applying this schema, an XML document may eliminate redundant segment group definitions and make the structure simple and easy to reproduce. In this paper, we discuss the methods and our experience in resolving ambiguous problems in HL7 messages to generate a deterministic XML schema. PMID:15993979

Huang, Ean-Wen; Wang, Da-Wei; Liou, Der-Ming

2005-10-01

375

The ViP2P Platform: XML Views in P2P  

E-print Network

The growing volumes of XML data sources on the Web or produced by enterprises, organizations etc. raise many performance challenges for data management applications. In this work, we are concerned with the distributed, peer-to-peer management of large corpora of XML documents, based on distributed hash table (or DHT, in short) overlay networks. We present ViP2P (standing for Views in Peer-to-Peer), a distributed platform for sharing XML documents based on a structured P2P network infrastructure (DHT). At the core of ViP2P stand distributed materialized XML views, defined by arbitrary XML queries, filled in with data published anywhere in the network, and exploited to efficiently answer queries issued by any network peer. ViP2P allows user queries to be evaluated over XML documents published by peers in two modes. First, a long-running subscription mode, when a query can be registered in the system and receive answers incrementally when and if published data matches the query. Second, queries can also be asked...

Karanasos, Konstantinos; Manolescu, Ioana; Zoupanos, Spyros

2011-01-01

376

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

377

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

378

Development of a recursion RNG-based turbulence model  

NASA Technical Reports Server (NTRS)

Reynolds stress closure models based on the recursion renormalization group theory are developed for the prediction of turbulent separated flows. The proposed model uses a finite wavenumber truncation scheme to account for the spectral distribution of energy. In particular, the model incorporates effects of both local and nonlocal interactions. The nonlocal interactions are shown to yield a contribution identical to that from the epsilon-renormalization group (RNG), while the local interactions introduce higher order dispersive effects. A formal analysis of the model is presented and its ability to accurately predict separated flows is analyzed from a combined theoretical and computational stand point. Turbulent flow past a backward facing step is chosen as a test case and the results obtained based on detailed computations demonstrate that the proposed recursion -RNG model with finite cut-off wavenumber can yield very good predictions for the backstep problem.

Zhou, YE; Vahala, George; Thangam, S.

1993-01-01

379

Encoding nondeterministic fuzzy tree automata into recursive neural networks.  

PubMed

Fuzzy neural systems have been a subject of great interest in the last few years, due to their abilities to facilitate the exchange of information between symbolic and subsymbolic domains. However, the models in the literature are not able to deal with structured organization of information, that is typically required by symbolic processing. In many application domains, the patterns are not only structured, but a fuzziness degree is attached to each subsymbolic pattern primitive. The purpose of this paper is to show how recursive neural networks, properly conceived for dealing with structured information, can represent nondeterministic fuzzy frontier-to-root tree automata. Whereas available prior knowledge expressed in terms of fuzzy state transition rules are injected into a recursive network, unknown rules are supposed to be filled in by data-driven learning. We also prove the stability of the encoding algorithm, extending previous results on the injection of fuzzy finite-state dynamics in high-order recurrent networks. PMID:15565771

Gori, Marco; Petrosino, Alfredo

2004-11-01

380

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

381

Compiler-based prefetching for recursive data structures  

Microsoft Academic Search

Software-controlled data prefetching offers the potential for bridging the ever-increasing speed gap between the memory subsystem and today's high-performance processors. While prefetching has enjoyed considerable success in array-based numeric codes, its potential in pointer-based applications has remained largely unexplored. This paper investigates compiler-based prefetching for pointer-based applications---in particular, those containing recursive data structures. We identify the fundamental problem in prefetching

Chi-Keung Luk; Todd C. Mowry

1996-01-01

382

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

Microsoft Academic Search

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

J. M. Cioffi; T. Kailath

1984-01-01

383

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

384

Ancestral DNA Sequence Reconstruction Using Recursive Genetic Algorithms  

Microsoft Academic Search

This paper explores the capabilities of genetic algorithms for reconstructing ancestral DNA sequences. We conducted a series\\u000a of experiments on reconstructing ancestral states from a given collection of taxa and their phylogenetic relationships. We\\u000a tested the proposed model using simulated phylogenies obtained from actual DNA sequences by applying realistic mutation rates.\\u000a Experimental results demonstrated that the recursive application of genetic

Mauricio Martínez; Edgar E. Vallejo; Enrique Morett

2007-01-01

385

On the recursive implementation of adaptive control for robot manipulators  

Microsoft Academic Search

This paper investigates the recursive implementation of adaptive control for robot manipulators. Using the spatial vector tool and exploiting some physical properties of multi-body systems, we propose a general framework on the seeking of the Coriolis and centripetal matrix which satisfies the so-called skew-symmetric requirement. Then two existing choices are analyzed and a new kind of Coriolis and centripetal matrix

Wang Hanlei

2010-01-01

386

A recursive density functional formalism for nonuniform fluids  

SciTech Connect

The free energy of a classical nonuniform fluid is developed in a density functional expansion defined recursively from mean field theory as a starting point. Capillary wave contributions to the structure of a two-fluid interface appear explicitly in the first order. The first order result is worked out as well in the general case of slowly varying density. Comparison with potential ensemble theory is also made.

Zhang, M.Q.; Percus, J.K. (Courant Institute of Mathematical Sciences, New York University, New York, NY (USA))

1990-06-01

387

Computer-aided design of recursive digital filters  

Microsoft Academic Search

A practical method is described for designing recursive digital filters with arbitrary, prescribed magnitude characteristics. The method uses the Fletcher-Powell optimization algorithm to minimize a square-error criterion in the frequency domain. A strategy is described whereby stability and minimum-phase constraints are observed, while still using the unconstrained optimization algorithm. The cascade canonic form is used, so that the resultant filters

KENNETH STEIGLITZ

1970-01-01

388

Efficient recursive estimation for speech enhancement in colored noise  

Microsoft Academic Search

A recursive estimation to enhance speech additively contaminated by colored noise is proposed. This method is based on the Kalman filter with time-varying modeling of the clean speech signal. Then, a hidden filter model is used to model the clean speech signal. An improvement of approximately 4.3 dB and 3.2 dB in signal-to-noise ratio (SNR) is achieved at 10 dB

Ki Yong Lee; Katsuhiko Shirai

1996-01-01

389

Recursive Segmentation and Recognition Templates for Image Parsing  

Microsoft Academic Search

In this paper, we propose a Hierarchical Image Model (HIM) which parses images to perform segmentation and object recognition. The HIM represents the image recursively by segmentation and recognition templates at multiple levels of the hierarchy. This has advantages for representation, inference, and learning. First, the HIM has a coarse-to-fine representation which is capable of capturing long-range dependency and exploiting

Long Zhu; Yuanhao Chen; Yuan Lin; Chenxi Lin; Alan Yuille

2012-01-01

390

METALOGY: A COMMENTARY ON MIND, RECURSION AND TOPOLOGICAL INFERENCE  

Microsoft Academic Search

Alfred Korzybski's map-territory metaphor and his time-binding notion are presented here as a potential framework for the explanation of the role of recursion in biological processes of cognition. Korzybski's self-reflexiveness principle is related to Gregory Bateson's 'ecology of mind' and 'radical constructiv- ism' in the work of Heinz von Foerster and Ernst von Glasersfeld. From this point the author postulates

Adam Skibinski

391

Twistor-space recursive formulation of gauge-theory amplitudes  

SciTech Connect

Using twistor-space intuition, Cachazo, Svrcek and Witten presented novel diagrammatic rules for gauge-theory amplitudes, expressed in terms of maximally helicity-violating (MHV) vertices. We define non-MHV vertices, and show how to use them to give a recursive construction of these amplitudes. We also use them to illustrate the equivalence of various twistor-space prescriptions, and to determine the associated combinatoric factors.

Bena, Iosif; Bern, Zvi; Kosower, David A. [Department of Physics and Astronomy, UCLA, Los Angeles, California 90095-1547 (United States); Service de Physique, CEA-Saclay, F-91191 Gif-sur-Yvette cedex (France)

2005-02-15

392

Recursive Robot-Arm Dynamics via Filtering and Smoothing  

NASA Technical Reports Server (NTRS)

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

Rodriguez, Guillermo

1987-01-01

393

Introduction to Fractals: Infinity, Self-Similarity and Recursion  

NSDL National Science Digital Library

This lesson is designed to introduce students to fractals and the concepts needed to understand the properties of fractals. The lesson covers sequences, recursion, and the geometric properties of fractals. This lesson provides links to discussions and activities related to fractals as well as suggested ways to integrate them into the lesson. Finally, the lesson provides links to follow-up lessons designed for use in succession with the current one.

2011-05-24

394

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

SciTech Connect

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

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

2011-11-01

395

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

396

On-shell recursion for massive fermion currents  

NASA Astrophysics Data System (ADS)

We analyze the validity of BCFW recursion relations for currents of n - 2 gluons and two massive quarks, where one of the quarks is off shell and the remaining particles are on shell. These currents are gauge-dependent and can be used as ingredients in the unitarity-based approach to computing one-loop amplitudes. The validity of BCFW recursion relations is well known to depend on the so-called boundary behavior of the currents as the momentum shift parameter goes to infinity. With off-shell currents, a new potential problem arises, namely unphysical poles that depend on the choice of gauge. We identify conditions under which boundary terms are absent and unphysical poles are avoided, so that there is a natural recursion relation. In particular, we are able to choose a gauge in which we construct a valid shift for currents with at least n - 3 gluons of the same helicity. We derive an analytic formula in the case where all gluons have the same helicity. As by-products, we prove the vanishing boundary behavior of general off-shell objects in Feynman gauge, and we find a compact generalization of Berends-Giele gluon currents with a generic reference spinor.

Britto, Ruth; Ochirov, Alexander

2013-01-01

397

On-shell recursion for massive fermion currents  

E-print Network

We analyze the validity of BCFW recursion relations for currents of n - 2 gluons and two massive quarks, where one of the quarks is off shell and the remaining particles are on shell. These currents are gauge-dependent and can be used as ingredients in the unitarity-based approach to computing one-loop amplitudes. The validity of BCFW recursion relations is well known to depend on the so-called boundary behavior of the currents as the momentum shift parameter goes to infinity. With off-shell currents, a new potential problem arises, namely unphysical poles that depend on the choice of gauge. We identify conditions under which boundary terms are absent and unphysical poles are avoided, so that there is a natural recursion relation. In particular, we are able to choose a gauge in which we construct a valid shift for currents with at least n - 3 gluons of the same helicity. We derive an analytic formula in the case where all gluons have the same helicity. As by-products, we prove the vanishing boundary behavior of general off-shell objects in Feynman gauge, and we find a compact generalization of Berends-Giele gluon currents with a generic reference spinor.

Ruth Britto; Alexander Ochirov

2012-12-21

398

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

399

Using XML and Java for Astronomical Instrument Control  

NASA Astrophysics Data System (ADS)

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

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

1999-12-01

400

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

401

Recursion in multiplet bases for tree-level MHV gluon amplitudes  

E-print Network

We investigate the construction of tree-level MHV gluon amplitudes in multiplet bases using BCFW recursion. The multiplet basis decomposition can either be obtained by decomposing results derived in (for example) the DDM basis or by formulating the recursion directly in the multiplet basis. We focus on the latter approach and show how to efficiently deal with the color structure appearing in the recursion. For illustration, we also explicitly calculate the four-, five- and six-gluon amplitudes.

Du, Yi-Jian; Thorén, Johan

2015-01-01

402

The NITE XML Toolkit: flexible annotation for multimodal language data.  

PubMed

Multimodal corpora that show humans interacting via language are now relatively easy to collect. Current tools allow one either to apply sets of time-stamped codes to the data and consider their timing and sequencing or to describe some specific linguistic structure that is present in the data, built over the top of some form of transcription. To further our understanding of human communication, the research community needs code sets with both timings and structure, designed flexibly to address the research questions at hand. The NITE XML Toolkit offers library support that software developers can call upon when writing tools for such code sets and, thus, enables richer analyses than have previously been possible. It includes data handling, a query language containing both structural and temporal constructs, components that can be used to build graphical interfaces, sample programs that demonstrate how to use the libraries, a tool for running queries, and an experimental engine that builds interfaces on the basis of declarative specifications. PMID:14587542

Carletta, Jean; Evert, Stefan; Heid, Ulrich; Kilgour, Jonathan; Robertson, Judy; Voormann, Holger

2003-08-01

403

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

404

"!$#$%'&)(10325476'89(A@CB3BD!E#GFIHP(AQRQRBTS5BU%PVDBDH Abstract Recently more and more data is stored in XML format. While XML increases  

E-print Network

¢¡¤£¦¥¨§©¡ ¡ "!$#$%'&)(10325476'89(A@CB3BD!E#GFIHP(AQRQRBTS5BU%PVDBDH Abstract Recently more and more data is stored in XML format. While XML increases flexibility, it also raises new security challenges such as access control for mul- tilevel security. This paper considers the problem of generating

Farkas, Csilla

405

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

406

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

NASA Astrophysics Data System (ADS)

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

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

2011-12-01

407

Detecting Content Changes on Ordered XML Documents Using Relational Databases  

E-print Network

in the leaf element. An internal element is the element which does not contain textual data and is not a leaf in the internal elements (which are called as structural changes) modify the structure and do not change textual easy to learn and ... A A A Updated leaf node Deleted leaf node Inserted leaf node (a) Version 1 (b

Bhowmick, Sourav S.

408

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

409

A Data Locating Mechanism for Distributed XML Data over P2P Qiang Wang AND M. Tamer Ozsu  

E-print Network

expressions. We also propose a decentralized data locating algorithm that does not employ a centralized catalog but also avoids flooding the network with XML queries. We report comprehensive experiments are faced with new challenges when XML data are deployed over large-scale P2P networks, where centralized

Waterloo, University of

410

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

NASA Technical Reports Server (NTRS)

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

Lin, Risheng; Afjeh, Abdollah A.

2003-01-01

411

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

412

DataStaR: Bridging XML and OWL in Science Metadata Management  

NASA Astrophysics Data System (ADS)

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

Lowe, Brian

413

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

414

Recursive Method for Nekrasov partition function for classical Lie groups  

E-print Network

Nekrasov partition function for the supersymmetric gauge theories with general Lie groups is not so far known in a closed form while there is a definition in terms of the integral. In this paper, as an intermediate step to derive it, we give a recursion formula among partition functions, which can be derived from the integral. We apply the method to a toy model which reflects the basic structure of partition functions for BCD type Lie groups and obtained a closed expression for the factor associated with the generalized Young diagram.

Satoshi Nakamura; Futoshi Okazawa; Yutaka Matsuo

2014-11-27

415

Scattering of electromagnetic radiation by multilayered spheroidal particles: recursive procedure.  

PubMed

A formalism is developed for the calculation of the electromagnetic field scattered by a multilayered spheroidal particle. The suggested formalism utilizes the recursive approach with respect to passing from one layer to the next; thus it does not require an increase in the size of the equation matrices involved as the number of layers increases. The equations operate with matrices of the same size as for a homogeneous spheroid. The special cases of extremely prolate and weakly prolate spheroids are considered in more detail. It is shown that in such cases one can avoid the matrix calculations by instead using the iterative scalar calculations. PMID:18337916

Gurwich, I; Kleiman, M; Shiloah, N; Cohen, A

2000-01-20

416

Vision-based recursive estimation of rotorcraft obstacle locations  

NASA Technical Reports Server (NTRS)

The authors address vision-based passive ranging during nap-of-the-earth (NOE) rotorcraft flight. They consider the problem of estimating the relative location of identifiable features on nearby obstacles, assuming a sequence of noisy camera images and imperfect measurements of the camera's translation and rotation. An iterated extended Kalman filter is used to provide recursive range estimation. The correspondence problem is simplified by predicting and tracking each feature's image within the Kalman filter framework. Simulation results are presented which show convergent estimates and generally successful feature point tracking. Estimation performance degrades for features near the optical axis and for accelerating motions. Image tracking is also sensitive to angular rate.

Leblanc, D. J.; Mcclamroch, N. H.

1992-01-01

417

Design of a recursive vector processor using polynomial splines  

NASA Technical Reports Server (NTRS)

The problem of obtaining smoothed estimates of function values, particularly their derivatives, from a finite set of inaccurate measurements is considered. A recursive two-dimensional vector processor is introduced as an approximation to the nonrecursive constrained least-squares estimation. Here, piecewise bicubic Hermite polynomials are extensively used as approximating functions, and the smoothing integral is converted to a discrete quadratic form. This makes it possible to convert the problem of fitting an approximating function to one of estimating the function values and derivatives at the nodes.

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

1980-01-01

418

[Pharmacovigilance update].  

PubMed

The main pharmacovigilance updates in 2014 are reviewed. Ivabradine: increased risk of cardiovascular death and myocardial infarction in patients with symptomatic angina treated with high dosages. Clopidogrel: rare observations of acquired hemophilia. Orlistat: may reduce the absorption of HIV antiretrovirals. Ponatinib: increased risk of arteriopathy and thrombosis. Axitinib: significant risk of heart failure (class effect). Tocilizumab: possible causal relationship with the emergence or aggravation of psoriasis. Lithium: hypercalcemia and hyperparathyroidism commonly observed. Sildenalfil: suspected causal association with melanoma, so far not proven, Methylphenidate: rare observations of priapism. St John's wort (Hypericum): reduced effectiveness of hormonal contraceptives, including implants. PMID:25799668

Fogarasi Szabo, Nathalie; Diezi, Léonore; Delenclos, Laurie; Renard, Delphine; Chtioui, Haithem; Rothuizen, Laura E; Buclin, Thierry; Livio, Françoise

2015-01-14

419

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

420

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

421

Optimal Recursive Refinancing and the Valuation of Mortgage-Backed Securities  

Microsoft Academic Search

We study the optimal recursive refinancing problem where a borrower minimizes his lifetime mortgage costs by repeatedly refinancing when rates drop sufficiently. Key factors affecting the optimal decision are the cost of refinancing and the possibility that the mortgagor may have to refinance at a premium rate because of his credit. The optimal recursive strategy often results in prepayment being

Francis A. Longstaff; Lakhbir Hayre; Hedi Kallal; Stanley Kon; Eduardo Schwartz; Roberto Sella; Chester Spatt; Richard Stanton

2004-01-01

422

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

423

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

424

On the convergence scaling laws of Lanczos and Chebyshev recursion methods  

NASA Astrophysics Data System (ADS)

In this Note, we discuss the convergence scaling law of the filter-diagonalization method based on the Chebyshev recursion, as applied to molecular spectroscopic problems. Comparison with the scaling law observed earlier for the Lanczos algorithm indicates that the two recursive methods have very similar convergence behaviors.

Chen, Rongqing; Guo, Hua

2003-09-01

425

Recursive subspace identification for in-flight modal analy-sis of airplanes  

E-print Network

on the available observations. From the model, modal characteristics as resonance frequencies, damping ratiosRecursive subspace identification for in-flight modal analy- sis of airplanes Katrien De Cock1 In this paper recursive subspace identification algorithms are applied to track the modal parameters of air

426

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

E-print Network

Monotonous Trend Estimation using Recursive Prony Analysis Xilin Yang, Matt Garratt and Hemanshu of a slow-varying oscillating system. A recursive Prony Analysis (PA) scheme is developed which involves results in an accurate estimation of the trend of oscillating systems. Performance of the proposed PA

Pota, Himanshu Roy

427

A Recursive Variable Fractional Delay FIR Filters Design Scheme Using Particle Swarm Optimization Algorithm  

Microsoft Academic Search

A novel recursive scheme to compute the global and robust optimal variable fractional delay (VFD) filters based on the Particle Swarm Optimization (PSO) is developed in this paper. If the PSO is directly used to compute an optimal VFD filter the particles with high dimension might be yielded, which could require a long convergence time. Our recursive scheme invokes only

Dongyan Sun; Jiaxiang Zhao; Xiaoming Zhao

2009-01-01

428

The design of wide-band recursive and nonrecursive digital differentiators  

Microsoft Academic Search

Designs for recursive and nonrecursive wide-band differentiators are presented. The coefficients for the recursive differentiators were optimally chosen to minimize a square-error criterion based on the magnitude of the frequency response. The coefficients for the nonrecursive differentiators were chosen using a frequency sampling technique. One or more of the coefficients were optimally selected to minimize the peak absolute error between

LAWRENCE R. RABINER; KENNETH STEIGLITZ

1970-01-01

429

SPEECH NOISE ESTIMATION USING ENHANCED MINIMA CONTROLLED RECURSIVE Ningping Fan, Justinian Rosca, Radu Balan  

E-print Network

SPEECH NOISE ESTIMATION USING ENHANCED MINIMA CONTROLLED RECURSIVE AVERAGING Ningping Fan in speech enhancement. One state-of-the-art approach is the minima controlled recursive averaging (MCRA). This paper presents an enhanced MCRA algorithm (EMCRA), which demonstrates less speech signal leakage

Balan, Radu V.

430

On edge-weighted recursive trees and inversions in random permutations  

E-print Network

of epidemics [17], to aid in the construction of the family trees of preserved copies of ancient manuscriptsOn edge-weighted recursive trees and inversions in random permutations M. Kuba and A. Panholzer. Kuba March 14, 2007 Abstract We introduce random recursive trees, where deterministically weights

Panholzer, Alois

431

On edge-weighted recursive trees and inversions in random permutations.  

E-print Network

], to aid in the construction of the family trees of preserved copies of ancient manuscripts [17On edge-weighted recursive trees and inversions in random permutations. M. Kuba and A. Panholzer. Kuba May 30, 2006 Abstract We introduce random recursive trees, where deterministically weights

Kuba, Markus

432

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

Microsoft Academic Search

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

Rachid Deriche

1987-01-01

433

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

434

Tree-level Recursion Relation and Dual Superconformal Symmetry of the ABJM Theory  

E-print Network

We propose a recursion relation for tree-level scattering amplitudes in three-dimensional Chern-Simons-matter theories. The recursion relation involves a complex deformation of momenta which generalizes the BCFW-deformation used in higher dimensions. Using background field methods, we show that all tree-level superamplitudes of the ABJM theory vanish for large deformations, establishing the validity of the recursion formula. Furthermore, we use the recursion relation to compute six-point and eight-point component amplitudes and match them with independent computations based on Feynman diagrams or the Grassmannian integral formula. As an application of the recursion relation, we prove that all tree-level amplitudes of the ABJM theory have dual superconformal symmetry. Using generalized unitarity methods, we extend this symmetry to the cut-constructible parts of the loop amplitudes.

Dongmin Gang; Yu-tin Huang; Eunkyung Koh; Sangmin Lee; Arthur E. Lipstein

2011-04-12

435

Recursive feature selection with significant variables of support vectors.  

PubMed

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

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

2012-01-01

436

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

437

Optimal Recursive Digital Filters for Active Bending Stabilization  

NASA Technical Reports Server (NTRS)

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

Orr, Jeb S.

2013-01-01

438

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

439

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

440

Recursive subdivision of urban space and Zipf’s law  

NASA Astrophysics Data System (ADS)

Zipf’s law can be used to describe the rank-size distribution of cities in a region. It has seldom been employed to research urban internal structure. In this paper, we demonstrate that the space-filling process within a city follows Zipf’s law and can be characterized with the rank-size rule. A model of spatial disaggregation of urban space is presented to depict the spatial regularity of urban growth. By recursive subdivision of space, an urban region can be geometrically divided into two parts, four parts, eight parts, and so on, and form a hierarchy with cascade structure. If we rank these parts by size, the portions will conform to the Zipf distribution. By means of the GIS technique and remote sensing data, the model of recursive subdivision of urban space is applied to three cities in China. The results show that the intra-urban hierarchy complies with Zipf’s law, and the values of the rank-size scaling exponent are very close to 1. The significance of this study lies in three aspects. First, it shows that the strict subdivision of space is an efficient approach to revealing spatial order of urban form. Second, it discloses the relationships between the urban space-filling process and the rank-size rule. Third, it suggests a new way of understanding fractals, Zipf’s law, and spatial organization of urban evolution.

Chen, Yanguang; Wang, Jiejing

2014-02-01

441

[Pharmacovigilance update].  

PubMed

Main pharmacovigilance updates are reviewed. Rosiglitazone and sibutramine have been suspended due to cardiovascular risks. The safety profile of H1N1 vaccines is similar to the established profile of seasonal influenza vaccines. Paroxetine reduces the benefit of tamoxifen. The use of serotoninergic antidepressants in pregnancy is still disputed. The risk of venous thromboembolism could be higher with oral combined contraceptives containing drospirenone compared to those containing levonorgestrel. Prolonged QT and PR intervals have been observed with saquinavir. The correct use of transdermal patches is reviewed with the example of rivastigmine. Aseptic meningitis is a rare adverse reaction of lamotrigine. An increased risk of fractures after long term use of proton pump inhibitors is suspected. PMID:21309181

Livio, F; Biollaz, J; Buclin, T

2011-01-12

442

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.

443

Ctree: A Compact Tree for Indexing XML Data Qinghua Zou Shaorong Liu  

E-print Network

at the group level but also detailed child-parent links at the element level. Group level mapping allows efficient pruning of a large search space while element level mapping provides fast access to the parent of an element. Due to the tree nature of XML data and queries, such fast child-to-parent access is essential

California at Los Angeles, University of

444

HePToX: Marrying XML and Heterogeneity in Your P2P Databases  

E-print Network

depicts schemas of two distinct hospital peers. This example is adapted from [9]. For the moment, we-fledged peer-to- peer database system that efficiently handles XML data heterogeneity. In a highly dynamic P2P network, it is unrealistic for a peer enter- ing the network to be forced to agree on a global mediated

Pottinger, Rachel

445

How to Import an Existing XML Dictionary Into the Papillon Plateform  

E-print Network

How to Import an Existing XML Dictionary Into the Papillon Plateform Mathieu Mangeot@nii.ac.jp Abstract. The Papillon project aims at building a multilingual lexical database for extracting dictionaries. To avoid starting from scratch, we plan to recuperate existing dictionaries(marking explicitely all

Paris-Sud XI, Université de

446

An XML Markup Language Framework for Lexical Databases Environments: the Dictionary Markup Language.  

E-print Network

An XML Markup Language Framework for Lexical Databases Environments: the Dictionary Markup Language enough in order to accept a wide range of dictionary structures and proposes for manipulating heterogeneous dictionaries a set of common pointers into these structures. We will first present

Paris-Sud XI, Université de

447

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

448

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

449

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

450

Biometric template data protection in mobile device environment using XML-database  

Microsoft Academic Search

This paper proposes a non-traditional XML database which supports biometric templates and provides an API which can be used by independent applications in mobile device environments. Until recently biometric systems are becoming more and more visible in mobile phone devices including fingerprint recognition or gait recognition. To gain a real understanding of how it is possible to protect the biometric

R. Thirumathyam; M. O. Derawi

2010-01-01

451

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

452

Adaptive Processing of Top-k Queries in XML Amelie Marian  

E-print Network

Adaptive Processing of Top-k Queries in XML Am´elie Marian Columbia University amelie@research.att.com Divesh Srivastava AT&T Labs­Research divesh@research.att.com Abstract The ability to compute top-k. The efficiency of top-k query evaluation relies on using scores to prune irrelevant answers as early as possible

Marian, Amélie

453

A Hybrid Algorithm for Finding Top-k Twig Answers in Probabilistic XML  

E-print Network

A Hybrid Algorithm for Finding Top-k Twig Answers in Probabilistic XML Bo Ning1 and Chengfei Liu2 1 probabilistic values. In this paper, we address the problem of finding twig answers with top-k prob- abilistic the proposed algorithm can avoid lots of intermediate results, and find the top-k answers quickly. Experiments

Liu, Chengfei

454

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

455

INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Towards automatic XML structure building for Web  

E-print Network

building for Web documents Agnčs Guerraz N° RR6147 Février 2006 THČME SYM inria-00133649,version4-25Jun2007 #12;Towards automatic XML structure building for Web documents Agnčs Guerraz1 Thčme ­Symbolic systems Projet Wam Rapport de recherche n° 6147 ­ 28/02/07 17 pages Abstract: Web documents avalaible

Paris-Sud XI, Université de

456

Transformation Rules from Semi-structured XML Documents to Database Model  

Microsoft Academic Search

XML semi-structured documents provide a flexible and natural way to capture data. More often, users exchange documents with others or reuse their data in a wide range of tasks. A direct consequence is a growing need to manage semi-structured documents and to gain conventional database functionality. The aim of our research is the development of a comprehensive capturing and mapping

Youakim Badr; Frédérique Laforest; André Flory; M. Sayah

2001-01-01

457

żEs posible un estándar abierto tipo XML para las bases de datos de Patología?  

Microsoft Academic Search

RESUMEN XML es un nuevo estándar de almacenamiento semiestructurado en el que, a diferencia del HTML, se pueden definir etiquetas o marcas personales por medio de una DTD (las Definiciones de Tipo de Documento o Restricciones de Domino) o mediante el uso de Schema. En los últimos ańos ha proliferado su uso como formato eficaz de almacenamiento e intercambio de

Ernesto Moro-Rodríguez; Jesús Coma del Corral; Miguel Sánchez-Ramos

458

On Distributing XML Repositories Jan-Marco Bremer and Michael Gertz  

E-print Network

a fragmentation method and outline an allocation model for distributed XML frag- ments. We also discuss. In particular, we present a frag- mentation scheme on a global conceptual schema structure and outline how and remote frag- ments. The index structures allow for processing most global queries at local sites without

Gertz, Michael

459

Efficient Evaluation of Nearest Common Ancestor in XML Twig Queries Using Tree-Unaware RDBMS  

E-print Network

Efficient Evaluation of Nearest Common Ancestor in XML Twig Queries Using Tree-Unaware RDBMS pattern where all nodes have the same nearest common ancestor (the root of NCA-twiglet). We focus on NCA expression. Given a query twig pattern Q = (V, E), the nearest common ancestor (denoted as NCA) of two nodes

Bhowmick, Sourav S.

460

Efficient Evaluation of Nearest Common Ancestor in XML Twig Queries Using  

E-print Network

Efficient Evaluation of Nearest Common Ancestor in XML Twig Queries Using Tree-Unaware RDBMS-twiglet is a subtree in a twig pattern where all nodes have the same nearest common ancestor (the root of nca) path expression. Given a query twig pattern Q = (V, E), the nearest common ancestor (denoted as nca

Bhowmick, Sourav S.

461

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

462

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

463

Representing Probabilistic Information in XML Wenzhong Zhao, Alex Dekhtyar and Judy Goldsmith  

E-print Network

Representing Probabilistic Information in XML Wenzhong Zhao, Alex Dekhtyar and Judy Goldsmith in manag- ing probabilistic information. In 2001, Dekhtyar, Goldsmith and Hawkes [1] proposed a formal of probabilistic information. Unfortunately, these approaches are not suĂ?ciently #12; 2 W. Zhao, A. Dekhtyar and J

Goldsmith, Judy

464

An XML Schema Integration and Query Mechanism System Sanjay Madria1  

E-print Network

. In applications like comparison-shopping, there is a need for an illusionary centralized homogeneous information, Integration, query 1. Introduction The integration of heterogeneous data sources has become a central problem-commerce applications, XML documents can be used to publish any data ranging from product catalogs and airline schedules

Bhowmick, Sourav S.

465

Implementing Incremental Code Migration with XML Wolfgang Emmerich, Cecilia Mascolo \\Lambda and Anthony Finkelstein  

E-print Network

fW.Emmerich|C.Mascolo|A.Finkelsteing@cs.ucl.ac.uk ABSTRACT We demonstrate how XML and related], Telescript [19], Obliq [6] are non Java based mobile code languages and systems. Mo­ bile agents [31, 14 with new code fragments. In this paper we show how to achieve more fine­grained mo­ bility than

Mascolo, Cecilia

466

Building a Generic SOAP Framework over Binary XML , Kenneth Chiu2  

E-print Network

Building a Generic SOAP Framework over Binary XML Wei Lu1 , Kenneth Chiu2 , Dennis Gannon1 1 York (SUNY) at Binghamton Abstract The prevailing binding of SOAP to HTTP specifies that SOAP messages be slow and memory intensive, especially for scientific data, and consequently SOAP has been regarded

467

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"

468

Integrating Advanced GLSL Shading and XML Agents into a Learning-Oriented 3D Engine  

E-print Network

´azquez-Armend´ariz, Erik Mill´an Instituto Tecnol´ogico y de Estudios Superiores de Monterrey Campus Estado de M a myriad of functionalities, exposed over hundreds or even thousands of API calls. Other option´in and Mill´an in [16], which allows the creation of virtual characters and crowds using images and XML files

Keinan, Alon

469

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

Microsoft Academic Search

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

Xiaoshu Wang; Robert Gorlitsky; Jonas S Almeida

2005-01-01

470

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

E-print Network

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

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

2012-02-22

471

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

472

Process-Based Supply Chain Resources Descriptive Model and Knowledge Representation Based on XML  

Microsoft Academic Search

In order to realize the integration and sharing of the enterprise resources information in supply chain, and improve the synthesis competition of the whole supply chain. This paper analyzes the supply chain resources in terms of process, sets up the process-based supply chain resources descriptive model, and applies to XML to form a knowledge representation model. In the end, we

Xiangbin Zhang; Yali Duan; Changlin Hu; Jinming Wang

2007-01-01

473

RDF and XML: Towards a Unified Query Layer Nuno Lopes1  

E-print Network

Zaremba10 Abstract One of the requirements of current Semantic Web applications is to deal XML. The automatic communication between software agents or services requires transformations in both, Austria 3Fundaci´on CTIC (Centro Tecnol´ogico para el Desarrollo en Asturias de las Tecnolog´ias de la

Paris-Sud XI, Université de

474

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

ERIC Educational Resources Information Center

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

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

2005-01-01

475

XML-Based Computation for Scientific Workflows Daniel Zinn , Shawn Bowers , Bertram Ludscher  

E-print Network

XML-Based Computation for Scientific Workflows Daniel Zinn , Shawn Bowers , Bertram Ludäscher. of Computer Science Gonzaga University {dzinn,sbowers,ludaesch}@ucdavis.edu Abstract-- Scientific workflows, including the need to introduce low-level components to mediate and transform data (so-called shims

California at Davis, University of

476

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

477

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

478

Recursive Bayesian estimation of regularized and irregular quasar light curves  

NASA Astrophysics Data System (ADS)

We investigate the efficacy of recursive Bayesian estimation of regularized and irregular astrophysical time series using particle filters to understand latent dynamics. We begin by regularizing a MACHO (massive compact halo object) quasar light curve using linear interpolation techniques. This is subsequently modelled using a variety of autoregressive and autoregressive-integrated moving average models. We find that we can learn regularized astrophysical time series using particle filters. Motivated by this result, we proceed by working on raw, irregular light curves. Accurately modelling the underlying dynamics as a continuous autoregressive stochastic process, calibrated using an MCMC we find that the scale variable, ?, is in fact first-order stable across 55 MACHO quasar light curves and thus not correlated with the black hole mass. We show that particle filters can be used to learn regularized and irregular astrophysical light curves. These results can be used to inform classification systems of stellar type and further study variability characteristics of quasars.

Hanif, A.; Protopapas, P.

2015-03-01

479

Recursive solution to Wiener's multi-channel time filtering  

NASA Astrophysics Data System (ADS)

Statistical studies in planetary radio astronomy are usually based on superposed epoch or cross-correlation techniques, e.g. to investigate whether or not magnetospheric processes such as planetary radio emissions are triggered by the solar wind. However, Wiener's linear prediction theory (LPT) provides a further powerful procedure to determine the relationship between multiple time-varying quantities. Specifically, the multichannel LPT time filtering enables one to determine the simultaneous effect of several solar wind quantities on the planetary radio output from the solution of a matrix equation given in the form of a linear Toeplitz problem. In this paper, a recursive procedure is presented for the multichannel case that can save both computational time as well as computer storage.

Rabl, G. K. F.

1993-03-01

480

Recursive Estimation for the Tracking of Radioactive Sources  

SciTech Connect

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

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

1999-02-01

481

Recursive estimation for the tracking of radioactive sources  

SciTech Connect

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

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

1998-12-31

482

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

483

A recursive approach to the reduction of tensor Feynman integrals  

E-print Network

We describe a new, convenient, recursive tensor integral reduction scheme for one-loop $n$-point Feynman integrals. The reduction is based on the algebraic Davydychev-Tarasov formalism where the tensors are represented by scalars with shifted dimensions and indices, and then expressed by conventional scalars with generalized recurrence relations. The scheme is worked out explicitly for up to $n=6$ external legs and for tensor ranks $R\\leq n$. The tensors are represented by scalar one- to four-point functions in $d$ dimensions. For the evaluation of them, the Fortran code for the tensor reductions has to be linked with a package like QCDloop or LoopTools/FF. Typical numerical results are presented.

Diakonidis, Theodoros; Riemann, Tord; Tausk, Bas

2010-01-01

484

A recursive approach to the reduction of tensor Feynman integrals  

E-print Network

We describe a new, convenient, recursive tensor integral reduction scheme for one-loop $n$-point Feynman integrals. The reduction is based on the algebraic Davydychev-Tarasov formalism where the tensors are represented by scalars with shifted dimensions and indices, and then expressed by conventional scalars with generalized recurrence relations. The scheme is worked out explicitly for up to $n=6$ external legs and for tensor ranks $R\\leq n$. The tensors are represented by scalar one- to four-point functions in $d$ dimensions. For the evaluation of them, the Fortran code for the tensor reductions has to be linked with a package like QCDloop or LoopTools/FF. Typical numerical results are presented.

Theodoros Diakonidis; Jochem Fleischer; Tord Riemann; Bas Tausk

2010-02-02

485

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

486

Recursive least square vehicle mass estimation based on acceleration partition  

NASA Astrophysics Data System (ADS)

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

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

2014-05-01

487

Efficient design of two-dimensional recursive digital filters. Final report  

SciTech Connect

This report outlines the research progress during the period August 1978 to July 1979. This work can be divided into seven basic project areas. Project 1 deals with a comparative study of 2-D recursive and nonrecursive digital filters. The second project addresses a new design technique for 2-D half-plane recursive filters, and Projects 3 thru 5 deal with implementation issues. The sixth project presents our recent study of the applicability of array processors to 2-D digital signal processing. The final project involves our investigation into techniques for incorporating symmetry constraints on 2-D recursive filters in order to yield more efficient implementations.

Twogood, R.E.; Mitra, S.K.

1980-01-01

488

Declarative updates of relational databases  

SciTech Connect

This article presents a declarative language, update calculus, of relational database updates. A formula in update calculus involves conditions for the current database, as well as assertions about a new database. Logical connectives and quantifiers become constructors of complex updates, offering flexible specification of database transformations. Update calculus can express all nondeterministic database transformations that are polynomial time. For set-at-a-time evaluation of updates, we present a corresponding updates algebra. Existing techniques of query processing can be incorporated into update evaluation. We show that updates in update calculus can be translated into expressions in update algebra and vice versa. 29 refs.

Chen, Weidong

1995-03-01

489

The Design and Implementation of XML Semi-structured Data Extraction and Loading into the Data Warehouse  

Microsoft Academic Search

By analyzing the characteristics of Semi-structured data along with the actual Book Return Data (BokeDataInfo.xml) in the Auto department chain sales as an example, DOM objects extract, transform and load into the data tables of current level of detail of the Data Warehouse. The paper based XML Semi-structured data has designed and implemented a Data Warehouse ETL tool which based

Yue Guohua; Wang Jingting

2010-01-01

490

XML (eXtensible Mark-up Language) Industrial Standard, Determining Architecture of the Next Generation of the Internet Software  

E-print Network

The past 1999 became the period of standing of the new Internet technology - XML (eXtensible Mark-up Language), the language of sectoring established by a Consortium WWW (http://www.w3.org) as a new industrial standard, determining architecture of the next generation Internet software. In this message the results of a research of this technology, basic opportunities XML, rules and recommendations for its application are given.

Galaktionov, V V

2000-01-01

491

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

NASA Technical Reports Server (NTRS)

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

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

1994-01-01

492

A review of "Recursive Origins: Writing at the Transition to Modernity" by William Kuskin  

E-print Network

by thomas p. anderson, mississippi state university. Recursive Origins is an innovative account of literary influence between fifteenth-century English literature and Renaissance texts generally perceived to share a literary inheritance with classical...

Anderson, Thomas P.

2014-01-01

493

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

494

An alternative to the Baum-Welch recursions for hidden Markov models  

E-print Network

We develop a recursion for hidden Markov model of any order h, which allows us to obtain the posterior distribution of the latent state at every occasion, given the previous h states and the observed data. With respect to the well-known Baum-Welch recursions, the proposed recursion has the advantage of being more direct to use and, in particular, of not requiring dummy renormalizations to avoid numerical problems. We also show how this recursion may be expressed in matrix notation, so as to allow for an efficient implementation, and how it may be used to obtain the manifest distribution of the observed data and for parameter estimation within the Expectation-Maximization algorithm. The approach is illustrated by an application to financial data which is focused on the study of the dynamics of the volatility level of log-returns.

Bartolucci, Francesco

2012-01-01

495

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

496

Design of recursive convolutional space-time codes with an arbitrary number of transmit antennas  

Microsoft Academic Search

A new class of recursive convolutional space-time codes (ReC-STC) with an arbitrary number of transmit antennas is designed by adopting several parallel two-state recursive systematic convolutional codes (RSCs). An intercross linear mapping rule that distributes the output bits of a RSC to the different positions of different transmitted signals is also described. The proposed ReC-STC can not only increase the

Ying Li; Xudong Guo; Xinmei Wang

2005-01-01

497

Real-time multibody system dynamic simulation. I - A modified recursive formulation and topological analysis  

SciTech Connect

A modified recursive dynamics formulation and a topological analysis method for the formulation are presented in order to achieve the goal of real-time simulation of multibody mechanical systems. A parallel computational algorithm that exploits inherent parallelism in the modified recursive formulation and numerical results is considered. An efficient general-purpose dynamic simulation method is developed for real-time simulation of shared memory parallel processors. 21 refs.

Tsai, Fuh-Feng; Haug, E.J. (Iowa University, Iowa City (United States))

1991-03-01

498

Two-dimensional Yang-Mills Theory on Recursive Infinite Genus Surfaces  

E-print Network

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.

Dushyant Kumar

2014-07-23

499

Fuzzy-adapted recursive sliding-mode controller design for a nuclear power plant control  

Microsoft Academic Search

In this paper, a multi-input multi-output fuzzy-adapted recursive sliding-mode controller (FARSMC) is designed for an advanced boiling water reactor (ABWR) nuclear power plant, to control reactor pressure, reactor water level and turbine power. The FARSMC is intended to replace the existing conventional controllers for the power range of 70% to 100% rated power. The controller has a recursive form that

Zhengyu Huang; Robert M. Edwards; Kwang Y. Lee

2004-01-01

500

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