Science.gov

Sample records for aggregate query quantities

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

    ERIC Educational Resources Information Center

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

    2003-01-01

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

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

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

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

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

    PubMed

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

    2014-12-01

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

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

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

  8. Distributed Queries of Large Numerical Data Sets

    NASA Technical Reports Server (NTRS)

    Nemes, Richard M.

    1998-01-01

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

  9. Translating relational queries into iterative programs

    SciTech Connect

    Freytag, J.C.

    1987-01-01

    This book investigates the problem of translating relational queries into iterative programs using methods and techniques from the areas of functional programming and program transformation. The first part presents two algorithms which generate iterative programs from algebra-based query specifications. While the first algorithm is based on the transformation of recursive programs, the second uses functional expressions to generate the final iterative form. In the second part the same techniques generate efficient programs for the evaluation of aggregate functions in relational database systems. In several steps, programs which perform aggregation after sorting, are transformed into programs which perform aggregation while sorting. The third part then investigates the Lisp-dialect T as a possible implementation language for database systems.

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

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

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

  13. Retrieval with gene queries

    PubMed Central

    Sehgal, Aditya K; Srinivasan, Padmini

    2006-01-01

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

  14. Manchester visual query language

    NASA Astrophysics Data System (ADS)

    Oakley, John P.; Davis, Darryl N.; Shann, Richard T.

    1993-04-01

    We report a database language for visual retrieval which allows queries on image feature information which has been computed and stored along with images. The language is novel in that it provides facilities for dealing with feature data which has actually been obtained from image analysis. Each line in the Manchester Visual Query Language (MVQL) takes a set of objects as input and produces another, usually smaller, set as output. The MVQL constructs are mainly based on proven operators from the field of digital image analysis. An example is the Hough-group operator which takes as input a specification for the objects to be grouped, a specification for the relevant Hough space, and a definition of the voting rule. The output is a ranked list of high scoring bins. The query could be directed towards one particular image or an entire image database, in the latter case the bins in the output list would in general be associated with different images. We have implemented MVQL in two layers. The command interpreter is a Lisp program which maps each MVQL line to a sequence of commands which are used to control a specialized database engine. The latter is a hybrid graph/relational system which provides low-level support for inheritance and schema evolution. In the paper we outline the language and provide examples of useful queries. We also describe our solution to the engineering problems associated with the implementation of MVQL.

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

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

  17. Condorcet Query Engine: A Query Engine for Coordinated Index Terms.

    ERIC Educational Resources Information Center

    Van der Vet, Paul E.; Mars, Nicolaas J. I.

    1999-01-01

    Coordinated index concepts are compound-index concepts that express a relationship between concepts that function as simple subject descriptors. The Condorcet Query Engine, a prototype query engine that can be run over the World Wide Web, demonstrates the feasibility of a query engine that can handle both simple and coordinated index concepts,…

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

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

  20. Automatic Construction of Information Queries.

    ERIC Educational Resources Information Center

    Grzelak, Hanna; Kowalski, Kazimierz

    1983-01-01

    Presents methods of information query building in selective dissemination of information systems based on user's publications and examines possible compatibility between user's information queries and his publications. Methods of information query construction determined by logical operators AND, OR, NOT and set of weighted keywords are described.…

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

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

  3. Smart Query Answering for Marine Sensor Data

    PubMed Central

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

    2011-01-01

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

  4. Smart query answering for marine sensor data.

    PubMed

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

    2011-01-01

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

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

  6. Priming the Query Specification Process.

    ERIC Educational Resources Information Center

    Toms, Elaine G.; Freund, Luanne

    2003-01-01

    Tests the use of questions as a technique in the query specification process. Using a within-subjects design, 48 people interacted with a modified Google interface to solve four information problems in four domains. Half the tasks were entered as typical keyword queries, and half as questions or statements. Results suggest the typical search box…

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

  8. Query cardiac pain.

    PubMed

    Todd, J W

    1983-08-01

    Query cardiac pain is a common problem, and immense efforts are made to solve it. No test can prove that a patient has not had a cardiac infarct, though in the recent past eminent authorities wrongly stated that a normal ECG supplied this proof. This history is by far the most important means of interpreting recurrent pain. Coronary arteriography is only useful in diagnosis when the pain is certainly due to myocardial ischaemia but it is uncertain whether this is caused by coronary artery disease or some other cardiac lesion. In practice, much pain is not diagnosed. This need be no cause for concern, and patients who in fact have had a small cardiac infarct gain rather than lose if wrongly reassured of its non-existence. The history of cardiology is a depressing catalogue of error. Bogus cardiac diseases have been diagnosed on an enormous scale, mainly because attention has been concentrated on the cardiac manifestations, while the patient was ignored. Much "excluding" is fatuous. Because treatment was derived from theory, treatment for patients who had had cardiac infarcts was disastrous. The great error at present is to overvalue technology.

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

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

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

  12. KSRQuerying: XML Keyword with Recursive Querying

    NASA Astrophysics Data System (ADS)

    Taha, Kamal; Elmasri, Ramez

    We propose an XML search engine called KSRQuerying. The search engine employs recursive querying techniques, which allows a query to query the results of a previous application of itself or of another query. It answers recursive queries, keyword-based queries, and loosely structured queries. KSRQuerying uses a sort-merge algorithm, which selects subsets from the set of nodes containing keywords, where each subset contains the smallest number of nodes that: (1) are closely related to each other, and (2) contain at least one occurrence of each keyword. We experimentally evaluated the quality and efficiency of KSRQuerying and compared it with 3 systems: XSeek, Schema-Free XQuery, and XKSearch.

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

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

    PubMed Central

    Weber, Griffin M

    2013-01-01

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

  15. Query Expansion Using Heterogeneous Thesauri.

    ERIC Educational Resources Information Center

    Mandala, Rila; Tokunaga, Takenobu; Tanaka, Hozumi

    2000-01-01

    Proposes a method to improve the performance of information retrieval systems by expanding queries using heterogeneous thesauri. Experiments show that using heterogeneous thesauri with an appropriate weighting method results in better retrieval performance than using only one type of thesaurus. (Author/LRW)

  16. Automatically Preparing Safe SQL Queries

    NASA Astrophysics Data System (ADS)

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

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

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

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

  19. The use of SNOMED CT simplifies querying of a clinical data warehouse.

    PubMed

    Lieberman, Michael I; Ricciardi, Thomas N; Masarie, F E; Spackman, Kent A

    2003-01-01

    The usefulness of digital clinical information is limited by difficulty in accessing that information. Information in electronic medical records (EMR) must be entered and stored at the appropriate level of granularity for individual patient care. However, benefits such as outcomes research and decision support require aggregation to clinical data -- "heart disease" as opposed to "S/P MI 1997" for example. The hierarchical relationships in an external reference terminology, such as SNOMED, can facilitate aggregation. This study examines whether by leveraging the knowledge built into SNOMED's hierarchical structure, one can simplify the query process without degrading the query results.

  20. Querying non-materialized ontology views.

    PubMed

    Detwiler, Landon T; Brinkley, James F

    2007-01-01

    One approach to simplifying ontologies, for inclusion in a more tractable semantic web, is through the use of non-materialized view queries. View queries define how a simplified "view" or "application" ontology is derived from larger more complex ontologies. In this work we look at a language for specifying view queries over OWL/RDFS sources, and we illustrate some initial ideas for how to execute user queries over our view ontology, without materializing it first.

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

  2. Szegedy's quantum walk with queries

    NASA Astrophysics Data System (ADS)

    Santos, Raqueline A. M.

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

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

    PubMed

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

    2011-01-01

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

  4. Strongly intensive quantities

    SciTech Connect

    Gorenstein, M. I.; Gazdzicki, M.

    2011-07-15

    Analysis of fluctuations of hadron production properties in collisions of relativistic particles profits from use of measurable intensive quantities which are independent of system size variations. The first family of such quantities was proposed in 1992; another is introduced in this paper. Furthermore we present a proof of independence of volume fluctuations for quantities from both families within the framework of the grand canonical ensemble. These quantities are referred to as strongly intensive ones. Influence of conservation laws and resonance decays is also discussed.

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

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

  7. Restricting query relaxation through user constraints

    SciTech Connect

    Gaasterland, T.

    1993-07-01

    This paper describes techniques to restrict and to heuristically control relaxation of deductive database queries. The process of query relaxation provides a user with a means to automatically identify new queries that are related to the user`s original query. However, for large databases, many relaxations may be possible. The methods to control and restrict the relaxation process introduced in this paper focus the relaxation process and make it more efficient. User restrictions over the data base domain may be expressed as user constraints. This paper describes how user constraints can restrict relaxed queries. Also, a set of heuristics based on cooperative answering techniques are presented for controlling the relaxation process. Finally, the interaction of the methods for relaxing queries, processing user constraints, and applying the heuristic rules is described.

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

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

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

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

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

  13. Flexible Querying of Lifelong Learner Metadata

    ERIC Educational Resources Information Center

    Poulovassilis, A.; Selmer, P.; Wood, P. T.

    2012-01-01

    This paper discusses the provision of flexible querying facilities over heterogeneous data arising from lifelong learners' educational and work experiences. A key aim of such querying facilities is to allow learners to identify possible choices for their future learning and professional development by seeing what others have done. We motivate and…

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

    PubMed

    Singh, Jagendra; Sharan, Aditi

    2015-01-01

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

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

  16. Querying metabolism under different physiological constraints.

    PubMed

    Cakmak, Ali; Ozsoyoglu, Gultekin; Hanson, Richard W

    2010-04-01

    Metabolism is a representation of the biochemical principles that govern the production, consumption, degradation, and biosynthesis of metabolites in living cells. Organisms respond to changes in their physiological conditions or environmental perturbations (i.e. constraints) via cooperative implementation of such principles. Querying inner working principles of metabolism under different constraints provides invaluable insights for both researchers and educators. In this paper, we propose a metabolism query language (MQL) and discuss its query processing. MQL enables researchers to explore the behavior of the metabolism with a wide-range of predicates including dietary and physiological condition specifications. The query results of MQL are enriched with both textual and visual representations, and its query processing is completely tailored based on the underlying metabolic principles. PMID:20401946

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

    ERIC Educational Resources Information Center

    Bordogna, G; And Others

    1991-01-01

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

  18. Radiation quantities and units

    SciTech Connect

    Not Available

    1980-04-15

    This report supersedes ICRU Report 19. Since ICRU Report 19 was published, a number of discussions have taken place between members of the Report Committee on Fundamental Quantities and Units and other workers in the field. Some of these discussions have resulted in the acceptance of certain modifications in the material set out in Report 19 and these modifications are incorporated in the current report. In addition, there has been some expansion and rearrangement of the material in the earlier report. In line, with providing more didactic material and useful source material for other ICRU reports, the general considerations in subsection 1.A of Report 19 have been expanded and placed in a separate subsection. The additional material includes discussions of four terms that are used in this document - quantity, unit, stochastic, and non-stochastic - along with a brief discussion of the mathematical formalism used in ICRU reports. As in ICRU Report 19, the definitions of quantities and units specifically designed for radiation protection (Part B) are separated from those of the general quantities (Part A). The inclusion of the index concept outlined in ICRU Report 25(4) required an extension of Part B.

  19. Quantities, Units, and Symbols.

    ERIC Educational Resources Information Center

    Royal Society, London (England).

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

  20. Query-By-Keywords (QBK): Query Formulation Using Semantics and Feedback

    NASA Astrophysics Data System (ADS)

    Telang, Aditya; Chakravarthy, Sharma; Li, Chengkai

    The staples of information retrieval have been querying and search, respectively, for structured and unstructured repositories. Processing queries over known, structured repositories (e.g., Databases) has been well-understood, and search has become ubiquitous when it comes to unstructured repositories (e.g., Web). Furthermore, searching structured repositories has been explored to a limited extent. However, there is not much work in querying unstructured sources. We argue that querying unstructured sources is the next step in performing focused retrievals. This paper proposed a new approach to generate queries from search-like inputs for unstructured repositories. Instead of burdening the user with schema details, we believe that pre-discovered semantic information in the form of taxonomies, relationship of keywords based on context, and attribute & operator compatibility can be used to generate query skeletons. Furthermore, progressive feedback from users can be used to improve the accuracy of query skeletons generated.

  1. Spatial information semantic query based on SPARQL

    NASA Astrophysics Data System (ADS)

    Xiao, Zhifeng; Huang, Lei; Zhai, Xiaofang

    2009-10-01

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

  2. Construction aggregates

    USGS Publications Warehouse

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

    2000-01-01

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

  3. Construction aggregates

    USGS Publications Warehouse

    Tepordei, V.V.

    1994-01-01

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

  4. Path querying system on mobile devices

    NASA Astrophysics Data System (ADS)

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

    2006-01-01

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

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

  6. Business information query expansion through semantic network

    NASA Astrophysics Data System (ADS)

    Gong, Zhiguo; Muyeba, Maybin; Guo, Jingzhi

    2010-02-01

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

  7. Interactive Graphical Queries for Bibliographic Search.

    ERIC Educational Resources Information Center

    Brooks, Martin; Campbell, Jennifer

    1999-01-01

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

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

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

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

  11. Querying and tasking in sensor networks

    NASA Astrophysics Data System (ADS)

    Jaikaeo, Chaiporn; Srisathapornphat, Chavalit; Shen, Chien-Chung

    2000-08-01

    With the advancement of hardware technology, it becomes feasible to develop a networked system of pervasive computing platforms that combine programmable general purpose computers with multiple sensing and wireless communication capability. This networked system of programmable sensor nodes, together called a sensor network, poses unique challenges on how information collected by and stored within the sensor network should be queried and accessed, and how concurrent sensing tasks should be programmed from external clients. In this paper, we describe an architecture that facilitates querying and tasking of sensor networks. The key idea to the architecture lies in the development of the Sensor Querying and Tasking Language (SQTL) and the corresponding Sensor Execution Environment (SEE). We model a sensor network as a distributed set of collaborating nodes that carry out querying and tasking activities programmed in SQTL. A frontend node injects a message, that encapsulates an SQTL program, into a sensor node and starts a diffusion computation. A sensor node may diffuse the encapsulated SQTL program to other nodes as dictated by its logic and collaborately perform the specified querying or tasking activity. We will present the SQTL language and demonstrate its applicability using a maximum temperature querying application and a vehicle tracking application.

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

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

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

    NASA Astrophysics Data System (ADS)

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

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

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

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

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

  18. An advanced web query interface for biological databases.

    PubMed

    Latendresse, Mario; Karp, Peter D

    2010-07-06

    Although most web-based biological databases (DBs) offer some type of web-based form to allow users to author DB queries, these query forms are quite restricted in the complexity of DB queries that they can formulate. They can typically query only one DB, and can query only a single type of object at a time (e.g. genes) with no possible interaction between the objects--that is, in SQL parlance, no joins are allowed between DB objects. Writing precise queries against biological DBs is usually left to a programmer skillful enough in complex DB query languages like SQL. We present a web interface for building precise queries for biological DBs that can construct much more precise queries than most web-based query forms, yet that is user friendly enough to be used by biologists. It supports queries containing multiple conditions, and connecting multiple object types without using the join concept, which is unintuitive to biologists. This interactive web interface is called the Structured Advanced Query Page (SAQP). Users interactively build up a wide range of query constructs. Interactive documentation within the SAQP describes the schema of the queried DBs. The SAQP is based on BioVelo, a query language based on list comprehension. The SAQP is part of the Pathway Tools software and is available as part of several bioinformatics web sites powered by Pathway Tools, including the BioCyc.org site that contains more than 500 Pathway/Genome DBs.

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

  20. Construction aggregates

    USGS Publications Warehouse

    Tepordei, V.V.

    1993-01-01

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

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

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

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

    PubMed Central

    Teng, Rui; Zhang, Bing

    2011-01-01

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

  4. On-demand information retrieval in sensor networks with localised query and energy-balanced data collection.

    PubMed

    Teng, Rui; Zhang, Bing

    2011-01-01

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

  5. Construction aggregates

    USGS Publications Warehouse

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

    2001-01-01

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

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

  7. Spatial relation query based on geographic ontology

    NASA Astrophysics Data System (ADS)

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

    2010-11-01

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

  8. Normalized Legal Drafting and the Query Method.

    ERIC Educational Resources Information Center

    Allen, Layman E.; Engholm, C. Rudy

    1978-01-01

    Normalized legal drafting, a mode of expressing ideas in legal documents so that the syntax that relates the constituent propositions is simplified and standardized, and the query method, a question-asking activity that teaches normalized drafting and provides practice, are examined. Some examples are presented. (JMD)

  9. Visualizing multidimensional query results using animation

    NASA Astrophysics Data System (ADS)

    Sawant, Amit P.; Healey, Christopher G.

    2008-01-01

    Effective representation of large, complex collections of information (datasets) presents a difficult challenge. Visualization is a solution that uses a visual interface to support efficient analysis and discovery within the data. Our primary goal in this paper is a technique that allows viewers to compare multiple query results representing user-selected subsets of a multidimensional dataset. We present an algorithm that visualizes multidimensional information along a space-filling spiral. Graphical glyphs that vary their position, color, and texture appearance are used to represent attribute values for the data elements in each query result. Guidelines from human perception allow us to construct glyphs that are specifically designed to support exploration, facilitate the discovery of trends and relationships both within and between data elements, and highlight exceptions. A clustering algorithm applied to a user-chosen ranking attribute bundles together similar data elements. This encapsulation is used to show relationships across different queries via animations that morph between query results. We apply our techniques to the MovieLens recommender system, to demonstrate their applicability in a real-world environment, and then conclude with a simple validation experiment to identify the strengths and limitations of our design, compared to a traditional side-by-side visualization.

  10. DTI data modeling for unlimited query support

    NASA Astrophysics Data System (ADS)

    Siadat, Mohammad-Reza; Hammad, Rafat; Shetty, Anil; Soltanian-Zadeh, Hamid; Sethi, Ishwar K.; Eetemadi, Ameen; Elisevich, Kost V.

    2009-02-01

    This paper describes Data Modeling for unstructured data of Diffusion Tensor Imaging (DTI). Data Modeling is an essential first step for data preparation in any data management and data mining procedure. Conventional Entity- Relational (E-R) data modeling is lossy, irreproducible, and time-consuming especially when dealing with unstructured image data associated with complex systems like the human brain. We propose a methodological framework for more objective E-R data modeling with unlimited query support by eliminating the structured content-dependent metadata associated with the unstructured data. The proposed method is applied to DTI data and a minimum system is implemented accordingly. Eventually supported with navigation, data fusion, and feature extraction modules, the proposed system provides a content-based support environment (C-BASE). Such an environment facilitates an unlimited query support with a reproducible and efficient database schema. Switching between different modalities of data, while confining the feature extractors within the object(s) of interest, we supply anatomically specific query results. The price of such a scheme is relatively large storage and in some cases high computational cost. The data modeling and its mathematical framework, behind the scene of query executions and the user interface of the system are presented in this paper.

  11. MPEG-7 multimedia-based query format

    NASA Astrophysics Data System (ADS)

    Chang, Wo

    2006-08-01

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

  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. Cumulative Query Method for Influenza Surveillance Using Search Engine Data

    PubMed Central

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

    2014-01-01

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

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

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

    PubMed

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

    2013-12-01

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

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

    PubMed Central

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

    1990-01-01

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

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

    PubMed

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

    2012-01-01

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

  18. Leveraging user query sessions to improve searching of medical literature.

    PubMed

    Cheng, Shiwen; Hristidis, Vagelis; Weiner, Michael

    2013-01-01

    Published reports about searching medical literature do not refer to leveraging the query context, as expressed by previous queries in a session. We aimed to assess novel strategies for context-aware searching, hypothesizing that this would be better than baseline. Building upon methods using term frequency-inverse document frequency, we added extensions such as a function incorporating search results and terms of previous queries, with higher weights for more recent queries. Among 60 medical students generating queries against the TREC 9 benchmark dataset, we assessed recall and mean average precision. For difficult queries, we achieved improvement (27%) in average precision over baseline. Improvements in recall were also seen. Our methods outperformed baseline by 4% to 14% on average. Furthermore, the effectiveness of context-aware search was greater for longer query sessions, which are typically more challenging. In conclusion, leveraging the previous queries in a session improved overall search quality with this biomedical database.

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

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

  2. Ontology-based aggregation of biological pathway datasets.

    PubMed

    Jiang, Keyuan; Nash, Christopher

    2005-01-01

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

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

  4. Approximate Shortest Path Queries Using Voronoi Duals

    NASA Astrophysics Data System (ADS)

    Honiden, Shinichi; Houle, Michael E.; Sommer, Christian; Wolff, Martin

    We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi dual of the original graph, using the selected nodes as Voronoi sites. This overlay graph allows for fast computation of approximate shortest paths for general, undirected graphs. The time-quality tradeoff decision can be made at query time. We provide bounds on the approximation ratio of the path lengths as well as experimental results. The theoretical worst-case approximation ratio is bounded by a logarithmic factor. Experiments show that our approximation method based on Voronoi duals has extremely fast preprocessing time and efficiently computes reasonably short paths.

  5. Quantity Stickiness versus Stackelberg Leadership

    NASA Astrophysics Data System (ADS)

    Ferreira, F. A.

    2008-10-01

    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.

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

  7. Remotely queried wireless embedded microsensors in composites

    NASA Astrophysics Data System (ADS)

    Krantz, Donald G.; Belk, John H.

    1997-05-01

    Embedding sensors in structural composites has been a topic of research in recent years. Embedded sensors can be used to monitor and optimize the manufacturing process, to monitor performance during use, and for structural health monitoring in high-performance applications. To date, optical fiber sensors have been the principal sensing technique for these applications. There are well-known problems with optical fiber sensors, including high manufacturing costs, fragility, the need to provide ingress and egress from the structure, and the interdependence of strain and temperature measurements. The US Naval Research Laboratory is funding a multi-disciplinary team to develop micro-machined sensors and an associated remote-querying capability to allow self- contained microsensors to be embedded in a composite structure and queried using methods that do not require physical connections. The sensors are to be left in place for the lifetime of the structure, are powered by the querying apparatus, and require no penetrations through the surface of the structure. Part of this work included studying electromagnetic propagation into graphite-epoxy (conductive) composites. A key part of this research has been the development of embeddable antennae that can operate within a conductive composite matrix with the efficiency required to both absorb power for the circuitry and to transmit and receive data. This paper describes the integrated approach taken to realize the goal of an interrogatable strain rosette that is embedded 0.25' into a graphite composite plate. Aspects of the sensors, the transponder, and the antenna are also covered.

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

    NASA Astrophysics Data System (ADS)

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

    2009-12-01

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

  9. Assisting Consumer Health Information Retrieval with Query Recommendations

    PubMed Central

    Zeng, Qing T.; Crowell, Jonathan; Plovnick, Robert M.; Kim, Eunjung; Ngo, Long; Dibble, Emily

    2006-01-01

    Objective: Health information retrieval (HIR) on the Internet has become an important practice for millions of people, many of whom have problems forming effective queries. We have developed and evaluated a tool to assist people in health-related query formation. Design: We developed the Health Information Query Assistant (HIQuA) system. The system suggests alternative/additional query terms related to the user's initial query that can be used as building blocks to construct a better, more specific query. The recommended terms are selected according to their semantic distance from the original query, which is calculated on the basis of concept co-occurrences in medical literature and log data as well as semantic relations in medical vocabularies. Measurements: An evaluation of the HIQuA system was conducted and a total of 213 subjects participated in the study. The subjects were randomized into 2 groups. One group was given query recommendations and the other was not. Each subject performed HIR for both a predefined and a self-defined task. Results: The study showed that providing HIQuA recommendations resulted in statistically significantly higher rates of successful queries (odds ratio = 1.66, 95% confidence interval = 1.16–2.38), although no statistically significant impact on user satisfaction or the users' ability to accomplish the predefined retrieval task was found. Conclusion: Providing semantic-distance-based query recommendations can help consumers with query formation during HIR. PMID:16221944

  10. Thermal quantities of 46Ti

    NASA Astrophysics Data System (ADS)

    Rahmatinejad, A.; Razavi, R.; Kakavand, T.

    2015-07-01

    Thermodynamic quantities of 46Ti have been calculated in the framework of the BCS model with inclusion of modified nuclear pairing gap (MPBCS) that was proposed in our previous publication. Using modified paring gap results in an S-shaped heat capacity curve at critical temperature with a smooth behavior instead of singular behavior of the same curve in the BCS calculations. In addition the thermal quantities have been extracted within the framework of a canonical ensemble according to the new experimental data on nuclear level densities measured by the Oslo group. Comparison shows a good agreement between our calculations in MPBCS and the extracted quantities in the canonical ensemble framework.

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

  12. Strategies for Estimating Discrete Quantities.

    ERIC Educational Resources Information Center

    Crites, Terry W.

    1993-01-01

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

  13. Query Specific Rank Fusion for Image Retrieval.

    PubMed

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

    2015-04-01

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

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

  15. Querying genomic databases: refining the connectivity map.

    PubMed

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

    2012-01-01

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

  16. Medical knowledge evolution query constraining aspects.

    PubMed

    Eklund, Ann-Marie

    2011-01-01

    In this paper we present a first analysis towards better understanding of the query constraining aspects of knowledge, as expressed in the most used public medical bibliographic database MEDLINE. Our results indicate, possibly not surprising, that new terms occur, but also that traditional terms are replaced by more specific ones or even go out of use as they become common knowledge. Hence, as knowledge evolve over time, search methods may benefit from becoming more sensitive to knowledge expression, to enable finding new, as well as older, relevant database contents.

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

  18. Learning virulent proteins from integrated query networks

    PubMed Central

    2012-01-01

    Background Methods of weakening and attenuating pathogens’ abilities to infect and propagate in a host, thus allowing the natural immune system to more easily decimate invaders, have gained attention as alternatives to broad-spectrum targeting approaches. The following work describes a technique to identifying proteins involved in virulence by relying on latent information computationally gathered across biological repositories, applicable to both generic and specific virulence categories. Results A lightweight method for data integration is used, which links information regarding a protein via a path-based query graph. A method of weighting is then applied to query graphs that can serve as input to various statistical classification methods for discrimination, and the combined usage of both data integration and learning methods are tested against the problem of both generalized and specific virulence function prediction. Conclusions This approach improves coverage of functional data over a protein. Moreover, while depending largely on noisy and potentially non-curated data from public sources, we find it outperforms other techniques to identification of general virulence factors and baseline remote homology detection methods for specific virulence categories. PMID:23198735

  19. Applied research in remotely queried embedded microsensors

    NASA Astrophysics Data System (ADS)

    Krantz, Donald G.; Belk, John H.; Dubow, Joel; Hautamaki, Charles; Mantell, Susan C.; Polla, Dennis L.; Zurn, Shayne M.

    1998-07-01

    Sensors embedded in structural composites have been a topic of research in recent years. Embedded sensors can be used to monitor and optimize the manufacturing process, to monitor performance during use, and for structural health monitoring in high-performance applications. For several years, embedded optical fibers were the predominant type of sensor. There are well-known reasons that optical fiber sensors have not yet been fully embraced in industry including primarily the cost of equipment and sensors, the fragility of the optical fiber itself, and the need to provide ingress and egress from the structure. Recent work by the authors and others has produced prototype wireless electronic sensors of various types that address these shortcomings. The US Office of Naval Research is funding a multi-disciplinary team to consolidate progress made in earlier programs towards self- contained microsensors to be embedded in a composite structure and queried using methods that do not require physical connections. The sensors are to be left in place for the lifetime of the structure, are powered by the querying apparatus, and require no penetrations through the surface of the structure. This paper describes the integrated approach taken to realize the goal of an interrogatable strain rosette that is embedded 0.25' into a graphite composite plate. It also describes the progress to date of the sensor system itself.

  20. Characterizing the Time-Perspective of Nations with Search Engine Query Data

    PubMed Central

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

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

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

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

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

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

    PubMed

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

    2016-01-01

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

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

    PubMed Central

    Gomathi, Ramalingam; Sharmila, Dhandapani

    2014-01-01

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

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

    PubMed

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

    2011-01-01

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

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

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

    SciTech Connect

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

    2005-12-07

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

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

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

  14. Research on land information web query service for public

    NASA Astrophysics Data System (ADS)

    Liang, Dongdong; Li, Lin; Song, Pingchao; Cheng, Yang; Mei, Song; Min, Yuan

    2009-10-01

    With economics developing fast and internet spreading extensively, the public strongly desire to know about land information. Especially, the policy, Land registration information available to the public inquiry approach, has been executed since March 1st, 2003, which gives the Land Department with guidance to build land information web query service for public. Land information web query service for public requires Land Management Department to provide land registration information which contains attribute and graphics information. When it comes to querying attribute information, precise and fuzzy query methods are commonly used in realistic applications. To improve the speed and accuracy of fuzzy query, Chinese word segmentation method is currently used. Especially, there is no previous example by this method used in cadastre information inquiry. Meanwhile, as for querying lands' spatial information, it is necessary to query attribute information before retrieving the actual graphics information. Then turning to the map service, eagle eye can show which part of whole cadastre map the specified cadastre land located in. But it is obvious the display speed of eagle eye is not as fast as that of cadastre map. Hence, we try to implement the multi-level query with frame selection on cadastre map and identify the different cadastre land with different colors, as eagle eye's display and panning speed are also accelerated. The accomplishments of our research have been applied to Land information query system of Ningbo. It is hoped that the solutions in this system will help to develop and study analogous issues.

  15. PAQ: Persistent Adaptive Query Middleware for Dynamic Environments

    NASA Astrophysics Data System (ADS)

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

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

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

  17. Distributed Query Plan Generation Using Multiobjective Genetic Algorithm

    PubMed Central

    Panicker, Shina; Vijay Kumar, T. V.

    2014-01-01

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

  18. TQuery: a context-sensitive temporal query language.

    PubMed

    Kahn, M G; Tu, S; Fagan, L M

    1991-10-01

    Users of electronic medical databases request pertinent information by recasting their clinical questions into a formal database query language. Because the query language is the user's only access to the data, the query language must be powerful enough to enable users to express their data requirements. However, a competing need is for the query language to be restrictive enough so that queries can have unambiguous semantics and the query processor can generate correct answers. We describe a query language, called TQuery , that was designed specifically to formulate database queries that are dependent on temporal and contextual relationships. TQuery specifications express contextual constraints without the need to explicitly reference calendar dates. TQuery is the database query language used to retrieve patient data from an object-oriented electronic patient medical-record system called the temporal network (TNET). TNET and TQuery were developed to support the real-time temporal reasoning and representation needs of a LISP workstation-based medical expert system. PMID:1743002

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

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

  1. Quantity Estimation Of The Interactions

    SciTech Connect

    Gorana, Agim; Malkaj, Partizan; Muda, Valbona

    2007-04-23

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

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

  3. Measuring persistence of implementation: QUERI Series

    PubMed Central

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

    2008-01-01

    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). PMID:18430200

  4. Compressed bitmap indices for efficient query processing

    SciTech Connect

    Wu, Kesheng; Otoo, Ekow; Shoshani, Arie

    2001-09-30

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

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

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

  7. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

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

  8. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

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

  9. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

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

  10. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

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

  11. 7 CFR 985.12 - Salable quantity.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

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

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

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

  14. Study of Message Text Formats: Bibliographic Search Queries.

    ERIC Educational Resources Information Center

    Long, Philip L.

    This report presents an analysis of the search query arguments of several major bibliographic utilities and shows the commonalities and differences of the query structure among the various systems. The report illustrates a symbolic metalanguage that was developed to describe and compare the search arguments. In addition, status and error messages…

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

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

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

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

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

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

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

    ERIC Educational Resources Information Center

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

    2002-01-01

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

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

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

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

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

  6. Massive Query Resolution for Rapid Selective Dissemination of Information.

    ERIC Educational Resources Information Center

    Cohen, Jonathan D.

    1999-01-01

    Outlines an efficient approach to performing query resolution which, when matched with a keyword scanner, offers rapid selecting and routing for massive Boolean queries, and which is suitable for implementation on a desktop computer. Demonstrates the system's operation with large examples in a practical setting. (AEF)

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

  8. Collision simulation of sintered dust aggregates

    NASA Astrophysics Data System (ADS)

    Sirono, Sin-iti; Ueno, Haruta

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

  9. Recursive Query Facilities in Relational Databases: A Survey

    NASA Astrophysics Data System (ADS)

    Przymus, Piotr; Boniewicz, Aleksandra; Burzańska, Marta; Stencel, Krzysztof

    The relational model is the basis for most modern databases, while SQL is the most commonly used query language. However, there are data structures and computational problems that cannot be expressed using SQL-92 queries. Among them are those concerned with the bill-of-material and corporate hierarchies. A newer standard, called the SQL-99, introduced recursive queries which can be used to solve such tasks. Yet, only recently recursive queries have been implemented in most of the leading relational databases. In this paper we have reviewed and compared implementations of the recursive queries defined by SQL:1999 through SQL:2008 and offered by leading vendors of DBMSs. Our comparison concerns features, syntax and performance.

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

    PubMed

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

    2015-02-01

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

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

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

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

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

  15. Query by image example: The CANDID approach

    SciTech Connect

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

    1995-02-01

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

  16. Query-Driven Visualization and Analysis

    SciTech Connect

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

    2012-11-01

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

  17. A Relation Routing Scheme for Distributed Semantic Media Query

    PubMed Central

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

    2013-01-01

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

  18. Summarization of Text Document Using Query Dependent Parsing Techniques

    NASA Astrophysics Data System (ADS)

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

    2010-11-01

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

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

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

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

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

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

    PubMed

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

    2016-04-01

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

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

    PubMed

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

    2016-04-01

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

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

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

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

  9. Capturing the Meaning of Internet Search Queries by Taxonomy Mapping

    NASA Astrophysics Data System (ADS)

    Tikk, Domonkos; Kardkovács, Zsolt T.; Bánsághi, Zoltán

    Capturing the meaning of internet search queries can significantly improve the effectiveness of search retrieval. Users often have problem to find relevant answer to their queries, particularly, when the posted query is ambiguous. The orientation of the user can be greatly facilitated, if answers are grouped into topics of a fixed subject taxonomy. In this manner, the original problem can be transformed to the labelling of queries — and consequently, the answers — with the topic names. Thus the original problem is transformed into a classification set-up. This paper introduces our Ferrety algorithm that performs topic assignment, which also works when there is no directly available training data that describes the semantics of the subject taxonomy. The approach is presented via the example of ACM KDD Cup 2005 problem, where Ferrety was awarded for precision and creativity.

  10. Cluster Analysis and Fuzzy Query in Ship Maintenance and Design

    NASA Astrophysics Data System (ADS)

    Che, Jianhua; He, Qinming; Zhao, Yinggang; Qian, Feng; Chen, Qi

    Cluster analysis and fuzzy query win wide-spread applications in modern intelligent information processing. In allusion to the features of ship maintenance data, a variant of hypergraph-based clustering algorithm, i.e., Correlation Coefficient-based Minimal Spanning Tree(CC-MST), is proposed to analyze the bulky data rooting in ship maintenance process, discovery the unknown rules and help ship maintainers make a decision on various device fault causes. At the same time, revising or renewing an existed design of ship or device maybe necessary to eliminate those device faults. For the sake of offering ship designers some valuable hints, a fuzzy query mechanism is designed to retrieve the useful information from large-scale complicated and reluctant ship technical and testing data. Finally, two experiments based on a real ship device fault statistical dataset validate the flexibility and efficiency of the CC-MST algorithm. A fuzzy query prototype demonstrates the usability of our fuzzy query mechanism.

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

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ...) Name; (2) Sex; (3) Race; (4) Complete date of birth; and (5) State of residence. (b) A unique numeric... place of birth. At the option of the querying agency, these additional identifiers may also be...

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

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

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

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

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

    PubMed

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

    2016-01-01

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

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

  18. High Performance Visualization using Query-Driven Visualizationand Analytics

    SciTech Connect

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

    2006-06-15

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

  19. Query by pictionary: an alternative to medical image retrieval.

    PubMed

    Macura, K J; Macura, R T

    1995-01-01

    This paper focuses on the visual interface for image retrieval from radiology image database and describes a Radiologic Pictionary. A Radiologic Pictionary is a picture-based controlled vocabulary that allows visual query formulation by providing the user with images (samplers) that are linked to the hierarchical index of radiological findings and mapped into image data within the database. Samplers selected during query formulation point to image records that share their characteristics; all matching images are returned to the user.

  20. Path Query Processing in Large-Scale XML Databases

    NASA Astrophysics Data System (ADS)

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

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

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

    NASA Astrophysics Data System (ADS)

    Adams, Norman H.; Wakefield, Gregory H.

    2005-09-01

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

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

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

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

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 16 Commercial Practices 1 2010-01-01 2010-01-01 false Net quantity, average quantity, permitted... REGULATIONS UNDER SECTION 4 OF THE FAIR PACKAGING AND LABELING ACT § 500.25 Net quantity, average quantity... average of the quantities in the packages comprising a shipment or other delivery of the commodity...

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

    PubMed

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

    2010-12-28

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

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

  7. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

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

  8. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

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

  9. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

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

  10. 40 CFR 201.21 - Quantities measured.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

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

  11. 40 CFR 201.21 - Quantities measured.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

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

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

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

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

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

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

  17. 30 CFR 75.325 - Air quantity.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

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

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

  19. Aggregated Indexing of Biomedical Time Series Data

    PubMed Central

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

    2016-01-01

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

  20. Asymmetric discounting in intertemporal choice: a query-theory account.

    PubMed

    Weber, E U; Johnson, E J; Milch, K F; Chang, H; Brodscholl, J C; Goldstein, D G

    2007-06-01

    People are impatient and discount future rewards more when they are asked to delay consumption than when they are offered the chance to accelerate consumption. The three experiments reported here provide a process-level account for this asymmetry, with implications for designing decision environments that promote less impulsivity. In Experiment 1, a thought-listing procedure showed that people decompose discount valuation into two queries. Whether one considers delayed or accelerated receipt of a gift certificate influences the order in which memory is queried to support immediate versus delayed consumption, and the order of queries affects the relative number of patient versus impatient thoughts. Relative frequency and clustering of impatient thoughts predicts discounting and mediates the discounting asymmetry. Experiment 2 implicated query order causally: When participants listed reasons for immediate versus delayed consumption in the order used spontaneously in acceleration and delay decisions, the discounting asymmetry was replicated; reversing the order in which reasons were listed eliminated the asymmetry. The results of Experiment 3, which used an implicit-memory task, support a memory-interference account of the effect of query order.

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

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

  3. Learning unions of boxes with membership and equivalence queries

    SciTech Connect

    Goldberg, P.W.; Goldman, S.A.; Mathias, H.D.

    1994-07-01

    The authors present two algorithms that use membership and equivalence queries to exactly identify the concepts given by the union of s discretized axis-parallel boxes in d-dimensional discretized Euclidean space where there are n discrete values that each coordinate can have. The first algorithm receives at most sd counterexamples and uses time and membership queries polynomial in s and log n for d any constant. Further, all equivalence queries made can be formulated as the union of O(sd log(s)) axis-parallel boxes. Next, they introduce a new complexity measure that better captures the complexity of a union of boxes than simply the number of boxes and dimensions. Their new measure, {sigma}, is the number of segments in the target polyhedron where a segment is a maximum portion of one of the sides of the polyhedron that lies entirely inside or entirely outside each of the other halfspaces defining the polyhedron. They then present an improvement of their first algorithm that uses time and queries polynomial in {sigma} and log n. The hypothesis class used here is decision trees of height at most 2sd. Further they can show that the time and queries used by this algorithm are polynomial in d and log n for s any constant thus generalizing the exact learnability of DNF formulas with a constant number of terms. In fact, this single algorithm is efficient for either s or d constant.

  4. Using medline queries to generate image retrieval tasks for benchmarking.

    PubMed

    Müller, Henning; Kalpathy-Cramer, Jayashree; Hersh, William; Geissbuhler, Antoine

    2008-01-01

    Medical visual information retrieval has been a very active research area over the past ten years as an increasing amount of images is produced digitally and made available in the electronic patient record. Tools are required to give access to the images and exploit the information inherently stored in medical cases including images. To compare image retrieval techniques of research prototypes based on the same data and tasks, ImageCLEF was started in 2003 and a medical task was added in 2004. Since then, every year a database was distributed, tasks developed, and systems compared based on realistic search tasks and large databases. For the year 2007 a set of almost 68,000 images was distributed among 38 research groups registered for the medical retrieval task. Realistic query topics were developed based on a log file of Medline. This log file contains the queries performed on Pubmed during 24 hours. Most queries could not be used as search topics directly as they do not contain image-related themes, but a few thousand do. Other types of queries had to be filtered out as well, as many stated information needs are very vague; for evaluation on the other hand clear and focused topics are necessary to obtain a limited number of relevant documents and limit ambiguity in the evaluation process. In the end, 30 queries were developed and 13 research groups submitted a total of 149 runs using a large variety of techniques, from textual to purely visual retrieval and multi-modal approaches.

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

    PubMed

    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

  6. Parallel Index and Query for Large Scale Data Analysis

    SciTech Connect

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

    2011-07-18

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

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

  8. Topography of samples with variably aggregated metal particles

    NASA Astrophysics Data System (ADS)

    Schönauer, D.; Kreibig, U.

    1985-06-01

    A proper description of the optical (and other) properties of small particle samples containing clusters of interacting particles requires detailed information on the cluster topography. We present such an investigation performed on samples which were prepared from Au particle hydrosols, the clustering being controlled by addition of stabilizing agents. Numerical results are submitted for interdependencies between the number, the size and shape of aggregates and a Hausdorff dimension of 1.7 ± 0.2 is determined. Proper quantities are given, to detect even very low amounts of aggregation. There are indications that such samples may be modeled by introducing a few prototypic aggregates.

  9. Varieties of quantity estimation in children.

    PubMed

    Sella, Francesco; Berteletti, Ilaria; Lucangeli, Daniela; Zorzi, Marco

    2015-06-01

    In the number-to-position task, with increasing age and numerical expertise, children's pattern of estimates shifts from a biased (nonlinear) to a formal (linear) mapping. This widely replicated finding concerns symbolic numbers, whereas less is known about other types of quantity estimation. In Experiment 1, Preschool, Grade 1, and Grade 3 children were asked to map continuous quantities, discrete nonsymbolic quantities (numerosities), and symbolic (Arabic) numbers onto a visual line. Numerical quantity was matched for the symbolic and discrete nonsymbolic conditions, whereas cumulative surface area was matched for the continuous and discrete quantity conditions. Crucially, in the discrete condition children's estimation could rely either on the cumulative area or numerosity. All children showed a linear mapping for continuous quantities, whereas a developmental shift from a logarithmic to a linear mapping was observed for both nonsymbolic and symbolic numerical quantities. Analyses on individual estimates suggested the presence of two distinct strategies in estimating discrete nonsymbolic quantities: one based on numerosity and the other based on spatial extent. In Experiment 2, a non-spatial continuous quantity (shades of gray) and new discrete nonsymbolic conditions were added to the set used in Experiment 1. Results confirmed the linear patterns for the continuous tasks, as well as the presence of a subset of children relying on numerosity for the discrete nonsymbolic numerosity conditions despite the availability of continuous visual cues. Overall, our findings demonstrate that estimation of numerical and non-numerical quantities is based on different processing strategies and follow different developmental trajectories.

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

    PubMed

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

    2014-01-01

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

  11. Metadata-driven Ad Hoc Query of Patient Data

    PubMed Central

    Deshpande, Aniruddha M.; Brandt, Cynthia; Nadkarni, Prakash M.

    2002-01-01

    Clinical study data management systems (CSDMSs) have many similarities to clinical patient record systems (CPRSs) in their focus on recording clinical parameters. Requirements for ad hoc query interfaces for both systems would therefore appear to be highly similar. However, a clinical study is concerned primarily with collective responses of groups of subjects to standardized therapeutic interventions for the same underlying clinical condition. The parameters that are recorded in CSDMSs tend to be more diverse than those required for patient management in non-research settings, because of the greater emphasis on questionnaires for which responses to each question are recorded separately. The differences between CSDMSs and CPRSs are reflected in the metadata that support the respective systems' operation, and need to be reflected in the query interfaces. The authors describe major revisions of their previously described CSDMS ad hoc query interface to meet CSDMS needs more fully, as well as its porting to a Web-based platform. PMID:12087118

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

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

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

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

    PubMed

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

    2008-01-01

    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.

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

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

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

    PubMed

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

    2009-01-01

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

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

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

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

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

  3. Monotonically improving approximate answers to relational algebra queries

    NASA Technical Reports Server (NTRS)

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

    1989-01-01

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

  4. Quantities and units in radiation protection dosimetry

    NASA Astrophysics Data System (ADS)

    Jennings, W. A.

    1994-08-01

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

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

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

  7. Quantity Discrimination in Domestic Rats, Rattus norvegicus.

    PubMed

    Cox, Laura; Montrose, V Tamara

    2016-01-01

    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

  8. Cell aggregation and sedimentation.

    PubMed

    Davis, R H

    1995-01-01

    The aggregation of cells into clumps or flocs has been exploited for decades in such applications as biological wastewater treatment, beer brewing, antibiotic fermentation, and enhanced sedimentation to aid in cell recovery or retention. More recent research has included the use of cell aggregation and sedimentation to selectively separate subpopulations of cells. Potential biotechnological applications include overcoming contamination, maintaining plasmid-bearing cells in continuous fermentors, and selectively removing nonviable hybridoma cells from perfusion cultures.

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

    NASA Astrophysics Data System (ADS)

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

    2015-05-01

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

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

  11. Study of query expansion techniques and their application in the biomedical information retrieval.

    PubMed

    Rivas, A R; Iglesias, E L; Borrajo, L

    2014-01-01

    Information Retrieval focuses on finding documents whose content matches with a user query from a large document collection. As formulating well-designed queries is difficult for most users, it is necessary to use query expansion to retrieve relevant information. Query expansion techniques are widely applied for improving the efficiency of the textual information retrieval systems. These techniques help to overcome vocabulary mismatch issues by expanding the original query with additional relevant terms and reweighting the terms in the expanded query. In this paper, different text preprocessing and query expansion approaches are combined to improve the documents initially retrieved by a query in a scientific documental database. A corpus belonging to MEDLINE, called Cystic Fibrosis, is used as a knowledge source. Experimental results show that the proposed combinations of techniques greatly enhance the efficiency obtained by traditional queries.

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

  13. 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... LABELING ACT § 500.19 Conversion of SI metric quantities to inch/pound quantities and inch/pound...

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

  15. Project Lefty: More Bang for the Search Query

    ERIC Educational Resources Information Center

    Varnum, Ken

    2010-01-01

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

  16. Restructuring Large Data Hierarchies for Scientific Query Tools

    SciTech Connect

    Thomas, M

    2005-02-08

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

  17. Aspects of endowment: a query theory of value construction.

    PubMed

    Johnson, Eric J; Häubl, Gerald; Keinan, Anat

    2007-05-01

    How do people judge the monetary value of objects? One clue is provided by the typical endowment study (D. Kahneman, J. L. Knetsch, & R. H. Thaler, 1991), in which participants are randomly given either a good, such as a coffee mug, that they may later sell ("sellers") or a choice between the good and amounts of cash ("choosers"). Sellers typically demand at least twice as much as choosers, inconsistent with economic theory. This result is usually explained by an increased weighting of losses, or loss aversion. The authors provide a memory-based account of endowment, suggesting that people construct values by posing a series of queries whose order differs for sellers and choosers. Because of output interference, these queries retrieve different aspects of the object and the medium of exchange, producing different valuations. The authors show that the content and structure of the recalled aspects differ for selling and choosing and that these aspects predict valuations. Merely altering the order in which queries are posed can eliminate the endowment effect, and changing the order of queries can produce endowment-like effects without ownership.

  18. 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. PMID:15961440

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

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

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

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

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

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

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

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

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

    PubMed

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

    2013-01-01

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

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

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

  10. A Viewpoint on the Quantity "Plane Angle"

    NASA Astrophysics Data System (ADS)

    Eder, W. E.

    1982-01-01

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

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

  12. Technology meets aggregate

    SciTech Connect

    Wilson, C.; Swan, C.

    2007-07-01

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

  13. Dynamics of cell aggregates fusion: Experiments and simulations

    NASA Astrophysics Data System (ADS)

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

    2014-02-01

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

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

  15. Lighting Quantity and Quality in Educational Facilities.

    ERIC Educational Resources Information Center

    Elwazanim, Salim A.

    1998-01-01

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

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

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

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

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

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

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

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

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

  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. An Analysis of Image Queries in the Field of Art History.

    ERIC Educational Resources Information Center

    Chen, Hsin-liang

    2001-01-01

    Investigates end-users' queries by comparing the features of the queries to those identified in previous. Participants, 29 college students majoring in art history, were required to finish a term paper including at least 20 images. Participants' image queries were collected by pre- and post-search questionnaires, and three human reviewers mapped…

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

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

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

  10. Spatial grid services for adaptive spatial query optimization

    NASA Astrophysics Data System (ADS)

    Gao, Bingbo; Xie, Chuanjie; Sheng, Wentao

    2008-10-01

    Spatial information sharing and integration has now become an important issue of Geographical Information Science (GIS). Web Service technologies provide a easy and standard way to share spatial resources over network, and grid technologies which aim at sharing resources such as data, storage, and computational powers can help the sharing go deeper. However, the dynamic characteristic of grid brings complexity to spatial query optimization which is more stressed in GIS domain because spatial operations are both CPU intensive and data intensive. To address this problem, a new grid framework is employed to provide standard spatial services which can also manage and report their state information to the coordinator which is responsible for distributed spatial query optimization.

  11. Persuading consumers to form precise search engine queries.

    PubMed

    Leroy, Gondy

    2009-11-14

    Today's search engines provide a single textbox for searching. This input method has not changed in decades and, as a result, consumer search behaviour has not changed either: few and imprecise keywords are used. Especially with health information, where incorrect information may lead to unwise decisions, it would be beneficial if consumers could search more precisely. We evaluated a new user interface that supports more precise searching by using query diagrams. In a controlled user study, using paper-based prototypes, we compared searching with a Google interface with drawing new or modifying template diagrams. We evaluated consumer willingness and ability to use diagrams and the impact on query formulation. Users had no trouble understanding the new search method. Moreover, they used more keywords and relationships between keywords with search diagrams. In comparison to drawing their own diagrams, modifying existing templates led to more searches being conducted and higher creativity in searching.

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

  13. Influence of mineral aggregates on the rheological properties of concrete mixture

    NASA Astrophysics Data System (ADS)

    Klovas, A.; Daukšys, M.

    2015-04-01

    The aim of this research was to determine how the change of concrete mixture constituents: concentration of fine and coarse aggregate as well as the amount of fine particles, not exceeding 0.25 mm, influence concrete mixture's rheological properties. Firstly, inner- concentration of fine aggregate (sand, fraction of 0/1 and 0/4) was changed. Secondly, coarse aggregate (gravel, fraction of 4/16) concentration was changed and finally, the amount of fine particles was changed. Results have shown that with the increase of sand (fraction of 0/1) quantity, the plastic viscosity also increased. On the other hand, yield stress, at the beginning decreased, but eventually - increased. The increase of coarse aggregate quantity acted differently: plastic viscosity and yield stress decreased. Finally, the increase of fine particles quantity decreased the plastic viscosity as well as yield stress of concrete mixture.

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

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

    NASA Astrophysics Data System (ADS)

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

    2013-12-01

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

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

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

    PubMed

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

    2016-02-01

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

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

  19. NEOview: Near Earth Object Data Discovery and Query

    NASA Astrophysics Data System (ADS)

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

    2013-10-01

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

  20. Monitoring influenza epidemics in china with search query from baidu.

    PubMed

    Yuan, Qingyu; Nsoesie, Elaine O; Lv, Benfu; Peng, Geng; Chunara, Rumi; Brownstein, John S

    2013-01-01

    Several approaches have been proposed for near real-time detection and prediction of the spread of influenza. These include search query data for influenza-related terms, which has been explored as a tool for augmenting traditional surveillance methods. In this paper, we present a method that uses Internet search query data from Baidu to model and monitor influenza activity in China. The objectives of the study are to present a comprehensive technique for: (i) keyword selection, (ii) keyword filtering, (iii) index composition and (iv) modeling and detection of influenza activity in China. Sequential time-series for the selected composite keyword index is significantly correlated with Chinese influenza case data. In addition, one-month ahead prediction of influenza cases for the first eight months of 2012 has a mean absolute percent error less than 11%. To our knowledge, this is the first study on the use of search query data from Baidu in conjunction with this approach for estimation of influenza activity in China.

  1. Scheduling in Heterogeneous Computing Environments for Proximity Queries.

    PubMed

    Kim, Duksu; Lee, Jinkyu; Lee, Junghwan; Shin, Insik; Kim, John; Yoon, Sunggeui

    2013-04-01

    We present a novel, Linear Programming (LP) based scheduling algorithm that exploits heterogeneous multi-core architectures such as CPUs and GPUs to accelerate a wide variety of proximity queries. To represent complicated performance relationships between heterogeneous architectures and different computations of proximity queries, we propose a simple, yet accurate model that measures the expected running time of these computations. Based on this model, we formulate an optimization problem that minimizes the largest time spent on computing resources, and propose a novel, iterative LP-based scheduling algorithm. Since our method is general, we are able to apply our method into various proximity queries that have different characteristics. Our method achieves an order of magnitude performance improvement by using four different GPUs and two hexa-core CPUs over using a hexa-core CPU only. Unlike prior scheduling methods, our method continually improves the performance, as we add more computing resources. Also, our method achieves much higher performance improvement compared with prior methods as heterogeneity of computing resources is increased. We also show that our method provides results that are close to the performance provided by a conservative upper bound of the ideal throughput. These results demonstrate the efficiency and robustness of our algorithm that have not been achieved by prior methods.

  2. The Framework for Approximate Queries on Simulation Data

    SciTech Connect

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

    2001-09-27

    AQSim is a system intended to enable scientists to query and analyze a large volume of scientific simulation data. The system uses the state of the art in approximate query processing techniques to build a novel framework for progressive data analysis. These techniques are used to define a multi-resolution index, where each node contains multiple models of the data. The benefits of these models are two-fold: (1) they are compact representations, reconstructing only the information relevant to the analysis, and (2) the variety of models capture different aspects of the data which may be of interest to the user but are not readily apparent in their raw form. To be able to deal with the data interactively, AQSim allows the scientist to make an informed tradeoff between query response accuracy and time. In this paper, we present the framework of AQSim with a focus on its architectural design. We also show the results from an initial proof-of-concept prototype developed at LLNL. The presented framework is generic enough to handle more than just simulation data.

  3. Monitoring Influenza Epidemics in China with Search Query from Baidu

    PubMed Central

    Lv, Benfu; Peng, Geng; Chunara, Rumi; Brownstein, John S.

    2013-01-01

    Several approaches have been proposed for near real-time detection and prediction of the spread of influenza. These include search query data for influenza-related terms, which has been explored as a tool for augmenting traditional surveillance methods. In this paper, we present a method that uses Internet search query data from Baidu to model and monitor influenza activity in China. The objectives of the study are to present a comprehensive technique for: (i) keyword selection, (ii) keyword filtering, (iii) index composition and (iv) modeling and detection of influenza activity in China. Sequential time-series for the selected composite keyword index is significantly correlated with Chinese influenza case data. In addition, one-month ahead prediction of influenza cases for the first eight months of 2012 has a mean absolute percent error less than 11%. To our knowledge, this is the first study on the use of search query data from Baidu in conjunction with this approach for estimation of influenza activity in China. PMID:23750192

  4. Scheduling in Heterogeneous Computing Environments for Proximity Queries.

    PubMed

    Kim, Duksu; Lee, Jinkyu; Lee, Junghwan; Shin, Insik; Kim, John; Yoon, Sunggeui

    2013-04-01

    We present a novel, Linear Programming (LP) based scheduling algorithm that exploits heterogeneous multi-core architectures such as CPUs and GPUs to accelerate a wide variety of proximity queries. To represent complicated performance relationships between heterogeneous architectures and different computations of proximity queries, we propose a simple, yet accurate model that measures the expected running time of these computations. Based on this model, we formulate an optimization problem that minimizes the largest time spent on computing resources, and propose a novel, iterative LP-based scheduling algorithm. Since our method is general, we are able to apply our method into various proximity queries that have different characteristics. Our method achieves an order of magnitude performance improvement by using four different GPUs and two hexa-core CPUs over using a hexa-core CPU only. Unlike prior scheduling methods, our method continually improves the performance, as we add more computing resources. Also, our method achieves much higher performance improvement compared with prior methods as heterogeneity of computing resources is increased. We also show that our method provides results that are close to the performance provided by a conservative upper bound of the ideal throughput. These results demonstrate the efficiency and robustness of our algorithm that have not been achieved by prior methods. PMID:23568962

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

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

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

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

  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. A Query Tool Enabling Clinicians and Researchers to Explore Patient Cohorts.

    PubMed

    Lim Choi Keung, Sarah N; Khan, Omar; Asadipour, Ali; Dereli, Huseyin; Zhao, Lei; Robbins, Tim; Arvanitis, Theodoros N

    2015-01-01

    Due to the increasing amount of health information being gathered and the potential benefit of data reuse, it is now becoming a necessity for tools, which collect and analyse this data, to support integration of heterogeneous datasets, as well as provide intuitive user interfaces, which allow clinicians and researchers to query the data without needing to form complex SQL queries. The West Midlands Query Tool consists of an easy-to-use graph-based GUI, which interacts with a flexible middleware application. It has the main objective of querying heterogeneous data sources for exploring patient cohorts through a query builder and criteria set. PMID:26152952

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

    PubMed

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

    2016-01-01

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

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

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

    PubMed

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

    2016-01-01

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

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

    PubMed

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

    2016-01-01

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

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

    PubMed Central

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

    2016-01-01

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

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

    PubMed

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

    2016-01-01

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

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

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

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

  1. Nonuniversal quantities from dual renormalization group transformations.

    PubMed

    Meurice, Y; Niermann, S

    1999-09-01

    Using a simplified version of the renormalization group (RG) transformation of Dyson's hierarchical model, we show that one can calculate all the nonuniversal quantities entering into the scaling laws by combining an expansion about the high-temperature fixed point with a dual expansion about the critical point. The magnetic susceptibility is expressed in terms of two dual quantities transforming covariantly under an RG transformation and has a smooth behavior in the high-temperature limit. Using the analogy with Hamiltonian mechanics, the simplified example discussed here is similar to the anharmonic oscillator, while more realistic examples can be thought of as coupled oscillators, allowing resonance phenomena. PMID:11970062

  2. Physical quantities involved in a Mueller matrix

    NASA Astrophysics Data System (ADS)

    Gil, José J.

    2016-05-01

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

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

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

    ERIC Educational Resources Information Center

    Chung, EunKyung; Yoon, JungWon

    2009-01-01

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

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

    PubMed Central

    Pentoney, Christopher; Harwell, Jeff; Leroy, Gondy

    2014-01-01

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

  6. Development and validation of queries using structured query language (SQL) to determine the utilization of comparison imaging in radiology reports stored on PACS.

    PubMed

    Lakhani, Paras; Menschik, Elliot D; Goldszal, Alberto F; Murray, Joseph P; Weiner, Mark G; Langlotz, Curtis P

    2006-03-01

    The purpose of this research was to develop queries that quantify the utilization of comparison imaging in free-text radiology reports. The queries searched for common phrases that indicate whether comparison imaging was utilized, not available, or not mentioned. The queries were iteratively refined and tested on random samples of 100 reports with human review as a reference standard until the precision and recall of the queries did not improve significantly between iterations. Then, query accuracy was assessed on a new random sample of 200 reports. Overall accuracy of the queries was 95.6%. The queries were then applied to a database of 1.8 million reports. Comparisons were made to prior images in 38.69% of the reports (693,955/1,793,754), were unavailable in 18.79% (337,028/1,793,754), and were not mentioned in 42.52% (762,771/1,793,754). The results show that queries of text reports can achieve greater than 95% accuracy in determining the utilization of prior images.

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

    PubMed

    Pentoney, Christopher; Harwell, Jeff; Leroy, Gondy

    2014-01-01

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

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

  9. Dynamics of fire ant aggregations

    NASA Astrophysics Data System (ADS)

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

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

  10. Scheduling in heterogeneous computing environments for proximity queries.

    PubMed

    Kim, Duksu; Lee, Jinkyu; Lee, Junghwan; Shin, Insik; Kim, John; Yoon, Sung-Eui

    2013-09-01

    We present a novel, linear programming (LP)-based scheduling algorithm that exploits heterogeneous multicore architectures such as CPUs and GPUs to accelerate a wide variety of proximity queries. To represent complicated performance relationships between heterogeneous architectures and different computations of proximity queries, we propose a simple, yet accurate model that measures the expected running time of these computations. Based on this model, we formulate an optimization problem that minimizes the largest time spent on computing resources, and propose a novel, iterative LP-based scheduling algorithm. Since our method is general, we are able to apply our method into various proximity queries used in five different applications that have different characteristics. Our method achieves an order of magnitude performance improvement by using four different GPUs and two hexa-core CPUs over using a hexa-core CPU only. Unlike prior scheduling methods, our method continually improves the performance, as we add more computing resources. Also, our method achieves much higher performance improvement compared with prior methods as heterogeneity of computing resources is increased. Moreover, for one of tested applications, our method achieves even higher performance than a prior parallel method optimized manually for the application. We also show that our method provides results that are close (e.g., 75 percent) to the performance provided by a conservative upper bound of the ideal throughput. These results demonstrate the efficiency and robustness of our algorithm that have not been achieved by prior methods. In addition, we integrate one of our contributions with a work stealing method. Our version of the work stealing method achieves 18 percent performance improvement on average over the original work stealing method. This result shows wide applicability of our approach.

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

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

  13. Scheduling in heterogeneous computing environments for proximity queries.

    PubMed

    Kim, Duksu; Lee, Jinkyu; Lee, Junghwan; Shin, Insik; Kim, John; Yoon, Sung-Eui

    2013-09-01

    We present a novel, linear programming (LP)-based scheduling algorithm that exploits heterogeneous multicore architectures such as CPUs and GPUs to accelerate a wide variety of proximity queries. To represent complicated performance relationships between heterogeneous architectures and different computations of proximity queries, we propose a simple, yet accurate model that measures the expected running time of these computations. Based on this model, we formulate an optimization problem that minimizes the largest time spent on computing resources, and propose a novel, iterative LP-based scheduling algorithm. Since our method is general, we are able to apply our method into various proximity queries used in five different applications that have different characteristics. Our method achieves an order of magnitude performance improvement by using four different GPUs and two hexa-core CPUs over using a hexa-core CPU only. Unlike prior scheduling methods, our method continually improves the performance, as we add more computing resources. Also, our method achieves much higher performance improvement compared with prior methods as heterogeneity of computing resources is increased. Moreover, for one of tested applications, our method achieves even higher performance than a prior parallel method optimized manually for the application. We also show that our method provides results that are close (e.g., 75 percent) to the performance provided by a conservative upper bound of the ideal throughput. These results demonstrate the efficiency and robustness of our algorithm that have not been achieved by prior methods. In addition, we integrate one of our contributions with a work stealing method. Our version of the work stealing method achieves 18 percent performance improvement on average over the original work stealing method. This result shows wide applicability of our approach. PMID:23846096

  14. CALL, Prewriting Strategies, and EFL Writing Quantity

    ERIC Educational Resources Information Center

    Shafiee, Sajad; Koosha, Mansour; Afghar, Akbar

    2015-01-01

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

  15. Measurement of gas quantities by liquid displacement.

    NASA Technical Reports Server (NTRS)

    Christian, J. D.

    1973-01-01

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

  16. 7 CFR 35.13 - Minimum quantity.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 2 2010-01-01 2010-01-01 false Minimum quantity. 35.13 Section 35.13 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing Practices), DEPARTMENT OF AGRICULTURE COMMODITY STANDARDS AND STANDARD CONTAINER REGULATIONS EXPORT...

  17. 40 CFR 201.21 - Quantities measured.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 40 Protection of Environment 26 2013-07-01 2013-07-01 false Quantities measured. 201.21 Section 201.21 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) NOISE ABATEMENT PROGRAMS NOISE EMISSION STANDARDS FOR TRANSPORTATION EQUIPMENT; INTERSTATE RAIL CARRIERS Measurement...

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

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

  2. Infants Make Quantity Discriminations for Substances

    ERIC Educational Resources Information Center

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

    2012-01-01

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

  3. Quantity language speakers show enhanced subcortical processing.

    PubMed

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

    2016-07-01

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

  4. Quantity language speakers show enhanced subcortical processing.

    PubMed

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

    2016-07-01

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

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

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

  7. Practice Makes Perfect: Contracting Quantity and Quality.

    ERIC Educational Resources Information Center

    Reichert, Nancy

    2003-01-01

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

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

  9. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 8 2011-01-01 2011-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...

  10. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 7 Agriculture 8 2012-01-01 2012-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...

  11. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 8 2014-01-01 2014-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...

  12. 7 CFR 966.53 - Minimum quantities.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 8 2013-01-01 2013-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...

  13. Query Results Clustering by Extending SPARQL with CLUSTER BY

    NASA Astrophysics Data System (ADS)

    Ławrynowicz, Agnieszka

    The task of dynamic clustering of the search results proved to be useful in the Web context, where the user often does not know the granularity of the search results in advance. The goal of this paper is to provide a declarative way for invoking dynamic clustering of the results of queries submitted over Semantic Web data. To achieve this goal the paper proposes an approach that extends SPARQL by clustering abilities. The approach introduces a new statement, CLUSTER BY, into the SPARQL grammar and proposes semantics for such extension.

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

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

  16. PSS-SQL: protein secondary structure - structured query language.

    PubMed

    Mrozek, Dariusz; Wieczorek, Dominika; Malysiak-Mrozek, Bozena; Kozielski, Stanislaw

    2010-01-01

    Secondary structure representation of proteins provides important information regarding protein general construction and shape. This representation is often used in protein similarity searching. Since existing commercial database management systems do not offer integrated exploration methods for biological data e.g. at the level of the SQL language, the structural similarity searching is usually performed by external tools. In the paper, we present our newly developed PSS-SQL language, which allows searching a database in order to identify proteins having secondary structure similar to the structure specified by the user in a PSS-SQL query. Therefore, we provide a simple and declarative language for protein structure similarity searching.

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

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

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

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

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

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

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

  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. Incentives for Delay-Constrained Data Query and Feedback in Mobile Opportunistic Crowdsensing.

    PubMed

    Liu, Yang; Li, Fan; Wang, Yu

    2016-01-01

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

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

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

  8. Kinetics of protein aggregation

    NASA Astrophysics Data System (ADS)

    Knowles, Tuomas

    2015-03-01

    Aggregation into linear nanostructures, notably amyloid and amyloid-like fibrils, is a common form of behaviour exhibited by a range of peptides and proteins. This process was initially discovered in the context of the aetiology of a range of neurodegenerative diseases, but has recently been recognised to of general significance and has been found at the origin of a number of beneficial functional roles in nature, including as catalytic scaffolds and functional components in biofilms. This talk discusses our ongoing efforts to study the kinetics of linear protein self-assembly by using master equation approaches combined with global analysis of experimental data.

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

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

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

    PubMed

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

    2013-01-01

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

  12. A remote query magnetoelastic pH sensor.

    PubMed

    Cai, Q Y; Grimes, C A

    2000-11-15

    A remote query magnetoelastic pH sensor comprised of a magnetoelastic thick-film coated with a mass-changing pH-responsive polymer is described. In response to a magnetic query field the magnetoelastic sensor mechanically vibrates at a characteristic frequency that is inversely dependent upon the mass of the attached polymer layer. As the magnetoelastic sensor is magnetostrictive the mechanical vibrations of the sensor launch magnetic flux that can be detected remotely from the sensor using a pickup coil. The pH responsive copolymer is synthesized from 20 mol% of acrylic acid and 80 mol% of iso-octyl acrylate and then deposited onto a magnetoelastic film by dip-coating. For a 1 micrometer polymer coating upon a 30 micrometer thick Metglas [The Metglas alloys are a registered trademark of Honeywell Corporation. For product information see: http://www.electronicmaterials.com:80/businesses/sem/amorph/page5_1_2.htm.] alloy 2826MB magnetoelastic film between pH 5 and 9 the change in resonant frequency is linear, approximately 285 Hz/pH or 0.6%/pH. The addition of 10 mmol/l of KCl to the test solution decreases the sensitivity of the polymer approximately 4%. PMID:12192686

  13. Symbolic representation and visual querying of left ventricular image sequences.

    PubMed

    Baroni, M; Del Bimbo, A; Evangelist, A; Vicario, E

    1999-01-01

    In the evaluation of regional left ventricular function, relevant cardiac disorders manifest themselves not only in static features, such as shape descriptors and motion excursion in end-diastolic and end-systolic frames, but also in their temporal evolution. In common diagnostic practice, such dynamic patterns are analysed by direct inspection of frame sequences through the use of a moviola. This permits only a subjective and poorly defined evaluation of functional parameters, and definitely prevents a systematic and reproducible analysis of large sets of reports. Retrieval by contents techniques may overcome this limitation by permitting the automatic comparison of the reports in a database against queries expressing descriptive properties related to significant pathological conditions. A system is presented which is aimed at investigating the potential of this approach by supporting retrieval by contents from a database of cineangiographic or echocardiographic images. The system relies on a symbolic description of both geometrical and temporal properties of left ventricular contours. This is derived automatically by an image processing and interpretation module and associated with the report at its storage time. In the retrieval stage, queries are expressed by means of an iconic visual language which describes searched content properties over a computer screen. The system automatically interprets iconic statements and compares them against concrete descriptions in the database. This enables medical users to interact with the system to search for motion and shape abnormalities on a regional basis, in single or homogeneous groups of reports, so as to enable both prospective and retrospective diagnosis.

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

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

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

    PubMed

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

    2013-01-01

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

  17. Taurine and platelet aggregation

    SciTech Connect

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

    1986-03-01

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

  18. Query Language for Location-Based Services: A Model Checking Approach

    NASA Astrophysics Data System (ADS)

    Hoareau, Christian; Satoh, Ichiro

    We present a model checking approach to the rationale, implementation, and applications of a query language for location-based services. Such query mechanisms are necessary so that users, objects, and/or services can effectively benefit from the location-awareness of their surrounding environment. The underlying data model is founded on a symbolic model of space organized in a tree structure. Once extended to a semantic model for modal logic, we regard location query processing as a model checking problem, and thus define location queries as hybrid logicbased formulas. Our approach is unique to existing research because it explores the connection between location models and query processing in ubiquitous computing systems, relies on a sound theoretical basis, and provides modal logic-based query mechanisms for expressive searches over a decentralized data structure. A prototype implementation is also presented and will be discussed.

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

  20. A query result merging scheme for providing energy efficiency in underwater sensor networks.

    PubMed

    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.

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

    PubMed

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

    2015-01-01

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

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

  3. A conserved quantity in thin body dynamics

    NASA Astrophysics Data System (ADS)

    Hanna, James; Pendar, Hodjat

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

  4. Radiation Protection Quantities for Near Earth Environments

    NASA Technical Reports Server (NTRS)

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

    2004-01-01

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

  5. Observable quantities for electrodiffusion processes in membranes.

    PubMed

    Garrido, Javier

    2008-03-13

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

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

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

    NASA Astrophysics Data System (ADS)

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

    2015-04-01

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

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

  9. Shielded radiation protection quantities beyond LEO

    NASA Astrophysics Data System (ADS)

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

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

  10. NetMatchStar: an enhanced Cytoscape network querying app

    PubMed Central

    Rinnone, Fabio; Micale, Giovanni; Bonnici, Vincenzo; Bader, Gary D.; Shasha, Dennis; Ferro, Alfredo; Pulvirenti, Alfredo; Giugno, Rosalba

    2015-01-01

    We present NetMatchStar, a Cytoscape app to find all the occurrences of a query graph in a network and check for its significance as a motif with respect to seven different random models. The query can be uploaded or built from scratch using Cytoscape facilities. The app significantly enhances the previous NetMatch in style, performance and functionality. Notably NetMatchStar allows queries with wildcards. PMID:26594341

  11. Sleep quantity, quality and optimism in children.

    PubMed

    Lemola, Sakari; Räikkönen, Katri; Scheier, Michael F; Matthews, Karen A; Pesonen, Anu-Katriina; Heinonen, Kati; Lahti, Jari; Komsi, Niina; Paavonen, Juulia E; Kajantie, Eero

    2011-03-01

    We tested the relationship of objectively measured sleep quantity and quality with positive characteristics of the child. Sleep duration, sleep latency and sleep efficiency were measured by an actigraph for an average of seven (range = 3-14) consecutive nights in 291 8-year-old children (standard deviation = 0.3 years). Children's optimism, self-esteem and social competence were rated by parents and/or teachers. Sleep duration showed a non-linear, reverse J-shaped relationship with optimism (P = 0.02), such that children with sleep duration in the middle of the distribution scored higher in optimism compared with children who slept relatively little. Shorter sleep latency was related to higher optimism (P = 0.01). The associations remained when adjusting for child's age, sex, body mass index, and parental level of education and optimism. In conclusion, sufficient sleep quantity and good sleep quality are related to children's positive characteristics. Our findings may inform why sleep quantity and quality and positive characteristics are associated with wellbeing in children.

  12. Quantity Discrimination in Wolves (Canis lupus)

    PubMed Central

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

    2012-01-01

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

  13. Quantity Discrimination in Wolves (Canis lupus).

    PubMed

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

    2012-01-01

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

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

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

  16. ConnectomeExplorer: query-guided visual analysis of large volumetric neuroscience data.

    PubMed

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

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

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

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

    NASA Astrophysics Data System (ADS)

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

    1993-04-01

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

  19. The Ontology Lookup Service: more data and better tools for controlled vocabulary queries

    PubMed Central

    Côté, Richard G.; Jones, Philip; Martens, Lennart; Apweiler, Rolf; Hermjakob, Henning

    2008-01-01

    The Ontology Lookup Service (OLS) (http://www.ebi.ac.uk/ols) provides interactive and programmatic interfaces to query, browse and navigate an ever increasing number of biomedical ontologies and controlled vocabularies. The volume of data available for querying has more than quadrupled since it went into production and OLS functionality has been integrated into several high-usage databases and data entry tools. Improvements have been made to both OLS query interfaces, based on user feedback and requirements, to improve usability and service interoperability and provide novel ways to perform queries. PMID:18467421

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

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

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

  3. Data Definition Ontology for clinical data integration and querying.

    PubMed

    Assélé Kama, Ariane; Primadhanty, Audi; Choquet, Rémy; Teodoro, Douglas; Enders, Frank; Duclos, Catherine; Jaulent, Marie-Christine

    2012-01-01

    This paper describes an approach to build a Data Definition Ontology (DDO) in the context of full domain ontology integration with datasets in order to share and query clinical heterogeneous data repositories. We have adapted an existing semantic web tool (D2RQ) to implement a process that automatically generates the DDO from a database information model, thanks to reverse engineering and schema mapping approaches. This study has been performed in the context of the DebugIT European project (Detecting and Eliminating Bacteria UsinG Information Technology) that aims to control and monitor the bacterial growth via a semantic interoperability platform (IP). The evaluation of the process is based, first, on the accuracy of the produced DDO for different samples of database storage and second, by checking the congruency between the DDO and the D2RQ database mapping file. PMID:22874148

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

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

    PubMed

    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

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

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

    NASA Astrophysics Data System (ADS)

    Li, Hua-Fu

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

  8. Data Definition Ontology for clinical data integration and querying.

    PubMed

    Assélé Kama, Ariane; Primadhanty, Audi; Choquet, Rémy; Teodoro, Douglas; Enders, Frank; Duclos, Catherine; Jaulent, Marie-Christine

    2012-01-01

    This paper describes an approach to build a Data Definition Ontology (DDO) in the context of full domain ontology integration with datasets in order to share and query clinical heterogeneous data repositories. We have adapted an existing semantic web tool (D2RQ) to implement a process that automatically generates the DDO from a database information model, thanks to reverse engineering and schema mapping approaches. This study has been performed in the context of the DebugIT European project (Detecting and Eliminating Bacteria UsinG Information Technology) that aims to control and monitor the bacterial growth via a semantic interoperability platform (IP). The evaluation of the process is based, first, on the accuracy of the produced DDO for different samples of database storage and second, by checking the congruency between the DDO and the D2RQ database mapping file.

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

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

    PubMed

    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.

  11. Analysing Twitter and web queries for flu trend prediction

    PubMed Central

    2014-01-01

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

  12. Visual Aggregate Analysis of Eligibility Features of Clinical Trials

    PubMed Central

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

    2015-01-01

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

  13. Invariant quantities of a nondepolarizing Mueller matrix.

    PubMed

    Gil, José J; José, Ignacio San

    2016-07-01

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

  14. 14 CFR 29.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

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

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

  16. 14 CFR 23.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

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

  17. 14 CFR 27.1551 - Oil quantity indicator.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

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

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

  19. 7 CFR 61.102 - Determination of quantity index.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

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

  20. 7 CFR 61.102 - Determination of quantity index.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

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

  1. 7 CFR 61.102 - Determination of quantity index.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

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

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

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

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

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

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

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

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

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

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

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

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

  13. Peptide aggregation in neurodegenerative disease.

    PubMed

    Murphy, Regina M

    2002-01-01

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

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

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

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

  17. Nanoparticle aggregation: principles and modeling.

    PubMed

    Zhang, Wen

    2014-01-01

    The high surface area to volume ratio of nanoparticles usually results in highly reactive and colloidal instability compared to their bulk counterparts. Aggregation as well as many other transformations (e.g., dissolution) in the environment may alter the physiochemical properties, reactivity, fate, transport, and biological interactions (e.g., bioavailability and uptake) of nanoparticles. The unique properties pertinent to nanoparticles, such as shape, size, surface characteristics, composition, and electronic structures, greatly challenge the ability of colloid science to understand nanoparticle aggregation and its environmental impacts. This review briefly introduces fundamentals about aggregation, fractal dimensions, classic and extended Derjaguin-Landau-Verwey-Overbeak (DLVO) theories, aggregation kinetic modeling, experimental measurements, followed by detailed discussions on the major factors on aggregation and subsequent effects on nanomaterial transport and reactivity.

  18. Immunogenicity of Therapeutic Protein Aggregates.

    PubMed

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

    2016-02-01

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

  19. Mechanics of fire ant aggregations

    NASA Astrophysics Data System (ADS)

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

    2016-01-01

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

  20. Mechanics of fire ant aggregations.

    PubMed

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

    2016-01-01

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

  1. Adsorption-induced colloidal aggregation

    NASA Astrophysics Data System (ADS)

    Law, B. M.; Petit, J.-M.; Beysens, D.

    1998-03-01

    Reversible colloidal aggregation in binary liquid mixtures has been studied for a number of years. As the phase separation temperature of the liquid mixture is approached the thickness of an adsorption layer around the colloidal particles increases. Beysens and coworkers have demonstrated experimentally that this adsorption layer is intimately connected with the aggregation of the colloidal particles, however, no definitive theory has been available which can explain all of the experimental observations. In this contribution we describe an extension of the Derjaguin, Landau, Verwey, and Overbeek theory of colloidal aggregation which takes into account the presence of the adsorption layer and which more realistically models the attractive dispersion interactions. This modified theory can quantitatively account for many of the observed experimental features such as the characteristics of the aggregated state, the general shape of the aggregation line, and the temperature dependence of the second virial coefficient for a lutidine-water mixture containing a small volume fraction of silica colloidal particles.

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

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

    PubMed

    Luo, Yuan; Szolovits, Peter

    2016-01-01

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

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

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

    ERIC Educational Resources Information Center

    Shakir, Hussain Sabri; Nagao, Makoto

    1996-01-01

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

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

    NASA Astrophysics Data System (ADS)

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

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

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

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

    ERIC Educational Resources Information Center

    Kawash, Jalal

    2004-01-01

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

  9. Application of Information Theory to Query Negotiation: Toward an Optimal Questioning Strategy.

    ERIC Educational Resources Information Center

    Meghabghab, G.; Bilal, D.

    1991-01-01

    Discusses uncertainty measurement in reference queries and proposes an optimal questioning strategy (OQS) to reduce uncertainty and to measure the amount of information contained in reference queries. Information exchange between librarians and patrons is discussed, distinctions between vagueness and ambiguity are explained, and an example using…

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

    PubMed Central

    2013-01-01

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

  11. Comparing Boolean and Probabilistic Information Retrieval Systems Across Queries and Disciplines.

    ERIC Educational Resources Information Center

    Losee, Robert M.

    1997-01-01

    Suggests a method that allows searchers to analytically compare the Boolean and probabilistic information retrieval approaches. Sample performance figures are provided for queries using the Boolean strategy, and for probabilistic systems. The variation of performance across sublanguages and queries is examined, as well as the performance of models…

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

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

    NASA Astrophysics Data System (ADS)

    Haddadin, Kais; Lauer, Tobias

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

  14. a Vomr-Tree Based Parallel Range Query Method on Distributed Spatial Database

    NASA Astrophysics Data System (ADS)

    Fu, Z.; Liu, S.

    2012-07-01

    Spatial index impacts upon the efficiency of spatial query seriously in distributed spatial database. In this paper, we introduce a parallel spatial range query algorithm, based on VoMR-tree index, which incorporates Voronoi diagrams into MR-tree, benefiting from the nearest neighbors. We first augments MR-tree to store the nearest neighbors and constructs the VoMR-tree index by Voronoi diagram. We then propose a novel range query algorithm based on VoMR-tree index. In processing a range query, we discuss the data partition method so that we can improve the efficiency by parallelization in distributed database. Just then a verification strategy is promoted. We show the superiority of the proposed method by extensive experiments using data sets of various sizes. The experimental results reveal that the proposed method improves the performance of range query processing up to three times in comparison with the widely-used R-tree variants.

  15. WWW-query: an on-line retrieval system for biological sequence banks.

    PubMed

    Perrière, G; Gouy, M

    1996-01-01

    We have developed a World Wide Web (WWW) version of the sequence retrieval system Query: WWW-Query. This server allows to query nucleotide sequence banks in the EMBL/GenBank/DDBJ formats and protein sequence banks in the NBRF/PIR format. WWW-Query includes all the features of the on-line sequences browsers already available: possibility to build complex queries, integration of cross-references with different data banks, and access to the functional zones of biological interest. It also provides original services not available elsewhere: introduction of the notion of re-usable sequence lists, integration of dedicated helper applications for visualizing alignments and phylogenetic trees and links with multivariate methods for studying codon usage or for complementing phylogenies.

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

  17. Petri-net-based modeling and evaluation of pipelined processing of concurrent database queries

    SciTech Connect

    Mikkilimeni, K.P.; Chow, Y.C.; Su, S.Y.W.

    1988-11-01

    This paper describes a Petri-net-based methodology for modeling and evaluation pipelined processing of concurrent database queries in an integrated data network (IDN). An extended Petri-net model is presented to model two key approaches to concurrent data-base query processing in the IDN, namely, pipelined and data-flow-based execution of queries and intermediate data sharing among concurrent queries. Database operations are categorized, and the models for the data flow and control flow in them are presented. A general purpose Petri-net simulator has been developed using event-driven programming techniques. Using the simulator, the execution of the Petri-net models of some test queries has been simulated.

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

    PubMed Central

    Cappelletti, Marinella; Muggleton, Neil; Walsh, Vincent

    2009-01-01

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

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

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

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

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ..., that in the case of a commodity packed in a container designed to deliver the commodity under pressure... unavoidable deviations in weighing, measuring, or counting the contents of individual packages which occur in... average of the quantities in the packages comprising a shipment or other delivery of the commodity...

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

  4. Query-handling in MLM-based decision support systems.

    PubMed

    Arkad, K; Gao, X M; Ahlfeldt, H

    1995-01-01

    Arden Syntax for Medical Logic Modules is a standard specification for creation and sharing of knowledge bases. The standard specification focuses on knowledge that can be represented as a set of independent Medical Logic Modules (MLMs) such as rules, formulas and protocols. The basic functions of an MLM are to retrieve patient data, manipulate the data, come to some decision, and possibly perform an action. All connections to the world outside an MLM are collected in the data-slot of the MLM. The institution specific parts of these connections are inside the notation of curly brackets ([]) to facilitate sharing of MLM between institutions. This paper focuses on some of the problems that occur in relation to Arden Syntax and connections to a patient database such as database queries. Problems related to possibilities of moving one or several module(s) are also discussed, with emphasis on database connections. As an example, an MLM based Decision Support System (DSS) developed at Linköping University is described. PMID:8882561

  5. Standardised MedDRA queries: their role in signal detection.

    PubMed

    Mozzicato, Patricia

    2007-01-01

    Standardised MedDRA (Medical Dictionary for Regulatory Activities) queries (SMQs) are a newly developed tool to assist in the retrieval of cases of interest from a MedDRA-coded database. SMQs contain terms related to signs, symptoms, diagnoses, syndromes, physical findings, laboratory and other physiological test data etc, that are associated with the medical condition of interest. They are being developed jointly by CIOMS and the MedDRA Maintenance and Support Services Organization (MSSO) and are provided as an integral part of a MedDRA subscription. During their development, SMQs undergo testing to assure that they are able to retrieve cases of interest within the defined scope of the SMQ. This paper describes the features of SMQs that allow for flexibility in their application, such as 'narrow' and 'broad' sub-searches, hierarchical grouping of sub-searches and search algorithms. In addition, as with MedDRA, users can request changes to SMQs. SMQs are maintained in synchrony with MedDRA versions by internal maintenance processes in the MSSO. The list of safety topics to be developed into SMQs is long and comprehensive. The CIOMS Working Group retains a list of topics to be developed and periodically reviews the list for priority and relevance. As of mid-2007, 37 SMQs are in production use and several more are under development. The potential uses of SMQs in safety analysis will be discussed including their role in signal detection and evaluation. PMID:17604415

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

  7. A Geospatial Semantic Enrichment and Query Service for Geotagged Photographs.

    PubMed

    Ennis, Andrew; Nugent, Chris; Morrow, Philip; Chen, Liming; Ioannidis, George; Stan, Alexandru; Rachev, Preslav

    2015-07-20

    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.

  8. A Geospatial Semantic Enrichment and Query Service for Geotagged Photographs.

    PubMed

    Ennis, Andrew; Nugent, Chris; Morrow, Philip; Chen, Liming; Ioannidis, George; Stan, Alexandru; Rachev, Preslav

    2015-01-01

    With the increasing abundance of technologies and smart devices, equipped with a multitude of sensors for sensing the environment around them, information creation and consumption has now become effortless. This, in particular, is the case for photographs with vast amounts being created and shared every day. For example, at the time of this writing, Instagram users upload 70 million photographs a day. Nevertheless, it still remains a challenge to discover the "right" information for the appropriate purpose. This paper describes an approach to create semantic geospatial metadata for photographs, which can facilitate photograph search and discovery. To achieve this we have developed and implemented a semantic geospatial data model by which a photograph can be enrich with geospatial metadata extracted from several geospatial data sources based on the raw low-level geo-metadata from a smartphone photograph. We present the details of our method and implementation for searching and querying the semantic geospatial metadata repository to enable a user or third party system to find the information they are looking for. PMID:26205265

  9. A database and query system for refinery vessels

    SciTech Connect

    Jenkins, W.

    1994-12-31

    Maintaining pressure vessel integrity has always required accurate and complete record keeping. The presence of OSHA 1910, however, requires record keeping that is even more accurate and -- more importantly -- accessible on demand. All chemical process industries, and especially refineries, are challenged to find better ways to document the inspection and maintenance work they perform. This paper discusses a software program that provides a comprehensive, user-friendly approach to this problem. It provides: (1) A Data Entry and Recovery System for all sections of every pressure vessel in a refinery. In addition to storing U-1 Manufacturers Data Form information, the program also provides space for other important data, including internal environment. (2) A Query System that produces on demand a list of equipment that satisfies any or all of 36 defining criteria. (3) A self-checking data entry system that makes it virtually impossible to enter incorrect data, even for computer novices. (4) Vessel History records for all components, including heat exchanger tubes and bundles. (5) A Windows format that allows the integration of other vendors` thickness, warehouse and maintenance programs.

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

  11. A process for developing an implementation intervention: QUERI Series

    PubMed Central

    Curran, Geoffrey M; Mukherjee, Snigda; Allee, Elise; Owen, Richard R

    2008-01-01

    Background This article describes the process used by the authors in developing an implementation intervention to assist VA substance use disorder clinics in adopting guideline-based practices for treating depression. This article is one in a Series of articles documenting implementation science frameworks and tools developed by the U.S. Department of Veterans Affairs (VA) Quality Enhancement Research Initiative (QUERI). Methods The process involves two steps: 1) diagnosis of site-specific implementation needs, barriers, and facilitators (i.e., formative evaluation); and 2) the use of multi-disciplinary teams of local staff, implementation experts, and clinical experts to interpret diagnostic data and develop site-specific interventions. In the current project, data were collected via observations of program activities and key informant interviews with clinic staff and patients. The assessment investigated a wide range of macro- and micro-level determinants of organizational and provider behavior. Conclusion The implementation development process described here is presented as an optional method (or series of steps) to consider when designing a small scale, multi-site implementation study. The process grew from an evidence-based quality improvement strategy developed for – and proven efficacious in – primary care settings. The authors are currently studying the efficacy of the process across a spectrum of specialty care treatment settings. PMID:18353186

  12. 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. PMID:19257067

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

  14. Electromagnetic charges in aggregation phenomena.

    NASA Astrophysics Data System (ADS)

    Rioux, Claude; Slobodrian, R. J.

    Introduction The mechanism of fine particles aggregation is of great importance in many areas of research, in particular environment sciences where the state of aggregation defines the removal speed of dust from the atmosphere. The study of this mechanism is also important to understand the first stage of planet formation from the solar nebula. The aggregates formed are generally fractals and, as mentioned in the literature [1], the fractal dimensions and the site growth probability measures of the resulting fractal structures strongly depend on the properties of the forces that cause the aggregation. Theory and experimental apparatus We began this study by the aggregation between two charged particles and we are now consid-ering the aggregation between two magnetized particles. The aggregations are produced in a gas at a pressure between 10 and 1000 mbar and by using the applicable simplifications; we find that the distance (r) between the particles as a function of time (t) is given by the following equations: r=Ce(tf -t)1/3 for the electrical attraction r=Cm(tf -t)1/5 for the magnetic dipoles aligned in an external magnetic field. The apparatus built for these measurements consists of an experimental cell from which two perpendicular views are combined via an optical system in one image recorded by a video camera. From the video, we can then measure the distance between the particles as a function of time and reconstruct the trajectories in 3-D. The horizontal and vertical resolutions are respectively 0.86 and 0.92 microns per pixel. With a depth of field of 250 microns, the usable volume for 3-D observation in then 250 microns x 250 microns x 443 microns. Results and discussion A first version of the apparatus was tested on an electrical force aggregation and the results [2] show that the corresponding equation is a good representation of the phenomenon. Preliminary results, from an experiment using iron particles, show that the magnetic force can be seen in

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

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

  17. Merging Ontology Navigation with Query Construction for Web-based Medicare Data Exploration.

    PubMed

    Zhang, Guo-Qiang; Cui, Licong; Teagno, Joe; Kaebler, David; Koroukian, Siran; Xu, Rong

    2013-01-01

    To enhance web-based exploration of Medicare data, we present a unique query interface merging ontology navigation with query construction, for cohort discovery based on demographics, disease classification codes, medication and other types of clinical data. Our interface seamlessly blends query construction with functions for hierarchical browsing and rendering of terms and associated codes from vocabulary systems and ontologies, such as International Classification of Diseases, Ninth Revision, Clinical Modification (ICD-9-CM). By unifying ontology navigation activities with query widget generation, a user can perform fine-tuned full boolean queries based on the substructure of the ontology, with flexibility to enable or disable subsumption-based queries. Query performance were evaluated on top disease subtypes of Centers for Medicare and Medicaid Services data, consisting of 5% of 2009 Limited Data Set files (inpatient and outpatient). Such interfaces will help moving the data access paradigm from a hypothesis-driven style to a data-driven one, while improving efficiency as a collective "secondary-use user community."

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

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

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

    PubMed

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

    2016-01-01

    Cyber physical systems (CPS) sense the environment based on wireless sensor networks. The sensing data of such systems present the characteristics of massiveness and multi-dimensionality. As one of the major monitoring methods used in in safe production monitoring and disaster early-warning applications, skyline query algorithms are extensively adopted for multiple-objective decision analysis of these sensing data. With the expansion of network sizes, the amount of sensing data increases sharply. Then, how to improve the query efficiency of skyline query algorithms and reduce the transmission energy consumption become pressing and difficult to accomplish issues. Therefore, this paper proposes a new energy-efficient skyline query method for massively multidimensional sensing data. First, the method uses a node cut strategy to dynamically generate filtering tuples with little computational overhead when collecting query results instead of issuing queries with filters. It can judge the domination relationship among different nodes, remove the detected data sets of dominated nodes that are irrelevant to the query, modify the query path dynamically, and reduce the data comparison and computational overhead. The efficient dynamic filter generated by this strategy uses little non-skyline data transmission in the network, and the transmission distance is very short. Second, our method also employs the tuple-cutting strategy inside the node and generates the local cutting tuples by the sub-tree with the node itself as the root node, which will be used to cut the detected data within the nodes of the sub-tree. Therefore, it can further control the non-skyline data uploading. A large number of experimental results show that our method can quickly return an overview of the monitored area and reduce the communication overhead. Additionally, it can shorten the response time and improve the efficiency of the query. PMID:26761010

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

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

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

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

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

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

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

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... quantities and inch/pound quantities to metric quantities, the factors in the following chart and none others shall be employed: SI Metric Inch/Pound Conversion Factors Inch/pound Metric Length 1 mil=25.4... g 1 milligram=0.000 035 274 0 oz. 1 pound=453.592 g =0.015 432 4 grain. =0.453 592 kg 1...

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

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... quantities and inch/pound quantities to metric quantities, the factors in the following chart and none others shall be employed: SI Metric Inch/Pound Conversion Factors Inch/pound Metric Length 1 mil=25.4... g 1 milligram=0.000 035 274 0 oz. 1 pound=453.592 g =0.015 432 4 grain. =0.453 592 kg 1...

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

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

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

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

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

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

  15. 7 CFR 760.1307 - Dairy operation payment quantity.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 7 2013-01-01 2013-01-01 false Dairy operation payment quantity. 760.1307 Section 760..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Dairy Economic Loss Assistance Payment Program § 760.1307 Dairy operation payment quantity. (a) A dairy operation's payment quantity...

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

  17. 7 CFR 1430.207 - Dairy operation payment quantity.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 10 2011-01-01 2011-01-01 false Dairy operation payment quantity. 1430.207 Section... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS DAIRY PRODUCTS Milk Income Loss Contract Program § 1430.207 Dairy operation payment quantity. (a) The applicant's payment quantity of...

  18. 7 CFR 760.1307 - Dairy operation payment quantity.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 7 2014-01-01 2014-01-01 false Dairy operation payment quantity. 760.1307 Section 760..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Dairy Economic Loss Assistance Payment Program § 760.1307 Dairy operation payment quantity. (a) A dairy operation's payment quantity...

  19. 7 CFR 760.1307 - Dairy operation payment quantity.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 7 Agriculture 7 2012-01-01 2012-01-01 false Dairy operation payment quantity. 760.1307 Section 760..., DEPARTMENT OF AGRICULTURE SPECIAL PROGRAMS INDEMNITY PAYMENT PROGRAMS Dairy Economic Loss Assistance Payment Program § 760.1307 Dairy operation payment quantity. (a) A dairy operation's payment quantity...

  20. 7 CFR 1430.207 - Dairy operation payment quantity.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 10 2014-01-01 2014-01-01 false Dairy operation payment quantity. 1430.207 Section... CORPORATION, DEPARTMENT OF AGRICULTURE LOANS, PURCHASES, AND OTHER OPERATIONS DAIRY PRODUCTS Milk Income Loss Contract Program § 1430.207 Dairy operation payment quantity. (a) The applicant's payment quantity of...