Science.gov

Sample records for aggregate query quantities

  1. Aggregates in the Temporal Query Language TQuel,

    DTIC Science & Technology

    1987-07-27

    makes it possible to define both standard and unique aggregates in a rigorous way. Ceri and Gottlob present 43 prVPW t TW WRJR V P P V * a translation...from a subset of SQL that includes aggregates into relational algebra, thereby defining an operational semantics for SQL aggregates [Ceri & Gottlob ...Zvi, J. The Time Relational Model. Ph). Diss. Computer Science Department, UCLA, 1982. (Ceri & Gotlob 19851 Ceri, S. and G. Gottlob . Translating SQL

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

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

  4. Formulation to obtain the most reliable aggregate mix with quantity and other constraints

    NASA Astrophysics Data System (ADS)

    Gehlot, Hemant; Chakroborty, Partha

    2016-09-01

    The aggregate batch mixing problem determines the proportion (or relative masses) in which aggregate batches with different gradations are to be blended so as to achieve a target mix with a given gradation. As shown in previous studies, the gradation of a batch is not homogeneous and should be considered stochastic. Also, when batches are blended in the field there are random variations in the masses or proportions of individual batches in the mix. Assuming batch gradation and blend masses as stochastic implies that the notion of a mix (blend) satisfying the gradation of a target mix becomes stochastic. In such a framework, every mix has a reliability with which it satisfies the definition of the target mix. In addition, a mix is also required to satisfy various restrictions. This article presents an optimization formulation to determine the most reliable mix while satisfying restrictions on available quantity, budget, etc.

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

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

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

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

  9. 40 CFR 355.14 - Do I have to aggregate extremely hazardous substances to determine the total quantity present?

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) SUPERFUND, EMERGENCY PLANNING, AND COMMUNITY RIGHT-TO-KNOW PROGRAMS EMERGENCY PLANNING AND NOTIFICATION Emergency Planning Who Must Comply § 355.14 Do I have... aggregate (i.e., add together) the amounts of each EHS at your facility to determine if a TPQ is...

  10. Quantity and quantity value

    NASA Astrophysics Data System (ADS)

    Mari, Luca; Giordani, Alessandro

    2012-12-01

    The concept system around ‘quantity’ and ‘quantity value’ is fundamental for measurement science, but some very basic issues are still open on such concepts and their relation. This paper argues that quantity values are in fact individual quantities, and that a complementarity exists between measurands and quantity values. This proposal is grounded on the analysis of three basic ‘equality’ relations: (i) between quantities, (ii) between quantity values and (iii) between quantities and quantity values. A consistent characterization of such concepts is obtained, which is then generalized to ‘property’ and ‘property value’. This analysis also throws some light on the elusive concept of magnitude. A preliminary version of this paper was presented and discussed at the Joint International IMEKO TC1, TC7 & TC13 Symposium, 31 August to 2 September 2011, Jena, Germany.

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

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

  13. SAM Chemical Methods Query

    EPA Pesticide Factsheets

    Laboratories measuring target chemical, radiochemical, pathogens, and biotoxin analytes in environmental samples can use this online query tool to identify analytical methods in EPA's Selected Analytical Methods for Environmental Remediation and Recovery

  14. SAM Radiochemical Methods Query

    EPA Pesticide Factsheets

    Laboratories measuring target radiochemical analytes in environmental samples can use this online query tool to identify analytical methods in EPA's Selected Analytical Methods for Environmental Remediation and Recovery for select radiochemical analytes.

  15. SAM Biotoxin Methods Query

    EPA Pesticide Factsheets

    Laboratories measuring target biotoxin analytes in environmental samples can use this online query tool to identify analytical methods included in EPA's Selected Analytical Methods for Environmental Remediation and Recovery for select biotoxins.

  16. SAM Pathogen Methods Query

    EPA Pesticide Factsheets

    Laboratories measuring target pathogen analytes in environmental samples can use this online query tool to identify analytical methods in EPA's Selected Analytical Methods for Environmental Remediation and Recovery for select pathogens.

  17. SAM Methods Query

    EPA Pesticide Factsheets

    Laboratories measuring target chemical, radiochemical, pathogens, and biotoxin analytes in environmental samples can use this online query tool to identify analytical methods included in EPA's Selected Analytical Methods for Environmental Remediation

  18. Neural cryptography with queries

    NASA Astrophysics Data System (ADS)

    Ruttor, Andreas; Kinzel, Wolfgang; Kanter, Ido

    2005-01-01

    Neural cryptography is based on synchronization of tree parity machines by mutual learning. We extend previous key-exchange protocols by replacing random inputs with queries depending on the current state of the neural networks. The probability of a successful attack is calculated for different model parameters using numerical simulations. The results show that queries restore the security against cooperating attackers. The success probability can be reduced without increasing the average synchronization time.

  19. Advanced Query Techniques.

    DTIC Science & Technology

    1979-10-01

    structures I* Data structures a. parse tree D. resolved intermediate query c. data access patn d. lists of matcning i-stances e. requestea fielas 2. Taules... tree (or a forest of trees ). A data relation riow Jescriptively corresponds to a downward oath of label words in tre nierarchy. 4e can reinforce this...general Page 3-10 Handling Natural languaqe Queries syntax-driven narsinq alooritnm for context- tree lanquaqes (41, further auqmented to accept syntactic

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

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

  2. FRS EZ Query

    EPA Pesticide Factsheets

    This page is the starting point for EZ Query. This page describes how to select key data elements from EPA's Facility Information Database and Geospatial Reference Database to build a tabular report or a Comma Separated Value (CSV) files for downloading.

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

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

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

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

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

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

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

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

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

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

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

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

  15. The role of economics in the QUERI program: QUERI Series

    PubMed Central

    Smith, Mark W; Barnett, Paul G

    2008-01-01

    Background The United States (U.S.) Department of Veterans Affairs (VA) Quality Enhancement Research Initiative (QUERI) has implemented economic analyses in single-site and multi-site clinical trials. To date, no one has reviewed whether the QUERI Centers are taking an optimal approach to doing so. Consistent with the continuous learning culture of the QUERI Program, this paper provides such a reflection. Methods We present a case study of QUERI as an example of how economic considerations can and should be integrated into implementation research within both single and multi-site studies. We review theoretical and applied cost research in implementation studies outside and within VA. We also present a critique of the use of economic research within the QUERI program. Results Economic evaluation is a key element of implementation research. QUERI has contributed many developments in the field of implementation but has only recently begun multi-site implementation trials across multiple regions within the national VA healthcare system. These trials are unusual in their emphasis on developing detailed costs of implementation, as well as in the use of business case analyses (budget impact analyses). Conclusion Economics appears to play an important role in QUERI implementation studies, only after implementation has reached the stage of multi-site trials. Economic analysis could better inform the choice of which clinical best practices to implement and the choice of implementation interventions to employ. QUERI economics also would benefit from research on costing methods and development of widely accepted international standards for implementation economics. PMID:18430199

  16. Structured Query Language (SQL) fundamentals.

    PubMed

    Jamison, D Curtis

    2003-02-01

    Relational databases provide the most common platform for storing data. The Structured Query Language (SQL) is a powerful tool for interacting with relational database systems. SQL enables the user to concoct complex and powerful queries in a straightforward manner, allowing sophisticated data analysis using simple syntax and structure. This unit demonstrates how to use the MySQL package to build and interact with a relational database.

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

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

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

  20. Consistent Query Answering of Conjunctive Queries under Primary Key Constraints

    ERIC Educational Resources Information Center

    Pema, Enela

    2014-01-01

    An inconsistent database is a database that violates one or more of its integrity constraints. In reality, violations of integrity constraints arise frequently under several different circumstances. Inconsistent databases have long posed the challenge to develop suitable tools for meaningful query answering. A principled approach for querying…

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

  2. Image Querying by Image Professionals.

    ERIC Educational Resources Information Center

    Jorgensen, Corinne; Jorgensen, Peter

    2003-01-01

    Reports the analysis of search logs from a commercial image provider over a one-month period and discusses results in relation to previous findings. Analyzes image searches, image queries composing the search, user search modification strategies, results returned, and user browsing of results. (Author/AEF)

  3. Query Processing in TREC-6.

    ERIC Educational Resources Information Center

    Rao, Ashwin; Lu, Allan; Meier, Ed; Ahmed, Salahuddin; Pliske, Daniel

    2000-01-01

    Discussion of query processing focuses on techniques developed by LEXIS-NEXIS for identifying key concepts, selecting synonyms and related terms, and detecting phrases that can be combined to increase recall and precision. Describes experiments in the ad hoc track of the sixth TREC (Text Retrieval Conference), including the use of ranking…

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

  5. Quantity discrimination in salamanders.

    PubMed

    Krusche, Paul; Uller, Claudia; Dicke, Ursula

    2010-06-01

    We investigated discrimination of large quantities in salamanders of the genus Plethodon. Animals were challenged with two different quantities (8 vs 12 or 8 vs 16) in a two-alternative choice task. Stimuli were live crickets, videos of live crickets or images animated by a computer program. Salamanders reliably chose the larger of two quantities when the ratio between the sets was 1:2 and stimuli were live crickets or videos thereof. Magnitude discrimination was not successful when the ratio was 2:3, or when the ratio was 1:2 when stimuli were computer animated. Analysis of the salamanders' success and failure as well as analysis of stimulus features points towards movement as a dominant feature for quantity discrimination. The results are generally consistent with large quantity discrimination investigated in many other animals (e.g. primates, fish), current models of quantity representation (analogue magnitudes) and data on sensory aspects of amphibian prey-catching behaviour (neuronal motion processing).

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

  7. Monitoring Moving Queries inside a Safe Region

    PubMed Central

    Al-Khalidi, Haidar; Taniar, David; Alamri, Sultan

    2014-01-01

    With mobile moving range queries, there is a need to recalculate the relevant surrounding objects of interest whenever the query moves. Therefore, monitoring the moving query is very costly. The safe region is one method that has been proposed to minimise the communication and computation cost of continuously monitoring a moving range query. Inside the safe region the set of objects of interest to the query do not change; thus there is no need to update the query while it is inside its safe region. However, when the query leaves its safe region the mobile device has to reevaluate the query, necessitating communication with the server. Knowing when and where the mobile device will leave a safe region is widely known as a difficult problem. To solve this problem, we propose a novel method to monitor the position of the query over time using a linear function based on the direction of the query obtained by periodic monitoring of its position. Periodic monitoring ensures that the query is aware of its location all the time. This method reduces the costs associated with communications in client-server architecture. Computational results show that our method is successful in handling moving query patterns. PMID:24696652

  8. A Priori Analysis of Natural Language Queries.

    ERIC Educational Resources Information Center

    Spiegler, Israel; Elata, Smadar

    1988-01-01

    Presents a model for the a priori analysis of natural language queries which uses an algorithm to transform the query into a logical pattern that is used to determine the answerability of the query. The results of testing by a prototype system implemented in PROLOG are discussed. (20 references) (CLB)

  9. Szegedy's quantum walk with queries

    NASA Astrophysics Data System (ADS)

    Santos, Raqueline A. M.

    2016-11-01

    When searching for a marked vertex in a graph, Szegedy's usual search operator is defined by using the transition probability matrix of the random walk with absorbing barriers at the marked vertices. Instead of using this operator, we analyze searching with Szegedy's quantum walk by using reflections around the marked vertices, that is, the standard form of quantum query. We show we can boost the probability to 1 of finding a marked vertex in the complete graph. Numerical simulations suggest that the success probability can be improved for other graphs, like the two-dimensional grid. We also prove that, for a certain class of graphs, we can express Szegedy's search operator, obtained from the absorbing walk, using the standard query model.

  10. Mining and Querying Multimedia Data

    DTIC Science & Technology

    2011-09-29

    similar image nodes, most previous work searches for nearest neigh- bors in the image feature space. However, this operation is super-linear even with the...on Knowledge discovery and data mining, KDD ’02, pages 133–142, 2002. [61] Thorsten Joachims, Laura Granka, Bing Pan, Helene Hembrooke, and Geri Gay ...Radlinski, and Geri Gay . Evaluating the accuracy of implicit feedback from clicks and query reformula- tions in web search. ACM Trans. Inf. Syst., 25(2):7

  11. Quantum query complexity for qutrits

    NASA Astrophysics Data System (ADS)

    Tamir, Boaz

    2008-02-01

    We compute lower bounds for the exact quantum query complexity of a ternary function f . The lower bound is of order O(log3(n)) . In case f is symmetric on a sphere then the lower bound is of order O(n) . This work is a natural continuation of the work of Beals, Buhrman, Cleve, Mosca, and de Wolf on lower limits for binary functions.

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

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

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

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

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

  17. Saddle quantities and applications

    NASA Astrophysics Data System (ADS)

    Joyal, Pierre; Rousseau, Christiane

    In this paper we make the connection between the theoretical study of the generalized homoclinic loop bifurcation (GHB ∗) and the practical computational aspects. For this purpose we first compare the Dulac normal form with the Joyal normal form. These forms were both used to prove the GHB ∗ theorem. But the second one is far more practical from the algorithmic point of view. We then show that the information carried by these normal forms can be computed in a much simpler way, using what we shall call dual Lyapunov constants. The coefficients of a normal form or the dual Lyapunov quantities are particular cases of what we shall call saddle quantities. We calculate the saddle quantities for quadratic systems, and we show that no more than three limit cycles can appear in a homoclinic loop bifurcation. We also study the homoclinic loop bifurcation of order 5, appearing in a 6-parameter family close to a Hamiltonian system. To our knowledge, this is the first time that one can find a complete description of a GHB ∗ of such high order. Finally we calculate the saddle quantities for a symmetric cubic vector field, and we deduce a bound for the number of limit cycles that appear in a GHB ∗.

  18. RiPPAS: A Ring-Based Privacy-Preserving Aggregation Scheme in Wireless Sensor Networks

    PubMed Central

    Zhang, Kejia; Han, Qilong; Cai, Zhipeng; Yin, Guisheng

    2017-01-01

    Recently, data privacy in wireless sensor networks (WSNs) has been paid increased attention. The characteristics of WSNs determine that users’ queries are mainly aggregation queries. In this paper, the problem of processing aggregation queries in WSNs with data privacy preservation is investigated. A Ring-based Privacy-Preserving Aggregation Scheme (RiPPAS) is proposed. RiPPAS adopts ring structure to perform aggregation. It uses pseudonym mechanism for anonymous communication and uses homomorphic encryption technique to add noise to the data easily to be disclosed. RiPPAS can handle both sum() queries and min()/max() queries, while the existing privacy-preserving aggregation methods can only deal with sum() queries. For processing sum() queries, compared with the existing methods, RiPPAS has advantages in the aspects of privacy preservation and communication efficiency, which can be proved by theoretical analysis and simulation results. For processing min()/max() queries, RiPPAS provides effective privacy preservation and has low communication overhead. PMID:28178197

  19. RiPPAS: A Ring-Based Privacy-Preserving Aggregation Scheme in Wireless Sensor Networks.

    PubMed

    Zhang, Kejia; Han, Qilong; Cai, Zhipeng; Yin, Guisheng

    2017-02-07

    Recently, data privacy in wireless sensor networks (WSNs) has been paid increased attention. The characteristics of WSNs determine that users' queries are mainly aggregation queries. In this paper, the problem of processing aggregation queries in WSNs with data privacy preservation is investigated. A Ring-based Privacy-Preserving Aggregation Scheme (RiPPAS) is proposed. RiPPAS adopts ring structure to perform aggregation. It uses pseudonym mechanism for anonymous communication and uses homomorphic encryption technique to add noise to the data easily to be disclosed. RiPPAS can handle both s u m ( ) queries and m i n ( ) / m a x ( ) queries, while the existing privacy-preserving aggregation methods can only deal with s u m ( ) queries. For processing s u m ( ) queries, compared with the existing methods, RiPPAS has advantages in the aspects of privacy preservation and communication efficiency, which can be proved by theoretical analysis and simulation results. For processing m i n ( ) / m a x ( ) queries, RiPPAS provides effective privacy preservation and has low communication overhead.

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

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

  2. Query Reformulation for Clinical Decision Support Search

    DTIC Science & Technology

    2014-11-01

    Query Reformulation for Clinical Decision Support Search Luca Soldaini, Arman Cohan, Andrew Yates, Nazli Goharian, Ophir Frieder Information...work, we present a query reformulation approach that addresses the unique formulation of case reports, making them suitable to be used on a general... reformulation approach does not directly take into account the generic question type (diagnosis, test, treatment) provided with each approach. To ameliorate

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

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

  5. Assigning function to CDS through qualified query answering: Beyond alignment and motifs

    SciTech Connect

    Gaasterland, T.; Maltsev, N.; Lobo, J.

    1994-12-31

    In this paper, we show how to use qualitative query answering to annotate CDS-to-function relationships with confidence in the score, confidence in the tool, and confidence in the decision about the function. The system, implemented in Prolog, provides users with a powerful tool to analyze large quantities of data that have been produced by multiple sequence analysis programs. Using qualified query answering techniques, users can easily change the criteria for how tools reinforce each other and for how numbers of occurrences of particular functions reinforce each other. They can also after how different scores for different tools are categorized.

  6. RF Modal Quantity Gaging

    NASA Technical Reports Server (NTRS)

    Vanleuven, K.

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

  7. Experimental quantum private queries with linear optics

    SciTech Connect

    De Martini, Francesco; Giovannetti, Vittorio; Lloyd, Seth; Maccone, Lorenzo; Nagali, Eleonora; Sansoni, Linda; Sciarrino, Fabio

    2009-07-15

    The quantum private query is a quantum cryptographic protocol to recover information from a database, preserving both user and data privacy: the user can test whether someone has retained information on which query was asked and the database provider can test the amount of information released. Here we discuss a variant of the quantum private query algorithm that admits a simple linear optical implementation: it employs the photon's momentum (or time slot) as address qubits and its polarization as bus qubit. A proof-of-principle experimental realization is implemented.

  8. Provenance Storage, Querying, and Visualization in PBase

    SciTech Connect

    Kianmajd, Parisa; Ludascher, Bertram; Missier, Paolo; Chirigati, Fernando; Wei, Yaxing; Koop, David; Dey, Saumen

    2015-01-01

    We present PBase, a repository for scientific workflows and their corresponding provenance information that facilitates the sharing of experiments among the scientific community. PBase is interoperable since it uses ProvONE, a standard provenance model for scientific workflows. Workflows and traces are stored in RDF, and with the support of SPARQL and the tree cover encoding, the repository provides a scalable infrastructure for querying the provenance data. Furthermore, through its user interface, it is possible to: visualize workflows and execution traces; visualize reachability relations within these traces; issue SPARQL queries; and visualize query results.

  9. Intermediate dosimetric quantities.

    PubMed

    Kellerer, A M; Hahn, K; Rossi, H H

    1992-04-01

    The transfer of energy from ionizing radiation to matter involves a series of steps. In wide ranges of their energy spectra photons and neutrons transfer energy to an irradiated medium almost exclusively by the production of charged particles which ionize and thereby produce electrons that can ionize in turn. The examination of these processes leads to a series of intermediate quantities. One of these is kerma, which has long been employed as a measure of the energy imparted in the first of the interactions. It depends only on the fluence of uncharged particles and is therefore--unlike absorbed dose and electron fluence--insensitive to local differences of receptor geometry and composition. An analogous quantity for charged-particle fields, cema (converted energy per unit mass), is defined, which quantifies the energy imparted in terms of the interactions of charged particles, disregarding energy dissipation by secondary electrons. Cema can be expressed as an integral over the fluence of ions times their stopping power. However, complications arise when the charged particles are electrons, and when their fluence cannot be separated from that of the secondaries. The resulting difficulty can be circumvented by the definition of reduced cema. This quantity corresponds largely to the concept employed in the cavity theory of Spencer and Attix. In reduced cema not all secondary electrons but all electrons below a chosen cutoff energy, delta, are considered to be absorbed locally. When the cutoff energy is reduced, cema approaches absorbed dose and thereby becomes sensitive to highly local differences in geometry or composition. With larger values of delta, reduced cema is a useful parameter to specify the dose-generating potential of a charged-particle field 'free in air' or in vacuo. It is nearly equal to the mean absorbed dose in a sphere with radius equal to the range of electrons of energy delta. Reduced cema is a function of the fluence at the specified location at

  10. Superfund Chemical Data Matrix (SCDM) Query

    EPA Pesticide Factsheets

    This site allows you to to easily query the Superfund Chemical Data Matrix (SCDM) and generate a list of the corresponding Hazard Ranking System (HRS) factor values, benchmarks, and data elements that you need.

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

  13. Superfund Chemical Data Matrix (SCDM) Query - Popup

    EPA Pesticide Factsheets

    This site allows you to to easily query the Superfund Chemical Data Matrix (SCDM) and generate a list of the corresponding Hazardous Ranking System (HRS) factor values, benchmarks, and data elements that you need.

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

  15. Managing and Querying Whole Slide Images

    PubMed Central

    Wang, Fusheng; Oh, Tae W.; Vergara-Niedermayr, Cristobal; Kurc, Tahsin; Saltz, Joel

    2012-01-01

    High-resolution pathology images provide rich information about the morphological and functional characteristics of biological systems, and are transforming the field of pathology into a new era. To facilitate the use of digital pathology imaging for biomedical research and clinical diagnosis, it is essential to manage and query both whole slide images (WSI) and analytical results generated from images, such as annotations made by humans and computed features and classifications made by computer algorithms. There are unique requirements on modeling, managing and querying whole slide images, including compatibility with standards, scalability, support of image queries at multiple granularities, and support of integrated queries between images and derived results from the images. In this paper, we present our work on developing the Pathology Image Database System (PIDB), which is a standard oriented image database to support retrieval of images, tiles, regions and analytical results, image visualization and experiment management through a unified interface and architecture. The system is deployed for managing and querying whole slide images for In Silico brain tumor studies at Emory University. PIDB is generic and open source, and can be easily used to support other biomedical research projects. It has the potential to be integrated into a Picture Archiving and Communications System (PACS) with powerful query capabilities to support pathology imaging. PMID:22844574

  16. Managing and querying whole slide images

    NASA Astrophysics Data System (ADS)

    Wang, Fusheng; Oh, Tae W.; Vergara-Niedermayr, Cristobal; Kurc, Tahsin; Saltz, Joel

    2012-02-01

    High-resolution pathology images provide rich information about the morphological and functional characteristics of biological systems, and are transforming the field of pathology into a new era. To facilitate the use of digital pathology imaging for biomedical research and clinical diagnosis, it is essential to manage and query both whole slide images (WSI) and analytical results generated from images, such as annotations made by humans and computed features and classifications made by computer algorithms. There are unique requirements on modeling, managing and querying whole slide images, including compatibility with standards, scalability, support of image queries at multiple granularities, and support of integrated queries between images and derived results from the images. In this paper, we present our work on developing the Pathology Image Database System (PIDB), which is a standard oriented image database to support retrieval of images, tiles, regions and analytical results, image visualization and experiment management through a unified interface and architecture. The system is deployed for managing and querying whole slide images for In Silico brain tumor studies at Emory University. PIDB is generic and open source, and can be easily used to support other biomedical research projects. It has the potential to be integrated into a Picture Archiving and Communications System (PACS) with powerful query capabilities to support pathology imaging.

  17. A Query Cache Tool for Optimizing Repeatable and Parallel OLAP Queries

    NASA Astrophysics Data System (ADS)

    Santos, Ricardo Jorge; Bernardino, Jorge

    On-line analytical processing against data warehouse databases is a common form of getting decision making information for almost every business field. Decision support information oftenly concerns periodic values based on regular attributes, such as sales amounts, percentages, most transactioned items, etc. This means that many similar OLAP instructions are periodically repeated, and simultaneously, between the several decision makers. Our Query Cache Tool takes advantage of previously executed queries, storing their results and the current state of the data which was accessed. Future queries only need to execute against the new data, inserted since the queries were last executed, and join these results with the previous ones. This makes query execution much faster, because we only need to process the most recent data. Our tool also minimizes the execution time and resource consumption for similar queries simultaneously executed by different users, putting the most recent ones on hold until the first finish and returns the results for all of them. The stored query results are held until they are considered outdated, then automatically erased. We present an experimental evaluation of our tool using a data warehouse based on a real-world business dataset and use a set of typical decision support queries to discuss the results, showing a very high gain in query execution time.

  18. ASSET Queries: A Set-Oriented and Column-Wise Approach to Modern OLAP

    NASA Astrophysics Data System (ADS)

    Chatziantoniou, Damianos; Sotiropoulos, Yannis

    Modern data analysis has given birth to numerous grouping constructs and programming paradigms, way beyond the traditional group by. Applications such as data warehousing, web log analysis, streams monitoring and social networks understanding necessitated the use of data cubes, grouping variables, windows and MapReduce. In this paper we review the associated set (ASSET) concept and discuss its applicability in both continuous and traditional data settings. Given a set of values B, an associated set over B is just a collection of annotated data multisets, one for each b(B. The goal is to efficiently compute aggregates over these data sets. An ASSET query consists of repeated definitions of associated sets and aggregates of these, possibly correlated, resembling a spreadsheet document. We review systems implementing ASSET queries both in continuous and persistent contexts and argue for associated sets' analytical abilities and optimization opportunities.

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

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

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

  2. Semantic analysis of WebGIS Chinese query sentences

    NASA Astrophysics Data System (ADS)

    Xu, Aiping; Bian, Fuling

    2006-10-01

    No matter how much complicated Chinese query sentences may be, they are always made up of query targets, query conditions and grouping segments. The query targets are often at the tail of a sentence or behind the interrogative word. As a result, to comprehend a query sentence, the first step is to get the query targets, and then extraction the query conditions and grouping segments from the rest information of the sentence. The Semantic-analyzing of the query target, query condition and grouping are researched and some corresponding algorithms are presented in this paper. Some groups of Chinese query sentences of different structure be tested, which show that these algorithms are feasible and effective. They are worth further researched.

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

  4. A Preliminary Mapping of Web Queries Using Existing Image Query Schemes.

    ERIC Educational Resources Information Center

    Jansen, Bernard J.

    End user searching on the Web has become the primary method of locating images for many people. This study investigates the nature of Web image queries by attempting to map them to known image classification schemes. In this study, approximately 100,000 image queries from a major Web search engine were collected in 1997, 1999, and 2001. A…

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

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

  7. Scale-Independent Relational Query Processing

    DTIC Science & Technology

    2013-10-04

    hopes that the bounded plan will exhibit more predictable behaviour as the amount of data in the system grows. In order to quantify the e↵ect of...instead of each node of the tree having only two children , each B-tree node has many. This allows for much larger nodes, each of which can be retrieved by...database grows. Since the actual execution strategy is divorced from the query specified by the developer, it is possible for a new physical query plan to be

  8. Analysis of Performance Variation Using Query Expansion.

    ERIC Educational Resources Information Center

    Alemayehu, Nega

    2003-01-01

    Discussion of information retrieval performance evaluation focuses on a case study using a statistical repeated measures analysis of variance for testing the significance of factors, such as retrieval method and topic in retrieval performance variation. Analyses of the effect of query expansion on document ranking confirm that expansion affects…

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

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

  11. Query Answering Driven by Collaborating Agents

    NASA Astrophysics Data System (ADS)

    Dardzinska, Agnieszka

    We assume that there is a group of collaborating agents where each agent is defined as an Information System coupled with a Query Answering System (QAS). Values of attributes in an information system S form atomic expressions of a language used by the agent associated with S to communicate with other agents. Collaboration among agents is initiated when one of the agent's, say the one associated with S and called a client, is asked by user to resolve a query containing nonlocal attributes for S. Then, the client will ask for help other agents to have that query answered. As the result of this request, knowledge in the form of defnitions of locally foreign attribute values for S is extracted at information systems representing other agents and sent to the client. The outcome of this step is a knowledge-base KB created at the client site and used to answer the query. In this paper we present a method of identifying which agents are semantically the closest to S and show that the precision and recall of QAS is getting increased when only these agents are ask for help by the client.

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

  13. Patterns, Quantities, and Linear Functions

    ERIC Educational Resources Information Center

    Ellis, Amy B.

    2009-01-01

    Pattern generalization and a focus on quantities are important aspects of algebraic reasoning. This article describes two different approaches to teaching and learning linear functions for middle school students. One group focused on patterns in number tables, and the other group worked primarily with real-world quantities. This article highlights…

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

  15. Quantity Stickiness versus Stackelberg Leadership

    SciTech Connect

    Ferreira, F. A.

    2008-10-30

    We study the endogenous Stackelberg relations in a dynamic market. We analyze a twice-repeated duopoly where, in the beginning, each firm chooses either a quantity-sticky production mode or a quantity-flexible production mode. The size of the market becomes observable after the first period. In the second period, a firm can adjust its quantity if, and only if, it has adopted the flexible mode. Hence, if one firm chooses the sticky mode whilst the other chooses the flexible mode, then they respectively play the roles of a Stackelberg leader and a Stackelberg follower in the second marketing period. We compute the supply quantities at equilibrium and the corresponding expected profits of the firms. We also analyze the effect of the slope parameter of the demand curve on the expected supply quantities and on the profits.

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

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

  18. Enabling Ontology Based Semantic Queries in Biomedical Database Systems

    PubMed Central

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

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

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

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

  1. Enabling Ontology Based Semantic Queries in Biomedical Database Systems

    PubMed Central

    Zheng, Shuai; Lu, James

    2014-01-01

    There is a lack of tools to ease the integration and ontology based semantic queries in biomedical databases, which are often annotated with ontology concepts. We aim to provide a middle layer between ontology repositories and semantically annotated databases to support semantic queries directly in the databases with expressive standard database query languages. We have developed a semantic query engine that provides semantic reasoning and query processing, and translates the queries into ontology repository operations on NCBO BioPortal. Semantic operators are implemented in the database as user defined functions extended to the database engine, thus semantic queries can be directly specified in standard database query languages such as SQL and XQuery. The system provides caching management to boosts query performance. The system is highly adaptable to support different ontologies through easy customizations. We have implemented the system DBOntoLink as an open source software, which supports major ontologies hosted at BioPortal. DBOntoLink supports a set of common ontology based semantic operations and have them fully integrated with a database management system IBM DB2. The system has been deployed and evaluated with an existing biomedical database for managing and querying image annotations and markups (AIM). Our performance study demonstrates the high expressiveness of semantic queries and the high efficiency of the queries. PMID:25541585

  2. An Approach to Query Cost Modelling in Numeric Databases.

    ERIC Educational Resources Information Center

    Jarvelin, Kalervo

    1989-01-01

    Examines factors that determine user charges based on query processing costs in numeric databases, and analyzes the problem of estimating such charges in advance. An approach to query cost estimation is presented which is based on the relational data model and the query optimization, cardinality estimation, and file design techniques developed in…

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

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

  5. Structure of Domain Novice Users' Queries to a History Database.

    ERIC Educational Resources Information Center

    Cole, Charles; Leide, John E.; Nwakamma, Emeka; Beheshti, Jamshid; Large, Andrew

    2003-01-01

    Presents preliminary results from a study of an information need identification system for interactive information retrieval for undergraduates researching a history topic. Concludes that the query taxonomy must include levels of topic specificity because while general topic-based queries are inappropriate as query terms, more specific topic-based…

  6. Magnetoelastic sensors for remote query environmental monitoring

    NASA Astrophysics Data System (ADS)

    Grimes, C. A.; Ong, K. G.; Loiselle, K.; Stoyanov, P. G.; Kouzoudis, D.; Liu, Y.; Tong, C.; Tefiku, F.

    1999-10-01

    Magnetoelastic thin film sensors can be considered the magnetic analog of surface acoustic wave sensors, with the characteristic resonant frequency of the magnetoelastic sensor changing in response to different environmental parameters. We report on the application of magnetoelastic sensors for remote query measurement of pressure, temperature, liquid viscosity and, in combination with a glucose-responding mass-changing polymer, glucose concentrations. The advantage of using magnetoelastic sensors is that no direct physical connections, such as wires or cables, are required to obtain sensor information allowing the sensor to be monitored from inside sealed containers. Furthermore since it is the frequency response of the sensor that is monitored, rather than the amplitude, the relative orientation of the sensor with respect to the query field is unimportant.

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

  8. An Ensemble Approach for Expanding Queries

    DTIC Science & Technology

    2012-11-01

    mg left do all it pressure your No up history which MEDICAL take an there also HOURS x out a about above after again against...set a limit of ten recommendation terms per concept term expansion. An example below demonstrates the expansion tail for the concept term “ lupus ...nephritis” in query number 145. lupus nephritis (nephritis OR lupus lupus OR glomerulonephritis mycophenolate OR mofetil glomerulonephritis OR

  9. Map-Based Querying for Multimedia Database

    DTIC Science & Technology

    2014-09-01

    existing assets in a custom multimedia database based on an area of interest. It also describes the augmentation of an Android Tactical Assault Kit (ATAK...to allow for selection and specification of an area of interest. 15. SUBJECT TERMS android web service client, map based database query, android ...a custom Web service and augmentation of the Android Tactical Assault Kit (ATAK), version 2.0, to gather spatial information from the map engine

  10. Reportable Quantities Federal Register Notices

    EPA Pesticide Factsheets

    Comprehensive Environmental Response, Compensation and Liability Act regulation designates specific substances as hazardous; identifies the quantity of substances which, when released, requires notification; and sets forth the notification requirements.

  11. QUERI and implementation research: emerging from adolescence into adulthood: QUERI Series.

    PubMed

    Atkins, David

    2009-03-06

    The Quality Enhancement Research Initiative (QUERI) program and implementation research have both come of age in the 10 years since QUERI was established. Looking forward, if QUERI and the field of implementation science are to mature successfully, we will need to address a series of challenges. First, we need to more clearly demonstrate how applying principles of implementation science leads to more effective implementation and communicate those lessons to our partners and funders. Second, we will need to engage in the ongoing debate over methodological standards in quality improvement and implementation research. Third, a program like QUERI needs to become more relevant to the daily decisions of key stakeholders. Fourth, if we hope to sustain interest in implementation science, we will need to demonstrate the business case for more effective implementation. Fifth, we need to think creatively about how to nurture the next generations of implementation researchers and front-line "connectors," who are critical for accelerating implementation. Finally, we need to strengthen the connections between implementation research and the other operational and research activities that influence change in healthcare systems. The excitement of entering adulthood is tempered by the challenge of new responsibilities and expectations. What is essential is that we continue to learn and move forward. For implementation science and for QUERI, the next decade looks to be one filled with exciting possibilities, new partnerships, increasing relevance, and real accomplishment.

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

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

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

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

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

  17. Characterizing the time-perspective of nations with search engine query data.

    PubMed

    Noguchi, Takao; Stewart, Neil; Olivola, Christopher Y; Moat, Helen Susannah; Preis, Tobias

    2014-01-01

    Vast quantities of data on human behavior are being created by our everyday internet usage. Building upon a recent study by Preis, Moat, Stanley, and Bishop (2012), we used search engine query data to construct measures of the time-perspective of nations, and tested these measures against per-capita gross domestic product (GDP). The results indicate that nations with higher per-capita GDP are more focused on the future and less on the past, and that when these nations do focus on the past, it is more likely to be the distant past. These results demonstrate the viability of using nation-level data to build psychological constructs.

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

  19. Query-Based Outlier Detection in Heterogeneous Information Networks.

    PubMed

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

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

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

    PubMed Central

    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

  1. GMB: an efficient query processor for biological data.

    PubMed

    Taha, Kamal; Elmasri, Ramez

    2011-08-31

    Bioinformatics applications manage complex biological data stored into distributed and often heterogeneous databases and require large computing power. These databases are too big and complicated to be rapidly queried every time a user submits a query, due to the overhead involved in decomposing the queries, sending the decomposed queries to remote databases, and composing the results. There is also considerable communication costs involved. This study addresses the mentioned problems in Grid-based environment for bioinformatics. We propose a Grid middleware called GMB that alleviates these problems by caching the results of Frequently Used Queries (FUQ). Queries are classified based on their types and frequencies. FUQ are answered from the middleware, which improves their response time. GMB acts as a gateway to TeraGrid Grid: it resides between users’ applications and TeraGrid Grid. We evaluate GMB experimentally.

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

  3. RCQ-GA: RDF Chain Query Optimization Using Genetic Algorithms

    NASA Astrophysics Data System (ADS)

    Hogenboom, Alexander; Milea, Viorel; Frasincar, Flavius; Kaymak, Uzay

    The application of Semantic Web technologies in an Electronic Commerce environment implies a need for good support tools. Fast query engines are needed for efficient querying of large amounts of data, usually represented using RDF. We focus on optimizing a special class of SPARQL queries, the so-called RDF chain queries. For this purpose, we devise a genetic algorithm called RCQ-GA that determines the order in which joins need to be performed for an efficient evaluation of RDF chain queries. The approach is benchmarked against a two-phase optimization algorithm, previously proposed in literature. The more complex a query is, the more RCQ-GA outperforms the benchmark in solution quality, execution time needed, and consistency of solution quality. When the algorithms are constrained by a time limit, the overall performance of RCQ-GA compared to the benchmark further improves.

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

    PubMed

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

    2016-08-23

    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.

  5. Query Modification through External Sources to Support Clinical Decisions

    DTIC Science & Technology

    2014-11-01

    Query Modification through External Sources to Support Clinical Decisions Raymond Wan1, Jannifer Hiu-Kwan Man2, and Ting-Fung Chan1 1School of Life...query modifications that use either external data sources or a domain expert. While each method gave slightly different results, we discovered that...biomedical literature offers many possible paths of investigation, our study focused on modifications to the query using external data sources. We submitted 5

  6. Query Expansion Using SNOMED-CT and Weighing Schemes

    DTIC Science & Technology

    2014-11-01

    1 Query Expansion Using SNOMED-CT and Weighing Schemes Dawit Girmay, Afshin Deroie York University, Toronto Canada Abstract Despite all the...Query Expansion , Ontology, relevance score Keywords Weighing Methods, SNOMED-CT 1. Introduction and Motivation The Clinical Track is instituted to...control number. 1. REPORT DATE NOV 2014 2. REPORT TYPE 3. DATES COVERED 00-00-2014 to 00-00-2014 4. TITLE AND SUBTITLE Query Expansion Using

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

  8. Model-based query language for analyzing clinical processes.

    PubMed

    Barzdins, Janis; Barzdins, Juris; Rencis, Edgars; Sostaks, Agris

    2013-01-01

    Nowadays large databases of clinical process data exist in hospitals. However, these data are rarely used in full scope. In order to perform queries on hospital processes, one must either choose from the predefined queries or develop queries using MS Excel-type software system, which is not always a trivial task. In this paper we propose a new query language for analyzing clinical processes that is easily perceptible also by non-IT professionals. We develop this language based on a process modeling language which is also described in this paper. Prototypes of both languages have already been verified using real examples from hospitals.

  9. VPipe: Virtual Pipelining for Scheduling of DAG Stream Query Plans

    NASA Astrophysics Data System (ADS)

    Wang, Song; Gupta, Chetan; Mehta, Abhay

    There are data streams all around us that can be harnessed for tremendous business and personal advantage. For an enterprise-level stream processing system such as CHAOS [1] (Continuous, Heterogeneous Analytic Over Streams), handling of complex query plans with resource constraints is challenging. While several scheduling strategies exist for stream processing, efficient scheduling of complex DAG query plans is still largely unsolved. In this paper, we propose a novel execution scheme for scheduling complex directed acyclic graph (DAG) query plans with meta-data enriched stream tuples. Our solution, called Virtual Pipelined Chain (or VPipe Chain for short), effectively extends the "Chain" pipelining scheduling approach to complex DAG query plans.

  10. Distributed query plan generation using multiobjective genetic algorithm.

    PubMed

    Panicker, Shina; Kumar, T V Vijay

    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.

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

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

  13. PQL: a declarative query language over dynamic biological schemata.

    PubMed Central

    Mork, P.; Shaker, R.; Halevy, A.; Tarczy-Hornoch, P.

    2002-01-01

    We introduce the PQL query language (PQL) used in the GeneSeek genetic data integration project. PQL incorporates many features of query languages for semi-structured data. To this we add the ability to express metadata constraints like intended semantics and database curation approach. These constraints guide the dynamic generation of potential query plans. This allows a single query to remain relevant even in the presence of source and mediated schemas that are continually evolving, as is often the case in data integration. PMID:12463881

  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. Semantics Enabled Queries in EuroGEOSS: a Discovery Augmentation Approach

    NASA Astrophysics Data System (ADS)

    Santoro, M.; Mazzetti, P.; Fugazza, C.; Nativi, S.; Craglia, M.

    2010-12-01

    regards the multilinguality relationship; ii. The resulting queries are submitted to the federated catalog services; iii. The DAC performs a “smart” aggregation of the queries results and provides them back to the client. In the second case, the main discovery steps are: i. the user browses the federated semantic repositories and selects the concepts/terms-of-interest; ii. The DAC creates the set of geospatial queries based on the selected concepts/terms and submits them to the federated catalog services; iii. The DAC performs a “smart” aggregation of the queries results and provides them back to the client. A Graphical User Interface (GUI) was also developed for testing and interacting with the DAC. The entire brokering framework is deployed in the context of EuroGEOSS infrastructure and it is used in a couple of GEOSS AIP-3 use scenarios: the “e-Habitat Use Scenario” for the Biodiversity and Climate Change topic, and the “Comprehensive Drought Index Use Scenario” for Water/Drought topic

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

  17. Image query based on color harmony

    NASA Astrophysics Data System (ADS)

    Vasile, Alexandru; Bender, Walter R.

    2001-06-01

    The combination of the increased size of digital image databases and the increased frequency with which non- specialist access these databases is raising the question of the efficacy of visual search and retrieval tools. We hypothesize that the use of color harmony has the potential for improving image-search efficiency. We describe an image- retrieval algorithm that relies on a color harmony model. This mode, built on Munsell hue, value, and chroma contrast, is used to divide the image database into clusters that can be individually searched. To test the efficacy of the algorithm, it is compared to existing algorithms developed by Niblack et al and Feldman et al. A second study that utilizes the image query system in a retail application is also described.

  18. Measuring persistence of implementation: QUERI Series.

    PubMed

    Bowman, Candice C; Sobo, Elisa J; Asch, Steven M; Gifford, Allen L

    2008-04-22

    As more quality improvement programs are implemented to achieve gains in performance, the need to evaluate their lasting effects has become increasingly evident. However, such long-term follow-up evaluations are scarce in healthcare implementation science, being largely relegated to the "need for further research" section of most project write-ups. This article explores the variety of conceptualizations of implementation sustainability, as well as behavioral and organizational factors that influence the maintenance of gains. It highlights the finer points of design considerations and draws on our own experiences with measuring sustainability, framed within the rich theoretical and empirical contributions of others. In addition, recommendations are made for designing sustainability analyses. This article is one in a Series of articles documenting implementation science frameworks and approaches developed by the U.S. Department of Veterans Affairs Quality Enhancement Research Initiative (QUERI).

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

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

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

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

  3. A Comparison of Two Methods for Boolean Query Relevancy Feedback.

    ERIC Educational Resources Information Center

    Salton, G.; And Others

    1984-01-01

    Evaluates and compares two recently proposed automatic methods for relevance feedback of Boolean queries (Dillon method, which uses probabilistic approach as basis, and disjunctive normal form method). Conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment. Nineteen references are included. (EJS)

  4. Topology-free querying of protein interaction networks.

    PubMed

    Bruckner, Sharon; Hüffner, Falk; Karp, Richard M; Shamir, Ron; Sharan, Roded

    2010-03-01

    In the network querying problem, one is given a protein complex or pathway of species A and a protein-protein interaction network of species B; the goal is to identify subnetworks of B that are similar to the query in terms of sequence, topology, or both. Existing approaches mostly depend on knowledge of the interaction topology of the query in the network of species A; however, in practice, this topology is often not known. To address this problem, we develop a topology-free querying algorithm, which we call Torque. Given a query, represented as a set of proteins, Torque seeks a matching set of proteins that are sequence-similar to the query proteins and span a connected region of the network, while allowing both insertions and deletions. The algorithm uses alternatively dynamic programming and integer linear programming for the search task. We test Torque with queries from yeast, fly, and human, where we compare it to the QNet topology-based approach, and with queries from less studied species, where only topology-free algorithms apply. Torque detects many more matches than QNet, while giving results that are highly functionally coherent.

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

  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. Locality in Search Engine Queries and Its Implications for Caching

    DTIC Science & Technology

    2001-05-01

    in the question of whether caching might be effective for search engines as well. They study two real search engine traces by examining query...locality and its implications for caching. The two search engines studied are Vivisimo and Excite. Their trace analysis results show that queries have

  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. Improving the Retrieval Effectiveness of Very Short Queries.

    ERIC Educational Resources Information Center

    Crouch, Carolyn J.; Crouch, Donald B.; Chen, Qingyan; Holtz, Steven J.

    2002-01-01

    Describes an automatic approach designed to improve the retrieval effectiveness of very short queries such as those used in Web searching based on the observation that stemming, which is designed to maximize recall, often results in depressed precision. Discusses pseudo-feedback and reranking documents based on unstemmed query terms in the…

  10. Mining the SDSS SkyServer SQL queries log

    NASA Astrophysics Data System (ADS)

    Hirota, Vitor M.; Santos, Rafael; Raddick, Jordan; Thakar, Ani

    2016-05-01

    SkyServer, the Internet portal for the Sloan Digital Sky Survey (SDSS) astronomic catalog, provides a set of tools that allows data access for astronomers and scientific education. One of SkyServer data access interfaces allows users to enter ad-hoc SQL statements to query the catalog. SkyServer also presents some template queries that can be used as basis for more complex queries. This interface has logged over 330 million queries submitted since 2001. It is expected that analysis of this data can be used to investigate usage patterns, identify potential new classes of queries, find similar queries, etc. and to shed some light on how users interact with the Sloan Digital Sky Survey data and how scientists have adopted the new paradigm of e-Science, which could in turn lead to enhancements on the user interfaces and experience in general. In this paper we review some approaches to SQL query mining, apply the traditional techniques used in the literature and present lessons learned, namely, that the general text mining approach for feature extraction and clustering does not seem to be adequate for this type of data, and, most importantly, we find that this type of analysis can result in very different queries being clustered together.

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

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

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

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

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

  16. Searching the Web: The Public and Their Queries.

    ERIC Educational Resources Information Center

    Spink, Amanda; Wolfram, Dietmar; Jansen, Major B. J.; Saracevic, Tefko

    2001-01-01

    Reports findings from a study of searching behavior by over 200,000 users of the Excite search engine. Analysis of over one million queries revealed most people use few search terms, few modified queries, view few Web pages, and rarely use advanced search features. Concludes that Web searching by the public differs significantly from searching of…

  17. Invariant Quantities in Shear Flow

    NASA Astrophysics Data System (ADS)

    Baule, A.; Evans, R. M. L.

    2008-12-01

    The dynamics of systems out of thermal equilibrium is usually treated on a case-by-case basis without knowledge of fundamental and universal principles. We address this problem for a class of driven steady states, namely, those mechanically driven at the boundaries such as complex fluids under shear. From a nonequilibrium counterpart to detailed balance (NCDB) we derive a remarkably simple set of invariant quantities which remain unchanged when the system is driven. These new nonequilibrium relations are both exact and valid arbitrarily far from equilibrium. Furthermore, they enable the systematic calculation of transition rates in driven systems with state spaces of arbitrary connectivity.

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

  19. Query log analysis of an electronic health record search engine.

    PubMed

    Yang, Lei; Mei, Qiaozhu; Zheng, Kai; Hanauer, David A

    2011-01-01

    We analyzed a longitudinal collection of query logs of a full-text search engine designed to facilitate information retrieval in electronic health records (EHR). The collection, 202,905 queries and 35,928 user sessions recorded over a course of 4 years, represents the information-seeking behavior of 533 medical professionals, including frontline practitioners, coding personnel, patient safety officers, and biomedical researchers for patient data stored in EHR systems. In this paper, we present descriptive statistics of the queries, a categorization of information needs manifested through the queries, as well as temporal patterns of the users' information-seeking behavior. The results suggest that information needs in medical domain are substantially more sophisticated than those that general-purpose web search engines need to accommodate. Therefore, we envision there exists a significant challenge, along with significant opportunities, to provide intelligent query recommendations to facilitate information retrieval in EHR.

  20. Automatic query mapping among genomic databases: a pilot exploration.

    PubMed Central

    Cheung, K. H.; Nadkarni, P.; Miller, P.; Shin, D. G.

    1998-01-01

    As databases in the human genome project proliferate, it is important for users of one genomic database to identify similar or inconsistent data in other autonomously developed genomic databases. To do so, the user needs to issue the same query across multiple databases. We describe an approach that allows a query issued against one database to be automatically mapped to an equivalent query against another structurally different database. Our approach features two components: 1) a database designed to capture knowledge (metadata) that describes the correspondences among individual database components and 2) a module that utilizes the metadata to perform query mappings. As a demonstration, we apply our query mapping approach to two chromosome map databases (DB/12 and GDB). Images Figure 2 Figure 3 PMID:9929357

  1. SPLICE: A program to assemble partial query solutions from three-dimensional database searches into novel ligands

    NASA Astrophysics Data System (ADS)

    Ho, Chris M. W.; Marshall, Garland R.

    1993-12-01

    SPLICE is a program that processes partial query solutions retrieved from 3D, structural databases to generate novel, aggregate ligands. It is designed to interface with the database searching program FOUNDATION, which retrieves fragments containing any combination of a user-specified minimum number of matching query elements. SPLICE eliminates aspects of structures that are physically incapable of binding within the active site. Then, a systematic rule-based procedure is performed upon the remaining fragments to ensure receptor complementarity. All modifications are automated and remain transparent to the user. Ligands are then assembled by linking components into composite structures through overlapping bonds. As a control experiment, FOUNDATION and SPLICE were used to reconstruct a know HIV-1 protease inhibitor after it had been fragmented, reoriented, and added to a sham database of fifty different small molecules. To illustrate the capabilities of this program, a 3D search query containing the pharmacophoric elements of an aspartic proteinase-inhibitor crystal complex was searched using FOUNDATION against a subset of the Cambridge Structural Database. One hundred thirty-one compounds were retrieved, each containing any combination of at least four query elements. Compounds were automatically screened and edited for receptor complementarity. Numerous combinations of fragments were discovered that could be linked to form novel structures, containing a greater number of pharmacophoric elements than any single retrieved fragment.

  2. Patient Encounters and Care Transitions in One Community Supported by Automated Query-Based Health Information Exchange

    PubMed Central

    Campion, Thomas R.; Vest, Joshua R.; Ancker, Jessica S.; Kaushal, Rainu

    2013-01-01

    Care transitions from one facility to another threaten patient safety due to the potential loss of critical clinical information. Electronic clinical data exchange may address the problem. Approaches to exchange range from manual directed exchange, or sending point-to-point messages, to automated query-based health information exchange (HIE), or aggregating data from multiple sources. In this study, we measured the extent to which automated query-based HIE supported patient encounters and care transitions in one community. During the 23-month study period, 41% (n=33,219) of affirmatively consented patients had at least one encounter supported by automated query-based HIE. Of these patients, 41% (n=13,685) visited two or more facilities and accounted for 68% of total encounters. Of total encounters, 28% (n=40,828) were care transitions from one facility to another. Findings suggest that automated query-based HIE may support care transitions with efficient information sharing and assist United States providers in achieving stage two of meaningful use. PMID:24551330

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

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

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

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

  7. Conserved nonlinear quantities in cosmology

    SciTech Connect

    Langlois, David; Vernizzi, Filippo

    2005-11-15

    We give a detailed and improved presentation of our recently proposed formalism for nonlinear perturbations in cosmology, based on a covariant and fully nonperturbative approach. We work, in particular, with a covector combining the gradients of the energy density and of the local number of e-folds to obtain a nonlinear generalization of the familiar linear uniform-density perturbation. We show that this covector obeys a remarkably simple conservation equation which is exact, fully nonlinear and valid at all scales. We relate explicitly our approach to the coordinate-based formalisms for linear perturbations and for second-order perturbations. We also consider other quantities, which are conserved on sufficiently large scales for adiabatic perturbations, and discuss the issue of gauge invariance.

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

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

  10. An Architecture for Handling Fuzzy Queries in Data Warehouses

    NASA Astrophysics Data System (ADS)

    Singh, Manu Pratap; Tiwari, Rajdev; Mahajan, Manish; Dani, Diksha

    This paper presents an augmented architecture of Data Warehouse for fuzzy query handling to improve the performance of Data Mining process. The performance of Data Mining may become worst while mining the fuzzy information from the large Data Warehouses. There are number of preprocessing steps suggested and implemented so far to support the mining process. But querying large Data warehouses for fuzzy information is still a challenging task for the researchers’ community. The model proposed here may provide a more realistic and powerful technique for handling the vague queries directly. The basic idea behind the creation of Data Warehouses is to integrate a large amount of pre-fetched data and information from the distributed sources for direct querying and analysis .But the end user’s queries contain the maximum fuzziness and to handle those queries directly may not yield the desired response. So the model proposed here will create a fuzzy extension of Data warehouse by applying Neuro-Fuzzy technique and the fuzzy queries then will get handled directly by the extension of data warehouse.

  11. Dynamics of proteins aggregation. I. Universal scaling in unbounded media

    NASA Astrophysics Data System (ADS)

    Zheng, Size; Javidpour, Leili; Shing, Katherine S.; Sahimi, Muhammad

    2016-10-01

    It is well understood that in some cases proteins do not fold correctly and, depending on their environment, even properly-folded proteins change their conformation spontaneously, taking on a misfolded state that leads to protein aggregation and formation of large aggregates. An important factor that contributes to the aggregation is the interactions between the misfolded proteins. Depending on the aggregation environment, the aggregates may take on various shapes forming larger structures, such as protein plaques that are often toxic. Their deposition in tissues is a major contributing factor to many neuro-degenerative diseases, such as Alzheimer's, Parkinson's, amyotrophic lateral sclerosis, and prion. This paper represents the first part in a series devoted to molecular simulation of protein aggregation. We use the PRIME, a meso-scale model of proteins, together with extensive discontinuous molecular dynamics simulation to study the aggregation process in an unbounded fluid system, as the first step toward MD simulation of the same phenomenon in crowded cellular environments. Various properties of the aggregates have been computed, including dynamic evolution of aggregate-size distribution, mean aggregate size, number of peptides that contribute to the formation of β sheets, number of various types of hydrogen bonds formed in the system, radius of gyration of the aggregates, and the aggregates' diffusivity. We show that many of such quantities follow dynamic scaling, similar to those for aggregation of colloidal clusters. In particular, at long times the mean aggregate size S(t) grows with time as, S(t) ˜ tz, where z is the dynamic exponent. To our knowledge, this is the first time that the qualitative similarity between aggregation of proteins and colloidal aggregates has been pointed out.

  12. On mean type aggregation.

    PubMed

    Yager, R R

    1996-01-01

    We introduce and define the concept of mean aggregation of a collection of n numbers. We point out that the lack of associativity of this operation compounds the problem of the extending mean of n numbers to n+1 numbers. The closely related concepts of self identity and the centering property are introduced as one imperative for extending mean aggregation operators. The problem of weighted mean aggregation is studied. A new concept of prioritized mean aggregation is then introduced. We next show that the technique of selecting an element based upon the performance of a random experiment can be considered as a mean aggregation operation.

  13. Autojoin: A Simple Rule Based Query Service for Complex Databases

    NASA Astrophysics Data System (ADS)

    Gaffney, N. I.; Gardner, L.; Brandt, M.

    Most databases used today are no longer flat. While the power of using these more complex data stores is well known, construction of queries can be quite a complex task. Currently this often requires detailed knowledge of the database structure and schema. As we move towards a VO paradigm, users cannot be expected to know the structure of databases, but will need to query them. Databases will need to provide query engines to complete queries automatically given only what the user wants to have returned and any qualifications they place on the query. For years StarView, a database query and data retrieval tool for the Space Telescope Science Institute, relied on a complex third party LISP-based program (QUICK) to construct valid SQL queries for the one database it could query. This limited our ability to support StarView as we could not easily add new rules to the system without completely rebuilding the query engine. Furthermore, QUICK did not have the ability to create SQL that would join tables in different databases (but hosted on the same server). Finally, the cost of upgrading to a new version of QUICK was prohibitively high. Our solution was to develop a rather simple database table driven Perl CGI program which is able to take as its input a skeleton SQL program. This may come from a program or other web page. In the query only the SELECT and user qualified WHERE clause are specified; no FROM or WHERE clause join information is included. The service then returns a fully qualified and syntactically correct query for the host database SQL program that can be used to get the information the user needs. Thus, an additional layer of abstraction for dealing with databases is created, freeing the user from having to know how tables are related in the database. In this paper we discuss the design and algorithm used to make Autojoin work as well as discuss how, when combined with a robust and searchable description of all the fields that can be publicly queried in

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

  15. Asymptotic conditions and conserved quantities

    SciTech Connect

    Koul, R.K.

    1990-01-01

    Two problems have been investigated in this dissertation. The first one deals with the relationship between stationary space-times which are flat at null infinity and stationary space-times which are asymptotic flat at space-like infinity. It is shown that the stationary space-times which are asymptotically flat, in the Penrose sense, at null infinity, are asymptotically flat at space-like infinity in the Geroch sense and metric at space like infinity is at least C{sup 1}. In the converse it is shown that the stationary space-times which are asymptotically flat at space like infinity, in the Beig sense, are asymptotically flat at null infinity in the Penrose sense. The second problem addressed deals with the theories of arbitrary dimensions. The theories treated are the ones which have fiber bundle structure, outside some compact region. For these theories the criterion for the choice of the background metric is specified, and the boundary condition for the initial data set (q{sub ab}, P{sup ab}) is given in terms of the background metric. Having these boundary conditions it is shown that the symplectic structure and the constraint functionals are well defined. The conserved quantities associated with internal Killing vector fields are specified. Lastly the energy relative to a fixed background and the total energy of the theory have been given. It is also shown that the total energy of the theory is independent of the choice of the background.

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

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

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

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

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

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

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

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

    PubMed

    Shen, Bo; Fu, Jun-Song

    2016-06-23

    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.

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

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

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

  7. Queries, Influencers and Vocational Interests of Junior High School Students

    ERIC Educational Resources Information Center

    Woal, S. Theodore

    1974-01-01

    The study, based on questionnaire results from 207 ninth grade students, investigates: student familiarity with occupations; influencers of their tentative occupational choices; post high school plans; and student queries and concerns pertinent to preparation for entry into a job. (MW)

  8. Superfund Chemical Data Matrix (SCDM) Query - April 2016

    EPA Pesticide Factsheets

    This site allows you to to easily query the Superfund Chemical Data Matrix (SCDM) and generate a list of the corresponding Hazardous Ranking System (HRS) factor values, benchmarks, and data elements that you need.

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

  10. Exploring the Query Expansion Methods for Concept Based Representation

    DTIC Science & Technology

    2014-11-01

    Exploring the Query Expansion Methods for Concept Based Representation Yue Wang and Hui Fang Department of Electrical and Computer Engineering...physicians find relevant medical cases for patients they are dealing with. Concept based representation has been shown to be effective in biomedical...in this paper, we explored two external resources to perform query expansion for the basic concept based representation method, and discussed the

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

  12. Design and Implementation of a Multimedia DBMS: Complex Query Processing

    DTIC Science & Technology

    1991-09-01

    IMPLEMENTATION OF A MULTIMEDIA DBMS: COMPLEX QUERY PROCESSING by Huseyin Aygun September 1991 Thesis Advisor Vincent Y. Lum Approved for public release...type "trace in <function name>. 31 IV. DESIGN OF COMPLEX QUERY PROCESSING In Chapter II of this thesis the general architecture of the MDBMS...data to display. More detailed information about the modification can be found in the next chapter of this thesis . Because the design for the process

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

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

  15. A New Publicly Available Chemical Query Language, CSRML ...

    EPA Pesticide Factsheets

    A new XML-based query language, CSRML, has been developed for representing chemical substructures, molecules, reaction rules, and reactions. CSRML queries are capable of integrating additional forms of information beyond the simple substructure (e.g., SMARTS) or reaction transformation (e.g., SMIRKS, reaction SMILES) queries currently in use. Chemotypes, a term used to represent advanced CSRML queries for repeated application can be encoded not only with connectivity and topology, but also with properties of atoms, bonds, electronic systems, or molecules. The CSRML language has been developed in parallel with a public set of chemotypes, i.e., the ToxPrint chemotypes, which are designed to provide excellent coverage of environmental, regulatory and commercial use chemical space, as well as to represent features and frameworks believed to be especially relevant to toxicity concerns. A software application, ChemoTyper, has also been developed and made publicly available to enable chemotype searching and fingerprinting against a target structure set. The public ChemoTyper houses the ToxPrint chemotype CSRML dictionary, as well as reference implementation so that the query specifications may be adopted by other chemical structure knowledge systems. The full specifications of the XML standard used in CSRML-based chemotypes are publicly available to facilitate and encourage the exchange of structural knowledge. Paper details specifications for a new XML-based query lan

  16. Generalized queries on probabilistic context-free grammars

    SciTech Connect

    Pynadath, D.V.; Wellman, M.P.

    1996-12-31

    Probabilistic context-free grammars (PCFGs) provide a simple way to represent a particular class of distributions over sentences in a context-free language. Efficient parsing algorithms for answering particular queries about a PCFG (i.e., calculating the probability of a given sentence, or finding the most likely parse) have been applied to a variety of pattern-recognition problems. We extend the class of queries that can be answered in several ways: (1) allowing missing tokens in a sentence or sentence fragment, (2) supporting queries about intermediate structure, such as the presence of particular nonterminals, and (3) flexible conditioning on a variety of types of evidence. Our method works by constructing a Bayesian network to represent the distribution of parse trees induced by a given PCFG. The network structure mirrors that of the chart in a standard parser, and is generated using a similar dynamic-programming approach. We present an algorithm for constructing Bayesian networks from PCFGs, and show how queries or patterns of queries on the network correspond to interesting queries on PCFGs.

  17. Materialized view selection based on query cost in data warehouse

    NASA Astrophysics Data System (ADS)

    Zhou, Lijuan; Liu, Chi; Liu, Daxin

    2004-04-01

    Selecting views to materialize impacts on the efficiency as well as the total cost of establishing and running a data warehouse. One of the most important decisions in designing a data warehouse is selection of right views to be materialized. This problem is to select a right set of views that minimizes total query response time and the cost of view maintenance under a storage space constraint. In this paper, according to our practical application, the factor that refrains us from materializing all views in the data warehouse is not the space constraint but query response time. For queries fast answers may be required. So we develop algorithms to select a set of views to materialize in data warehouse in order to minimize the total view maintenance time under the constraint of a given query response time. We call it query-cost view select problem. First, we design algorithms for query-cost view select problem, we give view node matrix in order to solve it. Second , we use experiments do demonstrate the power of our approach . The results show that our algorithm works better in practical cases. We implemented our algorithms and a performance study of the algorithms shows that the proposed algorithm delivers an optimal solution. Finally, we discuss the observed behavior of the algorithms. We also identify some important issues for future investigations.

  18. A spatial query scheduler in a distributed environment

    NASA Astrophysics Data System (ADS)

    Zhou, Chunhui; Zhu, Xinyan; Xia, Yu; Su, Kehua

    2008-10-01

    Geographic Information System (GIS) is moving towards distribution and sharing. Distributed Spatial Database Systems (DSDBS) has attracted the attention of many scholars. This paper introduces the prospects of Distributed GIS (DGIS), and describes the definition of DSDBS and the existing problems. The researches in related fields are analyzed, including the research results in the traditional distributed relational database fields, the distributed spatial database fields and the spatial query optimization aspect. Grid technologies are developing forward, and grid will be turned into the standard distributed computing platform, therefore the application of DSDBS will be much broader than ever. The present studies on distributed spatial query focus on spatial join optimization. Researches on query scheduling are rare. In the process of constructing our test system for distributed spatial query, we find there are some replication nodes after the step of data localization. These nodes cause redundant computing of query processing. This paper gives a method to solve it based on the Query Scheduling Tree Model (QSTM). It also gives a detailed scheduling algorithm, and analyzes the effectiveness of the model and the algorithm.

  19. Graph Structures and Algorithms for Query-Log Analysis

    NASA Astrophysics Data System (ADS)

    Donato, Debora

    Query logs are repositories that record all the interactions of users with a search engine. This incredibly rich user behavior data can be modeled using appropriate graph structures. In the recent years there has been an increasing amount of literature on studying properties, models, and algorithms for query-log graphs. Understanding the structure of such graphs, modeling user querying patterns, and designing algorithms for leveraging the latent knowledge (also known as the wisdom of the crowds) in those graphs introduces new challenges in the field of graph mining. The main goal of this paper is to present the reader with an example of these graph-structures, i.e., the Query-flow graph. This representation has been shown extremely effective for modeling user querying patterns and has been extensively used for developing real time applications. Moreover we present graph-based algorithmic solutions applied in the context of problems appearing in web applications as query recommendation and user-session segmentation.

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

  1. The DEDUCE Guided Query Tool: Providing Simplified Access to Clinical Data for Research and Quality Improvement

    PubMed Central

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

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

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

  3. The Hub Population Health System: distributed ad hoc queries and alerts.

    PubMed

    Buck, Michael D; Anane, Sheila; Taverna, John; Amirfar, Sam; Stubbs-Dame, Remle; Singer, Jesse

    2012-06-01

    The Hub Population Health System enables the creation and distribution of queries for aggregate count information, clinical decision support alerts at the point-of-care for patients who meet specified conditions, and secure messages sent directly to provider electronic health record (EHR) inboxes. Using a metronidazole medication recall, the New York City Department of Health was able to determine the number of affected patients and message providers, and distribute an alert to participating practices. As of September 2011, the system is live in 400 practices and within a year will have over 532 practices with 2500 providers, representing over 2.5 million New Yorkers. The Hub can help public health experts to evaluate population health and quality improvement activities throughout the ambulatory care network. Multiple EHR vendors are building these features in partnership with the department's regional extension center in anticipation of new meaningful use requirements.

  4. Data mining and intelligent queries in a knowledge-based multimedia medical database system

    NASA Astrophysics Data System (ADS)

    Zhang, Shuhua; Coleman, John D.

    2000-04-01

    Multimedia medical databases have accumulated large quantities of data and information about patients and their medical conditions. Patterns and relationships within this data could provide new knowledge for making better medical decisions. Unfortunately, few technologies have been developed and applied to discover and use this hidden knowledge. We are currently developing a next generation knowledge-based multimedia medical database, named MedBase, with advanced behaviors for data analysis and data fusion. As part of this R&D effort, a knowledge-rich data model is constructed to incorporate data mining techniques/tools to assist the building of medical knowledge bases, and to facilitate intelligent answering of users' investigative and knowledge queries in the database. Techniques such as data generalization, classification, clustering, semantic structures, and concept hierarchies, are used to acquire and represent both symbolic and spatial knowledge implicit in the database. With the availability of semantic structures, concept hierarchies and generalized knowledge, queries may be posed and answered at multiple levels of abstraction. In this article we provide a general description of the approaches and efforts undertaken so far in the MedBase project.

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

  6. Unbonded Aggregate Surface Roads

    DTIC Science & Technology

    2006-12-01

    are sufficiently angular and rough in texture, thus ensuring mixture stability. A popular asphalt mixture design method called Superpave Level 1...would not pass either of the Superpave aggregate requirements. Table 18 Additional Characteristics for the Fine Fraction Abbreviated Common Name...CBR values when compacted wet of optimum. This is likely attributable to their relatively high permeabilities . For soaked CBR tests, the aggregates

  7. Erosion of dust aggregates

    NASA Astrophysics Data System (ADS)

    Seizinger, A.; Krijt, S.; Kley, W.

    2013-12-01

    Aims: The aim of this work is to gain a deeper insight into how much different aggregate types are affected by erosion. Especially, it is important to study the influence of the velocity of the impacting projectiles. We also want to provide models for dust growth in protoplanetary disks with simple recipes to account for erosion effects. Methods: To study the erosion of dust aggregates we employed a molecular dynamics approach that features a detailed micro-physical model of the interaction of spherical grains. For the first time, the model has been extended by introducing a new visco-elastic damping force, which requires a proper calibration. Afterwards, different sample generation methods were used to cover a wide range of aggregate types. Results: The visco-elastic damping force introduced in this work turns out to be crucial to reproduce results obtained from laboratory experiments. After proper calibration, we find that erosion occurs for impact velocities of 5 ms-1 and above. Though fractal aggregates as formed during the first growth phase are most susceptible to erosion, we observe erosion of aggregates with rather compact surfaces as well. Conclusions: We find that bombarding a larger target aggregate with small projectiles results in erosion for impact velocities as low as a few ms-1. More compact aggregates suffer less from erosion. With increasing projectile size the transition from accretion to erosion is shifted to higher velocities. This allows larger bodies to grow through high velocity collisions with smaller aggregates.

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

    USGS Publications Warehouse

    Robinson,, Gilpin R.; 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. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE TOMATOES GROWN IN FLORIDA Order..., may establish, for any or all portions of the production area, minimum quantities below which...

  10. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... and Orders; Fruits, Vegetables, Nuts), DEPARTMENT OF AGRICULTURE TOMATOES GROWN IN FLORIDA Order..., may establish, for any or all portions of the production area, minimum quantities below which...

  11. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... AND ORDERS; FRUITS, VEGETABLES, NUTS), DEPARTMENT OF AGRICULTURE TOMATOES GROWN IN FLORIDA Order..., may establish, for any or all portions of the production area, minimum quantities below which...

  12. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... AND ORDERS; FRUITS, VEGETABLES, NUTS), DEPARTMENT OF AGRICULTURE TOMATOES GROWN IN FLORIDA Order..., may establish, for any or all portions of the production area, minimum quantities below which...

  13. Secure Nearest Neighbor Query on Crowd-Sensing Data

    PubMed Central

    Cheng, Ke; Wang, Liangmin; Zhong, Hong

    2016-01-01

    Nearest neighbor queries are fundamental in location-based services, and secure nearest neighbor queries mainly focus on how to securely and quickly retrieve the nearest neighbor in the outsourced cloud server. However, the previous big data system structure has changed because of the crowd-sensing data. On the one hand, sensing data terminals as the data owner are numerous and mistrustful, while, on the other hand, in most cases, the terminals find it difficult to finish many safety operation due to computation and storage capability constraints. In light of they Multi Owners and Multi Users (MOMU) situation in the crowd-sensing data cloud environment, this paper presents a secure nearest neighbor query scheme based on the proxy server architecture, which is constructed by protocols of secure two-party computation and secure Voronoi diagram algorithm. It not only preserves the data confidentiality and query privacy but also effectively resists the collusion between the cloud server and the data owners or users. Finally, extensive theoretical and experimental evaluations are presented to show that our proposed scheme achieves a superior balance between the security and query performance compared to other schemes. PMID:27669253

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

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

  16. Secure Nearest Neighbor Query on Crowd-Sensing Data.

    PubMed

    Cheng, Ke; Wang, Liangmin; Zhong, Hong

    2016-09-22

    Nearest neighbor queries are fundamental in location-based services, and secure nearest neighbor queries mainly focus on how to securely and quickly retrieve the nearest neighbor in the outsourced cloud server. However, the previous big data system structure has changed because of the crowd-sensing data. On the one hand, sensing data terminals as the data owner are numerous and mistrustful, while, on the other hand, in most cases, the terminals find it difficult to finish many safety operation due to computation and storage capability constraints. In light of they Multi Owners and Multi Users (MOMU) situation in the crowd-sensing data cloud environment, this paper presents a secure nearest neighbor query scheme based on the proxy server architecture, which is constructed by protocols of secure two-party computation and secure Voronoi diagram algorithm. It not only preserves the data confidentiality and query privacy but also effectively resists the collusion between the cloud server and the data owners or users. Finally, extensive theoretical and experimental evaluations are presented to show that our proposed scheme achieves a superior balance between the security and query performance compared to other schemes.

  17. Aggregated Indexing of Biomedical Time Series Data.

    PubMed

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

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

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

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

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

  1. Ontology and rules based model for traffic query

    NASA Astrophysics Data System (ADS)

    Cheng, Gang; Du, Qingyun; Huang, Qian; Zhao, Haiyun

    2008-10-01

    This paper will combine ontology and rule based qualitative reason with real time calculation, designing a combined traffic model of national scope which contains highway, railroad, water carriage, scheduled flight etc. That method follows the sense of people to space, establishes ontologies and rules knowledge base, using concepts, instances, relations and rules of traffic field as the basic knowledge for qualitative reason to discover implicit semantic information and eliminate unnecessary ambiguities. The knowledge from the ontologies and rules provides abundant information for query which can lighten the burden of computation, in the mean time, real-time calculation guarantees the accuracy of the data, has raised accuracy and efficiency of the query, which has strengthened the ease of query service and improved web users' experience.

  2. Regular paths in SparQL: querying the NCI Thesaurus.

    PubMed

    Detwiler, Landon T; Suciu, Dan; Brinkley, James F

    2008-11-06

    OWL, the Web Ontology Language, provides syntax and semantics for representing knowledge for the semantic web. Many of the constructs of OWL have a basis in the field of description logics. While the formal underpinnings of description logics have lead to a highly computable language, it has come at a cognitive cost. OWL ontologies are often unintuitive to readers lacking a strong logic background. In this work we describe GLEEN, a regular path expression library, which extends the RDF query language SparQL to support complex path expressions over OWL and other RDF-based ontologies. We illustrate the utility of GLEEN by showing how it can be used in a query-based approach to defining simpler, more intuitive views of OWL ontologies. In particular we show how relatively simple GLEEN-enhanced SparQL queries can create views of the OWL version of the NCI Thesaurus that match the views generated by the web-based NCI browser.

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

  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. Interactive ontology debugging: Two query strategies for efficient fault localization.

    PubMed

    Shchekotykhin, Kostyantyn; Friedrich, Gerhard; Fleiss, Philipp; Rodler, Patrick

    2012-04-01

    Effective debugging of ontologies is an important prerequisite for their broad application, especially in areas that rely on everyday users to create and maintain knowledge bases, such as the Semantic Web. In such systems ontologies capture formalized vocabularies of terms shared by its users. However in many cases users have different local views of the domain, i.e. of the context in which a given term is used. Inappropriate usage of terms together with natural complications when formulating and understanding logical descriptions may result in faulty ontologies. Recent ontology debugging approaches use diagnosis methods to identify causes of the faults. In most debugging scenarios these methods return many alternative diagnoses, thus placing the burden of fault localization on the user. This paper demonstrates how the target diagnosis can be identified by performing a sequence of observations, that is, by querying an oracle about entailments of the target ontology. To identify the best query we propose two query selection strategies: a simple "split-in-half" strategy and an entropy-based strategy. The latter allows knowledge about typical user errors to be exploited to minimize the number of queries. Our evaluation showed that the entropy-based method significantly reduces the number of required queries compared to the "split-in-half" approach. We experimented with different probability distributions of user errors and different qualities of the a priori probabilities. Our measurements demonstrated the superiority of entropy-based query selection even in cases where all fault probabilities are equal, i.e. where no information about typical user errors is available.

  6. Interactive ontology debugging: Two query strategies for efficient fault localization☆

    PubMed Central

    Shchekotykhin, Kostyantyn; Friedrich, Gerhard; Fleiss, Philipp; Rodler, Patrick

    2012-01-01

    Effective debugging of ontologies is an important prerequisite for their broad application, especially in areas that rely on everyday users to create and maintain knowledge bases, such as the Semantic Web. In such systems ontologies capture formalized vocabularies of terms shared by its users. However in many cases users have different local views of the domain, i.e. of the context in which a given term is used. Inappropriate usage of terms together with natural complications when formulating and understanding logical descriptions may result in faulty ontologies. Recent ontology debugging approaches use diagnosis methods to identify causes of the faults. In most debugging scenarios these methods return many alternative diagnoses, thus placing the burden of fault localization on the user. This paper demonstrates how the target diagnosis can be identified by performing a sequence of observations, that is, by querying an oracle about entailments of the target ontology. To identify the best query we propose two query selection strategies: a simple “split-in-half” strategy and an entropy-based strategy. The latter allows knowledge about typical user errors to be exploited to minimize the number of queries. Our evaluation showed that the entropy-based method significantly reduces the number of required queries compared to the “split-in-half” approach. We experimented with different probability distributions of user errors and different qualities of the a priori probabilities. Our measurements demonstrated the superiority of entropy-based query selection even in cases where all fault probabilities are equal, i.e. where no information about typical user errors is available. PMID:23543507

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

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

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

  10. Analysis of DNS cache effects on query distribution.

    PubMed

    Wang, Zheng

    2013-01-01

    This paper studies the DNS cache effects that occur on query distribution at the CN top-level domain (TLD) server. We first filter out the malformed DNS queries to purify the log data pollution according to six categories. A model for DNS resolution, more specifically DNS caching, is presented. We demonstrate the presence and magnitude of DNS cache effects and the cache sharing effects on the request distribution through analytic model and simulation. CN TLD log data results are provided and analyzed based on the cache model. The approximate TTL distribution for domain name is inferred quantificationally.

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

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

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

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

  15. Approximate ad-hoc query engine for simulation data

    SciTech Connect

    Abdulla, G; Baldwin, C; Critchlow, T; Kamimura, R; Lozares, I; Musick, R; Tang, N; Lee, B S; Snapp, R

    2001-02-01

    In this paper, we describe AQSim, an ongoing effort to design and implement a system to manage terabytes of scientific simulation data. The goal of this project is to reduce data storage requirements and access times while permitting ad-hoc queries using statistical and mathematical models of the data. In order to facilitate data exchange between models based on different representations, we are evaluating using the ASCI common data model which is comprised of several layers of increasing semantic complexity. To support queries over the spatial-temporal mesh structured data we are in the process of defining and implementing a grammar for MeshSQL.

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

  17. Semantic Annotations and Querying of Web Data Sources

    NASA Astrophysics Data System (ADS)

    Hornung, Thomas; May, Wolfgang

    A large part of the Web, actually holding a significant portion of the useful information throughout the Web, consists of views on hidden databases, provided by numerous heterogeneous interfaces that are partly human-oriented via Web forms ("Deep Web"), and partly based on Web Services (only machine accessible). In this paper we present an approach for annotating these sources in a way that makes them citizens of the Semantic Web. We illustrate how queries can be stated in terms of the ontology, and how the annotations are used to selected and access appropriate sources and to answer the queries.

  18. Analysis of DNS Cache Effects on Query Distribution

    PubMed Central

    2013-01-01

    This paper studies the DNS cache effects that occur on query distribution at the CN top-level domain (TLD) server. We first filter out the malformed DNS queries to purify the log data pollution according to six categories. A model for DNS resolution, more specifically DNS caching, is presented. We demonstrate the presence and magnitude of DNS cache effects and the cache sharing effects on the request distribution through analytic model and simulation. CN TLD log data results are provided and analyzed based on the cache model. The approximate TTL distribution for domain name is inferred quantificationally. PMID:24396313

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

  20. Marine aggregate dynamics

    NASA Astrophysics Data System (ADS)

    The direction and scope of the Office of Naval Research's Marine Aggregate Dynamics Accelerated Research Initiative will be the topic of an open-house style meeting February 14, 7:30-10:00 P.M. in Ballroom D of the Hyatt Regency New Orleans at the Louisiana Superdome. This meeting is scheduled during the AGU/American Society of Limnology and Oceanography Ocean Sciences Meeting February 12-16 in New Orleans.The critical focus of the ARI is the measurement and modeling of the dynamics of the biological, physical, chemical and molecular processes that drive aggregation and produce aggregates. This new ARI will provide funding in Fiscal Years 1991-1995 to identify and quantify mechanisms that determine the distribution, abundance and size spectrum of aggregated particulate matter in the ocean.

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

  2. Aggregation and Averaging.

    ERIC Educational Resources Information Center

    Siegel, Irving H.

    The arithmetic processes of aggregation and averaging are basic to quantitative investigations of employment, unemployment, and related concepts. In explaining these concepts, this report stresses need for accuracy and consistency in measurements, and describes tools for analyzing alternative measures. (BH)

  3. Skyline Query Processing in Sensor Network Based on Data Centric Storage

    PubMed Central

    Song, Seokil; Kwak, Yunsik; Lee, Seokhee

    2011-01-01

    Data centric storages for sensor networks have been proposed to efficiently process multi-dimensional range queries as well as exact matches. Usually, a sensor network does not process only one type of the query, but processes various types of queries such as range queries, exact matches and skyline queries. Therefore, a sensor network based on a data centric storage for range queries and exact matches should process skyline queries efficiently. However, existing algorithms for skyline queries have not considered the features of data centric storages. Some of the data centric storages store similar data in sensor nodes that are placed on geographically similar locations. Consequently, all data are ordered in a sensor network. In this paper, we propose a new skyline query processing algorithm that exploits the above features of data centric storages. PMID:22346642

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

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

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... variations. 500.25 Section 500.25 Commercial Practices FEDERAL TRADE COMMISSION RULES, REGULATIONS, STATEMENT..., permitted variations. (a) The statement of net quantity of contents shall accurately reveal the quantity of... instructions for use are followed. The propellant is included in the net quantity statement. (b)...

  6. Frequency, Quantity, and Quantity X Frequency as Indicators of College Student Drinking Problems.

    ERIC Educational Resources Information Center

    Johnson, Patrick B.

    1991-01-01

    Compared relative efficacy of three drinking indices (quantity, frequency, quantity x frequency) in predicting presence of drinking problems in college students (n=55 males; 64 females). Although drinking frequency was as good a predictor as quantity x frequency for predicting such problems in males, it was best predictor of female drinking…

  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. Querying and computing with BioCyc databases.

    PubMed

    Krummenacker, Markus; Paley, Suzanne; Mueller, Lukas; Yan, Thomas; Karp, Peter D

    2005-08-15

    We describe multiple methods for accessing and querying the complex and integrated cellular data in the BioCyc family of databases: access through multiple file formats, access through Application Program Interfaces (APIs) for LISP, Perl and Java, and SQL access through the BioWarehouse relational database.

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

  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. Boolean Queries and Term Dependencies in Probabilistic Retrieval Models.

    ERIC Educational Resources Information Center

    Croft, W. Bruce

    1986-01-01

    Proposes approach to integrating Boolean and statistical systems where Boolean queries are interpreted as a means of specifying term dependencies in relevant set of documents. Highlights include series of retrieval experiments designed to test retrieval strategy based on term dependence model and relation of results to other work. (18 references)…

  12. Four queries concerning the metaphysics of early human embryogenesis.

    PubMed

    Howsepian, A A

    2008-04-01

    In this essay, I attempt to provide answers to the following four queries concerning the metaphysics of early human embryogenesis. (1) Following its first cellular fission, is it coherent to claim that one and only one of two "blastomeric" twins of a human zygote is identical with that zygote? (2) Following the fusion of two human pre-embryos, is it coherent to claim that one and only one pre-fusion pre-embryo is identical with that postfusion pre-embryo? (3) Does a live human being come into existence only when its brain comes into existence? (4) At implantation, does a pre-embryo become a mere part of its mother? I argue that either if things have quidditative properties or if criterialism is false, then queries (1) and (2) can be answered in the affirmative; that in light of recent developments in theories of human death and in light of a more "functional" theory of brains, query (3) can be answered in the negative; and that plausible mereological principles require a negative answer to query (4).

  13. Ad-Hoc Queries over Document Collections - A Case Study

    NASA Astrophysics Data System (ADS)

    Löser, Alexander; Lutter, Steffen; Düssel, Patrick; Markl, Volker

    We discuss the novel problem of supporting analytical business intelligence queries over web-based textual content, e.g., BI-style reports based on 100.000's of documents from an ad-hoc web search result. Neither conventional search engines nor conventional Business Intelligence and ETL tools address this problem, which lies at the intersection of their capabilities. "Google Squared" or our system GOOLAP.info, are examples of these kinds of systems. They execute information extraction methods over one or several document collections at query time and integrate extracted records into a common view or tabular structure. Frequent extraction and object resolution failures cause incomplete records which could not be joined into a record answering the query. Our focus is the identification of join-reordering heuristics maximizing the size of complete records answering a structured query. With respect to given costs for document extraction we propose two novel join-operations: The multi-way CJ-operator joins records from multiple relationships extracted from a single document. The two-way join-operator DJ ensures data density by removing incomplete records from results. In a preliminary case study we observe that our join-reordering heuristics positively impact result size, record density and lower execution costs.

  14. VQLM: A visual query language for macromolecular structural databases

    SciTech Connect

    Cohen, D.; Dickinson, B.; Salem, H.

    1994-12-31

    Databases of macromolecular structures allow researchers to identify general principles of molecular behavior. They do this by providing a variety of data obtained under a number of different experimental conditions. Many new tools have been developed recently to aid in exploratory analysis of structural data. However, some queries of interest still require considerable manual filtering of data. In particular, studies attempting to make generalizations about complex arrangements of atoms or building blocks in macro-molecular structures cannot be approached directly with existing tools. Such studies are frequently carried out on only a few structures or else require a labor-intensive process. To address this problem, we have developed a visual language, VQLM (Visual Query Language for Macromolecules). A query is formulated in this language by drawing an abstract picture of sub-structures to be searched for in the database and specifying constraints on the objects in them. To illustrate the usefulness of our language, we show how to encode a number of queries that were found scientifically interesting in the published literature in molecular biology. VQLM relies on VQL, a new database language, as its underlying engine for database retrieval and computation. We believe that VQLM will make macromolecular structural data more accessible to scientists, enabling faster and deeper data analysis.

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

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

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

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

  19. FTree query construction for virtual screening: a statistical analysis

    NASA Astrophysics Data System (ADS)

    Gerlach, Christof; Broughton, Howard; Zaliani, Andrea

    2008-02-01

    FTrees (FT) is a known chemoinformatic tool able to condense molecular descriptions into a graph object and to search for actives in large databases using graph similarity. The query graph is classically derived from a known active molecule, or a set of actives, for which a similar compound has to be found. Recently, FT similarity has been extended to fragment space, widening its capabilities. If a user were able to build a knowledge-based FT query from information other than a known active structure, the similarity search could be combined with other, normally separate, fields like de-novo design or pharmacophore searches. With this aim in mind, we performed a comprehensive analysis of several databases in terms of FT description and provide a basic statistical analysis of the FT spaces so far at hand. Vendors' catalogue collections and MDDR as a source of potential or known "actives", respectively, have been used. With the results reported herein, a set of ranges, mean values and standard deviations for several query parameters are presented in order to set a reference guide for the users. Applications on how to use this information in FT query building are also provided, using a newly built 3D-pharmacophore from 57 5HT-1F agonists and a published one which was used for virtual screening for tRNA-guanine transglycosylase (TGT) inhibitors.

  20. Query-Dependent Banding (QDB) for Faster RNA Similarity Searches

    PubMed Central

    Nawrocki, Eric P; Eddy, Sean R

    2007-01-01

    When searching sequence databases for RNAs, it is desirable to score both primary sequence and RNA secondary structure similarity. Covariance models (CMs) are probabilistic models well-suited for RNA similarity search applications. However, the computational complexity of CM dynamic programming alignment algorithms has limited their practical application. Here we describe an acceleration method called query-dependent banding (QDB), which uses the probabilistic query CM to precalculate regions of the dynamic programming lattice that have negligible probability, independently of the target database. We have implemented QDB in the freely available Infernal software package. QDB reduces the average case time complexity of CM alignment from LN 2.4 to LN 1.3 for a query RNA of N residues and a target database of L residues, resulting in a 4-fold speedup for typical RNA queries. Combined with other improvements to Infernal, including informative mixture Dirichlet priors on model parameters, benchmarks also show increased sensitivity and specificity resulting from improved parameterization. PMID:17397253

  1. Using clinicians' search query data to monitor influenza epidemics.

    PubMed

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

    2014-11-15

    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.

  2. Are Quantity-Distances Narrowing in?

    DTIC Science & Technology

    2010-07-01

    REPORT TYPE N/A 3 . DATES COVERED - 4. TITLE AND SUBTITLE Are Quantity-Distances Narrowing in? 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c...adopt AASTP-1 and AASTP-5 for ammunition storage /1/, /2 /. Quantity-Distance History The history of QD goes far back, see e.g. / 3 /, /4/, /5...6 3 /. Reference / / quotes /7 /: “Act for preventing the Mischiefs which may happen by keeping too great Quantities of gunpowder in or near

  3. Learning of Elementary Formal Systems with Two Clauses Using Queries

    NASA Astrophysics Data System (ADS)

    Kato, Hirotaka; Matsumoto, Satoshi; Miyahara, Tetsuhiro

    An elementary formal system, EFS for short, is a kind of logic program over strings, and regarded as a set of rules to generate a language. For an EFS Γ, the language L(Γ) denotes the set of all strings generated by Γ. We consider a new form of EFS, called a restricted two-clause EFS, and denote by r{\\\\cal EF\\\\!S} the set of all restricted two-clause EFSs. Then we study the learnability of r{\\\\cal EF\\\\!S} in the exact learning model. The class r{\\\\cal EF\\\\!S} contains the class of regular patterns, which is extensively studied in Learning Theory. Let Γ* be a target EFS in r{\\\\cal EF\\\\!S} of learning. In the exact learning model, an oracle for superset queries answers “yes” for an input EFS Γ in r{\\\\cal EF\\\\!S} if L(Γ) is a superset of L(Γ*), and outputs a string in L(Γ*) - L(Γ), otherwise. An oracle for membership queries answers “yes” for an input string w if w is included in L(Γ*), and answers “no”, otherwise. We show that any EFS in r{\\\\cal EF\\\\!S} is exactly identifiable in polynomial time using membership and superset queries. Moreover, for other types of queries, we show that there exists no polynomial time learning algorithm for r{\\\\cal EF\\\\!S} by using the queries. This result indicates the hardness of learning the class r{\\\\cal EF\\\\!S} in the exact learning model, in general.

  4. Boolean versus ranked querying for biomedical systematic reviews

    PubMed Central

    2010-01-01

    Background The process of constructing a systematic review, a document that compiles the published evidence pertaining to a specified medical topic, is intensely time-consuming, often taking a team of researchers over a year, with the identification of relevant published research comprising a substantial portion of the effort. The standard paradigm for this information-seeking task is to use Boolean search; however, this leaves the user(s) the requirement of examining every returned result. Further, our experience is that effective Boolean queries for this specific task are extremely difficult to formulate and typically require multiple iterations of refinement before being finalized. Methods We explore the effectiveness of using ranked retrieval as compared to Boolean querying for the purpose of constructing a systematic review. We conduct a series of experiments involving ranked retrieval, using queries defined methodologically, in an effort to understand the practicalities of incorporating ranked retrieval into the systematic search task. Results Our results show that ranked retrieval by itself is not viable for this search task requiring high recall. However, we describe a refinement of the standard Boolean search process and show that ranking within a Boolean result set can improve the overall search performance by providing early indication of the quality of the results, thereby speeding up the iterative query-refinement process. Conclusions Outcomes of experiments suggest that an interactive query-development process using a hybrid ranked and Boolean retrieval system has the potential for significant time-savings over the current search process in the systematic reviewing. PMID:20937152

  5. Fibronectin Aggregation and Assembly

    PubMed Central

    Ohashi, Tomoo; Erickson, Harold P.

    2011-01-01

    The mechanism of fibronectin (FN) assembly and the self-association sites are still unclear and contradictory, although the N-terminal 70-kDa region (I1–9) is commonly accepted as one of the assembly sites. We previously found that I1–9 binds to superfibronectin, which is an artificial FN aggregate induced by anastellin. In the present study, we found that I1–9 bound to the aggregate formed by anastellin and a small FN fragment, III1–2. An engineered disulfide bond in III2, which stabilizes folding, inhibited aggregation, but a disulfide bond in III1 did not. A gelatin precipitation assay showed that I1–9 did not interact with anastellin, III1, III2, III1–2, or several III1–2 mutants including III1–2KADA. (In contrast to previous studies, we found that the III1–2KADA mutant was identical in conformation to wild-type III1–2.) Because I1–9 only bound to the aggregate and the unfolding of III2 played a role in aggregation, we generated a III2 domain that was destabilized by deletion of the G strand. This mutant bound I1–9 as shown by the gelatin precipitation assay and fluorescence resonance energy transfer analysis, and it inhibited FN matrix assembly when added to cell culture. Next, we introduced disulfide mutations into full-length FN. Three disulfide locks in III2, III3, and III11 were required to dramatically reduce anastellin-induced aggregation. When we tested the disulfide mutants in cell culture, only the disulfide bond in III2 reduced the FN matrix. These results suggest that the unfolding of III2 is one of the key factors for FN aggregation and assembly. PMID:21949131

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

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

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

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

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

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

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

  13. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... where coal is being cut, mined, drilled for blasting, or loaded. When a greater quantity is necessary to... district manager and specified in the ventilation plan: (1) Self-propelled equipment meeting...

  14. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... where coal is being cut, mined, drilled for blasting, or loaded. When a greater quantity is necessary to... district manager and specified in the ventilation plan: (1) Self-propelled equipment meeting...

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

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

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

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

  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. Interactive Querying over Large Network Data: Scalability, Visualization, and Interaction Design.

    PubMed

    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.

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

  2. Efficient Content-based Image Retrieval using Support Vector Machines for Feature Aggregation

    NASA Astrophysics Data System (ADS)

    Dimitrovski, Ivica; Loskovska, Suzana; Chorbev, Ivan

    In this paper, a content-based image retrieval system for aggregation and combination of different image features is presented. Feature aggregation is important technique in general content-based image retrieval systems that employ multiple visual features to characterize image content. We introduced and evaluated linear combination and support vector machines to fuse the different image features. The implemented system has several advantages over the existing content-based image retrieval systems. Several implemented features included in our system allow the user to adapt the system to the query image. The SVM-based approach for ranking retrieval results helps processing specific queries for which users do not have knowledge about any suitable descriptors.

  3. End-User Use of Data Base Query Language: Pros and Cons.

    ERIC Educational Resources Information Center

    Nicholes, Walter

    1988-01-01

    Man-machine interface, the concept of a computer "query," a review of database technology, and a description of the use of query languages at Brigham Young University are discussed. The pros and cons of end-user use of database query languages are explored. (Author/MLW)

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

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

  6. SQL level global query resolving for web based GIS

    NASA Astrophysics Data System (ADS)

    Chen, Bin; Huang, Fengru; Huang, Zhou; Sun, Yumei; Fang, Yu

    2007-06-01

    This paper introduced a SQL level approach to resolve global spatial query in Web based heterogeneous distributed spatial database environment. The main prohibit of this SQL level approach was its widespread compatibility and standardization. Firstly, a SQL based Equivalent Distributed Program (EDP) was introduced to express distributed spatial processing transactions. Then global resource directories for virtual global view describing were discussed to organize information that resolving need. The contents of global resource directories included data storage directory, hosts directory and working status directory. With these mechanisms, relational algebra expression equivalence principles were utilized to resolve global spatial queries to EDPs. Finally, several samples were presented to show the process of resolving. This approach was suitable to all sorts of distributed computing environments either centralized such as CORBA or decentralized such as P2P computing platforms.

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

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

  9. Data modeling and query processing for distributed surveillance systems

    NASA Astrophysics Data System (ADS)

    Nam, Yunyoung; Hong, Sangjin; Rho, Seungmin

    2013-12-01

    This paper presents data modeling and query processing for distributed surveillance systems. We define a metadata rule to search and manage information for distributed or heterogeneous surveillance systems. For human activity recognition, we propose a method that classifies these actions separately from complicated activities as a sequence of basic activities. In addition, we define the domain and range of relations based on the relationship between elements. Furthermore, we describe the state descriptors to represent an image sequence. To address the interaction of multiple objects, we classify human actions into symmetric or asymmetric actions. The prior motion model and the inference approach are applied adaptively according to environments. We define the grammar for the representation of the surveillance video and specify different query criteria for surveillance video retrieval. In the experiments, we show the prototype system that provides event detection, object identification, object tracking, face recognition, and activity recognition.

  10. Inductive Queries for a Drug Designing Robot Scientist

    NASA Astrophysics Data System (ADS)

    King, Ross D.; Schierz, Amanda; Clare, Amanda; Rowland, Jem; Sparkes, Andrew; Nijssen, Siegfried; Ramon, Jan

    It is increasingly clear that machine learning algorithms need to be integrated in an iterative scientific discovery loop, in which data is queried repeatedly by means of inductive queries and where the computer provides guidance to the experiments that are being performed. In this chapter, we summarise several key challenges in achieving this integration of machine learning and data mining algorithms in methods for the discovery of Quantitative Structure Activity Relationships (QSARs). We introduce the concept of a robot scientist, in which all steps of the discovery process are automated; we discuss the representation of molecular data such that knowledge discovery tools can analyse it, and we discuss the adaptation of machine learning and data mining algorithms to guide QSAR experiments.

  11. Path planning by querying persistent stores of trajectory segments

    NASA Technical Reports Server (NTRS)

    Grossman, Robert L.; Mehta, S.; Qin, Xiao

    1993-01-01

    We introduce an algorithm for path planning (long duration) paths of dynamical systems, given a persistent object store containing suitable collections of short duration trajectory segments. We also describe experimental results from a proof-of-concept implementation of the algorithm. The basic idea is to interpret a path planning algorithm as a suitable query on a persistent object store consisting of short duration trajectory segments. The query returns a concatenation of short duration trajectory segments which is close to the desired path. The needed short duration segments are computed by using a divide and conquer algorithm to break up the original path into shorter paths; each shorter path is then matched to a nearby trajectory segment which is part of the persistent object store by using a suitable index function.

  12. Managing and Querying Image Annotation and Markup in XML.

    PubMed

    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.

  13. Unraveling the Early Events of Amyloid-β Protein (Aβ) Aggregation: Techniques for the Determination of Aβ Aggregate Size

    PubMed Central

    Pryor, N. Elizabeth; Moss, Melissa A.; Hestekin, Christa N.

    2012-01-01

    The aggregation of proteins into insoluble amyloid fibrils coincides with the onset of numerous diseases. An array of techniques is available to study the different stages of the amyloid aggregation process. Recently, emphasis has been placed upon the analysis of oligomeric amyloid species, which have been hypothesized to play a key role in disease progression. This paper reviews techniques utilized to study aggregation of the amyloid-β protein (Aβ) associated with Alzheimer’s disease. In particular, the review focuses on techniques that provide information about the size or quantity of oligomeric Aβ species formed during the early stages of aggregation, including native-PAGE, SDS-PAGE, Western blotting, capillary electrophoresis, mass spectrometry, fluorescence correlation spectroscopy, light scattering, size exclusion chromatography, centrifugation, enzyme-linked immunosorbent assay, and dot blotting. PMID:22489141

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

  15. On-Line Patient Information System with Query

    PubMed Central

    Hayeck, Elie G.; Berman, William J.; Anné, Antharvedi

    1979-01-01

    Background, current state and future plans for the University of Virginia Biomedical Engineering Division Patient Information System are given. System design is highlighted. When fully implemented, the system will make extensive use of “block transmission,” made for user-computer interaction, for data input, retrieval, and update. Other features will include the possibility of multiple primary keys per patient, frequency distribution, on-line patient query (i.e., search on secondary keys), and general printouts.

  16. Evaluating the Quality of Query Refinement Suggestions in Information Retrieval

    DTIC Science & Technology

    2006-01-01

    However, evaluating the effec- tiveness of these suggestions has remained quite subjective, with a vast majority of the past work relying on expensive...addressing the polysemy problem while QR suggestions can ef- fectively address both the problems. For example, query expansion may be able to retrieve...However, these evaluation measures can be quite expensive since it involves user interaction. Another work on evaluation that has similar objectives to the

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

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

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

  20. A generalized definition of dosimetric quantities.

    PubMed

    Kellerer, A M; Rossi, H H

    1990-04-01

    The current definitions of microdosimetric and dosimetric quantities use the notion of 'ionizing radiation'. However, this notion is not rigorously defined, and its definition would require the somewhat arbitrary choice of specified energy cut-off values for different types of particles. Instead of choosing fixed cut-off values one can extend the system of definitions by admitting the free selection of a category of types and energies of particles that are taken to be part of the field. In this way one extends the system of dosimetric quantities. Kerma and absorbed dose appear then as special cases of a more general dosimetric quantity, and an analogue to kerma can be obtained for charged particle fields; it is termed cema. A modification that is suitable for electron fields is termed reduced cema.

  1. Using Genome Query Language to uncover genetic variation

    PubMed Central

    Kozanitis, Christos; Heiberg, Andrew; Varghese, George; Bafna, Vineet

    2014-01-01

    Motivation: With high-throughput DNA sequencing costs dropping <$1000 for human genomes, data storage, retrieval and analysis are the major bottlenecks in biological studies. To address the large-data challenges, we advocate a clean separation between the evidence collection and the inference in variant calling. We define and implement a Genome Query Language (GQL) that allows for the rapid collection of evidence needed for calling variants. Results: We provide a number of cases to showcase the use of GQL for complex evidence collection, such as the evidence for large structural variations. Specifically, typical GQL queries can be written in 5–10 lines of high-level code and search large datasets (100 GB) in minutes. We also demonstrate its complementarity with other variant calling tools. Popular variant calling tools can achieve one order of magnitude speed-up by using GQL to retrieve evidence. Finally, we show how GQL can be used to query and compare multiple datasets. By separating the evidence and inference for variant calling, it frees all variant detection tools from the data intensive evidence collection and focuses on statistical inference. Availability: GQL can be downloaded from http://cseweb.ucsd.edu/~ckozanit/gql. Contact: ckozanit@ucsd.edu or vbafna@cs.ucsd.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:23751181

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

  3. Bio-TDS: bioscience query tool discovery system.

    PubMed

    Gnimpieba, Etienne Z; VanDiermen, Menno S; Gustafson, Shayla M; Conn, Bill; Lushbough, Carol M

    2017-01-04

    Bioinformatics and computational biology play a critical role in bioscience and biomedical research. As researchers design their experimental projects, one major challenge is to find the most relevant bioinformatics toolkits that will lead to new knowledge discovery from their data. The Bio-TDS (Bioscience Query Tool Discovery Systems, http://biotds.org/) has been developed to assist researchers in retrieving the most applicable analytic tools by allowing them to formulate their questions as free text. The Bio-TDS is a flexible retrieval system that affords users from multiple bioscience domains (e.g. genomic, proteomic, bio-imaging) the ability to query over 12 000 analytic tool descriptions integrated from well-established, community repositories. One of the primary components of the Bio-TDS is the ontology and natural language processing workflow for annotation, curation, query processing, and evaluation. The Bio-TDS's scientific impact was evaluated using sample questions posed by researchers retrieved from Biostars, a site focusing on BIOLOGICAL DATA ANALYSIS: The Bio-TDS was compared to five similar bioscience analytic tool retrieval systems with the Bio-TDS outperforming the others in terms of relevance and completeness. The Bio-TDS offers researchers the capacity to associate their bioscience question with the most relevant computational toolsets required for the data analysis in their knowledge discovery process.

  4. Private and Efficient Query Processing on Outsourced Genomic Databases.

    PubMed

    Ghasemi, Reza; Aziz, Md Momin Al; Mohammed, Noman; Dehkordi, Massoud Hadian; Jiang, Xiaoqian

    2016-11-04

    Applications of genomic studies are spreading rapidly in many domains of science and technology such as healthcare, biomedical research, direct-to-consumer services, and legal and forensic. However, there are a number of obstacles that make it hard to access and process a big genomic database for these applications. First, sequencing genomic sequence is a timeconsuming and expensive process. Second, it requires large-scale computation and storage systems to processes genomic sequences. Third, genomic databases are often owned by different organizations and thus not available for public usage. Cloud computing paradigm can be leveraged to facilitate the creation and sharing of big genomic databases for these applications. Genomic data owners can outsource their databases in a centralized cloud server to ease the access of their databases. However, data owners are reluctant to adopt this model, as it requires outsourcing the data to an untrusted cloud service provider that may cause data breaches. In this paper, we propose a privacy-preserving model for outsourcing genomic data to a cloud. The proposed model enables query processing while providing privacy protection of genomic databases. Privacy of the individuals is guaranteed by permuting and adding fake genomic records in the database. These techniques allow cloud to evaluate count and top-k queries securely and efficiently. Experimental results demonstrate that a count and a top-k query over 40 SNPs in a database of 20,000 records takes around 100 and 150 seconds, respectively.

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

  6. Bio-TDS: bioscience query tool discovery system

    PubMed Central

    Gnimpieba, Etienne Z.; VanDiermen, Menno S.; Gustafson, Shayla M.; Conn, Bill; Lushbough, Carol M.

    2017-01-01

    Bioinformatics and computational biology play a critical role in bioscience and biomedical research. As researchers design their experimental projects, one major challenge is to find the most relevant bioinformatics toolkits that will lead to new knowledge discovery from their data. The Bio-TDS (Bioscience Query Tool Discovery Systems, http://biotds.org/) has been developed to assist researchers in retrieving the most applicable analytic tools by allowing them to formulate their questions as free text. The Bio-TDS is a flexible retrieval system that affords users from multiple bioscience domains (e.g. genomic, proteomic, bio-imaging) the ability to query over 12 000 analytic tool descriptions integrated from well-established, community repositories. One of the primary components of the Bio-TDS is the ontology and natural language processing workflow for annotation, curation, query processing, and evaluation. The Bio-TDS's scientific impact was evaluated using sample questions posed by researchers retrieved from Biostars, a site focusing on biological data analysis. The Bio-TDS was compared to five similar bioscience analytic tool retrieval systems with the Bio-TDS outperforming the others in terms of relevance and completeness. The Bio-TDS offers researchers the capacity to associate their bioscience question with the most relevant computational toolsets required for the data analysis in their knowledge discovery process. PMID:27924016

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

  8. An overview of aggregate resources in the United States

    USGS Publications Warehouse

    Langer, William H.; Scott, P.W.; Bristow, C.M.

    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.

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

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

  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

    ... 16 Commercial Practices 1 2010-01-01 2010-01-01 false Conversion of SI metric quantities to inch/pound quantities and inch/pound quantities to SI metric quantities. 500.19 Section 500.19 Commercial Practices FEDERAL TRADE COMMISSION RULES, REGULATIONS, STATEMENT OF GENERAL POLICY OR INTERPRETATION AND EXEMPTIONS UNDER THE FAIR PACKAGING...

  12. 49 CFR 172.315 - Limited quantities.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 49 Transportation 2 2014-10-01 2014-10-01 false Limited quantities. 172.315 Section 172.315 Transportation Other Regulations Relating to Transportation PIPELINE AND HAZARDOUS MATERIALS SAFETY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION HAZARDOUS MATERIALS REGULATIONS HAZARDOUS MATERIALS TABLE,...

  13. 49 CFR 172.315 - Limited quantities.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 49 Transportation 2 2013-10-01 2013-10-01 false Limited quantities. 172.315 Section 172.315 Transportation Other Regulations Relating to Transportation PIPELINE AND HAZARDOUS MATERIALS SAFETY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION HAZARDOUS MATERIALS REGULATIONS HAZARDOUS MATERIALS TABLE,...

  14. 49 CFR 172.315 - Limited quantities.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 49 Transportation 2 2011-10-01 2011-10-01 false Limited quantities. 172.315 Section 172.315 Transportation Other Regulations Relating to Transportation PIPELINE AND HAZARDOUS MATERIALS SAFETY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION HAZARDOUS MATERIALS REGULATIONS HAZARDOUS MATERIALS TABLE,...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    PubMed

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

    2016-03-29

    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.

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

  11. Tracking protein aggregate interactions

    PubMed Central

    Bartz, Jason C; Nilsson, K Peter R

    2011-01-01

    Amyloid fibrils share a structural motif consisting of highly ordered β-sheets aligned perpendicular to the fibril axis.1, 2 At each fibril end, β-sheets provide a template for recruiting and converting monomers.3 Different amyloid fibrils often co-occur in the same individual, yet whether a protein aggregate aids or inhibits the assembly of a heterologous protein is unclear. In prion disease, diverse prion aggregate structures, known as strains, are thought to be the basis of disparate disease phenotypes in the same species expressing identical prion protein sequences.4–7 Here we explore the interactions reported to occur when two distinct prion strains occur together in the central nervous system. PMID:21597336

  12. Zooplankton Aggregations Near Sills

    DTIC Science & Technology

    2003-09-30

    frequency echo-sounder system. This data were supplemented with multi-net (BIONESS) trawls, bongo nets, and otter trawls (operated by D. Mackas and group...side. The general composition of the zooplankton aggregations can be deduced from the relative levels of the three echo-sounder frequencies; krill ...Nov. 20th, 2002. Krill layer is evident at 66 – 90 m, coincident with BIONESS trawl through the region. 3 Figure 2 shows a comparison between

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

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

  15. GORpipe: a query tool for working with sequence data based on a Genomic Ordered Relational (GOR) architecture

    PubMed Central

    Guðbjartsson, Hákon; Georgsson, Guðmundur Fr.; Guðjónsson, Sigurjón A.; Valdimarsson, Ragnar þór; Sigurðsson, Jóhann H.; Stefánsson, Sigmar K.; Másson, Gísli; Magnússon, Gísli; Pálmason, Vilmundur; Stefánsson, Kári

    2016-01-01

    Motivation: Our aim was to create a general-purpose relational data format and analysis tools to provide an efficient and coherent framework for working with large volumes of DNA sequence data. Results: For this purpose we developed the GORpipe software system. It is based on a genomic ordered architecture and uses a declarative query language that combines features from SQL and shell pipe syntax in a novel manner. The system can for instance be used to annotate sequence variants, find genomic spatial overlap between various types of genomic features, filter and aggregate them in various ways. Availability and Implementation: The GORpipe software is freely available for non-commercial academic usage and can be downloaded from www.nextcode.com/gorpipe. Contact: hakon@wuxinextcode.com Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27339714

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

  17. DYNAMICS OF ANTIGENIC MEMBRANE SITES RELATING TO CELL AGGREGATION IN DICTYOSTELIUM DISCOIDEUM

    PubMed Central

    Beug, H.; Katz, F. E.; Gerisch, G.

    1973-01-01

    Membrane interaction in aggregating cells of Dictyostelium discoideum can be blocked by univalent antibodies directed against specific membrane sites. Using a quantitative technique for measuring cell association, two classes of target sites for blocking antibodies were distinguished and their developmental dynamics studied. One class of these sites is specific for aggregation-competent cells, their quantity rising from virtually 0-level during growth, with a steep increase shortly before cell aggregation. The serological activity of these structures is species specific; they are not detectable in a nonaggregating mutant, but present in a revertant undergoing normal morphogenesis. Patterns of cell assembly in the presence of antibodies show that selective blockage of these membrane sites abolishes the preference for end-to-end association which is typical for aggregating cells. A second class of target sites is present in comparable quantities in particle fractions from both growth-phase and aggregation-competent cells. Blockage of these sites leads to aggregation patterns in which the side-by-side contacts of aggregating cells are abolished. The target sites of aggregation-inhibiting antibodies are suggested to be identical or associated with the molecular units of the cell membrane that mediate cell-to-cell contacts during aggregation. The results indicate that in one cell, two independent classes of contact sites can be simultaneously active. PMID:4631665

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

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

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

  1. Memory formation under stress: quantity and quality.

    PubMed

    Schwabe, Lars; Wolf, Oliver T; Oitzl, Melly S

    2010-03-01

    Stress shapes memory. Depending on the timing of the stress exposure facilitating and impairing effects of stress are reported on how much is learned and remembered. Beyond such stress-induced changes in the quantity of memory, recent research suggests that stress also affects the contribution of multiple memory systems to performance. Under stress, rigid 'habit' memory gets favored over more flexible 'cognitive' memory. Thus, stress has an impact on the way we learn and remember, that is the quality of memory. This shift between different behavioral strategies on "environmental demands" may facilitate adaptive responses. Here, we review stress effects on both quantity and quality of memory and address possible implications of these effects for the understanding of stress-related psychiatric disorders.

  2. QUANTITY: An Isobaric Tag for Quantitative Glycomics

    PubMed Central

    Yang, Shuang; Wang, Meiyao; Chen, Lijun; Yin, Bojiao; Song, Guoqiang; Turko, Illarion V.; Phinney, Karen W.; Betenbaugh, Michael J.; Zhang, Hui; Li, Shuwei

    2015-01-01

    Glycan is an important class of macromolecules that play numerous biological functions. Quantitative glycomics - analysis of glycans at global level - however, is far behind genomics and proteomics owing to technical challenges associated with their chemical properties and structural complexity. As a result, technologies that can facilitate global glycan analysis are highly sought after. Here, we present QUANTITY (Quaternary Amine Containing Isobaric Tag for Glycan), a quantitative approach that can not only enhance detection of glycans by mass spectrometry, but also allow high-throughput glycomic analysis from multiple biological samples. This robust tool enabled us to accomplish glycomic survey of bioengineered Chinese Hamster Ovary (CHO) cells with knock-in/out enzymes involved in protein glycosylation. Our results demonstrated QUANTITY is an invaluable technique for glycan analysis and bioengineering. PMID:26616285

  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.

  4. Toward unified query processing for ISR information needs and collection management

    NASA Astrophysics Data System (ADS)

    Boury-Brisset, A.-C.

    2016-05-01

    The advance in sensing technologies, the acquisition of new sensors, and use of mobile devices result in the production of an overwhelming amount of sensed data, that augment the challenges for analysts to retrieve relevant information among heterogeneous collected data, and to process and analyze them adequately in a timely manner to better support decision makers. At the same time, the limited quantity and capabilities of intelligence, surveillance and reconnaissance (ISR) resources for the amount of requests for information collection requires to maximize their utilization in order to increase the accuracy of information gain and timely delivery of information. Considering the challenges for ISR intelligence requirements and collection management, as well as for information management and exploitation, the paper describes a unified approach for querying available information sources for enhanced ISR information collection and retrieval. The approach leverages and extends semantic models in the ISR domain. Enhanced ISR assets integration, optimized information collection and management should result in more relevant collected data and improve subsequent analysis.

  5. A Language Modeling Framework for Selective Query Expansion

    DTIC Science & Technology

    2004-01-01

    3.5 4 4.5 de lta a ve ra ge p re ci si on clarity score 1 0.3 0.2 0.1 0 -0.1 -0.2 -0.3 -0.4 Legionnarires’ disease Lyme disease supercritical...the overlap of document supercritical fluids Lyme disease Legionnaires’ disease Milosevic, Mirjana Markovic Greek, philosophy, stoicism women clergy...tourists, violence,” is only a lit- tle higher than the score of the bad-to-expand query “ Lyme disease .” Thus a low overlap score could only indicate a

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

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

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

  9. Privacy-Aware Location Database Service for Granular Queries

    NASA Astrophysics Data System (ADS)

    Kiyomoto, Shinsaku; Martin, Keith M.; Fukushima, Kazuhide

    Future mobile markets are expected to increasingly embrace location-based services. This paper presents a new system architecture for location-based services, which consists of a location database and distributed location anonymizers. The service is privacy-aware in the sense that the location database always maintains a degree of anonymity. The location database service permits three different levels of query and can thus be used to implement a wide range of location-based services. Furthermore, the architecture is scalable and employs simple functions that are similar to those found in general database systems.

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

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

  12. Spatial and Temporal Uncertainty of Crop Yield Aggregations

    NASA Technical Reports Server (NTRS)

    Porwollik, Vera; Mueller, Christoph; Elliott, Joshua; Chryssanthacopoulos, James; Iizumi, Toshichika; Ray, Deepak K.; Ruane, Alex C.; Arneth, Almut; Balkovic, Juraj; Ciais, Philippe; Deryng, Delphine; Folberth, Christian; Izaurralde, Robert C.; Jones, Curtis D.; Khabarov, Nikolay; Lawrence, Peter J.; Liu, Wenfeng; Pugh, Thomas A. M.; Reddy, Ashwan; Sakurai, Gen; Schmid, Erwin; Wang, Xuhui; Wu, Xiuchen; de Wit, Allard

    2016-01-01

    The aggregation of simulated gridded crop yields to national or regional scale requires information on temporal and spatial patterns of crop-specific harvested areas. This analysis estimates the uncertainty of simulated gridded yield time series related to the aggregation with four different harvested area data sets. We compare aggregated yield time series from the Global Gridded Crop Model Inter-comparison project for four crop types from 14 models at global, national, and regional scale to determine aggregation-driven differences in mean yields and temporal patterns as measures of uncertainty. The quantity and spatial patterns of harvested areas differ for individual crops among the four datasets applied for the aggregation. Also simulated spatial yield patterns differ among the 14 models. These differences in harvested areas and simulated yield patterns lead to differences in aggregated productivity estimates, both in mean yield and in the temporal dynamics. Among the four investigated crops, wheat yield (17% relative difference) is most affected by the uncertainty introduced by the aggregation at the global scale. The correlation of temporal patterns of global aggregated yield time series can be as low as for soybean (r = 0.28).For the majority of countries, mean relative differences of nationally aggregated yields account for10% or less. The spatial and temporal difference can be substantial higher for individual countries. Of the top-10 crop producers, aggregated national multi-annual mean relative difference of yields can be up to 67% (maize, South Africa), 43% (wheat, Pakistan), 51% (rice, Japan), and 427% (soybean, Bolivia).Correlations of differently aggregated yield time series can be as low as r = 0.56 (maize, India), r = 0.05*Corresponding (wheat, Russia), r = 0.13 (rice, Vietnam), and r = -0.01 (soybean, Uruguay). The aggregation to sub-national scale in comparison to country scale shows that spatial uncertainties can cancel out in countries with

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

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

  15. Building and Querying RDF/OWL Database of Semantically Annotated Nuclear Medicine Images.

    PubMed

    Hwang, Kyung Hoon; Lee, Haejun; Koh, Geon; Willrett, Debra; Rubin, Daniel L

    2017-02-01

    As the use of positron emission tomography-computed tomography (PET-CT) has increased rapidly, there is a need to retrieve relevant medical images that can assist image interpretation. However, the images themselves lack the explicit information needed for query. We constructed a semantically structured database of nuclear medicine images using the Annotation and Image Markup (AIM) format and evaluated the ability the AIM annotations to improve image search. We created AIM annotation templates specific to the nuclear medicine domain and used them to annotate 100 nuclear medicine PET-CT studies in AIM format using controlled vocabulary. We evaluated image retrieval from 20 specific clinical queries. As the gold standard, two nuclear medicine physicians manually retrieved the relevant images from the image database using free text search of radiology reports for the same queries. We compared query results with the manually retrieved results obtained by the physicians. The query performance indicated a 98 % recall for simple queries and a 89 % recall for complex queries. In total, the queries provided 95 % (75 of 79 images) recall, 100 % precision, and an F1 score of 0.97 for the 20 clinical queries. Three of the four images missed by the queries required reasoning for successful retrieval. Nuclear medicine images augmented using semantic annotations in AIM enabled high recall and precision for simple queries, helping physicians to retrieve the relevant images. Further study using a larger data set and the implementation of an inference engine may improve query results for more complex queries.

  16. GHOSTX: an improved sequence homology search algorithm using a query suffix array and a database suffix array.

    PubMed

    Suzuki, Shuji; Kakuta, Masanori; Ishida, Takashi; Akiyama, Yutaka

    2014-01-01

    DNA sequences are translated into protein coding sequences and then further assigned to protein families in metagenomic analyses, because of the need for sensitivity. However, huge amounts of sequence data create the problem that even general homology search analyses using BLASTX become difficult in terms of computational cost. We designed a new homology search algorithm that finds seed sequences based on the suffix arrays of a query and a database, and have implemented it as GHOSTX. GHOSTX achieved approximately 131-165 times acceleration over a BLASTX search at similar levels of sensitivity. GHOSTX is distributed under the BSD 2-clause license and is available for download at http://www.bi.cs.titech.ac.jp/ghostx/. Currently, sequencing technology continues to improve, and sequencers are increasingly producing larger and larger quantities of data. This explosion of sequence data makes computational analysis with contemporary tools more difficult. We offer this tool as a potential solution to this problem.

  17. The influence of erythrocyte aggregation on induced platelet aggregation.

    PubMed

    Ott, C; Lardi, E; Schulzki, T; Reinhart, W H

    2010-01-01

    Red blood cells (RBCs) affect platelet aggregation in flowing blood (primary hemostasis). We tested the hypothesis that RBC aggregation could influence platelet aggregation. RBC aggregation was altered in vitro by: (i) changing plasma aggregatory properties with 3.7 g% dextran 40 (D40), 3.0 g% dextran 70 (D70) or 1.55 g% dextran 500 (D500); (ii) changing RBC aggregatory properties by incubating RBCs in 50 mU/ml neuraminidase for 60 min (reduction of the surface sialic acid content, thus reducing electrostatic repulsion) and subsequent RBC resuspension in platelet rich plasma (PRP) containing 1 g% dextran 70. RBC aggregation was assessed with the sedimentation rate (ESR). Platelet aggregation was measured: (i) in flowing whole blood with a platelet function analyzer PFA-100(R), which simulates in vivo conditions with RBCs flowing in the center and platelets along the wall, where they adhere to collagen and aggregate; and (ii) in a Chrono-log 700 Aggregometer, which measures changes of impedance by platelet aggregation in whole blood or changes in light transmission in PRP. We found that RBC aggregation increased with increasing molecular weight of dextran (ESR: 4 +/- 3 mm/h, 34 +/- 14 mm/h and 89 +/- 23 mm/hfor D40, D70 and D500, respectively, p < 0.0001) and with neuraminidase-treated RBCs (76 +/- 27 mm/h vs 27 +/- 8 mm/h, respectively, p < 0.0001). Platelet aggregation measured in whole blood under flow conditions (PFA-100) and without flow (Chronolog Aggregometer) was not affected by RBC aggregation. Our data suggest that RBC aggregation does not affect platelet aggregation in vitro and plays no role in primary hemostasis.

  18. Polylogarithmic equilibrium treatment of molecular aggregation and critical concentrations.

    PubMed

    Michel, Denis; Ruelle, Philippe

    2017-02-15

    A full equilibrium treatment of molecular aggregation is presented for prototypes of 1D and 3D aggregates, with and without nucleation. By skipping complex kinetic parameters like aggregate size-dependent diffusion, the equilibrium treatment allows us to predict directly time-independent quantities such as critical concentrations. The relationships between the macroscopic equilibrium constants for different paths are first established by statistical corrections and so as to comply with the detailed balance constraints imposed by nucleation, and the composition of the mixture resulting from homogeneous aggregation is then analyzed using a polylogarithmic function. Several critical concentrations are distinguished: the residual monomer concentration at equilibrium (RMC) and the critical nucleation concentration (CNC), which is the threshold concentration of total subunits necessary for initiating aggregation. When increasing the concentration of total subunits, the RMC converges more strongly to its asymptotic value, the equilibrium constant of depolymerization, for 3D aggregates and in the case of nucleation. The CNC moderately depends on the number of subunits in the nucleus, but sharply increases with the difference between the equilibrium constants of polymerization and nucleation. As the RMC and CNC can be numerically but not analytically determined, ansatz equations connecting them to thermodynamic parameters are proposed.

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

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

  1. Loss-tolerant measurement-device-independent quantum private queries

    NASA Astrophysics Data System (ADS)

    Zhao, Liang-Yuan; Yin, Zhen-Qiang; Chen, Wei; Qian, Yong-Jun; Zhang, Chun-Mei; Guo, Guang-Can; Han, Zheng-Fu

    2017-01-01

    Quantum private queries (QPQ) is an important cryptography protocol aiming to protect both the user’s and database’s privacy when the database is queried privately. Recently, a variety of practical QPQ protocols based on quantum key distribution (QKD) have been proposed. However, for QKD-based QPQ the user’s imperfect detectors can be subjected to some detector- side-channel attacks launched by the dishonest owner of the database. Here, we present a simple example that shows how the detector-blinding attack can damage the security of QKD-based QPQ completely. To remove all the known and unknown detector side channels, we propose a solution of measurement-device-independent QPQ (MDI-QPQ) with single- photon sources. The security of the proposed protocol has been analyzed under some typical attacks. Moreover, we prove that its security is completely loss independent. The results show that practical QPQ will remain the same degree of privacy as before even with seriously uncharacterized detectors.

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

  3. The cognitive demands of an innovative query user interface.

    PubMed Central

    Wang, Di; Kaufman, David R.; Mendonca, Eneida A.; Seol, Yoon-Hu; Johnson, Stephen B.; Cimino, James J.

    2002-01-01

    Too often, online searches for health information are time consuming and produce results that are not sufficiently precise to answer clinicians' or patients' questions. The PERSIVAL project is designed to circumvent this problem by personalizing and tailoring searches and presentation to the demands of the user and the particular clinical context. This paper focuses on a cognitive evaluation of one component of this project, a Query User Interface (QUI). The study examines the system's ability to allow users to easily and intuitively express their information needs. We performed several analyses including a cognitive walkthrough of the interface and quantitative estimations of cognitive load. The paper also presents a preliminary analysis of usability testing. The analyses suggest that there are features in the QUI that contribute to a greater cognitive load and result in greater effort on the part of the subject. The results of usability testing are consistent with these findings. However, subjects found it to be relatively easy and intuitive to generate well-formed queries using the interface. This study contributed to the iterative design of the interface and to the next generation of the PERSIVAL system. PMID:12463945

  4. The cognitive demands of an innovative query user interface.

    PubMed

    Wang, Di; Kaufman, David R; Mendonca, Eneida A; Seol, Yoon-Hu; Johnson, Stephen B; Cimino, James J

    2002-01-01

    Too often, online searches for health information are time consuming and produce results that are not sufficiently precise to answer clinicians' or patients' questions. The PERSIVAL project is designed to circumvent this problem by personalizing and tailoring searches and presentation to the demands of the user and the particular clinical context. This paper focuses on a cognitive evaluation of one component of this project, a Query User Interface (QUI). The study examines the system's ability to allow users to easily and intuitively express their information needs. We performed several analyses including a cognitive walkthrough of the interface and quantitative estimations of cognitive load. The paper also presents a preliminary analysis of usability testing. The analyses suggest that there are features in the QUI that contribute to a greater cognitive load and result in greater effort on the part of the subject. The results of usability testing are consistent with these findings. However, subjects found it to be relatively easy and intuitive to generate well-formed queries using the interface. This study contributed to the iterative design of the interface and to the next generation of the PERSIVAL system.

  5. Loss-tolerant measurement-device-independent quantum private queries

    PubMed Central

    Zhao, Liang-Yuan; Yin, Zhen-Qiang; Chen, Wei; Qian, Yong-Jun; Zhang, Chun-Mei; Guo, Guang-Can; Han, Zheng-Fu

    2017-01-01

    Quantum private queries (QPQ) is an important cryptography protocol aiming to protect both the user’s and database’s privacy when the database is queried privately. Recently, a variety of practical QPQ protocols based on quantum key distribution (QKD) have been proposed. However, for QKD-based QPQ the user’s imperfect detectors can be subjected to some detector- side-channel attacks launched by the dishonest owner of the database. Here, we present a simple example that shows how the detector-blinding attack can damage the security of QKD-based QPQ completely. To remove all the known and unknown detector side channels, we propose a solution of measurement-device-independent QPQ (MDI-QPQ) with single- photon sources. The security of the proposed protocol has been analyzed under some typical attacks. Moreover, we prove that its security is completely loss independent. The results show that practical QPQ will remain the same degree of privacy as before even with seriously uncharacterized detectors. PMID:28051101

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

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

  8. 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-09-18

    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.

  9. A Query Result Merging Scheme for Providing Energy Efficiency in Underwater Sensor Networks

    PubMed Central

    Kim, Yunsung; Park, Soo-Hyun

    2011-01-01

    Underwater sensor networks are emerging as a promising distributed data management system for various applications in underwater environments, despite their limited accessibility and restricted energy capacity. With the aid of recent developments in ubiquitous data computing, an increasing number of users are expected to overcome low accessibility by applying queries to underwater sensor networks. However, when multiple users send queries to an underwater sensor network in a disorganized manner, it may incur lethal energy waste and problematic network traffic. The current query management mechanisms cannot effectively deal with this matter due to their limited applicability and unrealistic assumptions. In this paper, a novel query management scheme involving query result merging is proposed for underwater sensor networks. The mechanism is based on a relational database model and is adjusted to the practical restrictions affecting underwater communication environments. Network simulations will prove that the scheme becomes more efficient with a greater number of queries and a smaller period range. PMID:22247695

  10. Towards Optimal Multi-Dimensional Query Processing with BitmapIndices

    SciTech Connect

    Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

    2005-09-30

    Bitmap indices have been widely used in scientific applications and commercial systems for processing complex, multi-dimensional queries where traditional tree-based indices would not work efficiently. This paper studies strategies for minimizing the access costs for processing multi-dimensional queries using bitmap indices with binning. Innovative features of our algorithm include (a) optimally placing the bin boundaries and (b) dynamically reordering the evaluation of the query terms. In addition, we derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.

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

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

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

  14. 48 CFR 52.211-16 - Variation in 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 Quantity. 52....211-16 Variation in Quantity. As prescribed in 11.703(a), insert the following clause: Variation in Quantity (APR 1984) (a) A variation in the quantity of any item called for by this contract will not...

  15. The Acquisition of Quantity Contrasts in Guina-ang Bontok

    ERIC Educational Resources Information Center

    Aoyama, Katsura; Reid, Lawrence A.

    2016-01-01

    This study reports on the acquisition of quantity contrasts in Guina-ang Bontok, an indigenous language spoken in the Philippines. Four-year-old and 5-year-old children's perception and production of quantity contrasts were examined using a pair of names that contrast in the quantity of the medial nasal. Frequencies of the quantity contrast were…

  16. Conserved Quantities in the Generalized Heisenberg Magnet (ghm) Model

    NASA Astrophysics Data System (ADS)

    Mushahid, N.; Hassan, M.; Saleem, U.

    2013-03-01

    We study the conserved quantities of the generalized Heisenberg magnet (GHM) model. We derive the nonlocal conserved quantities of the model using the iterative procedure of Brezin et al. [Phys. Lett. B82, 442 (1979).] We show that the nonlocal conserved quantities Poisson commute with local conserved quantities of the model.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  12. Towards Hybrid Online On-Demand Querying of Realtime Data with Stateful Complex Event Processing

    SciTech Connect

    Zhou, Qunzhi; Simmhan, Yogesh; Prasanna, Viktor K.

    2013-10-09

    Emerging Big Data applications in areas like e-commerce and energy industry require both online and on-demand queries to be performed over vast and fast data arriving as streams. These present novel challenges to Big Data management systems. Complex Event Processing (CEP) is recognized as a high performance online query scheme which in particular deals with the velocity aspect of the 3-V’s of Big Data. However, traditional CEP systems do not consider data variety and lack the capability to embed ad hoc queries over the volume of data streams. In this paper, we propose H2O, a stateful complex event processing framework, to support hybrid online and on-demand queries over realtime data. We propose a semantically enriched event and query model to address data variety. A formal query algebra is developed to precisely capture the stateful and containment semantics of online and on-demand queries. We describe techniques to achieve the interactive query processing over realtime data featured by efficient online querying, dynamic stream data persistence and on-demand access. The system architecture is presented and the current implementation status reported.

  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. Using common table expressions to build a scalable Boolean query generator for clinical data warehouses.

    PubMed

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

    2014-09-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 study 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 cell of i2b2. In our experiments, 16 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 nontrivial, 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 versus M = 75.82, SD = 238.88 s). 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.

  15. On the Representation of Physical Quantities in Natural Language Text

    DTIC Science & Technology

    2004-01-01

    adjectives, and adverbs can determine a quantity that is not explicitly mentioned in a sentence. Verbs A quantity type can be implicitly referenced...provided as background knowledge in NL systems. Verb/ Adverb combination Quantity types can also be determined by combining verbs and adverbs . The...quantity type referenced in (11) is the rate of movement, or ‘velocity’. The adverb alone is not sufficient to determine the quantity type. Although

  16. Maximizing Complementary Quantities by Projective Measurements

    NASA Astrophysics Data System (ADS)

    M. Souza, Leonardo A.; Bernardes, Nadja K.; Rossi, Romeu

    2017-04-01

    In this work, we study the so-called quantitative complementarity quantities. We focus in the following physical situation: two qubits ( q A and q B ) are initially in a maximally entangled state. One of them ( q B ) interacts with a N-qubit system ( R). After the interaction, projective measurements are performed on each of the qubits of R, in a basis that is chosen after independent optimization procedures: maximization of the visibility, the concurrence, and the predictability. For a specific maximization procedure, we study in detail how each of the complementary quantities behave, conditioned on the intensity of the coupling between q B and the N qubits. We show that, if the coupling is sufficiently "strong," independent of the maximization procedure, the concurrence tends to decay quickly. Interestingly enough, the behavior of the concurrence in this model is similar to the entanglement dynamics of a two qubit system subjected to a thermal reservoir, despite that we consider finite N. However, the visibility shows a different behavior: its maximization is more efficient for stronger coupling constants. Moreover, we investigate how the distinguishability, or the information stored in different parts of the system, is distributed for different couplings.

  17. Non-Gaussianity effects in petrophysical quantities

    NASA Astrophysics Data System (ADS)

    Koohi Lai, Z.; Jafari, G. R.

    2013-10-01

    It has been proved that there are many indicators (petrophysical quantities) for the estimation of petroleum reservoirs. The value of information contained in each indicator is yet to be addressed. In this work, the most famous and applicable petrophysical quantities for a reservoir, which are the gamma emission (GR), sonic transient time (DT), neutron porosity (NPHI), bulk density (RHOB), and deep induced resistivity (ILD), have been analyzed in order to characterize a reservoir. The implemented technique is the well-logging method. Based on the log-normal model defined in random multiplicative processes, the probability distribution function (PDF) for the data sets is described. The shape of the PDF depends on the parameter λ2 which determines the efficiency of non-Gaussianity. When non-Gaussianity appears, it is a sign of uncertainty and phase transition in the critical regime. The large value and scale-invariant behavior of the non-Gaussian parameter λ2 is an indication of a new phase which proves adequate for the existence of petroleum reservoirs. Our results show that one of the indicators (GR) is more non-Gaussian than the other indicators, scale wise. This means that GR is a continuously critical indicator. But by moving windows with various scales, the estimated λ2 shows that the most appropriate indicator for distinguishing the critical regime is ILD, which shows an increase at the end of the measured region of the well.

  18. Fractal structure of asphaltene aggregates.

    PubMed

    Rahmani, Nazmul H G; Dabros, Tadeusz; Masliyah, Jacob H

    2005-05-15

    A photographic technique coupled with image analysis was used to measure the size and fractal dimension of asphaltene aggregates formed in toluene-heptane solvent mixtures. First, asphaltene aggregates were examined in a Couette device and the fractal-like aggregate structures were quantified using boundary fractal dimension. The evolution of the floc structure with time was monitored. The relative rates of shear-induced aggregation and fragmentation/restructuring determine the steady-state floc structure. The average floc structure became more compact or more organized as the floc size distribution attained steady state. Moreover, the higher the shear rate is, the more compact the floc structure is at steady state. Second, the fractal dimensions of asphaltene aggregates were also determined in a free-settling test. The experimentally determined terminal settling velocities and characteristic lengths of the aggregates were utilized to estimate the 2D and 3D fractal dimensions. The size-density fractal dimension (D(3)) of the asphaltene aggregates was estimated to be in the range from 1.06 to 1.41. This relatively low fractal dimension suggests that the asphaltene aggregates are highly porous and very tenuous. The aggregates have a structure with extremely low space-filling capacity.

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

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

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

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

  3. Native Language Integrated Queries with CppLINQ in C++

    NASA Astrophysics Data System (ADS)

    Vassilev, V.

    2015-05-01

    Programming language evolution brought to us the domain-specific languages (DSL). They proved to be very useful for expressing specific concepts, turning into a vital ingredient even for general-purpose frameworks. Supporting declarative DSLs (such as SQL) in imperative languages (such as C++) can happen in the manner of language integrated query (LINQ). We investigate approaches to integrate LINQ programming language, native to C++. We review its usability in the context of high energy physics. We present examples using CppLINQ for a few types data analysis workflows done by the end-users doing data analysis. We discuss evidences how this DSL technology can simplify massively parallel grid system such as PROOF.

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

  5. Aggregation models on hypergraphs

    NASA Astrophysics Data System (ADS)

    Alberici, Diego; Contucci, Pierluigi; Mingione, Emanuele; Molari, Marco

    2017-01-01

    Following a newly introduced approach by Rasetti and Merelli we investigate the possibility to extract topological information about the space where interacting systems are modelled. From the statistical datum of their observable quantities, like the correlation functions, we show how to reconstruct the activities of their constitutive parts which embed the topological information. The procedure is implemented on a class of polymer models on hypergraphs with hard-core interactions. We show that the model fulfils a set of iterative relations for the partition function that generalise those introduced by Heilmann and Lieb for the monomer-dimer case. After translating those relations into structural identities for the correlation functions we use them to test the precision and the robustness of the inverse problem. Finally the possible presence of a further interaction of peer-to-peer type is considered and a criterion to discover it is identified.

  6. Ontology-assisted analysis of Web queries to determine the knowledge radiologists seek.

    PubMed

    Rubin, Daniel L; Flanders, Adam; Kim, Woojin; Siddiqui, Khan M; Kahn, Charles E

    2011-02-01

    Radiologists frequently search the Web to find information they need to improve their practice, and knowing the types of information they seek could be useful for evaluating Web resources. Our goal was to develop an automated method to categorize unstructured user queries using a controlled terminology and to infer the type of information users seek. We obtained the query logs from two commonly used Web resources for radiology. We created a computer algorithm to associate RadLex-controlled vocabulary terms with the user queries. Using the RadLex hierarchy, we determined the high-level category associated with each RadLex term to infer the type of information users were seeking. To test the hypothesis that the term category assignments to user queries are non-random, we compared the distributions of the term categories in RadLex with those in user queries using the chi square test. Of the 29,669 unique search terms found in user queries, 15,445 (52%) could be mapped to one or more RadLex terms by our algorithm. Each query contained an average of one to two RadLex terms, and the dominant categories of RadLex terms in user queries were diseases and anatomy. While the same types of RadLex terms were predominant in both RadLex itself and user queries, the distribution of types of terms in user queries and RadLex were significantly different (p < 0.0001). We conclude that RadLex can enable processing and categorization of user queries of Web resources and enable understanding the types of information users seek from radiology knowledge resources on the Web.

  7. Improving accuracy for identifying related PubMed queries by an integrated approach.

    PubMed

    Lu, Zhiyong; Wilbur, W John

    2009-10-01

    PubMed is the most widely used tool for searching biomedical literature online. As with many other online search tools, a user often types a series of multiple related queries before retrieving satisfactory results to fulfill a single information need. Meanwhile, it is also a common phenomenon to see a user type queries on unrelated topics in a single session. In order to study PubMed users' search strategies, it is necessary to be able to automatically separate unrelated queries and group together related queries. Here, we report a novel approach combining both lexical and contextual analyses for segmenting PubMed query sessions and identifying related queries and compare its performance with the previous approach based solely on concept mapping. We experimented with our integrated approach on sample data consisting of 1539 pairs of consecutive user queries in 351 user sessions. The prediction results of 1396 pairs agreed with the gold-standard annotations, achieving an overall accuracy of 90.7%. This demonstrates that our approach is significantly better than the previously published method. By applying this approach to a one day query log of PubMed, we found that a significant proportion of information needs involved more than one PubMed query, and that most of the consecutive queries for the same information need are lexically related. Finally, the proposed PubMed distance is shown to be an accurate and meaningful measure for determining the contextual similarity between biological terms. The integrated approach can play a critical role in handling real-world PubMed query log data as is demonstrated in our experiments.

  8. TYPES AND QUANTITIES OF LEFTOVER DRUGS ...

    EPA Pesticide Factsheets

    BACKGROUND: Pharmaceuticals designed for humans and animals often remain unused. Leftover and accumulated drugs represent suboptimal delivery of health care and environmentally unsound disposal, which can pose exposure risks for humans and wildlife.OBJECTIVES: A major unknown with respect to drugs as pollutants is what fractions of drug residues occurring in the ambient environment result from discarding leftover drugs. To gauge the significance of leftover drugs as potential pollutants, data are needed on the types, quantities, and frequencies with which drugs accumulate. Absence of this data has prevented assessments of the significance of drug accumulation and disposal as a contributing source of drug residues in the environment.METHODS: One particular source of drug accumulation is those drugs that become

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

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

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

  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. Design and Evaluation of a User Interface Supporting Multiple Image Query Models.

    ERIC Educational Resources Information Center

    Mostafa, Javed; Dillon, Andrew

    1996-01-01

    Describes the ViewFinder interface, designed at Indiana University as a client to a database server; it supports querying based on both visual and verbal clues. Presents results of usability analysis performed on ViewFinder with 18 users. High search success rates were achieved through both types of querying means; verbal clues were used more than…

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

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

  16. UMass at TREC WEB 2014: Entity Query Feature Expansion using Knowledge Base Links

    DTIC Science & Technology

    2014-11-01

    task on the category A subset and demonstrate the benefit of entity-centric approaches even for non-entity queries like “dark chocolate health benefits...category A subset and demonstrate the benefit of entity-centric approaches even for non-entity queries like ???dark chocolate health benefits???. 15

  17. Use of an IQF-Like Query Language by Non-programmers.

    DTIC Science & Technology

    1975-02-20

    required about ten hours to learn a query language which was somewhat similar to IBM’s IQF query language, but contained more function. They were then given...problem coding times. Specific language constructions (additions to IQF ), such as contextual referencing and a new method to handle limited disjunctive

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

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

  1. Bat-Inspired Algorithm Based Query Expansion for Medical Web Information Retrieval.

    PubMed

    Khennak, Ilyes; Drias, Habiba

    2017-02-01

    With the increasing amount of medical data available on the Web, looking for health information has become one of the most widely searched topics on the Internet. Patients and people of several backgrounds are now using Web search engines to acquire medical information, including information about a specific disease, medical treatment or professional advice. Nonetheless, due to a lack of medical knowledge, many laypeople have difficulties in forming appropriate queries to articulate their inquiries, which deem their search queries to be imprecise due the use of unclear keywords. The use of these ambiguous and vague queries to describe the patients' needs has resulted in a failure of Web search engines to retrieve accurate and relevant information. One of the most natural and promising method to overcome this drawback is Query Expansion. In this paper, an original approach based on Bat Algorithm is proposed to improve the retrieval effectiveness of query expansion in medical field. In contrast to the existing literature, the proposed approach uses Bat Algorithm to find the best expanded query among a set of expanded query candidates, while maintaining low computational complexity. Moreover, this new approach allows the determination of the length of the expanded query empirically. Numerical results on MEDLINE, the on-line medical information database, show that the proposed approach is more effective and efficient compared to the baseline.

  2. Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes

    NASA Astrophysics Data System (ADS)

    Ianni, Giovambattista; Krennwallner, Thomas; Martello, Alessandra; Polleres, Axel

    RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently a W3C standard for querying RDF data, but it mostly provides means for querying simple RDF graphs only, whereas querying with respect to RDFS or other entailment regimes is left outside the current specification. In this paper, we show that SPARQL faces certain unwanted ramifications when querying ontologies in conjunction with RDF datasets that comprise multiple named graphs, and we provide an extension for SPARQL that remedies these effects. Moreover, since RDFS inference has a close relationship with logic rules, we generalize our approach to select a custom ruleset for specifying inferences to be taken into account in a SPARQL query. We show that our extensions are technically feasible by providing benchmark results for RDFS querying in our prototype system GiaBATA, which uses Datalog coupled with a persistent Relational Database as a back-end for implementing SPARQL with dynamic rule-based inference. By employing different optimization techniques like magic set rewriting our system remains competitive with state-of-the-art RDFS querying systems.

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

  4. Minimizing I/O Costs of Multi-Dimensional Queries with BitmapIndices

    SciTech Connect

    Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

    2006-03-30

    Bitmap indices have been widely used in scientific applications and commercial systems for processing complex,multi-dimensional queries where traditional tree-based indices would not work efficiently. A common approach for reducing the size of a bitmap index for high cardinality attributes is to group ranges of values of an attribute into bins and then build a bitmap for each bin rather than a bitmap for each value of the attribute. Binning reduces storage costs,however, results of queries based on bins often require additional filtering for discarding it false positives, i.e., records in the result that do not satisfy the query constraints. This additional filtering,also known as ''candidate checking,'' requires access to the base data on disk and involves significant I/O costs. This paper studies strategies for minimizing the I/O costs for ''candidate checking'' for multi-dimensional queries. This is done by determining the number of bins allocated for each dimension and then placing bin boundaries in optimal locations. Our algorithms use knowledge of data distribution and query workload. We derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.

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

  6. Uncertainty quantification of measured quantities for a HCCI engine: mass-average quantities and perofrmances

    SciTech Connect

    Petitpas, Guillaume; Whitesides, Russel

    2016-12-12

    UQHCCI_2 propagates the uncertainties of mass-average quantities (temperature, heat capacity ratio) and the output performances (IMEP, heat release, CA50 and RI) of a HCCI engine test bench using the pressure trace, and intake and exhaust molar fraction and IVC temperature distributions, as inputs (those inputs may be computed using another code UQHCCI_2, or entered independently).

  7. Premature red blood cells have decreased aggregation and enhanced aggregability.

    PubMed

    Arbell, D; Orkin, B; Bar-Oz, B; Barshtein, G; Yedgar, S

    2008-06-01

    Preterm infants are highly susceptible to ischemic damage. This damage is most obvious in the brain, retina, and gastrointestinal tract. Studies focusing on the rheological properties of premature red blood cells (pRBCs) have consistently shown minimal or no RBC aggregation. Previously, measurements of pRBC aggregation kinetics indicated that specific plasma properties are responsible for the decreased RBC aggregation observed in the neonates, but that their specific RBC properties do not affect it. However, the strength of interaction in the pRBC aggregates as a function of medium composition has not been tested. In our previous research, we described clinically relevant parameters, that is, the aggregate resistance to disaggregation by flow. With the help of a cell flow property analyzer (CFA), we can monitor RBC aggregation by direct visualization of its dynamics during flow. We used the CFA to examine pRBC (from 9 premature babies) in the natural plasma and in PBS buffer supplemented with dextran (500 kDa) to distinguish between RBC intrinsic-cellular and plasma factors. pRBCs suspended in the native plasma showed minimal or no aggregation in comparison to normal adult RBC. When we transferred pRBCs from the same sample to the dextran solution, enhanced resistance to disaggregation by flow was apparent.

  8. Orthogonal flexible Rydberg aggregates

    NASA Astrophysics Data System (ADS)

    Leonhardt, K.; Wüster, S.; Rost, J. M.

    2016-02-01

    We study the link between atomic motion and exciton transport in flexible Rydberg aggregates, assemblies of highly excited light alkali-metal atoms, for which motion due to dipole-dipole interaction becomes relevant. In two one-dimensional atom chains crossing at a right angle adiabatic exciton transport is affected by a conical intersection of excitonic energy surfaces, which induces controllable nonadiabatic effects. A joint exciton-motion pulse that is initially governed by a single energy surface is coherently split into two modes after crossing the intersection. The modes induce strongly different atomic motion, leading to clear signatures of nonadiabatic effects in atomic density profiles. We have shown how this scenario can be exploited as an exciton switch, controlling direction and coherence properties of the joint pulse on the second of the chains [K. Leonhardt et al., Phys. Rev. Lett. 113, 223001 (2014), 10.1103/PhysRevLett.113.223001]. In this article we discuss the underlying complex dynamics in detail, characterize the switch, and derive our isotropic interaction model from a realistic anisotropic one with the addition of a magnetic bias field.

  9. Design and evaluation of a temporal, graph-based language for querying collections of patient histories.

    PubMed

    Edsberg, Ole; Nordbø, Stein Jakob; Vinnes, Erik; Nytrø, Øystein

    2007-01-01

    Giving clinicians and researchers the ability to easily retrieve and explore relevant fragments of patient histories would greatly facilitate quality assurance, patient followup and research on patient treatment processes. Established database query languages are inconvenient for such exploration, and may also be too complex for users with limited backgrounds in informatics. We believe that understandability can be increased in return for a sacrifice of some of the power of expression found in general query languages. In order to design a specialized query language, we have collected and synthesized a tentative list of requirements. Based on these requirements, we have designed and implemented Practice Explorer, a prototype for visual query of collections of patient histories, and evaluated the understandability of its query language by testing with medical students. The results indicate that parts of the language are intuitive enough for users to understand without demonstrations, examples, feedback or assistance. They also provide some lessons for future work in this area.

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

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

    PubMed

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

    2012-11-06

    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.

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

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

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

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

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

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

  18. Estimating and operating on discrete quantities in orangutans (Pongo pygmaeus).

    PubMed

    Call, J

    2000-06-01

    This study investigated the ability of 3 male orangutans (Pongo pygmaeus; 1 subadult, 2 adults) to estimate, compare, and operate on 2 sets of small quantities (1-6 cereal bits). Experiment 1 investigated the orangutans' ability to choose the larger of 2 quantities when they were presented successively as opposed to simultaneously, thus being perceptually unavailable at the time of choice. Experiment 2 investigated the orangutans' ability to select the larger quantity after the original quantities were augmented or reduced. Orangutans were capable of selecting the larger of 2 quantities in Experiment 1. There was also some evidence from Experiment 2, albeit weaker, that orangutans may mentally combine quantities (but not dissociate) to obtain the larger of 2 quantities. This study suggests that orangutans use a representational mechanism (especially when comparing quantities) to select the larger of 2 sets of items.

  19. Fluctuations in Protein Aggregation: Design of Preclinical Screening for Early Diagnosis of Neurodegenerative Disease

    NASA Astrophysics Data System (ADS)

    Costantini, Giulio; Budrikis, Zoe; Taloni, Alessandro; Buell, Alexander K.; Zapperi, Stefano; La Porta, Caterina A. M.

    2016-09-01

    Autocatalytic fibril nucleation has recently been proposed to be a determining factor for the spread of neurodegenerative diseases, but the same process could also be exploited to amplify minute quantities of protein aggregates in a diagnostic context. Recent advances in microfluidic technology allow the analysis of protein aggregation in micron-scale samples, potentially enabling such diagnostic approaches, but the theoretical foundations for the analysis and interpretation of such data are, so far, lacking. Here, we study computationally the onset of protein aggregation in small volumes and show that the process is ruled by intrinsic fluctuations whose volume-dependent distribution we also estimate theoretically. Based on these results, we develop a strategy to quantify in silico the statistical errors associated with the detection of aggregate-containing samples. Our work explores a different perspective on the forecasting of protein aggregation in asymptomatic subjects.

  20. Kinetics of Aggregation with Choice

    DOE PAGES

    Ben-Naim, Eli; Krapivsky, Paul

    2016-12-01

    Here we generalize the ordinary aggregation process to allow for choice. In ordinary aggregation, two random clusters merge and form a larger aggregate. In our implementation of choice, a target cluster and two candidate clusters are randomly selected and the target cluster merges with the larger of the two candidate clusters.We study the long-time asymptotic behavior and find that as in ordinary aggregation, the size density adheres to the standard scaling form. However, aggregation with choice exhibits a number of different features. First, the density of the smallest clusters exhibits anomalous scaling. Second, both the small-size and the large-size tailsmore » of the density are overpopulated, at the expense of the density of moderate-size clusters. Finally, we also study the complementary case where the smaller candidate cluster participates in the aggregation process and find an abundance of moderate clusters at the expense of small and large clusters. Additionally, we investigate aggregation processes with choice among multiple candidate clusters and a symmetric implementation where the choice is between two pairs of clusters.« less

  1. Kinetics of Aggregation with Choice

    SciTech Connect

    Ben-Naim, Eli; Krapivsky, Paul

    2016-12-01

    Here we generalize the ordinary aggregation process to allow for choice. In ordinary aggregation, two random clusters merge and form a larger aggregate. In our implementation of choice, a target cluster and two candidate clusters are randomly selected and the target cluster merges with the larger of the two candidate clusters.We study the long-time asymptotic behavior and find that as in ordinary aggregation, the size density adheres to the standard scaling form. However, aggregation with choice exhibits a number of different features. First, the density of the smallest clusters exhibits anomalous scaling. Second, both the small-size and the large-size tails of the density are overpopulated, at the expense of the density of moderate-size clusters. Finally, we also study the complementary case where the smaller candidate cluster participates in the aggregation process and find an abundance of moderate clusters at the expense of small and large clusters. Additionally, we investigate aggregation processes with choice among multiple candidate clusters and a symmetric implementation where the choice is between two pairs of clusters.

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

  3. Modeling the competition between aggregation and self-assembly during virus-like particle processing.

    PubMed

    Ding, Yong; Chuan, Yap Pang; He, Lizhong; Middelberg, Anton P J

    2010-10-15

    Understanding and controlling aggregation is an essential aspect in the development of pharmaceutical proteins to improve product yield, potency and quality consistency. Even a minute quantity of aggregates may be reactogenic and can render the final product unusable. Self-assembly processing of virus-like particles (VLPs) is an efficient method to quicken the delivery of safe and efficacious vaccines to the market at low cost. VLP production, as with the manufacture of many biotherapeutics, is susceptible to aggregation, which may be minimized through the use of accurate and practical mathematical models. However, existing models for virus assembly are idealized, and do not predict the non-native aggregation behavior of self-assembling viral subunits in a tractable nor useful way. Here we present a mechanistic mathematical model describing VLP self-assembly that accounts for partitioning of reactive subunits between the correct and aggregation pathways. Our results show that unproductive aggregation causes up to 38% product loss by competing favorably with the productive nucleation of self-assembling subunits, therefore limiting the availability of nuclei for subsequent capsid growth. The protein subunit aggregation reaction exhibits an apparent second-order concentration dependence, suggesting a dimerization-controlled agglomeration pathway. Despite the plethora of possible assembly intermediates and aggregation pathways, protein aggregation behavior may be predicted by a relatively simple yet realistic model. More importantly, we have shown that our bioengineering model is amenable to different reactor formats, thus opening the way to rational scale-up strategies for products that comprise biomolecular assemblies.

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

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

  6. 46 CFR 108.433 - Quantity of CO2: General.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 46 Shipping 4 2013-10-01 2013-10-01 false Quantity of CO2: General. 108.433 Section 108.433... Quantity of CO2: General. Each CO2 system must have enough gas to meet the quantity requirements of § 108.439 for the space requiring the greatest amount of CO2....

  7. 46 CFR 108.433 - Quantity of CO2: General.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 46 Shipping 4 2014-10-01 2014-10-01 false Quantity of CO2: General. 108.433 Section 108.433... Quantity of CO2: General. Each CO2 system must have enough gas to meet the quantity requirements of § 108.439 for the space requiring the greatest amount of CO2....

  8. 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.1551 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION AIRCRAFT... Information Markings and Placards § 23.1551 Oil quantity indicator. Each oil quantity indicator must be...

  9. 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.1551 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION AIRCRAFT... Placards § 29.1551 Oil quantity indicator. Each oil quantity indicator must be marked with...

  10. 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.1551 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION AIRCRAFT... § 27.1551 Oil quantity indicator. Each oil quantity indicator must be marked with enough increments...

  11. Intensive Quantities: Why They Matter to Developmental Research

    ERIC Educational Resources Information Center

    Howe, Christine; Nunes, Terezinha; Bryant, Peter

    2010-01-01

    A distinction can be drawn between extensive and intensive quantities. Extensive quantities (e.g., volume, distance), which have been the focus of developmental research, depend upon additive combination. Intensive quantities (e.g., density, speed), which have been relatively neglected, derive from proportional relations between variables. Thus,…

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

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

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

  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. Fractal aggregates in Titan's atmosphere

    NASA Astrophysics Data System (ADS)

    Cabane, M.; Rannou, P.; Chassefiere, E.; Israel, G.

    1993-04-01

    The cluster structure of Titan's atmosphere was modeled by using an Eulerian microphysical model with the specific formulation of microphysical laws applying to fractal particles. The growth of aggregates in the settling phase was treated by introducing the fractal dimension as a parameter of the model. The model was used to obtain a vertical distribution of size and number density of the aggregates for different production altitudes. Results confirm previous estimates of the formation altitude of photochemical aerosols. The vertical profile of the effective radius of aggregates was calculated as a function of the visible optical depth.

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

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

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

  1. Query by synthesized sketch in an architectural database

    NASA Astrophysics Data System (ADS)

    Benois-Pineau, Jenny; Martinez, Jose; Briand, Henri

    1997-01-01

    In an architectural database that is to be used by architects, urbanists, sociologists, geometers, etc., querying must be simplified. The aim of this work is to retrieve the images of a building that best fit a specified point of view. Original data are provided in DXF and TIFF formats (maps and images respectively.) A loose linking between these two types of information is obtained through textural attributes. However, the same building is photographed several times and more than a single building can appear on a picture. After determining the point of view by simple `clicks' on a map, we take advantages of the geometrical description of the building in order to draw its outline. Then, the images that have been textually associated with the selected building undergo a five-steps image-processing algorithm: conversion from the RGB color- space to intensity component, Nagao filtering, oriented gradient filtering, thresholding, and correlation-based hierarchical full search matching. If the building objects are not completely masked by natural ones, the `rectangular' shapes of frontage and side walls correspond well to the sketch and the requested images are returned to the user.

  2. A wireless, remote query magnetoelastic CO2 sensor.

    PubMed

    Cai, Q Y; Cammers-Goodwin, A; Grimes, C A

    2000-12-01

    This paper presents a wireless, passive, remote query CO2 sensor comprising a ribbon-like magnetoelastic thick-film coated with a mass-changing CO2 responsive polymer synthesized from acrylamide and isooctylacrylate. In response to a magnetic field impulse, the magnetostrictive magnetoelastic sensor vibrates at a characteristic resonant frequency that is inversely dependent upon the mass of the attached CO2 responsive polymer. The mechanical vibrations of the magnetostrictive sensor launch magnetic flux, which can be detected remotely using a pickup coil. By monitoring the resonant frequency of the passive sensor, the atmospheric CO2 concentration can be determined without the need for physical connections to the sensor or specific alignment requirements. The effect of humidity and the CO2 responsive copolymer composition on the measurement sensitivity are reported. Greatest sensitivity is achieved with a polymer comprising a 1:1 mole ratio of acrylamide to isooctyl acrylate. A 0.7% change in atmospheric CO2 concentration can be detected for a 20 microns thick polymer coated sensor.

  3. Determining conserved metabolic biomarkers from a million database queries

    PubMed Central

    Kurczy, Michael E.; Ivanisevic, Julijana; Johnson, Caroline H.; Uritboonthai, Winnie; Hoang, Linh; Fang, Mingliang; Hicks, Matthew; Aldebot, Anthony; Rinehart, Duane; Mellander, Lisa J.; Tautenhahn, Ralf; Patti, Gary J.; Spilker, Mary E.; Benton, H. Paul; Siuzdak, Gary

    2015-01-01

    Motivation: Metabolite databases provide a unique window into metabolome research allowing the most commonly searched biomarkers to be catalogued. Omic scale metabolite profiling, or metabolomics, is finding increased utility in biomarker discovery largely driven by improvements in analytical technologies and the concurrent developments in bioinformatics. However, the successful translation of biomarkers into clinical or biologically relevant indicators is limited. Results: With the aim of improving the discovery of translatable metabolite biomarkers, we present search analytics for over one million METLIN metabolite database queries. The most common metabolites found in METLIN were cross-correlated against XCMS Online, the widely used cloud-based data processing and pathway analysis platform. Analysis of the METLIN and XCMS common metabolite data has two primary implications: these metabolites, might indicate a conserved metabolic response to stressors and, this data may be used to gauge the relative uniqueness of potential biomarkers. Availability and implementation. METLIN can be accessed by logging on to: https://metlin.scripps.edu Contact: siuzdak@scripps.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:26275895

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

  5. Surface fractals in liposome aggregation.

    PubMed

    Roldán-Vargas, Sándalo; Barnadas-Rodríguez, Ramon; Quesada-Pérez, Manuel; Estelrich, Joan; Callejas-Fernández, José

    2009-01-01

    In this work, the aggregation of charged liposomes induced by magnesium is investigated. Static and dynamic light scattering, Fourier-transform infrared spectroscopy, and cryotransmission electron microscopy are used as experimental techniques. In particular, multiple intracluster scattering is reduced to a negligible amount using a cross-correlation light scattering scheme. The analysis of the cluster structure, probed by means of static light scattering, reveals an evolution from surface fractals to mass fractals with increasing magnesium concentration. Cryotransmission electron microscopy micrographs of the aggregates are consistent with this interpretation. In addition, a comparative analysis of these results with those previously reported in the presence of calcium suggests that the different hydration energy between lipid vesicles when these divalent cations are present plays a fundamental role in the cluster morphology. This suggestion is also supported by infrared spectroscopy data. The kinetics of the aggregation processes is also analyzed through the time evolution of the mean diffusion coefficient of the aggregates.

  6. Cell aggregation: Packing soft grains

    NASA Astrophysics Data System (ADS)

    Åström, J. A.; Karttunen, M.

    2006-06-01

    Cellular aggregates may be considered as collections of membrane enclosed units with a pressure difference between the internal and external liquid phases. Cells are kept together by membrane adhesion and/or confined space compression. Pattern formation and, in particular, intercellular spacing have important roles in controlling solvent diffusion within such aggregates. A physical approach is used to study generic aspects of cellular packings in a confined space. Average material properties are derived from the free energy. The appearance of penetrating intercellular void channels is found to be critically governed by the cell wall adhesion mechanisms during the formation of dense aggregates. A fully relaxed aggregate efficiently hinders solvent diffusion at high hydrostatic pressures, while a small fraction (˜0.1) of adhesion related packing frustration is sufficient for breaking such a blockage even at high a pressure.

  7. Aggregate breakdown of nanoparticulate titania

    NASA Astrophysics Data System (ADS)

    Venugopal, Navin

    Six nanosized titanium dioxide powders synthesized from a sulfate process were investigated. The targeted end-use of this powder was for a de-NOx catalyst honeycomb monolith. Alteration of synthesis parameters had resulted principally in differences in soluble ion level and specific surface area of the powders. The goal of this investigation was to understand the role of synthesis parameters in the aggregation behavior of these powders. Investigation via scanning electron microscopy of the powders revealed three different aggregation iterations at specific length scales. Secondary and higher order aggregate strength was investigated via oscillatory stress rheometry as a means of simulating shear conditions encountered during extrusion. G' and G'' were measured as a function of the applied oscillatory stress. Oscillatory rheometry indicated a strong variation as a function of the sulfate level of the particles in the viscoelastic yield strengths. Powder yield stresses ranged from 3.0 Pa to 24.0 Pa of oscillatory stress. Compaction curves to 750 MPa found strong similarities in extrapolated yield point of stage I and II compaction for each of the powders (at approximately 500 MPa) suggesting that the variation in sulfate was greatest above the primary aggregate level. Scanning electron microscopy of samples at different states of shear in oscillatory rheometry confirmed the variation in the linear elastic region and the viscous flow regime. A technique of this investigation was to approach aggregation via a novel perspective: aggregates are distinguished as being loose open structures that are highly disordered and stochastic in nature. The methodology used was to investigate the shear stresses required to rupture the various aggregation stages encountered and investigate the attempt to realign the now free-flowing constituents comprising the aggregate into a denser configuration. Mercury porosimetry was utilized to measure the pore size of the compact resulting from

  8. Thermodynamics of quantum systems with multiple conserved quantities

    PubMed Central

    Guryanova, Yelena; Popescu, Sandu; Short, Anthony J.; Silva, Ralph; Skrzypczyk, Paul

    2016-01-01

    Recently, there has been much progress in understanding the thermodynamics of quantum systems, even for small individual systems. Most of this work has focused on the standard case where energy is the only conserved quantity. Here we consider a generalization of this work to deal with multiple conserved quantities. Each conserved quantity, which, importantly, need not commute with the rest, can be extracted and stored in its own battery. Unlike the standard case, in which the amount of extractable energy is constrained, here there is no limit on how much of any individual conserved quantity can be extracted. However, other conserved quantities must be supplied, and the second law constrains the combination of extractable quantities and the trade-offs between them. We present explicit protocols that allow us to perform arbitrarily good trade-offs and extract arbitrarily good combinations of conserved quantities from individual quantum systems. PMID:27384384

  9. Law of genome evolution direction: Coding information quantity grows

    NASA Astrophysics Data System (ADS)

    Luo, Liao-Fu

    2009-06-01

    The problem of the directionality of genome evolution is studied. Based on the analysis of C-value paradox and the evolution of genome size, we propose that the function-coding information quantity of a genome always grows in the course of evolution through sequence duplication, expansion of code, and gene transfer from outside. The function-coding information quantity of a genome consists of two parts, p-coding information quantity that encodes functional protein and n-coding information quantity that encodes other functional elements. The evidences on the law of the evolutionary directionality are indicated. The needs of function are the motive force for the expansion of coding information quantity, and the information quantity expansion is the way to make functional innovation and extension for a species. Therefore, the increase of coding information quantity of a genome is a measure of the acquired new function, and it determines the directionality of genome evolution.

  10. Analyzing Medical Image Search Behavior: Semantics and Prediction of Query Results.

    PubMed

    De-Arteaga, Maria; Eggel, Ivan; Kahn, Charles E; Müller, Henning

    2015-10-01

    Log files of information retrieval systems that record user behavior have been used to improve the outcomes of retrieval systems, understand user behavior, and predict events. In this article, a log file of the ARRS GoldMiner search engine containing 222,005 consecutive queries is analyzed. Time stamps are available for each query, as well as masked IP addresses, which enables to identify queries from the same person. This article describes the ways in which physicians (or Internet searchers interested in medical images) search and proposes potential improvements by suggesting query modifications. For example, many queries contain only few terms and therefore are not specific; others contain spelling mistakes or non-medical terms that likely lead to poor or empty results. One of the goals of this report is to predict the number of results a query will have since such a model allows search engines to automatically propose query modifications in order to avoid result lists that are empty or too large. This prediction is made based on characteristics of the query terms themselves. Prediction of empty results has an accuracy above 88%, and thus can be used to automatically modify the query to avoid empty result sets for a user. The semantic analysis and data of reformulations done by users in the past can aid the development of better search systems, particularly to improve results for novice users. Therefore, this paper gives important ideas to better understand how people search and how to use this knowledge to improve the performance of specialized medical search engines.

  11. An Energy-Efficient Skyline Query for Massively Multidimensional Sensing Data.

    PubMed

    Wang, Yan; Wei, Wei; Deng, Qingxu; Liu, Wei; Song, Houbing

    2016-01-09

    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.

  12. An Energy-Efficient Skyline Query for Massively Multidimensional Sensing Data

    PubMed Central

    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

  13. Glycation precedes lens crystallin aggregation

    SciTech Connect

    Swamy, M.S.; Perry, R.E.; Abraham, E.C.

    1987-05-01

    Non-enzymatic glycosylation (glycation) seems to have the potential to alter the structure of crystallins and make them susceptible to thiol oxidation leading to disulfide-linked high molecular weight (HMW) aggregate formation. They used streptozotocin diabetic rats during precataract and cataract stages and long-term cell-free glycation of bovine lens crystallins to study the relationship between glycation and lens crystallin aggregation. HMW aggregates and other protein components of the water-soluble (WS) and urea-soluble (US) fractions were separated by molecular sieve high performance liquid chromatography. Glycation was estimated by both (/sup 3/H)NaBH/sub 4/ reduction and phenylboronate agarose affinity chromatography. Levels of total glycated protein (GP) in the US fractions were about 2-fold higher than in the WS fractions and there was a linear increase in GP in both WS and US fractions. This increase was parallelled by a corresponding increase in HMW aggregates. Total GP extracted by the affinity method from the US fraction showed a predominance of HMW aggregates and vice versa. Cell-free glycation studies with bovine crystallins confirmed the results of the animals studies. Increasing glycation caused a corresponding increase in protein insolubilization and the insoluble fraction thus formed also contained more glycated protein. It appears that lens protein glycation, HMW aggregate formation, and protein insolubilization are interrelated.

  14. Model for amorphous aggregation processes

    NASA Astrophysics Data System (ADS)

    Stranks, Samuel D.; Ecroyd, Heath; van Sluyter, Steven; Waters, Elizabeth J.; Carver, John A.; von Smekal, Lorenz

    2009-11-01

    The amorphous aggregation of proteins is associated with many phenomena, ranging from the formation of protein wine haze to the development of cataract in the eye lens and the precipitation of recombinant proteins during their expression and purification. While much literature exists describing models for linear protein aggregation, such as amyloid fibril formation, there are few reports of models which address amorphous aggregation. Here, we propose a model to describe the amorphous aggregation of proteins which is also more widely applicable to other situations where a similar process occurs, such as in the formation of colloids and nanoclusters. As first applications of the model, we have tested it against experimental turbidimetry data of three proteins relevant to the wine industry and biochemistry, namely, thaumatin, a thaumatinlike protein, and α -lactalbumin. The model is very robust and describes amorphous experimental data to a high degree of accuracy. Details about the aggregation process, such as shape parameters of the aggregates and rate constants, can also be extracted.

  15. Experimental aggregation of volcanic ash: the role of liquid bonding

    NASA Astrophysics Data System (ADS)

    Mueller, S.; Kueppers, U.; Jacob, M.; Ayris, P. M.; Dingwell, D. B.

    2015-12-01

    Explosive volcanic eruptions may release vast quantities of ash. Because of its size, it has the greatest dispersal potential and can be distributed globally. Ash may pose severe risks for 1) air traffic, 2) human and animal health, 3) agriculture and 4) infrastructure. Such ash particles can however cluster and form ash aggregates that range in size from millimeters to centimeters. During their growth, weight and aerodynamic properties change. This leads to significantly changed transport and settling behavior. The physico-chemical processes involved in aggregation are quantitatively poorly constrained. We have performed laboratory ash aggregation experiments using the ProCell Lab System® of Glatt Ingenieurtechnik GmbH. Solid particles are set into motion in a fluidized bed over a range of well-controlled boundary conditions (e.g., air flow rate, gas temperature, humidity, liquid composition). In this manner we simulate the variable gas-particle flow conditions expected in eruption plumes and pyroclastic density currents. We have used 1) soda-lime glass beads as an analogue material and 2) natural volcanic ash from Laacher See Volcano (Germany). In order to influence form, size, stability and the production rate of aggregates, a range of experimental conditions (e.g., particle concentration, degree of turbulence, temperature and moisture in the process chamber and the composition of the liquid phase) have been employed. We have successfully reproduced several features of natural ash aggregates, including round, internally structured ash pellets up to 3 mm in diameter. These experimental results help to constrain the boundary conditions required for the generation of spherical, internally-structured ash aggregates that survive deposition and are preserved in the volcanological record. These results should also serve as input parameters for models of ash transport and ash mass distribution.

  16. TreeQ-VISTA: An Interactive Tree Visualization Tool withFunctional Annotation Query Capabilities

    SciTech Connect

    Gu, Shengyin; Anderson, Iain; Kunin, Victor; Cipriano, Michael; Minovitsky, Simon; Weber, Gunther; Amenta, Nina; Hamann, Bernd; Dubchak,Inna

    2007-05-07

    Summary: We describe a general multiplatform exploratorytool called TreeQ-Vista, designed for presenting functional annotationsin a phylogenetic context. Traits, such as phenotypic and genomicproperties, are interactively queried from a relational database with auser-friendly interface which provides a set of tools for users with orwithout SQL knowledge. The query results are projected onto aphylogenetic tree and can be displayed in multiple color groups. A richset of browsing, grouping and query tools are provided to facilitatetrait exploration, comparison and analysis.Availability: The program,detailed tutorial and examples are available online athttp://genome-test.lbl.gov/vista/TreeQVista.

  17. IQARIS : a tool for the intelligent querying, analysis, and retrieval from information systems.

    SciTech Connect

    Hummel, J. R.; Silver, R. B.

    2002-04-26

    Information glut is one of the primary characteristics of the electronic age. Managing such large volumes of information (e.g., keeping track of the types, where they are, their relationships, who controls them, etc.) can be done efficiently with an intelligent, user-oriented information management system. The purpose of this paper is to describe a concept for managing information resources based on an intelligent information technology system developed by the Argonne National Laboratory for managing digital libraries. The Argonne system, Intelligent Query (IQ), enables users to query digital libraries and view the holdings that match the query from different perspectives.

  18. Deadline-aware energy-efficient query scheduling in Wireless Sensor Networks with mobile sink.

    PubMed

    Karakaya, Murat

    2013-01-01

    Mobile sinks are proposed to save sensor energy spent for multihop communication in transferring data to a base station (sink) in Wireless Sensor Networks. Due to relative low speed of mobile sinks, these approaches are mostly suitable for delay-tolerant applications. In this paper, we study the design of a query scheduling algorithm for query-based data gathering applications using mobile sinks. However, these kinds of applications are sensitive to delays due to specified query deadlines. Thus, the proposed scheduling algorithm aims to minimize the number of missed deadlines while keeping the level of energy consumption at the minimum.

  19. Deadline-Aware Energy-Efficient Query Scheduling in Wireless Sensor Networks with Mobile Sink

    PubMed Central

    2013-01-01

    Mobile sinks are proposed to save sensor energy spent for multihop communication in transferring data to a base station (sink) in Wireless Sensor Networks. Due to relative low speed of mobile sinks, these approaches are mostly suitable for delay-tolerant applications. In this paper, we study the design of a query scheduling algorithm for query-based data gathering applications using mobile sinks. However, these kinds of applications are sensitive to delays due to specified query deadlines. Thus, the proposed scheduling algorithm aims to minimize the number of missed deadlines while keeping the level of energy consumption at the minimum. PMID:23818833

  20. Natural Language Query System Design for Interactive Information Storage and Retrieval Systems. M.S. Thesis

    NASA Technical Reports Server (NTRS)

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

    1985-01-01

    The currently developed multi-level language interfaces of information systems are generally designed for experienced users. These interfaces commonly ignore the nature and needs of the largest user group, i.e., casual users. This research identifies the importance of natural language query system research within information storage and retrieval system development; addresses the topics of developing such a query system; and finally, proposes a framework for the development of natural language query systems in order to facilitate the communication between casual users and information storage and retrieval systems.

  1. Representing and querying conceptual graphs with relational database management systems is possible.

    PubMed Central

    Schadow, G.; Barnes, M. R.; McDonald, C. J.

    2001-01-01

    This is an experimental study on the feasibility of maintaining medical concept dictionaries in production grade relational database management systems (RDBMS.) In the past, RDBMS did not support transitive relational structures and had therefore been unsuitable for managing knowledge bases. The revised SQL-99 standard, however, may change this. In this paper we show that modern RDBMS that support recursive queries are capable of querying transitive relationships in a generic data model. We show a simple but efficient indexed representation of transitive closure. We could confirm that even challenging combined transitive relationships can be queried in SQL. PMID:11825256

  2. SciFinder Scholar 2006: an empirical analysis of research topic query processing.

    PubMed

    Wagner, A Ben

    2006-01-01

    Topical search queries in SciFinder Scholar are processed through an extensive set of natural language processing algorithms that greatly enhance the relevance and comprehensiveness of the search results. Little detailed documentation on these algorithms has been published. However, a careful examination of the highlighted hit terms coupled with a comparison of results from small variations in query language reveal much additional, useful information about these algorithms. An understanding of how these algorithms work can lead to better search results and explain many unexpected results, including differing hit counts for singular versus plural query words and phrases.

  3. Ash Aggregates in Proximal Settings

    NASA Astrophysics Data System (ADS)

    Porritt, L. A.; Russell, K.

    2012-12-01

    Ash aggregates are thought to have formed within and been deposited by the eruption column and plume and dilute density currents and their associated ash clouds. Moist, turbulent ash clouds are considered critical to ash aggregate formation by facilitating both collision and adhesion of particles. Consequently, they are most commonly found in distal deposits. Proximal deposits containing ash aggregates are less commonly observed but do occur. Here we describe two occurrences of vent proximal ash aggregate-rich deposits; the first within a kimberlite pipe where coated ash pellets and accretionary lapilli are found within the intra-vent sequence; and the second in a glaciovolcanic setting where cored pellets (armoured lapilli) occur within <1 km of the vent. The deposits within the A418 pipe, Diavik Diamond Mine, Canada, are the residual deposits within the conduit and vent of the volcano and are characterised by an abundance of ash aggregates. Coated ash pellets are dominant but are followed in abundance by ash pellets, accretionary lapilli and rare cored pellets. The coated ash pellets typically range from 1 - 5 mm in diameter and have core to rim ratios of approximately 10:1. The formation and preservation of these aggregates elucidates the style and nature of the explosive phase of kimberlite eruption at A418 (and other pipes?). First, these pyroclasts dictate the intensity of the kimberlite eruption; it must be energetic enough to cause intense fragmentation of the kimberlite to produce a substantial volume of very fine ash (<62 μm). Secondly, the ash aggregates indicate the involvement of moisture coupled with the presence of dilute expanded eruption clouds. The structure and distribution of these deposits throughout the kimberlite conduit demand that aggregation and deposition operate entirely within the confines of the vent; this indicates that aggregation is a rapid process. Ash aggregates within glaciovolcanic sequences are also rarely documented. The

  4. Fire effects on soil aggregate stability: a review and synthesis

    NASA Astrophysics Data System (ADS)

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

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

  5. Morphology-based Query for Galaxy Image Databases

    NASA Astrophysics Data System (ADS)

    Shamir, Lior

    2017-02-01

    Galaxies of rare morphology are of paramount scientific interest, as they carry important information about the past, present, and future Universe. Once a rare galaxy is identified, studying it more effectively requires a set of galaxies of similar morphology, allowing generalization and statistical analysis that cannot be done when N=1. Databases generated by digital sky surveys can contain a very large number of galaxy images, and therefore once a rare galaxy of interest is identified it is possible that more instances of the same morphology are also present in the database. However, when a researcher identifies a certain galaxy of rare morphology in the database, it is virtually impossible to mine the database manually in the search for galaxies of similar morphology. Here we propose a computer method that can automatically search databases of galaxy images and identify galaxies that are morphologically similar to a certain user-defined query galaxy. That is, the researcher provides an image of a galaxy of interest, and the pattern recognition system automatically returns a list of galaxies that are visually similar to the target galaxy. The algorithm uses a comprehensive set of descriptors, allowing it to support different types of galaxies, and it is not limited to a finite set of known morphologies. While the list of returned galaxies is neither clean nor complete, it contains a far higher frequency of galaxies of the morphology of interest, providing a substantial reduction of the data. Such algorithms can be integrated into data management systems of autonomous digital sky surveys such as the Large Synoptic Survey Telescope (LSST), where the number of galaxies in the database is extremely large. The source code of the method is available at http://vfacstaff.ltu.edu/lshamir/downloads/udat.

  6. Cyber Graph Queries for Geographically Distributed Data Centers

    SciTech Connect

    Berry, Jonathan W.; Collins, Michael; Kearns, Aaron; Phillips, Cynthia A.; Saia, Jared

    2015-05-01

    We present new algorithms for a distributed model for graph computations motivated by limited information sharing we first discussed in [20]. Two or more independent entities have collected large social graphs. They wish to compute the result of running graph algorithms on the entire set of relationships. Because the information is sensitive or economically valuable, they do not wish to simply combine the information in a single location. We consider two models for computing the solution to graph algorithms in this setting: 1) limited-sharing: the two entities can share only a polylogarithmic size subgraph; 2) low-trust: the entities must not reveal any information beyond the query answer, assuming they are all honest but curious. We believe this model captures realistic constraints on cooperating autonomous data centers. We have algorithms in both setting for s - t connectivity in both models. We also give an algorithm in the low-communication model for finding a planted clique. This is an anomaly- detection problem, finding a subgraph that is larger and denser than expected. For both the low- communication algorithms, we exploit structural properties of social networks to prove perfor- mance bounds better than what is possible for general graphs. For s - t connectivity, we use known properties. For planted clique, we propose a new property: bounded number of triangles per node. This property is based upon evidence from the social science literature. We found that classic examples of social networks do not have the bounded-triangles property. This is because many social networks contain elements that are non-human, such as accounts for a business, or other automated accounts. We describe some initial attempts to distinguish human nodes from automated nodes in social networks based only on topological properties.

  7. Labile aggregation stimulating substance, free fatty acids, and platelet aggregation.

    PubMed

    Gerrard, J M; White, J G; Krivit, W

    1976-01-01

    Labile aggregation stimulating substance (LASS), an intermediate produced during platelet biosynthesis of PGE2 and PGF2alpha, acts as a physiologic intercellular messenger to promote platelet aggregation and the release reaction. The activity is formed by intact cells after physiologic stimulation or can be generated from platelet membrane fractions after combination with arachidonate. In the present investigation, small amounts of polyunsaturated fatty acids added to an incubation mixture of platelet microsomes and arachidonate were found to significantly inhibit subsequent platelet aggregation. Saturated and mono-unsaturated fatty acids in the same concentrations were without effect. However, in higher concentrations mono-unsaturated fatty acids were found to be inhibitory and stearic acid was found to enhance subsequent platelet aggregation. The inhibition caused by the polyunsaturated fatty acid, linoleate, was shown to be the result of an effect on the production of LASS through an interaction with the platelet enzyme responsible for conversion of arachidonate to LASS. In contrast, stearic acid was found to enhance platelet aggregation by acting on the platelets and not directly on LASS production. The results suggest that small changes in the fatty acid composition of platelet phospholipids could significantly influence platelet reactivity.

  8. Relative quantity judgments in South American sea lions (Otaria flavescens).

    PubMed

    Abramson, José Z; Hernández-Lloreda, Victoria; Call, Josep; Colmenares, Fernando

    2011-09-01

    There is accumulating evidence that a variety of species possess quantitative abilities although their cognitive substrate is still unclear. This study is the first to investigate whether sea lions (Otaria flavescens), in the absence of training, are able to assess and select the larger of two sets of quantities. In Experiment 1, the two sets of quantities were presented simultaneously as whole sets, that is, the subjects could compare them directly. In Experiment 2, the two sets of quantities were presented item-by-item, and the totality of items was never visually available at the time of choice. For each type of presentation, we analysed the effect of the ratio between quantities, the difference between quantities and the total number of items presented. The results showed that (1) sea lions can make relative quantity judgments successfully and (2) there is a predominant influence of the ratio between quantities on the subjects' performance. The latter supports the idea that an analogue representational mechanism is responsible for sea lions' relative quantities judgments. These findings are consistent with previous reports of relative quantities judgments in other species such as monkeys and apes and suggest that sea lions might share a similar mechanism to compare and represent quantities.

  9. A geochemical module for "AMDTreat" to compute caustic quantity, effluent quantity, and sludge volume

    USGS Publications Warehouse

    Cravotta, Charles A.; Parkhurst, David L.; Means, Brent P; McKenzie, Bob; Morris, Harry; Arthur, Bill

    2010-01-01

    Treatment with caustic chemicals typically is used to increase pH and decrease concentrations of dissolved aluminum, iron, and/or manganese in largevolume, metal-laden discharges from active coal mines. Generally, aluminum and iron can be removed effectively at near-neutral pH (6 to 8), whereas active manganese removal requires treatment to alkaline pH (~10). The treatment cost depends on the specific chemical used (NaOH, CaO, Ca(OH)2, Na2CO3, or NH3) and increases with the quantities of chemical added and sludge produced. The pH and metals concentrations do not change linearly with the amount of chemical added. Consequently, the amount of caustic chemical needed to achieve a target pH and the corresponding effluent composition and sludge volume can not be accurately determined without empirical titration data or the application of geochemical models to simulate the titration of the discharge water with caustic chemical(s). The AMDTreat computer program (http://amd.osmre.gov/ ) is widely used to compute costs for treatment of coal-mine drainage. Although AMDTreat can use results of empirical titration with industrial grade caustic chemicals to compute chemical costs for treatment of net-acidic or net-alkaline mine drainage, such data are rarely available. To improve the capability of AMDTreat to estimate (1) the quantity and cost of caustic chemicals to attain a target pH, (2) the concentrations of dissolved metals in treated effluent, and (3) the volume of sludge produced by the treatment, a titration simulation is being developed using the geochemical program PHREEQC (wwwbrr.cr.usgs.gov/projects/GWC_coupled/phreeqc/) that will be coupled as a module to AMDTreat. The simulated titration results can be compared with or used in place of empirical titration data to estimate chemical quantities and costs. This paper describes the development, evaluation, and potential utilization of the PHREEQC titration module for AMDTreat.

  10. Silica nanoparticles separation from water: aggregation by cetyltrimethylammonium bromide (CTAB).

    PubMed

    Liu, Y; Tourbin, M; Lachaize, S; Guiraud, P

    2013-07-01

    Nanoparticles will inevitably be found in industrial and domestic wastes in the near future and as a consequence soon in water resources. Due to their ultra-small size, nanoparticles may not only have new hazards for environment and human health, but also cause low separation efficiency by classical water treatments processes. Thus, it would be an important challenge to develop a specific treatment with suitable additives for recovery of nanoparticles from waters. For this propose, this paper presents aggregation of silica nanoparticles (Klebosol 30R50 (75nm) and 30R25 (30nm)) by cationic surfactant cetyltrimethylammonium bromide (CTAB). Different mechanisms such as charge neutralization, "depletion flocculation" or "volume-restriction", and "hydrophobic effect" between hydrocarbon tails of CTAB have been proposed to explicate aggregation results. One important finding is that for different volume concentrations between 0.05% and 0.51% of 30R50 suspensions, the same critical coagulation concentration was observed at CTAB=0.1mM, suggesting the optimized quantity of CTAB during the separation process for nanoparticles of about 75nm. Furthermore, very small quantities of CTAB (0.01mM) can make 30R25 nanosilica aggregated due to the "hydrophobic effect". It is then possible to minimize the sludge and allow the separation process as "greener" as possible by studying this case. It has also shown that aggregation mechanisms can be different for very small particles so that a special attention has to be paid to the treatment of nanoparticles contained in water and wastewaters.

  11. Emergence of fractals in aggregation with stochastic self-replication.

    PubMed

    Hassan, Md Kamrul; Hassan, Md Zahedul; Islam, Nabila

    2013-10-01

    We propose and investigate a simple model which describes the kinetics of aggregation of Brownian particles with stochastic self-replication. An exact solution and the scaling theory are presented alongside numerical simulation which fully support all theoretical findings. In particular, we show analytically that the particle size distribution function exhibits dynamic scaling and we verify it numerically using the idea of data collapse. Furthermore, the conditions under which the resulting system emerges as a fractal are found, the fractal dimension of the system is given, and the relationship between this fractal dimension and a conserved quantity is pointed out.

  12. Front Range Infrastructure Resources Project--Aggregate Resources Activities

    USGS Publications Warehouse

    ,

    1998-01-01

    Infrastructure, such as roads, buildings, airports, and dams, is built and maintained by use of large quantities of aggregate—sand, gravel, and stone. As urban areas expand, local sources of these resources become inaccessible. Other competitive land uses have a higher value than aggregate resources. For example, gravel cannot be mined from under a subdivision. The failure to plan for the protection and extraction of infrastructure resources often results in increased consumer cost, environmental damage, and an adversarial relationship between the industry and the community.

  13. Storing, Browsing, Querying, and Sharing Data: the THREDDS Data Repository (TDR)

    NASA Astrophysics Data System (ADS)

    Wilson, A.; Lindholm, D.; Baltzer, T.

    2005-12-01

    The Unidata Internet Data Distribution (IDD) network delivers gigabytes of data per day in near real time to sites across the U.S. and beyond. The THREDDS Data Server (TDS) supports public browsing of metadata and data access via OPeNDAP enabled URLs for datasets such as these. With such large quantities of data, sites generally employ a simple data management policy, keeping the data for a relatively short term on the order of hours to perhaps a week or two. In order to save interesting data in longer term storage and make it available for sharing, a user must move the data herself. In this case the user is responsible for determining where space is available, executing the data movement, generating any desired metadata, and setting access control to enable sharing. This task sequence is generally based on execution of a sequence of low level operating system specific commands with significant user involvement. The LEAD (Linked Environments for Atmospheric Discovery) project is building a cyberinfrastructure to support research and education in mesoscale meteorology. LEAD orchestrations require large, robust, and reliable storage with speedy access to stage data and store both intermediate and final results. These requirements suggest storage solutions that involve distributed storage, replication, and interfacing to archival storage systems such as mass storage systems and tape or removable disks. LEAD requirements also include metadata generation and access in order to support querying. In support of both THREDDS and LEAD requirements, Unidata is designing and prototyping the THREDDS Data Repository (TDR), a framework for a modular data repository to support distributed data storage and retrieval using a variety of back end storage media and interchangeable software components. The TDR interface will provide high level abstractions for long term storage, controlled, fast and reliable access, and data movement capabilities via a variety of technologies such as

  14. SYBYL line notation (SLN): a single notation to represent chemical structures, queries, reactions, and virtual libraries.

    PubMed

    Homer, R Webster; Swanson, Jon; Jilek, Robert J; Hurst, Tad; Clark, Robert D

    2008-12-01

    SYBYL line notation (SLN) is a powerful way to represent molecular structures, reactions, libraries of structures, molecular fragments, formulations, molecular queries, and reaction queries. Nearly any chemical structure imaginable, including macromolecules, pharmaceuticals, catalysts, and even combinatorial libraries can be represented as an SLN string. The language provides a rich syntax for database queries comparable to SMARTS. It provides full Markush, R-Group, reaction, and macro atom capabilities in a single unified notation. It includes the ability to specify 3D conformations and 2D depictions. All the information necessary to recreate the structure in a modeling or drawing package is present in a single, concise string of ASCII characters. This makes SLN ideal for structure communication over global computer networks between applications sitting at remote sites. Unlike SMILES and its derivatives, SLN accomplishes this within a single unified syntax. Structures, queries, compounds, reactions, and virtual libraries can all be represented in a single notation.

  15. Spatial Queries Entity Recognition and Disambiguation Using Rule-Based Approach

    NASA Astrophysics Data System (ADS)

    Hamzei, E.; Hakimpour, F.; Forati, A.

    2015-12-01

    In the digital world, search engines have been proposed as one of challenging research areas. One of the main issues in search engines studies is query processing, which its aim is to understand user's needs. If unsuitable spatial query processing approach is employed, the results will be associated with high degree of ambiguity. To evade such degree of ambiguity, in this paper we present a new algorithm which depends on rule-based systems to process queries. Our algorithm is implemented in the three basic steps including: deductively iterative splitting the query; finding candidates for the location names, the location types and spatial relationships; and finally checking the relationships logically and conceptually using a rule based system. As we finally present in the paper using our proposed method have two major advantages: the search engines can provide the capability of spatial analysis based on the specific process and secondly because of its disambiguation technique, user reaches the more desirable result.

  16. On the evaluation of fuzzy quantified queries in a database management system

    NASA Technical Reports Server (NTRS)

    Bosc, Patrick; Pivert, Olivier

    1992-01-01

    Many propositions to extend database management systems have been made in the last decade. Some of them aim at the support of a wider range of queries involving fuzzy predicates. Unfortunately, these queries are somewhat complex and the question of their efficiency is a subject under discussion. In this paper, we focus on a particular subset of queries, namely those using fuzzy quantified predicates. More precisely, we will consider the case where such predicates apply to individual elements as well as to sets of elements. Thanks to some interesting properties of alpha-cuts of fuzzy sets, we are able to show that the evaluation of these queries can be significantly improved with respect to a naive strategy based on exhaustive scans of sets or files.

  17. An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network

    PubMed Central

    Jung, HaRim; Kim, Ung-Mo

    2014-01-01

    Given a set of positive-weighted points and a query rectangle r (specified by a client) of given extents, the goal of a maximizing range sum (MaxRS) query is to find the optimal location of r such that the total weights of all the points covered by r are maximized. All existing methods for processing MaxRS queries assume the Euclidean distance metric. In many location-based applications, however, the motion of a client may be constrained by an underlying (spatial) road network; that is, the client cannot move freely in space. This paper addresses the problem of processing MaxRS queries in a road network. We propose the external-memory algorithm that is suited for a large road network database. In addition, in contrast to the existing methods, which retrieve only one optimal location, our proposed algorithm retrieves all the possible optimal locations. Through simulations, we evaluate the performance of the proposed algorithm. PMID:25152915

  18. Practical private database queries based on a quantum-key-distribution protocol

    SciTech Connect

    Jakobi, Markus; Simon, Christoph; Gisin, Nicolas; Bancal, Jean-Daniel; Branciard, Cyril; Walenta, Nino; Zbinden, Hugo

    2011-02-15

    Private queries allow a user, Alice, to learn an element of a database held by a provider, Bob, without revealing which element she is interested in, while limiting her information about the other elements. We propose to implement private queries based on a quantum-key-distribution protocol, with changes only in the classical postprocessing of the key. This approach makes our scheme both easy to implement and loss tolerant. While unconditionally secure private queries are known to be impossible, we argue that an interesting degree of security can be achieved by relying on fundamental physical principles instead of unverifiable security assumptions in order to protect both the user and the database. We think that the scope exists for such practical private queries to become another remarkable application of quantum information in the footsteps of quantum key distribution.

  19. A coding method for efficient subgraph querying on vertex- and edge-labeled graphs.

    PubMed

    Zhu, Lei; Song, Qinbao; Guo, Yuchen; Du, Lei; Zhu, Xiaoyan; Wang, Guangtao

    2014-01-01

    Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world. Unfortunately, subgraph querying is very time consuming since it involves subgraph isomorphism testing that is known to be an NP-complete problem. In this paper, we propose a novel coding method for subgraph querying that is based on Laplacian spectrum and the number of walks. Our method follows the filtering-and-verification framework and works well on graph databases with frequent updates. We also propose novel two-step filtering conditions that can filter out most false positives and prove that the two-step filtering conditions satisfy the no-false-negative requirement (no dismissal in answers). Extensive experiments on both real and synthetic graphs show that, compared with six existing counterpart methods, our method can effectively improve the efficiency of subgraph querying.

  20. Indexing and querying moving objects with uncertain speed and direction in spatiotemporal databases

    NASA Astrophysics Data System (ADS)

    Huang, Yuan-Ko

    2014-04-01

    Efficient processing of spatiotemporal queries over moving objects with uncertainty has become imperative due to the increasing need for real-time information in highly dynamic environments. Most of the existing approaches focus on designing an index structure for managing moving objects with uncertainty and then utilize it to improve the query performance. All the proposed indexes, however, have their own limitations. In this paper, we devote to developing an efficient index, named the R lsd - tree, to index moving objects with uncertain speed and direction varying within respective known ranges. We design several pruning criteria combined with the R lsd -tree to answer the probabilistic range queries. Moreover, two models, the sampling-based probability model and the ER-based probability model, are proposed to quantify the possibility of each object being the query result. Finally, a thorough experimental evaluation is conducted to show the merits of the proposed techniques.