Science.gov

Sample records for aggregate query quantities

  1. Sugeno Fuzzy Integral as a Basis for the Interpretation of Flexible Queries Involving Monotonic Aggregates.

    ERIC Educational Resources Information Center

    Bosc, P.; Lietard, L.; Pivert, O.

    2003-01-01

    Considers flexible querying of relational databases. Highlights include SQL languages and basic aggregate operators; Sugeno's fuzzy integral; evaluation examples; and how and under what conditions other aggregate functions could be applied to fuzzy sets in a flexible query. (Author/LRW)

  2. Scenario aggregation for supply chain quantity-flexibility contract

    NASA Astrophysics Data System (ADS)

    Kim, Gitae; Wu, Chih-Hang

    2013-11-01

    In this research, we apply a scenario aggregation approach to solving the supply chain contract model formulated by two-stage stochastic programming problem. The supply chain contract can achieve the coordination between the buyer and the supplier. We formulate the stochastic programming model for a quantity-flexibility contract. The scenario aggregation method called the progressive hedging method is used to solve this problem. Experimental results show the convergence behaviour of the algorithm and the sensitivity of parameters.

  3. Aggregating land use quantity and intensity to link water quality in upper catchment of Miyun Reservoir

    NASA Astrophysics Data System (ADS)

    Xu, E.

    2015-12-01

    Land use is closely related to hydrological and biochemical processes influencing the water quality. Quantifying relationship between both of them can help effectively manage land use to improve water quality. Previous studies majorly utilized land use quantity as an indicator to link water quality parameters, which lacked an insight to the influence of land use intensity. Taking upper catchment of Miyun Reservoir as a case study, we proposed a method of aggregating land use quantity and intensity to build a new land use indicator and investigated its explanation empower on water quality. Six nutrient concentrations from 52 sub-watersheds covering the whole catchment were used to characterize spatial distributions of water eutrophication. Based on spatial techniques and empirical conversion coefficients, combined remote sensing with socio-economic statistical data, land use intensity was measured and mapped visually. Then the new land use indicator was calculated and linked to nutrient concentrations by Pearson correlation coefficients. Results demonstrated that our new land use indicator incorporating intensity information can quantify the potential different nutrients exporting abilities from land uses. Comparing to traditional indicators only characterized by land use quantity, most Pearson correlation coefficients between new indicator and water nutrient concentrations increased. New information enhanced the explanatory power of land use on water nutrient concentrations. Then it can help better understand the impact of land use on water quality and guide land use management for supporting decision making.

  4. Optical properties of the semi-external mixture composed of sulfate particle and different quantities of soot aggregates

    NASA Astrophysics Data System (ADS)

    Wu, Yu; Cheng, Tianhai; Zheng, Lijuan; Chen, Hao

    2016-08-01

    The effects of soot aggregate quantities on the optical properties of their semi-external mixture with sulfate host particle were investigated. In this study, the individual soot-containing mixtures were simulated as sulfate host point-contact attached to a specified amount of soot aggregates with the same monomer numbers and fractal parameters. The total numbers and volumes of soot monomers were also constant. Optical properties of this type of aerosol mixture were calculated using the numerically exact superposition T-matrix method (STM). The random-orientation averaging results indicated that the optical properties of the soot-containing mixtures may be influenced by the soot aggregate quantities. In these simulations, the absorption Ångström exponent (AÅE) values ranged from 0.9 to 1.1, which agree with the observations. The relative deviations of scattering Ångström exponent (SÅE) values between different numbers of soot aggregates attached to the surface of a sulfate host were upwards of ~11%. The results showed that the greater number of attached soot aggregates may lead to smaller SÅE values in the soot-containing mixtures. For most cases of simulated mixtures, a more compact morphology of soot aggregates, larger soot monomer radii and smaller soot volume fractions (Fsoot) may also generate smaller SÅE values. Moreover, in the visible range, the simulated scattering cross sections of soot-containing mixtures with two, three, four, and six soot aggregates (Df=1.8) were ~5%, ~10%, ~15%, and ~30% larger than those with only one soot aggregate, respectively, on the condition that volumes of soot and sulfate are comparable. However, these relative deviations between different numbers of attached soot aggregates on the scattering cross sections of mixtures may be weakened for larger volume of non-absorbing sulfate particle (<5% for the cases of Fsoot=1/10, sulfate volume is 9 times of soot).

  5. From Objects to Quantities: Developments in Preschool Children's Judgments about Aggregate Amount.

    ERIC Educational Resources Information Center

    Sophian, Catherine

    2000-01-01

    Examined the impact of object boundaries on 3-, 4-, and 5-year-olds' quantitative reasoning. Asked subjects to choose between alternative collections that differed in number and size of cookies and in aggregate amount. Found that children were influenced by size of individual cookies at 3 years but were generally unsuccessful in aggregating size…

  6. Federated Aggregate Cohort Estimator (FACE): an easy to deploy, vendor neutral, multi-institutional cohort query architecture.

    PubMed

    Wyatt, Matthew C; Hendrickson, R Curtis; Ames, Michael; Bondy, Jessica; Ranauro, Paul; English, Thomas M; Bobitt, Keith; Davidson, Arthur; Houston, Thomas K; Embi, Peter J; Berner, Eta S

    2014-12-01

    Cross-institutional data sharing for cohort discovery is critical to enabling future research. While particularly useful in rare diseases, the ability to target enrollment and to determine if an institution has a sufficient number of patients is valuable in all research, particularly in the initiation of projects and collaborations. An optimal technology solution would work with any source database with minimal resource investment for deployment and would meet all necessary security and confidentiality requirements of participating organizations. We describe a platform-neutral reference implementation to meet these requirements: the Federated Aggregate Cohort Estimator (FACE). FACE was developed and implemented through a collaboration of The University of Alabama at Birmingham (UAB), The Ohio State University (OSU), the University of Massachusetts Medical School (UMMS), and the Denver Health and Hospital Authority (DHHA) a clinical affiliate of the Colorado Clinical and Translational Sciences Institute. The reference implementation of FACE federated diverse SQL data sources and an i2b2 instance to estimate combined research subject availability from three institutions. It used easily-deployed virtual machines and addressed privacy and security concerns for data sharing. PMID:24316052

  7. Federated Aggregate Cohort Estimator (FACE): An easy to deploy, vendor neutral, multi-institutional cohort query architecture

    PubMed Central

    Wyatt, Matthew C.; Hendrickson, R. Curtis; Ames, Michael; Bondy, Jessica; Ranauro, Paul; English, Thomas M.; Bobitt, Keith; Davidson, Arthur; Houston, Thomas K.; Embi, Peter J.; Berner, Eta S.

    2014-01-01

    Cross-institutional data sharing for cohort discovery is critical to enabling future research. While particularly useful in rare diseases, the ability to target enrollment and to determine if an institution has a sufficient number of patients is valuable in all research, particularly in the initiation of projects and collaborations. An optimal technology solution would work with any source database with minimal resource investment for deployment and would meet all necessary security and confidentiality requirements of participating organizations. We describe a platform-neutral reference implementation to meet these requirements: the Federated Aggregate Cohort Estimator (FACE). FACE was developed and implemented through a collaboration of The University of Alabama at Birmingham (UAB), The Ohio State University (OSU), the University of Massachusetts Medical School (UMMS), and the Denver Health and Hospital Authority (DHHA) a clinical affiliate of the Colorado Clinical and Translational Sciences Institute. The reference implementation of FACE federated diverse SQL data sources and an i2b2 instance to estimate combined research subject availability from three institutions. It used easily-deployed virtual machines and addressed privacy and security concerns for data sharing. PMID:24316052

  8. VISAGE: A Query Interface for Clinical Research.

    PubMed

    Zhang, Guo-Qiang; Siegler, Trish; Saxman, Paul; Sandberg, Neil; Mueller, Remo; Johnson, Nathan; Hunscher, Dale; Arabandi, Sivaram

    2010-01-01

    We present the design and implementation of VISAGE (VISual AGgregator and Explorer), a query interface for clinical research. We follow a user-centered development approach and incorporate visual, ontological, searchable and explorative features in three interrelated components: Query Builder, Query Manager and Query Explorer. The Query Explorer provides novel on-line data mining capabilities for purposes such as hypothesis generation or cohort identification. The VISAGE query interface has been implemented as a significant component of Physio-MIMI, an NCRR-funded, multi-CTSA-site pilot project. Preliminary evaluation results show that VISAGE is more efficient for query construction than the i2b2 web-client. PMID:21347154

  9. Querying Proofs

    NASA Technical Reports Server (NTRS)

    Aspinall, David; Denney, Ewen; Lueth, Christoph

    2012-01-01

    We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hierarchical nested labelled trees. The core language presented in this paper is locally structured (first-order), with queries built using recursion and patterns over proof structure and rule names. We define the syntax and semantics of locally structured queries, demonstrate their power, and sketch some implementation experiments.

  10. Distributed Queries of Large Numerical Data Sets

    NASA Technical Reports Server (NTRS)

    Nemes, Richard M.

    1998-01-01

    We have extended a previously developed high-level data model, which combines numerical quantities and meta-data into a unified hybrid model, to distributed data. An elegant query language based on SQL is extended further to allow queries against such a distributed hybrid data base. The extension is realized by allowing statements in a non-SQL programming language to be embedded in SQL view definitions.

  11. Learning Semantic Query Suggestions

    NASA Astrophysics Data System (ADS)

    Meij, Edgar; Bron, Marc; Hollink, Laura; Huurnink, Bouke; de Rijke, Maarten

    An important application of semantic web technology is recognizing human-defined concepts in text. Query transformation is a strategy often used in search engines to derive queries that are able to return more useful search results than the original query and most popular search engines provide facilities that let users complete, specify, or reformulate their queries. We study the problem of semantic query suggestion, a special type of query transformation based on identifying semantic concepts contained in user queries. We use a feature-based approach in conjunction with supervised machine learning, augmenting term-based features with search history-based and concept-specific features. We apply our method to the task of linking queries from real-world query logs (the transaction logs of the Netherlands Institute for Sound and Vision) to the DBpedia knowledge base. We evaluate the utility of different machine learning algorithms, features, and feature types in identifying semantic concepts using a manually developed test bed and show significant improvements over an already high baseline. The resources developed for this paper, i.e., queries, human assessments, and extracted features, are available for download.

  12. Grazing cessation changes quantity, quality and distribution of soil organic matter and (micro-)aggregates in a semiarid steppe ecosystem in Inner Mongolia

    NASA Astrophysics Data System (ADS)

    Steffens, M.; Wiesmeier, M.; Koelbl, A.; Kogel-Knabner, I.

    2012-12-01

    Grazing is one of the most important factors that may reduce soil organic carbon (SOC) stocks and subsequently deteriorate aggregate stability in grassland soils. Improvements to land use management, e.g. grazing reduction, are assumed to increase the carbon sequestration of steppe ecosystems which may act as one of the big global carbon sinks. The central aims of this study were to investigate the effects of grazing on semiarid steppe ecosystems and to evaluate the benefits and potentials of grazing management to mitigate the detrimental effects of grazing. Special emphasize was placed on changes in the amount, composition and turnover of soil organic matter (SOM) and its effects on soil structure and aggregation. We sampled 5 differently grazed plots (ungrazed since 1979 = Ug79, ungrazed since 1999 = Ug99, winter grazing = Wg, continuously grazed = Cg, heavily grazed = Hg) and a 7-year grazing experiment with regular orthogonal grids and representative soil pits in a semiarid steppe ecosystem in Inner Mongolia, China. Topsoil and vegetation samples from grids were analysed statistically and geostatistically. Differently sized grids allowed the exploration of scale effects. Pit samples were taken from three horizons and were analysed for aggregate stability and physically fractionated according to aggregate size, density and particle size. Statistical analyses showed that physical and chemical parameters of bulked steppe topsoils deteriorated significantly following heavy grazing, remained stable if grazing was reduced or excluded for five years and recovered significantly after 25 years of grazing exclusion. Spatial heterogeneity of topsoil properties increased with decreasing grazing intensity from a homogeneous to a patchy distribution. This is attributed to vegetation recovery/succession and deposition of windblown material in ungrazed areas. On the large scale (>50 m) spatial variability of topsoil and vegetation was controlled by topography or soil erosion

  13. Declarative Visualization Queries

    NASA Astrophysics Data System (ADS)

    Pinheiro da Silva, P.; Del Rio, N.; Leptoukh, G. G.

    2011-12-01

    In an ideal interaction with machines, scientists may prefer to write declarative queries saying "what" they want from a machine than to write code stating "how" the machine is going to address the user request. For example, in relational database, users have long relied on specifying queries using Structured Query Language (SQL), a declarative language to request data results from a database management system. In the context of visualizations, we see that users are still writing code based on complex visualization toolkit APIs. With the goal of improving the scientists' experience of using visualization technology, we have applied this query-answering pattern to a visualization setting, where scientists specify what visualizations they want generated using a declarative SQL-like notation. A knowledge enhanced management system ingests the query and knows the following: (1) know how to translate the query into visualization pipelines; and (2) how to execute the visualization pipelines to generate the requested visualization. We define visualization queries as declarative requests for visualizations specified in an SQL like language. Visualization queries specify what category of visualization to generate (e.g., volumes, contours, surfaces) as well as associated display attributes (e.g., color and opacity), without any regards for implementation, thus allowing scientists to remain partially unaware of a wide range of visualization toolkit (e.g., Generic Mapping Tools and Visualization Toolkit) specific implementation details. Implementation details are only a concern for our knowledge-based visualization management system, which uses both the information specified in the query and knowledge about visualization toolkit functions to construct visualization pipelines. Knowledge about the use of visualization toolkits includes what data formats the toolkit operates on, what formats they output, and what views they can generate. Visualization knowledge, which is not

  14. Querying Safety Cases

    NASA Technical Reports Server (NTRS)

    Denney, Ewen W.; Naylor, Dwight; Pai, Ganesh

    2014-01-01

    Querying a safety case to show how the various stakeholders' concerns about system safety are addressed has been put forth as one of the benefits of argument-based assurance (in a recent study by the Health Foundation, UK, which reviewed the use of safety cases in safety-critical industries). However, neither the literature nor current practice offer much guidance on querying mechanisms appropriate for, or available within, a safety case paradigm. This paper presents a preliminary approach that uses a formal basis for querying safety cases, specifically Goal Structuring Notation (GSN) argument structures. Our approach semantically enriches GSN arguments with domain-specific metadata that the query language leverages, along with its inherent structure, to produce views. We have implemented the approach in our toolset AdvoCATE, and illustrate it by application to a fragment of the safety argument for an Unmanned Aircraft System (UAS) being developed at NASA Ames. We also discuss the potential practical utility of our query mechanism within the context of the existing framework for UAS safety assurance.

  15. Code query by example

    NASA Astrophysics Data System (ADS)

    Vaucouleur, Sebastien

    2011-02-01

    We introduce code query by example for customisation of evolvable software products in general and of enterprise resource planning systems (ERPs) in particular. The concept is based on an initial empirical study on practices around ERP systems. We motivate our design choices based on those empirical results, and we show how the proposed solution helps with respect to the infamous upgrade problem: the conflict between the need for customisation and the need for upgrade of ERP systems. We further show how code query by example can be used as a form of lightweight static analysis, to detect automatically potential defects in large software products. Code query by example as a form of lightweight static analysis is particularly interesting in the context of ERP systems: it is often the case that programmers working in this field are not computer science specialists but more of domain experts. Hence, they require a simple language to express custom rules.

  16. Retrieval with gene queries

    PubMed Central

    Sehgal, Aditya K; Srinivasan, Padmini

    2006-01-01

    Background Accuracy of document retrieval from MEDLINE for gene queries is crucially important for many applications in bioinformatics. We explore five information retrieval-based methods to rank documents retrieved by PubMed gene queries for the human genome. The aim is to rank relevant documents higher in the retrieved list. We address the special challenges faced due to ambiguity in gene nomenclature: gene terms that refer to multiple genes, gene terms that are also English words, and gene terms that have other biological meanings. Results Our two baseline ranking strategies are quite similar in performance. Two of our three LocusLink-based strategies offer significant improvements. These methods work very well even when there is ambiguity in the gene terms. Our best ranking strategy offers significant improvements on three different kinds of ambiguities over our two baseline strategies (improvements range from 15.9% to 17.7% and 11.7% to 13.3% depending on the baseline). For most genes the best ranking query is one that is built from the LocusLink (now Entrez Gene) summary and product information along with the gene names and aliases. For others, the gene names and aliases suffice. We also present an approach that successfully predicts, for a given gene, which of these two ranking queries is more appropriate. Conclusion We explore the effect of different post-retrieval strategies on the ranking of documents returned by PubMed for human gene queries. We have successfully applied some of these strategies to improve the ranking of relevant documents in the retrieved sets. This holds true even when various kinds of ambiguity are encountered. We feel that it would be very useful to apply strategies like ours on PubMed search results as these are not ordered by relevance in any way. This is especially so for queries that retrieve a large number of documents. PMID:16630348

  17. A Fuzzy Query Mechanism for Human Resource Websites

    NASA Astrophysics Data System (ADS)

    Lai, Lien-Fu; Wu, Chao-Chin; Huang, Liang-Tsung; Kuo, Jung-Chih

    Users' preferences often contain imprecision and uncertainty that are difficult for traditional human resource websites to deal with. In this paper, we apply the fuzzy logic theory to develop a fuzzy query mechanism for human resource websites. First, a storing mechanism is proposed to store fuzzy data into conventional database management systems without modifying DBMS models. Second, a fuzzy query language is proposed for users to make fuzzy queries on fuzzy databases. User's fuzzy requirement can be expressed by a fuzzy query which consists of a set of fuzzy conditions. Third, each fuzzy condition associates with a fuzzy importance to differentiate between fuzzy conditions according to their degrees of importance. Fourth, the fuzzy weighted average is utilized to aggregate all fuzzy conditions based on their degrees of importance and degrees of matching. Through the mutual compensation of all fuzzy conditions, the ordering of query results can be obtained according to user's preference.

  18. A query integrator and manager for the query web.

    PubMed

    Brinkley, James F; Detwiler, Landon T

    2012-10-01

    We introduce two concepts: the Query Web as a layer of interconnected queries over the document web and the semantic web, and a Query Web Integrator and Manager (QI) that enables the Query Web to evolve. QI permits users to write, save and reuse queries over any web accessible source, including other queries saved in other installations of QI. The saved queries may be in any language (e.g. SPARQL, XQuery); the only condition for interconnection is that the queries return their results in some form of XML. This condition allows queries to chain off each other, and to be written in whatever language is appropriate for the task. We illustrate the potential use of QI for several biomedical use cases, including ontology view generation using a combination of graph-based and logical approaches, value set generation for clinical data management, image annotation using terminology obtained from an ontology web service, ontology-driven brain imaging data integration, small-scale clinical data integration, and wider-scale clinical data integration. Such use cases illustrate the current range of applications of QI and lead us to speculate about the potential evolution from smaller groups of interconnected queries into a larger query network that layers over the document and semantic web. The resulting Query Web could greatly aid researchers and others who now have to manually navigate through multiple information sources in order to answer specific questions. PMID:22531831

  19. A Query Integrator and Manager for the Query Web

    PubMed Central

    Brinkley, James F.; Detwiler, Landon T.

    2012-01-01

    We introduce two concepts: the Query Web as a layer of interconnected queries over the document web and the semantic web, and a Query Web Integrator and Manager (QI) that enables the Query Web to evolve. QI permits users to write, save and reuse queries over any web accessible source, including other queries saved in other installations of QI. The saved queries may be in any language (e.g. SPARQL, XQuery); the only condition for interconnection is that the queries return their results in some form of XML. This condition allows queries to chain off each other, and to be written in whatever language is appropriate for the task. We illustrate the potential use of QI for several biomedical use cases, including ontology view generation using a combination of graph-based and logical approaches, value set generation for clinical data management, image annotation using terminology obtained from an ontology web service, ontology-driven brain imaging data integration, small-scale clinical data integration, and wider-scale clinical data integration. Such use cases illustrate the current range of applications of QI and lead us to speculate about the potential evolution from smaller groups of interconnected queries into a larger query network that layers over the document and semantic web. The resulting Query Web could greatly aid researchers and others who now have to manually navigate through multiple information sources in order to answer specific questions. PMID:22531831

  20. Construction aggregates

    USGS Publications Warehouse

    Nelson, T.I.; Bolen, W.P.

    2007-01-01

    Construction aggregates, primarily stone, sand and gravel, are recovered from widespread naturally occurring mineral deposits and processed for use primarily in the construction industry. They are mined, crushed, sorted by size and sold loose or combined with portland cement or asphaltic cement to make concrete products to build roads, houses, buildings, and other structures. Much smaller quantities are used in agriculture, cement manufacture, chemical and metallurgical processes, glass production and many other products.

  1. Querying and Ranking XML Documents.

    ERIC Educational Resources Information Center

    Schlieder, Torsten; Meuss, Holger

    2002-01-01

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

  2. A Semantic Graph Query Language

    SciTech Connect

    Kaplan, I L

    2006-10-16

    Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

  3. Query Evaluation: Strategies and Optimizations.

    ERIC Educational Resources Information Center

    Turtle, Howard; Flood, James

    1995-01-01

    Discusses two query evaluation strategies used in large text retrieval systems: (1) term-at-a-time; and (2) document-at-a-time. Describes optimization techniques that can reduce query evaluation costs. Presents simulation results that compare the performance of these optimization techniques when applied to natural language query evaluation. (JMV)

  4. Querying genomic databases

    SciTech Connect

    Baehr, A.; Hagstrom, R.; Joerg, D.; Overbeek, R.

    1991-09-01

    A natural-language interface has been developed that retrieves genomic information by using a simple subset of English. The interface spares the biologist from the task of learning database-specific query languages and computer programming. Currently, the interface deals with the E. coli genome. It can, however, be readily extended and shows promise as a means of easy access to other sequenced genomic databases as well.

  5. Robust Quantum Private Queries

    NASA Astrophysics Data System (ADS)

    Wang, Tian-Yin; Wang, Shu-Yu; Ma, Jian-Feng

    2016-02-01

    We propose a new quantum private query protocol with the technique of decoherence-free states, which is a theoretical study of how decoherence-free states can be used for the protection of quantum information in such a protocol. This protocol can solve the noise problem that will make the user obtain a wrong answer and hence give rise to a bad influence on the reputation of the database provider. Furthermore, this protocol is also flexible, loss-resistant and easily generalized to a large database similar to the previous works.

  6. Queries for Bias Testing

    NASA Technical Reports Server (NTRS)

    Gordon, Diana F.

    1992-01-01

    Selecting a good bias prior to concept learning can be difficult. Therefore, dynamic bias adjustment is becoming increasingly popular. Current dynamic bias adjustment systems, however, are limited in their ability to identify erroneous assumptions about the relationship between the bias and the target concept. Without proper diagnosis, it is difficult to identify and then remedy faulty assumptions. We have developed an approach that makes these assumptions explicit, actively tests them with queries to an oracle, and adjusts the bias based on the test results.

  7. Robust Quantum Private Queries

    NASA Astrophysics Data System (ADS)

    Wang, Tian-Yin; Wang, Shu-Yu; Ma, Jian-Feng

    2016-07-01

    We propose a new quantum private query protocol with the technique of decoherence-free states, which is a theoretical study of how decoherence-free states can be used for the protection of quantum information in such a protocol. This protocol can solve the noise problem that will make the user obtain a wrong answer and hence give rise to a bad influence on the reputation of the database provider. Furthermore, this protocol is also flexible, loss-resistant and easily generalized to a large database similar to the previous works.

  8. Smart Query Answering for Marine Sensor Data

    PubMed Central

    Shahriar, Md. Sumon; de Souza, Paulo; Timms, Greg

    2011-01-01

    We review existing query answering systems for sensor data. We then propose an extended query answering approach termed smart query, specifically for marine sensor data. The smart query answering system integrates pattern queries and continuous queries. The proposed smart query system considers both streaming data and historical data from marine sensor networks. The smart query also uses query relaxation technique and semantics from domain knowledge as a recommender system. The proposed smart query benefits in building data and information systems for marine sensor networks. PMID:22163772

  9. The CMS DBS query language

    NASA Astrophysics Data System (ADS)

    Kuznetsov, Valentin; Riley, Daniel; Afaq, Anzar; Sekhri, Vijay; Guo, Yuyi; Lueking, Lee

    2010-04-01

    The CMS experiment has implemented a flexible and powerful system enabling users to find data within the CMS physics data catalog. The Dataset Bookkeeping Service (DBS) comprises a database and the services used to store and access metadata related to CMS physics data. To this, we have added a generalized query system in addition to the existing web and programmatic interfaces to the DBS. This query system is based on a query language that hides the complexity of the underlying database structure by discovering the join conditions between database tables. This provides a way of querying the system that is simple and straightforward for CMS data managers and physicists to use without requiring knowledge of the database tables or keys. The DBS Query Language uses the ANTLR tool to build the input query parser and tokenizer, followed by a query builder that uses a graph representation of the DBS schema to construct the SQL query sent to underlying database. We will describe the design of the query system, provide details of the language components and overview of how this component fits into the overall data discovery system architecture.

  10. Query Expansion and Query Translation as Logical Inference.

    ERIC Educational Resources Information Center

    Nie, Jian-Yun

    2003-01-01

    Examines query expansion during query translation in cross language information retrieval and develops a general framework for inferential information retrieval in two particular contexts: using fuzzy logic and probability theory. Obtains evaluation formulas that are shown to strongly correspond to those used in other information retrieval models.…

  11. Querying Proofs (Work in Progress)

    NASA Technical Reports Server (NTRS)

    Aspinall, David; Denney, Ewen; Lueth, Christoph

    2011-01-01

    We motivate and introduce the basis for a query language designed for inspecting electronic representations of proofs. We argue that there is much to learn from large proofs beyond their validity, and that a dedicated query language can provide a principled way of implementing a family of useful operations.

  12. Relativistic quantum private database queries

    NASA Astrophysics Data System (ADS)

    Sun, Si-Jia; Yang, Yu-Guang; Zhang, Ming-Ou

    2015-04-01

    Recently, Jakobi et al. (Phys Rev A 83, 022301, 2011) suggested the first practical private database query protocol (J-protocol) based on the Scarani et al. (Phys Rev Lett 92, 057901, 2004) quantum key distribution protocol. Unfortunately, the J-protocol is just a cheat-sensitive private database query protocol. In this paper, we present an idealized relativistic quantum private database query protocol based on Minkowski causality and the properties of quantum information. Also, we prove that the protocol is secure in terms of the user security and the database security.

  13. Incremental Query Rewriting with Resolution

    NASA Astrophysics Data System (ADS)

    Riazanov, Alexandre; Aragão, Marcelo A. T.

    We address the problem of semantic querying of relational databases (RDB) modulo knowledge bases using very expressive knowledge representation formalisms, such as full first-order logic or its various fragments. We propose to use a resolution-based first-order logic (FOL) reasoner for computing schematic answers to deductive queries, with the subsequent translation of these schematic answers to SQL queries which are evaluated using a conventional relational DBMS. We call our method incremental query rewriting, because an original semantic query is rewritten into a (potentially infinite) series of SQL queries. In this chapter, we outline the main idea of our technique - using abstractions of databases and constrained clauses for deriving schematic answers, and provide completeness and soundness proofs to justify the applicability of this technique to the case of resolution for FOL without equality. The proposed method can be directly used with regular RDBs, including legacy databases. Moreover, we propose it as a potential basis for an efficient Web-scale semantic search technology.

  14. Mining Longitudinal Web Queries: Trends and Patterns.

    ERIC Educational Resources Information Center

    Wang, Peiling; Berry, Michael W.; Yang, Yiheng

    2003-01-01

    Analyzed user queries submitted to an academic Web site during a four-year period, using a relational database, to examine users' query behavior, to identify problems they encounter, and to develop techniques for optimizing query analysis and mining. Linguistic analyses focus on query structures, lexicon, and word associations using statistical…

  15. Decomposition: A Strategy for Query Processing.

    ERIC Educational Resources Information Center

    Wong, Eugene; Youssefi, Karel

    Multivariable queries can be processed in the data base management system INGRES. The general procedure is to decompose the query into a sequence of one-variable queries using two processes. One process is reduction which requires breaking off components of the query which are joined to it by a single variable. The other process,…

  16. Information Network Model Query Processing

    NASA Astrophysics Data System (ADS)

    Song, Xiaopu

    Information Networking Model (INM) [31] is a novel database model for real world objects and relationships management. It naturally and directly supports various kinds of static and dynamic relationships between objects. In INM, objects are networked through various natural and complex relationships. INM Query Language (INM-QL) [30] is designed to explore such information network, retrieve information about schema, instance, their attributes, relationships, and context-dependent information, and process query results in the user specified form. INM database management system has been implemented using Berkeley DB, and it supports INM-QL. This thesis is mainly focused on the implementation of the subsystem that is able to effectively and efficiently process INM-QL. The subsystem provides a lexical and syntactical analyzer of INM-QL, and it is able to choose appropriate evaluation strategies and index mechanism to process queries in INM-QL without the user's intervention. It also uses intermediate result structure to hold intermediate query result and other helping structures to reduce complexity of query processing.

  17. Improving Estimation Accuracy of Aggregate Queries on Data Cubes

    SciTech Connect

    Pourabbas, Elaheh; Shoshani, Arie

    2008-08-15

    In this paper, we investigate the problem of estimation of a target database from summary databases derived from a base data cube. We show that such estimates can be derived by choosing a primary database which uses a proxy database to estimate the results. This technique is common in statistics, but an important issue we are addressing is the accuracy of these estimates. Specifically, given multiple primary and multiple proxy databases, that share the same summary measure, the problem is how to select the primary and proxy databases that will generate the most accurate target database estimation possible. We propose an algorithmic approach for determining the steps to select or compute the source databases from multiple summary databases, which makes use of the principles of information entropy. We show that the source databases with the largest number of cells in common provide the more accurate estimates. We prove that this is consistent with maximizing the entropy. We provide some experimental results on the accuracy of the target database estimation in order to verify our results.

  18. Federated queries of clinical data repositories: the sum of the parts does not equal the whole

    PubMed Central

    Weber, Griffin M

    2013-01-01

    Background and objective In 2008 we developed a shared health research information network (SHRINE), which for the first time enabled research queries across the full patient populations of four Boston hospitals. It uses a federated architecture, where each hospital returns only the aggregate count of the number of patients who match a query. This allows hospitals to retain control over their local databases and comply with federal and state privacy laws. However, because patients may receive care from multiple hospitals, the result of a federated query might differ from what the result would be if the query were run against a single central repository. This paper describes the situations when this happens and presents a technique for correcting these errors. Methods We use a one-time process of identifying which patients have data in multiple repositories by comparing one-way hash values of patient demographics. This enables us to partition the local databases such that all patients within a given partition have data at the same subset of hospitals. Federated queries are then run separately on each partition independently, and the combined results are presented to the user. Results Using theoretical bounds and simulated hospital networks, we demonstrate that once the partitions are made, SHRINE can produce more precise estimates of the number of patients matching a query. Conclusions Uncertainty in the overlap of patient populations across hospitals limits the effectiveness of SHRINE and other federated query tools. Our technique reduces this uncertainty while retaining an aggregate federated architecture. PMID:23349080

  19. Querying Large Biological Network Datasets

    ERIC Educational Resources Information Center

    Gulsoy, Gunhan

    2013-01-01

    New experimental methods has resulted in increasing amount of genetic interaction data to be generated every day. Biological networks are used to store genetic interaction data gathered. Increasing amount of data available requires fast large scale analysis methods. Therefore, we address the problem of querying large biological network datasets.…

  20. Automatically Preparing Safe SQL Queries

    NASA Astrophysics Data System (ADS)

    Bisht, Prithvi; Sistla, A. Prasad; Venkatakrishnan, V. N.

    We present the first sound program source transformation approach for automatically transforming the code of a legacy web application to employ PREPARE statements in place of unsafe SQL queries. Our approach therefore opens the way for eradicating the SQL injection threat vector from legacy web applications.

  1. Name Those Quantities

    SciTech Connect

    Strom, Daniel J.

    2004-03-22

    The International Commission on Radiological Protection (ICRP) has created a number of radiation protection quantities since its Publication 26 appeared in 1977. The ensuing years have brought chaos in the form of multiple definitions and symbols for the same and similar quantities, conflicting definitions, mathematical absurdities, and a proliferation of terms. Despite this, the most commonly used radiation protection quantities in the USA and in the International Atomic Energy Agency's Basic Safety Standards have not been named or clearly defined by the ICRP. This paper proposes the names "total effective dose" for the prospective quantity, and "total personal effective dose" for the quantity pertaining to an exposed individual.

  2. Aggregated Interdisciplinary Databases and the Needs of Undergraduate Researchers

    ERIC Educational Resources Information Center

    Fister, Barbara; Gilbert, Julie; Fry, Amy Ray

    2008-01-01

    After seeing growing frustration among inexperienced undergraduate researchers searching a popular aggregated interdisciplinary database, the authors questioned whether the leading interdisciplinary databases are serving undergraduates' needs. As a preliminary exploration of this question, the authors queried vendors, analyzed their marketing…

  3. Characterization of the Biomedical Query Mediation Process

    PubMed Central

    Hruby, Gregory W.; Boland, Mary Regina; Cimino, James J.; Gao, Junfeng; Wilcox, Adam B.; Hirschberg, Julia; Weng, Chunhua

    To most medical researchers, databases are obscure black boxes. Query analysts are often indispensable guides aiding researchers to perform mediated data queries. However, this approach does not scale up and is time-consuming and expensive. We analyzed query mediation dialogues to inform future designs of intelligent query mediation systems. Thirty-one mediated query sessions for 22 research projects were recorded and transcribed. We analyzed 10 of these to develop an annotation schema for dialogue acts through iterative refinement. Three coders independently annotated all 3160 dialogue acts. We assessed the inter-rater agreement and resolved disagreement by group consensus. This study contributes early knowledge of the query negotiation space for medical research. We conclude that research data query formulation is not a straightforward translation from researcher data needs to database queries, but rather iterative, process-oriented needs assessment and refinement. PMID:24303242

  4. An efficient query mechanism base on P2P networks

    NASA Astrophysics Data System (ADS)

    Wang, Xiaohua; Mu, Aiqin; Zhao, Defang

    2013-07-01

    How to implement the efficient query is the key problem deployed on P2P networks. This paper analyses the shortage of several query algorithm, and presents a new algorithm DDI, which means distributed searching with double indices. It discusses the popularity of documents and the linking status of the networks, and calculates the availability of the nodes in whole network, determines the route of the query process. It compares the items of time using, the quantity of requests and update information by the emulate experiments. Along with the rapid development of computer network technology, peer-to-peer (referred to as P2P) network research has gradually become mature, and it is widely used in different fields, some large P2P computing project has entered the implementation stage. At present, many more popular software systems such as Gnutella, Freenet, Napster are deployed based on P2P technology. How to achieve effective information query has become one of the key problems of P2P research.

  5. Advanced Query Formulation in Deductive Databases.

    ERIC Educational Resources Information Center

    Niemi, Timo; Jarvelin, Kalervo

    1992-01-01

    Discusses deductive databases and database management systems (DBMS) and introduces a framework for advanced query formulation for end users. Recursive processing is described, a sample extensional database is presented, query types are explained, and criteria for advanced query formulation from the end user's viewpoint are examined. (31…

  6. Extensive quantities in thermodynamics

    NASA Astrophysics Data System (ADS)

    Mannaerts, Sebastiaan H.

    2014-05-01

    A literature survey shows little consistency in the definitions of the term ‘extensive quantity’ (a.k.a. extensive property) as used in thermodynamics. A majority assumes that extensive quantities are those that are proportional to mass. Taking the mathematical meaning of proportional and taking the ‘mass’ to be that of the system or subsystem, it is shown that the proportionality assumption is only correct for a few extensive quantities under condition of constant composition. A large subset of extensive quantities are completely independent of mass; for most systems extensive quantities are not proportional to mass, but mass is the (extensive) constant of proportionality. The definition by IUPAC, based on the additivity of extensive quantities, is the preferred baseline for discussing this subject. It is noted however, that two types of additivity need to be distinguished and that a few intensive quantities are also additive. This paper leaves several interesting questions open to further scrutiny.

  7. A Framework for WWW Query Processing

    NASA Technical Reports Server (NTRS)

    Wu, Binghui Helen; Wharton, Stephen (Technical Monitor)

    2000-01-01

    Query processing is the most common operation in a DBMS. Sophisticated query processing has been mainly targeted at a single enterprise environment providing centralized control over data and metadata. Submitting queries by anonymous users on the web is different in such a way that load balancing or DBMS' accessing control becomes the key issue. This paper provides a solution by introducing a framework for WWW query processing. The success of this framework lies in the utilization of query optimization techniques and the ontological approach. This methodology has proved to be cost effective at the NASA Goddard Space Flight Center Distributed Active Archive Center (GDAAC).

  8. Query expansion using the UMLS Metathesaurus.

    PubMed Central

    Aronson, A. R.; Rindflesch, T. C.

    1997-01-01

    Recent work has demonstrated the importance of query expansion for improving retrieval effectiveness when applying statistically-based systems to MEDLINE citations. The research has suggested the use of retrieval feedback for enhancing the original text of users' queries. As an alternative method of query expansion, we propose the use of the MetaMap program for associating UMLS Metathesaurus concepts with the original query. Our experiments show that query expansion based on MetaMap compares favorably with retrieval feedback. We conclude that the optimal strategy would be to combine the two techniques. PMID:9357673

  9. IJA: an efficient algorithm for query processing in sensor networks.

    PubMed

    Lee, Hyun Chang; Lee, Young Jae; Lim, Ji Hyang; Kim, Dong Hwa

    2011-01-01

    One of main features in sensor networks is the function that processes real time state information after gathering needed data from many domains. The component technologies consisting of each node called a sensor node that are including physical sensors, processors, actuators and power have advanced significantly over the last decade. Thanks to the advanced technology, over time sensor networks have been adopted in an all-round industry sensing physical phenomenon. However, sensor nodes in sensor networks are considerably constrained because with their energy and memory resources they have a very limited ability to process any information compared to conventional computer systems. Thus query processing over the nodes should be constrained because of their limitations. Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. By way of example while simple queries, such as select and aggregate queries, in sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. Therefore, in this paper, we propose and describe an Incremental Join Algorithm (IJA) in Sensor Networks to reduce the overhead caused by moving a join pair to the final join node or to minimize the communication cost that is the main consumer of the battery when processing the distributed queries in sensor networks environments. At the same time, the simulation result shows that the proposed IJA algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join algorithm. PMID:22319375

  10. Spatial Query for Planetary Data

    NASA Technical Reports Server (NTRS)

    Shams, Khawaja S.; Crockett, Thomas M.; Powell, Mark W.; Joswig, Joseph C.; Fox, Jason M.

    2011-01-01

    Science investigators need to quickly and effectively assess past observations of specific locations on a planetary surface. This innovation involves a location-based search technology that was adapted and applied to planetary science data to support a spatial query capability for mission operations software. High-performance location-based searching requires the use of spatial data structures for database organization. Spatial data structures are designed to organize datasets based on their coordinates in a way that is optimized for location-based retrieval. The particular spatial data structure that was adapted for planetary data search is the R+ tree.

  11. EquiX-A Search and Query Language for XML.

    ERIC Educational Resources Information Center

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

    2002-01-01

    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)

  12. Multi-Bit Quantum Private Query

    NASA Astrophysics Data System (ADS)

    Shi, Wei-Xu; Liu, Xing-Tong; Wang, Jian; Tang, Chao-Jing

    2015-09-01

    Most of the existing Quantum Private Queries (QPQ) protocols provide only single-bit queries service, thus have to be repeated several times when more bits are retrieved. Wei et al.'s scheme for block queries requires a high-dimension quantum key distribution system to sustain, which is still restricted in the laboratory. Here, based on Markus Jakobi et al.'s single-bit QPQ protocol, we propose a multi-bit quantum private query protocol, in which the user can get access to several bits within one single query. We also extend the proposed protocol to block queries, using a binary matrix to guard database security. Analysis in this paper shows that our protocol has better communication complexity, implementability and can achieve a considerable level of security.

  13. Federated querying architecture with clinical & translational health IT application.

    PubMed

    Livne, Oren E; Schultz, N Dustin; Narus, Scott P

    2011-10-01

    We present a software architecture that federates data from multiple heterogeneous health informatics data sources owned by multiple organizations. The architecture builds upon state-of-the-art open-source Java and XML frameworks in innovative ways. It consists of (a) federated query engine, which manages federated queries and result set aggregation via a patient identification service; and (b) data source facades, which translate the physical data models into a common model on-the-fly and handle large result set streaming. System modules are connected via reusable Apache Camel integration routes and deployed to an OSGi enterprise service bus. We present an application of our architecture that allows users to construct queries via the i2b2 web front-end, and federates patient data from the University of Utah Enterprise Data Warehouse and the Utah Population database. Our system can be easily adopted, extended and integrated with existing SOA Healthcare and HL7 frameworks such as i2b2 and caGrid. PMID:21537849

  14. Efficient Query Answering for OWL 2

    NASA Astrophysics Data System (ADS)

    Pérez-Urbina, Héctor; Horrocks, Ian; Motik, Boris

    The QL profile of OWL 2 has been designed so that it is possible to use database technology for query answering via query rewriting. We present a comparison of our resolution based rewriting algorithm with the standard algorithm proposed by Calvanese et al., implementing both and conducting an empirical evaluation using ontologies and queries derived from realistic applications. The results indicate that our algorithm produces significantly smaller rewritings in most cases, which could be important for practicality in realistic applications.

  15. Querying Semi-Structured Data

    NASA Technical Reports Server (NTRS)

    Abiteboul, Serge

    1997-01-01

    The amount of data of all kinds available electronically has increased dramatically in recent years. The data resides in different forms, ranging from unstructured data in the systems to highly structured in relational database systems. Data is accessible through a variety of interfaces including Web browsers, database query languages, application-specic interfaces, or data exchange formats. Some of this data is raw data, e.g., images or sound. Some of it has structure even if the structure is often implicit, and not as rigid or regular as that found in standard database systems. Sometimes the structure exists but has to be extracted from the data. Sometimes also it exists but we prefer to ignore it for certain purposes such as browsing. We call here semi-structured data this data that is (from a particular viewpoint) neither raw data nor strictly typed, i.e., not table-oriented as in a relational model or sorted-graph as in object databases. As will seen later when the notion of semi-structured data is more precisely de ned, the need for semi-structured data arises naturally in the context of data integration, even when the data sources are themselves well-structured. Although data integration is an old topic, the need to integrate a wider variety of data- formats (e.g., SGML or ASN.1 data) and data found on the Web has brought the topic of semi-structured data to the forefront of research. The main purpose of the paper is to isolate the essential aspects of semi- structured data. We also survey some proposals of models and query languages for semi-structured data. In particular, we consider recent works at Stanford U. and U. Penn on semi-structured data. In both cases, the motivation is found in the integration of heterogeneous data.

  16. Construction aggregates

    USGS Publications Warehouse

    Tepordei, V.V.

    1995-01-01

    Part of the 1994 Industrial Minerals Review. The production, consumption, and applications of construction aggregates are reviewed. In 1994, the production of construction aggregates, which includes crushed stone and construction sand and gravel combined, increased 7.7 percent to 2.14 Gt compared with the previous year. These record production levels are mostly a result of funding for highway construction work provided by the Intermodal Surface Transportation Efficiency Act of 1991. Demand is expected to increase for construction aggregates in 1995.

  17. How Do Children Reformulate Their Search Queries?

    ERIC Educational Resources Information Center

    Rutter, Sophie; Ford, Nigel; Clough, Paul

    2015-01-01

    Introduction: This paper investigates techniques used by children in year 4 (age eight to nine) of a UK primary school to reformulate their queries, and how they use information retrieval systems to support query reformulation. Method: An in-depth study analysing the interactions of twelve children carrying out search tasks in a primary school…

  18. Flexible Phrase Based Query Handling Algorithms.

    ERIC Educational Resources Information Center

    Wilbur, W. John; Kim, Won

    2001-01-01

    Flexibility in query handling can be important if one types a search engine query that is misspelled, contains terms not in the database, or requires knowledge of a controlled vocabulary. Presents results of experiments that suggest the optimal form of similarity functions that are applicable to the task of phrase based retrieval to find either…

  19. Improving Web Search for Difficult Queries

    ERIC Educational Resources Information Center

    Wang, Xuanhui

    2009-01-01

    Search engines have now become essential tools in all aspects of our life. Although a variety of information needs can be served very successfully, there are still a lot of queries that search engines can not answer very effectively and these queries always make users feel frustrated. Since it is quite often that users encounter such "difficult…

  20. Quantities, Units, and Symbols.

    ERIC Educational Resources Information Center

    Royal Society, London (England).

    This booklet provides a reference to the quantities, units, and their symbols which are used in physical science. It is a revision of a 1969 report and takes account of the progress which has been made in obtaining international agreement on the definitions, names, and symbols for units and on the rules for the expression of relations involving…

  1. Relevance Feedback Based Query Expansion Model Using Borda Count and Semantic Similarity Approach.

    PubMed

    Singh, Jagendra; Sharan, Aditi

    2015-01-01

    Pseudo-Relevance Feedback (PRF) is a well-known method of query expansion for improving the performance of information retrieval systems. All the terms of PRF documents are not important for expanding the user query. Therefore selection of proper expansion term is very important for improving system performance. Individual query expansion terms selection methods have been widely investigated for improving its performance. Every individual expansion term selection method has its own weaknesses and strengths. To overcome the weaknesses and to utilize the strengths of the individual method, we used multiple terms selection methods together. In this paper, first the possibility of improving the overall performance using individual query expansion terms selection methods has been explored. Second, Borda count rank aggregation approach is used for combining multiple query expansion terms selection methods. Third, the semantic similarity approach is used to select semantically similar terms with the query after applying Borda count ranks combining approach. Our experimental results demonstrated that our proposed approaches achieved a significant improvement over individual terms selection method and related state-of-the-art methods. PMID:26770189

  2. Relevance Feedback Based Query Expansion Model Using Borda Count and Semantic Similarity Approach

    PubMed Central

    Singh, Jagendra; Sharan, Aditi

    2015-01-01

    Pseudo-Relevance Feedback (PRF) is a well-known method of query expansion for improving the performance of information retrieval systems. All the terms of PRF documents are not important for expanding the user query. Therefore selection of proper expansion term is very important for improving system performance. Individual query expansion terms selection methods have been widely investigated for improving its performance. Every individual expansion term selection method has its own weaknesses and strengths. To overcome the weaknesses and to utilize the strengths of the individual method, we used multiple terms selection methods together. In this paper, first the possibility of improving the overall performance using individual query expansion terms selection methods has been explored. Second, Borda count rank aggregation approach is used for combining multiple query expansion terms selection methods. Third, the semantic similarity approach is used to select semantically similar terms with the query after applying Borda count ranks combining approach. Our experimental results demonstrated that our proposed approaches achieved a significant improvement over individual terms selection method and related state-of-the-art methods. PMID:26770189

  3. Query Term Weights as Constraints in Fuzzy Information Retrieval.

    ERIC Educational Resources Information Center

    Bordogna, G; And Others

    1991-01-01

    Presents an analytical approach to the interpretation of weighted Boolean queries. By distinguishing query term weights from query weights, a query becomes a means of describing classes of ideal documents and expressing relativity criteria among these descriptions. A formalization of query term weights is given in a fuzzy set theoretical context.…

  4. Weighted aggregation

    NASA Technical Reports Server (NTRS)

    Feiveson, A. H. (Principal Investigator)

    1979-01-01

    The use of a weighted aggregation technique to improve the precision of the overall LACIE estimate is considered. The manner in which a weighted aggregation technique is implemented given a set of weights is described. The problem of variance estimation is discussed and the question of how to obtain the weights in an operational environment is addressed.

  5. Spatial information semantic query based on SPARQL

    NASA Astrophysics Data System (ADS)

    Xiao, Zhifeng; Huang, Lei; Zhai, Xiaofang

    2009-10-01

    How can the efficiency of spatial information inquiries be enhanced in today's fast-growing information age? We are rich in geospatial data but poor in up-to-date geospatial information and knowledge that are ready to be accessed by public users. This paper adopts an approach for querying spatial semantic by building an Web Ontology language(OWL) format ontology and introducing SPARQL Protocol and RDF Query Language(SPARQL) to search spatial semantic relations. It is important to establish spatial semantics that support for effective spatial reasoning for performing semantic query. Compared to earlier keyword-based and information retrieval techniques that rely on syntax, we use semantic approaches in our spatial queries system. Semantic approaches need to be developed by ontology, so we use OWL to describe spatial information extracted by the large-scale map of Wuhan. Spatial information expressed by ontology with formal semantics is available to machines for processing and to people for understanding. The approach is illustrated by introducing a case study for using SPARQL to query geo-spatial ontology instances of Wuhan. The paper shows that making use of SPARQL to search OWL ontology instances can ensure the result's accuracy and applicability. The result also indicates constructing a geo-spatial semantic query system has positive efforts on forming spatial query and retrieval.

  6. Extended query refinement for medical image retrieval.

    PubMed

    Deserno, Thomas M; Güld, Mark O; Plodowski, Bartosz; Spitzer, Klaus; Wein, Berthold B; Schubert, Henning; Ney, Hermann; Seidl, Thomas

    2008-09-01

    The impact of image pattern recognition on accessing large databases of medical images has recently been explored, and content-based image retrieval (CBIR) in medical applications (IRMA) is researched. At the present, however, the impact of image retrieval on diagnosis is limited, and practical applications are scarce. One reason is the lack of suitable mechanisms for query refinement, in particular, the ability to (1) restore previous session states, (2) combine individual queries by Boolean operators, and (3) provide continuous-valued query refinement. This paper presents a powerful user interface for CBIR that provides all three mechanisms for extended query refinement. The various mechanisms of man-machine interaction during a retrieval session are grouped into four classes: (1) output modules, (2) parameter modules, (3) transaction modules, and (4) process modules, all of which are controlled by a detailed query logging. The query logging is linked to a relational database. Nested loops for interaction provide a maximum of flexibility within a minimum of complexity, as the entire data flow is still controlled within a single Web page. Our approach is implemented to support various modalities, orientations, and body regions using global features that model gray scale, texture, structure, and global shape characteristics. The resulting extended query refinement has a significant impact for medical CBIR applications. PMID:17497197

  7. Path querying system on mobile devices

    NASA Astrophysics Data System (ADS)

    Lin, Xing; Wang, Yifei; Tian, Yuan; Wu, Lun

    2006-01-01

    Traditional approaches to path querying problems are not efficient and convenient under most circumstances. A more convenient and reliable approach to this problem has to be found. This paper is devoted to a path querying solution on mobile devices. By using an improved Dijkstra's shortest path algorithm and a natural language translating module, this system can help people find the shortest path between two places through their cell phones or other mobile devices. The chosen path is prompted in text of natural language, as well as a map picture. This system would be useful in solving best path querying problems and have potential to be a profitable business system.

  8. Construction aggregates

    USGS Publications Warehouse

    Langer, W.H.; Tepordei, V.V.; Bolen, W.P.

    2000-01-01

    Construction aggregates consist primarily of crushed stone and construction sand and gravel. Total estimated production of construction aggregates increased in 1999 by about 2% to 2.39 Gt (2.64 billion st) compared with 1998. This record production level continued an expansion that began in 1992. By commodities, crushed stone production increased 3.3%, while sand and gravel production increased by about 0.5%.

  9. Construction aggregates

    USGS Publications Warehouse

    Tepordei, V.V.

    1994-01-01

    Part of a special section on industrial minerals in 1993. The 1993 production of construction aggregates increased 6.3 percent over the 1992 figure, to reach 2.01 Gt. This represents the highest estimated annual production of combined crushed stone and construction sand and gravel ever recorded in the U.S. The outlook for construction aggregates and the issues facing the industry are discussed.

  10. RF modal quantity gaging

    NASA Astrophysics Data System (ADS)

    Vanleuven, K.

    1989-05-01

    The primary objective is to provide a concept of a radio frequency (RF) modal resonance technique which is being investigated as a method for gaging the quantities of subcritical cryogenic propellants in metallic tanks. Of special interest are the potential applications of the technique to microgravity propellant gaging situations. The results of concept testing using cryogenic oxygen, hydrogen, and nitrogen, as well as paraffin simulations of microgravity fluid orientations, are reported. These test results were positive and showed that the gaging concept was viable.

  11. On Relevance Weight Estimation and Query Expansion.

    ERIC Educational Resources Information Center

    Robertson, S. E.

    1986-01-01

    A Bayesian argument is used to suggest modifications to the Robertson and Jones relevance weighting formula to accommodate the addition to the query of terms taken from the relevant documents identified during the search. (Author)

  12. Interactive Graphical Queries for Bibliographic Search.

    ERIC Educational Resources Information Center

    Brooks, Martin; Campbell, Jennifer

    1999-01-01

    Presents "Islands," an interactive graphical interface for construction, modification, and management of queries during a search session on a bibliographic database. Discusses motivation and bibliographic search semantics and compares the Islands interface to the Dialog interface. (Author/LRW)

  13. Business information query expansion through semantic network

    NASA Astrophysics Data System (ADS)

    Gong, Zhiguo; Muyeba, Maybin; Guo, Jingzhi

    2010-02-01

    In this article, we propose a method for business information query expansions. In our approach, hypernym/hyponymy and synonym relations in WordNet are used as the basic expansion rules. Then we use WordNet Lexical Chains and WordNet semantic similarity to assign terms in the same query into different groups with respect to their semantic similarities. For each group, we expand the highest terms in the WordNet hierarchies with hypernym and synonym, the lowest terms with hyponym and synonym and all other terms with only synonym. In this way, the contradictory caused by full expansion can be well controlled. Furthermore, we use collection-related term semantic network to further improve the expansion performance. And our experiment reveals that our solution for query expansion can improve the query performance dramatically.

  14. Query-answering algorithms for information agents

    SciTech Connect

    Levy, A.Y.; Rajaraman, A.; Ordille, J.J.

    1996-12-31

    We describe the architecture and query-answering algorithms used in the Information Manifold, an implemented information gathering system that provides uniform access to structured information sources on the World-Wide Web. Our architecture provides an expressive language for describing information sources, which makes it easy to add new sources and to model the fine-grained distinctions between their contents. The query-answering algorithm guarantees that the descriptions of the sources are exploited to access only sources that are relevant to a given query. Accessing only relevant sources is crucial to scale up such a system to large numbers of sources. In addition, our algorithm can exploit run-time information to further prune information sources and to reduce the cost of query planning.

  15. The StarView intelligent query mechanism

    NASA Technical Reports Server (NTRS)

    Semmel, R. D.; Silberberg, D. P.

    1993-01-01

    The StarView interface is being developed to facilitate the retrieval of scientific and engineering data produced by the Hubble Space Telescope. While predefined screens in the interface can be used to specify many common requests, ad hoc requests require a dynamic query formulation capability. Unfortunately, logical level knowledge is too sparse to support this capability. In particular, essential formulation knowledge is lost when the domain of interest is mapped to a set of database relation schemas. Thus, a system known as QUICK has been developed that uses conceptual design knowledge to facilitate query formulation. By heuristically determining strongly associated objects at the conceptual level, QUICK is able to formulate semantically reasonable queries in response to high-level requests that specify only attributes of interest. Moreover, by exploiting constraint knowledge in the conceptual design, QUICK assures that queries are formulated quickly and will execute efficiently.

  16. Producing approximate answers to database queries

    NASA Technical Reports Server (NTRS)

    Vrbsky, Susan V.; Liu, Jane W. S.

    1993-01-01

    We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. The exact answer is produced if all of the needed data are available and query processing is allowed to continue until completion. The monotone query processing algorithm of APPROXIMATE works within the standard relational algebra framework and can be implemented on a relational database system with little change to the relational architecture. We describe here the approximation semantics of APPROXIMATE that serves as the basis for meaningful approximations of both set-valued and single-valued queries. We show how APPROXIMATE is implemented to make effective use of semantic information, provided by an object-oriented view of the database, and describe the additional overhead required by APPROXIMATE.

  17. Generic queries for meeting clinical information needs.

    PubMed Central

    Cimino, J J; Aguirre, A; Johnson, S B; Peng, P

    1993-01-01

    This paper describes a model for automated information retrieval in which questions posed by clinical users are analyzed to establish common syntactic and semantic patterns. The patterns are used to develop a set of general-purpose questions called generic queries. These generic queries are used in responding to specific clinical information needs. Users select generic queries in one of two ways. The user may type in questions, which are then analyzed, using natural language processing techniques, to identify the most relevant generic query; or the user may indicate patient data of interest and then pick one of several potentially relevant questions. Once the query and medical concepts have been determined, an information source is selected automatically, a retrieval strategy is composed and executed, and the results are sorted and filtered for presentation to the user. This work makes extensive use of the National Library of Medicine's Unified Medical Language System (UMLS): medical concepts are derived from the Metathesaurus, medical queries are based on semantic relations drawn from the UMLS Semantic Network, and automated source selection makes use of the Information Sources Map. The paper describes research currently under way to implement this model and reports on experience and results to date. PMID:8472005

  18. Implementing Graph Pattern Queries on a Relational Database

    SciTech Connect

    Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R

    2007-12-26

    When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.

  19. Identifying clinical/translational research cohorts: ascertainment via querying an integrated multi-source database

    PubMed Central

    Hurdle, John F; Haroldsen, Stephen C; Hammer, Andrew; Spigle, Cindy; Fraser, Alison M; Mineau, Geraldine P; Courdy, Samir J

    2013-01-01

    Background Ascertainment of potential subjects has been a longstanding problem in clinical research. Various methods have been proposed, including using data in electronic health records. However, these methods typically suffer from scaling effects—some methods work well for large cohorts; others work for small cohorts only. Objective We propose a method that provides a simple identification of pre-research cohorts and relies on data available in most states in the USA: merged public health data sources. Materials and methods The Utah Population Database Limited query tool allows users to build complex queries that may span several types of health records, such as cancer registries, inpatient hospital discharges, and death certificates; in addition, these can be combined with family history information. The architectural approach incorporates several coding systems for medical information. It provides a front-end graphical user interface and enables researchers to build and run queries and view aggregate results. Multiple strategies have been incorporated to maintain confidentiality. Results This tool was rapidly adopted; since its release, 241 users representing a wide range of disciplines from 17 institutions have signed the user agreement and used the query tool. Three examples are discussed: pregnancy complications co-occurring with cardiovascular disease; spondyloarthritis; and breast cancer. Discussion and conclusions This query tool was designed to provide results as pre-research so that institutional review board approval would not be required. This architecture uses well-described technologies that should be within the reach of most institutions. PMID:23059733

  20. An SQL query generator for CLIPS

    NASA Technical Reports Server (NTRS)

    Snyder, James; Chirica, Laurian

    1990-01-01

    As expert systems become more widely used, their access to large amounts of external information becomes increasingly important. This information exists in several forms such as statistical, tabular data, knowledge gained by experts and large databases of information maintained by companies. Because many expert systems, including CLIPS, do not provide access to this external information, much of the usefulness of expert systems is left untapped. The scope of this paper is to describe a database extension for the CLIPS expert system shell. The current industry standard database language is SQL. Due to SQL standardization, large amounts of information stored on various computers, potentially at different locations, will be more easily accessible. Expert systems should be able to directly access these existing databases rather than requiring information to be re-entered into the expert system environment. The ORACLE relational database management system (RDBMS) was used to provide a database connection within the CLIPS environment. To facilitate relational database access a query generation system was developed as a CLIPS user function. The queries are entered in a CLlPS-like syntax and are passed to the query generator, which constructs and submits for execution, an SQL query to the ORACLE RDBMS. The query results are asserted as CLIPS facts. The query generator was developed primarily for use within the ICADS project (Intelligent Computer Aided Design System) currently being developed by the CAD Research Unit in the California Polytechnic State University (Cal Poly). In ICADS, there are several parallel or distributed expert systems accessing a common knowledge base of facts. Expert system has a narrow domain of interest and therefore needs only certain portions of the information. The query generator provides a common method of accessing this information and allows the expert system to specify what data is needed without specifying how to retrieve it.

  1. SPARQL Query Re-writing Using Partonomy Based Transformation Rules

    NASA Astrophysics Data System (ADS)

    Jain, Prateek; Yeh, Peter Z.; Verma, Kunal; Henson, Cory A.; Sheth, Amit P.

    Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying ontology's containing spatial information, the precise relationships between spatial entities has to be specified in the basic graph pattern of SPARQL query which can result in long and complex queries. We present a novel approach to help users intuitively write SPARQL queries to query spatial data, rather than relying on knowledge of the ontology structure. Our framework re-writes queries, using transformation rules to exploit part-whole relations between geographical entities to address the mismatches between query constraints and knowledge base. Our experiments were performed on completely third party datasets and queries. Evaluations were performed on Geonames dataset using questions from National Geographic Bee serialized into SPARQL and British Administrative Geography Ontology using questions from a popular trivia website. These experiments demonstrate high precision in retrieval of results and ease in writing queries.

  2. EHR query language (EQL)--a query language for archetype-based health records.

    PubMed

    Ma, Chunlan; Frankel, Heath; Beale, Thomas; Heard, Sam

    2007-01-01

    OpenEHR specifications have been developed to standardise the representation of an international electronic health record (EHR). The language used for querying EHR data is not as yet part of the specification. To fill in this gap, Ocean Informatics has developed a query language currently known as EHR Query Language (EQL), a declarative language supporting queries on EHR data. EQL is neutral to EHR systems, programming languages and system environments and depends only on the openEHR archetype model and semantics. Thus, in principle, EQL can be used in any archetype-based computational context. In the EHR context described here, particular queries mention concepts from the openEHR EHR Reference Model (RM). EQL can be used as a common query language for disparate archetype-based applications. The use of a common RM, archetypes, and a companion query language, such as EQL, semantic interoperability of EHR information is much closer. This paper introduces the EQL syntax and provides example clinical queries to illustrate the syntax. Finally, current implementations and future directions are outlined. PMID:17911747

  3. SPARQL Assist language-neutral query composer

    PubMed Central

    2012-01-01

    Background SPARQL query composition is difficult for the lay-person, and even the experienced bioinformatician in cases where the data model is unfamiliar. Moreover, established best-practices and internationalization concerns dictate that the identifiers for ontological terms should be opaque rather than human-readable, which further complicates the task of synthesizing queries manually. Results We present SPARQL Assist: a Web application that addresses these issues by providing context-sensitive type-ahead completion during SPARQL query construction. Ontological terms are suggested using their multi-lingual labels and descriptions, leveraging existing support for internationalization and language-neutrality. Moreover, the system utilizes the semantics embedded in ontologies, and within the query itself, to help prioritize the most likely suggestions. Conclusions To ensure success, the Semantic Web must be easily available to all users, regardless of locale, training, or preferred language. By enhancing support for internationalization, and moreover by simplifying the manual construction of SPARQL queries through the use of controlled-natural-language interfaces, we believe we have made some early steps towards simplifying access to Semantic Web resources. PMID:22373327

  4. Microwave extinction characteristics of nanoparticle aggregates

    NASA Astrophysics Data System (ADS)

    Wu, Y. P.; Cheng, J. X.; Liu, X. X.; Wang, H. X.; Zhao, F. T.; Wen, W. W.

    2016-07-01

    Structure of nanoparticle aggregates plays an important role in microwave extinction capacity. The diffusion-limited aggregation model (DLA) for fractal growth is utilized to explore the possible structures of nanoparticle aggregates by computer simulation. Based on the discrete dipole approximation (DDA) method, the microwave extinction performance by different nano-carborundum aggregates is numerically analyzed. The effects of the particle quantity, original diameter, fractal structure, as well as orientation on microwave extinction are investigated, and also the extinction characteristics of aggregates are compared with the spherical nanoparticle in the same volume. Numerical results give out that proper aggregation of nanoparticle is beneficial to microwave extinction capacity, and the microwave extinction cross section by aggregated granules is better than that of the spherical solid one in the same volume.

  5. Measurements, Physical Quantities, and Units.

    ERIC Educational Resources Information Center

    Wilson, Laurence E.

    1988-01-01

    Explains the significance of the mole as a unit of measure by showing the relationship between physical quantities and their mathematical representations. Offers a summary of the principles of metrology that make creation of physical quantities and units seem reasonable. A table of base physical quantities and units is included. (RT)

  6. Automatic Building Information Model Query Generation

    SciTech Connect

    Jiang, Yufei; Yu, Nan; Ming, Jiang; Lee, Sanghoon; DeGraw, Jason; Yen, John; Messner, John I.; Wu, Dinghao

    2015-12-01

    Energy efficient building design and construction calls for extensive collaboration between different subfields of the Architecture, Engineering and Construction (AEC) community. Performing building design and construction engineering raises challenges on data integration and software interoperability. Using Building Information Modeling (BIM) data hub to host and integrate building models is a promising solution to address those challenges, which can ease building design information management. However, the partial model query mechanism of current BIM data hub collaboration model has several limitations, which prevents designers and engineers to take advantage of BIM. To address this problem, we propose a general and effective approach to generate query code based on a Model View Definition (MVD). This approach is demonstrated through a software prototype called QueryGenerator. By demonstrating a case study using multi-zone air flow analysis, we show how our approach and tool can help domain experts to use BIM to drive building design with less labour and lower overhead cost.

  7. A framework for querying heterogeneous images repositories

    NASA Astrophysics Data System (ADS)

    Albanesi, Maria G.; Falchero, Emanuele; Guerrini, Federico; Ferretti, Marco

    2003-12-01

    In this paper we describe a new system for storing annotated images in a large database and querying by means of a dynamical retrieval of images through use of metadata. It is based on a three-tier architecture suitable for building a common gateway for accessing heterogeneous data. Based on XML schema of documents, the extraction of metadata is used for successive querying. We give an example on a database of astronomical and geographical images, but the method is quite general and can be applied to more general case of large heterogeneous databases.

  8. Private database queries using one quantum state

    NASA Astrophysics Data System (ADS)

    Yang, Yu-Guang; Zhang, Ming-Ou; Yang, Rui

    2015-03-01

    A novel private database query protocol with only one quantum state is proposed. The database owner Bob sends only one quantum state to the user Alice. The proposed protocol combines the idea of semiquantum key distribution and private query. It can be implemented in the situation where not all the parties can afford expensive quantum resources and operations. So our proposal is more practical in use. We also prove that the proposed protocol is secure in terms of the user security and the database security.

  9. Construction aggregates

    USGS Publications Warehouse

    Tepordei, V.V.

    1993-01-01

    Part of a special section on the market performance of industrial minerals in 1992. Production of construction aggregates increased by 4.6 percent in 1992. This increase was due, in part, to the increased funding for transportation and infrastructure projects. The U.S. produced about 1.05 Gt of crushed stone and an estimated 734 Mt of construction sand and gravel in 1992. Demand is expected to increase by about 5 percent in 1993.

  10. Construction aggregates

    USGS Publications Warehouse

    Tepordei, V.V.

    1996-01-01

    Part of the Annual Commodities Review 1995. Production of construction aggregates such as crushed stone and construction sand and gravel showed a marginal increase in 1995. Most of the 1995 increases were due to funding for highway construction work. The major areas of concern to the industry included issues relating to wetlands classification and the classification of crystalline silica as a probable human carcinogen. Despite this, an increase in demand is anticipated for 1996.

  11. On-Demand Information Retrieval in Sensor Networks with Localised Query and Energy-Balanced Data Collection

    PubMed Central

    Teng, Rui; Zhang, Bing

    2011-01-01

    On-demand information retrieval enables users to query and collect up-to-date sensing information from sensor nodes. Since high energy efficiency is required in a sensor network, it is desirable to disseminate query messages with small traffic overhead and to collect sensing data with low energy consumption. However, on-demand query messages are generally forwarded to sensor nodes in network-wide broadcasts, which create large traffic overhead. In addition, since on-demand information retrieval may introduce intermittent and spatial data collections, the construction and maintenance of conventional aggregation structures such as clusters and chains will be at high cost. In this paper, we propose an on-demand information retrieval approach that exploits the name resolution of data queries according to the attribute and location of each sensor node. The proposed approach localises each query dissemination and enable localised data collection with maximised aggregation. To illustrate the effectiveness of the proposed approach, an analytical model that describes the criteria of sink proxy selection is provided. The evaluation results reveal that the proposed scheme significantly reduces energy consumption and improves the balance of energy consumption among sensor nodes by alleviating heavy traffic near the sink. PMID:22346581

  12. Advanced Querying Features for Disease Surveillance Systems

    PubMed Central

    Hashemian, Mohammad R.

    2010-01-01

    Most automated disease surveillance systems notify users of increases in the prevalence of reports in syndrome categories and allow users to view patient level data related to those increases. Occasionally, a more dynamic level of control is required to properly detect an emerging disease in a community. Dynamic querying features are invaluable when using existing surveillance systems to investigate outbreaks of newly emergent diseases or to identify cases of reportable diseases within data being captured for surveillance. The objective of the Advance Querying Tool (AQT) is to build a more flexible query interface for most web-based disease surveillance systems. This interface allows users to define and build their query as if they were writing a logical expression for a mathematical computation. The AQT allows users to develop, investigate, save, and share complex case definitions. It provides a flexible interface that accommodates both advanced and novice users, checks the validity of the expression as it is built, and marks errors for users. PMID:23569575

  13. IView: Introgression library visualization and query tool

    Technology Transfer Automated Retrieval System (TEKTRAN)

    Near-isogenic lines (NIL) are powerful genetic resources to analyze phenotypic variation and are important to map-base clone genes underlying mutations and traits. With many thousands of distinct genotypes, querying introgression libraries for lines of interest is an issue. We have created a tool ...

  14. Spatial relation query based on geographic ontology

    NASA Astrophysics Data System (ADS)

    Du, Chong; Xu, Jun; Zhang, Jing; Si, Wangli; Liu, Bao; Zhang, Dapeng

    2010-11-01

    The description of a spatial relation is the reflection of human's cognition of spatial objects. It is not only affected by topology and metric, but also affected by geographic semantics, such as the categories of geographic entities and contexts. Currently, the researches about language aspects of spatial relations mostly focus on natural-language formalization, parsing of query sentences, and natural-language query interface. However, geographic objects are not simple geometric points, lines or polygons. In order to get a sound answer according with human cognition in spatial relation queries, we have to take geographic semantics into account. In this paper, the functions of natural-language spatial terms are designed based on previous work on natural-language formalization and human-subject tests. Then, the paper builds a geographic knowledge base based on geographic ontology using Protégé for discriminating geographic semantics. Finally, using the geographic knowledge in the knowledge base, a prototype of a query system is implemented on GIS platform.

  15. PBS: An Economical Natural Language Query Interpreter.

    ERIC Educational Resources Information Center

    Samstag-Schnock, Uwe; Meadow, Charles T.

    1993-01-01

    Reports on the design and implementation of PBS (Parsing, Boolean Recognition, Stemming), a software module used in conjunction with an intermediary program to interpret natural language queries used for online database searching. Results of a test of the initial version, which is designed for use with bibliographic files, are reported. (13…

  16. MPEG-7 multimedia-based query format

    NASA Astrophysics Data System (ADS)

    Chang, Wo

    2006-08-01

    Searching multimedia content for image, audio, and video is getting more attention especially for personal media content due to the affordability of consumer electronic devices such as MP3 recordable players, digital cameras, DV camcorders, and well-integrated smart phones. The precise search and retrieval of the content derived from these devices can be a very challenging task. Many leading edge search engine vendors have been applying sophisticated and advanced indexing and retrieval techniques on various text-based document formats, but when it comes to retrieving multimedia content, searching based on the media clip filename is the most common practice. As a result, there is an imprecise and ineffective user experience for searching multimedia content. This paper presents a new development underway from a joint effort between International Organization for Standardization (ISO)/International Electrotechnial Commission (IEC) Subcommittee (SC) 29 Working Group (WG) 11 MPEG (Moving Picture Experts Group) and WG1 JPEG (Joint Picture Experts Group) for a universal standard query format called MPEG-7 Query Format (MP7QF) as a means to enable a good user experience for consumers searching multimedia content. It also provides the industry with a unified way to accept and respond to user queries. This paper presents the core requirements for such a universal query format.

  17. Hybrid Filtering in Semantic Query Processing

    ERIC Educational Resources Information Center

    Jeong, Hanjo

    2011-01-01

    This dissertation presents a hybrid filtering method and a case-based reasoning framework for enhancing the effectiveness of Web search. Web search may not reflect user needs, intent, context, and preferences, because today's keyword-based search is lacking semantic information to capture the user's context and intent in posing the search query.…

  18. A novel methodology for querying web images

    NASA Astrophysics Data System (ADS)

    Prabhakara, Rashmi; Lee, Ching Cheng

    2004-12-01

    Ever since the advent of Internet, there has been an immense growth in the amount of image data that is available on the World Wide Web. With such a magnitude of image availability, an efficient and effective image retrieval system is required to make use of this information. This research presents an effective image matching and indexing technique that improvises on existing integrated image retrieval methods. The proposed technique follows a two-phase approach, integrating query by topic and query by example specification methods. The first phase consists of topic-based image retrieval using an improved text information retrieval (IR) technique that makes use of the structured format of HTML documents. It consists of a focused crawler that not only provides for the user to enter the keyword for the topic-based search but also, the scope in which the user wants to find the images. The second phase uses the query by example specification to perform a low-level content-based image match for the retrieval of smaller and relatively closer results of the example image. Information related to the image feature is automatically extracted from the query image by the image processing system. A technique that is not computationally intensive based on color feature is used to perform content-based matching of images. The main goal is to develop a functional image search and indexing system and to demonstrate that better retrieval results can be achieved with this proposed hybrid search technique.

  19. A novel methodology for querying web images

    NASA Astrophysics Data System (ADS)

    Prabhakara, Rashmi; Lee, Ching Cheng

    2005-01-01

    Ever since the advent of Internet, there has been an immense growth in the amount of image data that is available on the World Wide Web. With such a magnitude of image availability, an efficient and effective image retrieval system is required to make use of this information. This research presents an effective image matching and indexing technique that improvises on existing integrated image retrieval methods. The proposed technique follows a two-phase approach, integrating query by topic and query by example specification methods. The first phase consists of topic-based image retrieval using an improved text information retrieval (IR) technique that makes use of the structured format of HTML documents. It consists of a focused crawler that not only provides for the user to enter the keyword for the topic-based search but also, the scope in which the user wants to find the images. The second phase uses the query by example specification to perform a low-level content-based image match for the retrieval of smaller and relatively closer results of the example image. Information related to the image feature is automatically extracted from the query image by the image processing system. A technique that is not computationally intensive based on color feature is used to perform content-based matching of images. The main goal is to develop a functional image search and indexing system and to demonstrate that better retrieval results can be achieved with this proposed hybrid search technique.

  20. Astroquery: querying astronomical web forms and databases

    NASA Astrophysics Data System (ADS)

    Sipocz, Brigitta

    2016-03-01

    Astroquery is an Astropy affiliated package for a set of tools for querying astronomical web forms and databases. In this lightning talk I give an overview of the available services and the usage of the package including a live demo of a typical use case.

  1. Autonomic care platform for optimizing query performance

    PubMed Central

    2013-01-01

    Background As the amount of information in electronic health care systems increases, data operations get more complicated and time-consuming. Intensive Care platforms require a timely processing of data retrievals to guarantee the continuous display of recent data of patients. Physicians and nurses rely on this data for their decision making. Manual optimization of query executions has become difficult to handle due to the increased amount of queries across multiple sources. Hence, a more automated management is necessary to increase the performance of database queries. The autonomic computing paradigm promises an approach in which the system adapts itself and acts as self-managing entity, thereby limiting human interventions and taking actions. Despite the usage of autonomic control loops in network and software systems, this approach has not been applied so far for health information systems. Methods We extend the COSARA architecture, an infection surveillance and antibiotic management service platform for the Intensive Care Unit (ICU), with self-managed components to increase the performance of data retrievals. We used real-life ICU COSARA queries to analyse slow performance and measure the impact of optimizations. Each day more than 2 million COSARA queries are executed. Three control loops, which monitor the executions and take action, have been proposed: reactive, deliberative and reflective control loops. We focus on improvements of the execution time of microbiology queries directly related to the visual displays of patients’ data on the bedside screens. Results The results show that autonomic control loops are beneficial for the optimizations in the data executions in the ICU. The application of reactive control loop results in a reduction of 8.61% of the average execution time of microbiology results. The combined application of the reactive and deliberative control loop results in an average query time reduction of 10.92% and the combination of

  2. Cumulative Query Method for Influenza Surveillance Using Search Engine Data

    PubMed Central

    Seo, Dong-Woo; Sohn, Chang Hwan; Shin, Soo-Yong; Lee, JaeHo; Yu, Maengsoo; Kim, Won Young; Lim, Kyoung Soo; Lee, Sang-Il

    2014-01-01

    Background Internet search queries have become an important data source in syndromic surveillance system. However, there is currently no syndromic surveillance system using Internet search query data in South Korea. Objectives The objective of this study was to examine correlations between our cumulative query method and national influenza surveillance data. Methods Our study was based on the local search engine, Daum (approximately 25% market share), and influenza-like illness (ILI) data from the Korea Centers for Disease Control and Prevention. A quota sampling survey was conducted with 200 participants to obtain popular queries. We divided the study period into two sets: Set 1 (the 2009/10 epidemiological year for development set 1 and 2010/11 for validation set 1) and Set 2 (2010/11 for development Set 2 and 2011/12 for validation Set 2). Pearson’s correlation coefficients were calculated between the Daum data and the ILI data for the development set. We selected the combined queries for which the correlation coefficients were .7 or higher and listed them in descending order. Then, we created a cumulative query method n representing the number of cumulative combined queries in descending order of the correlation coefficient. Results In validation set 1, 13 cumulative query methods were applied, and 8 had higher correlation coefficients (min=.916, max=.943) than that of the highest single combined query. Further, 11 of 13 cumulative query methods had an r value of ≥.7, but 4 of 13 combined queries had an r value of ≥.7. In validation set 2, 8 of 15 cumulative query methods showed higher correlation coefficients (min=.975, max=.987) than that of the highest single combined query. All 15 cumulative query methods had an r value of ≥.7, but 6 of 15 combined queries had an r value of ≥.7. Conclusions Cumulative query method showed relatively higher correlation with national influenza surveillance data than combined queries in the development and validation

  3. On Optimal Differentially Private Mechanisms for Count-Range Queries*

    PubMed Central

    Zeng, Chen; Cai, Jin-Yi; Lu, Pinyan; Naughton, Jeffrey F.

    2014-01-01

    While there is a large and growing body of literature on differentially private mechanisms for answering various classes of queries, to the best of our knowledge “count-range” queries have not been studied. These are a natural class of queries that ask “is the number of rows in a relation satisfying a given predicate between two integers θ1 and θ2?” Such queries can be viewed as a simple form of SQL “having” queries. We begin by developing a provably optimal differentially private mechansim for count-range queries for a single consumer. For count queries (in contrast to count-range queries), Ghosh et al. [9] have provided a differentially private mechanism that simultaneously maximizes utility for multiple consumers. This raises the question of whether such a mechanism exists for count-range queries. We prove that the answer is no — for count range queries, no such mechanism exists. However, perhaps surprisingly, we prove that such a mechanism does exist for “threshold” queries, which are simply count-range queries for which either θ1 = 0 or θ2 = +∞. Furthermore, we prove that this mechanism is a two-approximation for general count-range queries. PMID:25364783

  4. Construction aggregates

    USGS Publications Warehouse

    Bolen, W.P.; Tepordei, V.V.

    2001-01-01

    The estimated production during 2000 of construction aggregates, crushed stone, and construction sand and gravel increased by about 2.6% to 2.7 Gt (3 billion st), compared with 1999. The expansion that started in 1992 continued with record production levels for the ninth consecutive year. By commodity, construction sand and gravel production increased by 4.5% to 1.16 Gt (1.28 billion st), while crushed stone production increased by 1.3% to 1.56 Gt (1.72 billion st).

  5. Optimal query-based relevance feedback in medical image retrieval using score fusion-based classification.

    PubMed

    Behnam, Mohammad; Pourghassem, Hossein

    2015-04-01

    In this paper, a new content-based medical image retrieval (CBMIR) framework using an effective classification method and a novel relevance feedback (RF) approach are proposed. For a large-scale database with diverse collection of different modalities, query image classification is inevitable due to firstly, reducing the computational complexity and secondly, increasing influence of data fusion by removing unimportant data and focus on the more valuable information. Hence, we find probability distribution of classes in the database using Gaussian mixture model (GMM) for each feature descriptor and then using the fusion of obtained scores from the dependency probabilities, the most relevant clusters are identified for a given query. Afterwards, visual similarity of query image and images in relevant clusters are calculated. This method is performed separately on all feature descriptors, and then the results are fused together using feature similarity ranking level fusion algorithm. In the RF level, we propose a new approach to find the optimal queries based on relevant images. The main idea is based on density function estimation of positive images and strategy of moving toward the aggregation of estimated density function. The proposed framework has been evaluated on ImageCLEF 2005 database consisting of 10,000 medical X-ray images of 57 semantic classes. The experimental results show that compared with the existing CBMIR systems, our framework obtains the acceptable performance both in the image classification and in the image retrieval by RF. PMID:25246167

  6. The Shared Health Research Information Network (SHRINE): a prototype federated query tool for clinical data repositories.

    PubMed

    Weber, Griffin M; Murphy, Shawn N; McMurry, Andrew J; Macfadden, Douglas; Nigrin, Daniel J; Churchill, Susanne; Kohane, Isaac S

    2009-01-01

    The authors developed a prototype Shared Health Research Information Network (SHRINE) to identify the technical, regulatory, and political challenges of creating a federated query tool for clinical data repositories. Separate Institutional Review Boards (IRBs) at Harvard's three largest affiliated health centers approved use of their data, and the Harvard Medical School IRB approved building a Query Aggregator Interface that can simultaneously send queries to each hospital and display aggregate counts of the number of matching patients. Our experience creating three local repositories using the open source Informatics for Integrating Biology and the Bedside (i2b2) platform can be used as a road map for other institutions. The authors are actively working with the IRBs and regulatory groups to develop procedures that will ultimately allow investigators to obtain identified patient data and biomaterials through SHRINE. This will guide us in creating a future technical architecture that is scalable to a national level, compliant with ethical guidelines, and protective of the interests of the participating hospitals. PMID:19567788

  7. Query Networks for Medical Information Retrieval-Assigning Probabilistic Relationships

    PubMed Central

    Cousins, Steve B.; Silverstein, Jonathan C.; Frisse, Mark E.

    1990-01-01

    Query networks are specializations of Belief networks used in information retrieval. We hypothesize that query networks can be incorporated into medical information systems in at least two ways: First, the relative values of nodes in the query networks can be used to initiate searches based on query term-weights. Second, query models can incorporate reader feedback and can become simple task-specific user models. If large query networks are to be useful, one must find means to assign reasonable “default” values to those nodes and edges which are not explicitly defined by some other means. This paper presents preliminary data assessing the suitability of various default heuristic query network edge assignment functions. Early evidence suggests that query networks using default assignment functions exhibit behavior consistent with that expected from an information retrieval aid.

  8. Enabling Ontology Based Semantic Queries in Biomedical Database Systems.

    PubMed

    Zheng, Shuai; Wang, Fusheng; Lu, James; Saltz, Joel

    2012-01-01

    While current biomedical ontology repositories offer primitive query capabilities, it is difficult or cumbersome to support ontology based semantic queries directly in semantically annotated biomedical databases. The problem may be largely attributed to the mismatch between the models of the ontologies and the databases, and the mismatch between the query interfaces of the two systems. To fully realize semantic query capabilities based on ontologies, we develop a system DBOntoLink to provide unified semantic query interfaces by extending database query languages. With DBOntoLink, semantic queries can be directly and naturally specified as extended functions of the database query languages without any programming needed. DBOntoLink is adaptable to different ontologies through customizations and supports major biomedical ontologies hosted at the NCBO BioPortal. We demonstrate the use of DBOntoLink in a real world biomedical database with semantically annotated medical image annotations. PMID:23404054

  9. A new tool for sharing and querying of clinical documents modeled using HL7 Version 3 standard.

    PubMed

    Slavov, Vasil; Rao, Praveen; Paturi, Srivenu; Swami, Tivakar Komara; Barnes, Michael; Rao, Deepthi; Palvai, Raghuvarun

    2013-12-01

    We present a new software tool called CDN (Collaborative Data Network) for sharing and querying of clinical documents modeled using HL7 v3 standard (e.g., Clinical Document Architecture (CDA), Continuity of Care Document (CCD)). Similar to the caBIG initiative, CDN aims to foster innovations in cancer treatment and diagnosis through large-scale, sharing of clinical data. We focus on cancer because it is the second leading cause of deaths in the US. CDN is based on the synergistic combination of peer-to-peer technology and the extensible markup language XML and XQuery. Using CDN, a user can pose both structured queries and keyword queries on the HL7 v3 documents hosted by data providers. CDN is unique in its design--it supports location oblivious queries in a large-scale, network wherein a user does not explicitly provide the location of the data for a query. A location service in CDN discovers data of interest in the network at query time. CDN uses standard cryptographic techniques to provide security to data providers and protect the privacy of patients. Using CDN, a user can pose clinical queries pertaining to cancer containing aggregations and joins across data hosted by multiple data providers. CDN is implemented with open-source software for web application development and XML query processing. We ran CDN in a distributed environment using Amazon EC2 as a testbed. We report its performance on real and synthetic datasets of discharge summaries. We show that CDN can achieve good performance in a setup with large number of data providers and documents. PMID:24001923

  10. Virtual Solar Observatory Distributed Query Construction

    NASA Technical Reports Server (NTRS)

    Gurman, J. B.; Dimitoglou, G.; Bogart, R.; Davey, A.; Hill, F.; Martens, P.

    2003-01-01

    Through a prototype implementation (Tian et al., this meeting) the VSO has already demonstrated the capability of unifying geographically distributed data sources following the Web Services paradigm and utilizing mechanisms such as the Simple Object Access Protocol (SOAP). So far, four participating sites (Stanford, Montana State University, National Solar Observatory and the Solar Data Analysis Center) permit Web-accessible, time-based searches that allow browse access to a number of diverse data sets. Our latest work includes the extension of the simple, time-based queries to include numerous other searchable observation parameters. For VSO users, this extended functionality enables more refined searches. For the VSO, it is a proof of concept that more complex, distributed queries can be effectively constructed and that results from heterogeneous, remote sources can be synthesized and presented to users as a single, virtual data product.

  11. Learning Boolean queries for article quality filtering.

    PubMed

    Aphinyanaphongs, Yin; Aliferis, Constantin F

    2004-01-01

    Prior research has shown that Support Vector Machine models have the ability to identify high quality content-specific articles in the domain of internal medicine. These models, though powerful, cannot be used in Boolean search engines nor can the content of the models be verified via human inspection. In this paper, we use decision trees combined with several feature selection methods to generate Boolean query filters for the same domain and task. The resulting trees are generated automatically and exhibit high performance. The trees are understandable, manageable, and able to be validated by humans. The subsequent Boolean queries are sensible and can be readily used as filters by Boolean search engines. PMID:15360815

  12. Multiple Query Evaluation Based on an Enhanced Genetic Algorithm.

    ERIC Educational Resources Information Center

    Tamine, Lynda; Chrisment, Claude; Boughanem, Mohand

    2003-01-01

    Explains the use of genetic algorithms to combine results from multiple query evaluations to improve relevance in information retrieval. Discusses niching techniques, relevance feedback techniques, and evolution heuristics, and compares retrieval results obtained by both genetic multiple query evaluation and classical single query evaluation…

  13. An Agent-based Framework for Web Query Answering.

    ERIC Educational Resources Information Center

    Wang, Huaiqing; Liao, Stephen; Liao, Lejian

    2000-01-01

    Discusses discrepancies between user queries on the Web and the answers provided by information sources; proposes an agent-based framework for Web mining tasks; introduces an object-oriented deductive data model and a flexible query language; and presents a cooperative mechanism for query answering. (Author/LRW)

  14. Applying Query Structuring in Cross-language Retrieval.

    ERIC Educational Resources Information Center

    Pirkola, Ari; Puolamaki, Deniz; Jarvelin, Kalervo

    2003-01-01

    Explores ways to apply query structuring in cross-language information retrieval. Tested were: English queries translated into Finnish using an electronic dictionary, and run in a Finnish newspaper databases; effects of compound-based structuring using a proximity operator for translation equivalents of query language compound components; and a…

  15. Automatic query formulations in information retrieval.

    PubMed

    Salton, G; Buckley, C; Fox, E A

    1983-07-01

    Modern information retrieval systems are designed to supply relevant information in response to requests received from the user population. In most retrieval environments the search requests consist of keywords, or index terms, interrelated by appropriate Boolean operators. Since it is difficult for untrained users to generate effective Boolean search requests, trained search intermediaries are normally used to translate original statements of user need into useful Boolean search formulations. Methods are introduced in this study which reduce the role of the search intermediaries by making it possible to generate Boolean search formulations completely automatically from natural language statements provided by the system patrons. Frequency considerations are used automatically to generate appropriate term combinations as well as Boolean connectives relating the terms. Methods are covered to produce automatic query formulations both in a standard Boolean logic system, as well as in an extended Boolean system in which the strict interpretation of the connectives is relaxed. Experimental results are supplied to evaluate the effectiveness of the automatic query formulation process, and methods are described for applying the automatic query formulation process in practice. PMID:10299297

  16. A Last-Resort Semantic Cache for Web Queries

    NASA Astrophysics Data System (ADS)

    Ferrarotti, Flavio; Marin, Mauricio; Mendoza, Marcelo

    We propose a method to evaluate queries using a last-resort semantic cache in a distributed Web search engine. The cache stores a group of frequent queries and for each of these queries it keeps minimal data, that is, the list of machines that produced their answers. The method for evaluating the queries uses the inverse frequency of the terms in the queries stored in the cache (Idf) to determine when the results recovered from the cache are a good approximation to the exact answer set. Experiments show that the method is effective and efficient.

  17. Federated Space-Time Query for Earth Science Data Using OpenSearch Conventions

    NASA Astrophysics Data System (ADS)

    Lynnes, C.; Beaumont, B.; Duerr, R. E.; Hua, H.

    2009-12-01

    The past decade has seen a burgeoning of remote sensing and Earth science data providers, as evidenced in the growth of the Earth Science Information Partner (ESIP) federation. At the same time, the need to combine diverse data sets to enable understanding of the Earth as a system has also grown. While the expansion of data providers is in general a boon to such studies, the diversity presents a challenge to finding useful data for a given study. Locating all the data files with aerosol information for a particular volcanic eruption, for example, may involve learning and using several different search tools to execute the requisite space-time queries. To address this issue, the ESIP federation is developing a federated space-time query framework, based on the OpenSearch convention (www.opensearch.org), with Geo and Time extensions. In this framework, data providers publish OpenSearch Description Documents that describe in a machine-readable form how to execute queries against the provider. The novelty of OpenSearch is that the space-time query interface becomes both machine callable and easy enough to integrate into the web browser's search box. This flexibility, together with a simple REST (HTTP-get) interface, should allow a variety of data providers to participate in the federated search framework, from large institutional data centers to individual scientists. The simple interface enables trivial querying of multiple data sources and participation in recursive-like federated searches--all using the same common OpenSearch interface. This simplicity also makes the construction of clients easy, as does existing OpenSearch client libraries in a variety of languages. Moreover, a number of clients and aggregation services already exist and OpenSearch is already supported by a number of web browsers such as Firefox and Internet Explorer.

  18. Strategies for Estimating Discrete Quantities.

    ERIC Educational Resources Information Center

    Crites, Terry W.

    1993-01-01

    Describes the benchmark and decomposition-recomposition estimation strategies and presents five techniques to develop students' estimation ability. Suggests situations involving quantities of candy and popcorn in which the teacher can model those strategies for the students. (MDH)

  19. Improve Performance of Data Warehouse by Query Cache

    NASA Astrophysics Data System (ADS)

    Gour, Vishal; Sarangdevot, S. S.; Sharma, Anand; Choudhary, Vinod

    2010-11-01

    The primary goal of data warehouse is to free the information locked up in the operational database so that decision makers and business analyst can make queries, analysis and planning regardless of the data changes in operational database. As the number of queries is large, therefore, in certain cases there is reasonable probability that same query submitted by the one or multiple users at different times. Each time when query is executed, all the data of warehouse is analyzed to generate the result of that query. In this paper we will study how using query cache improves performance of Data Warehouse and try to find the common problems faced. These kinds of problems are faced by Data Warehouse administrators which are minimizes response time and improves the efficiency of query in data warehouse overall, particularly when data warehouse is updated at regular interval.

  20. The Database Query Support Processor (QSP)

    NASA Technical Reports Server (NTRS)

    1993-01-01

    The number and diversity of databases available to users continues to increase dramatically. Currently, the trend is towards decentralized, client server architectures that (on the surface) are less expensive to acquire, operate, and maintain than information architectures based on centralized, monolithic mainframes. The database query support processor (QSP) effort evaluates the performance of a network level, heterogeneous database access capability. Air Force Material Command's Rome Laboratory has developed an approach, based on ANSI standard X3.138 - 1988, 'The Information Resource Dictionary System (IRDS)' to seamless access to heterogeneous databases based on extensions to data dictionary technology. To successfully query a decentralized information system, users must know what data are available from which source, or have the knowledge and system privileges necessary to find out this information. Privacy and security considerations prohibit free and open access to every information system in every network. Even in completely open systems, time required to locate relevant data (in systems of any appreciable size) would be better spent analyzing the data, assuming the original question was not forgotten. Extensions to data dictionary technology have the potential to more fully automate the search and retrieval for relevant data in a decentralized environment. Substantial amounts of time and money could be saved by not having to teach users what data resides in which systems and how to access each of those systems. Information describing data and how to get it could be removed from the application and placed in a dedicated repository where it belongs. The result simplified applications that are less brittle and less expensive to build and maintain. Software technology providing the required functionality is off the shelf. The key difficulty is in defining the metadata required to support the process. The database query support processor effort will provide

  1. Query Specific Rank Fusion for Image Retrieval.

    PubMed

    Zhang, Shaoting; Yang, Ming; Cour, Timothee; Yu, Kai; Metaxas, Dimitris N

    2015-04-01

    Recently two lines of image retrieval algorithms demonstrate excellent scalability: 1) local features indexed by a vocabulary tree, and 2) holistic features indexed by compact hashing codes. Although both of them are able to search visually similar images effectively, their retrieval precision may vary dramatically among queries. Therefore, combining these two types of methods is expected to further enhance the retrieval precision. However, the feature characteristics and the algorithmic procedures of these methods are dramatically different, which is very challenging for the feature-level fusion. This motivates us to investigate how to fuse the ordered retrieval sets, i.e., the ranks of images, given by multiple retrieval methods, to boost the retrieval precision without sacrificing their scalability. In this paper, we model retrieval ranks as graphs of candidate images and propose a graph-based query specific fusion approach, where multiple graphs are merged and reranked by conducting a link analysis on a fused graph. The retrieval quality of an individual method is measured on-the-fly by assessing the consistency of the top candidates' nearest neighborhoods. Hence, it is capable of adaptively integrating the strengths of the retrieval methods using local or holistic features for different query images. This proposed method does not need any supervision, has few parameters, and is easy to implement. Extensive and thorough experiments have been conducted on four public datasets, i.e., the UKbench, Corel-5K, Holidays and the large-scale San Francisco Landmarks datasets. Our proposed method has achieved very competitive performance, including state-of-the-art results on several data sets, e.g., the N-S score 3.83 for UKbench. PMID:26353295

  2. Querying genomic databases: refining the connectivity map.

    PubMed

    Segal, Mark R; Xiong, Hao; Bengtsson, Henrik; Bourgon, Richard; Gentleman, Robert

    2012-01-01

    The advent of high-throughput biotechnologies, which can efficiently measure gene expression on a global basis, has led to the creation and population of correspondingly rich databases and compendia. Such repositories have the potential to add enormous scientific value beyond that provided by individual studies which, due largely to cost considerations, are typified by small sample sizes. Accordingly, substantial effort has been invested in devising analysis schemes for utilizing gene-expression repositories. Here, we focus on one such scheme, the Connectivity Map (cmap), that was developed with the express purpose of identifying drugs with putative efficacy against a given disease, where the disease in question is characterized by a (differential) gene-expression signature. Initial claims surrounding cmap intimated that such tools might lead to new, previously unanticipated applications of existing drugs. However, further application suggests that its primary utility is in connecting a disease condition whose biology is largely unknown to a drug whose mechanisms of action are well understood, making cmap a tool for enhancing biological knowledge.The success of the Connectivity Map is belied by its simplicity. The aforementioned signature serves as an unordered query which is applied to a customized database of (differential) gene-expression experiments designed to elicit response to a wide range of drugs, across of spectrum of concentrations, durations, and cell lines. Such application is effected by computing a per experiment score that measures "closeness" between the signature and the experiment. Top-scoring experiments, and the attendant drug(s), are then deemed relevant to the disease underlying the query. Inference supporting such elicitations is pursued via re-sampling. In this paper, we revisit two key aspects of the Connectivity Map implementation. Firstly, we develop new approaches to measuring closeness for the common scenario wherein the query

  3. Query-Time Optimization Techniques for Structured Queries in Information Retrieval

    ERIC Educational Resources Information Center

    Cartright, Marc-Allen

    2013-01-01

    The use of information retrieval (IR) systems is evolving towards larger, more complicated queries. Both the IR industrial and research communities have generated significant evidence indicating that in order to continue improving retrieval effectiveness, increases in retrieval model complexity may be unavoidable. From an operational perspective,…

  4. Protecting count queries in study design

    PubMed Central

    Sarwate, Anand D; Boxwala, Aziz A

    2012-01-01

    Objective Today's clinical research institutions provide tools for researchers to query their data warehouses for counts of patients. To protect patient privacy, counts are perturbed before reporting; this compromises their utility for increased privacy. The goal of this study is to extend current query answer systems to guarantee a quantifiable level of privacy and allow users to tailor perturbations to maximize the usefulness according to their needs. Methods A perturbation mechanism was designed in which users are given options with respect to scale and direction of the perturbation. The mechanism translates the true count, user preferences, and a privacy level within administrator-specified bounds into a probability distribution from which the perturbed count is drawn. Results Users can significantly impact the scale and direction of the count perturbation and can receive more accurate final cohort estimates. Strong and semantically meaningful differential privacy is guaranteed, providing for a unified privacy accounting system that can support role-based trust levels. This study provides an open source web-enabled tool to investigate visually and numerically the interaction between system parameters, including required privacy level and user preference settings. Conclusions Quantifying privacy allows system administrators to provide users with a privacy budget and to monitor its expenditure, enabling users to control the inevitable loss of utility. While current measures of privacy are conservative, this system can take advantage of future advances in privacy measurement. The system provides new ways of trading off privacy and utility that are not provided in current study design systems. PMID:22511018

  5. Trigonometric functions of nonlinear quantities

    SciTech Connect

    Wester, D.W.

    1994-08-01

    Trigonometric functions of nonlinear quantities are introduced. Functions of the form {line_integral}(x{sup a}), {line_integral}(x{sup y}), and {line_integral}{sup n}(x{sup a}) are reported, where {line_integral} is a trigonometric function such as cos, sin, tan, cot, sec, or csc; x is a variable; a is a constant; y is a variable; and n is a constant. Sums, products and quotients of these functions are defined. Trigonometric functions of nonlinear quantities involving constants to variable powers also are mentioned. Possible applications to quantum mechanics, gravity, and a final theory of matter are discussed.

  6. Characteristic quantities and dimensional analysis

    NASA Astrophysics Data System (ADS)

    Grimvall, Göran

    Phenomena in the physical sciences are described with quantities that have a numerical value and a dimension, i.e., a physical unit. Dimensional analysis is a powerful aspect of modeling and simulation. Characteristic quantities formed by a combination of model parameters can give new insights without detailed analytic or numerical calculations. Dimensional requirements lead to Buckingham's Π theorem - a general mathematical structure of all models in physics. These aspects are illustrated with many examples of modeling, e.g., an elastic beam on supports, wave propagation on a liquid surface, the Lennard-Jones potential for the interaction between atoms, the Lindemann melting rule, and saturation phenomena in electrical and thermal conduction.

  7. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets usingFast Bitmap Indices

    SciTech Connect

    Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu, Kesheng; Bethel,Wes

    2006-03-30

    Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy > 10{sup 5} and temperature > 10{sup 6}''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducing multi-dimensional semantic indexing. Our implementation leverages an efficient indexing technology called bitmap indexing that has been widely used in the database community. Bitmap indices are especially well suited for interactive exploration of large-scale read only data. Storing the bitmap indices into the HDF5 file has the following advantages: (a) Significant performance speedup of accessing subsets of multi-dimensional data and (b) portability of the indices across multiple computer platforms. We will present an API that simplifies the execution of queries on HDF5 files for general scientific applications and data analysis. The design is flexible enough to accommodate the use of arbitrary indexing technology for semantic range queries. We will also provide a detailed performance analysis of HDF5-FastQuery for both synthetic and scientific data. The results demonstrate that our proposed approach for multi-dimensional queries is up to a factor of 2 faster than HDF5.

  8. HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets UsingFast Bitmap Indices

    SciTech Connect

    Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu, Kesheng; Bethel,Wes

    2005-12-07

    Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy >105 and temperature >106''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducing multi-dimensional semantic indexing. Our implementation leverages an efficient indexing technology called ''bitmapindexing'' that has been widely used in the database community. Bitmapindices are especially well suited for interactive exploration of large-scale read-only data. Storing the bitmap indices into the HDF5 file has the following advantages: (a) Significant performance speedup of accessing subsets of multi-dimensional data and (b) portability of the indices across multiple computer platforms. We will present an API that simplifies the execution of queries on HDF5 files for general scientific applications and data analysis. The design is flexible enough to accommodate the use of arbitrary indexing technology for semantic range queries. We will also provide a detailed performance analysis of HDF5-FastQuery for both synthetic and scientific data. The results demonstrate that our proposed approach for multi-dimensional queries is up to a factor of 2 faster than HDF5.

  9. CrossQuery: A Web Tool for Easy Associative Querying of Transcriptome Data

    PubMed Central

    Thoma, Eva C.; Schartl, Manfred

    2011-01-01

    Enormous amounts of data are being generated by modern methods such as transcriptome or exome sequencing and microarray profiling. Primary analyses such as quality control, normalization, statistics and mapping are highly complex and need to be performed by specialists. Thereafter, results are handed back to biomedical researchers, who are then confronted with complicated data lists. For rather simple tasks like data filtering, sorting and cross-association there is a need for new tools which can be used by non-specialists. Here, we describe CrossQuery, a web tool that enables straight forward, simple syntax queries to be executed on transcriptome sequencing and microarray datasets. We provide deep-sequencing data sets of stem cell lines derived from the model fish Medaka and microarray data of human endothelial cells. In the example datasets provided, mRNA expression levels, gene, transcript and sample identification numbers, GO-terms and gene descriptions can be freely correlated, filtered and sorted. Queries can be saved for later reuse and results can be exported to standard formats that allow copy-and-paste to all widespread data visualization tools such as Microsoft Excel. CrossQuery enables researchers to quickly and freely work with transcriptome and microarray data sets requiring only minimal computer skills. Furthermore, CrossQuery allows growing association of multiple datasets as long as at least one common point of correlated information, such as transcript identification numbers or GO-terms, is shared between samples. For advanced users, the object-oriented plug-in and event-driven code design of both server-side and client-side scripts allow easy addition of new features, data sources and data types. PMID:22174941

  10. CrossQuery: a web tool for easy associative querying of transcriptome data.

    PubMed

    Wagner, Toni U; Fischer, Andreas; Thoma, Eva C; Schartl, Manfred

    2011-01-01

    Enormous amounts of data are being generated by modern methods such as transcriptome or exome sequencing and microarray profiling. Primary analyses such as quality control, normalization, statistics and mapping are highly complex and need to be performed by specialists. Thereafter, results are handed back to biomedical researchers, who are then confronted with complicated data lists. For rather simple tasks like data filtering, sorting and cross-association there is a need for new tools which can be used by non-specialists. Here, we describe CrossQuery, a web tool that enables straight forward, simple syntax queries to be executed on transcriptome sequencing and microarray datasets. We provide deep-sequencing data sets of stem cell lines derived from the model fish Medaka and microarray data of human endothelial cells. In the example datasets provided, mRNA expression levels, gene, transcript and sample identification numbers, GO-terms and gene descriptions can be freely correlated, filtered and sorted. Queries can be saved for later reuse and results can be exported to standard formats that allow copy-and-paste to all widespread data visualization tools such as Microsoft Excel. CrossQuery enables researchers to quickly and freely work with transcriptome and microarray data sets requiring only minimal computer skills. Furthermore, CrossQuery allows growing association of multiple datasets as long as at least one common point of correlated information, such as transcript identification numbers or GO-terms, is shared between samples. For advanced users, the object-oriented plug-in and event-driven code design of both server-side and client-side scripts allow easy addition of new features, data sources and data types. PMID:22174941

  11. Query-Based Outlier Detection in Heterogeneous Information Networks

    PubMed Central

    Kuck, Jonathan; Zhuang, Honglei; Yan, Xifeng; Cam, Hasan; Han, Jiawei

    2015-01-01

    Outlier or anomaly detection in large data sets is a fundamental task in data science, with broad applications. However, in real data sets with high-dimensional space, most outliers are hidden in certain dimensional combinations and are relative to a user’s search space and interest. It is often more effective to give power to users and allow them to specify outlier queries flexibly, and the system will then process such mining queries efficiently. In this study, we introduce the concept of query-based outlier in heterogeneous information networks, design a query language to facilitate users to specify such queries flexibly, define a good outlier measure in heterogeneous networks, and study how to process outlier queries efficiently in large data sets. Our experiments on real data sets show that following such a methodology, interesting outliers can be defined and uncovered flexibly and effectively in large heterogeneous networks. PMID:27064397

  12. A Novel Adaptive Cuckoo Search for Optimal Query Plan Generation

    PubMed Central

    Gomathi, Ramalingam; Sharmila, Dhandapani

    2014-01-01

    The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented. PMID:25215330

  13. A novel adaptive Cuckoo search for optimal query plan generation.

    PubMed

    Gomathi, Ramalingam; Sharmila, Dhandapani

    2014-01-01

    The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented. PMID:25215330

  14. Evaluation of Sub Query Performance in SQL Server

    NASA Astrophysics Data System (ADS)

    Oktavia, Tanty; Sujarwo, Surya

    2014-03-01

    The paper explores several sub query methods used in a query and their impact on the query performance. The study uses experimental approach to evaluate the performance of each sub query methods combined with indexing strategy. The sub query methods consist of in, exists, relational operator and relational operator combined with top operator. The experimental shows that using relational operator combined with indexing strategy in sub query has greater performance compared with using same method without indexing strategy and also other methods. In summary, for application that emphasized on the performance of retrieving data from database, it better to use relational operator combined with indexing strategy. This study is done on Microsoft SQL Server 2012.

  15. Querying and Extracting Timeline Information from Road Traffic Sensor Data.

    PubMed

    Imawan, Ardi; Indikawati, Fitri Indra; Kwon, Joonho; Rao, Praveen

    2016-01-01

    The escalation of traffic congestion in urban cities has urged many countries to use intelligent transportation system (ITS) centers to collect historical traffic sensor data from multiple heterogeneous sources. By analyzing historical traffic data, we can obtain valuable insights into traffic behavior. Many existing applications have been proposed with limited analysis results because of the inability to cope with several types of analytical queries. In this paper, we propose the QET (querying and extracting timeline information) system-a novel analytical query processing method based on a timeline model for road traffic sensor data. To address query performance, we build a TQ-index (timeline query-index) that exploits spatio-temporal features of timeline modeling. We also propose an intuitive timeline visualization method to display congestion events obtained from specified query parameters. In addition, we demonstrate the benefit of our system through a performance evaluation using a Busan ITS dataset and a Seattle freeway dataset. PMID:27563900

  16. Recognizing Prefixes in Scientific Quantities

    ERIC Educational Resources Information Center

    Sokolowski, Andrzej

    2015-01-01

    Although recognizing prefixes in physical quantities is inherent for practitioners, it might not be inherent for students, who do not use prefixes in their everyday life experiences. This deficiency surfaces in AP Physics exams. For example, readers of an AP Physics exam reported "a common mistake of incorrectly converting nanometers to…

  17. Quantity Estimation Of The Interactions

    SciTech Connect

    Gorana, Agim; Malkaj, Partizan; Muda, Valbona

    2007-04-23

    In this paper we present some considerations about quantity estimations, regarding the range of interaction and the conservations laws in various types of interactions. Our estimations are done under classical and quantum point of view and have to do with the interaction's carriers, the radius, the influence range and the intensity of interactions.

  18. Web Database Schema Identification through Simple Query Interface

    NASA Astrophysics Data System (ADS)

    Lin, Ling; Zhou, Lizhu

    Web databases provide different types of query interfaces to access the data records stored in the backend databases. While most existing works exploit a complex query interface with multiple input fields to perform schema identification of the Web databases, little attention has been paid on how to identify the schema of web databases by simple query interface (SQI), which has only one single query text input field. This paper proposes a new method of instance-based query probing to identify WDBs' interface and result schema for SQI. The interface schema identification problem is defined as generating the fullcondition query of SQI and a novel query probing strategy is proposed. The result schema is also identified based on the result webpages of SQI's full-condition query, and an extended identification of the non-query attributes is proposed to improve the attribute recall rate. Experimental results on web databases of online shopping for book, movie and mobile phone show that our method is effective and efficient.

  19. Distributed Query Plan Generation Using Multiobjective Genetic Algorithm

    PubMed Central

    Panicker, Shina; Vijay Kumar, T. V.

    2014-01-01

    A distributed query processing strategy, which is a key performance determinant in accessing distributed databases, aims to minimize the total query processing cost. One way to achieve this is by generating efficient distributed query plans that involve fewer sites for processing a query. In the case of distributed relational databases, the number of possible query plans increases exponentially with respect to the number of relations accessed by the query and the number of sites where these relations reside. Consequently, computing optimal distributed query plans becomes a complex problem. This distributed query plan generation (DQPG) problem has already been addressed using single objective genetic algorithm, where the objective is to minimize the total query processing cost comprising the local processing cost (LPC) and the site-to-site communication cost (CC). In this paper, this DQPG problem is formulated and solved as a biobjective optimization problem with the two objectives being minimize total LPC and minimize total CC. These objectives are simultaneously optimized using a multiobjective genetic algorithm NSGA-II. Experimental comparison of the proposed NSGA-II based DQPG algorithm with the single objective genetic algorithm shows that the former performs comparatively better and converges quickly towards optimal solutions for an observed crossover and mutation probability. PMID:24963513

  20. AQBE — QBE Style Queries for Archetyped Data

    NASA Astrophysics Data System (ADS)

    Sachdeva, Shelly; Yaginuma, Daigo; Chu, Wanming; Bhalla, Subhash

    Large-scale adoption of electronic healthcare applications requires semantic interoperability. The new proposals propose an advanced (multi-level) DBMS architecture for repository services for health records of patients. These also require query interfaces at multiple levels and at the level of semi-skilled users. In this regard, a high-level user interface for querying the new form of standardized Electronic Health Records system has been examined in this study. It proposes a step-by-step graphical query interface to allow semi-skilled users to write queries. Its aim is to decrease user effort and communication ambiguities, and increase user friendliness.

  1. PAQ: Persistent Adaptive Query Middleware for Dynamic Environments

    NASA Astrophysics Data System (ADS)

    Rajamani, Vasanth; Julien, Christine; Payton, Jamie; Roman, Gruia-Catalin

    Pervasive computing applications often entail continuous monitoring tasks, issuing persistent queries that return continuously updated views of the operational environment. We present PAQ, a middleware that supports applications' needs by approximating a persistent query as a sequence of one-time queries. PAQ introduces an integration strategy abstraction that allows composition of one-time query responses into streams representing sophisticated spatio-temporal phenomena of interest. A distinguishing feature of our middleware is the realization that the suitability of a persistent query's result is a function of the application's tolerance for accuracy weighed against the associated overhead costs. In PAQ, programmers can specify an inquiry strategy that dictates how information is gathered. Since network dynamics impact the suitability of a particular inquiry strategy, PAQ associates an introspection strategy with a persistent query, that evaluates the quality of the query's results. The result of introspection can trigger application-defined adaptation strategies that alter the nature of the query. PAQ's simple API makes developing adaptive querying systems easily realizable. We present the key abstractions, describe their implementations, and demonstrate the middleware's usefulness through application examples and evaluation.

  2. QVIZ: A FRAMEWORK FOR QUERYING AND VISUALIZING DATA

    SciTech Connect

    T. KEAHEY; P. MCCORMICK; ET AL

    2000-12-01

    Qviz is a lightweight, modular,and easy to use parallel system for interactive analytical query processing and visual presentation of large datasets. Qviz allows queries of arbitrary complexity to be easily constructed using a specialized scripting language. Visual presentation of the results is also easily achieved via simple scripted and interactive commands to our query-specific visualization tools. This paper describes our initial experiences with the Qviz system for querying and visualizing scientific datasets, showing how Qviz has been used in two different applications: ocean modeling and linear accelerator simulations.

  3. EarthServer: Information Retrieval and Query Language

    NASA Astrophysics Data System (ADS)

    Perperis, Thanassis; Koltsida, Panagiota; Kakaletris, George

    2013-04-01

    new construct allowing "mixed search" on both OGC coverages and XML-represented metadata and also returning "mixed results" further enabling seamless geospatial and array, combined data and metadata, processing under a familiar syntactic formalism. xWCPS is a superset of WCPS closely following XQuery's syntax and philosophy, further extending it with capabilities to handle coverages, array and multidimensional data, allowing different degrees of compliance to its results and opening new possibilities for data definition, processing and interoperability. Our long term vision for xWCPS is from the one hand to enable coverage and corresponding metadata retrieval, irrespective of their actual origin and form and from the other hand to offer syntactic constructs for data definition and data manipulation. Thus xWCPS queries could potentially employ distributed services to access diverse, cross-disciplinary and physically distributed data sources, data within them and metadata about them without directly specifying which coverages to employ, which parts come from metadata and which come from data processing (aggregates) functions. Respectively a Data Definition Language could allow schema definition and a Data Manipulation Language could enable updates, inserts, and deletes of data handled by an xWCPS system. xWCPS's specification is currently in draft form. We intend to initiate the corresponding OGC standardization activity with the finalization of the specification of the language.

  4. Compressed bitmap indices for efficient query processing

    SciTech Connect

    Wu, Kesheng; Otoo, Ekow; Shoshani, Arie

    2001-09-30

    Many database applications make extensive use of bitmap indexing schemes. In this paper, we study how to improve the efficiencies of these indexing schemes by proposing new compression schemes for the bitmaps. Most compression schemes are designed primarily to achieve good compression. During query processing they can be orders of magnitude slower than their uncompressed counterparts. The new schemes are designed to bridge this performance gap by reducing compression effectiveness and improving operation speed. In a number of tests on both synthetic data and real application data, we found that the new schemes significantly outperform the well-known compression schemes while using only modestly more space. For example, compared to the Byte-aligned Bitmap Code, the new schemes are 12 times faster and it uses only 50 percent more space. The new schemes use much less space(<30 percent) than the uncompressed scheme and are faster in a majority of the test cases.

  5. TEQUEL: The query language of SADDLE

    NASA Technical Reports Server (NTRS)

    Rajan, S. D.

    1984-01-01

    A relational database management system is presented that is tailored for engineering applications. A wide variety of engineering data types are supported and the data definition language (DDL) and data manipulation language (DML) are extended to handle matrices. The system can be used either in the standalone mode or through a FORTRAN or PASCAL application program. The query language is of the relational calculus type and allows the user to store, retrieve, update and delete tuples from relations. The relational operations including union, intersect and differ facilitate creation of temporary relations that can be used for manipulating information in a powerful manner. Sample applications are shown to illustrate the creation of data through a FORTRAN program and data manipulation using the TEQUEL DML.

  6. Query driven visualization of astronomical catalogs

    NASA Astrophysics Data System (ADS)

    Buddelmeijer, Hugo; Valentijn, Edwin A.

    2013-01-01

    Interactive visualization of astronomical catalogs requires novel techniques due to the huge volumes and complex structure of the data produced by existing and upcoming astronomical surveys. The creation as well as the disclosure of the catalogs can be handled by data pulling mechanisms (Buddelmeijer et al. 2011). These prevent unnecessary processing and facilitate data sharing by having users request the desired end products. In this work we present query driven visualization as a logical continuation of data pulling. Scientists can request catalogs in a declarative way and set process parameters directly from within the visualization. This results in profound interoperation between software with a high level of abstraction. New messages for the Simple Application Messaging Protocol are proposed to achieve this abstraction. Support for these messages are implemented in the Astro-WISE information system and in a set of demonstrational applications.

  7. The ESIS query environment pilot project

    NASA Technical Reports Server (NTRS)

    Fuchs, Jens J.; Ciarlo, Alessandro; Benso, Stefano

    1993-01-01

    The European Space Information System (ESIS) was originally conceived to provide the European space science community with simple and efficient access to space data archives, facilities with which to examine and analyze the retrieved data, and general information services. To achieve that ESIS will provide the scientists with a discipline specific environment for querying in a uniform and transparent manner data stored in geographically dispersed archives. Furthermore it will provide discipline specific tools for displaying and analyzing the retrieved data. The central concept of ESIS is to achieve a more efficient and wider usage of space scientific data, while maintaining the physical archives at the institutions which created them, and has the best background for ensuring and maintaining the scientific validity and interest of the data. In addition to coping with the physical distribution of data, ESIS is to manage also the heterogenity of the individual archives' data models, formats and data base management systems. Thus the ESIS system shall appear to the user as a single database, while it does in fact consist of a collection of dispersed and locally managed databases and data archives. The work reported in this paper is one of the results of the ESIS Pilot Project which is to be completed in 1993. More specifically it presents the pilot ESIS Query Environment (ESIS QE) system which forms the data retrieval and data dissemination axis of the ESIS system. The others are formed by the ESIS Correlation Environment (ESIS CE) and the ESIS Information Services. The ESIS QE Pilot Project is carried out for the European Space Agency's Research and Information center, ESRIN, by a Consortium consisting of Computer Resources International, Denmark, CISET S.p.a, Italy, the University of Strasbourg, France and the Rutherford Appleton Laboratories in the U.K. Furthermore numerous scientists both within ESA and space science community in Europe have been involved in

  8. SkyQuery - A Prototype Distributed Query and Cross-Matching Web Service for the Virtual Observatory

    NASA Astrophysics Data System (ADS)

    Thakar, A. R.; Budavari, T.; Malik, T.; Szalay, A. S.; Fekete, G.; Nieto-Santisteban, M.; Haridas, V.; Gray, J.

    2002-12-01

    We have developed a prototype distributed query and cross-matching service for the VO community, called SkyQuery, which is implemented with hierarchichal Web Services. SkyQuery enables astronomers to run combined queries on existing distributed heterogeneous astronomy archives. SkyQuery provides a simple, user-friendly interface to run distributed queries over the federation of registered astronomical archives in the VO. The SkyQuery client connects to the portal Web Service, which farms the query out to the individual archives, which are also Web Services called SkyNodes. The cross-matching algorithm is run recursively on each SkyNode. Each archive is a relational DBMS with a HTM index for fast spatial lookups. The results of the distributed query are returned as an XML DataSet that is automatically rendered by the client. SkyQuery also returns the image cutout corresponding to the query result. SkyQuery finds not only matches between the various catalogs, but also dropouts - objects that exist in some of the catalogs but not in others. This is often as important as finding matches. We demonstrate the utility of SkyQuery with a brown-dwarf search between SDSS and 2MASS, and a search for radio-quiet quasars in SDSS, 2MASS and FIRST. The importance of a service like SkyQuery for the worldwide astronomical community cannot be overstated: data on the same objects in various archives is mapped in different wavelength ranges and looks very different due to different errors, instrument sensitivities and other peculiarities of each archive. Our cross-matching algorithm preforms a fuzzy spatial join across multiple catalogs. This type of cross-matching is currently often done by eye, one object at a time. A static cross-identification table for a set of archives would become obsolete by the time it was built - the exponential growth of astronomical data means that a dynamic cross-identification mechanism like SkyQuery is the only viable option. SkyQuery was funded by a

  9. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... HANDLING OF SPEARMINT OIL PRODUCED IN THE FAR WEST Order Regulating Handling Definitions § 985.12 Salable quantity. Salable quantity means the total quantity of each class of oil which handlers may purchase...

  10. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... HANDLING OF SPEARMINT OIL PRODUCED IN THE FAR WEST Order Regulating Handling Definitions § 985.12 Salable quantity. Salable quantity means the total quantity of each class of oil which handlers may purchase...

  11. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... HANDLING OF SPEARMINT OIL PRODUCED IN THE FAR WEST Order Regulating Handling Definitions § 985.12 Salable quantity. Salable quantity means the total quantity of each class of oil which handlers may purchase...

  12. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... HANDLING OF SPEARMINT OIL PRODUCED IN THE FAR WEST Order Regulating Handling Definitions § 985.12 Salable quantity. Salable quantity means the total quantity of each class of oil which handlers may purchase...

  13. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... HANDLING OF SPEARMINT OIL PRODUCED IN THE FAR WEST Order Regulating Handling Definitions § 985.12 Salable quantity. Salable quantity means the total quantity of each class of oil which handlers may purchase...

  14. Recognizing Prefixes in Scientific Quantities

    NASA Astrophysics Data System (ADS)

    Sokolowski, Andrzej

    2015-09-01

    Although recognizing prefixes in physical quantities is inherent for practitioners, it might not be inherent for students, who do not use prefixes in their everyday life experiences. This deficiency surfaces in AP Physics exams. For example, readers of an AP Physics exam reported "a common mistake of incorrectly converting nanometers to meters." Similar students' mistakes were reported also by AP Chemistry readers "as in previous years, students still had difficulty converting kJ to J." While traditional teaching focuses on memorizing the symbols of prefixes, little attention is given to helping learners recognize a prefix in a given quantity. I noticed in my teaching practice that by making the processes of identifying prefixes more explicit, students make fewer mistakes on unit conversion. Thus, this paper presents an outline of a lesson that focuses on prefix recognition. It is designed for a first-year college physics class; however, its key points can be addressed to any group of physics students.

  15. Characteristic quantities and dimensional analysis

    NASA Astrophysics Data System (ADS)

    Grimvall, Göran

    2008-04-01

    Phenomena in the physical sciences are described with quantities that have a numerical value and a dimension, i.e., a physical unit. Dimensional analysis is a powerful aspect of modeling and simulation. Characteristic quantities formed by a combination of model parameters can give new insights without detailed analytic or numerical calculations. Dimensional requirements lead to Buckingham’s Π theorem—a general mathematical structure of all models in physics. These aspects are illustrated with many examples of modeling, e.g., an elastic beam on supports, wave propagation on a liquid surface, the Lennard-Jones potential for the interaction between atoms, the Lindemann melting rule, and saturation phenomena in electrical and thermal conduction.

  16. Characteristic quantities and dimensional analysis

    NASA Astrophysics Data System (ADS)

    Grimvall, Göran

    Phenomena in the physical sciences are described with quantities that have a numerical value and a dimension, i.e., a physical unit. Dimensional analysis is a powerful aspect of modeling and simulation. Characteristic quantities formed by a combination of model parameters can give new insights without detailed analytic or numerical calculations. Dimensional requirements lead to Buckingham's Π theorem—a general mathematical structure of all models in physics. These aspects are illustrated with many examples of modeling, e.g., an elastic beam on supports, wave propagation on a liquid surface, the Lennard-Jones potential for the interaction between atoms, the Lindemann melting rule, and saturation phenomena in electrical and thermal conduction.

  17. The Imposed Query: Implications for Library Service Evaluation.

    ERIC Educational Resources Information Center

    Gross, Melissa

    1998-01-01

    Explores the potential impact of imposed query, a new model of information-seeking behavior, on current approaches to library service and system evaluation. Discusses reference service evaluation, user studies, output measures, and relevance as an evaluation tool. Argues that imposed query broadens understanding of the user and of the role that…

  18. Structural Query Optimization in Native XML Databases: A Hybrid Approach

    NASA Astrophysics Data System (ADS)

    Haw, Su-Cheng; Lee, Chien-Sing

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

  19. 28 CFR 25.7 - Querying records in the system.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 28 Judicial Administration 1 2010-07-01 2010-07-01 false Querying records in the system. 25.7 Section 25.7 Judicial Administration DEPARTMENT OF JUSTICE DEPARTMENT OF JUSTICE INFORMATION SYSTEMS The National Instant Criminal Background Check System § 25.7 Querying records in the system. (a) The...

  20. 28 CFR 25.7 - Querying records in the system.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 28 Judicial Administration 1 2014-07-01 2014-07-01 false Querying records in the system. 25.7 Section 25.7 Judicial Administration DEPARTMENT OF JUSTICE DEPARTMENT OF JUSTICE INFORMATION SYSTEMS The National Instant Criminal Background Check System § 25.7 Querying records in the system. (a) The...

  1. 28 CFR 25.7 - Querying records in the system.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 28 Judicial Administration 1 2013-07-01 2013-07-01 false Querying records in the system. 25.7 Section 25.7 Judicial Administration DEPARTMENT OF JUSTICE DEPARTMENT OF JUSTICE INFORMATION SYSTEMS The National Instant Criminal Background Check System § 25.7 Querying records in the system. (a) The...

  2. 28 CFR 25.7 - Querying records in the system.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 28 Judicial Administration 1 2012-07-01 2012-07-01 false Querying records in the system. 25.7 Section 25.7 Judicial Administration DEPARTMENT OF JUSTICE DEPARTMENT OF JUSTICE INFORMATION SYSTEMS The National Instant Criminal Background Check System § 25.7 Querying records in the system. (a) The...

  3. 28 CFR 25.7 - Querying records in the system.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 28 Judicial Administration 1 2011-07-01 2011-07-01 false Querying records in the system. 25.7 Section 25.7 Judicial Administration DEPARTMENT OF JUSTICE DEPARTMENT OF JUSTICE INFORMATION SYSTEMS The National Instant Criminal Background Check System § 25.7 Querying records in the system. (a) The...

  4. Query Classification and Study of University Students' Search Trends

    ERIC Educational Resources Information Center

    Maabreh, Majdi A.; Al-Kabi, Mohammed N.; Alsmadi, Izzat M.

    2012-01-01

    Purpose: This study is an attempt to develop an automatic identification method for Arabic web queries and divide them into several query types using data mining. In addition, it seeks to evaluate the impact of the academic environment on using the internet. Design/methodology/approach: The web log files were collected from one of the higher…

  5. A Typed Text Retrieval Query Language for XML Documents.

    ERIC Educational Resources Information Center

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

    2002-01-01

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

  6. An Experimental Investigation of Complexity in Database Query Formulation Tasks

    ERIC Educational Resources Information Center

    Casterella, Gretchen Irwin; Vijayasarathy, Leo

    2013-01-01

    Information Technology professionals and other knowledge workers rely on their ability to extract data from organizational databases to respond to business questions and support decision making. Structured query language (SQL) is the standard programming language for querying data in relational databases, and SQL skills are in high demand and are…

  7. Multidimensional indexing structure for use with linear optimization queries

    NASA Technical Reports Server (NTRS)

    Bergman, Lawrence David (Inventor); Castelli, Vittorio (Inventor); Chang, Yuan-Chi (Inventor); Li, Chung-Sheng (Inventor); Smith, John Richard (Inventor)

    2002-01-01

    Linear optimization queries, which usually arise in various decision support and resource planning applications, are queries that retrieve top N data records (where N is an integer greater than zero) which satisfy a specific optimization criterion. The optimization criterion is to either maximize or minimize a linear equation. The coefficients of the linear equation are given at query time. Methods and apparatus are disclosed for constructing, maintaining and utilizing a multidimensional indexing structure of database records to improve the execution speed of linear optimization queries. Database records with numerical attributes are organized into a number of layers and each layer represents a geometric structure called convex hull. Such linear optimization queries are processed by searching from the outer-most layer of this multi-layer indexing structure inwards. At least one record per layer will satisfy the query criterion and the number of layers needed to be searched depends on the spatial distribution of records, the query-issued linear coefficients, and N, the number of records to be returned. When N is small compared to the total size of the database, answering the query typically requires searching only a small fraction of all relevant records, resulting in a tremendous speedup as compared to linearly scanning the entire dataset.

  8. Characteristics of Question Format Web Queries: An Exploratory Study.

    ERIC Educational Resources Information Center

    Spink, Amanda; Ozmutlu, H. Cenk

    2002-01-01

    Provides results from a study that examined queries in question format submitted to two Web search engines, Ask Jeeves and Excite. Identifies four types of user Web queries: keyword, Boolean, question, and request; discusses implications for Web search services; and suggests further research needs. (Author/LRW)

  9. Hierarchical Clustering and Visualization of Aggregate Cyber Data

    SciTech Connect

    Patton, Robert M; Beaver, Justin M; Steed, Chad A; Potok, Thomas E; Treadwell, Jim N

    2011-01-01

    Most commercial intrusion detections systems (IDS) can produce a very high volume of alerts, and are typically plagued by a high false positive rate. The approach described here uses Splunk to aggregate IDS alerts. The aggregated IDS alerts are retrieved from Splunk programmatically and are then clustered using text analysis and visualized using a sunburst diagram to provide an additional understanding of the data. The equivalent of what the cluster analysis and visualization provides would require numerous detailed queries using Splunk and considerable manual effort.

  10. A specialist’s audit of aggregated occurrence records

    PubMed Central

    Mesibov, Robert

    2013-01-01

    Abstract Occurrence records for named, native Australian millipedes from the Global Biodiversity Information Facility (GBIF) and the Atlas of Living Australia (ALA) were compared with the same records from the Millipedes of Australia (MoA) website, compiled independently by the author. The comparison revealed some previously unnoticed errors in MoA, and a much larger number of errors and other problems in the aggregated datasets. Errors have been corrected in MoA and in some data providers’ databases, but will remain in GBIF and ALA until data providers have supplied updates to these aggregators. An audit by a specialist volunteer, as reported here, is not a common occurrence. It is suggested that aggregators should do more, or more effective, data checking and should query data providers when possible errors are detected, rather than simply disclaim responsibility for aggregated content. PMID:23794864

  11. Pareto-depth for multiple-query image retrieval.

    PubMed

    Hsiao, Ko-Jen; Calder, Jeff; Hero, Alfred O

    2015-02-01

    Most content-based image retrieval systems consider either one single query, or multiple queries that include the same object or represent the same semantic information. In this paper, we consider the content-based image retrieval problem for multiple query images corresponding to different image semantics. We propose a novel multiple-query information retrieval algorithm that combines the Pareto front method with efficient manifold ranking. We show that our proposed algorithm outperforms state of the art multiple-query retrieval algorithms on real-world image databases. We attribute this performance improvement to concavity properties of the Pareto fronts, and prove a theoretical result that characterizes the asymptotic concavity of the fronts. PMID:25494509

  12. Processing SPARQL queries with regular expressions in RDF databases

    PubMed Central

    2011-01-01

    Background As the Resource Description Framework (RDF) data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf) or Bio2RDF (bio2rdf.org), SPARQL - a W3C recommendation query for RDF databases - has become an important query language for querying the bioinformatics knowledge bases. Moreover, due to the diversity of users’ requests for extracting information from the RDF data as well as the lack of users’ knowledge about the exact value of each fact in the RDF databases, it is desirable to use the SPARQL query with regular expression patterns for querying the RDF data. To the best of our knowledge, there is currently no work that efficiently supports regular expression processing in SPARQL over RDF databases. Most of the existing techniques for processing regular expressions are designed for querying a text corpus, or only for supporting the matching over the paths in an RDF graph. Results In this paper, we propose a novel framework for supporting regular expression processing in SPARQL query. Our contributions can be summarized as follows. 1) We propose an efficient framework for processing SPARQL queries with regular expression patterns in RDF databases. 2) We propose a cost model in order to adapt the proposed framework in the existing query optimizers. 3) We build a prototype for the proposed framework in C++ and conduct extensive experiments demonstrating the efficiency and effectiveness of our technique. Conclusions Experiments with a full-blown RDF engine show that our framework outperforms the existing ones by up to two orders of magnitude in processing SPARQL queries with regular expression patterns. PMID:21489225

  13. Collision simulation of sintered dust aggregates

    NASA Astrophysics Data System (ADS)

    Sirono, Sin-iti; Ueno, Haruta

    Collisional evolution of dust aggregates is the initial process of the planet formation. Sticking velocity, below which collisional sticking of an aggregate happens, is a crucial quantity in the collisional evolution. In the standard model of protoplanetary nebula, the maximum collisional velocity is around 50m/s. Therefore, if a planetesimal is formed through direct collisional sticking, the sticking velocity should be higher than 50m/s. Even if a planetesimal is formed by other mechanism such as anticyclonic vortices, substantial growth of an aggregate is required because the motion of an aggregate should be decoupled from that of gas. Collisional simulation of icy dust aggregates (Wada et al. 2009, ApJ 702, 1490) showed that the sticking velocity was larger than 50m/s and planetesimal formation by collisional sticking was possible. However, sintering of ice proceeds in a wide area of a protoplanetary nebula (Sirono 2011, ApJ 765, 50). Sintering enlarges a neck, connection between adjacent dust grains, and changes the mechanical properties of a dust aggregate. Here we performed collisional simulations between sintered dust aggregates taking account of sintering. We found that the sticking velocity was decreased substantially down to 20m/s. This result suggests that a planetesimal is not formed by direct collisional sticking and that the planetesimal formation proceeded in particular regions in a protoplanetary nebula.

  14. Chapter 36: The Astronomical Dataset Query Language (ADQL)

    NASA Astrophysics Data System (ADS)

    Plante, R.

    The Astronomical Dataset Query Language (ADQL) is an SQL-like language searching for astronomical tables or other datasets as if they were tables. This standard language is at the center of two important query services: SkyNode is a standard service interface for querying a single set of catalogs at one site, and the Open SkyQuery Portal is a service that uses ADQL to query across all known SkyNode services. Its history came out of a project called SkyQuery at Johns Hopkins University which produced a web-based service that could crossmatch astronomical objects from multiple, massive catalogs (such as SDSS, 2MASS, and FIRST) that are distributed over the network (Budävari et al. 2003). This project eventually evolved into the Open SkyQuery project within the IVOA, and one of the offshoots of this work was a new standard language for querying tables called ADQL. In this chapter, we will look at the ADQL syntax and learn how to make practical use of it. What you will get out of this chapter (most often in combination with other chapters referenced here) will depend on how you expect to use ADQL. If you are a general VO user, you will primarily find yourself using ADQL through a portal interface to search catalogs in pursuit of science. For you, the goals of this chapter are to be able to create original ADQL queries using the Open SkyQuery Portal and, in particular, to use ADQL to crossmatch sources from two catalogs. If you are a "scripter", a user capable of creating custom scripts to do VO research, you may find it useful to use client libraries to query distributed catalogs. If you are a data provider, then you might be interested in deploying a service that uses ADQL (e.g. a SkyNode service). For scripters and data providers alike, our goals are to understand the role of the two formats for ADQL in supporting query web services and to see how the language will eventually be used with other services beyond SkyNodes. If you are a developer, you may wish to

  15. Query by image example: The CANDID approach

    SciTech Connect

    Kelly, P.M.; Cannon, M.; Hush, D.R.

    1995-02-01

    CANDID (Comparison Algorithm for Navigating Digital Image Databases) was developed to enable content-based retrieval of digital imagery from large databases using a query-by-example methodology. A user provides an example image to the system, and images in the database that are similar to that example are retrieved. The development of CANDID was inspired by the N-gram approach to document fingerprinting, where a ``global signature`` is computed for every document in a database and these signatures are compared to one another to determine the similarity between any two documents. CANDID computes a global signature for every image in a database, where the signature is derived from various image features such as localized texture, shape, or color information. A distance between probability density functions of feature vectors is then used to compare signatures. In this paper, the authors present CANDID and highlight two results from their current research: subtracting a ``background`` signature from every signature in a database in an attempt to improve system performance when using inner-product similarity measures, and visualizing the contribution of individual pixels in the matching process. These ideas are applicable to any histogram-based comparison technique.

  16. Query-Driven Visualization and Analysis

    SciTech Connect

    Ruebel, Oliver; Bethel, E. Wes; Prabhat, Mr.; Wu, Kesheng

    2012-11-01

    This report focuses on an approach to high performance visualization and analysis, termed query-driven visualization and analysis (QDV). QDV aims to reduce the amount of data that needs to be processed by the visualization, analysis, and rendering pipelines. The goal of the data reduction process is to separate out data that is "scientifically interesting'' and to focus visualization, analysis, and rendering on that interesting subset. The premise is that for any given visualization or analysis task, the data subset of interest is much smaller than the larger, complete data set. This strategy---extracting smaller data subsets of interest and focusing of the visualization processing on these subsets---is complementary to the approach of increasing the capacity of the visualization, analysis, and rendering pipelines through parallelism. This report discusses the fundamental concepts in QDV, their relationship to different stages in the visualization and analysis pipelines, and presents QDV's application to problems in diverse areas, ranging from forensic cybersecurity to high energy physics.

  17. Platelet aggregation test

    MedlinePlus

    ... this page: //medlineplus.gov/ency/article/003669.htm Platelet aggregation test To use the sharing features on this page, please enable JavaScript. The platelet aggregation blood test checks how well platelets , a ...

  18. Thermodynamics of Protein Aggregation

    NASA Astrophysics Data System (ADS)

    Osborne, Kenneth L.; Barz, Bogdan; Bachmann, Michael; Strodel, Birgit

    Amyloid protein aggregation characterizes many neurodegenerative disorders, including Alzheimer's, Parkinson's, and Creutz- feldt-Jakob disease. Evidence suggests that amyloid aggregates may share similar aggregation pathways, implying simulation of full-length amyloid proteins is not necessary for understanding amyloid formation. In this study we simulate GNNQQNY, the N-terminal prion-determining domain of the yeast protein Sup35 to investigate the thermodynamics of structural transitions during aggregation. We use a coarse-grained model with replica-exchange molecular dynamics to investigate the association of 3-, 6-, and 12-chain GNNQQNY systems and we determine the aggregation pathway by studying aggregation states of GN- NQQNY. We find that the aggregation of the hydrophilic GNNQQNY sequence is mainly driven by H-bond formation, leading to the formation of /3-sheets from the very beginning of the assembly process. Condensation (aggregation) and ordering take place simultaneously, which is underpinned by the occurrence of a single heat capacity peak only.

  19. Platelet aggregation test

    MedlinePlus

    The platelet aggregation blood test checks how well platelets , a part of blood, clump together and cause blood to clot. ... Decreased platelet aggregation may be due to: Autoimmune ... Fibrin degradation products Inherited platelet function defects ...

  20. Aggregate size distribution of the soil loss

    NASA Astrophysics Data System (ADS)

    Szabó, Judit Alexandra; Jakab, Gergely; Szabó, Boglárka; Józsa, Sándor; Szalai, Zoltán; Centeri, Csaba

    2016-04-01

    In agricultural areas the soil erosion and soil loss estimation is vital information in long-term planning. During the initial period of the erosion a part of the soil particles and aggregates get transportable and nutrients and organic matter could be transported due to the effect of water or wind. This preliminary phase was studied with laboratory-scale rainfall simulator. Developed surface crust and aggregate size composition of the runoff was examined in six different slope-roughness-moisture content combination of a Cambisol and a Regosol. The ratio of micro- and macro aggregates in the runoff indicate the stability of the aggregates and determine the transport capacity of the runoff. Both soil samples were taken from field where the water erosion is a potential hazard. During the experiment the whole amount of runoff and sediment was collected through sieve series to a bucket to separate the micro- and macro aggregates. In case of both samples the micro aggregates dominate in the runoff and the runoff rates are similar. Although the runoff of the Regosol - with dominant >1000μm macro aggregate content - contained almost nothing but <50μm sized micro aggregates. Meanwhile the runoff of the Cambisol - with more balanced micro and macro aggregate content - contained dominantly 50-250μm sized micro aggregates and in some case remarkable ratio 250-1000μm sized macro aggregates. This difference occurred because the samples are resistant against drop erosion differently. In case of both sample the selectivity of the erosion and substance matrix redistribution manifested in mineral crusts in the surface where the quartz deposited in place while the lighter organic matter transported with the sediment. The detachment of the aggregates and the redistribution of the particles highly effect on the aggregate composition of the runoff which is connected with the quality of the soil loss. So while the estimation of soil loss quantity is more or less is easy, measuring

  1. Summarization of Text Document Using Query Dependent Parsing Techniques

    NASA Astrophysics Data System (ADS)

    Rokade, P. P.; Mrunal, Bewoor; Patil, S. H.

    2010-11-01

    World Wide Web is the largest source of information. Huge amount of data is present on the Web. There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (query result snippets) has become an important problem. In this paper a method to create query specific summaries by identifying the most query-relevant fragments and combining them using the semantic associations within the document is discussed. In particular, first a structure is added to the documents in the preprocessing stage and converts them to document graphs. The present research work focuses on analytical study of different document clustering and summarization techniques currently the most research is focused on Query-Independent summarization. The main aim of this research work is to combine the both approaches of document clustering and query dependent summarization. This mainly includes applying different clustering algorithms on a text document. Create a weighted document graph of the resulting graph based on the keywords. And obtain the document graph to get the summary of the document. The performance of the summary using different clustering techniques will be analyzed and the optimal approach will be suggested.

  2. A Relation Routing Scheme for Distributed Semantic Media Query

    PubMed Central

    Liao, Zhuhua; Zhang, Guoqiang; Yi, Aiping; Zhang, Guoqing; Liang, Wei

    2013-01-01

    Performing complex semantic queries over large-scale distributed media contents is a challenging task for rich media applications. The dynamics and openness of data sources make it uneasy to realize a query scheme that simultaneously achieves precision, scalability, and reliability. In this paper, a novel relation routing scheme (RRS) is proposed by renovating the routing model of Content Centric Network (CCN) for directly querying large-scale semantic media content. By using proper query model and routing mechanism, semantic queries with complex relation constrains from users can be guided towards potential media sources through semantic guider nodes. The scattered and fragmented query results can be integrated on their way back for semantic needs or to avoid duplication. Several new techniques, such as semantic-based naming, incomplete response avoidance, timeout checking, and semantic integration, are developed in this paper to improve the accuracy, efficiency, and practicality of the proposed approach. Both analytical and experimental results show that the proposed scheme is a promising and effective solution for complex semantic queries and integration over large-scale networks. PMID:24319383

  3. Balancing Teacher Quality and Quantity

    NASA Astrophysics Data System (ADS)

    Bond, Helen

    The world is facing a shortage of trained teachers. According to the 2010 Global Monitoring Report approximately 10.3 million teachers will be needed globally to staff classrooms from Bangkok to Canada. The situation is worse in Sub-Saharan Africa. Estimates suggest that approximately 1.2 million new teachers will be needed in Sub-Saharan Africa alone to achieve universal primary education goals by 2015. Increases in primary school enrollments, drought, and HIV-AIDS have exacerbated the need for well trained teachers. Despite the need, the focus is on balancing quality with quantity. An effective teacher is deemed a critical element, although not the only one, in a student's success in the classroom. This paper focuses on the dilemma of meeting universal primary education goals in Sub-Saharan Africa, while maintaining teacher quality in fragile contexts.

  4. Quantity Discrimination in Domestic Rats, Rattus norvegicus

    PubMed Central

    Cox, Laura; Montrose, V. Tamara

    2016-01-01

    Simple Summary Quantity discrimination involves distinguishing which of two quantities is greater. This discrimination between larger and smaller quantities has only been demonstrated in rats post extensive training. We tested whether domestic rats could perform quantity discrimination without explicit training. We found that rats could distinguish the greater amount in comparisons of 1 vs. 2, 2 vs. 3, 3 vs. 5, 3 vs. 8, 4 vs. 6, and 4 vs. 8. Rats could not distinguish between 3 vs. 4, 4 vs. 5 and 5 vs. 6. We also found that as the ratio between quantities became finer the choice of the larger quantity decreased. We conclude that rats can perform quantity discrimination without extensive training and that their quantity discrimination ability is influenced by the ratio between quantities. Abstract Quantity discrimination is a basic form of numerical competence where an animal distinguishes which of two amounts is greater in size. Whilst quantity discrimination in rats has been investigated via training paradigms, rats’ natural quantity discrimination abilities without explicit training for a desired response have not been explored. This study investigated domestic rats’ ability to perform quantity discrimination. Domestic rats (n = 12) were examined for their ability to distinguish the larger amount under nine quantity comparisons. One-sample t-tests identified a significant preference for the larger quantity in comparisons of 1 vs. 2, 2 vs. 3, 3 vs. 5, 3 vs. 8, 4 vs. 6, and 4 vs. 8. No preference between quantities was found for comparisons of 3 vs. 4, 4 vs. 5 and 5 vs. 6. Overall, this study drew two key conclusions. Firstly, that domestic rats are capable of performing quantity discrimination without extensive training. Secondly, as subjects adhered to Weber’s law, it was concluded that the approximate number system underpins domestic rats’ ability to perform spontaneous quantity discrimination. PMID:27527223

  5. Design of FastQuery: How to Generalize Indexing and Querying System for Scientific Data

    SciTech Connect

    Wu, Jerry; Wu, Kesheng

    2011-04-18

    Modern scientific datasets present numerous data management and analysis challenges. State-of-the-art index and query technologies such as FastBit are critical for facilitating interactive exploration of large datasets. These technologies rely on adding auxiliary information to existing datasets to accelerate query processing. To use these indices, we need to match the relational data model used by the indexing systems with the array data model used by most scientific data, and to provide an efficient input and output layer for reading and writing the indices. In this work, we present a flexible design that can be easily applied to most scientific data formats. We demonstrate this flexibility by applying it to two of the most commonly used scientific data formats, HDF5 and NetCDF. We present two case studies using simulation data from the particle accelerator and climate simulation communities. To demonstrate the effectiveness of the new design, we also present a detailed performance study using both synthetic and real scientific workloads.

  6. HDF5-FastQuery: An API for Simplifying Access to Data Storage,Retrieval, Indexing and Querying

    SciTech Connect

    Bethel, E. Wes; Gosink, Luke; Shalf, John; Stockinger, Kurt; Wu,Kesheng

    2006-06-15

    This work focuses on research and development activities that bridge a gap between fundamental data management technology index, query, storage and retrieval and use of such technology in computational and computer science algorithms and applications. The work has resulted in a streamlined applications programming interface (API) that simplifies data storage and retrieval using the HDF5 data I/O library, and eases use of the FastBit compressed bitmap indexing software for data indexing/querying. The API, which we call HDF5-FastQuery, will have broad applications in domain sciences as well as associated data analysis and visualization applications.

  7. Parasol: An Architecture for Cross-Cloud Federated Graph Querying

    SciTech Connect

    Lieberman, Michael; Choudhury, Sutanay; Hughes, Marisa; Patrone, Dennis; Hider, Sandy; Piatko, Christine; Chapman, Matthew; Marple, JP; Silberberg, David

    2014-06-22

    Large scale data fusion of multiple datasets can often provide in- sights that examining datasets individually cannot. However, when these datasets reside in different data centers and cannot be collocated due to technical, administrative, or policy barriers, a unique set of problems arise that hamper querying and data fusion. To ad- dress these problems, a system and architecture named Parasol is presented that enables federated queries over graph databases residing in multiple clouds. Parasol’s design is flexible and requires only minimal assumptions for participant clouds. Query optimization techniques are also described that are compatible with Parasol’s lightweight architecture. Experiments on a prototype implementation of Parasol indicate its suitability for cross-cloud federated graph queries.

  8. Using MPEG-7 audio descriptors for music querying

    NASA Astrophysics Data System (ADS)

    Gruhne, M.; Dittmar, C.

    2006-08-01

    Due to the growing amount of digital audio an increasing need to automatically categorize music and to create self-controlled and suitable playlists has been emerged. A few approaches to this task relying on low-level features have been published so far. Unfortunately the results utilizing those technologies are not sufficient yet. This paper gives an introduction how to enhance the results with regard to the perceptual similarity using different high-level descriptors and a powerful interaction between the algorithm and the user to consider his preferences. A successful interaction between server and client requires a powerful standardized query language. This paper describes the tools of the MPEG-7 Audio standard in detail and gives examples of already established query languages. Furthermore the requirements of a multimedia query language are identified and its application is exemplified by an automatic audio creation system using a query language.

  9. Data Processing on Database Management Systems with Fuzzy Query

    NASA Astrophysics Data System (ADS)

    Şimşek, Irfan; Topuz, Vedat

    In this study, a fuzzy query tool (SQLf) for non-fuzzy database management systems was developed. In addition, samples of fuzzy queries were made by using real data with the tool developed in this study. Performance of SQLf was tested with the data about the Marmara University students' food grant. The food grant data were collected in MySQL database by using a form which had been filled on the web. The students filled a form on the web to describe their social and economical conditions for the food grant request. This form consists of questions which have fuzzy and crisp answers. The main purpose of this fuzzy query is to determine the students who deserve the grant. The SQLf easily found the eligible students for the grant through predefined fuzzy values. The fuzzy query tool (SQLf) could be used easily with other database system like ORACLE and SQL server.

  10. A Semantic Basis for Proof Queries and Transformations

    NASA Technical Reports Server (NTRS)

    Aspinall, David; Denney, Ewen W.; Luth, Christoph

    2013-01-01

    We extend the query language PrQL, designed for inspecting machine representations of proofs, to also allow transformation of proofs. PrQL natively supports hiproofs which express proof structure using hierarchically nested labelled trees, which we claim is a natural way of taming the complexity of huge proofs. Query-driven transformations enable manipulation of this structure, in particular, to transform proofs produced by interactive theorem provers into forms that assist their understanding, or that could be consumed by other tools. In this paper we motivate and define basic transformation operations, using an abstract denotational semantics of hiproofs and queries. This extends our previous semantics for queries based on syntactic tree representations.We define update operations that add and remove sub-proofs, and manipulate the hierarchy to group and ungroup nodes. We show that

  11. 16 CFR 500.19 - Conversion of SI metric quantities to inch/pound quantities and inch/pound quantities to SI...

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    .../pound quantities and inch/pound quantities to SI metric quantities. 500.19 Section 500.19 Commercial... LABELING ACT § 500.19 Conversion of SI metric quantities to inch/pound quantities and inch/pound quantities to SI metric quantities. (a) For calculating the conversion of SI metric quantities to...

  12. Protein aggregate turbidity: Simulation of turbidity profiles for mixed-aggregation reactions.

    PubMed

    Hall, Damien; Zhao, Ran; Dehlsen, Ian; Bloomfield, Nathaniel; Williams, Steven R; Arisaka, Fumio; Goto, Yuji; Carver, John A

    2016-04-01

    Due to their colloidal nature, all protein aggregates scatter light in the visible wavelength region when formed in aqueous solution. This phenomenon makes solution turbidity, a quantity proportional to the relative loss in forward intensity of scattered light, a convenient method for monitoring protein aggregation in biochemical assays. Although turbidity is often taken to be a linear descriptor of the progress of aggregation reactions, this assumption is usually made without performing the necessary checks to provide it with a firm underlying basis. In this article, we outline utilitarian methods for simulating the turbidity generated by homogeneous and mixed-protein aggregation reactions containing fibrous, amorphous, and crystalline structures. The approach is based on a combination of Rayleigh-Gans-Debye theory and approximate forms of the Mie scattering equations. PMID:26763936

  13. Matching health information seekers' queries to medical terms

    PubMed Central

    2012-01-01

    Background The Internet is a major source of health information but most seekers are not familiar with medical vocabularies. Hence, their searches fail due to bad query formulation. Several methods have been proposed to improve information retrieval: query expansion, syntactic and semantic techniques or knowledge-based methods. However, it would be useful to clean those queries which are misspelled. In this paper, we propose a simple yet efficient method in order to correct misspellings of queries submitted by health information seekers to a medical online search tool. Methods In addition to query normalizations and exact phonetic term matching, we tested two approximate string comparators: the similarity score function of Stoilos and the normalized Levenshtein edit distance. We propose here to combine them to increase the number of matched medical terms in French. We first took a sample of query logs to determine the thresholds and processing times. In the second run, at a greater scale we tested different combinations of query normalizations before or after misspelling correction with the retained thresholds in the first run. Results According to the total number of suggestions (around 163, the number of the first sample of queries), at a threshold comparator score of 0.3, the normalized Levenshtein edit distance gave the highest F-Measure (88.15%) and at a threshold comparator score of 0.7, the Stoilos function gave the highest F-Measure (84.31%). By combining Levenshtein and Stoilos, the highest F-Measure (80.28%) is obtained with 0.2 and 0.7 thresholds respectively. However, queries are composed by several terms that may be combination of medical terms. The process of query normalization and segmentation is thus required. The highest F-Measure (64.18%) is obtained when this process is realized before spelling-correction. Conclusions Despite the widely known high performance of the normalized edit distance of Levenshtein, we show in this paper that its

  14. A Method of Data Aggregation for Wearable Sensor Systems.

    PubMed

    Shen, Bo; Fu, Jun-Song

    2016-01-01

    Data aggregation has been considered as an effective way to decrease the data to be transferred in sensor networks. Particularly for wearable sensor systems, smaller battery has less energy, which makes energy conservation in data transmission more important. Nevertheless, wearable sensor systems usually have features like frequently dynamic changes of topologies and data over a large range, of which current aggregating methods can't adapt to the demand. In this paper, we study the system composed of many wearable devices with sensors, such as the network of a tactical unit, and introduce an energy consumption-balanced method of data aggregation, named LDA-RT. In the proposed method, we develop a query algorithm based on the idea of 'happened-before' to construct a dynamic and energy-balancing routing tree. We also present a distributed data aggregating and sorting algorithm to execute top-k query and decrease the data that must be transferred among wearable devices. Combining these algorithms, LDA-RT tries to balance the energy consumptions for prolonging the lifetime of wearable sensor systems. Results of evaluation indicate that LDA-RT performs well in constructing routing trees and energy balances. It also outperforms the filter-based top-k monitoring approach in energy consumption, load balance, and the network's lifetime, especially for highly dynamic data sources. PMID:27347953

  15. A Method of Data Aggregation for Wearable Sensor Systems

    PubMed Central

    Shen, Bo; Fu, Jun-Song

    2016-01-01

    Data aggregation has been considered as an effective way to decrease the data to be transferred in sensor networks. Particularly for wearable sensor systems, smaller battery has less energy, which makes energy conservation in data transmission more important. Nevertheless, wearable sensor systems usually have features like frequently dynamic changes of topologies and data over a large range, of which current aggregating methods can’t adapt to the demand. In this paper, we study the system composed of many wearable devices with sensors, such as the network of a tactical unit, and introduce an energy consumption-balanced method of data aggregation, named LDA-RT. In the proposed method, we develop a query algorithm based on the idea of ‘happened-before’ to construct a dynamic and energy-balancing routing tree. We also present a distributed data aggregating and sorting algorithm to execute top-k query and decrease the data that must be transferred among wearable devices. Combining these algorithms, LDA-RT tries to balance the energy consumptions for prolonging the lifetime of wearable sensor systems. Results of evaluation indicate that LDA-RT performs well in constructing routing trees and energy balances. It also outperforms the filter-based top-k monitoring approach in energy consumption, load balance, and the network’s lifetime, especially for highly dynamic data sources. PMID:27347953

  16. A distributed query execution engine of big attributed graphs.

    PubMed

    Batarfi, Omar; Elshawi, Radwa; Fayoumi, Ayman; Barnawi, Ahmed; Sakr, Sherif

    2016-01-01

    A graph is a popular data model that has become pervasively used for modeling structural relationships between objects. In practice, in many real-world graphs, the graph vertices and edges need to be associated with descriptive attributes. Such type of graphs are referred to as attributed graphs. G-SPARQL has been proposed as an expressive language, with a centralized execution engine, for querying attributed graphs. G-SPARQL supports various types of graph querying operations including reachability, pattern matching and shortest path where any G-SPARQL query may include value-based predicates on the descriptive information (attributes) of the graph edges/vertices in addition to the structural predicates. In general, a main limitation of centralized systems is that their vertical scalability is always restricted by the physical limits of computer systems. This article describes the design, implementation in addition to the performance evaluation of DG-SPARQL, a distributed, hybrid and adaptive parallel execution engine of G-SPARQL queries. In this engine, the topology of the graph is distributed over the main memory of the underlying nodes while the graph data are maintained in a relational store which is replicated on the disk of each of the underlying nodes. DG-SPARQL evaluates parts of the query plan via SQL queries which are pushed to the underlying relational stores while other parts of the query plan, as necessary, are evaluated via indexless memory-based graph traversal algorithms. Our experimental evaluation shows the efficiency and the scalability of DG-SPARQL on querying massive attributed graph datasets in addition to its ability to outperform the performance of Apache Giraph, a popular distributed graph processing system, by orders of magnitudes. PMID:27350905

  17. High Performance Visualization using Query-Driven Visualizationand Analytics

    SciTech Connect

    Bethel, E. Wes; Campbell, Scott; Dart, Eli; Shalf, John; Stockinger, Kurt; Wu, Kesheng

    2006-06-15

    Query-driven visualization and analytics is a unique approach for high-performance visualization that offers new capabilities for knowledge discovery and hypothesis testing. The new capabilities akin to finding needles in haystacks are the result of combining technologies from the fields of scientific visualization and scientific data management. This approach is crucial for rapid data analysis and visualization in the petascale regime. This article describes how query-driven visualization is applied to a hero-sized network traffic analysis problem.

  18. Path Query Processing in Large-Scale XML Databases

    NASA Astrophysics Data System (ADS)

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

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

  19. Labeling RDF Graphs for Linear Time and Space Querying

    NASA Astrophysics Data System (ADS)

    Furche, Tim; Weinzierl, Antonius; Bry, François

    Indices and data structures for web querying have mostly considered tree shaped data, reflecting the view of XML documents as tree-shaped. However, for RDF (and when querying ID/IDREF constraints in XML) data is indisputably graph-shaped. In this chapter, we first study existing indexing and labeling schemes for RDF and other graph datawith focus on support for efficient adjacency and reachability queries. For XML, labeling schemes are an important part of the widespread adoption of XML, in particular for mapping XML to existing (relational) database technology. However, the existing indexing and labeling schemes for RDF (and graph data in general) sacrifice one of the most attractive properties of XML labeling schemes, the constant time (and per-node space) test for adjacency (child) and reachability (descendant). In the second part, we introduce the first labeling scheme for RDF data that retains this property and thus achieves linear time and space processing of acyclic RDF queries on a significantly larger class of graphs than previous approaches (which are mostly limited to tree-shaped data). Finally, we show how this labeling scheme can be applied to (acyclic) SPARQL queries to obtain an evaluation algorithm with time and space complexity linear in the number of resources in the queried RDF graph.

  20. Improving query services of web map by web mining

    NASA Astrophysics Data System (ADS)

    Huang, Maojun

    2007-11-01

    Web map is the hybrid of map and the World Wide Web (known as Web). It is usually created with WebGIS techniques. With the rapid social development, web maps oriented the public are facing pressure that dissatisfy the increased demanding. The geocoding database plays a key role in supporting query services effectively. The traditional geocoding method is laborious and time-consuming. And there is much online spatial information, which would be the supplementary information source for geocoding. Therefore, this paper discusses how to improve query services by web mining. The improvement can be described from three facets: first, improving location query by discovering and extracting address information from the Web to extend geocoding database. Second, enhancing the ability of optimum path query of public traffic and buffer query by spatial analyzing and reasoning on the extended geocoding database. Third, adjusting strategies of collecting data according to patterns discovered by web map query mining. Finally, this paper presents the designing of the application system and experimental results.

  1. Concept-based query language approach to enterprise information systems

    NASA Astrophysics Data System (ADS)

    Niemi, Timo; Junkkari, Marko; Järvelin, Kalervo

    2014-01-01

    In enterprise information systems (EISs) it is necessary to model, integrate and compute very diverse data. In advanced EISs the stored data often are based both on structured (e.g. relational) and semi-structured (e.g. XML) data models. In addition, the ad hoc information needs of end-users may require the manipulation of data-oriented (structural), behavioural and deductive aspects of data. Contemporary languages capable of treating this kind of diversity suit only persons with good programming skills. In this paper we present a concept-oriented query language approach to manipulate this diversity so that the programming skill requirements are considerably reduced. In our query language, the features which need technical knowledge are hidden in application-specific concepts and structures. Therefore, users need not be aware of the underlying technology. Application-specific concepts and structures are represented by the modelling primitives of the extended RDOOM (relational deductive object-oriented modelling) which contains primitives for all crucial real world relationships (is-a relationship, part-of relationship, association), XML documents and views. Our query language also supports intensional and extensional-intensional queries, in addition to conventional extensional queries. In its query formulation, the end-user combines available application-specific concepts and structures through shared variables.

  2. Representation and alignment of sung queries for music information retrieval

    NASA Astrophysics Data System (ADS)

    Adams, Norman H.; Wakefield, Gregory H.

    2005-09-01

    The pursuit of robust and rapid query-by-humming systems, which search melodic databases using sung queries, is a common theme in music information retrieval. The retrieval aspect of this database problem has received considerable attention, whereas the front-end processing of sung queries and the data structure to represent melodies has been based on musical intuition and historical momentum. The present work explores three time series representations for sung queries: a sequence of notes, a ``smooth'' pitch contour, and a sequence of pitch histograms. The performance of the three representations is compared using a collection of naturally sung queries. It is found that the most robust performance is achieved by the representation with highest dimension, the smooth pitch contour, but that this representation presents a formidable computational burden. For all three representations, it is necessary to align the query and target in order to achieve robust performance. The computational cost of the alignment is quadratic, hence it is necessary to keep the dimension small for rapid retrieval. Accordingly, iterative deepening is employed to achieve both robust performance and rapid retrieval. Finally, the conventional iterative framework is expanded to adapt the alignment constraints based on previous iterations, further expediting retrieval without degrading performance.

  3. Quantity Cognition: Numbers, Numerosity, Zero and Mathematics.

    PubMed

    Harvey, Ben M

    2016-05-23

    Physical quantities differ from abstract numbers and mathematics, but recent results are revealing the neural representation of both: a new study demonstrates how an absence of quantity is transformed into a representation of zero as a number. PMID:27218850

  4. Properties of acoustic energy quantities

    NASA Astrophysics Data System (ADS)

    Uosukainen, Seppo

    1989-09-01

    The sound power of a source is shown to depend on other sources and environment through the coherent and incoherent interaction and on the mounting conditions of the source. The conditions for a source to be a constant power source (being a rare exception amoung sound sources) are defined. A new quantity semianalytic intensity is defined. By its help the mean value, time-dependent, active and reactive intensity are defined in general time-dependent fields. In time harmonic fields the active part of the mean value intensity is rotational. The rotationality is proportional to the polarization vector of particle velocity, the polarization being elliptical in general. The changes of sound field are shown to generate rotationality in all intensity components. The negative pI-indicator is shown to be a possible indication of the rotationality of intensity. Fundamental intensity vortices are defined. The size of the lowest order vortices is of the order of 0.5 to 0.7 (Lambda). A modified J.M.C. method is developed for the basis of the vector and dyadic weighting, the former of which weights the sound pressure and particle velocity differently, and the latter also changes the polarization (or direction) of the particle velocity. Theoretical possibilities of general field modifications and acoustic sink optimization based on these new field reshapers are presented. A new field indicator for intensity measurements is defined. It can be used as a measure of the diffuseness and reactivity as a function of time and observation direction.

  5. Complex dynamics of our economic life on different scales: insights from search engine query data.

    PubMed

    Preis, Tobias; Reith, Daniel; Stanley, H Eugene

    2010-12-28

    Search engine query data deliver insight into the behaviour of individuals who are the smallest possible scale of our economic life. Individuals are submitting several hundred million search engine queries around the world each day. We study weekly search volume data for various search terms from 2004 to 2010 that are offered by the search engine Google for scientific use, providing information about our economic life on an aggregated collective level. We ask the question whether there is a link between search volume data and financial market fluctuations on a weekly time scale. Both collective 'swarm intelligence' of Internet users and the group of financial market participants can be regarded as a complex system of many interacting subunits that react quickly to external changes. We find clear evidence that weekly transaction volumes of S&P 500 companies are correlated with weekly search volume of corresponding company names. Furthermore, we apply a recently introduced method for quantifying complex correlations in time series with which we find a clear tendency that search volume time series and transaction volume time series show recurring patterns. PMID:21078644

  6. The DEDUCE Guided Query tool: providing simplified access to clinical data for research and quality improvement.

    PubMed

    Horvath, Monica M; Winfield, Stephanie; Evans, Steve; Slopek, Steve; Shang, Howard; Ferranti, Jeffrey

    2011-04-01

    In many healthcare organizations, comparative effectiveness research and quality improvement (QI) investigations are hampered by a lack of access to data created as a byproduct of patient care. Data collection often hinges upon either manual chart review or ad hoc requests to technical experts who support legacy clinical systems. In order to facilitate this needed capacity for data exploration at our institution (Duke University Health System), we have designed and deployed a robust Web application for cohort identification and data extraction--the Duke Enterprise Data Unified Content Explorer (DEDUCE). DEDUCE is envisioned as a simple, web-based environment that allows investigators access to administrative, financial, and clinical information generated during patient care. By using business intelligence tools to create a view into Duke Medicine's enterprise data warehouse, DEDUCE provides a Guided Query functionality using a wizard-like interface that lets users filter through millions of clinical records, explore aggregate reports, and, export extracts. Researchers and QI specialists can obtain detailed patient- and observation-level extracts without needing to understand structured query language or the underlying database model. Developers designing such tools must devote sufficient training and develop application safeguards to ensure that patient-centered clinical researchers understand when observation-level extracts should be used. This may mitigate the risk of data being misunderstood and consequently used in an improper fashion. PMID:21130181

  7. 48 CFR 36.516 - Quantity surveys.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 48 Federal Acquisition Regulations System 1 2014-10-01 2014-10-01 false Quantity surveys. 36.516... CONTRACTING CONSTRUCTION AND ARCHITECT-ENGINEER CONTRACTS Contract Clauses 36.516 Quantity surveys. The contracting officer may insert the clause at 52.236-16, Quantity Surveys, in solicitations and contracts...

  8. 48 CFR 36.516 - Quantity surveys.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Quantity surveys. 36.516... CONTRACTING CONSTRUCTION AND ARCHITECT-ENGINEER CONTRACTS Contract Clauses 36.516 Quantity surveys. The contracting officer may insert the clause at 52.236-16, Quantity Surveys, in solicitations and contracts...

  9. 48 CFR 36.516 - Quantity surveys.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 48 Federal Acquisition Regulations System 1 2013-10-01 2013-10-01 false Quantity surveys. 36.516... CONTRACTING CONSTRUCTION AND ARCHITECT-ENGINEER CONTRACTS Contract Clauses 36.516 Quantity surveys. The contracting officer may insert the clause at 52.236-16, Quantity Surveys, in solicitations and contracts...

  10. 48 CFR 36.516 - Quantity surveys.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 48 Federal Acquisition Regulations System 1 2011-10-01 2011-10-01 false Quantity surveys. 36.516... CONTRACTING CONSTRUCTION AND ARCHITECT-ENGINEER CONTRACTS Contract Clauses 36.516 Quantity surveys. The contracting officer may insert the clause at 52.236-16, Quantity Surveys, in solicitations and contracts...

  11. 48 CFR 36.516 - Quantity surveys.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 48 Federal Acquisition Regulations System 1 2012-10-01 2012-10-01 false Quantity surveys. 36.516... CONTRACTING CONSTRUCTION AND ARCHITECT-ENGINEER CONTRACTS Contract Clauses 36.516 Quantity surveys. The contracting officer may insert the clause at 52.236-16, Quantity Surveys, in solicitations and contracts...

  12. 40 CFR 201.21 - Quantities measured.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 40 Protection of Environment 25 2011-07-01 2011-07-01 false Quantities measured. 201.21 Section 201.21 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) NOISE ABATEMENT PROGRAMS... § 201.21 Quantities measured. The quantities to be measured under the test conditions described...

  13. 40 CFR 201.21 - Quantities measured.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 40 Protection of Environment 26 2013-07-01 2013-07-01 false Quantities measured. 201.21 Section 201.21 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) NOISE ABATEMENT PROGRAMS... § 201.21 Quantities measured. The quantities to be measured under the test conditions described...

  14. 40 CFR 201.21 - Quantities measured.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 40 Protection of Environment 24 2010-07-01 2010-07-01 false Quantities measured. 201.21 Section 201.21 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) NOISE ABATEMENT PROGRAMS... § 201.21 Quantities measured. The quantities to be measured under the test conditions described...

  15. 40 CFR 201.21 - Quantities measured.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 40 Protection of Environment 25 2014-07-01 2014-07-01 false Quantities measured. 201.21 Section 201.21 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) NOISE ABATEMENT PROGRAMS... § 201.21 Quantities measured. The quantities to be measured under the test conditions described...

  16. 40 CFR 201.21 - Quantities measured.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 40 Protection of Environment 26 2012-07-01 2011-07-01 true Quantities measured. 201.21 Section 201.21 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) NOISE ABATEMENT PROGRAMS... § 201.21 Quantities measured. The quantities to be measured under the test conditions described...

  17. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 30 Mineral Resources 1 2012-07-01 2012-07-01 false Air quantity. 75.325 Section 75.325 Mineral... SAFETY STANDARDS-UNDERGROUND COAL MINES Ventilation § 75.325 Air quantity. (a)(1) In bituminous and lignite mines the quantity of air shall be at least 3,000 cubic feet per minute reaching each working...

  18. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 30 Mineral Resources 1 2013-07-01 2013-07-01 false Air quantity. 75.325 Section 75.325 Mineral... SAFETY STANDARDS-UNDERGROUND COAL MINES Ventilation § 75.325 Air quantity. (a)(1) In bituminous and lignite mines the quantity of air shall be at least 3,000 cubic feet per minute reaching each working...

  19. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 30 Mineral Resources 1 2014-07-01 2014-07-01 false Air quantity. 75.325 Section 75.325 Mineral... SAFETY STANDARDS-UNDERGROUND COAL MINES Ventilation § 75.325 Air quantity. (a)(1) In bituminous and lignite mines the quantity of air shall be at least 3,000 cubic feet per minute reaching each working...

  20. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 30 Mineral Resources 1 2011-07-01 2011-07-01 false Air quantity. 75.325 Section 75.325 Mineral... SAFETY STANDARDS-UNDERGROUND COAL MINES Ventilation § 75.325 Air quantity. (a)(1) In bituminous and lignite mines the quantity of air shall be at least 3,000 cubic feet per minute reaching each working...

  1. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Air quantity. 75.325 Section 75.325 Mineral... SAFETY STANDARDS-UNDERGROUND COAL MINES Ventilation § 75.325 Air quantity. (a)(1) In bituminous and lignite mines the quantity of air shall be at least 3,000 cubic feet per minute reaching each working...

  2. Operational quantities and new approach by ICRU.

    PubMed

    2016-06-01

    The protection quantities, equivalent dose in a tissue or organ and effective dose, were developed by the International Commission on Radiological Protection (ICRP) to allow quantification of the extent of exposure of the human body to ionising radiation. These quantities are used for the implementation of limitation and optimisation principles. Body-related protection quantities are not measurable in practice. Therefore, the International Commission on Radiation Units and Measurements (ICRU) developed a set of operational dose quantities for use in radiation measurements for external exposure that can assess the protection quantities. The current ICRU operational quantities were defined more than 30 years ago. ICRU Report Committee 26 examined the rationale for the operational quantities, taking account of changes in the definitions of the protection quantities in ICRP's 2007 Recommendations. The considerations included the range of types and energies of particles contributing to exposure of workers and members of the public. ICRU Report Committee 26 investigated a set of alternative definitions for the operational quantities. The major change to the currently favoured set of quantities is redefinition of the operational quantities, from being based on doses at specific points in the ICRU sphere and soft tissue, to being based on particle fluence and conversion coefficients for effective dose and absorbed dose to the lens of the eye and local skin. PMID:26980797

  3. Patterns and Sequences of Multiple Query Reformulations in Web Searching: A Preliminary Study.

    ERIC Educational Resources Information Center

    Rieh, Soo Young; Xie, Hong

    2001-01-01

    Reports on patterns and sequences of query reformulation based on query logs from a Web search engine. Results show that while most query reformulation involves content changes, about 15% of reformulation is related to format modifications. Six patterns of query reformulation emerged as a result of sequence analysis: specified, parallel,…

  4. Parallel Index and Query for Large Scale Data Analysis

    SciTech Connect

    Chou, Jerry; Wu, Kesheng; Ruebel, Oliver; Howison, Mark; Qiang, Ji; Prabhat,; Austin, Brian; Bethel, E. Wes; Ryne, Rob D.; Shoshani, Arie

    2011-07-18

    Modern scientific datasets present numerous data management and analysis challenges. State-of-the-art index and query technologies are critical for facilitating interactive exploration of large datasets, but numerous challenges remain in terms of designing a system for process- ing general scientific datasets. The system needs to be able to run on distributed multi-core platforms, efficiently utilize underlying I/O infrastructure, and scale to massive datasets. We present FastQuery, a novel software framework that address these challenges. FastQuery utilizes a state-of-the-art index and query technology (FastBit) and is designed to process mas- sive datasets on modern supercomputing platforms. We apply FastQuery to processing of a massive 50TB dataset generated by a large scale accelerator modeling code. We demonstrate the scalability of the tool to 11,520 cores. Motivated by the scientific need to search for inter- esting particles in this dataset, we use our framework to reduce search time from hours to tens of seconds.

  5. Evaluation methodology for query-based scene understanding systems

    NASA Astrophysics Data System (ADS)

    Huster, Todd P.; Ross, Timothy D.; Culbertson, Jared L.

    2015-05-01

    In this paper, we are proposing a method for the principled evaluation of scene understanding systems in a query-based framework. We can think of a query-based scene understanding system as a generalization of typical sensor exploitation systems where instead of performing a narrowly defined task (e.g., detect, track, classify, etc.), the system can perform general user-defined tasks specified in a query language. Examples of this type of system have been developed as part of DARPA's Mathematics of Sensing, Exploitation, and Execution (MSEE) program. There is a body of literature on the evaluation of typical sensor exploitation systems, but the open-ended nature of the query interface introduces new aspects to the evaluation problem that have not been widely considered before. In this paper, we state the evaluation problem and propose an approach to efficiently learn about the quality of the system under test. We consider the objective of the evaluation to be to build a performance model of the system under test, and we rely on the principles of Bayesian experiment design to help construct and select optimal queries for learning about the parameters of that model.

  6. Ontology-based geospatial data query and integration

    USGS Publications Warehouse

    Zhao, T.; Zhang, C.; Wei, M.; Peng, Z.-R.

    2008-01-01

    Geospatial data sharing is an increasingly important subject as large amount of data is produced by a variety of sources, stored in incompatible formats, and accessible through different GIS applications. Past efforts to enable sharing have produced standardized data format such as GML and data access protocols such as Web Feature Service (WFS). While these standards help enabling client applications to gain access to heterogeneous data stored in different formats from diverse sources, the usability of the access is limited due to the lack of data semantics encoded in the WFS feature types. Past research has used ontology languages to describe the semantics of geospatial data but ontology-based queries cannot be applied directly to legacy data stored in databases or shapefiles, or to feature data in WFS services. This paper presents a method to enable ontology query on spatial data available from WFS services and on data stored in databases. We do not create ontology instances explicitly and thus avoid the problems of data replication. Instead, user queries are rewritten to WFS getFeature requests and SQL queries to database. The method also has the benefits of being able to utilize existing tools of databases, WFS, and GML while enabling query based on ontology semantics. ?? 2008 Springer-Verlag Berlin Heidelberg.

  7. Aggregations in Flatworms.

    ERIC Educational Resources Information Center

    Liffen, C. L.; Hunter, M.

    1980-01-01

    Described is a school project to investigate aggregations in flatworms which may be influenced by light intensity, temperature, and some form of chemical stimulus released by already aggregating flatworms. Such investigations could be adopted to suit many educational levels of science laboratory activities. (DS)

  8. Sociocultural dimensions of supply and demand for natural aggregate; examples from the Mid-Atlantic region, United States

    USGS Publications Warehouse

    Robinson, Gilpin R., Jr.; Brown, William M.

    2002-01-01

    The United States uses large quantities of natural aggregate to build and maintain a continuously expanding infrastructure. In recent years, per capita demand for aggregate in the United States has grown to about 9.7 metric tons (10.7 tons) per person per year. Over the next 25 years, the aggregate industry expects to mine quantities equivalent to all aggregate mined in the United States over the past 100 years. The issues surrounding supply and demand for aggregate in the mid-Atlantic states of Maryland, Pennsylvania, Virginia, and West Virginia illustrate competing requirements for industrial minerals and many simultaneous social and environmental objectives.

  9. Aggregated Indexing of Biomedical Time Series Data

    PubMed Central

    Woodbridge, Jonathan; Mortazavi, Bobak; Sarrafzadeh, Majid; Bui, Alex A.T.

    2016-01-01

    Remote and wearable medical sensing has the potential to create very large and high dimensional datasets. Medical time series databases must be able to efficiently store, index, and mine these datasets to enable medical professionals to effectively analyze data collected from their patients. Conventional high dimensional indexing methods are a two stage process. First, a superset of the true matches is efficiently extracted from the database. Second, supersets are pruned by comparing each of their objects to the query object and rejecting any objects falling outside a predetermined radius. This pruning stage heavily dominates the computational complexity of most conventional search algorithms. Therefore, indexing algorithms can be significantly improved by reducing the amount of pruning. This paper presents an online algorithm to aggregate biomedical times series data to significantly reduce the search space (index size) without compromising the quality of search results. This algorithm is built on the observation that biomedical time series signals are composed of cyclical and often similar patterns. This algorithm takes in a stream of segments and groups them to highly concentrated collections. Locality Sensitive Hashing (LSH) is used to reduce the overall complexity of the algorithm, allowing it to run online. The output of this aggregation is used to populate an index. The proposed algorithm yields logarithmic growth of the index (with respect to the total number of objects) while keeping sensitivity and specificity simultaneously above 98%. Both memory and runtime complexities of time series search are improved when using aggregated indexes. In addition, data mining tasks, such as clustering, exhibit runtimes that are orders of magnitudes faster when run on aggregated indexes.

  10. Federated queries for comparative effectiveness research: performance analysis.

    PubMed

    Price, Ronald C; Huth, Derick; Smith, Jody; Harper, Steve; Pace, Wilson; Pulver, Gerald; Kahn, Michael G; Schilling, Lisa M; Facelli, Julio C

    2012-01-01

    This paper presents a study of the performance of federated queries implemented in a system that simulates the architecture proposed for the Scalable Architecture for Federated Translational Inquiries Network (SAFTINet). Performance tests were conducted using both physical hardware and virtual machines within the test laboratory of the Center for High Performance Computing at the University of Utah. Tests were performed on SAFTINet networks ranging from 4 to 32 nodes with databases containing synthetic data for several million patients. The results show that the caGrid FQE (Federated Query Engine) is capable and suitable for comparative effectiveness research (CER) federated queries given its nearly linear scalability as partner nodes increase in number. The results presented here are also important for the specification of the hardware required to run a CER grid. PMID:22941983

  11. Evolutionary Multiobjective Query Workload Optimization of Cloud Data Warehouses

    PubMed Central

    Dokeroglu, Tansel; Sert, Seyyit Alper; Cinar, Muhammet Serkan

    2014-01-01

    With the advent of Cloud databases, query optimizers need to find paretooptimal solutions in terms of response time and monetary cost. Our novel approach minimizes both objectives by deploying alternative virtual resources and query plans making use of the virtual resource elasticity of the Cloud. We propose an exact multiobjective branch-and-bound and a robust multiobjective genetic algorithm for the optimization of distributed data warehouse query workloads on the Cloud. In order to investigate the effectiveness of our approach, we incorporate the devised algorithms into a prototype system. Finally, through several experiments that we have conducted with different workloads and virtual resource configurations, we conclude remarkable findings of alternative deployments as well as the advantages and disadvantages of the multiobjective algorithms we propose. PMID:24892048

  12. Browsing schematics: Query-filtered graphs with context nodes

    NASA Technical Reports Server (NTRS)

    Ciccarelli, Eugene C.; Nardi, Bonnie A.

    1988-01-01

    The early results of a research project to create tools for building interfaces to intelligent systems on the NASA Space Station are reported. One such tool is the Schematic Browser which helps users engaged in engineering problem solving find and select schematics from among a large set. Users query for schematics with certain components, and the Schematic Browser presents a graph whose nodes represent the schematics with those components. The query greatly reduces the number of choices presented to the user, filtering the graph to a manageable size. Users can reformulate and refine the query serially until they locate the schematics of interest. To help users maintain orientation as they navigate a large body of data, the graph also includes nodes that are not matches but provide global and local context for the matching nodes. Context nodes include landmarks, ancestors, siblings, children and previous matches.

  13. Evolutionary multiobjective query workload optimization of Cloud data warehouses.

    PubMed

    Dokeroglu, Tansel; Sert, Seyyit Alper; Cinar, Muhammet Serkan

    2014-01-01

    With the advent of Cloud databases, query optimizers need to find paretooptimal solutions in terms of response time and monetary cost. Our novel approach minimizes both objectives by deploying alternative virtual resources and query plans making use of the virtual resource elasticity of the Cloud. We propose an exact multiobjective branch-and-bound and a robust multiobjective genetic algorithm for the optimization of distributed data warehouse query workloads on the Cloud. In order to investigate the effectiveness of our approach, we incorporate the devised algorithms into a prototype system. Finally, through several experiments that we have conducted with different workloads and virtual resource configurations, we conclude remarkable findings of alternative deployments as well as the advantages and disadvantages of the multiobjective algorithms we propose. PMID:24892048

  14. Querying databases of trajectories of differential equations 2: Index functions

    NASA Technical Reports Server (NTRS)

    Grossman, Robert

    1991-01-01

    Suppose that a large number of parameterized trajectories (gamma) of a dynamical system evolving in R sup N are stored in a database. Let eta is contained R sup N denote a parameterized path in Euclidean space, and let parallel to center dot parallel to denote a norm on the space of paths. A data structures and indices for trajectories are defined and algorithms are given to answer queries of the following forms: Query 1. Given a path eta, determine whether eta occurs as a subtrajectory of any trajectory gamma from the database. If so, return the trajectory; otherwise, return null. Query 2. Given a path eta, return the trajectory gamma from the database which minimizes the norm parallel to eta - gamma parallel.

  15. Quantities and units in radiation protection dosimetry

    NASA Astrophysics Data System (ADS)

    Jennings, W. A.

    1994-08-01

    A new report, entitled Quantities and Units in Radiation Protection Dosimetry, has recently been published by the international Commission on Radiation Units and Measurements. That report (No. 51) aims to provide a coherent system of quantities and units for purposes of measurement and calculation in the assessment of compliance with dose limitations. The present paper provides an extended summary of that report, including references to the operational quantities needed for area and individual monitoring of external radiations.

  16. Ontology-based aggregation of biological pathway datasets.

    PubMed

    Jiang, Keyuan; Nash, Christopher

    2005-01-01

    The massive accumulation of biological data in the past decades has generated a significant amount of biological knowledge which is represented in one way as biological pathways. The existence of over 150 pathway databases reflects the diversity of the biological data and heterogeneity of data models, storage formats and access methods. To address an intriguing biological question, it is not uncommon for a biologist to query more one pathway database to acquire a more complete picture of current understanding of biology. To facility life scientists in searching biological pathway data, we designed a biological pathway aggregator which aggregates various pathway datasets via the BioPAX ontology, a community-developed ontology based upon the concept of Semantic Web for integrating and exchanging biological pathway data. Our aggregator is composed of modules that retrieve the data from various sources, transform the raw data to BioPAX format, persist the converted data in the persistent data store, and enable queries by other applications. PMID:17282076

  17. Private database queries based on counterfactual quantum key distribution

    NASA Astrophysics Data System (ADS)

    Zhang, Jia-Li; Guo, Fen-Zhuo; Gao, Fei; Liu, Bin; Wen, Qiao-Yan

    2013-08-01

    Based on the fundamental concept of quantum counterfactuality, we propose a protocol to achieve quantum private database queries, which is a theoretical study of how counterfactuality can be employed beyond counterfactual quantum key distribution (QKD). By adding crucial detecting apparatus to the device of QKD, the privacy of both the distrustful user and the database owner can be guaranteed. Furthermore, the proposed private-database-query protocol makes full use of the low efficiency in the counterfactual QKD, and by adjusting the relevant parameters, the protocol obtains excellent flexibility and extensibility.

  18. Architecture of a Federated Query Engine for Heterogeneous Resources

    PubMed Central

    Bradshaw, Richard L.; Matney, Susan; Livne, Oren E.; Bray, Bruce E.; Mitchell, Joyce A.; Narus, Scott P.

    2009-01-01

    The Federated Utah Research and Translational Health e-Repository (FURTHeR) is a Utah statewide informatics platform for the new Center for Clinical and Translational Science at the University of Utah. We have been working on one of FURTHeR’s key components, a federated query engine for heterogeneous resources, that we believe has the potential to meet some of the fundamental needs of translational science to access and integrate diverse biomedical data and promote discovery of new knowledge. The architecture of the federated query engine for heterogeneous resources is described and demonstrated. PMID:20351825

  19. Anytime query-tuned kernel machine classifiers via Cholesky factorization

    NASA Technical Reports Server (NTRS)

    DeCoste, D.

    2002-01-01

    We recently demonstrated 2 to 64-fold query-time speedups of Support Vector Machine and Kernel Fisher classifiers via a new computational geometry method for anytime output bounds (DeCoste,2002). This new paper refines our approach in two key ways. First, we introduce a simple linear algebra formulation based on Cholesky factorization, yielding simpler equations and lower computational overhead. Second, this new formulation suggests new methods for achieving additional speedups, including tuning on query samples. We demonstrate effectiveness on benchmark datasets.

  20. Metadata-driven Ad Hoc Query of Clinical Studies Data

    PubMed Central

    Deshpande, Aniruddha M.; Nadkarni, Prakash M.

    2001-01-01

    The Entity-Attribute-Value (EAV) data representation is widely used in both clinical patient record systems (CPRSs) and clinical study data management systems (CSDMS). Both of these systems are heterogeneous in that many types of data are also represented conventionally, a situation that complicates data display, editing and ad hoc query. Seamless functioning of such systems mandates the presence of developer-defined metadata (data describing the rest of the database) that records, among other things, how individual parameters are represented within the system. We illustrate a web-based ad hoc query tool that relies on the metadata to generate syntactically and semantically correct SQL.

  1. Architecture of a federated query engine for heterogeneous resources.

    PubMed

    Bradshaw, Richard L; Matney, Susan; Livne, Oren E; Bray, Bruce E; Mitchell, Joyce A; Narus, Scott P

    2009-01-01

    The Federated Utah Research and Translational Health e-Repository (FURTHeR) is a Utah statewide informatics platform for the new Center for Clinical and Translational Science at the University of Utah. We have been working on one of FURTHeR's key components, a federated query engine for heterogeneous resources, that we believe has the potential to meet some of the fundamental needs of translational science to access and integrate diverse biomedical data and promote discovery of new knowledge. The architecture of the federated query engine for heterogeneous resources is described and demonstrated. PMID:20351825

  2. Federated ontology-based queries over cancer data

    PubMed Central

    2012-01-01

    Background Personalised medicine provides patients with treatments that are specific to their genetic profiles. It requires efficient data sharing of disparate data types across a variety of scientific disciplines, such as molecular biology, pathology, radiology and clinical practice. Personalised medicine aims to offer the safest and most effective therapeutic strategy based on the gene variations of each subject. In particular, this is valid in oncology, where knowledge about genetic mutations has already led to new therapies. Current molecular biology techniques (microarrays, proteomics, epigenetic technology and improved DNA sequencing technology) enable better characterisation of cancer tumours. The vast amounts of data, however, coupled with the use of different terms - or semantic heterogeneity - in each discipline makes the retrieval and integration of information difficult. Results Existing software infrastructures for data-sharing in the cancer domain, such as caGrid, support access to distributed information. caGrid follows a service-oriented model-driven architecture. Each data source in caGrid is associated with metadata at increasing levels of abstraction, including syntactic, structural, reference and domain metadata. The domain metadata consists of ontology-based annotations associated with the structural information of each data source. However, caGrid's current querying functionality is given at the structural metadata level, without capitalising on the ontology-based annotations. This paper presents the design of and theoretical foundations for distributed ontology-based queries over cancer research data. Concept-based queries are reformulated to the target query language, where join conditions between multiple data sources are found by exploiting the semantic annotations. The system has been implemented, as a proof of concept, over the caGrid infrastructure. The approach is applicable to other model-driven architectures. A graphical user

  3. Monotonically improving approximate answers to relational algebra queries

    NASA Technical Reports Server (NTRS)

    Smith, Kenneth P.; Liu, J. W. S.

    1989-01-01

    We present here a query processing method that produces approximate answers to queries posed in standard relational algebra. This method is monotone in the sense that the accuracy of the approximate result improves with the amount of time spent producing the result. This strategy enables us to trade the time to produce the result for the accuracy of the result. An approximate relational model that characterizes appromimate relations and a partial order for comparing them is developed. Relational operators which operate on and return approximate relations are defined.

  4. Charged Dust Aggregate Interactions

    NASA Astrophysics Data System (ADS)

    Matthews, Lorin; Hyde, Truell

    2015-11-01

    A proper understanding of the behavior of dust particle aggregates immersed in a complex plasma first requires a knowledge of the basic properties of the system. Among the most important of these are the net electrostatic charge and higher multipole moments on the dust aggregate as well as the manner in which the aggregate interacts with the local electrostatic fields. The formation of elongated, fractal-like aggregates levitating in the sheath electric field of a weakly ionized RF generated plasma discharge has recently been observed experimentally. The resulting data has shown that as aggregates approach one another, they can both accelerate and rotate. At equilibrium, aggregates are observed to levitate with regular spacing, rotating about their long axis aligned parallel to the sheath electric field. Since gas drag tends to slow any such rotation, energy must be constantly fed into the system in order to sustain it. A numerical model designed to analyze this motion provides both the electrostatic charge and higher multipole moments of the aggregate while including the forces due to thermophoresis, neutral gas drag, and the ion wakefield. This model will be used to investigate the ambient conditions leading to the observed interactions. This research is funded by NSF Grant 1414523.

  5. Aggregate and the environment

    USGS Publications Warehouse

    Langer, William H.; Drew, Lawrence J.; Sachs, J.S.

    2004-01-01

    This book is designed to help you understand our aggregate resources-their importance, where they come from, how they are processed for our use, the environmental concerns related to their mining and processing, how those concerns are addressed, and the policies and regulations designed to safeguard workers, neighbors, and the environment from the negative impacts of aggregate mining. We hope this understanding will help prepare you to be involved in decisions that need to be made-individually and as a society-to be good stewards of our aggregate resources and our living planet.

  6. Consumer-Resource Dynamics: Quantity, Quality, and Allocation

    PubMed Central

    Getz, Wayne M.; Owen-Smith, Norman

    2011-01-01

    Background The dominant paradigm for modeling the complexities of interacting populations and food webs is a system of coupled ordinary differential equations in which the state of each species, population, or functional trophic group is represented by an aggregated numbers-density or biomass-density variable. Here, using the metaphysiological approach to model consumer-resource interactions, we formulate a two-state paradigm that represents each population or group in a food web in terms of both its quantity and quality. Methodology and Principal Findings The formulation includes an allocation function controlling the relative proportion of extracted resources to increasing quantity versus elevating quality. Since lower quality individuals senesce more rapidly than higher quality individuals, an optimal allocation proportion exists and we derive an expression for how this proportion depends on population parameters that determine the senescence rate, the per-capita mortality rate, and the effects of these rates on the dynamics of the quality variable. We demonstrate that oscillations do not arise in our model from quantity-quality interactions alone, but require consumer-resource interactions across trophic levels that can be stabilized through judicious resource allocation strategies. Analysis and simulations provide compelling arguments for the necessity of populations to evolve quality-related dynamics in the form of maternal effects, storage or other appropriate structures. They also indicate that resource allocation switching between investments in abundance versus quality provide a powerful mechanism for promoting the stability of consumer-resource interactions in seasonally forcing environments. Conclusions/Significance Our simulations show that physiological inefficiencies associated with this switching can be favored by selection due to the diminished exposure of inefficient consumers to strong oscillations associated with the well-known paradox of

  7. Concrete Waste Recycling Process for High Quality Aggregate

    SciTech Connect

    Ishikura, Takeshi; Fujii, Shin-ichi

    2008-01-15

    Large amount of concrete waste generates during nuclear power plant (NPP) dismantling. Non-contaminated concrete waste is assumed to be disposed in a landfill site, but that will not be the solution especially in the future, because of decreasing tendency of the site availability and natural resources. Concerning concrete recycling, demand for roadbeds and backfill tends to be less than the amount of dismantled concrete generated in a single rural site, and conventional recycled aggregate is limited of its use to non-structural concrete, because of its inferior quality to ordinary natural aggregate. Therefore, it is vital to develop high quality recycled aggregate for general uses of dismantled concrete. If recycled aggregate is available for high structural concrete, the dismantling concrete is recyclable as aggregate for industry including nuclear field. Authors developed techniques on high quality aggregate reclamation for large amount of concrete generated during NPP decommissioning. Concrete of NPP buildings has good features for recycling aggregate; large quantity of high quality aggregate from same origin, record keeping of the aggregate origin, and little impurities in dismantled concrete such as wood and plastics. The target of recycled aggregate in this development is to meet the quality criteria for NPP concrete as prescribed in JASS 5N 'Specification for Nuclear Power Facility Reinforced Concrete' and JASS 5 'Specification for Reinforced Concrete Work'. The target of recycled aggregate concrete is to be comparable performance with ordinary aggregate concrete. The high quality recycled aggregate production techniques are assumed to apply for recycling for large amount of non-contaminated concrete. These techniques can also be applied for slightly contaminated concrete dismantled from radiological control area (RCA), together with free release survey. In conclusion: a technology on dismantled concrete recycling for high quality aggregate was developed

  8. Research on Extension of Sparql Ontology Query Language Considering the Computation of Indoor Spatial Relations

    NASA Astrophysics Data System (ADS)

    Li, C.; Zhu, X.; Guo, W.; Liu, Y.; Huang, H.

    2015-05-01

    A method suitable for indoor complex semantic query considering the computation of indoor spatial relations is provided According to the characteristics of indoor space. This paper designs ontology model describing the space related information of humans, events and Indoor space objects (e.g. Storey and Room) as well as their relations to meet the indoor semantic query. The ontology concepts are used in IndoorSPARQL query language which extends SPARQL syntax for representing and querying indoor space. And four types specific primitives for indoor query, "Adjacent", "Opposite", "Vertical" and "Contain", are defined as query functions in IndoorSPARQL used to support quantitative spatial computations. Also a method is proposed to analysis the query language. Finally this paper adopts this method to realize indoor semantic query on the study area through constructing the ontology model for the study building. The experimental results show that the method proposed in this paper can effectively support complex indoor space semantic query.

  9. 49 CFR 172.315 - Limited quantities.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... SECURITY PLANS Marking § 172.315 Limited quantities. (a) Except for transportation by aircraft or as... transportation by aircraft, a limited quantity package conforming to Table 3 of § 173.27(f) of this subchapter... section. (d) Transitional exception. Except for transportation by aircraft, until December 31, 2013,...

  10. Rethinking Intensive Quantities via Guided Mediated Abduction

    ERIC Educational Resources Information Center

    Abrahamson, Dor

    2012-01-01

    Some intensive quantities, such as slope, velocity, or likelihood, are perceptually privileged in the sense that they are experienced as holistic, irreducible sensations. However, the formal expression of these quantities uses "a/b" analytic metrics; for example, the slope of a line is the quotient of its rise and run. Thus, whereas students'…

  11. 36 CFR 223.220 - Quantity determination.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Quantity determination. 223.220 Section 223.220 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER Special Forest Products § 223.220 Quantity...

  12. Protein Colloidal Aggregation Project

    NASA Technical Reports Server (NTRS)

    Oliva-Buisson, Yvette J. (Compiler)

    2014-01-01

    To investigate the pathways and kinetics of protein aggregation to allow accurate predictive modeling of the process and evaluation of potential inhibitors to prevalent diseases including cataract formation, chronic traumatic encephalopathy, Alzheimer's Disease, Parkinson's Disease and others.

  13. A cryptographic approach to securely share and query genomic sequences.

    PubMed

    Kantarcioglu, Murat; Jiang, Wei; Liu, Ying; Malin, Bradley

    2008-09-01

    To support large-scale biomedical research projects, organizations need to share person-specific genomic sequences without violating the privacy of their data subjects. In the past, organizations protected subjects' identities by removing identifiers, such as name and social security number; however, recent investigations illustrate that deidentified genomic data can be "reidentified" to named individuals using simple automated methods. In this paper, we present a novel cryptographic framework that enables organizations to support genomic data mining without disclosing the raw genomic sequences. Organizations contribute encrypted genomic sequence records into a centralized repository, where the administrator can perform queries, such as frequency counts, without decrypting the data. We evaluate the efficiency of our framework with existing databases of single nucleotide polymorphism (SNP) sequences and demonstrate that the time needed to complete count queries is feasible for real world applications. For example, our experiments indicate that a count query over 40 SNPs in a database of 5000 records can be completed in approximately 30 min with off-the-shelf technology. We further show that approximation strategies can be applied to significantly speed up query execution times with minimal loss in accuracy. The framework can be implemented on top of existing information and network technologies in biomedical environments. PMID:18779075

  14. Selective refinement queries for volume visualization of unstructured tetrahedral meshes.

    PubMed

    Cignoni, Paolo; De Floriani, Leila; Magillo, Paola; Puppo, Enrico; Scopigno, Roberto

    2004-01-01

    In this paper, we address the problem of the efficient visualization of large irregular volume data sets by exploiting a multiresolution model based on tetrahedral meshes. Multiresolution models, also called Level-Of-Detail (LOD) models, allow encoding the whole data set at a virtually continuous range of different resolutions. We have identified a set of queries for extracting meshes at variable resolution from a multiresolution model, based on field values, domain location, or opacity of the transfer function. Such queries allow trading off between resolution and speed in visualization. We define a new compact data structure for encoding a multiresolution tetrahedral mesh built through edge collapses to support selective refinement efficiently and show that such a structure has a storage cost from 3 to 5.5 times lower than standard data structures used for tetrahedral meshes. The data structures and variable resolution queries have been implemented together with state-of-the art visualization techniques in a system for the interactive visualization of three-dimensional scalar fields defined on tetrahedral meshes. Experimental results show that selective refinement queries can support interactive visualization of large data sets. PMID:15382696

  15. Verbal Query Intervention: Addressing Stereotypy in Students with Autism

    ERIC Educational Resources Information Center

    Caltabiano, Leonard F.

    2010-01-01

    This study examined the effectiveness of a Verbal Query Intervention (VQI) procedure in decreasing motor and vocal stereotypy in four elementary students with autism. The VQI procedure involved the presentation of behavior-related questions that the students were required to respond to in an appropriate fashion. An ABC multiple-baseline across…

  16. An Analysis of Web Image Queries for Search.

    ERIC Educational Resources Information Center

    Pu, Hsiao-Tieh

    2003-01-01

    Examines the differences between Web image and textual queries, and attempts to develop an analytic model to investigate their implications for Web image retrieval systems. Provides results that give insight into Web image searching behavior and suggests implications for improvement of current Web image search engines. (AEF)

  17. Queries over Unstructured Data: Probabilistic Methods to the Rescue

    NASA Astrophysics Data System (ADS)

    Sarawagi, Sunita

    Unstructured data like emails, addresses, invoices, call transcripts, reviews, and press releases are now an integral part of any large enterprise. A challenge of modern business intelligence applications is analyzing and querying data seamlessly across structured and unstructured sources. This requires the development of automated techniques for extracting structured records from text sources and resolving entity mentions in data from various sources. The success of any automated method for extraction and integration depends on how effectively it unifies diverse clues in the unstructured source and in existing structured databases. We argue that statistical learning techniques like Conditional Random Fields (CRFs) provide a accurate, elegant and principled framework for tackling these tasks. Given the inherent noise in real-world sources, it is important to capture the uncertainty of the above operations via imprecise data models. CRFs provide a sound probability distribution over extractions but are not easy to represent and query in a relational framework. We present methods of approximating this distribution to query-friendly row and column uncertainty models. Finally, we present models for representing the uncertainty of de-duplication and algorithms for various Top-K count queries on imprecise duplicates.

  18. A Visualization and Query Tool for Introgression Libraries

    Technology Transfer Automated Retrieval System (TEKTRAN)

    Near isogenic lines are powerful resources to analyze phenotypic variation and are important in efforts to map-base clone genes underlying mutants and traits. With many thousands of distinct genotypes, querying introgression libraries for lines of interest is an issue. To make it more tractable, we ...

  19. Project Lefty: More Bang for the Search Query

    ERIC Educational Resources Information Center

    Varnum, Ken

    2010-01-01

    This article describes the Project Lefty, a search system that, at a minimum, adds a layer on top of traditional federated search tools that will make the wait for results more worthwhile for researchers. At best, Project Lefty improves search queries and relevance rankings for web-scale discovery tools to make the results themselves more relevant…

  20. Query-Driven Approach to Face Clustering and Tagging.

    PubMed

    Zhang, Liyan; Wang, Xikui; Kalashnikov, Dmitri V; Mehrotra, Sharad; Ramanan, Deva

    2016-10-01

    In the era of big data, a traditional offline setting to processing image data is simply not tenable. We simply do not have the computational power to process every image with every possible tag; moreover, we will not have the manpower to clean up the potentially noisy results. In this paper, we introduce a query-driven approach to visual tagging, focusing on the application of face tagging and clustering. We integrate active learning with query-driven probabilistic databases. Rather than asking a user to provide manual labels so as to minimize the uncertainty of labels (face tags) across the entire data set, we ask the user to provide labels that minimize the uncertainty of his/her query result (e.g., "How many times did Bob and Jim appear together?"). We use a data-driven Gaussian process model of facial appearance to write the probabilistic estimates of facial identity into a probabilistic database, which can then support inference through query answering. Importantly, the database is augmented with contextual constraints (faces in the same image cannot be the same identity, while faces in the same track must be identical). Experiments on the real-world photo collections demonstrate the effectiveness of the proposed method. PMID:27448352

  1. Restructuring Large Data Hierarchies for Scientific Query Tools

    SciTech Connect

    Thomas, M

    2005-02-08

    Today's large-scale scientific simulations produce data sets tens to hundreds of terabytes in size. The DataFoundry project is developing querying and analysis tools for these data sets. The Approximate Ad-Hoc Query Engine for Simulation Data (AQSIM) uses a multi-resolution, tree-shaped data structure that allows users to place runtime limits on queries over scientific simulation data. In this AQSIM data hierarchy, each node in the tree contains an abstract model describing all of the information contained in the subtree below that node. AQSIM is able to create the data hierarchy in a single pass. However, the nodes in the hierarchy frequently have low node fanout, which leads to inefficient I/O behavior during query processing. Low node fanout is a common problem in tree-shaped indices. This paper presents a set of one-pass tree ''pruning'' algorithms that efficiently restructure the data hierarchy by removing inner nodes, thereby increasing node fanout. As our experimental results show, the best approach is a combination of two algorithms, one that focuses on increasing node fanout and one that attempts to reduce the maximum tree height.

  2. Internet Queries and Methicillin-Resistant Staphylococcus aureus Surveillance

    PubMed Central

    Dukic, Vanja M.; David, Michael Z.

    2011-01-01

    The Internet is a common source of medical information and has created novel surveillance opportunities. We assessed the potential for Internet-based surveillance of methicillin-resistant Staphylococcus aureus and examined the extent to which it reflects trends in hospitalizations and news coverage. Google queries were a useful predictor of hospitalizations for methicillin-resistant S. aureus infections. PMID:21749772

  3. Secure quantum private information retrieval using phase-encoded queries

    NASA Astrophysics Data System (ADS)

    Olejnik, Lukasz

    2011-08-01

    We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. This protocol may also be viewed as a solution to the symmetrically private information retrieval problem in that it can offer database security (inability for a querying user to steal its contents). Compared to classical solutions, the protocol offers substantial improvement in terms of communication complexity. In comparison with the recent quantum private queries [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.100.230502 100, 230502 (2008)] protocol, it is more efficient in terms of communication complexity and the number of rounds, while offering a clear privacy parameter. We discuss the security of the protocol and analyze its strengths and conclude that using this technique makes it challenging to obtain the unconditional (in the information-theoretic sense) privacy degree; nevertheless, in addition to being simple, the protocol still offers a privacy level. The oracle used in the protocol is inspired both by the classical computational PIR solutions as well as the Deutsch-Jozsa oracle.

  4. WISQARS (WEB-BASED INJURY STATISTICS QUERY AND REPORTING SYSTEM)

    EPA Science Inventory

    WISQARS (Web-based Injury Statistics Query and Reporting System, pronounced "whiskers") Fatal is an interactive database system that provides injury-related mortality data useful for research and for making informed public health decisions. WISQARS offers three types of fatal rep...

  5. Techniques for optimization of queries on integrated biological resources.

    PubMed

    Lacroix, Zoé; Raschid, Louiqa; Eckman, Barbara A

    2004-06-01

    Today, scientific data are inevitably digitized, stored in a wide variety of formats, and are accessible over the Internet. Scientific discovery increasingly involves accessing multiple heterogeneous data sources, integrating the results of complex queries, and applying further analysis and visualization applications in order to collect datasets of interest. Building a scientific integration platform to support these critical tasks requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that are locally materialized in warehouses or generated by software. The lack of efficiency of existing approaches can significantly affect the process with lengthy delays while accessing critical resources or with the failure of the system to report any results. Some queries take so much time to be answered that their results are returned via email, making their integration with other results a tedious task. This paper presents several issues that need to be addressed to provide seamless and efficient integration of biomolecular data. Identified challenges include: capturing and representing various domain specific computational capabilities supported by a source including sequence or text search engines and traditional query processing; developing a methodology to acquire and represent semantic knowledge and metadata about source contents, overlap in source contents, and access costs; developing cost and semantics based decision support tools to select sources and capabilities, and to generate efficient query evaluation plans. PMID:15297988

  6. Accelerating Network Traffic Analytics Using Query-DrivenVisualization

    SciTech Connect

    Bethel, E. Wes; Campbell, Scott; Dart, Eli; Stockinger, Kurt; Wu,Kesheng

    2006-07-29

    Realizing operational analytics solutions where large and complex data must be analyzed in a time-critical fashion entails integrating many different types of technology. This paper focuses on an interdisciplinary combination of scientific data management and visualization/analysis technologies targeted at reducing the time required for data filtering, querying, hypothesis testing and knowledge discovery in the domain of network connection data analysis. We show that use of compressed bitmap indexing can quickly answer queries in an interactive visual data analysis application, and compare its performance with two alternatives for serial and parallel filtering/querying on 2.5 billion records worth of network connection data collected over a period of 42 weeks. Our approach to visual network connection data exploration centers on two primary factors: interactive ad-hoc and multiresolution query formulation and execution over n dimensions and visual display of then-dimensional histogram results. This combination is applied in a case study to detect a distributed network scan and to then identify the set of remote hosts participating in the attack. Our approach is sufficiently general to be applied to a diverse set of data understanding problems as well as used in conjunction with a diverse set of analysis and visualization tools.

  7. Applying Genetic Algorithms To Query Optimization in Document Retrieval.

    ERIC Educational Resources Information Center

    Horng, Jorng-Tzong; Yeh, Ching-Chang

    2000-01-01

    Proposes a novel approach to automatically retrieve keywords and then uses genetic algorithms to adapt the keyword weights. Discusses Chinese text retrieval, term frequency rating formulas, vector space models, bigrams, the PAT-tree structure for information retrieval, query vectors, and relevance feedback. (Author/LRW)

  8. Secure quantum private information retrieval using phase-encoded queries

    SciTech Connect

    Olejnik, Lukasz

    2011-08-15

    We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. This protocol may also be viewed as a solution to the symmetrically private information retrieval problem in that it can offer database security (inability for a querying user to steal its contents). Compared to classical solutions, the protocol offers substantial improvement in terms of communication complexity. In comparison with the recent quantum private queries [Phys. Rev. Lett. 100, 230502 (2008)] protocol, it is more efficient in terms of communication complexity and the number of rounds, while offering a clear privacy parameter. We discuss the security of the protocol and analyze its strengths and conclude that using this technique makes it challenging to obtain the unconditional (in the information-theoretic sense) privacy degree; nevertheless, in addition to being simple, the protocol still offers a privacy level. The oracle used in the protocol is inspired both by the classical computational PIR solutions as well as the Deutsch-Jozsa oracle.

  9. Using Clinicians’ Search Query Data to Monitor Influenza Epidemics

    PubMed Central

    Santillana, Mauricio; Nsoesie, Elaine O.; Mekaru, Sumiko R.; Scales, David; Brownstein, John S.

    2014-01-01

    Search query information from a clinician's database, UpToDate, is shown to predict influenza epidemics in the United States in a timely manner. Our results show that digital disease surveillance tools based on experts' databases may be able to provide an alternative, reliable, and stable signal for accurate predictions of influenza outbreaks. PMID:25115873

  10. A Simple Blueprint for Automatic Boolean Query Processing.

    ERIC Educational Resources Information Center

    Salton, G.

    1988-01-01

    Describes a new Boolean retrieval environment in which an extended soft Boolean logic is used to automatically construct queries from original natural language formulations provided by users. Experimental results that compare the retrieval effectiveness of this method to conventional Boolean and vector processing are discussed. (27 references)…

  11. 48 CFR 514.270-5 - Evaluation methodologies for aggregate awards.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 4 2010-10-01 2010-10-01 false Evaluation methodologies for aggregate awards. 514.270-5 Section 514.270-5 Federal Acquisition Regulations System GENERAL...-5 Evaluation methodologies for aggregate awards. (a) Definite quantity contracts without...

  12. 48 CFR 514.270-5 - Evaluation methodologies for aggregate awards.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 48 Federal Acquisition Regulations System 4 2011-10-01 2011-10-01 false Evaluation methodologies for aggregate awards. 514.270-5 Section 514.270-5 Federal Acquisition Regulations System GENERAL...-5 Evaluation methodologies for aggregate awards. (a) Definite quantity contracts without...

  13. A Viewpoint on the Quantity "Plane Angle"

    NASA Astrophysics Data System (ADS)

    Eder, W. E.

    1982-01-01

    Properties of the quantity "plane angle" are explored under the hypothesis that it is a dimensional quantity. The exploration proceeds especially with respect to the physical concept, its mathematical treatment, vector concepts, measurement theory, units of related quantities, engineering pragmatism, and SI. An attempt is made to bring these different relations into a rational, logical and consistent framework, and thus to justify the hypothesis. Various types of vectorial quantities are recognized, and their properties described with an outline of the necessary algebraic manipulations. The concept of plane angle is amplified, and its interdependence with the circular arc is explored. The resulting units of plane angle form a class of similar scales of measurement. Consequences of the confirmed hypothesis are developed for mathematical expressions involving trigonometric functions, rotational volumes and areas, mathematical limits, differentiation and series expansion. Consequences for mechanical rotational quantities are developed, with proposals for revisions to a number of expressions for derived units within SI. A revised definition for the quantity "plane angle" is stated to take account of the developed insights. There is a clear need to reconsider the status of plane angle and some other quantities within the international framework of SI.

  14. Medical case-based retrieval: integrating query MeSH terms for query-adaptive multi-modal fusion

    NASA Astrophysics Data System (ADS)

    Seco de Herrera, Alba G.; Foncubierta-Rodríguez, Antonio; Müller, Henning

    2015-03-01

    Advances in medical knowledge give clinicians more objective information for a diagnosis. Therefore, there is an increasing need for bibliographic search engines that can provide services helping to facilitate faster information search. The ImageCLEFmed benchmark proposes a medical case-based retrieval task. This task aims at retrieving articles from the biomedical literature that are relevant for differential diagnosis of query cases including a textual description and several images. In the context of this campaign many approaches have been investigated showing that the fusion of visual and text information can improve the precision of the retrieval. However, fusion does not always lead to better results. In this paper, a new query-adaptive fusion criterion to decide when to use multi-modal (text and visual) or only text approaches is presented. The proposed method integrates text information contained in MeSH (Medical Subject Headings) terms extracted and visual features of the images to find synonym relations between them. Given a text query, the query-adaptive fusion criterion decides when it is suitable to also use visual information for the retrieval. Results show that this approach can decide if a text or multi{modal approach should be used with 77.15% of accuracy.

  15. A Lightweight I/O Scheme to Facilitate Spatial and Temporal Queries of Scientific Data Analytics

    NASA Technical Reports Server (NTRS)

    Tian, Yuan; Liu, Zhuo; Klasky, Scott; Wang, Bin; Abbasi, Hasan; Zhou, Shujia; Podhorszki, Norbert; Clune, Tom; Logan, Jeremy; Yu, Weikuan

    2013-01-01

    In the era of petascale computing, more scientific applications are being deployed on leadership scale computing platforms to enhance the scientific productivity. Many I/O techniques have been designed to address the growing I/O bottleneck on large-scale systems by handling massive scientific data in a holistic manner. While such techniques have been leveraged in a wide range of applications, they have not been shown as adequate for many mission critical applications, particularly in data post-processing stage. One of the examples is that some scientific applications generate datasets composed of a vast amount of small data elements that are organized along many spatial and temporal dimensions but require sophisticated data analytics on one or more dimensions. Including such dimensional knowledge into data organization can be beneficial to the efficiency of data post-processing, which is often missing from exiting I/O techniques. In this study, we propose a novel I/O scheme named STAR (Spatial and Temporal AggRegation) to enable high performance data queries for scientific analytics. STAR is able to dive into the massive data, identify the spatial and temporal relationships among data variables, and accordingly organize them into an optimized multi-dimensional data structure before storing to the storage. This technique not only facilitates the common access patterns of data analytics, but also further reduces the application turnaround time. In particular, STAR is able to enable efficient data queries along the time dimension, a practice common in scientific analytics but not yet supported by existing I/O techniques. In our case study with a critical climate modeling application GEOS-5, the experimental results on Jaguar supercomputer demonstrate an improvement up to 73 times for the read performance compared to the original I/O method.

  16. PropBase Query Layer: a single portal to UK subsurface physical property databases

    NASA Astrophysics Data System (ADS)

    Kingdon, Andrew; Nayembil, Martin L.; Richardson, Anne E.; Smith, A. Graham

    2013-04-01

    Until recently, the delivery of geological information for industry and public was achieved by geological mapping. Now pervasively available computers mean that 3D geological models can deliver realistic representations of the geometric location of geological units, represented as shells or volumes. The next phase of this process is to populate these with physical properties data that describe subsurface heterogeneity and its associated uncertainty. Achieving this requires capture and serving of physical, hydrological and other property information from diverse sources to populate these models. The British Geological Survey (BGS) holds large volumes of subsurface property data, derived both from their own research data collection and also other, often commercially derived data sources. This can be voxelated to incorporate this data into the models to demonstrate property variation within the subsurface geometry. All property data held by BGS has for many years been stored in relational databases to ensure their long-term continuity. However these have, by necessity, complex structures; each database contains positional reference data and model information, and also metadata such as sample identification information and attributes that define the source and processing. Whilst this is critical to assessing these analyses, it also hugely complicates the understanding of variability of the property under assessment and requires multiple queries to study related datasets making extracting physical properties from these databases difficult. Therefore the PropBase Query Layer has been created to allow simplified aggregation and extraction of all related data and its presentation of complex data in simple, mostly denormalized, tables which combine information from multiple databases into a single system. The structure from each relational database is denormalized in a generalised structure, so that each dataset can be viewed together in a common format using a simple

  17. External phenome analysis enables a rational federated query strategy to detect changing rates of treatment-related complications associated with multiple myeloma.

    PubMed

    Warner, Jeremy L; Alterovitz, Gil; Bodio, Kelly; Joyce, Robin M

    2013-01-01

    Electronic health records (EHRs) are increasingly useful for health services research. For relatively uncommon conditions, such as multiple myeloma (MM) and its treatment-related complications, a combination of multiple EHR sources is essential for such research. The Shared Health Research Information Network (SHRINE) enables queries for aggregate results across participating institutions. Development of a rational search strategy in SHRINE may be augmented through analysis of pre-existing databases. We developed a SHRINE query for likely non-infectious treatment-related complications of MM, based upon an analysis of the Multiparameter Intelligent Monitoring in Intensive Care (MIMIC II) database. Using this query strategy, we found that the rate of likely treatment-related complications significantly increased from 2001 to 2007, by an average of 6% a year (p=0.01), across the participating SHRINE institutions. This finding is in keeping with increasingly aggressive strategies in the treatment of MM. This proof of concept demonstrates that a staged approach to federated queries, using external EHR data, can yield potentially clinically meaningful results. PMID:23515788

  18. External phenome analysis enables a rational federated query strategy to detect changing rates of treatment-related complications associated with multiple myeloma

    PubMed Central

    Warner, Jeremy L; Alterovitz, Gil; Bodio, Kelly; Joyce, Robin M

    2013-01-01

    Electronic health records (EHRs) are increasingly useful for health services research. For relatively uncommon conditions, such as multiple myeloma (MM) and its treatment-related complications, a combination of multiple EHR sources is essential for such research. The Shared Health Research Information Network (SHRINE) enables queries for aggregate results across participating institutions. Development of a rational search strategy in SHRINE may be augmented through analysis of pre-existing databases. We developed a SHRINE query for likely non-infectious treatment-related complications of MM, based upon an analysis of the Multiparameter Intelligent Monitoring in Intensive Care (MIMIC II) database. Using this query strategy, we found that the rate of likely treatment-related complications significantly increased from 2001 to 2007, by an average of 6% a year (p=0.01), across the participating SHRINE institutions. This finding is in keeping with increasingly aggressive strategies in the treatment of MM. This proof of concept demonstrates that a staged approach to federated queries, using external EHR data, can yield potentially clinically meaningful results. PMID:23515788

  19. Fast Query-Optimized Kernel-Machine Classification

    NASA Technical Reports Server (NTRS)

    Mazzoni, Dominic; DeCoste, Dennis

    2004-01-01

    A recently developed algorithm performs kernel-machine classification via incremental approximate nearest support vectors. The algorithm implements support-vector machines (SVMs) at speeds 10 to 100 times those attainable by use of conventional SVM algorithms. The algorithm offers potential benefits for classification of images, recognition of speech, recognition of handwriting, and diverse other applications in which there are requirements to discern patterns in large sets of data. SVMs constitute a subset of kernel machines (KMs), which have become popular as models for machine learning and, more specifically, for automated classification of input data on the basis of labeled training data. While similar in many ways to k-nearest-neighbors (k-NN) models and artificial neural networks (ANNs), SVMs tend to be more accurate. Using representations that scale only linearly in the numbers of training examples, while exploring nonlinear (kernelized) feature spaces that are exponentially larger than the original input dimensionality, KMs elegantly and practically overcome the classic curse of dimensionality. However, the price that one must pay for the power of KMs is that query-time complexity scales linearly with the number of training examples, making KMs often orders of magnitude more computationally expensive than are ANNs, decision trees, and other popular machine learning alternatives. The present algorithm treats an SVM classifier as a special form of a k-NN. The algorithm is based partly on an empirical observation that one can often achieve the same classification as that of an exact KM by using only small fraction of the nearest support vectors (SVs) of a query. The exact KM output is a weighted sum over the kernel values between the query and the SVs. In this algorithm, the KM output is approximated with a k-NN classifier, the output of which is a weighted sum only over the kernel values involving k selected SVs. Before query time, there are gathered

  20. Zero-gravity quantity gaging system

    NASA Technical Reports Server (NTRS)

    1989-01-01

    The Zero-Gravity Quantity Gaging System program is a technology development effort funded by NASA-LeRC and contracted by NASA-JSC to develop and evaluate zero-gravity quantity gaging system concepts suitable for application to large, on-orbit cryogenic oxygen and hydrogen tankage. The contract effective date was 28 May 1985. During performance of the program, 18 potential quantity gaging approaches were investigated for their merit and suitability for gaging two-phase cryogenic oxygen and hydrogen in zero-gravity conditions. These approaches were subjected to a comprehensive trade study and selection process, which found that the RF modal quantity gaging approach was the most suitable for both liquid oxygen and liquid hydrogen applications. This selection was made with NASA-JSC concurrence.

  1. Method and Apparatus for Measuring Radiation Quantities

    DOEpatents

    Roberts, N O

    1955-01-25

    This patent application describes a compact dosimeter for measuring X-ray and gamma radiation by the use of solutions which undergo a visible color change upon exposure to a predetermined quantity of radiation.

  2. Arsenic Treatment Residuals: Quantities, Characteristics and Disposal

    EPA Science Inventory

    This presentation provides information on the quantities, the characteristics and the disposal options for the common arsenic removal technologies. The technologies consist of adsorption media, iron removal, coagulation/filtration and ion exchange. The information for the prese...

  3. Lighting Quantity and Quality in Educational Facilities.

    ERIC Educational Resources Information Center

    Elwazanim, Salim A.

    1998-01-01

    Discusses educational facility lighting management, and examines how light quantity, distribution, and quality-enhancement strategies can improve the indoor environment while reducing lighting costs. Informational tables provide lighting pattern, color, and illuminance data. (GR)

  4. 7 CFR 929.14 - Marketable quantity.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE CRANBERRIES GROWN IN STATES OF.... Marketable quantity means for a crop year the number of pounds of cranberries necessary to meet the...

  5. 7 CFR 929.14 - Marketable quantity.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... AND ORDERS; FRUITS, VEGETABLES, NUTS), DEPARTMENT OF AGRICULTURE CRANBERRIES GROWN IN STATES OF.... Marketable quantity means for a crop year the number of pounds of cranberries necessary to meet the...

  6. 7 CFR 929.14 - Marketable quantity.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE CRANBERRIES GROWN IN STATES OF.... Marketable quantity means for a crop year the number of pounds of cranberries necessary to meet the...

  7. 7 CFR 929.14 - Marketable quantity.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE CRANBERRIES GROWN IN STATES OF.... Marketable quantity means for a crop year the number of pounds of cranberries necessary to meet the...

  8. 7 CFR 929.14 - Marketable quantity.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... AND ORDERS; FRUITS, VEGETABLES, NUTS), DEPARTMENT OF AGRICULTURE CRANBERRIES GROWN IN STATES OF.... Marketable quantity means for a crop year the number of pounds of cranberries necessary to meet the...

  9. Interactive Querying over Large Network Data: Scalability, Visualization, and Interaction Design

    PubMed Central

    Pienta, Robert; Tamersoy, Acar; Tong, Hanghang; Endert, Alex; Chau, Duen Horng

    2015-01-01

    Given the explosive growth of modern graph data, new methods are needed that allow for the querying of complex graph structures without the need of a complicated querying languages; in short, interactive graph querying is desirable. We describe our work towards achieving our overall research goal of designing and developing an interactive querying system for large network data. We focus on three critical aspects: scalable data mining algorithms, graph visualization, and interaction design. We have already completed an approximate subgraph matching system called MAGE in our previous work that fulfills the algorithmic foundation allowing us to query a graph with hundreds of millions of edges. Our preliminary work on visual graph querying, Graphite, was the first step in the process to making an interactive graph querying system. We are in the process of designing the graph visualization and robust interaction needed to make truly interactive graph querying a reality. PMID:25859567

  10. Conserved quantities from piecewise Killing vectors

    NASA Astrophysics Data System (ADS)

    Dray, Tevian; Padmanabhan, T.

    1989-07-01

    In the presence of symmetries, conserved quantities can be obtained by contracting the stress-energy tensor with a Killing vector. We generalize this result to piecewise Killing vectors by giving sufficient conditions for the construction of an associated conserved quantity. A typical example, namely, two stationary space-times joined together in such a way that the resulting space-time is not stationary, is treated in detail.

  11. A conserved quantity in thin body dynamics

    NASA Astrophysics Data System (ADS)

    Hanna, J. A.; Pendar, H.

    2016-02-01

    Thin, solid bodies with metric symmetries admit a restricted form of reparameterization invariance. Their dynamical equilibria include motions with both rigid and flowing aspects. On such configurations, a quantity is conserved along the intrinsic coordinate corresponding to the symmetry. As an example of its utility, this conserved quantity is combined with linear and angular momentum currents to construct solutions for the equilibria of a rotating, flowing string, for which it is akin to Bernoulli's constant.

  12. Technology meets aggregate

    SciTech Connect

    Wilson, C.; Swan, C.

    2007-07-01

    New technology carried out at Tufts University and the University of Massachusetts on synthetic lightweight aggregate has created material from various qualities of fly ash from coal-fired power plants for use in different engineered applications. In pilot scale manufacturing tests an 'SLA' containing 80% fly ash and 20% mixed plastic waste from packaging was produced by 'dry blending' mixed plastic with high carbon fly ash. A trial run was completed to produce concrete masonry unit (CMU) blocks at a full-scale facility. It has been shown that SLA can be used as a partial substitution of a traditional stone aggregate in hot asphalt mix. 1 fig., 2 photos.

  13. Query optimization for graph analytics on linked data using SPARQL

    SciTech Connect

    Hong, Seokyong; Lee, Sangkeun; Lim, Seung -Hwan; Sukumar, Sreenivas R.; Vatsavai, Ranga Raju

    2015-07-01

    Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.

  14. Toward a cognitive task analysis for biomedical query mediation.

    PubMed

    Hruby, Gregory W; Cimino, James J; Patel, Vimla; Weng, Chunhua

    2014-01-01

    In many institutions, data analysts use a Biomedical Query Mediation (BQM) process to facilitate data access for medical researchers. However, understanding of the BQM process is limited in the literature. To bridge this gap, we performed the initial steps of a cognitive task analysis using 31 BQM instances conducted between one analyst and 22 researchers in one academic department. We identified five top-level tasks, i.e., clarify research statement, explain clinical process, identify related data elements, locate EHR data element, and end BQM with either a database query or unmet, infeasible information needs, and 10 sub-tasks. We evaluated the BQM task model with seven data analysts from different clinical research institutions. Evaluators found all the tasks completely or semi-valid. This study contributes initial knowledge towards the development of a generalizable cognitive task representation for BQM. PMID:25954589

  15. Managing and Querying Image Annotation and Markup in XML

    PubMed Central

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

    2010-01-01

    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

  16. Subject Categorization of Query Terms for Exploring Web Users' Search Interests.

    ERIC Educational Resources Information Center

    Pu, Hsiao-Tieh; Chuang, Shui-Lung; Yang, Chyan

    2002-01-01

    Presents a query categorization approach to automatically classifying Web query terms into broad subject categories to provide in-depth analysis of users' search interests. Describes a test on search engine logs in Taiwan that shows the approach is efficient in dealing with large numbers of queries. (Author/LRW)

  17. Searching for Images: The Analysis of Users' Queries for Image Retrieval in American History.

    ERIC Educational Resources Information Center

    Choi, Youngok; Rasmussen, Edie M.

    2003-01-01

    Studied users' queries for visual information in American history to identify the image attributes important for retrieval and the characteristics of users' queries for digital images, based on queries from 38 faculty and graduate students. Results of pre- and post-test questionnaires and interviews suggest principle categories of search terms.…

  18. A study of medical and health queries to web search engines.

    PubMed

    Spink, Amanda; Yang, Yin; Jansen, Jim; Nykanen, Pirrko; Lorence, Daniel P; Ozmutlu, Seda; Ozmutlu, H Cenk

    2004-03-01

    This paper reports findings from an analysis of medical or health queries to different web search engines. We report results: (i). comparing samples of 10000 web queries taken randomly from 1.2 million query logs from the AlltheWeb.com and Excite.com commercial web search engines in 2001 for medical or health queries, (ii). comparing the 2001 findings from Excite and AlltheWeb.com users with results from a previous analysis of medical and health related queries from the Excite Web search engine for 1997 and 1999, and (iii). medical or health advice-seeking queries beginning with the word 'should'. Findings suggest: (i). a small percentage of web queries are medical or health related, (ii). the top five categories of medical or health queries were: general health, weight issues, reproductive health and puberty, pregnancy/obstetrics, and human relationships, and (iii). over time, the medical and health queries may have declined as a proportion of all web queries, as the use of specialized medical/health websites and e-commerce-related queries has increased. Findings provide insights into medical and health-related web querying and suggests some implications for the use of the general web search engines when seeking medical/health information. PMID:15023208

  19. Dynamics of cell aggregates fusion: Experiments and simulations

    NASA Astrophysics Data System (ADS)

    Thomas, Gilberto L.; Mironov, Vladimir; Nagy-Mehez, Agnes; Mombach, José C. M.

    2014-02-01

    Fusion of cell tissues is an ubiquitous phenomenon and has important technological applications including tissue biofabrication. In this work we present experimental results of aggregates fusion using adipose derived stem cells (ADSC) and a three dimensional computer simulation of the process using the cellular Potts model with aggregates reaching 10,000 cells. We consider fusion of round aggregates and monitor the dimensionless neck area of contact between the two aggregates to characterize the process, as done for the coalescence of liquid droplets and polymers. Both experiments and simulations show that the evolution of this quantity obeys a power law in time. We also study quantitatively individual cell motion with the simulation and it corresponds to an anomalous diffusion.

  20. Web search queries can predict stock market volumes.

    PubMed

    Bordino, Ilaria; Battiston, Stefano; Caldarelli, Guido; Cristelli, Matthieu; Ukkonen, Antti; Weber, Ingmar

    2012-01-01

    We live in a computerized and networked society where many of our actions leave a digital trace and affect other people's actions. This has lead to the emergence of a new data-driven research field: mathematical methods of computer science, statistical physics and sociometry provide insights on a wide range of disciplines ranging from social science to human mobility. A recent important discovery is that search engine traffic (i.e., the number of requests submitted by users to search engines on the www) can be used to track and, in some cases, to anticipate the dynamics of social phenomena. Successful examples include unemployment levels, car and home sales, and epidemics spreading. Few recent works applied this approach to stock prices and market sentiment. However, it remains unclear if trends in financial markets can be anticipated by the collective wisdom of on-line users on the web. Here we show that daily trading volumes of stocks traded in NASDAQ-100 are correlated with daily volumes of queries related to the same stocks. In particular, query volumes anticipate in many cases peaks of trading by one day or more. Our analysis is carried out on a unique dataset of queries, submitted to an important web search engine, which enable us to investigate also the user behavior. We show that the query volume dynamics emerges from the collective but seemingly uncoordinated activity of many users. These findings contribute to the debate on the identification of early warnings of financial systemic risk, based on the activity of users of the www. PMID:22829871

  1. Federated query services provided by the Seamless SAR Archive project

    NASA Astrophysics Data System (ADS)

    Baker, S.; Bryson, G.; Buechler, B.; Meertens, C. M.; Crosby, C. J.; Fielding, E. J.; Nicoll, J.; Youn, C.; Baru, C.

    2013-12-01

    The NASA Advancing Collaborative Connections for Earth System Science (ACCESS) seamless synthetic aperture radar (SAR) archive (SSARA) project is a 2-year collaboration between UNAVCO, the Alaska Satellite Facility (ASF), the Jet Propulsion Laboratory (JPL), and OpenTopography at the San Diego Supercomputer Center (SDSC) to design and implement a seamless distributed access system for SAR data and derived data products (i.e. interferograms). A major milestone for the first year of the SSARA project was a unified application programming interface (API) for SAR data search and results at ASF and UNAVCO (WInSAR and EarthScope data archives) through the use of simple web services. A federated query service was developed using the unified APIs, providing users a single search interface for both archives (http://www.unavco.org/ws/brokered/ssara/sar/search). A command line client that utilizes this new service is provided as an open source utility for the community on GitHub (https://github.com/bakerunavco/SSARA). Further API development and enhancements added more InSAR specific keywords and quality control parameters (Doppler centroid, faraday rotation, InSAR stack size, and perpendicular baselines). To facilitate InSAR processing, the federated query service incorporated URLs for DEM (from OpenTopography) and tropospheric corrections (from the JPL OSCAR service) in addition to the URLs for SAR data. This federated query service will provide relevant QC metadata for selecting pairs of SAR data for InSAR processing and all the URLs necessary for interferogram generation. Interest from the international community has prompted an effort to incorporate other SAR data archives (the ESA Virtual Archive 4 and the DLR TerraSAR-X_SSC Geohazard Supersites and Natural Laboratories collections) into the federated query service which provide data for researchers outside the US and North America.

  2. Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search.

    PubMed

    Liu, Xianglong; Deng, Cheng; Lang, Bo; Tao, Dacheng; Li, Xuelong

    2016-02-01

    Recent years have witnessed the success of binary hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually built using hashing to cover more desired results in the hit buckets of each table. However, rare work studies the unified approach to constructing multiple informative hash tables using any type of hashing algorithms. Meanwhile, for multiple table search, it also lacks of a generic query-adaptive and fine-grained ranking scheme that can alleviate the binary quantization loss suffered in the standard hashing techniques. To solve the above problems, in this paper, we first regard the table construction as a selection problem over a set of candidate hash functions. With the graph representation of the function set, we propose an efficient solution that sequentially applies normalized dominant set to finding the most informative and independent hash functions for each table. To further reduce the redundancy between tables, we explore the reciprocal hash tables in a boosting manner, where the hash function graph is updated with high weights emphasized on the misclassified neighbor pairs of previous hash tables. To refine the ranking of the retrieved buckets within a certain Hamming radius from the query, we propose a query-adaptive bitwise weighting scheme to enable fine-grained bucket ranking in each hash table, exploiting the discriminative power of its hash functions and their complement for nearest neighbor search. Moreover, we integrate such scheme into the multiple table search using a fast, yet reciprocal table lookup algorithm within the adaptive weighted Hamming radius. In this paper, both the construction method and the query-adaptive search method are general and compatible with different types of hashing algorithms using different feature spaces and/or parameter settings. Our extensive experiments on several large-scale benchmarks demonstrate that the proposed techniques can significantly outperform both

  3. Spatiotemporal conceptual platform for querying archaeological information systems

    NASA Astrophysics Data System (ADS)

    Partsinevelos, Panagiotis; Sartzetaki, Mary; Sarris, Apostolos

    2015-04-01

    Spatial and temporal distribution of archaeological sites has been shown to associate with several attributes including marine, water, mineral and food resources, climate conditions, geomorphological features, etc. In this study, archeological settlement attributes are evaluated under various associations in order to provide a specialized query platform in a geographic information system (GIS). Towards this end, a spatial database is designed to include a series of archaeological findings for a secluded geographic area of Crete in Greece. The key categories of the geodatabase include the archaeological type (palace, burial site, village, etc.), temporal information of the habitation/usage period (pre Minoan, Minoan, Byzantine, etc.), and the extracted geographical attributes of the sites (distance to sea, altitude, resources, etc.). Most of the related spatial attributes are extracted with readily available GIS tools. Additionally, a series of conceptual data attributes are estimated, including: Temporal relation of an era to a future one in terms of alteration of the archaeological type, topologic relations of various types and attributes, spatial proximity relations between various types. These complex spatiotemporal relational measures reveal new attributes towards better understanding of site selection for prehistoric and/or historic cultures, yet their potential combinations can become numerous. Therefore, after the quantification of the above mentioned attributes, they are classified as of their importance for archaeological site location modeling. Under this new classification scheme, the user may select a geographic area of interest and extract only the important attributes for a specific archaeological type. These extracted attributes may then be queried against the entire spatial database and provide a location map of possible new archaeological sites. This novel type of querying is robust since the user does not have to type a standard SQL query but

  4. Web Search Queries Can Predict Stock Market Volumes

    PubMed Central

    Bordino, Ilaria; Battiston, Stefano; Caldarelli, Guido; Cristelli, Matthieu; Ukkonen, Antti; Weber, Ingmar

    2012-01-01

    We live in a computerized and networked society where many of our actions leave a digital trace and affect other people’s actions. This has lead to the emergence of a new data-driven research field: mathematical methods of computer science, statistical physics and sociometry provide insights on a wide range of disciplines ranging from social science to human mobility. A recent important discovery is that search engine traffic (i.e., the number of requests submitted by users to search engines on the www) can be used to track and, in some cases, to anticipate the dynamics of social phenomena. Successful examples include unemployment levels, car and home sales, and epidemics spreading. Few recent works applied this approach to stock prices and market sentiment. However, it remains unclear if trends in financial markets can be anticipated by the collective wisdom of on-line users on the web. Here we show that daily trading volumes of stocks traded in NASDAQ-100 are correlated with daily volumes of queries related to the same stocks. In particular, query volumes anticipate in many cases peaks of trading by one day or more. Our analysis is carried out on a unique dataset of queries, submitted to an important web search engine, which enable us to investigate also the user behavior. We show that the query volume dynamics emerges from the collective but seemingly uncoordinated activity of many users. These findings contribute to the debate on the identification of early warnings of financial systemic risk, based on the activity of users of the www. PMID:22829871

  5. NEOview: Near Earth Object Data Discovery and Query

    NASA Astrophysics Data System (ADS)

    Tibbetts, M.; Elvis, M.; Galache, J. L.; Harbo, P.; McDowell, J. C.; Rudenko, M.; Van Stone, D.; Zografou, P.

    2013-10-01

    Missions to Near Earth Objects (NEOs) figure prominently in NASA's Flexible Path approach to human space exploration. NEOs offer insight into both the origins of the Solar System and of life, as well as a source of materials for future missions. With NEOview scientists can locate NEO datasets, explore metadata provided by the archives, and query or combine disparate NEO datasets in the search for NEO candidates for exploration. NEOview is a software system that illustrates how standards-based interfaces facilitate NEO data discovery and research. NEOview software follows a client-server architecture. The server is a configurable implementation of the International Virtual Observatory Alliance (IVOA) Table Access Protocol (TAP), a general interface for tabular data access, that can be deployed as a front end to existing NEO datasets. The TAP client, seleste, is a graphical interface that provides intuitive means of discovering NEO providers, exploring dataset metadata to identify fields of interest, and constructing queries to retrieve or combine data. It features a powerful, graphical query builder capable of easing the user's introduction to table searches. Through science use cases, NEOview demonstrates how potential targets for NEO rendezvous could be identified by combining data from complementary sources. Through deployment and operations, it has been shown that the software components are data independent and configurable to many different data servers. As such, NEOview's TAP server and seleste TAP client can be used to create a seamless environment for data discovery and exploration for tabular data in any astronomical archive.

  6. Query-Biased Preview over Outsourced and Encrypted Data

    PubMed Central

    Luo, Guangchun; Qin, Ke; Chen, Aiguo

    2013-01-01

    For both convenience and security, more and more users encrypt their sensitive data before outsourcing it to a third party such as cloud storage service. However, searching for the desired documents becomes problematic since it is costly to download and decrypt each possibly needed document to check if it contains the desired content. An informative query-biased preview feature, as applied in modern search engine, could help the users to learn about the content without downloading the entire document. However, when the data are encrypted, securely extracting a keyword-in-context snippet from the data as a preview becomes a challenge. Based on private information retrieval protocol and the core concept of searchable encryption, we propose a single-server and two-round solution to securely obtain a query-biased snippet over the encrypted data from the server. We achieve this novel result by making a document (plaintext) previewable under any cryptosystem and constructing a secure index to support dynamic computation for a best matched snippet when queried by some keywords. For each document, the scheme has O(d) storage complexity and O(log(d/s) + s + d/s) communication complexity, where d is the document size and s is the snippet length. PMID:24078798

  7. FastQuery: A Parallel Indexing System for Scientific Data

    SciTech Connect

    Chou, Jerry; Wu, Kesheng; Prabhat,

    2011-07-29

    Modern scientific datasets present numerous data management and analysis challenges. State-of-the- art index and query technologies such as FastBit can significantly improve accesses to these datasets by augmenting the user data with indexes and other secondary information. However, a challenge is that the indexes assume the relational data model but the scientific data generally follows the array data model. To match the two data models, we design a generic mapping mechanism and implement an efficient input and output interface for reading and writing the data and their corresponding indexes. To take advantage of the emerging many-core architectures, we also develop a parallel strategy for indexing using threading technology. This approach complements our on-going MPI-based parallelization efforts. We demonstrate the flexibility of our software by applying it to two of the most commonly used scientific data formats, HDF5 and NetCDF. We present two case studies using data from a particle accelerator model and a global climate model. We also conducted a detailed performance study using these scientific datasets. The results show that FastQuery speeds up the query time by a factor of 2.5x to 50x, and it reduces the indexing time by a factor of 16 on 24 cores.

  8. GPU-accelerated minimum distance and clearance queries.

    PubMed

    Krishnamurthy, Adarsh; McMains, Sara; Haller, Kirk

    2011-06-01

    We present practical algorithms for accelerating distance queries on models made of trimmed NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized framework for using GPUs as coprocessors in accelerating CAD operations. By supplementing surface data with a surface bounding-box hierarchy on the GPU, we answer distance queries such as finding the closest point on a curved NURBS surface given any point in space and evaluating the clearance between two solid models constructed using multiple NURBS surfaces. We simultaneously output the parameter values corresponding to the solution of these queries along with the model space values. Though our algorithms make use of the programmable fragment processor, the accuracy is based on the model space precision, unlike earlier graphics algorithms that were based only on image space precision. In addition, we provide theoretical bounds for both the computed minimum distance values as well as the location of the closest point. Our algorithms are at least an order of magnitude faster and about two orders of magnitude more accurate than the commercial solid modeling kernel ACIS. PMID:21474862

  9. Exploring connectivity of the brain's white matter with dynamic queries.

    PubMed

    Sherbondy, Anthony; Akers, David; Mackenzie, Rachel; Dougherty, Robert; Wandell, Brian

    2005-01-01

    Diffusion Tensor Imaging (DTI) is a magnetic resonance imaging method that can be used to measure local information about the structure of white matter within the human brain. Combining DTI data with the computational methods of MR tractography, neuroscientists can estimate the locations and sizes of nerve bundles (white matter pathways) that course through the human brain. Neuroscientists have used visualization techniques to better understand tractography data, but they often struggle with the abundance and complexity of the pathways. In this paper, we describe a novel set of interaction techniques that make it easier to explore and interpret such pathways. Specifically, our application allows neuroscientists to place and interactively manipulate box or ellipsoid-shaped regions to selectively display pathways that pass through specific anatomical areas. These regions can be used in coordination with a simple and flexible query language which allows for arbitrary combinations of these queries using Boolean logic operators. A representation of the cortical surface is provided for specifying queries of pathways that may be relevant to gray matter structures and for displaying activation information obtained from functional magnetic resonance imaging. By precomputing the pathways and their statistical properties, we obtain the speed necessary for interactive question-and-answer sessions with brain researchers. We survey some questions that researchers have been asking about tractography data and show how our system can be used to answer these questions efficiently. PMID:16138552

  10. Aggregates, broccoli and cauliflower

    NASA Astrophysics Data System (ADS)

    Grey, Francois; Kjems, Jørgen K.

    1989-09-01

    Naturally grown structures with fractal characters like broccoli and cauliflower are discussed and compared with DLA-type aggregates. It is suggested that the branching density can be used to characterize the growth process and an experimental method to determine this parameter is proposed.

  11. Estimating Influenza Outbreaks Using Both Search Engine Query Data and Social Media Data in South Korea

    PubMed Central

    Woo, Hyekyung; Shim, Eunyoung; Lee, Jong-Koo; Lee, Chang-Gun; Kim, Seong Hwan

    2016-01-01

    Background As suggested as early as in 2006, logs of queries submitted to search engines seeking information could be a source for detection of emerging influenza epidemics if changes in the volume of search queries are monitored (infodemiology). However, selecting queries that are most likely to be associated with influenza epidemics is a particular challenge when it comes to generating better predictions. Objective In this study, we describe a methodological extension for detecting influenza outbreaks using search query data; we provide a new approach for query selection through the exploration of contextual information gleaned from social media data. Additionally, we evaluate whether it is possible to use these queries for monitoring and predicting influenza epidemics in South Korea. Methods Our study was based on freely available weekly influenza incidence data and query data originating from the search engine on the Korean website Daum between April 3, 2011 and April 5, 2014. To select queries related to influenza epidemics, several approaches were applied: (1) exploring influenza-related words in social media data, (2) identifying the chief concerns related to influenza, and (3) using Web query recommendations. Optimal feature selection by least absolute shrinkage and selection operator (Lasso) and support vector machine for regression (SVR) were used to construct a model predicting influenza epidemics. Results In total, 146 queries related to influenza were generated through our initial query selection approach. A considerable proportion of optimal features for final models were derived from queries with reference to the social media data. The SVR model performed well: the prediction values were highly correlated with the recent observed influenza-like illness (r=.956; P<.001) and virological incidence rate (r=.963; P<.001). Conclusions These results demonstrate the feasibility of using search queries to enhance influenza surveillance in South Korea. In

  12. Extensible query processing and data communication in geoscientific information systems

    NASA Astrophysics Data System (ADS)

    Shek, Eddie Chi-Ho

    Research interest in geoscientific data management, processing, and dissemination has significantly increased over the last few years. Geoscientific applications are characterized by the massive size and spatio-temporal nature of their datasets, as well as the complexity and variety of their operations. In this dissertation, we study issues concerning data modeling, query processing, and data communication in an extensible distributed information system designed to satisfy the requirements imposed by the characteristics of geoscientific applications. Data model and computation architecture form the basis of an information system. It is important that they fit the requirements imposed by the application to be supported. We define a conceptually simple yet expressive scientific data modeling framework, called the Field data model, that captures the structure of a wide variety of scientific and traditional data structures. In addition, it models a number of common higher-order scientific computation patterns hence allowing application-specific operations fitting these patterns to be naturally and seamless introduced. Parallel evaluation is one of the most effective approaches to deliver high query performance. At the same time, geoscientific information systems have to be extensible to accommodate user-defined application-specific operations. To support extensibility in parallel query optimization, we introduce a model that allows the implicit parallelism available in scientific operations to be declaratively captured. Query parallelism algorithms are developed to demonstrate how these information can be exploited to systematically generate efficient parallel query execution plans. The cost of data communication in a scientific information system can be expensive despite the advancement of networking technology, especially during the delivery of data to user over a wide-area network such as the Internet. We present a flexible object-oriented framework called FALCON to

  13. Lower bounds for identifying subset members with subset queries

    SciTech Connect

    Knill, E.

    1994-04-01

    An instance of a group testing problem is a set of objects {Omicron}and an unknown subset P of {Omicron}.The task is to determine P by using queries of the type ``does P intersect ``Q``, where Q is a subset of {Omicron}. This problem occurs in areas such as fault detection, multiaccess communications, optimal search, blood testing and chromosome mapping. Consider the two stage algorithm for solving a group testing problem where in the first stage, a predetermined set of queries, are asked in parallel, and in the second stage, P is determined by testing individual objects. Let n = {vert_bar}{Omicron}{vert_bar}. Suppose that P is generated by independently adding each {chi} {element_of}{Omicron} to P with probability p/n. Let q{sub 1} (q{sub 2}) be the number of queries asked in the first (second) stage of this algorithm. We show that if q{sub 1} = o(log(n) log(n)/log log(n)), then Exp(q{sub 2}) = n{sup l{minus}0(1)}, while there exist algorithms with q{sub 1} = O(log(n)log(n)/loglog(n)) and Exp(q{sub 2}) = o(l). The proof involves a relaxation technique which can be used with arbitrary distributions. The best previously known bound is q{sub 1} + Exp(q{sub 2}) = {Omega}(p log(n)). For general group testing algorithms, our results imply that if the average number of queries over the course of n{sup {gamma}} ({gamma} > 0) independent experiments is O n{sup l{minus}{element_of}}, then with high probability {Omega}(log(n)log(n)/loglog(n)) non-singleton subsets are queried. This settles a conjecture of Bill Bruno and David Torney and has important consequences for the use of group testing in screening DNA libraries and other applications where its is more cost effective to use non-adaptive algorithms and/or expensive to prepare a subset Q for its first test.

  14. Ceramic ware waste as coarse aggregate for structural concrete production.

    PubMed

    García-González, Julia; Rodríguez-Robles, Desirée; Juan-Valdés, Andrés; Morán-Del Pozo, Julia M; Guerra-Romero, M Ignacio

    2015-01-01

    The manufacture of any kind of product inevitably entails the production of waste. The quantity of waste generated by the ceramic industry, a very important sector in Spain, is between 5% and 8% of the final output and it is therefore necessary to find an effective waste recovery method. The aim of the study reported in the present article was to seek a sustainable means of managing waste from the ceramic industry through the incorporation of this type of waste in the total replacement of conventional aggregate (gravel) used in structural concrete. Having verified that the recycled ceramic aggregates met all the technical requirements imposed by current Spanish legislation, established in the Code on Structural Concrete (EHE-08), then it is prepared a control concrete mix and the recycled concrete mix using 100% recycled ceramic aggregate instead of coarse natural aggregate. The concretes obtained were subjected to the appropriate tests in order to conduct a comparison of their mechanical properties. The results show that the concretes made using ceramic sanitary ware aggregate possessed the same mechanical properties as those made with conventional aggregate. It is therefore possible to conclude that the reuse of recycled ceramic aggregate to produce recycled concrete is a feasible alternative for the sustainable management of this waste. PMID:25188783

  15. An overview of aggregate resources in the United States

    USGS Publications Warehouse

    Langer, William H.

    2002-01-01

    In 2000 the USA produced about 2.7 billion tonnes of aggregate worth about $13.7 billion. Both crushed stone and sand and gravel are produced in virtually every State, although limited quantities are available in the Gulf Coastal Plain, the Colorado Plateau , the Wyoming Basin and the Great Plains. Prices vary depending on the product and location. Most aggregates are transported by road, and minor amounts by railroad, barge on navigable inland channels, and through the Great Lake ports. Imports and exports of aggregates are very minor. A major amount f crushed stone aggregates is consumed by concrete aggregate. Recycled aggregates account for about 8% of total demand, although the amount recycled is thought to be increasing. Current issues facing the inductry unclude the differences in quality specifications between States, adjusting to the increasing concern for the impact of aggregate mining on the environmentm, health issues from particulate matter and crystalline silica, and the complexity of obtaining permits for extraction. Redcustion in the number od companies extracting aggregrates is likely to occur through acquisitions.

  16. Maximal Holevo Quantity Based on Weak Measurements

    PubMed Central

    Wang, Yao-Kun; Fei, Shao-Ming; Wang, Zhi-Xi; Cao, Jun-Peng; Fan, Heng

    2015-01-01

    The Holevo bound is a keystone in many applications of quantum information theory. We propose “ maximal Holevo quantity for weak measurements” as the generalization of the maximal Holevo quantity which is defined by the optimal projective measurements. The scenarios that weak measurements is necessary are that only the weak measurements can be performed because for example the system is macroscopic or that one intentionally tries to do so such that the disturbance on the measured system can be controlled for example in quantum key distribution protocols. We evaluate systematically the maximal Holevo quantity for weak measurements for Bell-diagonal states and find a series of results. Furthermore, we find that weak measurements can be realized by noise and project measurements. PMID:26090962

  17. Physical quantities involved in a Mueller matrix

    NASA Astrophysics Data System (ADS)

    Gil, José J.

    2016-05-01

    The polarimetric properties of a material medium are summarized in the sixteen elements of its associated Mueller matrix. The quantities carrying specific information on the significant polarimetric features have to be defined on the basis of the analysis of the mathematical structure of Mueller matrices. It is found that any Mueller matrix can be parameterized through two retardance vectors and ten quantities that are invariant under dual retarder transformations. This parameterization leads to proper definitions of the retardance and depolarization properties, which together with the diattenuation and polarizance properties provide complete polarimetric characterization of the sample under consideration.

  18. The influence of spin on thermodynamical quantities

    SciTech Connect

    Li, G.-Q.

    2007-03-15

    We use the brick-wall method to investigate thermodynamical quantities around a static Gibbons-Maeda dilaton black hole and show that each of these quantities contains an additional spin-dependent term and that the usual result that the entropy density, energy density, and pressure take the same forms as in flat spacetime holds only for the leading term. Our results are compatible with the early conclusions that the black hole entropy is not exactly proportional to the horizon area and that Hawking radiation is not purely thermal.

  19. Geometry-Based Distributed Spatial Skyline Queries in Wireless Sensor Networks

    PubMed Central

    Wang, Yan; Song, Baoyan; Wang, Junlu; Zhang, Li; Wang, Ling

    2016-01-01

    Algorithms for skyline querying based on wireless sensor networks (WSNs) have been widely used in the field of environmental monitoring. Because of the multi-dimensional nature of the problem of monitoring spatial position, traditional skyline query strategies cause enormous computational costs and energy consumption. To ensure the efficient use of sensor energy, a geometry-based distributed spatial query strategy (GDSSky) is proposed in this paper. Firstly, the paper presents a geometry-based region partition strategy. It uses the skyline area reduction method based on the convex hull vertices, to quickly query the spatial skyline data related to a specific query area, and proposes a regional partition strategy based on the triangulation method, to implement distributed queries in each sub-region and reduce the comparison times between nodes. Secondly, a sub-region clustering strategy is designed to group the data inside into clusters for parallel queries that can save time. Finally, the paper presents a distributed query strategy based on the data node tree to traverse all adjacent sensors’ monitoring locations. It conducts spatial skyline queries for spatial skyline data that have been obtained and not found respectively, so as to realize the parallel queries. A large number of simulation results shows that GDSSky can quickly return the places which are nearer to query locations and have larger pollution capacity, and significantly reduce the WSN energy consumption. PMID:27043563

  20. Geometry-Based Distributed Spatial Skyline Queries in Wireless Sensor Networks.

    PubMed

    Wang, Yan; Song, Baoyan; Wang, Junlu; Zhang, Li; Wang, Ling

    2016-01-01

    Algorithms for skyline querying based on wireless sensor networks (WSNs) have been widely used in the field of environmental monitoring. Because of the multi-dimensional nature of the problem of monitoring spatial position, traditional skyline query strategies cause enormous computational costs and energy consumption. To ensure the efficient use of sensor energy, a geometry-based distributed spatial query strategy (GDSSky) is proposed in this paper. Firstly, the paper presents a geometry-based region partition strategy. It uses the skyline area reduction method based on the convex hull vertices, to quickly query the spatial skyline data related to a specific query area, and proposes a regional partition strategy based on the triangulation method, to implement distributed queries in each sub-region and reduce the comparison times between nodes. Secondly, a sub-region clustering strategy is designed to group the data inside into clusters for parallel queries that can save time. Finally, the paper presents a distributed query strategy based on the data node tree to traverse all adjacent sensors' monitoring locations. It conducts spatial skyline queries for spatial skyline data that have been obtained and not found respectively, so as to realize the parallel queries. A large number of simulation results shows that GDSSky can quickly return the places which are nearer to query locations and have larger pollution capacity, and significantly reduce the WSN energy consumption. PMID:27043563

  1. CSRQ: Communication-Efficient Secure Range Queries in Two-Tiered Sensor Networks.

    PubMed

    Dai, Hua; Ye, Qingqun; Yang, Geng; Xu, Jia; He, Ruiliang

    2016-01-01

    In recent years, we have seen many applications of secure query in two-tiered wireless sensor networks. Storage nodes are responsible for storing data from nearby sensor nodes and answering queries from Sink. It is critical to protect data security from a compromised storage node. In this paper, the Communication-efficient Secure Range Query (CSRQ)-a privacy and integrity preserving range query protocol-is proposed to prevent attackers from gaining information of both data collected by sensor nodes and queries issued by Sink. To preserve privacy and integrity, in addition to employing the encoding mechanisms, a novel data structure called encrypted constraint chain is proposed, which embeds the information of integrity verification. Sink can use this encrypted constraint chain to verify the query result. The performance evaluation shows that CSRQ has lower communication cost than the current range query protocols. PMID:26907293

  2. CSRQ: Communication-Efficient Secure Range Queries in Two-Tiered Sensor Networks

    PubMed Central

    Dai, Hua; Ye, Qingqun; Yang, Geng; Xu, Jia; He, Ruiliang

    2016-01-01

    In recent years, we have seen many applications of secure query in two-tiered wireless sensor networks. Storage nodes are responsible for storing data from nearby sensor nodes and answering queries from Sink. It is critical to protect data security from a compromised storage node. In this paper, the Communication-efficient Secure Range Query (CSRQ)—a privacy and integrity preserving range query protocol—is proposed to prevent attackers from gaining information of both data collected by sensor nodes and queries issued by Sink. To preserve privacy and integrity, in addition to employing the encoding mechanisms, a novel data structure called encrypted constraint chain is proposed, which embeds the information of integrity verification. Sink can use this encrypted constraint chain to verify the query result. The performance evaluation shows that CSRQ has lower communication cost than the current range query protocols. PMID:26907293

  3. Photophoretic force on aggregate grains

    NASA Astrophysics Data System (ADS)

    Matthews, Lorin S.; Kimery, Jesse B.; Wurm, Gerhard; de Beule, Caroline; Kuepper, Markus; Hyde, Truell W.

    2016-01-01

    The photophoretic force may impact planetary formation by selectively moving solid particles based on their composition and structure. This generates collision velocities between grains of different sizes and sorts the dust in protoplanetary discs by composition. This numerical simulation studied the photophoretic force acting on fractal dust aggregates of μm-scale radii. Results show that aggregates tend to have greater photophoretic drift velocities than spheres of similar mass or radii, though with a greater spread in the velocity. While the drift velocities of compact aggregates continue to increase as the aggregates grow larger in size, fluffy aggregates have drift velocities which are relatively constant with size. Aggregates formed from an initially polydisperse size distribution of dust grains behave differently from aggregates formed from a monodisperse population, having smaller drift velocities with directions which deviate substantially from the direction of illumination. Results agree with microgravity experiments which show the difference of photophoretic forces with aggregation state.

  4. Framing memories: How the retrieval query format shapes the neural bases of remembering.

    PubMed

    Raposo, Ana; Frade, Sofia; Alves, Mara

    2016-08-01

    The way memory questions are framed influences the information that is searched, retrieved, and monitored during remembering. This fMRI study aimed at clarifying how the format of the retrieval query shapes the neural basis of source recollection. During encoding, participants made semantic (pleasantness) or perceptual (number of letters) judgments about words. Subsequently, in a source memory test, the retrieval query was manipulated such that for half of the items from each encoding task, the retrieval query emphasized the semantic source (i.e., semantic query format: "Is this word from the pleasantness task?"), whereas for the other half the retrieval query emphasized the alternate, perceptual source (i.e., perceptual query format: "Is this word from the letter task?"). The results showed that the semantic query format was associated with higher source recognition than the perceptual query format. This behavioral advantage was accompanied by increased activation in several regions associated to controlled semantic elaboration and monitoring of internally-generated features about the past event. In particular, for items semantically encoded, the semantic query, relative to the perceptual query, induced activation in medial prefrontal cortex (PFC), hippocampal, parahippocampal and middle temporal cortex. Conversely, for items perceptually encoded, the semantic query recruited the lateral PFC and occipital-fusiform areas. Interestingly, the semantic format also influenced the processing of new items, eliciting greater L lateral and medial PFC activation. In contrast, the perceptual query format (versus the semantic format) only prompted greater activation in R orbitofrontal cortex and the R inferior parietal lobe, for items encoded in a perceptual manner and for new items, respectively. The results highlight the role of the retrieval query format in source remembering, showing that the retrieval query that emphasizes the semantic source promotes the use of semantic

  5. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 8 2010-01-01 2010-01-01 false Minimum quantities. 966.53 Section 966.53 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE TOMATOES GROWN IN FLORIDA...

  6. Measurement of gas quantities by liquid displacement.

    NASA Technical Reports Server (NTRS)

    Christian, J. D.

    1973-01-01

    Derivation of equations relating the different variables involved in gas quantity measurements by liquid displacement from a Mariotte flask. The results are used to elucidate design criteria and operational procedures required for the realization of various degrees of desired accuracy down to 0.01%.

  7. Infants Make Quantity Discriminations for Substances

    ERIC Educational Resources Information Center

    Hespos, Susan J.; Dora, Begum; Rips, Lance J.; Christie, Stella

    2012-01-01

    Infants can track small groups of solid objects, and infants can respond when these quantities change. But earlier work is equivocal about whether infants can track continuous substances, such as piles of sand. Experiment 1 ("N" = 88) used a habituation paradigm to show infants can register changes in the size of piles of sand that they see poured…

  8. Practice Makes Perfect: Contracting Quantity and Quality.

    ERIC Educational Resources Information Center

    Reichert, Nancy

    2003-01-01

    Discusses how contract grading promotes quality writing as well as a larger quantity of writing. Considers how teachers can use contract grading to support and promote the behaviors, thinking skills, and writing skills they believe will help students create quality writing. Notes that contract grading leads students to write more, to have fewer…

  9. 49 CFR 172.315 - Limited quantities.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... and outer package quantity limits in § 173.27(f) of this subchapter. (1) Marking description. The top... the square-on-point must be at least 2 mm and the minimum dimension of each side must be 100 mm unless...) Marking Description. The top and bottom portions of the square-on-point and the border forming the...

  10. 36 CFR 223.220 - Quantity determination.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 36 Parks, Forests, and Public Property 2 2014-07-01 2014-07-01 false Quantity determination. 223.220 Section 223.220 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER, SPECIAL FOREST PRODUCTS, AND FOREST BOTANICAL...

  11. 36 CFR 223.220 - Quantity determination.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 36 Parks, Forests, and Public Property 2 2013-07-01 2013-07-01 false Quantity determination. 223.220 Section 223.220 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER, SPECIAL FOREST PRODUCTS, AND FOREST BOTANICAL...

  12. 36 CFR 223.220 - Quantity determination.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 36 Parks, Forests, and Public Property 2 2012-07-01 2012-07-01 false Quantity determination. 223.220 Section 223.220 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER, SPECIAL FOREST PRODUCTS, AND FOREST BOTANICAL...

  13. 36 CFR 223.220 - Quantity determination.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 36 Parks, Forests, and Public Property 2 2011-07-01 2011-07-01 false Quantity determination. 223.220 Section 223.220 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER, SPECIAL FOREST PRODUCTS, AND FOREST BOTANICAL...

  14. Hypergraph topological quantities for tagged social networks.

    PubMed

    Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido

    2009-09-01

    Recent years have witnessed the emergence of a new class of social networks, which require us to move beyond previously employed representations of complex graph structures. A notable example is that of the folksonomy, an online process where users collaboratively employ tags to resources to impart structure to an otherwise undifferentiated database. In a recent paper, we proposed a mathematical model that represents these structures as tripartite hypergraphs and defined basic topological quantities of interest. In this paper, we extend our model by defining additional quantities such as edge distributions, vertex similarity and correlations as well as clustering. We then empirically measure these quantities on two real life folksonomies, the popular online photo sharing site Flickr and the bookmarking site CiteULike. We find that these systems share similar qualitative features with the majority of complex networks that have been previously studied. We propose that the quantities and methodology described here can be used as a standard tool in measuring the structure of tagged networks. PMID:19905191

  15. Hypergraph topological quantities for tagged social networks

    NASA Astrophysics Data System (ADS)

    Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido

    2009-09-01

    Recent years have witnessed the emergence of a new class of social networks, which require us to move beyond previously employed representations of complex graph structures. A notable example is that of the folksonomy, an online process where users collaboratively employ tags to resources to impart structure to an otherwise undifferentiated database. In a recent paper, we proposed a mathematical model that represents these structures as tripartite hypergraphs and defined basic topological quantities of interest. In this paper, we extend our model by defining additional quantities such as edge distributions, vertex similarity and correlations as well as clustering. We then empirically measure these quantities on two real life folksonomies, the popular online photo sharing site Flickr and the bookmarking site CiteULike. We find that these systems share similar qualitative features with the majority of complex networks that have been previously studied. We propose that the quantities and methodology described here can be used as a standard tool in measuring the structure of tagged networks.

  16. Variation and Change in Northern Bavarian Quantity

    ERIC Educational Resources Information Center

    Drake, Derek

    2013-01-01

    This dissertation presents new research on the "Bavarian Quantity Law" (the BQL) in the northern Bavarian dialect of Hahnbach. Building upon earlier investigation of the BQL (cf. Bannert 1976a,b for Central Bavarian) this study examines the historical, phonological, and phonetic motivations for this feature as well the variability in its…

  17. Quantity language speakers show enhanced subcortical processing.

    PubMed

    Dawson, Caitlin; Aalto, Daniel; Šimko, Juraj; Putkinen, Vesa; Tervaniemi, Mari; Vainio, Martti

    2016-07-01

    The complex auditory brainstem response (cABR) can reflect language-based plasticity in subcortical stages of auditory processing. It is sensitive to differences between language groups as well as stimulus properties, e.g. intensity or frequency. It is also sensitive to the synchronicity of the neural population stimulated by sound, which results in increased amplitude of wave V. Finnish is a full-fledged quantity language, in which word meaning is dependent upon duration of the vowels and consonants. Previous studies have shown that Finnish speakers have enhanced behavioural sound duration discrimination ability and larger cortical mismatch negativity (MMN) to duration change compared to German and French speakers. The next step is to find out whether these enhanced duration discrimination abilities of quantity language speakers originate at the brainstem level. Since German has a complementary quantity contrast which restricts the possible patterns of short and long vowels and consonants, the current experiment compared cABR between nonmusician Finnish and German native speakers using seven short complex stimuli. Finnish speakers had a larger cABR peak amplitude than German speakers, while the peak onset latency was only affected by stimulus intensity and spectral band. The results suggest that early cABR responses are better synchronised for Finns, which could underpin the enhanced duration sensitivity of quantity language speakers. PMID:27297179

  18. Representation of relativistic quantities by trigonometric functions

    NASA Astrophysics Data System (ADS)

    Majerník, V.

    1986-06-01

    A ``space-time angle'' φ is defined by setting v=c(sin φ). This leads to a form of Lorentz transformations which uses simple real trigonometric functions and yields a graphic correlation of important relativistic quantities for particles and for corresponding de Broglie waves. A number of relativistic relationships is obtained by the use of common trigonometric identities and formulas.

  19. CALL, Prewriting Strategies, and EFL Writing Quantity

    ERIC Educational Resources Information Center

    Shafiee, Sajad; Koosha, Mansour; Afghar, Akbar

    2015-01-01

    This study sought to explore the effect of teaching prewriting strategies through different methods of input delivery (i.e. conventional, web-based, and hybrid) on EFL learners' writing quantity. In its quasi-experimental study, the researchers recruited 98 available sophomores, and assigned them to three experimental groups (conventional,…

  20. Units for quantities of dimension one

    NASA Astrophysics Data System (ADS)

    Dybkaer, René

    2004-02-01

    All quantities of dimension one are said to have the SI coherent derived unit "one" with the symbol '1'. (Single quotation marks are used here sometimes to indicate a quote, name, term or symbol; double quotation marks flag a concept when necessary.) Conventionally, the term and symbol may not be combined with the SI prefixes (except for the special terms and symbols for one and 1: radian, rad, and steradian, sr). This restriction is understandable, but leads to correct yet impractical alternatives and ISO deprecated symbols such as ppm or in some cases redundant combinations of units, such as mg/kg. "Number of entities" is dimensionally independent of the current base quantities and should take its rightful place among them. The corresponding base unit is "one". A working definition is given. Other quantities of dimension one are derived as fraction, ratio, efficiency, relative quantity, relative increment or characteristic number and may also use the unit "one", whether considered to be base or derived. The special term 'uno' and symbol 'u' in either case are proposed, allowing combination with SI prefixes.

  1. Quantity, Quality, Children's Characteristics, and Vocabulary Learning

    ERIC Educational Resources Information Center

    Walsh, Bridget A.

    2008-01-01

    This review of literature shows that how often a child is read to is related to subsequent gains in vocabulary. Not only do adults differ in the frequency with which they read to children (quantity), they also vary in reading style (quality). Several studies have proposed that the cognitive demand level of questions children are asked may be…

  2. Does Query Expansion Limit Our Learning? A Comparison of Social-Based Expansion to Content-Based Expansion for Medical Queries on the Internet

    PubMed Central

    Pentoney, Christopher; Harwell, Jeff; Leroy, Gondy

    2014-01-01

    Searching for medical information online is a common activity. While it has been shown that forming good queries is difficult, Google’s query suggestion tool, a type of query expansion, aims to facilitate query formation. However, it is unknown how this expansion, which is based on what others searched for, affects the information gathering of the online community. To measure the impact of social-based query expansion, this study compared it with content-based expansion, i.e., what is really in the text. We used 138,906 medical queries from the AOL User Session Collection and expanded them using Google’s Autocomplete method (social-based) and the content of the Google Web Corpus (content-based). We evaluated the specificity and ambiguity of the expansion terms for trigram queries. We also looked at the impact on the actual results using domain diversity and expansion edit distance. Results showed that the social-based method provided more precise expansion terms as well as terms that were less ambiguous. Expanded queries do not differ significantly in diversity when expanded using the social-based method (6.72 different domains returned in the first ten results, on average) vs. content-based method (6.73 different domains, on average). PMID:25954406

  3. Does query expansion limit our learning? A comparison of social-based expansion to content-based expansion for medical queries on the internet.

    PubMed

    Pentoney, Christopher; Harwell, Jeff; Leroy, Gondy

    2014-01-01

    Searching for medical information online is a common activity. While it has been shown that forming good queries is difficult, Google's query suggestion tool, a type of query expansion, aims to facilitate query formation. However, it is unknown how this expansion, which is based on what others searched for, affects the information gathering of the online community. To measure the impact of social-based query expansion, this study compared it with content-based expansion, i.e., what is really in the text. We used 138,906 medical queries from the AOL User Session Collection and expanded them using Google's Autocomplete method (social-based) and the content of the Google Web Corpus (content-based). We evaluated the specificity and ambiguity of the expansion terms for trigram queries. We also looked at the impact on the actual results using domain diversity and expansion edit distance. Results showed that the social-based method provided more precise expansion terms as well as terms that were less ambiguous. Expanded queries do not differ significantly in diversity when expanded using the social-based method (6.72 different domains returned in the first ten results, on average) vs. content-based method (6.73 different domains, on average). PMID:25954406

  4. Categorical and Specificity Differences between User-Supplied Tags and Search Query Terms for Images. An Analysis of "Flickr" Tags and Web Image Search Queries

    ERIC Educational Resources Information Center

    Chung, EunKyung; Yoon, JungWon

    2009-01-01

    Introduction: The purpose of this study is to compare characteristics and features of user supplied tags and search query terms for images on the "Flickr" Website in terms of categories of pictorial meanings and level of term specificity. Method: This study focuses on comparisons between tags and search queries using Shatford's categorization…

  5. The I4 Online Query Tool for Earth Observations Data

    NASA Technical Reports Server (NTRS)

    Stefanov, William L.; Vanderbloemen, Lisa A.; Lawrence, Samuel J.

    2015-01-01

    The NASA Earth Observation System Data and Information System (EOSDIS) delivers an average of 22 terabytes per day of data collected by orbital and airborne sensor systems to end users through an integrated online search environment (the Reverb/ECHO system). Earth observations data collected by sensors on the International Space Station (ISS) are not currently included in the EOSDIS system, and are only accessible through various individual online locations. This increases the effort required by end users to query multiple datasets, and limits the opportunity for data discovery and innovations in analysis. The Earth Science and Remote Sensing Unit of the Exploration Integration and Science Directorate at NASA Johnson Space Center has collaborated with the School of Earth and Space Exploration at Arizona State University (ASU) to develop the ISS Instrument Integration Implementation (I4) data query tool to provide end users a clean, simple online interface for querying both current and historical ISS Earth Observations data. The I4 interface is based on the Lunaserv and Lunaserv Global Explorer (LGE) open-source software packages developed at ASU for query of lunar datasets. In order to avoid mirroring existing databases - and the need to continually sync/update those mirrors - our design philosophy is for the I4 tool to be a pure query engine only. Once an end user identifies a specific scene or scenes of interest, I4 transparently takes the user to the appropriate online location to download the data. The tool consists of two public-facing web interfaces. The Map Tool provides a graphic geobrowser environment where the end user can navigate to an area of interest and select single or multiple datasets to query. The Map Tool displays active image footprints for the selected datasets (Figure 1). Selecting a footprint will open a pop-up window that includes a browse image and a link to available image metadata, along with a link to the online location to order or

  6. Proteins aggregation and human diseases

    NASA Astrophysics Data System (ADS)

    Hu, Chin-Kun

    2015-04-01

    Many human diseases and the death of most supercentenarians are related to protein aggregation. Neurodegenerative diseases include Alzheimer's disease (AD), Huntington's disease (HD), Parkinson's disease (PD), frontotemporallobar degeneration, etc. Such diseases are due to progressive loss of structure or function of neurons caused by protein aggregation. For example, AD is considered to be related to aggregation of Aβ40 (peptide with 40 amino acids) and Aβ42 (peptide with 42 amino acids) and HD is considered to be related to aggregation of polyQ (polyglutamine) peptides. In this paper, we briefly review our recent discovery of key factors for protein aggregation. We used a lattice model to study the aggregation rates of proteins and found that the probability for a protein sequence to appear in the conformation of the aggregated state can be used to determine the temperature at which proteins can aggregate most quickly. We used molecular dynamics and simple models of polymer chains to study relaxation and aggregation of proteins under various conditions and found that when the bending-angle dependent and torsion-angle dependent interactions are zero or very small, then protein chains tend to aggregate at lower temperatures. All atom models were used to identify a key peptide chain for the aggregation of insulin chains and to find that two polyQ chains prefer anti-parallel conformation. It is pointed out that in many cases, protein aggregation does not result from protein mis-folding. A potential drug from Chinese medicine was found for Alzheimer's disease.

  7. QCS: a system for querying, clustering and summarizing documents.

    SciTech Connect

    Dunlavy, Daniel M.; Schlesinger, Judith D. (Center for Computing Sciences, Bowie, MD); O'Leary, Dianne P.; Conroy, John M.

    2006-10-01

    Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence 'trimming', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the

  8. QCS : a system for querying, clustering, and summarizing documents.

    SciTech Connect

    Dunlavy, Daniel M.

    2006-08-01

    Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence ''trimming'', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design, and the

  9. 48 CFR 52.236-16 - Quantity Surveys.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 48 Federal Acquisition Regulations System 2 2013-10-01 2013-10-01 false Quantity Surveys. 52.236... Quantity Surveys. As prescribed in 36.516, the contracting officer may insert the following clause in... payment based on quantity surveys is contemplated: Quantity Surveys (APR 1984) (a) Quantity surveys...

  10. 48 CFR 52.236-16 - Quantity Surveys.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 48 Federal Acquisition Regulations System 2 2012-10-01 2012-10-01 false Quantity Surveys. 52.236... Quantity Surveys. As prescribed in 36.516, the contracting officer may insert the following clause in... payment based on quantity surveys is contemplated: Quantity Surveys (APR 1984) (a) Quantity surveys...

  11. 48 CFR 52.236-16 - Quantity Surveys.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 2 2010-10-01 2010-10-01 false Quantity Surveys. 52.236... Quantity Surveys. As prescribed in 36.516, the contracting officer may insert the following clause in... payment based on quantity surveys is contemplated: Quantity Surveys (APR 1984) (a) Quantity surveys...

  12. 48 CFR 52.236-16 - Quantity Surveys.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 48 Federal Acquisition Regulations System 2 2014-10-01 2014-10-01 false Quantity Surveys. 52.236... Quantity Surveys. As prescribed in 36.516, the contracting officer may insert the following clause in... payment based on quantity surveys is contemplated: Quantity Surveys (APR 1984) (a) Quantity surveys...

  13. 48 CFR 52.236-16 - Quantity Surveys.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 48 Federal Acquisition Regulations System 2 2011-10-01 2011-10-01 false Quantity Surveys. 52.236... Quantity Surveys. As prescribed in 36.516, the contracting officer may insert the following clause in... payment based on quantity surveys is contemplated: Quantity Surveys (APR 1984) (a) Quantity surveys...

  14. Advanced Query and Data Mining Capabilities for MaROS

    NASA Technical Reports Server (NTRS)

    Wang, Paul; Wallick, Michael N.; Allard, Daniel A.; Gladden, Roy E.; Hy, Franklin H.

    2013-01-01

    The Mars Relay Operational Service (MaROS) comprises a number of tools to coordinate, plan, and visualize various aspects of the Mars Relay network. These levels include a Web-based user interface, a back-end "ReSTlet" built in Java, and databases that store the data as it is received from the network. As part of MaROS, the innovators have developed and implemented a feature set that operates on several levels of the software architecture. This new feature is an advanced querying capability through either the Web-based user interface, or through a back-end REST interface to access all of the data gathered from the network. This software is not meant to replace the REST interface, but to augment and expand the range of available data. The current REST interface provides specific data that is used by the MaROS Web application to display and visualize the information; however, the returned information from the REST interface has typically been pre-processed to return only a subset of the entire information within the repository, particularly only the information that is of interest to the GUI (graphical user interface). The new, advanced query and data mining capabilities allow users to retrieve the raw data and/or to perform their own data processing. The query language used to access the repository is a restricted subset of the structured query language (SQL) that can be built safely from the Web user interface, or entered as freeform SQL by a user. The results are returned in a CSV (Comma Separated Values) format for easy exporting to third party tools and applications that can be used for data mining or user-defined visualization and interpretation. This is the first time that a service is capable of providing access to all cross-project relay data from a single Web resource. Because MaROS contains the data for a variety of missions from the Mars network, which span both NASA and ESA, the software also establishes an access control list (ACL) on each data record

  15. The JAVA-based DICOM query interface DicoSE.

    PubMed

    Prinz, Michael; Fischer, Georg; Schuster, Ernst

    2005-03-01

    DICOM 3 is a very elaborate standard for the communication between medical image devices. It is published in several parts by the National Electrical Manufacturers Association (NEMA). To adequately visualize the data structure defined in parts 3, 5 and 6 of the DICOM standard, we implemented the web based Dicom Search Engine (DicoSE). It allows for querying the DICOM standard data dictionary for defined data fields and visualizes the topology of the data which is inherently present in DICOM datasets. For the administration of the underlying data a web based administration interface is provided. The service is entirely based on freely available software. PMID:15694639

  16. Concepts and implementations of natural language query systems

    NASA Technical Reports Server (NTRS)

    Dominick, Wayne D. (Editor); Liu, I-Hsiung

    1984-01-01

    The currently developed user language interfaces of information systems are generally intended for serious users. These interfaces commonly ignore potentially the largest user group, i.e., casual users. This project discusses the concepts and implementations of a natural query language system which satisfy the nature and information needs of casual users by allowing them to communicate with the system in the form of their native (natural) language. In addition, a framework for the development of such an interface is also introduced for the MADAM (Multics Approach to Data Access and Management) system at the University of Southwestern Louisiana.

  17. Incentives for Delay-Constrained Data Query and Feedback in Mobile Opportunistic Crowdsensing

    PubMed Central

    Liu, Yang; Li, Fan; Wang, Yu

    2016-01-01

    In this paper, we propose effective data collection schemes that stimulate cooperation between selfish users in mobile opportunistic crowdsensing. A query issuer generates a query and requests replies within a given delay budget. When a data provider receives the query for the first time from an intermediate user, the former replies to it and authorizes the latter as the owner of the reply. Different data providers can reply to the same query. When a user that owns a reply meets the query issuer that generates the query, it requests the query issuer to pay credits. The query issuer pays credits and provides feedback to the data provider, which gives the reply. When a user that carries a feedback meets the data provider, the data provider pays credits to the user in order to adjust its claimed expertise. Queries, replies and feedbacks can be traded between mobile users. We propose an effective mechanism to define rewards for queries, replies and feedbacks. We formulate the bargain process as a two-person cooperative game, whose solution is found by using the Nash theorem. To improve the credit circulation, we design an online auction process, in which the wealthy user can buy replies and feedbacks from the starving one using credits. We have carried out extensive simulations based on real-world traces to evaluate the proposed schemes. PMID:27455261

  18. Incentives for Delay-Constrained Data Query and Feedback in Mobile Opportunistic Crowdsensing.

    PubMed

    Liu, Yang; Li, Fan; Wang, Yu

    2016-01-01

    In this paper, we propose effective data collection schemes that stimulate cooperation between selfish users in mobile opportunistic crowdsensing. A query issuer generates a query and requests replies within a given delay budget. When a data provider receives the query for the first time from an intermediate user, the former replies to it and authorizes the latter as the owner of the reply. Different data providers can reply to the same query. When a user that owns a reply meets the query issuer that generates the query, it requests the query issuer to pay credits. The query issuer pays credits and provides feedback to the data provider, which gives the reply. When a user that carries a feedback meets the data provider, the data provider pays credits to the user in order to adjust its claimed expertise. Queries, replies and feedbacks can be traded between mobile users. We propose an effective mechanism to define rewards for queries, replies and feedbacks. We formulate the bargain process as a two-person cooperative game, whose solution is found by using the Nash theorem. To improve the credit circulation, we design an online auction process, in which the wealthy user can buy replies and feedbacks from the starving one using credits. We have carried out extensive simulations based on real-world traces to evaluate the proposed schemes. PMID:27455261

  19. Dynamics of fire ant aggregations

    NASA Astrophysics Data System (ADS)

    Tennenbaum, Michael; Hu, David; Fernandez-Nieves, Alberto

    Fire ant aggregations are an inherently active system. Each ant harvests its own energy and can convert it into motion. The motion of individual ants contributes non-trivially to the bulk material properties of the aggregation. We have measured some of these properties using plate-plate rheology, where the response to an applied external force or deformation is measured. In this talk, we will present data pertaining to the aggregation behavior in the absence of any external force. We quantify the aggregation dynamics by monitoring the rotation of the top plate and by measuring the normal force. We then compare the results with visualizations of 2D aggregations.

  20. What Do People Ask for on the Web and How Do They Ask It: ASK JEEVES Query Analysis.

    ERIC Educational Resources Information Center

    Spink, Amanda; Ozmutlu, H. Cenk

    2001-01-01

    Reports findings from a study examining the nature of queries submitted to Ask Jeeves-a publicly accessible question and answer search engine. Some 30,000 queries from a dataset of 800,000, or 3.75%, were analyzed. Results include: many queries not in question format; four types of user queries: keyword, Boolean, question, and request; and common…

  1. MP3C - the Minor Planet Physical Properties Catalogue: a New VO Service For Multi-database Query

    NASA Astrophysics Data System (ADS)

    Tanga, Paolo; Delbo, M.; Gerakis, J.

    2013-10-01

    In the last few years we witnessed a large growth in the number of asteroids for which we have physical properties. However, these data are dispersed in a multiplicity of catalogs. Extracting data and combining them for further analysis requires custom tools, a situation further complicated by the variety of data sources, some of them standardized (Planetary Data System) others not. With these problems in mind, we created a new Virtual Observatory service named “Minor Planet Physical Properties Catalogue” (abbreviated as MP3C - http://mp3c.oca.eu/). MP3C is not a new database, but rather a portal allowing the user to access selected properties of objects by easy SQL query, even from different sources. At present, such diverse data as orbital parameters, photometric and light curve parameters, sizes and albedos derived by IRAS, AKARI and WISE, SDSS colors, SMASS taxonomy, family membership, satellite data, stellar occultation results, are included. Other data sources will be added in the near future. The physical properties output of the MP3C can be tuned by the users by query criteria based upon ranges of values of the ingested quantities. The resulting list of object can be used for interactive plots through standard VO tools such as TOPCAT. Also, their ephemerids and visibilities from given sites can be computed. We are targeting full VO compliance for providing a new standardized service to the community.

  2. Fire effects on soil aggregation: A review

    NASA Astrophysics Data System (ADS)

    Mataix-Solera, J.; Cerdà, A.; Arcenegui, V.; Jordán, A.; Zavala, L. M.

    2011-11-01

    Fire can affect soil properties depending on a number of factors including fire severity and soil type. Aggregate stability (AS) refers to soil structure resilience in response to external mechanical forces. Many authors consider soil aggregation to be a parameter reflecting soil health, as it depends on chemical, physical and biological factors. The response of AS to forest fires is complex, since it depends on how fire has affected other related properties such as organic matter content, soil microbiology, water repellency and soil mineralogy. Opinions differ concerning the effect of fire on AS. Some authors have observed a decrease in AS in soils affected by intense wildfire or severe laboratory heating. However, others have reported increases. We provide an up to date review of the research on this topic and an analysis of the causes for the different effects observed. The implications for soil system functioning and for the hydrology of the affected areas are also discussed. Generally, low severity fires do not produce notable changes in AS, although in some cases an increase has been observed and attributed to increased water repellency. In contrast, high severity fires can induce important changes in this property, but with different effects depending on the type of soil affected. The patterns observed can vary from a disaggregation as a consequence of the organic matter destruction, to a strong aggregation if a recrystallization of some minerals such as Fe and Al oxyhydroxides occurs when they are present in sufficient quantities in the soil, after exposure to high temperatures. Because of the complexity of the different possible effects and reasons for the potential changes in the fire-affected soil aggregates, the inclusion of other parameters in the studies is necessary to understand the results. The suggested parameters to include in the examination of AS are: soil organic matter, microbial biomass, water repellency, texture, aggregate size distribution

  3. Observable quantities for electrodiffusion processes in membranes.

    PubMed

    Garrido, Javier

    2008-03-13

    Electrically driven ion transport processes in a membrane system are analyzed in terms of observable quantities, such as the apparent volume flow, the time dependence of the electrolyte concentration in one cell compartment, and the electrical potential difference between the electrodes. The relations between the fluxes and these observable quantities are rigorously deduced from balances for constituent mass and solution volume. These relations improve the results for the transport coefficients up to 25% with respect to those obtained using simplified expressions common in the literature. Given the practical importance of ionic transport numbers and the solvent transference number in the phenomenological description of electrically driven processes, the transport equations are presented using the electrolyte concentration difference and the electric current as the drivers of the different constituents. Because various electric potential differences can be used in this traditional irreversible thermodynamics approach, the advantages of the formulation of the transport equations in terms of concentration difference and electric current are emphasized. PMID:18284224

  4. A conserved quantity in thin body dynamics

    NASA Astrophysics Data System (ADS)

    Hanna, James; Pendar, Hodjat

    We use an example from textile processing to illustrate the utility of a conserved quantity associated with metric symmetry in a thin body. This quantity, when combined with the usual linear and angular momentum currents, allows us to construct a four-parameter family of curves representing the equilibria of a rotating, flowing string. To achieve this, we introduce a non-material action of mixed Lagrangian-Eulerian type, applicable to fixed windows of axially-moving systems. We will point out intriguing similarities with Bernoulli's equation, discuss the effects of axial flow on rotating conservative systems, and make connections with 19th- and 20th-century results on the dynamics of cables.

  5. Radiation Protection Quantities for Near Earth Environments

    NASA Technical Reports Server (NTRS)

    Clowdsley, Martha S.; Wilson, John W.; Kim, Myung-Hee; Anderson, Brooke M.; Nealy, John E.

    2004-01-01

    As humans travel beyond the protection of the Earth's magnetic field and mission durations grow, risk due to radiation exposure will increase and may become the limiting factor for such missions. Here, the dosimetric quantities recommended by the National Council on Radiation Protection and Measurements (NCRP) for the evaluation of health risk due to radiation exposure, effective dose and gray-equivalent to eyes, skin, and blood forming organs (BFO), are calculated for several near Earth environments. These radiation protection quantities are evaluated behind two different shielding materials, aluminum and polyethylene. Since exposure limits for missions beyond low Earth orbit (LEO) have not yet been defined, results are compared to limits recommended by the NCRP for LEO operations.

  6. Enabling complex queries to drug information sources through functional composition.

    PubMed

    Peters, Lee; Mortensen, Jonathan; Nguyen, Thang; Bodenreider, Olivier

    2013-01-01

    Our objective was to enable an end-user to create complex queries to drug information sources through functional composition, by creating sequences of functions from application program interfaces (API) to drug terminologies. The development of a functional composition model seeks to link functions from two distinct APIs. An ontology was developed using Protégé to model the functions of the RxNorm and NDF-RT APIs by describing the semantics of their input and output. A set of rules were developed to define the interoperable conditions for functional composition. The operational definition of interoperability between function pairs is established by executing the rules on the ontology. We illustrate that the functional composition model supports common use cases, including checking interactions for RxNorm drugs and deploying allergy lists defined in reference to drug properties in NDF-RT. This model supports the RxMix application (http://mor.nlm.nih.gov/RxMix/), an application we developed for enabling complex queries to the RxNorm and NDF-RT APIs. PMID:23920645

  7. RadSearch: a RIS/PACS integrated query tool

    NASA Astrophysics Data System (ADS)

    Tsao, Sinchai; Documet, Jorge; Moin, Paymann; Wang, Kevin; Liu, Brent J.

    2008-03-01

    Radiology Information Systems (RIS) contain a wealth of information that can be used for research, education, and practice management. However, the sheer amount of information available makes querying specific data difficult and time consuming. Previous work has shown that a clinical RIS database and its RIS text reports can be extracted, duplicated and indexed for searches while complying with HIPAA and IRB requirements. This project's intent is to provide a software tool, the RadSearch Toolkit, to allow intelligent indexing and parsing of RIS reports for easy yet powerful searches. In addition, the project aims to seamlessly query and retrieve associated images from the Picture Archiving and Communication System (PACS) in situations where an integrated RIS/PACS is in place - even subselecting individual series, such as in an MRI study. RadSearch's application of simple text parsing techniques to index text-based radiology reports will allow the search engine to quickly return relevant results. This powerful combination will be useful in both private practice and academic settings; administrators can easily obtain complex practice management information such as referral patterns; researchers can conduct retrospective studies with specific, multiple criteria; teaching institutions can quickly and effectively create thorough teaching files.

  8. Collapse results for query languages in database theory

    NASA Astrophysics Data System (ADS)

    Dudakov, S. M.; Taitslin, M. A.

    2006-04-01

    This is a survey of collapse results obtained mainly by members of the Tver State University seminar on the theoretical foundations of computer science. Attention is focused on the relative isolation and pseudo-finite homogeneity properties and universes without the independence property. The Baldwin-Benedikt reducibility theorem is proved for these universes. The Dudakov boundedness theorem is proved for reducible theories. The relative isolation theorem is proved for reducible and bounded theories, and as a consequence the collapse theorem is obtained for reducible theories. It is noted that reducibility is equivalent to the relative isolation property. On the other hand, results of Dudakov are presented showing that the effectively reducible theories having an effective almost indiscernible sequence admit an effective collapse of locally generic queries using not only ordering and names of stored tables but also relations and operations of the universe, into queries not using the relations and operations of the universe. Also presented is Dudakov's example of an enrichment of the Presburger arithmetic for which the collapse theorem fails but the elementary theory of the enrichment is decidable. This answers some open questions in the negative.

  9. Image query and indexing for digital x rays

    NASA Astrophysics Data System (ADS)

    Long, L. Rodney; Thoma, George R.

    1998-12-01

    The web-based medical information retrieval system (WebMIRS) allows interned access to databases containing 17,000 digitized x-ray spine images and associated text data from National Health and Nutrition Examination Surveys (NHANES). WebMIRS allows SQL query of the text, and viewing of the returned text records and images using a standard browser. We are now working (1) to determine utility of data directly derived from the images in our databases, and (2) to investigate the feasibility of computer-assisted or automated indexing of the images to support image retrieval of images of interest to biomedical researchers in the field of osteoarthritis. To build an initial database based on image data, we are manually segmenting a subset of the vertebrae, using techniques from vertebral morphometry. From this, we will derive and add to the database vertebral features. This image-derived data will enhance the user's data access capability by enabling the creation of combined SQL/image-content queries.

  10. Investigating the Semantic Gap through Query Log Analysis

    NASA Astrophysics Data System (ADS)

    Mika, Peter; Meij, Edgar; Zaragoza, Hugo

    Significant efforts have focused in the past years on bringing large amounts of metadata online and the success of these efforts can be seen by the impressive number of web sites exposing data in RDFa or RDF/XML. However, little is known about the extent to which this data fits the needs of ordinary web users with everyday information needs. In this paper we study what we perceive as the semantic gap between the supply of data on the Semantic Web and the needs of web users as expressed in the queries submitted to a major Web search engine. We perform our analysis on both the level of instances and ontologies. First, we first look at how much data is actually relevant to Web queries and what kind of data is it. Second, we provide a generic method to extract the attributes that Web users are searching for regarding particular classes of entities. This method allows to contrast class definitions found in Semantic Web vocabularies with the attributes of objects that users are interested in. Our findings are crucial to measuring the potential of semantic search, but also speak to the state of the Semantic Web in general.

  11. Enabling Complex Queries to Drug Information Sources through Functional Composition

    PubMed Central

    Peters, Lee; Mortensen, Jonathan; Nguyen, Thang; Bodenreider, Olivier

    2015-01-01

    Our objective was to enable an end-user to create complex queries to drug information sources through functional composition, by creating sequences of functions from application program interfaces (API) to drug terminologies. The development of a functional composition model seeks to link functions from two distinct APIs. An ontology was developed using Protégé to model the functions of the RxNorm and NDF-RT APIs by describing the semantics of their input and output. A set of rules were developed to define the interoperable conditions for functional composition. The operational definition of interoperability between function pairs is established by executing the rules on the ontology. We illustrate that the functional composition model supports common use cases, including checking interactions for RxNorm drugs and deploying allergy lists defined in reference to drug properties in NDF-RT. This model supports the RxMix application (http://mor.nlm.nih.gov/RxMix/), an application we developed for enabling complex queries to the RxNorm and NDF-RT APIs. PMID:23920645

  12. Large-Scale Continuous Subgraph Queries on Streams

    SciTech Connect

    Choudhury, Sutanay; Holder, Larry; Chin, George; Feo, John T.

    2011-11-30

    Graph pattern matching involves finding exact or approximate matches for a query subgraph in a larger graph. It has been studied extensively and has strong applications in domains such as computer vision, computational biology, social networks, security and finance. The problem of exact graph pattern matching is often described in terms of subgraph isomorphism which is NP-complete. The exponential growth in streaming data from online social networks, news and video streams and the continual need for situational awareness motivates a solution for finding patterns in streaming updates. This is also the prime driver for the real-time analytics market. Development of incremental algorithms for graph pattern matching on streaming inputs to a continually evolving graph is a nascent area of research. Some of the challenges associated with this problem are the same as found in continuous query (CQ) evaluation on streaming databases. This paper reviews some of the representative work from the exhaustively researched field of CQ systems and identifies important semantics, constraints and architectural features that are also appropriate for HPC systems performing real-time graph analytics. For each of these features we present a brief discussion of the challenge encountered in the database realm, the approach to the solution and state their relevance in a high-performance, streaming graph processing framework.

  13. Enzyme catalysis with small ionic liquid quantities.

    PubMed

    Fischer, Fabian; Mutschler, Julien; Zufferey, Daniel

    2011-04-01

    Enzyme catalysis with minimal ionic liquid quantities improves reaction rates, stereoselectivity and enables solvent-free processing. In particular the widely used lipases combine well with many ionic liquids. Demonstrated applications are racemate separation, esterification and glycerolysis. Minimal solvent processing is also an alternative to sluggish solvent-free catalysis. The method allows simplified down-stream processing, as only traces of ionic liquids have to be removed. PMID:21107639

  14. Mass quantity gauging by RF mode analysis

    NASA Technical Reports Server (NTRS)

    Collier, R. S.; Ellerbruch, D.; Cruz, J. E.; Stokes, R. W.; Luft, P. E.; Peterson, R. G.; Hiester, A. E.

    1973-01-01

    Work done to date is reported concerning Radio Frequency Mass Quantity Gauging. Experimental apparatus has been designed and tested which measures the resonant frequencies of a tank in the time domain. These frequencies correspond to the total mass of fluid within the tank. Experimental results are discussed for nitrogen and hydrogen in normal gravity both in the supercritical state and also in the two phase (liquid-gas) region. Theoretical discussions for more general cases are given.

  15. Shielded radiation protection quantities beyond LEO

    NASA Astrophysics Data System (ADS)

    Clowdsley, M. S.; Wilson, J. W.; Kim, M. Y.; Anderson, B. M.; Nealy, J. E.

    The National Council on Radiation Protection and Measurements (NCRP) has recommended that the quantities used to evaluate health risk to astronauts due to radiation exposure be effective dose and gray-equivalent. The NCRP recommends that effective dose be the limiting quantity for prevention of stochastic effects. Effective dose is a measure of whole body exposure, a weighted average of dose equivalent to a number body tissues for which the NCRP has adopted tissue weighting factors recommended by the International Commission on Radiation Protection (ICRP). For deterministic effects, the NCRP has recommended that gray-equivalent be used. Gray-equivalent is evaluated for specific critical organs and is the weighted sum of absorbed dose from field components to that organ using the relative biological effectiveness (RBE) number for that field component. RBE numbers recommended by the NCRP are used. The NCRP has provided effective dose limits as well as limits for gray-equivalent to eyes, skin, and blood forming organs (BFO) for astronauts in low earth orbit (LEO). As yet, no such limits have been defined for astronaut operations beyond LEO. In this study, the radiation protection quantities, effective dose and gray-equivalent to the eyes, skin, and BFO, are calculated for several environments beyond LEO. The lunar surface and Martian environments are included. For each environment, these radiation protection quantities are calculated behind varying amounts of various types of shielding materials. The results are compared to the exposure limits for LEO, since limits have not yet been defined for interplanetary missions. The benefits of using shielding material containing hydrogen and choosing optimal mission times are discussed.

  16. Quantity Discrimination in Wolves (Canis lupus)

    PubMed Central

    Utrata, Ewelina; Virányi, Zsófia; Range, Friederike

    2012-01-01

    Quantity discrimination has been studied extensively in different non-human animal species. In the current study, we tested 11 hand-raised wolves (Canis lupus) in a two-way choice task. We placed a number of food items (one to four) sequentially into two opaque cans and asked the wolves to choose the larger amount. Moreover, we conducted two additional control conditions to rule out non-numerical properties of the presentation that the animals might have used to make the correct choice. Our results showed that wolves are able to make quantitative judgments at the group, but also at the individual level even when alternative strategies such as paying attention to the surface area or time and total amount are ruled out. In contrast to previous canine studies on dogs (Canis familiaris) and coyotes (Canis latrans), our wolves’ performance did not improve with decreasing ratio, referred to as Weber’s law. However, further studies using larger quantities than we used in the current set-up are still needed to determine whether and when wolves’ quantity discrimination conforms to Weber’s law. PMID:23181044

  17. Making Graphene Resist Aggregation

    NASA Astrophysics Data System (ADS)

    Luo, Jiayan

    Graphene-based sheets have stimulated great interest in many scientific disciplines and shown promise for wide potential applications. Among various ways of creating single atomic layer carbon sheets, a promising route for bulk production is to first chemically exfoliate graphite powders to graphene oxide (GO) sheets, followed by reduction to form chemically modified graphene (CMG). Due to the strong van der Waals attraction between graphene sheets, CMG tends to aggregate. The restacking of sheets is largely uncontrollable and irreversible, thus it reduces their processability and compromises properties such as accessible surface area. Strategies based on colloidal chemistry have been applied to keep CMG dispersed in solvents by introducing electrostatic repulsion to overcome the van der Waals attraction or adding spacers to increase the inter-sheet spacing. In this dissertation, two very different ideas that can prevent CMG aggregation without extensively modifying the material or introducing foreign spacer materials are introduced. The van der Waals potential decreases with reduced overlapping area between sheets. For CMG, reducing the lateral dimension from micrometer to nanometer scale should greatly enhance their colloidal stability with additional advantages of increased charge density and decreased probability to interact. The enhanced colloidal stability of GO and CMG nanocolloids makes them especially promising for spectroscopy based bio-sensing applications. For potential applications in a compact bulk solid form, the sheets were converted into paper-ball like structure using capillary compression in evaporating aerosol droplets. The crumpled graphene balls are stabilized by locally folded pi-pi stacked ridges, and do not unfold or collapse during common processing steps. They can tightly pack without greatly reducing the surface area. This form of graphene leads to scalable performance in energy storage. For example, planer sheets tend to aggregate and

  18. Structure of Viral Aggregates

    NASA Astrophysics Data System (ADS)

    Barr, Stephen; Luijten, Erik

    2010-03-01

    The aggregation of virus particles is a particular form of colloidal self-assembly, since viruses of a give type are monodisperse and have identical, anisotropic surface charge distributions. In small-angle X-ray scattering experiments, the Qbeta virus was found to organize in different crystal structures in the presence of divalent salt and non-adsorbing polymer. Since a simple isotropic potential cannot explain the occurrence of all observed phases, we employ computer simulations to investigate how the surface charge distribution affects the virus interactions. Using a detailed model of the virus particle, we find an asymmetric ion distribution around the virus which gives rise to the different phases observed.

  19. Generation and Exploitation of Aggregation Abstractions for Scheduling and Resource Allocation

    NASA Technical Reports Server (NTRS)

    Linden, Theodore A.; Lowry, Michael R.

    1992-01-01

    Our research is investigating abstraction of computational theories for scheduling and resource allocation. These theories are represented in a variant of first order predicate calculus, parameterized multisorted logic, that facilitates specification of large problems. A particular problem is conceptually stated as a set of ground sentences that are consistent with a quantified theory. We are mainly investigating the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. We are also investigating the interaction of aggregation abstractions with the more thoroughly investigated abstractions of weakening operator preconditions. The purpose of the theories for aggregated demand/capacity is threefold: first, to answer queries about aggregate properties, such as gross feasibility; second, to reduce computational costs by using the solution of aggregate problems to guide the solution of detailed problems; and third, to facilitate reformulating theories to approximate problems for which there are efficient problem solving methods. We also describe novel methods for exploiting aggregation abstractions.

  20. Generation and exploration of aggregation abstractions for scheduling and resource allocation

    NASA Technical Reports Server (NTRS)

    Lowry, Michael R.; Linden, Theodore A.

    1993-01-01

    This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

  1. A high performance, ad-hoc, fuzzy query processing system for relational databases

    NASA Technical Reports Server (NTRS)

    Mansfield, William H., Jr.; Fleischman, Robert M.

    1992-01-01

    Database queries involving imprecise or fuzzy predicates are currently an evolving area of academic and industrial research. Such queries place severe stress on the indexing and I/O subsystems of conventional database environments since they involve the search of large numbers of records. The Datacycle architecture and research prototype is a database environment that uses filtering technology to perform an efficient, exhaustive search of an entire database. It has recently been modified to include fuzzy predicates in its query processing. The approach obviates the need for complex index structures, provides unlimited query throughput, permits the use of ad-hoc fuzzy membership functions, and provides a deterministic response time largely independent of query complexity and load. This paper describes the Datacycle prototype implementation of fuzzy queries and some recent performance results.

  2. Routing-Aware Query Optimization for Conserving Energy in Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Yang, Jie; Wang, Jie

    Processing multiple real-time queries on a multi-hop wireless sensor network while conserving energy is a challenging issue. A naive approach would simply disseminate each query individually, even if the queries contain overlapping information. This imposes excessive energy consumption on sensor nodes in the data paths. We propose a routing-aware query optimization method to conserve energy on these nodes. In particular, we devise an algorithm to reduce query redundancy based on location information, attributes, and time constraints contained in the queries and the routing information of the underlying network. Our simulation results show that our approach can significantly reduce energy consumptions and improve the overall performance of the network.

  3. Evaluation of Content-Matched Range Monitoring Queries over Moving Objects in Mobile Computing Environments.

    PubMed

    Jung, HaRim; Song, MoonBae; Youn, Hee Yong; Kim, Ung Mo

    2015-01-01

    A content-matched (CM) rangemonitoring query overmoving objects continually retrieves the moving objects (i) whose non-spatial attribute values are matched to given non-spatial query values; and (ii) that are currently located within a given spatial query range. In this paper, we propose a new query indexing structure, called the group-aware query region tree (GQR-tree) for efficient evaluation of CMrange monitoring queries. The primary role of the GQR-tree is to help the server leverage the computational capabilities of moving objects in order to improve the system performance in terms of the wireless communication cost and server workload. Through a series of comprehensive simulations, we verify the superiority of the GQR-tree method over the existing methods. PMID:26393613

  4. Evaluation of Content-Matched Range Monitoring Queries over Moving Objects in Mobile Computing Environments

    PubMed Central

    Jung, HaRim; Song, MoonBae; Youn, Hee Yong; Kim, Ung Mo

    2015-01-01

    A content-matched (CM) range monitoring query over moving objects continually retrieves the moving objects (i) whose non-spatial attribute values are matched to given non-spatial query values; and (ii) that are currently located within a given spatial query range. In this paper, we propose a new query indexing structure, called the group-aware query region tree (GQR-tree) for efficient evaluation of CM range monitoring queries. The primary role of the GQR-tree is to help the server leverage the computational capabilities of moving objects in order to improve the system performance in terms of the wireless communication cost and server workload. Through a series of comprehensive simulations, we verify the superiority of the GQR-tree method over the existing methods. PMID:26393613

  5. Stratification of colloidal aggregation coupled with sedimentation.

    PubMed

    González, Agustín E

    2006-12-01

    One of the consequences of sedimentation in colloidal aggregation is the stratification of the system in the sense that, after a sufficiently long elapsed time, the large clusters lie preferentially at the bottom zones of the confinement prism, and the structural and dynamical quantities describing the aggregates depend on the depth at which they are measured. A few years ago a computer simulation using particles for colloidal aggregation coupled with sedimentation was proposed by the author [A. E. González, Phys. Rev. Lett. 86, 1243 (2001)]. In that simulation, due to computational limitations, the mentioned quantities were averaged over all clusters in the prism, independently of the depth at which they were located, in order to have good statistics for the evaluation of the cluster fractal dimension and the cluster size distribution function. In this work we present a computer simulation using particles of colloidal aggregation coupled with sedimentation, for which the clusters in the simulation box represent those clusters inside a layer at a fixed depth and of arbitrary thickness in the prism. It would then be possible to compare the results with an eventual validation experiment, in which an aggregating sample is sipped out with a pipette at a fixed depth in the prism and subjected to further studies, or with a light scattering study in which the laser beam is focused at a fixed depth in the system. We confirm the acceleration of the aggregation rate, followed by a slowing down, compared with an aggregating system driven purely by diffusion (DLCA). In the present system, the large clusters when drifting downwards sweep smaller ones, which in turn occlude the holes and cavities of these large clusters, increasing in this way their compacticity. We also confirm that (i) in some cases of sedimentation strengths and layer depths, the mean width (perpendicular to the gravitational field direction) and the mean height of the large settling clusters scale with the

  6. Query Health: standards-based, cross-platform population health surveillance

    PubMed Central

    Klann, Jeffrey G; Buck, Michael D; Brown, Jeffrey; Hadley, Marc; Elmore, Richard; Weber, Griffin M; Murphy, Shawn N

    2014-01-01

    Objective Understanding population-level health trends is essential to effectively monitor and improve public health. The Office of the National Coordinator for Health Information Technology (ONC) Query Health initiative is a collaboration to develop a national architecture for distributed, population-level health queries across diverse clinical systems with disparate data models. Here we review Query Health activities, including a standards-based methodology, an open-source reference implementation, and three pilot projects. Materials and methods Query Health defined a standards-based approach for distributed population health queries, using an ontology based on the Quality Data Model and Consolidated Clinical Document Architecture, Health Quality Measures Format (HQMF) as the query language, the Query Envelope as the secure transport layer, and the Quality Reporting Document Architecture as the result language. Results We implemented this approach using Informatics for Integrating Biology and the Bedside (i2b2) and hQuery for data analytics and PopMedNet for access control, secure query distribution, and response. We deployed the reference implementation at three pilot sites: two public health departments (New York City and Massachusetts) and one pilot designed to support Food and Drug Administration post-market safety surveillance activities. The pilots were successful, although improved cross-platform data normalization is needed. Discussions This initiative resulted in a standards-based methodology for population health queries, a reference implementation, and revision of the HQMF standard. It also informed future directions regarding interoperability and data access for ONC's Data Access Framework initiative. Conclusions Query Health was a test of the learning health system that supplied a functional methodology and reference implementation for distributed population health queries that has been validated at three sites. PMID:24699371

  7. DigiNorthern, digital expression analysis of query genes based on ESTs.

    PubMed

    Wang, Jianxin; Liang, Ping

    2003-03-22

    DigiNorthern (DN) is a web-based tool for virtually displaying expression profiles of query genes based on EST sequences. Two utilities are available: DN1 takes one query gene and quantitatively display its expression levels in tissues/organs that express the gene with comparison between normal and neoplastic status of each tissue; DN2 takes two sequences as query genes and compares their expression profiles side by side. PMID:12651725

  8. Aggregation of regularized solutions from multiple observation models

    NASA Astrophysics Data System (ADS)

    Chen, Jieyang; Pereverzyev, Sergiy, Jr.; Xu, Yuesheng

    2015-07-01

    Joint inversion of multiple observation models has important applications in many disciplines including geoscience, image processing and computational biology. One of the methodologies for joint inversion of ill-posed observation equations naturally leads to multi-parameter regularization, which has been intensively studied over the last several years. However, problems such as the choice of multiple regularization parameters remain unsolved. In the present study, we discuss a rather general approach to the regularization of multiple observation models, based on the idea of the linear aggregation of approximations corresponding to different values of the regularization parameters. We show how the well-known linear functional strategy can be used for such an aggregation and prove that the error of a constructive aggregator differs from the ideal error value by a quantity of an order higher than the best guaranteed accuracy from the most trustable observation model. The theoretical analysis is illustrated by numerical experiments with simulated data.

  9. Taurine and platelet aggregation

    SciTech Connect

    Nauss-Karol, C.; VanderWende, C.; Gaut, Z.N.

    1986-03-01

    Taurine is a putative neurotransmitter or neuromodulator. The endogenous taurine concentration in human platelets, determined by amino acid analysis, is 15 ..mu..M/g. In spite of this high level, taurine is actively accumulated. Uptake is saturable, Na/sup +/ and temperature dependent, and suppressed by metabolic inhibitors, structural analogues, and several classes of centrally active substances. High, medium and low affinity transport processes have been characterized, and the platelet may represent a model system for taurine transport in the CNS. When platelets were incubated with /sup 14/C-taurine for 30 minutes, then resuspended in fresh medium and reincubated for one hour, essentially all of the taurine was retained within the cells. Taurine, at concentrations ranging from 10-1000 ..mu..M, had no effect on platelet aggregation induced by ADP or epinephrine. However, taurine may have a role in platelet aggregation since 35-39% of the taurine taken up by human platelets appears to be secreted during the release reaction induced by low concentrations of either epinephrine or ADP, respectively. This release phenomenon would imply that part of the taurine taken up is stored directly in the dense bodies of the platelet.

  10. Total organic carbon in aggregates as a soil recovery indicator

    NASA Astrophysics Data System (ADS)

    Luciene Maltoni, Katia; Rodrigues Cassiolato, Ana Maria; Amorim Faria, Glaucia; Dubbin, William

    2015-04-01

    The soil aggregation promotes physical protection of organic matter, preservation of which is crucial to improve soil structure, fertility and ensure the agro-ecosystems sustainability. The no-tillage cultivation system has been considered as one of the strategies to increase total soil organic carbono (TOC) contents and soil aggregation, both are closely related and influenced by soil management systems. The aim of this study was to evaluate the distribution of soil aggregates and the total organic carbon inside aggregates, with regard to soil recovery, under 3 different soil management systems, i.e. 10 and 20 years of no-tillage cultivation as compared with soil under natural vegetation (Cerrado). Undisturbed soils (0-5; 5-10; and 10-20 cm depth) were collected from Brazil, Central Region. The soils, Oxisols from Cerrado, were collected from a field under Natural Vegetation-Cerrado (NV), and from fields that were under conventional tillage since 1970s, and 10 and 20 years ago were changed to no-tillage cultivation system (NT-10; NT-20 respectively). The undisturbed samples were sieved (4mm) and the aggregates retained were further fractionated by wet sieving through five sieves (2000, 1000, 500, 250, and 50 μm) with the aggregates distribution expressed as percentage retained by each sieve. The TOC was determined, for each aggregate size, by combustion (Thermo-Finnigan). A predominance of aggregates >2000 μm was observed under NV treatment (92, 91, 82 %), NT-10 (64, 73, 61 %), and NT-20 (71, 79, 63 %) for all three depths (0-5; 5-10; 10-20 cm). In addition greater quantities of aggregates in sizes 1000, 500, 250 and 50 μm under NT-10 and NT-20 treatments, explain the lower aggregate stability under these treatments compared to the soil under NV. The organic C concentration for NV in aggregates >2000 μm was 24,4; 14,2; 8,7 mg/g for each depth (0-5; 5-10; 10-20 cm, respectively), higher than in aggregates sized 250-50 μm (7,2; 5,5; 4,4 mg/g) for all depths

  11. Query Processing in a Traceable P2P Record Exchange Framework

    NASA Astrophysics Data System (ADS)

    Li, Fengrong; Ishikawa, Yoshiharu

    As the spread of high-speed networks and the development of network technologies, P2P technologies are actively used today for information exchange in the network. While information exchange in a P2P network is quite flexible, there is an important problem — lack of reliability. Since we cannot know the details of how the data was obtained, it is hard to fully rely on it. To ensure the reliability of exchanged data, we have proposed the framework of a traceable P2P record exchange based on database technologies. In this framework, records are exchanged among autonomous peers, and each peer stores its exchange and modification histories in it. The framework supports the function of tracing queries to query the details of the obtained data. A tracing query is described in datalog and executed as a recursive query in the P2P network. In this paper, we focus on the query processing strategies for the framework. We consider two types of queries, ad hoc queries and continual queries, and present the query processing strategies for their executions.

  12. Using Common Table Expressions to Build a Scalable Boolean Query Generator for Clinical Data Warehouses

    PubMed Central

    Harris, Daniel R.; Henderson, Darren W.; Kavuluru, Ramakanth; Stromberg, Arnold J.; Johnson, Todd R.

    2015-01-01

    We present a custom, Boolean query generator utilizing common-table expressions (CTEs) that is capable of scaling with big datasets. The generator maps user-defined Boolean queries, such as those interactively created in clinical-research and general-purpose healthcare tools, into SQL. We demonstrate the effectiveness of this generator by integrating our work into the Informatics for Integrating Biology and the Bedside (i2b2) query tool and show that it is capable of scaling. Our custom generator replaces and outperforms the default query generator found within the Clinical Research Chart (CRC) cell of i2b2. In our experiments, sixteen different types of i2b2 queries were identified by varying four constraints: date, frequency, exclusion criteria, and whether selected concepts occurred in the same encounter. We generated non-trivial, random Boolean queries based on these 16 types; the corresponding SQL queries produced by both generators were compared by execution times. The CTE-based solution significantly outperformed the default query generator and provided a much more consistent response time across all query types (M=2.03, SD=6.64 vs. M=75.82, SD=238.88 seconds). Without costly hardware upgrades, we provide a scalable solution based on CTEs with very promising empirical results centered on performance gains. The evaluation methodology used for this provides a means of profiling clinical data warehouse performance. PMID:25192572

  13. ConnectomeExplorer: Query-Guided Visual Analysis of Large Volumetric Neuroscience Data

    PubMed Central

    Beyer, Johanna; Al-Awami, Ali; Kasthuri, Narayanan; Lichtman, Jeff W.; Pfister, Hanspeter; Hadwiger, Markus

    2014-01-01

    This paper presents ConnectomeExplorer, an application for the interactive exploration and query-guided visual analysis of large volumetric electron microscopy (EM) data sets in connectomics research. Our system incorporates a knowledge-based query algebra that supports the interactive specification of dynamically evaluated queries, which enable neuroscientists to pose and answer domain-specific questions in an intuitive manner. Queries are built step by step in a visual query builder, building more complex queries from combinations of simpler queries. Our application is based on a scalable volume visualization framework that scales to multiple volumes of several teravoxels each, enabling the concurrent visualization and querying of the original EM volume, additional segmentation volumes, neuronal connectivity, and additional meta data comprising a variety of neuronal data attributes. We evaluate our application on a data set of roughly one terabyte of EM data and 750 GB of segmentation data, containing over 4,000 segmented structures and 1,000 synapses. We demonstrate typical use-case scenarios of our collaborators in neuroscience, where our system has enabled them to answer specific scientific questions using interactive querying and analysis on the full-size data for the first time. PMID:24051854

  14. Access to data: comparing AccessMed with Query by Review.

    PubMed Central

    Hripcsak, G; Allen, B; Cimino, J J; Lee, R

    1996-01-01

    OBJECTIVE: To evaluate the performance of tools for authoring patient database queries. DESIGN: Query by Review, a tool that exploits the training that users have undergone to master a result review system, was compared with AccessMed, a vocabulary browser that supports lexical matching and the traversal of hierarchical and semantic links. Seven subjects (Medical Logic Module authors) were asked to use both tools to gather the vocabulary terms necessary to perform each of eight laboratory queries. MEASUREMENTS: The proportion of queries that were correct; intersubject agreement. RESULTS: Query by Review had better performance than AccessMed (38% correct queries versus 18%, p = 0.002), but both figures were low. Poor intersubject agreement (28% for Query by Review and 21% for AccessMed) corroborated the relatively low performance. Subjects appeared to have trouble distinguishing laboratory tests from laboratory batteries, picking terms relevant to the particular data type required, and using classes in the vocabulary's hierarchy. CONCLUSION: Query by Review, with its more constrained user interface, performed somewhat better than AccessMed, a more general tool. Neither tool achieved adequate performance, however, which points to the difficulty of formulating a query for a clinical database and the need for further work. PMID:8816352

  15. QBIC project: querying images by content, using color, texture, and shape

    NASA Astrophysics Data System (ADS)

    Niblack, Carlton W.; Barber, Ron; Equitz, Will; Flickner, Myron D.; Glasman, Eduardo H.; Petkovic, Dragutin; Yanker, Peter; Faloutsos, Christos; Taubin, Gabriel

    1993-04-01

    In the query by image content (QBIC) project we are studying methods to query large on-line image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include medical (`Give me other images that contain a tumor with a texture like this one'), photo-journalism (`Give me images that have blue at the top and red at the bottom'), and many others in art, fashion, cataloging, retailing, and industry. Key issues include derivation and computation of attributes of images and objects that provide useful query functionality, retrieval methods based on similarity as opposed to exact match, query by image example or user drawn image, the user interfaces, query refinement and navigation, high dimensional database indexing, and automatic and semi-automatic database population. We currently have a prototype system written in X/Motif and C running on an RS/6000 that allows a variety of queries, and a test database of over 1000 images and 1000 objects populated from commercially available photo clip art images. In this paper we present the main algorithms for color texture, shape and sketch query that we use, show example query results, and discuss future directions.

  16. Lightweight alumina refractory aggregate. Phase 2, Pilot scale development

    SciTech Connect

    Swansiger, T.G.; Pearson, A.

    1994-11-01

    Kilogram quantities of refractory aggregate were prepared from both a paste and a pelletized form of extruder feed material in both bench and pilot-scale equipment. The 99{sup +} % alumina aggregate exhibited a bulk density approaching 2.5 g/cm{sup 3} and a fired strength slightly lower than fused alumina. Based on initial evaluation by two refractory manufacturers in brick or castable applications, the new aggregate offered adequate strength with thermal conductivity reductions up to 34%, depending on the temperature and application of the new aggregate in these initial trials. The new aggregate was simply substituted for Tabular{trademark} in the refractory formulation. Thus, there is room for improvement through formulation optimization with the lightweight aggregate. The new aggregate offers a unique combination of density, strength, and thermal properties not available in current aggregate. To this point in time, technical development has led to a pelletized formulation with borderline physical form leaving the Eirich mixer. The formulation requires further development to provide more latitude for the production of pelletized material without forming paste, while still reducing the bulk density slightly to reach the 2.5 g/cm{sup 3} target. The preferred, pelletized process flowsheet was outlined and a preliminary economic feasibility study performed based on a process retrofit into Alcoa`s Arkansas tabular production facilities. Based on an assumed market demand of 20,000 mt/year and an assumed selling price of $0.65/lb (25% more than the current selling price of Tabular{trademark}, on a volume basis), economics were favorable. Decision on whether to proceed into Phase 3 (full- scale demonstration) will be based on a formal market survey in 1994 October.

  17. A Web 2.0 Application for Executing Queries and Services on Climatic Data

    NASA Astrophysics Data System (ADS)

    Abad-Mota, S.; Ruckhaus, E.; Garboza, A.; Tepedino, G.

    2007-12-01

    aggregation, hourly, daily, monthly, so that they can be provided to the user at the desired level. This means that additional caution has to be exercised in query answering, in order to distinguish between primary and derived data. On the other hand, a Web 2.0 application is being designed to provide a front-end to the repository. This design focuses on two important aspects: the use of metadata structures, and the definition of collaborative Web 2.0 features that can be integrated to a project of this nature. Metadata descriptors include for a set of measurements, its quality, granularity and other dimension information. With these descriptors it is possible to establish relationships between different sets of measurements and provide scientists with efficient searching mechanisms that determine the related sets of measurements that contribute to a query answer. Unlike traditional applications for climatic data, our approach not only satisfies requirements of researchers specialized in this domain, but also those of anyone interested in this area; one of the objectives is to build an informal knowledge base that can be improved and consolidated with the usage of the system.

  18. Holographic characterization of protein aggregates

    NASA Astrophysics Data System (ADS)

    Wang, Chen; Zhong, Xiao; Ruffner, David; Stutt, Alexandra; Philips, Laura; Ward, Michael; Grier, David

    Holographic characterization directly measures the size distribution of subvisible protein aggregates in suspension and offers insights into their morphology. Based on holographic video microscopy, this analytical technique records and interprets holograms of individual aggregates in protein solutions as they flow down a microfluidic channel, without requiring labeling or other exceptional sample preparation. The hologram of an individual protein aggregate is analyzed in real time with the Lorenz-Mie theory of light scattering to measure that aggregate's size and optical properties. Detecting, counting and characterizing subvisible aggregates proceeds fast enough for time-resolved studies, and lends itself to tracking trends in protein aggregation arising from changing environmental factors. No other analytical technique provides such a wealth of particle-resolved characterization data in situ. Holographic characterization promises accelerated development of therapeutic protein formulations, improved process control during manufacturing, and streamlined quality assurance during storage and at the point of use. Mrsec and MRI program of the NSF, Spheryx Inc.

  19. Density Estimation for Projected Exoplanet Quantities

    NASA Astrophysics Data System (ADS)

    Brown, Robert A.

    2011-05-01

    Exoplanet searches using radial velocity (RV) and microlensing (ML) produce samples of "projected" mass and orbital radius, respectively. We present a new method for estimating the probability density distribution (density) of the unprojected quantity from such samples. For a sample of n data values, the method involves solving n simultaneous linear equations to determine the weights of delta functions for the raw, unsmoothed density of the unprojected quantity that cause the associated cumulative distribution function (CDF) of the projected quantity to exactly reproduce the empirical CDF of the sample at the locations of the n data values. We smooth the raw density using nonparametric kernel density estimation with a normal kernel of bandwidth σ. We calibrate the dependence of σ on n by Monte Carlo experiments performed on samples drawn from a theoretical density, in which the integrated square error is minimized. We scale this calibration to the ranges of real RV samples using the Normal Reference Rule. The resolution and amplitude accuracy of the estimated density improve with n. For typical RV and ML samples, we expect the fractional noise at the PDF peak to be approximately 80 n -log 2. For illustrations, we apply the new method to 67 RV values given a similar treatment by Jorissen et al. in 2001, and to the 308 RV values listed at exoplanets.org on 2010 October 20. In addition to analyzing observational results, our methods can be used to develop measurement requirements—particularly on the minimum sample size n—for future programs, such as the microlensing survey of Earth-like exoplanets recommended by the Astro 2010 committee.

  20. Photometric quantities for solar irradiance modeling

    NASA Astrophysics Data System (ADS)

    Preminger, D. G.; Walton, S. R.; Chapman, G. A.

    2002-11-01

    We analyze photometric quantities for the modeling of the total solar irradiance, S. These quantities are derived from full-disk solar images taken at the San Fernando Observatory. We introduce a new quantity, the photometric sum, Σ, which is the sum over an entire image of each pixel's contribution to the irradiance in that image. Σ combines both bright and dark features; and because the sum is over the entire image, it will include low contrast features that cannot be identified directly. Specifically, we examine Σr, Σb, and ΣK, the photometric sums over broadband red, broadband blue, and 1-nm bandpass Ca II K images, respectively. Σr and Σb measure the effects of solar features on the variability in S at two different continuum wavelengths. ΣK measures the variability in spectral lines due to solar features. We find that Σr and Σb have no long-term trend. ΣK, however, varies in phase with the solar cycle. We carry out several multiple linear regressions on the value of S from cycle 22; the best fit uses Σr and ΣK and reproduces the observed composite S with a multiple regression coefficient R = 0.96. We conclude that the long-term change in S over the solar cycle can be accounted for by the variability in the spectral lines as measured by ΣK, assuming no change in the quiet Sun; the contribution of the continuum to the variations in S is only on active region timescales.

  1. Invariant quantities of a nondepolarizing Mueller matrix

    NASA Astrophysics Data System (ADS)

    Gil, José J.; José, Ignacio San

    2016-07-01

    Orthogonal Mueller matrices can be considered either as corresponding to retarders or to generalized transformations of the polarization basis for the representation of Stokes vectors, so that they constitute the only type of Mueller matrices that preserve the degree of polarization and the intensity of any partially-polarized input Stokes vector. The physical quantities which remain invariant when a nondepolarizing Mueller matrix is transformed through its product by different types of orthogonal Mueller matrices are identified and interpreted, providing a better knowledge of the information contained in a nondepolarizing Mueller matrix.

  2. Quantum private query based on single-photon interference

    NASA Astrophysics Data System (ADS)

    Xu, Sheng-Wei; Sun, Ying; Lin, Song

    2016-08-01

    Quantum private query (QPQ) has become a research hotspot recently. Specially, the quantum key distribution (QKD)-based QPQ attracts lots of attention because of its practicality. Various such kind of QPQ protocols have been proposed based on different technologies of quantum communications. Single-photon interference is one of such technologies, on which the famous QKD protocol GV95 is just based. In this paper, we propose two QPQ protocols based on single-photon interference. The first one is simpler and easier to realize, and the second one is loss tolerant and flexible, and more practical than the first one. Furthermore, we analyze both the user privacy and the database privacy in the proposed protocols.

  3. Can Google Trends search queries contribute to risk diversification?

    PubMed Central

    Kristoufek, Ladislav

    2013-01-01

    Portfolio diversification and active risk management are essential parts of financial analysis which became even more crucial (and questioned) during and after the years of the Global Financial Crisis. We propose a novel approach to portfolio diversification using the information of searched items on Google Trends. The diversification is based on an idea that popularity of a stock measured by search queries is correlated with the stock riskiness. We penalize the popular stocks by assigning them lower portfolio weights and we bring forward the less popular, or peripheral, stocks to decrease the total riskiness of the portfolio. Our results indicate that such strategy dominates both the benchmark index and the uniformly weighted portfolio both in-sample and out-of-sample. PMID:24048448

  4. Supporting Iterative Cohort Construction with Visual Temporal Queries.

    PubMed

    Krause, Josua; Perer, Adam; Stavropoulos, Harry

    2016-01-01

    Many researchers across diverse disciplines aim to analyze the behavior of cohorts whose behaviors are recorded in large event databases. However, extracting cohorts from databases is a difficult yet important step, often overlooked in many analytical solutions. This is especially true when researchers wish to restrict their cohorts to exhibit a particular temporal pattern of interest. In order to fill this gap, we designed COQUITO, a visual interface that assists users defining cohorts with temporal constraints. COQUITO was designed to be comprehensible to domain experts with no preknowledge of database queries and also to encourage exploration. We then demonstrate the utility of COQUITO via two case studies, involving medical and social media researchers. PMID:26529690

  5. QKD-based quantum private query without a failure probability

    NASA Astrophysics Data System (ADS)

    Liu, Bin; Gao, Fei; Huang, Wei; Wen, QiaoYan

    2015-10-01

    In this paper, we present a quantum-key-distribution (QKD)-based quantum private query (QPQ) protocol utilizing single-photon signal of multiple optical pulses. It maintains the advantages of the QKD-based QPQ, i.e., easy to implement and loss tolerant. In addition, different from the situations in the previous QKD-based QPQ protocols, in our protocol, the number of the items an honest user will obtain is always one and the failure probability is always zero. This characteristic not only improves the stability (in the sense that, ignoring the noise and the attack, the protocol would always succeed), but also benefits the privacy of the database (since the database will no more reveal additional secrets to the honest users). Furthermore, for the user's privacy, the proposed protocol is cheat sensitive, and for security of the database, we obtain an upper bound for the leaked information of the database in theory.

  6. Quantum private query based on single-photon interference

    NASA Astrophysics Data System (ADS)

    Xu, Sheng-Wei; Sun, Ying; Lin, Song

    2016-05-01

    Quantum private query (QPQ) has become a research hotspot recently. Specially, the quantum key distribution (QKD)-based QPQ attracts lots of attention because of its practicality. Various such kind of QPQ protocols have been proposed based on different technologies of quantum communications. Single-photon interference is one of such technologies, on which the famous QKD protocol GV95 is just based. In this paper, we propose two QPQ protocols based on single-photon interference. The first one is simpler and easier to realize, and the second one is loss tolerant and flexible, and more practical than the first one. Furthermore, we analyze both the user privacy and the database privacy in the proposed protocols.

  7. Pattern Discovery and Change Detection of Online Music Query Streams

    NASA Astrophysics Data System (ADS)

    Li, Hua-Fu

    In this paper, an efficient stream mining algorithm, called FTP-stream (Frequent Temporal Pattern mining of streams), is proposed to find the frequent temporal patterns over melody sequence streams. In the framework of our proposed algorithm, an effective bit-sequence representation is used to reduce the time and memory needed to slide the windows. The FTP-stream algorithm can calculate the support threshold in only a single pass based on the concept of bit-sequence representation. It takes the advantage of "left" and "and" operations of the representation. Experiments show that the proposed algorithm only scans the music query stream once, and runs significant faster and consumes less memory than existing algorithms, such as SWFI-stream and Moment.

  8. Analysing Twitter and web queries for flu trend prediction

    PubMed Central

    2014-01-01

    Background Social media platforms encourage people to share diverse aspects of their daily life. Among these, shared health related information might be used to infer health status and incidence rates for specific conditions or symptoms. In this work, we present an infodemiology study that evaluates the use of Twitter messages and search engine query logs to estimate and predict the incidence rate of influenza like illness in Portugal. Results Based on a manually classified dataset of 2704 tweets from Portugal, we selected a set of 650 textual features to train a Naïve Bayes classifier to identify tweets mentioning flu or flu-like illness or symptoms. We obtained a precision of 0.78 and an F-measure of 0.83, based on cross validation over the complete annotated set. Furthermore, we trained a multiple linear regression model to estimate the health-monitoring data from the Influenzanet project, using as predictors the relative frequencies obtained from the tweet classification results and from query logs, and achieved a correlation ratio of 0.89 (p < 0.001). These classification and regression models were also applied to estimate the flu incidence in the following flu season, achieving a correlation of 0.72. Conclusions Previous studies addressing the estimation of disease incidence based on user-generated content have mostly focused on the english language. Our results further validate those studies and show that by changing the initial steps of data preprocessing and feature extraction and selection, the proposed approaches can be adapted to other languages. Additionally, we investigated whether the predictive model created can be applied to data from the subsequent flu season. In this case, although the prediction result was good, an initial phase to adapt the regression model could be necessary to achieve more robust results. PMID:25077431

  9. 14 CFR 23.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false Oil quantity indicator. 23.1551 Section 23... Information Markings and Placards § 23.1551 Oil quantity indicator. Each oil quantity indicator must be marked in sufficient increments to indicate readily and accurately the quantity of oil....

  10. 14 CFR 23.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Oil quantity indicator. 23.1551 Section 23... Information Markings and Placards § 23.1551 Oil quantity indicator. Each oil quantity indicator must be marked in sufficient increments to indicate readily and accurately the quantity of oil....

  11. 14 CFR 23.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 14 Aeronautics and Space 1 2013-01-01 2013-01-01 false Oil quantity indicator. 23.1551 Section 23... Information Markings and Placards § 23.1551 Oil quantity indicator. Each oil quantity indicator must be marked in sufficient increments to indicate readily and accurately the quantity of oil....

  12. 14 CFR 25.1551 - Oil quantity indication.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false Oil quantity indication. 25.1551 Section 25... Placards § 25.1551 Oil quantity indication. Each oil quantity indicating means must be marked to indicate the quantity of oil readily and accurately....

  13. 14 CFR 29.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Oil quantity indicator. 29.1551 Section 29... Placards § 29.1551 Oil quantity indicator. Each oil quantity indicator must be marked with enough increments to indicate readily and accurately the quantity of oil....

  14. 14 CFR 29.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false Oil quantity indicator. 29.1551 Section 29... Placards § 29.1551 Oil quantity indicator. Each oil quantity indicator must be marked with enough increments to indicate readily and accurately the quantity of oil....

  15. 14 CFR 27.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false Oil quantity indicator. 27.1551 Section 27... § 27.1551 Oil quantity indicator. Each oil quantity indicator must be marked with enough increments to indicate readily and accurately the quantity of oil....

  16. 14 CFR 25.1551 - Oil quantity indication.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Oil quantity indication. 25.1551 Section 25... Placards § 25.1551 Oil quantity indication. Each oil quantity indicating means must be marked to indicate the quantity of oil readily and accurately....

  17. 14 CFR 27.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 14 Aeronautics and Space 1 2012-01-01 2012-01-01 false Oil quantity indicator. 27.1551 Section 27... § 27.1551 Oil quantity indicator. Each oil quantity indicator must be marked with enough increments to indicate readily and accurately the quantity of oil....

  18. 14 CFR 27.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Oil quantity indicator. 27.1551 Section 27... § 27.1551 Oil quantity indicator. Each oil quantity indicator must be marked with enough increments to indicate readily and accurately the quantity of oil....

  19. 14 CFR 29.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 14 Aeronautics and Space 1 2012-01-01 2012-01-01 false Oil quantity indicator. 29.1551 Section 29... Placards § 29.1551 Oil quantity indicator. Each oil quantity indicator must be marked with enough increments to indicate readily and accurately the quantity of oil....

  20. 14 CFR 25.1551 - Oil quantity indication.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 14 Aeronautics and Space 1 2012-01-01 2012-01-01 false Oil quantity indication. 25.1551 Section 25... Placards § 25.1551 Oil quantity indication. Each oil quantity indicating means must be marked to indicate the quantity of oil readily and accurately....

  1. 14 CFR 25.1551 - Oil quantity indication.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 14 Aeronautics and Space 1 2013-01-01 2013-01-01 false Oil quantity indication. 25.1551 Section 25... Placards § 25.1551 Oil quantity indication. Each oil quantity indicating means must be marked to indicate the quantity of oil readily and accurately....

  2. 14 CFR 23.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 14 Aeronautics and Space 1 2012-01-01 2012-01-01 false Oil quantity indicator. 23.1551 Section 23... Information Markings and Placards § 23.1551 Oil quantity indicator. Each oil quantity indicator must be marked in sufficient increments to indicate readily and accurately the quantity of oil....

  3. 7 CFR 61.102 - Determination of quantity index.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 3 2011-01-01 2011-01-01 false Determination of quantity index. 61.102 Section 61.102... quantity index. The quantity index of cottonseed shall be determined as follows: (a) For upland cottonseed the quantity index shall equal four times percentage of oil plus six times percentage of ammonia,...

  4. 7 CFR 61.102 - Determination of quantity index.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 3 2010-01-01 2010-01-01 false Determination of quantity index. 61.102 Section 61.102... quantity index. The quantity index of cottonseed shall be determined as follows: (a) For upland cottonseed the quantity index shall equal four times percentage of oil plus six times percentage of ammonia,...

  5. 7 CFR 61.102 - Determination of quantity index.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 7 Agriculture 3 2012-01-01 2012-01-01 false Determination of quantity index. 61.102 Section 61.102... quantity index. The quantity index of cottonseed shall be determined as follows: (a) For upland cottonseed the quantity index shall equal four times percentage of oil plus six times percentage of ammonia,...

  6. 7 CFR 61.102 - Determination of quantity index.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 3 2014-01-01 2014-01-01 false Determination of quantity index. 61.102 Section 61.102... quantity index. The quantity index of cottonseed shall be determined as follows: (a) For upland cottonseed the quantity index shall equal four times percentage of oil plus six times percentage of ammonia,...

  7. 7 CFR 61.102 - Determination of quantity index.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 3 2013-01-01 2013-01-01 false Determination of quantity index. 61.102 Section 61.102... quantity index. The quantity index of cottonseed shall be determined as follows: (a) For upland cottonseed the quantity index shall equal four times percentage of oil plus six times percentage of ammonia,...

  8. Aggregation dynamics of rigid polyelectrolytes

    NASA Astrophysics Data System (ADS)

    Tom, Anvy Moly; Rajesh, R.; Vemparala, Satyavani

    2016-01-01

    Similarly charged polyelectrolytes are known to attract each other and aggregate into bundles when the charge density of the polymers exceeds a critical value that depends on the valency of the counterions. The dynamics of aggregation of such rigid polyelectrolytes are studied using large scale molecular dynamics simulations. We find that the morphology of the aggregates depends on the value of the charge density of the polymers. For values close to the critical value, the shape of the aggregates is cylindrical with height equal to the length of a single polyelectrolyte chain. However, for larger values of charge, the linear extent of the aggregates increases as more and more polymers aggregate. In both the cases, we show that the number of aggregates decrease with time as power laws with exponents that are not numerically distinguishable from each other and are independent of charge density of the polymers, valency of the counterions, density, and length of the polyelectrolyte chain. We model the aggregation dynamics using the Smoluchowski coagulation equation with kernels determined from the molecular dynamics simulations and justify the numerically obtained value of the exponent. Our results suggest that once counterions condense, effective interactions between polyelectrolyte chains short-ranged and the aggregation of polyelectrolytes are diffusion-limited.

  9. Visual Aggregate Analysis of Eligibility Features of Clinical Trials

    PubMed Central

    He, Zhe; Carini, Simona; Sim, Ida; Weng, Chunhua

    2015-01-01

    Objective To develop a method for profiling the collective populations targeted for recruitment by multiple clinical studies addressing the same medical condition using one eligibility feature each time. Methods Using a previously published database COMPACT as the backend, we designed a scalable method for visual aggregate analysis of clinical trial eligibility features. This method consists of four modules for eligibility feature frequency analysis, query builder, distribution analysis, and visualization, respectively. This method is capable of analyzing (1) frequently used qualitative and quantitative features for recruiting subjects for a selected medical condition, (2) distribution of study enrollment on consecutive value points or value intervals of each quantitative feature, and (3) distribution of studies on the boundary values, permissible value ranges, and value range widths of each feature. All analysis results were visualized using Google Charts API. Five recruited potential users assessed the usefulness of this method for identifying common patterns in any selected eligibility feature for clinical trial participant selection. Results We implemented this method as a Web-based analytical system called VITTA (Visual Analysis Tool of Clinical Study Target Populations). We illustrated the functionality of VITTA using two sample queries involving quantitative features BMI and HbA1c for conditions “hypertension” and “Type 2 diabetes”, respectively. The recruited potential users rated the user-perceived usefulness of VITTA with an average score of 86.4/100. Conclusions We contributed a novel aggregate analysis method to enable the interrogation of common patterns in quantitative eligibility criteria and the collective target populations of multiple related clinical studies. A larger-scale study is warranted to formally assess the usefulness of VITTA among clinical investigators and sponsors in various therapeutic areas. PMID:25615940

  10. Semantic querying of relational data for clinical intelligence: a semantic web services-based approach

    PubMed Central

    2013-01-01

    Background Clinical Intelligence, as a research and engineering discipline, is dedicated to the development of tools for data analysis for the purposes of clinical research, surveillance, and effective health care management. Self-service ad hoc querying of clinical data is one desirable type of functionality. Since most of the data are currently stored in relational or similar form, ad hoc querying is problematic as it requires specialised technical skills and the knowledge of particular data schemas. Results A possible solution is semantic querying where the user formulates queries in terms of domain ontologies that are much easier to navigate and comprehend than data schemas. In this article, we are exploring the possibility of using SADI Semantic Web services for semantic querying of clinical data. We have developed a prototype of a semantic querying infrastructure for the surveillance of, and research on, hospital-acquired infections. Conclusions Our results suggest that SADI can support ad-hoc, self-service, semantic queries of relational data in a Clinical Intelligence context. The use of SADI compares favourably with approaches based on declarative semantic mappings from data schemas to ontologies, such as query rewriting and RDFizing by materialisation, because it can easily cope with situations when (i) some computation is required to turn relational data into RDF or OWL, e.g., to implement temporal reasoning, or (ii) integration with external data sources is necessary. PMID:23497556

  11. Relevant Term Suggestion in Interactive Web Search Based on Contextual Information in Query Session Logs.

    ERIC Educational Resources Information Center

    Huang, Chien-Kang; Chien, Lee-Feng; Oyang, Yen-Jen

    2003-01-01

    Proposes an effective term suggestion approach to interactive Web searches. Explains a log-based approach to relevant term extraction and term suggestion where relevant terms suggested for a user query are those that co-occur in similar query sessions from search engine logs rather than in the retrieved documents. (Author/LRW)

  12. A "Simple Query Interface" Adapter for the Discovery and Exchange of Learning Resources

    ERIC Educational Resources Information Center

    Massart, David

    2006-01-01

    Developed as part of CEN/ISSS Workshop on Learning Technology efforts to improve interoperability between learning resource repositories, the Simple Query Interface (SQI) is an Application Program Interface (API) for querying heterogeneous repositories of learning resource metadata. In the context of the ProLearn Network of Excellence, SQI is used…

  13. Complex Quantification in Structured Query Language (SQL): A Tutorial Using Relational Calculus

    ERIC Educational Resources Information Center

    Kawash, Jalal

    2004-01-01

    The Structured Query Language (SQL) forms a substantial component of introductory database courses and is supported by almost every commercial database product. One disadvantage of SQL is that it does not provide a universal quantification construct. Queries that have twisted universal and existential quantifiers can be stunning for students,…

  14. Stemming Methodologies Over Individual Query Words for an Arabic Information Retrieval System.

    ERIC Educational Resources Information Center

    Abu-Salem, Hani; Al-Omari, Mahmoud; Evens, Martha W.

    1999-01-01

    Investigates how to improve the performance of an Arabic Information Retrieval System (Arabic-IRS) by imposing the retrieval method, Mixed Stemming, over individual words of a query depending on the importance of the word, the stem or the root of the query terms in the database. This method computes term importance using a Term Frequency and…

  15. Semplore: An IR Approach to Scalable Hybrid Query of Semantic Web Data

    NASA Astrophysics Data System (ADS)

    Zhang, Lei; Liu, Qiaoling; Zhang, Jie; Wang, Haofen; Pan, Yue; Yu, Yong

    As an extension to the current Web, Semantic Web will not only contain structured data with machine understandable semantics but also textual information. While structured queries can be used to find information more precisely on the Semantic Web, keyword searches are still needed to help exploit textual information. It thus becomes very important that we can combine precise structured queries with imprecise keyword searches to have a hybrid query capability. In addition, due to the huge volume of information on the Semantic Web, the hybrid query must be processed in a very scalable way. In this paper, we define such a hybrid query capability that combines unary tree-shaped structured queries with keyword searches. We show how existing information retrieval (IR) index structures and functions can be reused to index semantic web data and its textual information, and how the hybrid query is evaluated on the index structure using IR engines in an efficient and scalable manner. We implemented this IR approach in an engine called Semplore. Comprehensive experiments on its performance show that it is a promising approach. It leads us to believe that it may be possible to evolve current web search engines to query and search the Semantic Web. Finally, we breifly describe how Semplore is used for searching Wikipedia and an IBM customer's product information.

  16. Efficient Queries of Stand-off Annotations for Natural Language Processing on Electronic Medical Records.

    PubMed

    Luo, Yuan; Szolovits, Peter

    2016-01-01

    In natural language processing, stand-off annotation uses the starting and ending positions of an annotation to anchor it to the text and stores the annotation content separately from the text. We address the fundamental problem of efficiently storing stand-off annotations when applying natural language processing on narrative clinical notes in electronic medical records (EMRs) and efficiently retrieving such annotations that satisfy position constraints. Efficient storage and retrieval of stand-off annotations can facilitate tasks such as mapping unstructured text to electronic medical record ontologies. We first formulate this problem into the interval query problem, for which optimal query/update time is in general logarithm. We next perform a tight time complexity analysis on the basic interval tree query algorithm and show its nonoptimality when being applied to a collection of 13 query types from Allen's interval algebra. We then study two closely related state-of-the-art interval query algorithms, proposed query reformulations, and augmentations to the second algorithm. Our proposed algorithm achieves logarithmic time stabbing-max query time complexity and solves the stabbing-interval query tasks on all of Allen's relations in logarithmic time, attaining the theoretic lower bound. Updating time is kept logarithmic and the space requirement is kept linear at the same time. We also discuss interval management in external memory models and higher dimensions. PMID:27478379

  17. Form and Function: The Impact of Query Term and Operator Usage on Web Search Results.

    ERIC Educational Resources Information Center

    Lucas, Wendy; Topi, Heikki

    2002-01-01

    Describes a study of college students that investigated Web-based search engine queries and compared relevancy ratings with expert-formulated queries. Considers the number of subject terms used and the use of Boolean operators and discuses the need for designing search engine interfaces that provide greater support in term selection and operator…

  18. The Limitations of Term Co-Occurrence Data for Query Expansion in Document Retrieval Systems.

    ERIC Educational Resources Information Center

    Peat, Helen J.; Willett, Peter

    1991-01-01

    Identifies limitations in the use of term co-occurrence data as a basis for automatic query expansion in natural language document retrieval systems. The use of similarity coefficients to calculate the degree of similarity between pairs of terms is explained, and frequency and discriminatory characteristics for nearest neighbors of query terms are…

  19. Efficient Queries of Stand-off Annotations for Natural Language Processing on Electronic Medical Records

    PubMed Central

    Luo, Yuan; Szolovits, Peter

    2016-01-01

    In natural language processing, stand-off annotation uses the starting and ending positions of an annotation to anchor it to the text and stores the annotation content separately from the text. We address the fundamental problem of efficiently storing stand-off annotations when applying natural language processing on narrative clinical notes in electronic medical records (EMRs) and efficiently retrieving such annotations that satisfy position constraints. Efficient storage and retrieval of stand-off annotations can facilitate tasks such as mapping unstructured text to electronic medical record ontologies. We first formulate this problem into the interval query problem, for which optimal query/update time is in general logarithm. We next perform a tight time complexity analysis on the basic interval tree query algorithm and show its nonoptimality when being applied to a collection of 13 query types from Allen’s interval algebra. We then study two closely related state-of-the-art interval query algorithms, proposed query reformulations, and augmentations to the second algorithm. Our proposed algorithm achieves logarithmic time stabbing-max query time complexity and solves the stabbing-interval query tasks on all of Allen’s relations in logarithmic time, attaining the theoretic lower bound. Updating time is kept logarithmic and the space requirement is kept linear at the same time. We also discuss interval management in external memory models and higher dimensions. PMID:27478379

  20. Context-Sensitive Processing of Semantic Queries in an Image Database System.

    ERIC Educational Resources Information Center

    Shakir, Hussain Sabri; Nagao, Makoto

    1996-01-01

    Discussion of image database systems focuses on semantic queries and shows how an image is abstracted into a hierarchy of entity names and features; how relations are established between entities visible in the image; and how a "fuzzy" matching technique is used to compare semantic queries to image abstractions. (Author/LRW)

  1. On the Necessity of Term Dependence in a Query Space for Weighted Retrieval.

    ERIC Educational Resources Information Center

    Bollmann-Sdorra, Peter; Raghavan, Vijay V.

    1998-01-01

    Discussion of the vector space model and properties of document and query spaces focuses on the proof that requiring term independence to hold in the query space is inconsistent with the goal of achieving better performance by means of weighted retrieval. Proofs are provided. (Author/LRW)

  2. Quantity without numbers and numbers without quantity in the parietal cortex.

    PubMed

    Cappelletti, Marinella; Muggleton, Neil; Walsh, Vincent

    2009-06-01

    A dominant view in numerical cognition is that processing the quantity indicated by numbers (e.g. deciding the larger between two numbers such as '12.07' or '15.02') relies on the intraparietal regions (IPS) of the cerebral cortex. However, it remains unclear whether the IPS could play a more general role in numerical cognition, for example in (1) quantity processing even with non-numerical stimuli (e.g. choosing the larger of 'bikini' and 'coat'); and/or (2) conceptual tasks involving numbers beyond those requiring quantity processing (e.g. attributing a summer date to either '12.07' or '15.02'). In this study we applied fMRI-guided TMS to the left and right IPS, while independently manipulating stimulus and task. Our results showed that IPS involvement in numerical cognition is neither stimulus-specific nor specific for conceptual tasks. Thus, quantity judgments with numerical and non-numerical stimuli were equally affected by IPS-TMS, as well as a number conceptual task not requiring quantity comparisons. However, IPS-TMS showed no impairment for perceptual decisions on numbers without any conceptual processing (i.e. colour judgment), nor for conceptual decisions that did not involve quantity or number stimuli (e.g. summer object: 'bikini' or 'coat'?). These results are consistent with proposals that the parietal areas are engaged in the conceptual representation of numbers but they challenge the most common view that number processing is so automatic that the simple presentation of numbers activates the IPS and a sense of magnitude. Rather, our results show that the IPS is only necessary when conceptual operations need to be explicitly oriented to numerical concepts. PMID:19236924

  3. Quantity without numbers and numbers without quantity in the parietal cortex

    PubMed Central

    Cappelletti, Marinella; Muggleton, Neil; Walsh, Vincent

    2009-01-01

    A dominant view in numerical cognition is that processing the quantity indicated by numbers (e.g. deciding the larger between two numbers such as ‘12.07’ or ‘15.02’) relies on the intraparietal regions (IPS) of the cerebral cortex. However, it remains unclear whether the IPS could play a more general role in numerical cognition, for example in (1) quantity processing even with non-numerical stimuli (e.g. choosing the larger of ‘bikini’ and ‘coat’); and/or (2) conceptual tasks involving numbers beyond those requiring quantity processing (e.g. attributing a summer date to either ‘12.07’ or ‘15.02’). In this study we applied fMRI-guided TMS to the left and right IPS, while independently manipulating stimulus and task. Our results showed that IPS involvement in numerical cognition is neither stimulus-specific nor specific for conceptual tasks. Thus, quantity judgments with numerical and non-numerical stimuli were equally affected by IPS-TMS, as well as a number conceptual task not requiring quantity comparisons. However, IPS-TMS showed no impairment for perceptual decisions on numbers without any conceptual processing (i.e. colour judgment), nor for conceptual decisions that did not involve quantity or number stimuli (e.g. summer object: ‘bikini’ or ‘coat’?). These results are consistent with proposals that the parietal areas are engaged in the conceptual representation of numbers but they challenge the most common view that number processing is so automatic that the simple presentation of numbers activates the IPS and a sense of magnitude. Rather, our results show that the IPS is only necessary when conceptual operations need to be explicitly oriented to numerical concepts. PMID:19236924

  4. Peptide aggregation in neurodegenerative disease.

    PubMed

    Murphy, Regina M

    2002-01-01

    In the not-so-distant past, insoluble aggregated protein was considered as uninteresting and bothersome as yesterday's trash. More recently, protein aggregates have enjoyed considerable scientific interest, as it has become clear that these aggregates play key roles in many diseases. In this review, we focus attention on three polypeptides: beta-amyloid, prion, and huntingtin, which are linked to three feared neurodegenerative diseases: Alzheimer's, "mad cow," and Huntington's disease, respectively. These proteins lack any significant primary sequence homology, yet their aggregates possess very similar features, specifically, high beta-sheet content, fibrillar morphology, relative insolubility, and protease resistance. Because the aggregates are noncrystalline, secrets of their structure at nanometer resolution are only slowly yielding to X-ray diffraction, solid-state NMR, and other techniques. Besides structure, the aggregates may possess similar pathways of assembly. Two alternative assembly pathways have been proposed: the nucleation-elongation and the template-assisted mode. These two modes may be complementary, not mutually exclusive. Strategies for interfering with aggregation, which may provide novel therapeutic approaches, are under development. The structural similarities between protein aggregates of dissimilar origin suggest that therapeutic strategies successful against one disease may have broad utility in others. PMID:12117755

  5. Topics in Probabilistic Judgment Aggregation

    ERIC Educational Resources Information Center

    Wang, Guanchun

    2011-01-01

    This dissertation is a compilation of several studies that are united by their relevance to probabilistic judgment aggregation. In the face of complex and uncertain events, panels of judges are frequently consulted to provide probabilistic forecasts, and aggregation of such estimates in groups often yield better results than could have been made…

  6. Mineral of the month: aggregates

    USGS Publications Warehouse

    Tepordei, Valentin V.

    2005-01-01

    Natural aggregates, consisting of crushed stone, and sand and gravel, are a major contributor to economic health, and have an amazing variety of uses. Aggregates are among the most abundant mineral resources and are major basic raw materials used by construction, agriculture and other industries that employ complex chemical and metallurgical processes.

  7. Quantity quotient reporting. Comparison of various models.

    PubMed

    Haeckel, Rainer; Wosniok, Werner; Postma, Theo

    2015-11-01

    Quantity quotient (QQ) reporting has been proposed by several authors to improve or support the present situation of presenting quantitative laboratory results. This proposal is based on a concept (symmetrical model) known from the intelligence quotient, which was developed to make intelligence tests comparable. In laboratory medicine, however, most measurands follow a non-symmetrical (skewed) distribution, leading to a compression of the QQ values at the lower end of the reference interval. This effect can be avoided by several alternatives. Three models considering non-symmetrical distributions are compared with the symmetrical model in the present study. The corresponding algorithms can be easily handled on the Excel platform. Graphical presentation of the QQ allows a quick overview of test results if they occur in a large number. PMID:26536582

  8. Mechanics of fire ant aggregations

    NASA Astrophysics Data System (ADS)

    Tennenbaum, Michael; Liu, Zhongyang; Hu, David; Fernandez-Nieves, Alberto

    2016-01-01

    Fire ants link their bodies to form aggregations; these can adopt a variety of structures, they can drip and spread, or withstand applied loads. Here, by using oscillatory rheology, we show that fire ant aggregations are viscoelastic. We find that, at the lowest ant densities probed and in the linear regime, the elastic and viscous moduli are essentially identical over the spanned frequency range, which highlights the absence of a dominant mode of structural relaxation. As ant density increases, the elastic modulus rises, which we interpret by alluding to ant crowding and subsequent jamming. When deformed beyond the linear regime, the aggregation flows, exhibiting shear-thinning behaviour with a stress load that is comparable to the maximum load the aggregation can withstand before individual ants are torn apart. Our findings illustrate the rich, collective mechanical behaviour that can arise in aggregations of active, interacting building blocks.

  9. Mechanics of fire ant aggregations.

    PubMed

    Tennenbaum, Michael; Liu, Zhongyang; Hu, David; Fernandez-Nieves, Alberto

    2016-01-01

    Fire ants link their bodies to form aggregations; these can adopt a variety of structures, they can drip and spread, or withstand applied loads. Here, by using oscillatory rheology, we show that fire ant aggregations are viscoelastic. We find that, at the lowest ant densities probed and in the linear regime, the elastic and viscous moduli are essentially identical over the spanned frequency range, which highlights the absence of a dominant mode of structural relaxation. As ant density increases, the elastic modulus rises, which we interpret by alluding to ant crowding and subsequent jamming. When deformed beyond the linear regime, the aggregation flows, exhibiting shear-thinning behaviour with a stress load that is comparable to the maximum load the aggregation can withstand before individual ants are torn apart. Our findings illustrate the rich, collective mechanical behaviour that can arise in aggregations of active, interacting building blocks. PMID:26501413

  10. Molecular aggregation of humic substances

    USGS Publications Warehouse

    Wershaw, R. L.

    1999-01-01

    Humic substances (HS) form molecular aggregates in solution and on mineral surfaces. Elucidation of the mechanism of formation of these aggregates is important for an understanding of the interactions of HS in soils arid natural waters. The HS are formed mainly by enzymatic depolymerization and oxidation of plant biopolymers. These reactions transform the aromatic and lipid plant components into amphiphilic molecules, that is, molecules that consist of separate hydrophobic (nonpolar) and hydrophilic (polar) parts. The nonpolar parts of the molecules are composed of relatively unaltered segments of plant polymers and the polar parts of carboxylic acid groups. These amphiphiles form membrane-like aggregates on mineral surfaces and micelle-like aggregates in solution. The exterior surfaces of these aggregates are hydrophilic, and the interiors constitute separate hydrophobic liquid-like phases.

  11. Imbibition kinetics of spherical aggregates

    NASA Astrophysics Data System (ADS)

    Hébraud, Pascal; Lootens, Didier; Debacker, Alban

    The imbibition kinetics of a millimeter-sized aggregate of 300 nm diameter colloidal particles by a wetting pure solvent is studied. Three successive regimes are observed : in the first one, the imbibition proceeds by compressing the air inside the aggregate. Then, the solvent stops when the pressure of the compressed air is equal to the Laplace pressure at the meniscus of the wetting solvent in the porous aggregate. The interface is pinned and the aggregate slowly degases, up to a point where the pressure of the entrapped air stops decreasing and is controlled by the Laplace pressure of small bubbles. Depending on the curvature of the bubble, the system may then be in an unstable state. The imbibition then starts again, but with an inner pressure in equilibrium with these bubbles. This last stage leads to the complete infiltration of the aggregate.

  12. Immunogenicity of Therapeutic Protein Aggregates.

    PubMed

    Moussa, Ehab M; Panchal, Jainik P; Moorthy, Balakrishnan S; Blum, Janice S; Joubert, Marisa K; Narhi, Linda O; Topp, Elizabeth M

    2016-02-01

    Therapeutic proteins have a propensity for aggregation during manufacturing, shipping, and storage. The presence of aggregates in protein drug products can induce adverse immune responses in patients that may affect safety and efficacy, and so it is of concern to both manufacturers and regulatory agencies. In this vein, there is a lack of understanding of the physicochemical determinants of immunological responses and a lack of standardized analytical methods to survey the molecular properties of aggregates associated with immune activation. In this review, we provide an overview of the basic immune mechanisms in the context of interactions with protein aggregates. We then critically examine the literature with emphasis on the underlying immune mechanisms as they relate to aggregate properties. Finally, we highlight the gaps in our current understanding of this issue and offer recommendations for future research. PMID:26869409

  13. Geometric Representations of Condition Queries on Three-Dimensional Vector Fields

    NASA Technical Reports Server (NTRS)

    Henze, Chris

    1999-01-01

    Condition queries on distributed data ask where particular conditions are satisfied. It is possible to represent condition queries as geometric objects by plotting field data in various spaces derived from the data, and by selecting loci within these derived spaces which signify the desired conditions. Rather simple geometric partitions of derived spaces can represent complex condition queries because much complexity can be encapsulated in the derived space mapping itself A geometric view of condition queries provides a useful conceptual unification, allowing one to intuitively understand many existing vector field feature detection algorithms -- and to design new ones -- as variations on a common theme. A geometric representation of condition queries also provides a simple and coherent basis for computer implementation, reducing a wide variety of existing and potential vector field feature detection techniques to a few simple geometric operations.

  14. Effectively processing medical term queries on the UMLS Metathesaurus by layered dynamic programming

    PubMed Central

    2014-01-01

    Background Mapping medical terms to standardized UMLS concepts is a basic step for leveraging biomedical texts in data management and analysis. However, available methods and tools have major limitations in handling queries over the UMLS Metathesaurus that contain inaccurate query terms, which frequently appear in real world applications. Methods To provide a practical solution for this task, we propose a layered dynamic programming mapping (LDPMap) approach, which can efficiently handle these queries. LDPMap uses indexing and two layers of dynamic programming techniques to efficiently map a biomedical term to a UMLS concept. Results Our empirical study shows that LDPMap achieves much faster query speeds than LCS. In comparison to the UMLS Metathesaurus Browser and MetaMap, LDPMap is much more effective in querying the UMLS Metathesaurus for inaccurately spelled medical terms, long medical terms, and medical terms with special characters. Conclusions These results demonstrate that LDPMap is an efficient and effective method for mapping medical terms to the UMLS Metathesaurus. PMID:25079259

  15. Towards Building a High Performance Spatial Query System for Large Scale Medical Imaging Data

    PubMed Central

    Aji, Ablimit; Wang, Fusheng; Saltz, Joel H.

    2013-01-01

    Support of high performance queries on large volumes of scientific spatial data is becoming increasingly important in many applications. This growth is driven by not only geospatial problems in numerous fields, but also emerging scientific applications that are increasingly data- and compute-intensive. For example, digital pathology imaging has become an emerging field during the past decade, where examination of high resolution images of human tissue specimens enables more effective diagnosis, prediction and treatment of diseases. Systematic analysis of large-scale pathology images generates tremendous amounts of spatially derived quantifications of micro-anatomic objects, such as nuclei, blood vessels, and tissue regions. Analytical pathology imaging provides high potential to support image based computer aided diagnosis. One major requirement for this is effective querying of such enormous amount of data with fast response, which is faced with two major challenges: the “big data” challenge and the high computation complexity. In this paper, we present our work towards building a high performance spatial query system for querying massive spatial data on MapReduce. Our framework takes an on demand index building approach for processing spatial queries and a partition-merge approach for building parallel spatial query pipelines, which fits nicely with the computing model of MapReduce. We demonstrate our framework on supporting multi-way spatial joins for algorithm evaluation and nearest neighbor queries for microanatomic objects. To reduce query response time, we propose cost based query optimization to mitigate the effect of data skew. Our experiments show that the framework can efficiently support complex analytical spatial queries on MapReduce. PMID:24501719

  16. Perspectives on Preference Aggregation.

    PubMed

    Regenwetter, Michel

    2009-07-01

    For centuries, the mathematical aggregation of preferences by groups, organizations, or society itself has received keen interdisciplinary attention. Extensive theoretical work in economics and political science throughout the second half of the 20th century has highlighted the idea that competing notions of rational social choice intrinsically contradict each other. This has led some researchers to consider coherent democratic decision making to be a mathematical impossibility. Recent empirical work in psychology qualifies that view. This nontechnical review sketches a quantitative research paradigm for the behavioral investigation of mathematical social choice rules on real ballots, experimental choices, or attitudinal survey data. The article poses a series of open questions. Some classical work sometimes makes assumptions about voter preferences that are descriptively invalid. Do such technical assumptions lead the theory astray? How can empirical work inform the formulation of meaningful theoretical primitives? Classical "impossibility results" leverage the fact that certain desirable mathematical properties logically cannot hold in all conceivable electorates. Do these properties nonetheless hold true in empirical distributions of preferences? Will future behavioral analyses continue to contradict the expectations of established theory? Under what conditions do competing consensus methods yield identical outcomes and why do they do so? PMID:26158988

  17. Efficient Online Aggregates in Dense-Region-Based Data Cube Representations

    NASA Astrophysics Data System (ADS)

    Haddadin, Kais; Lauer, Tobias

    In-memory OLAP systems require a space-efficient representation of sparse data cubes in order to accommodate large data sets. On the other hand, most efficient online aggregation techniques, such as prefix sums, are built on dense array-based representations. These are often not applicable to real-world data due to the size of the arrays which usually cannot be compressed well, as most sparsity is removed during pre-processing. A possible solution is to identify dense regions in a sparse cube and only represent those using arrays, while storing sparse data separately, e.g. in a spatial index structure. Previous dense-region-based approaches have concentrated mainly on the effectiveness of the dense-region detection (i.e. on the space-efficiency of the result). However, especially in higher-dimensional cubes, data is usually more cluttered, resulting in a potentially large number of small dense regions, which negatively affects query performance on such a structure. In this paper, our focus is not only on space-efficiency but also on time-efficiency, both for the initial dense-region extraction and for queries carried out in the resulting hybrid data structure. We describe two methods to trade available memory for increased aggregate query performance. In addition, optimizations in our approach significantly reduce the time to build the initial data structure compared to former systems. Also, we present a straightforward adaptation of our approach to support multi-core or multi-processor architectures, which can further enhance query performance. Experiments with different real-world data sets show how various parameter settings can be used to adjust the efficiency and effectiveness of our algorithms.

  18. ISO terminological analysis of the VIM3 concepts 'quantity' and 'kind-of-quantity'

    NASA Astrophysics Data System (ADS)

    Dybkaer, René

    2010-06-01

    The recent third edition of the International Vocabulary of Metrology—Basic and General Concepts and Associated Terms (VIM3) (JCGM 200:2008 (Sèvres: BIPM); also ISO/IEC Guide 99:2007 3rd edn (Geneva: ISO)) has undergone important changes, not least by adhering to ISO International Standards on terminology work (ISO 704:2000 Terminology Work—Principles and Methods; ISO 1087-1:2000 Terminology Work—Vocabulary—Part 1: Theory and Application; ISO 10241:1992 International Terminology Standards—Preparation and Layout). A recent critique (Mari 2009 Metrologia 46 L11-L15)—based on Object-Oriented Analysis—centres on the meaning and relation of the two first and fundamental concepts 'quantity'Single quotation marks ('...') or bold type indicate a concept when necessary, double quotation marks ("...") a term or quotation. and the new entry 'kind-of-quantity'. This makes it timely to analyse the two concepts, their relation and their respective role in forming the generic hierarchical concept system of VIM3 from 'property' to individual quantities. It is suggested that 'kind-of-quantity' acts as a division criterionSynonyms are "criterion of subdivision", "type of characteristic(s)", see the annexe..

  19. 16 CFR 500.25 - Net quantity, average quantity, permitted variations.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... variations. 500.25 Section 500.25 Commercial Practices FEDERAL TRADE COMMISSION RULES, REGULATIONS, STATEMENT OF GENERAL POLICY OR INTERPRETATION AND EXEMPTIONS UNDER THE FAIR PACKAGING AND LABELING ACT REGULATIONS UNDER SECTION 4 OF THE FAIR PACKAGING AND LABELING ACT § 500.25 Net quantity, average...

  20. Protein misfolding and aggregation research: some thoughts on improving quality and utility.

    PubMed

    Murphy, Regina M; Roberts, Christopher J

    2013-01-01

    Once misfolded and aggregated proteins were as interesting as yesterday's trash, just a bothersome byproduct of productive activities. Today, they attract sustained interest from both basic researchers and practicing engineers. In the burgeoning biopharmaceutical industry, protein misfolding and aggregation pose significant challenges to the economic manufacture of safe and effective protein products. In the clinic, protein aggregates are believed to be pathological agents in a number of serious neurodegenerative disorders, such as Alzheimer's and Parkinson's. Over the past few years, the quantity of research into biotechnological aspects of protein misfolding and aggregation has skyrocketed. However, the quality of the published work is quite variable. In this brief opinion piece, we describe what we believe are some key features of high-quality publications in protein aggregation. We focus on experimental studies that may also have a kinetic modeling component. PMID:24124114

  1. A Geospatial Semantic Enrichment and Query Service for Geotagged Photographs

    PubMed Central

    Ennis, Andrew; Nugent, Chris; Morrow, Philip; Chen, Liming; Ioannidis, George; Stan, Alexandru; Rachev, Preslav

    2015-01-01

    With the increasing abundance of technologies and smart devices, equipped with a multitude of sensors for sensing the environment around them, information creation and consumption has now become effortless. This, in particular, is the case for photographs with vast amounts being created and shared every day. For example, at the time of this writing, Instagram users upload 70 million photographs a day. Nevertheless, it still remains a challenge to discover the “right” information for the appropriate purpose. This paper describes an approach to create semantic geospatial metadata for photographs, which can facilitate photograph search and discovery. To achieve this we have developed and implemented a semantic geospatial data model by which a photograph can be enrich with geospatial metadata extracted from several geospatial data sources based on the raw low-level geo-metadata from a smartphone photograph. We present the details of our method and implementation for searching and querying the semantic geospatial metadata repository to enable a user or third party system to find the information they are looking for. PMID:26205265

  2. A Geospatial Semantic Enrichment and Query Service for Geotagged Photographs.

    PubMed

    Ennis, Andrew; Nugent, Chris; Morrow, Philip; Chen, Liming; Ioannidis, George; Stan, Alexandru; Rachev, Preslav

    2015-01-01

    With the increasing abundance of technologies and smart devices, equipped with a multitude of sensors for sensing the environment around them, information creation and consumption has now become effortless. This, in particular, is the case for photographs with vast amounts being created and shared every day. For example, at the time of this writing, Instagram users upload 70 million photographs a day. Nevertheless, it still remains a challenge to discover the "right" information for the appropriate purpose. This paper describes an approach to create semantic geospatial metadata for photographs, which can facilitate photograph search and discovery. To achieve this we have developed and implemented a semantic geospatial data model by which a photograph can be enrich with geospatial metadata extracted from several geospatial data sources based on the raw low-level geo-metadata from a smartphone photograph. We present the details of our method and implementation for searching and querying the semantic geospatial metadata repository to enable a user or third party system to find the information they are looking for. PMID:26205265

  3. Transport Information System using Query Centric Cyber Physical Systems (QCPS)

    NASA Astrophysics Data System (ADS)

    Mundra, Ankit; Rathee, Geetanjali; Chawla, Meenu; Soni, Ashutosh

    2014-01-01

    To incorporate the computation and communication with the physical world, next generation architecture i.e. CPS is viewed as a new technology. To improve the better interaction with the physical world or to perk up the electricity delivery usage, various CPS based approaches have been introduced. Recently several GPS equipped smart phones and sensor based frameworks have been proposed which provide various services i.e. environment estimation, road safety improvement but encounter certain limitations like elevated energy consumption and high computation cost. To meet the high reliability and safety requirements, this paper introduces a novel approach based on QCPS model which provides several users services (discussed in this paper). Further, this paper proposed a Transport Information System (TIS), which provide the communication with lower cost overhead by arranging the similar sensors in the form of grids. Each grid has a coordinator which interacts with cloud to process the user query. In order to evaluate the performance of proposed approach we have implemented a test bed of 16 wireless sensor nodes and have shown the performance in terms of computation and communication cost.

  4. Neural network for intelligent query of an FBI forensic database

    NASA Astrophysics Data System (ADS)

    Uvanni, Lee A.; Rainey, Timothy G.; Balasubramanian, Uma; Brettle, Dean W.; Weingard, Fred; Sibert, Robert W.; Birnbaum, Eric

    1997-02-01

    Examiner is an automated fired cartridge case identification system utilizing a dual-use neural network pattern recognition technology, called the statistical-multiple object detection and location system (S-MODALS) developed by Booz(DOT)Allen & Hamilton, Inc. in conjunction with Rome Laboratory. S-MODALS was originally designed for automatic target recognition (ATR) of tactical and strategic military targets using multisensor fusion [electro-optical (EO), infrared (IR), and synthetic aperture radar (SAR)] sensors. Since S-MODALS is a learning system readily adaptable to problem domains other than automatic target recognition, the pattern matching problem of microscopic marks for firearms evidence was analyzed using S-MODALS. The physics; phenomenology; discrimination and search strategies; robustness requirements; error level and confidence level propagation that apply to the pattern matching problem of military targets were found to be applicable to the ballistic domain as well. The Examiner system uses S-MODALS to rank a set of queried cartridge case images from the most similar to the least similar image in reference to an investigative fired cartridge case image. The paper presents three independent tests and evaluation studies of the Examiner system utilizing the S-MODALS technology for the Federal Bureau of Investigation.

  5. OWLViper: Semantic Based Application for High Level Query and Analysis

    NASA Astrophysics Data System (ADS)

    Shaya, Edward J.; Thomas, B.; Huang, Z.; Teuben, P.

    2007-05-01

    Our team of astronomers and programmers at U. of Maryland is creating an application that relies on W3C semantics language OWL to assist scientists to pose complex scientific questions. They will interact with a special graphical user interface to query distributed databases and to analyse resulting datasets. The ontology includes mathematical relationships between concepts that can be applied to user datasets without programming. It allows scientists to graphically represent their goals by selecting objects from hierarchical menus and then to restrict the properties of the objects. The user is presented with various routes of transformions to attain their goal. Pathways developed by users can be saved, reused and made publicly available to others. We are prototyping this system with astronomical methods for obtaining distances to galaxies. Presently, we are experimenting with a simple OWL-S based work flow manager to execute transformation and logically search the registry and datacenters for appropriate data. The Astronomical Data Center (http://archive.astro.umd.edu/archive) is being retrofitted with RDF (Resource Description Format) files to semantically describe the data. These make use of our Science.owl ontology (http://arhive.astro.umd.edu/ont/index.html).

  6. Query-handling in MLM-based decision support systems.

    PubMed

    Arkad, K; Gao, X M; Ahlfeldt, H

    1995-01-01

    Arden Syntax for Medical Logic Modules is a standard specification for creation and sharing of knowledge bases. The standard specification focuses on knowledge that can be represented as a set of independent Medical Logic Modules (MLMs) such as rules, formulas and protocols. The basic functions of an MLM are to retrieve patient data, manipulate the data, come to some decision, and possibly perform an action. All connections to the world outside an MLM are collected in the data-slot of the MLM. The institution specific parts of these connections are inside the notation of curly brackets ([]) to facilitate sharing of MLM between institutions. This paper focuses on some of the problems that occur in relation to Arden Syntax and connections to a patient database such as database queries. Problems related to possibilities of moving one or several module(s) are also discussed, with emphasis on database connections. As an example, an MLM based Decision Support System (DSS) developed at Linköping University is described. PMID:8882561

  7. Query2Question: Translating Visualization Interaction into Natural Language.

    PubMed

    Nafari, Maryam; Weaver, Chris

    2015-06-01

    Richly interactive visualization tools are increasingly popular for data exploration and analysis in a wide variety of domains. Existing systems and techniques for recording provenance of interaction focus either on comprehensive automated recording of low-level interaction events or on idiosyncratic manual transcription of high-level analysis activities. In this paper, we present the architecture and translation design of a query-to-question (Q2Q) system that automatically records user interactions and presents them semantically using natural language (written English). Q2Q takes advantage of domain knowledge and uses natural language generation (NLG) techniques to translate and transcribe a progression of interactive visualization states into a visual log of styled text that complements and effectively extends the functionality of visualization tools. We present Q2Q as a means to support a cross-examination process in which questions rather than interactions are the focus of analytic reasoning and action. We describe the architecture and implementation of the Q2Q system, discuss key design factors and variations that effect question generation, and present several visualizations that incorporate Q2Q for analysis in a variety of knowledge domains. PMID:26357239

  8. Denatured state aggregation parameters derived from concentration dependence of protein stability.

    PubMed

    Schön, Arne; Clarkson, Benjamin R; Siles, Rogelio; Ross, Patrick; Brown, Richard K; Freire, Ernesto

    2015-11-01

    Protein aggregation is a major issue affecting the long-term stability of protein preparations. Proteins exist in equilibrium between the native and denatured or partially denatured conformations. Often denatured or partially denatured conformations are prone to aggregate because they expose to solvent the hydrophobic core of the protein. The aggregation of denatured protein gradually shifts the protein equilibrium toward increasing amounts of denatured and ultimately aggregated protein. Recognizing and quantitating the presence of denatured protein and its aggregation at the earliest possible time will bring enormous benefits to the identification and selection of optimal solvent conditions or the engineering of proteins with the best stability/aggregation profile. In this article, a new approach that allows simultaneous determination of structural stability and the amount of denatured and aggregated protein is presented. This approach is based on the analysis of the concentration dependence of the Gibbs energy (ΔG) of protein stability. It is shown that three important quantities can be evaluated simultaneously: (i) the population of denatured protein, (ii) the population of aggregated protein, and (iii) the fraction of denatured protein that is aggregated. PMID:26239214

  9. 7 CFR 1207.511 - Determination of assessable quantity.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... POTATO RESEARCH AND PROMOTION PLAN Rules and Regulations Assessments § 1207.511 Determination of assessable quantity. The assessable quantity of potatoes in any lot shall be determined on the basis...

  10. 7 CFR 1207.511 - Determination of assessable quantity.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... POTATO RESEARCH AND PROMOTION PLAN Rules and Regulations Assessments § 1207.511 Determination of assessable quantity. The assessable quantity of potatoes in any lot shall be determined on the basis...

  11. 7 CFR 1207.511 - Determination of assessable quantity.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... POTATO RESEARCH AND PROMOTION PLAN Rules and Regulations Assessments § 1207.511 Determination of assessable quantity. The assessable quantity of potatoes in any lot shall be determined on the basis...

  12. 7 CFR 1207.511 - Determination of assessable quantity.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... POTATO RESEARCH AND PROMOTION PLAN Rules and Regulations Assessments § 1207.511 Determination of assessable quantity. The assessable quantity of potatoes in any lot shall be determined on the basis...

  13. Category 3 threshold quantities for hazard categorization of nonreactor facilities

    SciTech Connect

    Mandigo, R.L.

    1996-02-13

    This document provides the information necessary to determine Hazard Category 3 threshold quantities for those isotopes of interest not listed in WHC-CM-4-46, Section 4, Table 1.''Threshold Quantities.''

  14. On the Hojman conservation quantities in Cosmology

    NASA Astrophysics Data System (ADS)

    Paliathanasis, A.; Leach, P. G. L.; Capozziello, S.

    2016-04-01

    We discuss the application of the Hojman's Symmetry Approach for the determination of conservation laws in Cosmology, which has been recently applied by various authors in different cosmological models. We show that Hojman's method for regular Hamiltonian systems, where the Hamiltonian function is one of the involved equations of the system, is equivalent to the application of Noether's Theorem for generalized transformations. That means that for minimally-coupled scalar field cosmology or other modified theories which are conformally related with scalar-field cosmology, like f (R) gravity, the application of Hojman's method provide us with the same results with that of Noether's Theorem. Moreover we study the special Ansatz. ϕ (t) = ϕ (a (t)) , which has been introduced for a minimally-coupled scalar field, and we study the Lie and Noether point symmetries for the reduced equation. We show that under this Ansatz, the unknown function of the model cannot be constrained by the requirement of the existence of a conservation law and that the Hojman conservation quantity which arises for the reduced equation is nothing more than the functional form of Noetherian conservation laws for the free particle. On the other hand, for f (T) teleparallel gravity, it is not the existence of Hojman's conservation laws which provide us with the special function form of f (T) functions, but the requirement that the reduced second-order differential equation admits a Jacobi Last multiplier, while the new conservation law is nothing else that the Hamiltonian function of the reduced equation.

  15. Ad Hoc Query Support For Very Large Simulation Mesh Data: The Metadata Approach

    SciTech Connect

    Lee, B; Snapp, R; Musick, R; Critchlow, T

    2001-12-17

    We present our approach to enabling approximate ad hoc queries on terabyte-scale mesh data generated from large scientific simulations through the extension and integration of database, statistical, and data mining techniques. There are several significant barriers to overcome in achieving this objective. First, large-scale simulation data is already at the multi-terabyte scale and growing quickly, thus rendering traditional forms of interactive data exploration and query processing untenable. Second, a priori knowledge of user queries is not available, making it impossible to tune special-purpose solutions. Third, the data has spatial and temporal aspects, as well as arbitrarily high dimensionality, which exacerbates the task of finding compact, accurate, and easy-to-compute data models. Our approach is to preprocess the mesh data to generate highly compressed, lossy models that are used in lieu of the original data to answer users' queries. This approach leads to interesting challenges. The model (equivalently, the content-oriented metadata) being generated must be smaller than the original data by at least an order of magnitude. Second, the metadata representation must contain enough information to support a broad class of queries. Finally, the accuracy and speed of the queries must be within the tolerances required by users. In this paper we give an overview of ongoing development efforts with an emphasis on extracting metadata and using it in query processing.

  16. 7 CFR 760.1307 - Dairy operation payment quantity.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 7 Agriculture 7 2012-01-01 2012-01-01 false Dairy operation payment quantity. 760.1307 Section 760..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Dairy Economic Loss Assistance Payment Program § 760.1307 Dairy operation payment quantity. (a) A dairy operation's payment quantity...

  17. 7 CFR 1430.207 - Dairy operation payment quantity.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 7 Agriculture 10 2012-01-01 2012-01-01 false Dairy operation payment quantity. 1430.207 Section... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS DAIRY PRODUCTS Milk Income Loss Contract Program § 1430.207 Dairy operation payment quantity. (a) The applicant's payment quantity of...

  18. 7 CFR 1430.207 - Dairy operation payment quantity.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 10 2013-01-01 2013-01-01 false Dairy operation payment quantity. 1430.207 Section... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS DAIRY PRODUCTS Milk Income Loss Contract Program § 1430.207 Dairy operation payment quantity. (a) The applicant's payment quantity of...

  19. 7 CFR 1430.207 - Dairy operation payment quantity.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 10 2011-01-01 2011-01-01 false Dairy operation payment quantity. 1430.207 Section... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS DAIRY PRODUCTS Milk Income Loss Contract Program § 1430.207 Dairy operation payment quantity. (a) The applicant's payment quantity of...

  20. 7 CFR 760.1307 - Dairy operation payment quantity.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 7 2011-01-01 2011-01-01 false Dairy operation payment quantity. 760.1307 Section 760..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Dairy Economic Loss Assistance Payment Program § 760.1307 Dairy operation payment quantity. (a) A dairy operation's payment quantity...

  1. 7 CFR 1430.207 - Dairy operation payment quantity.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 10 2014-01-01 2014-01-01 false Dairy operation payment quantity. 1430.207 Section... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS DAIRY PRODUCTS Milk Income Loss Contract Program § 1430.207 Dairy operation payment quantity. (a) The applicant's payment quantity of...

  2. 7 CFR 760.1307 - Dairy operation payment quantity.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 7 2010-01-01 2010-01-01 false Dairy operation payment quantity. 760.1307 Section 760..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Dairy Economic Loss Assistance Payment Program § 760.1307 Dairy operation payment quantity. (a) A dairy operation's payment quantity...

  3. 7 CFR 1430.207 - Dairy operation payment quantity.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Dairy operation payment quantity. 1430.207 Section... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS DAIRY PRODUCTS Milk Income Loss Contract Program § 1430.207 Dairy operation payment quantity. (a) The applicant's payment quantity of...

  4. 7 CFR 760.1307 - Dairy operation payment quantity.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 7 2013-01-01 2013-01-01 false Dairy operation payment quantity. 760.1307 Section 760..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Dairy Economic Loss Assistance Payment Program § 760.1307 Dairy operation payment quantity. (a) A dairy operation's payment quantity...

  5. 7 CFR 760.1307 - Dairy operation payment quantity.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 7 2014-01-01 2014-01-01 false Dairy operation payment quantity. 760.1307 Section 760..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Dairy Economic Loss Assistance Payment Program § 760.1307 Dairy operation payment quantity. (a) A dairy operation's payment quantity...

  6. 27 CFR 25.183 - Determination of quantity transferred.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... Brewery of Same Ownership § 25.183 Determination of quantity transferred. The shipping brewer shall determine the quantity of beer shipped at the time of removal from the consignor brewery, and the receiving brewer shall determine the quantity of beer received at the time of receipt at the consignee brewery....

  7. 27 CFR 25.183 - Determination of quantity transferred.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... Brewery of Same Ownership § 25.183 Determination of quantity transferred. The shipping brewer shall determine the quantity of beer shipped at the time of removal from the consignor brewery, and the receiving brewer shall determine the quantity of beer received at the time of receipt at the consignee brewery....

  8. 27 CFR 25.183 - Determination of quantity transferred.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... Brewery of Same Ownership § 25.183 Determination of quantity transferred. The shipping brewer shall determine the quantity of beer shipped at the time of removal from the consignor brewery, and the receiving brewer shall determine the quantity of beer received at the time of receipt at the consignee brewery....

  9. 27 CFR 25.183 - Determination of quantity transferred.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... Brewery of Same Ownership § 25.183 Determination of quantity transferred. The shipping brewer shall determine the quantity of beer shipped at the time of removal from the consignor brewery, and the receiving brewer shall determine the quantity of beer received at the time of receipt at the consignee brewery....

  10. 27 CFR 25.183 - Determination of quantity transferred.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... Brewery of Same Ownership § 25.183 Determination of quantity transferred. The shipping brewer shall determine the quantity of beer shipped at the time of removal from the consignor brewery, and the receiving brewer shall determine the quantity of beer received at the time of receipt at the consignee brewery....

  11. 43 CFR 3430.1-2 - Commercial quantities defined.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 43 Public Lands: Interior 2 2011-10-01 2011-10-01 false Commercial quantities defined. 3430.1-2... Leases § 3430.1-2 Commercial quantities defined. For the purpose of § 3430.1-1 of this title, commercial quantities is defined as follows: (a) The coal deposit discovered under the prospecting permit shall be...

  12. 41 CFR 101-27.102 - Economic order quantity principle.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 41 Public Contracts and Property Management 2 2013-07-01 2012-07-01 true Economic order quantity... MANAGEMENT 27.1-Stock Replenishment § 101-27.102 Economic order quantity principle. The economic order quantity (EOQ) principle is a means for achieving economical inventory management. Application of the...

  13. 41 CFR 101-27.102 - Economic order quantity principle.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 41 Public Contracts and Property Management 2 2011-07-01 2007-07-01 true Economic order quantity... MANAGEMENT 27.1-Stock Replenishment § 101-27.102 Economic order quantity principle. The economic order quantity (EOQ) principle is a means for achieving economical inventory management. Application of the...

  14. 41 CFR 101-27.102 - Economic order quantity principle.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 41 Public Contracts and Property Management 2 2010-07-01 2010-07-01 true Economic order quantity... MANAGEMENT 27.1-Stock Replenishment § 101-27.102 Economic order quantity principle. The economic order quantity (EOQ) principle is a means for achieving economical inventory management. Application of the...

  15. 41 CFR 101-27.102 - Economic order quantity principle.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 41 Public Contracts and Property Management 2 2014-07-01 2012-07-01 true Economic order quantity... MANAGEMENT 27.1-Stock Replenishment § 101-27.102 Economic order quantity principle. The economic order quantity (EOQ) principle is a means for achieving economical inventory management. Application of the...

  16. 41 CFR 101-27.102 - Economic order quantity principle.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 41 Public Contracts and Property Management 2 2012-07-01 2012-07-01 false Economic order quantity... MANAGEMENT 27.1-Stock Replenishment § 101-27.102 Economic order quantity principle. The economic order quantity (EOQ) principle is a means for achieving economical inventory management. Application of the...

  17. 48 CFR 52.211-18 - Variation in Estimated Quantity.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 2 2010-10-01 2010-10-01 false Variation in Estimated....211-18 Variation in Estimated Quantity. As prescribed in 11.703(c), insert the following clause in... in the estimated quantity of unit-priced items: Variation in Estimated Quantity (APR 1984) If...

  18. 48 CFR 852.216-70 - Estimated quantities.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Estimated quantities. 852... Estimated quantities. As prescribed in 816.504(a), insert the following clause: Estimated Quantities (APR... percent of the estimated requirement or which provide that the Government shall guarantee any...

  19. A comparison of the temporal expressiveness of three database query methods.

    PubMed Central

    Das, A. K.; Musen, M. A.

    1995-01-01

    Time is a multifaceted phenomenon that developers of clinical decision-support systems can model at various levels of complexity. An unresolved issue for the design of clinical databases is whether the underlying data model should support interval semantics. In this paper, we examine whether interval-based operations are required for querying protocol-based conditions. We report on an analysis of a set of 256 eligibility criteria that the T-HELPER system uses to screen patients for enrollment in eight clinical-trial protocols for HIV disease. We consider three data-manipulation methods for temporal querying: the consensus query representation Arden Syntax, the commercial standard query language SQL, and the temporal query language TimeLineSQL (TLSQL). We compare the ability of these three query methods to express the eligibility criteria. Seventy nine percent of the 256 criteria require operations on time stamps. These temporal conditions comprise four distinct patterns, two of which use interval-based data. Our analysis indicates that the Arden Syntax can query the two non-interval patterns, which represent 54% of the temporal conditions. Timepoint comparisons formulated in SQL can instantiate the two non-interval patterns and one interval pattern, which encompass 96% of the temporal conditions. TLSQL, which supports an interval-based model of time, can express all four types of temporal patterns. Our results demonstrate that the T-HELPER system requires simple temporal operations for most protocol-based queries. Of the three approaches tested, TLSQL is the only query method that is sufficiently expressive for the temporal conditions in this system. PMID:8563296

  20. An Energy-Efficient Skyline Query for Massively Multidimensional Sensing Data.

    PubMed

    Wang, Yan; Wei, Wei; Deng, Qingxu; Liu, Wei; Song, Houbing

    2016-01-01

    Cyber physical systems (CPS) sense the environment based on wireless sensor networks. The sensing data of such systems present the characteristics of massiveness and multi-dimensionality. As one of the major monitoring methods used in in safe production monitoring and disaster early-warning applications, skyline query algorithms are extensively adopted for multiple-objective decision analysis of these sensing data. With the expansion of network sizes, the amount of sensing data increases sharply. Then, how to improve the query efficiency of skyline query algorithms and reduce the transmission energy consumption become pressing and difficult to accomplish issues. Therefore, this paper proposes a new energy-efficient skyline query method for massively multidimensional sensing data. First, the method uses a node cut strategy to dynamically generate filtering tuples with little computational overhead when collecting query results instead of issuing queries with filters. It can judge the domination relationship among different nodes, remove the detected data sets of dominated nodes that are irrelevant to the query, modify the query path dynamically, and reduce the data comparison and computational overhead. The efficient dynamic filter generated by this strategy uses little non-skyline data transmission in the network, and the transmission distance is very short. Second, our method also employs the tuple-cutting strategy inside the node and generates the local cutting tuples by the sub-tree with the node itself as the root node, which will be used to cut the detected data within the nodes of the sub-tree. Therefore, it can further control the non-skyline data uploading. A large number of experimental results show that our method can quickly return an overview of the monitored area and reduce the communication overhead. Additionally, it can shorten the response time and improve the efficiency of the query. PMID:26761010