Science.gov

Sample records for query answering systems

  1. Query Answering Driven by Collaborating Agents

    NASA Astrophysics Data System (ADS)

    Dardzinska, Agnieszka

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

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

    ERIC Educational Resources Information Center

    Pema, Enela

    2014-01-01

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

  3. Audiotex Information Systems: Answering Consumer Queries Electronically. TDC Research Report No. 5.

    ERIC Educational Resources Information Center

    Conlan, Sharon; And Others

    A 14-month pilot of INFO-U, a fully automated telephone information service, assessed the feasibility of the technology in Minnesota Extension Service (MES) county offices to respond to consumer telephone queries. The project was designed to: (1) explore the potential of regional Extension cooperation and resource sharing; (2) increase recognition…

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

    ERIC Educational Resources Information Center

    Wang, Huaiqing; Liao, Stephen; Liao, Lejian

    2000-01-01

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

  5. Guiding Students to Answers: Query Recommendation

    ERIC Educational Resources Information Center

    Yilmazel, Ozgur

    2011-01-01

    This paper reports on a guided navigation system built on the textbook search engine developed at Anadolu University to support distance education students. The search engine uses Turkish Language specific language processing modules to enable searches over course material presented in Open Education Faculty textbooks. We implemented a guided…

  6. Cooperative answers in database systems

    NASA Technical Reports Server (NTRS)

    Gaasterland, Terry; Godfrey, Parke; Minker, Jack; Novik, Lev

    1993-01-01

    A major concern of researchers who seek to improve human-computer communication involves how to move beyond literal interpretations of queries to a level of responsiveness that takes the user's misconceptions, expectations, desires, and interests into consideration. At Maryland, we are investigating how to better meet a user's needs within the framework of the cooperative answering system of Gal and Minker. We have been exploring how to use semantic information about the database to formulate coherent and informative answers. The work has two main thrusts: (1) the construction of a logic formula which embodies the content of a cooperative answer; and (2) the presentation of the logic formula to the user in a natural language form. The information that is available in a deductive database system for building cooperative answers includes integrity constraints, user constraints, the search tree for answers to the query, and false presuppositions that are present in the query. The basic cooperative answering theory of Gal and Minker forms the foundation of a cooperative answering system that integrates the new construction and presentation methods. This paper provides an overview of the cooperative answering strategies used in the CARMIN cooperative answering system, an ongoing research effort at Maryland. Section 2 gives some useful background definitions. Section 3 describes techniques for collecting cooperative logical formulae. Section 4 discusses which natural language generation techniques are useful for presenting the logic formula in natural language text. Section 5 presents a diagram of the system.

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

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

    SciTech Connect

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

    1994-12-31

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

  9. Using ontology databases for scalable query answering, inconsistency detection, and data integration

    PubMed Central

    Dou, Dejing

    2011-01-01

    An ontology database is a basic relational database management system that models an ontology plus its instances. To reason over the transitive closure of instances in the subsumption hierarchy, for example, an ontology database can either unfold views at query time or propagate assertions using triggers at load time. In this paper, we use existing benchmarks to evaluate our method—using triggers—and we demonstrate that by forward computing inferences, we not only improve query time, but the improvement appears to cost only more space (not time). However, we go on to show that the true penalties were simply opaque to the benchmark, i.e., the benchmark inadequately captures load-time costs. We have applied our methods to two case studies in biomedicine, using ontologies and data from genetics and neuroscience to illustrate two important applications: first, ontology databases answer ontology-based queries effectively; second, using triggers, ontology databases detect instance-based inconsistencies—something not possible using views. Finally, we demonstrate how to extend our methods to perform data integration across multiple, distributed ontology databases. PMID:22163378

  10. Data Parallel Bin-Based Indexing for Answering Queries on Multi-Core Architectures

    SciTech Connect

    Gosink, Luke; Wu, Kesheng; Bethel, E. Wes; Owens, John D.; Joy, Kenneth I.

    2009-06-02

    The multi-core trend in CPUs and general purpose graphics processing units (GPUs) offers new opportunities for the database community. The increase of cores at exponential rates is likely to affect virtually every server and client in the coming decade, and presents database management systems with a huge, compelling disruption that will radically change how processing is done. This paper presents a new parallel indexing data structure for answering queries that takes full advantage of the increasing thread-level parallelism emerging in multi-core architectures. In our approach, our Data Parallel Bin-based Index Strategy (DP-BIS) first bins the base data, and then partitions and stores the values in each bin as a separate, bin-based data cluster. In answering a query, the procedures for examining the bin numbers and the bin-based data clusters offer the maximum possible level of concurrency; each record is evaluated by a single thread and all threads are processed simultaneously in parallel. We implement and demonstrate the effectiveness of DP-BIS on two multi-core architectures: a multi-core CPU and a GPU. The concurrency afforded by DP-BIS allows us to fully utilize the thread-level parallelism provided by each architecture--for example, our GPU-based DP-BIS implementation simultaneously evaluates over 12,000 records with an equivalent number of concurrently executing threads. In comparing DP-BIS's performance across these architectures, we show that the GPU-based DP-BIS implementation requires significantly less computation time to answer a query than the CPU-based implementation. We also demonstrate in our analysis that DP-BIS provides better overall performance than the commonly utilized CPU and GPU-based projection index. Finally, due to data encoding, we show that DP-BIS accesses significantly smaller amounts of data than index strategies that operate solely on a column's base data; this smaller data footprint is critical for parallel processors that possess

  11. InstQL: A Query Language for Virtual Institutions Using Answer Set Programming

    NASA Astrophysics Data System (ADS)

    Hopton, Luke; Cliffe, Owen; de Vos, Marina; Padget, Julian

    Institutions provide a mechanism to capture and reason about "correct" and "incorrect" behaviour within a social context. While institutions can be studied in their own right, their real potential is as instruments to govern open software architectures like multi-agent and service-oriented systems. Our domain-specific action language for normative frameworks, InstAL aims to help focus designers' attention on the expression of issues such as permission, violation and power but does not help the designer in verifying or querying the model they have specified. In this paper we present the query language InstQL which includes a number of powerful features including temporal constraints over events and fluents that can be used in conjunction with InstAL to specify those traces that are of interest in order to investigate and reason over the underlying normative models. The semantics of the query language is provided by translating InstQL queries into AnsProlog, the same computational language as InstAL. The result is a simple, high-level query and constraint language that builds on and uses the reasoning power of ASP.

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

    NASA Astrophysics Data System (ADS)

    Kato, Hirotaka; Matsumoto, Satoshi; Miyahara, Tetsuhiro

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

  13. A natural language interface plug-in for cooperative query answering in biological databases

    PubMed Central

    2012-01-01

    Background One of the many unique features of biological databases is that the mere existence of a ground data item is not always a precondition for a query response. It may be argued that from a biologist's standpoint, queries are not always best posed using a structured language. By this we mean that approximate and flexible responses to natural language like queries are well suited for this domain. This is partly due to biologists' tendency to seek simpler interfaces and partly due to the fact that questions in biology involve high level concepts that are open to interpretations computed using sophisticated tools. In such highly interpretive environments, rigidly structured databases do not always perform well. In this paper, our goal is to propose a semantic correspondence plug-in to aid natural language query processing over arbitrary biological database schema with an aim to providing cooperative responses to queries tailored to users' interpretations. Results Natural language interfaces for databases are generally effective when they are tuned to the underlying database schema and its semantics. Therefore, changes in database schema become impossible to support, or a substantial reorganization cost must be absorbed to reflect any change. We leverage developments in natural language parsing, rule languages and ontologies, and data integration technologies to assemble a prototype query processor that is able to transform a natural language query into a semantically equivalent structured query over the database. We allow knowledge rules and their frequent modifications as part of the underlying database schema. The approach we adopt in our plug-in overcomes some of the serious limitations of many contemporary natural language interfaces, including support for schema modifications and independence from underlying database schema. Conclusions The plug-in introduced in this paper is generic and facilitates connecting user selected natural language interfaces to

  14. Enabling Ontology Based Semantic Queries in Biomedical Database Systems

    PubMed Central

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

    2013-01-01

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

  15. Enabling Ontology Based Semantic Queries in Biomedical Database Systems

    PubMed Central

    Zheng, Shuai; Lu, James

    2014-01-01

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

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

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

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

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

    Code of Federal Regulations, 2013 CFR

    2013-07-01

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

  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 Priori Analysis of Natural Language Queries.

    ERIC Educational Resources Information Center

    Spiegler, Israel; Elata, Smadar

    1988-01-01

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

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

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

  4. Domain and Intelligence Based Multimedia Question Answering System

    ERIC Educational Resources Information Center

    Kumar, K. Magesh; Valarmathie, P.

    2016-01-01

    Multimedia question answering systems have become very popular over the past few years. It allows users to share their thoughts by answering a given question or obtain information from a set of answered questions. However, existing QA systems support only textual answer which is not so instructive for many users. The user's discussion can be…

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

    SciTech Connect

    Wu, Jerry; Wu, Kesheng

    2011-04-18

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

  6. Heterogeneous distributed query processing: The DAVID system

    NASA Technical Reports Server (NTRS)

    Jacobs, Barry E.

    1985-01-01

    The objective of the Distributed Access View Integrated Database (DAVID) project is the development of an easy to use computer system with which NASA scientists, engineers and administrators can uniformly access distributed heterogeneous databases. Basically, DAVID will be a database management system that sits alongside already existing database and file management systems. Its function is to enable users to access the data in other languages and file systems without having to learn the data manipulation languages. Given here is an outline of a talk on the DAVID project and several charts.

  7. On-Line Patient Information System with Query

    PubMed Central

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

    1979-01-01

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

  8. Data modeling and query processing for distributed surveillance systems

    NASA Astrophysics Data System (ADS)

    Nam, Yunyoung; Hong, Sangjin; Rho, Seungmin

    2013-12-01

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

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

    PubMed

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

    2017-01-04

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

  10. Bio-TDS: bioscience query tool discovery system

    PubMed Central

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

    2017-01-01

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

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

  12. Pilot study optimizing MEDLINE queries in an automated disease management telemedicine system.

    PubMed

    Spaeder, Jeffrey A

    2002-01-01

    Clinicians encounter many medical questions while providing outpatient medical care. A significant number of these questions can be answered using MEDLINE; however it has proven to be difficult to incorporate MEDLINE into routine clinical workflow and for clinicians to generate well constructed MEDLINE queries. This study however hypothesized that that well-constructed MEDLINE queries could be semi-automatically generated by an application named LitButton which was incorporated into the TeleWatch telemedicine system. The LitButton application was then prospectively evaluated in a pilot study by four nurse case managers (NCM) who monitored sixty-eight outpatients for three weeks. During this period the NCMs used the LitButton application sixteen times, and they subjectively reported in real-time that they obtained an answer in 56% of the cases, but that none of the successful information retrieval events resulted in a change in a patient's clinical management. The small number of LitButton events and lack of clinical impact was likely due to the fact that the LitButton function was designed to search MEDLINE for treatment related information; however the NCMs had limited medical decision making responsibilities. As a result there was a mismatch between the user's information needs and the system capabilities.

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

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

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

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

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

  18. Students' Comparison of Their Trigonometric Answers with the Answers of a Computer Algebra System in Terms of Equivalence and Correctness

    ERIC Educational Resources Information Center

    Tonisson, Eno; Lepp, Marina

    2015-01-01

    The answers offered by computer algebra systems (CAS) can sometimes differ from those expected by the students or teachers. The comparison of the students' answers and CAS answers could provide ground for discussion about equivalence and correctness. Investigating the students' comparison of the answers gives the possibility to study different…

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

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

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

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

    PubMed

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

    2012-11-06

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

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

    PubMed Central

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

    2013-01-01

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

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

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

    PubMed Central

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

    2001-01-01

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

  6. Global parallel unification for large question-answering systems

    NASA Technical Reports Server (NTRS)

    Auguston, J. G.; Minker, J.

    1974-01-01

    An efficient means of storing data in a first-order predicate calculus theorem-proving system is described. The data structure is oriented for large scale question-answering (QA) systems. An algorithm is outlined which uses the data structure to unify a given literal in parallel against all literals in all clauses in the data base. The data structure permits a compact representation of data within a QA system. Some suggestions are made for heuristics which can be used to speed-up the unification algorithm in systems.

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

    NASA Technical Reports Server (NTRS)

    Bosc, Patrick; Pivert, Olivier

    1992-01-01

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

  8. Epistemic Questions and Answers for Software System Safety

    NASA Technical Reports Server (NTRS)

    Holloway, C. M.; Johnson, Chris W.

    2010-01-01

    System safety is primarily concerned with epistemic questions, that is, questions concerning knowledge and the degree of confidence that can be placed in that knowledge. For systems with which human experience is long, such as roads, bridges, and mechanical devices, knowledge about what is required to make the systems safe is deep and detailed. High confidence can be placed in the validity of that knowledge. For other systems, however, with which human experience is comparatively short, such as those that rely in part or in whole on software, knowledge about what is required to ensure safety tends to be shallow and general. The confidence that can be placed in the validity of that knowledge is consequently low. In a previous paper, we enumerated a collection of foundational epistemic questions concerning software system safety. In this paper, we review and refine the questions, discuss some difficulties that attend to answering the questions today, and speculate on possible research to improve the situation.

  9. An Analysis of Ill-Formed Input in Natural Language Queries to Document Retrieval Systems.

    ERIC Educational Resources Information Center

    Young, Charlene W.; And Others

    1991-01-01

    Describes a study conducted at the University of South Carolina that examined the frequency of occurrence of several types of errors in a sample of natural language queries submitted by users requesting online searches in information retrieval systems. Implications for system design are suggested, including parsing systems. (28 references) (LRW)

  10. Instructor-Aided Asynchronous Question Answering System for Online Education and Distance Learning

    ERIC Educational Resources Information Center

    Wen, Dunwei; Cuzzola, John; Brown, Lorna; Kinshuk

    2012-01-01

    Question answering systems have frequently been explored for educational use. However, their value was somewhat limited due to the quality of the answers returned to the student. Recent question answering (QA) research has started to incorporate deep natural language processing (NLP) in order to improve these answers. However, current NLP…

  11. GeoIRIS: Geospatial Information Retrieval and Indexing System-Content Mining, Semantics Modeling, and Complex Queries.

    PubMed

    Shyu, Chi-Ren; Klaric, Matt; Scott, Grant J; Barb, Adrian S; Davis, Curt H; Palaniappan, Kannappan

    2007-04-01

    Searching for relevant knowledge across heterogeneous geospatial databases requires an extensive knowledge of the semantic meaning of images, a keen eye for visual patterns, and efficient strategies for collecting and analyzing data with minimal human intervention. In this paper, we present our recently developed content-based multimodal Geospatial Information Retrieval and Indexing System (GeoIRIS) which includes automatic feature extraction, visual content mining from large-scale image databases, and high-dimensional database indexing for fast retrieval. Using these underpinnings, we have developed techniques for complex queries that merge information from heterogeneous geospatial databases, retrievals of objects based on shape and visual characteristics, analysis of multiobject relationships for the retrieval of objects in specific spatial configurations, and semantic models to link low-level image features with high-level visual descriptors. GeoIRIS brings this diverse set of technologies together into a coherent system with an aim of allowing image analysts to more rapidly identify relevant imagery. GeoIRIS is able to answer analysts' questions in seconds, such as "given a query image, show me database satellite images that have similar objects and spatial relationship that are within a certain radius of a landmark."

  12. Small numbers, disclosure risk, security, and reliability issues in Web-based data query systems.

    PubMed

    Rudolph, Barbara A; Shah, Gulzar H; Love, Denise

    2006-01-01

    This article describes the process for developing consensus guidelines and tools for releasing public health data via the Web and highlights approaches leading agencies have taken to balance disclosure risk with public dissemination of reliable health statistics. An agency's choice of statistical methods for improving the reliability of released data for Web-based query systems is based upon a number of factors, including query system design (dynamic analysis vs preaggregated data and tables), population size, cell size, data use, and how data will be supplied to users. The article also describes those efforts that are necessary to reduce the risk of disclosure of an individual's protected health information.

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

    NASA Astrophysics Data System (ADS)

    Zhang, Shuhua; Coleman, John D.

    2000-04-01

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

  14. Some questions and answers about the Satellite Power System (SPS)

    SciTech Connect

    Not Available

    1980-01-01

    The Office of Energy Research, US DOE is evaluating the concept of obtaining significant amounts of electrical energy from space through the Satellite Power System Project Office (SPS PO) formed for that purpose. The SPS PO prepared and is implementing a Concept Development and Evaluation Program plan. The CDEP runs roughly three years (from July 1977 through July 1980) and consists of four primary elements: (1) Systems Definition, (2) Environmental Assessment, (3) Societal Assessment, and (4) Comparative Assessment. One facet of the Societal Assessment is an investigation of public concerns. To further this investigation, a public outreach experiment was initiated to determine the initial response of three selected interest groups to the SPS, both qualitatively and quantititavely, and to gain some experience for use in future public participation activities. Three groups were contacted and agreed to participate in the experiment. They were: the Citizens Energy Project (CEP), the Forum for the Advancement of Students in Science and Technology (FASST), and the L-5 Society (L-5). They each agreed to condense twenty final SPS reports into approximately four pages each, have them typeset, printed and distributed to 3,000 of their constituents for their review, together with a request that they respond to the parent organization regarding the information presented. All responses were summarized and provided to Planning Research Corporation who then solicited the answers from the SPS PO investigator most directly concerned.The questions and answers are presented and will be distributed by the three groups to the individual respondents. Each of the three groups is also preparing a report to the Project Office detailing their work and results. These, together with other responses and studies will be used to more effectively involve the public in the SPS Participatory Technology Process.

  15. Spatial query for decision support of cross-country movement. [in image-based geographic information system

    NASA Technical Reports Server (NTRS)

    Hepner, George F.; Logan, Thomas L.; Bryant, Nevin A.

    1988-01-01

    The use of a query language processor for decision support of cross-country movement in an image-based geographic information system is evaluated. It is found that query processing yields results which are comparable to those obtained using conventional cross-country movement techniques and analysis. Query processing also provides a flexibility of information extraction, rapid display, and flexible decision support in time-critical, limited data situations.

  16. A High Speed Mobile Courier Data Access System That Processes Database Queries in Real-Time

    NASA Astrophysics Data System (ADS)

    Gatsheni, Barnabas Ndlovu; Mabizela, Zwelakhe

    A secure high-speed query processing mobile courier data access (MCDA) system for a Courier Company has been developed. This system uses the wireless networks in combination with wired networks for updating a live database at the courier centre in real-time by an offsite worker (the Courier). The system is protected by VPN based on IPsec. There is no system that we know of to date that performs the task for the courier as proposed in this paper.

  17. Evaluating the Effectiveness of Information Retrieval Systems Using Simulated Queries.

    ERIC Educational Resources Information Center

    Gordon, Michael D.

    1990-01-01

    Describes a simulation method for estimating recall and fallout in a document retrieval system. Earlier research on simulating document retrieval systems is reviewed, examples are presented of the current method, a probabilistic justification of the method is given, theoretical concerns dealing with retrieval precision are discussed, and further…

  18. Optimizing query response with XML user profile in mobile clinical systems.

    PubMed

    Park, Heekyong; Yoo, Sooyoung; Kim, Boyoung; Choi, Jinwook; Chun, Jonghoon

    2003-01-01

    Improvements of modern mobile technology, have created a need for a mobile clinical environment. In the field of mobile clinical systems, getting information on time is as important as mission critical aspects. However, web access time with the mobile device is still not feasible clinically. Therefore, the optimisation of query response becomes an important issue. We have developed a query optimising method using a user profile. We analysed user (clinician) specific queries in the medical field. Most of the data retrieval in the medical field is focused on the clinical test results, and the patient inverted exclamation mark s demographic information. Sometimes the information requested in the medical field places a heavy load on the database, since such information may require full database scanning and much joining of tables in the databases. In such cases, constructing profile data and employing it for data retrieval would help to improve the response time. The use of a predefined profile avoids the multiple joining process, and shortens the total response time. The object of our research is to improve query response by creating user profiles and using this profile information for patient data retrieval.

  19. Foundations of a query and simulation system for the modeling of biochemical and biological processes.

    PubMed

    Antoniotti, M; Park, F; Policriti, A; Ugel, N; Mishra, B

    2003-01-01

    The analysis of large amounts of data, produced as (numerical) traces of in vivo, in vitro and in silico experiments, has become a central activity for many biologists and biochemists. Recent advances in the mathematical modeling and computation of biochemical systems have moreover increased the prominence of in silico experiments; such experiments typically involve the simulation of sets of Differential Algebraic Equations (DAE), e.g., Generalized Mass Action systems (GMA) and S-systems. In this paper we reason about the necessary theoretical and pragmatic foundations for a query and simulation system capable of analyzing large amounts of such trace data. To this end, we propose to combine in a novel way several well-known tools from numerical analysis (approximation theory), temporal logic and verification, and visualization. The result is a preliminary prototype system: simpathica/xssys. When dealing with simulation data simpathica/xssys exploits the special structure of the underlying DAE, and reduces the search space in an efficient way so as to facilitate any queries about the traces. The proposed system is designed to give the user possibility to systematically analyze and simultaneously query different possible timed evolutions of the modeled system.

  20. The distribution and query systems of the RCSB Protein Data Bank

    PubMed Central

    Bourne, Philip E.; Addess, Kenneth J.; Bluhm, Wolfgang F.; Chen, Li; Deshpande, Nita; Feng, Zukang; Fleri, Ward; Green, Rachel; Merino-Ott, Jeffrey C.; Townsend-Merino, Wayne; Weissig, Helge; Westbrook, John; Berman, Helen M.

    2004-01-01

    The Protein Data Bank (PDB; http://www.pdb.org) is the primary source of information on the 3D structure of biological macromolecules. The PDB’s mandate is to disseminate this information in the most usable form and as widely as possible. The current query and distribution system is described and an alpha version of the future re-engineered system introduced. PMID:14681399

  1. Army Non-Programmer System for Working Encyclopedia Request (ANSWER)

    DTIC Science & Technology

    1992-09-01

    1.2 ANSWER Program Objectives The objective of the ANSWER program is to conduct reseach and develop prototype tools that provide uniform, integrated...Pushbutton "OK" to close the dialog and accept changes to the selected node. - Pushbutton " Cancer to close the dialog and make no changes to the selected node...8217Integrate" to command the integration to take place; enabled if at least one set of items have been declared equivalent - Pushbutton " Cancer to close

  2. Geodata Modeling and Query in Geographic Information Systems

    NASA Technical Reports Server (NTRS)

    Adam, Nabil

    1996-01-01

    Geographic information systems (GIS) deal with collecting, modeling, man- aging, analyzing, and integrating spatial (locational) and non-spatial (attribute) data required for geographic applications. Examples of spatial data are digital maps, administrative boundaries, road networks, and those of non-spatial data are census counts, land elevations and soil characteristics. GIS shares common areas with a number of other disciplines such as computer- aided design, computer cartography, database management, and remote sensing. None of these disciplines however, can by themselves fully meet the requirements of a GIS application. Examples of such requirements include: the ability to use locational data to produce high quality plots, perform complex operations such as network analysis, enable spatial searching and overlay operations, support spatial analysis and modeling, and provide data management functions such as efficient storage, retrieval, and modification of large datasets; independence, integrity, and security of data; and concurrent access to multiple users. It is on the data management issues that we devote our discussions in this monograph. Traditionally, database management technology have been developed for business applications. Such applications require, among other things, capturing the data requirements of high-level business functions and developing machine- level implementations; supporting multiple views of data and yet providing integration that would minimize redundancy and maintain data integrity and security; providing a high-level language for data definition and manipulation; allowing concurrent access to multiple users; and processing user transactions in an efficient manner. The demands on database management systems have been for speed, reliability, efficiency, cost effectiveness, and user-friendliness. Significant progress have been made in all of these areas over the last two decades to the point that many generalized database platforms

  3. A natural language query system for Hubble Space Telescope proposal selection

    NASA Technical Reports Server (NTRS)

    Hornick, Thomas; Cohen, William; Miller, Glenn

    1987-01-01

    The proposal selection process for the Hubble Space Telescope is assisted by a robust and easy to use query program (TACOS). The system parses an English subset language sentence regardless of the order of the keyword phases, allowing the user a greater flexibility than a standard command query language. Capabilities for macro and procedure definition are also integrated. The system was designed for flexibility in both use and maintenance. In addition, TACOS can be applied to any knowledge domain that can be expressed in terms of a single reaction. The system was implemented mostly in Common LISP. The TACOS design is described in detail, with particular attention given to the implementation methods of sentence processing.

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

    PubMed

    Brinkley, James F; Detwiler, Landon T

    2012-10-01

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

  5. A Query Integrator and Manager for the Query Web

    PubMed Central

    Brinkley, James F.; Detwiler, Landon T.

    2012-01-01

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

  6. TrustQ: a category reputation based question and answer system

    NASA Astrophysics Data System (ADS)

    Lin, Yuhua; Shen, Haiying

    2014-06-01

    Question and Answering (Q/A) systems aggregate the collected intelligence of all users to provide satisfying answers for questions. A well-developed Q/A system should provide high question response rate, low response delay and good answer quality. Previous works use reputation systems to achieve the goals. However, these reputation systems evaluate a user with an overall rating for all questions the user has answered regardless of the question categories, thus the reputation score cannot accurately reflect the user's ability to answer a question in a specific category. In this paper, we propose TtustQ, a category reputation based Q/A System. TtustQ evaluates users' willingness and capability to answer questions in different categories. Considering a user has different willingness to answer questions from different users, TtustQ lets each node evaluate the reputation of other nodes answering its own questions. User a calculates user b's final reputation by considering both user a's direct rating and the indirect ratings on user b from other nodes. The reputation values facilitate forwarding a question to potential answerers, which improves the question response rate, response delay and answer quality. Our trace-driven simulation on PeerSim demonstrates the effectiveness of TtustQ in providing good user experience in terms of response rate and latency, and the answer quality.

  7. Digital terrain model (DTM) integration and three-dimensional query spaces in geographic information systems

    NASA Astrophysics Data System (ADS)

    Fritsch, Dieter; Schmidt, Dieter

    1994-08-01

    The integration of digital terrain models (DTM) in geographic information systems (GIS) implies automatically an extension of the GIS reference surface and its query space. It is trivial that a DTM is the natural boundary representation of the earth's surface. Man-made objects, for instance homes, streets, bridges, dams should be considered in a second step because these objects cannot be represented well by boundary surfaces. The link of these objects to DTM can be realized by keys and pointers. Therefore, an efficient DTM integration in GIS is the first task to be solved. The paper introduces DTM data structures represented by NIAM diagrams. Using the entity-relationship model these diagrams are very capable to describe the power of relations. Next a 3-D query space is defined keeping in mind 3-D coordinates and 2- D topological elements. Based on this query space spatial operators are derived which fit in standard SQL vocabulary. The implementation part of the paper uses the exodus storage manger to map the DTM of the Federal State Baden-Wurrtemberg in a spatial database system.

  8. Knowledge based question answering

    SciTech Connect

    Pazzani, M.J.; Engelman, C.

    1983-01-01

    The natural language database query system incorporated in the Knobs Interactive Planning System comprises a dictionary driven parser, APE-II, and script interpreter whch yield a conceptual dependency as a representation of the meaning of user input. A conceptualisation pattern matching production system then determines and executes a procedure for extracting the desired information from the database. In contrast to syntax driven q-a systems, e.g. those based on atn parsers, APE-II is driven bottom-up by expectations associated with word meanings. The goals of this approach include utilising similar representations for questions with similar meanings but widely varying surface structures, developing a powerful mechanism for the disambiguation of words with multiple meanings and the determination of pronoun referents, answering questions which require inferences to be understood, and interpreting ellipses and ungrammatical statements. The Knobs demonstration system is an experimental, expert system for air force mission planning applications. 16 refs.

  9. Querying Proofs

    NASA Technical Reports Server (NTRS)

    Aspinall, David; Denney, Ewen; Lueth, Christoph

    2012-01-01

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

  10. Parallelization Issues of Domain Specific Question Answering System on Cell B.E. Processors

    NASA Astrophysics Data System (ADS)

    Kumar, Tarun; Mittal, Ankush; Sondhi, Parikshit

    A question answering system is an information retrieval application which allows users to directly obtain appropriate answers to a question. In order to deal with an explosive growth of information over internet and increased number of processing stages in answer retrieval, time and processing hardware required by question answering system has increased. The need of hardware is currently served by connecting thousands of computers in cluster. But faster and less complex alternatives can be found as a multi-core processor. This paper presents a pioneer work by identifying major issues involved in porting a general question answering framework on a cell processor and their possible solutions. The work is evaluated by porting the indexing algorithm of our biomedical question answering system, INDOC (Internet Doctor) on cell processors.

  11. 78 FR 56263 - HydroGen Corp., QueryObject Systems Corp., Security Intelligence Technologies, Inc., Skins, Inc...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-09-12

    ... From the Federal Register Online via the Government Publishing Office SECURITIES AND EXCHANGE COMMISSION HydroGen Corp., QueryObject Systems Corp., Security Intelligence Technologies, Inc., Skins, Inc... and accurate information concerning the securities of Security Intelligence Technologies, Inc....

  12. Computer systems and methods for the query and visualization of multidimensional database

    DOEpatents

    Stolte, Chris; Tang, Diane L.; Hanrahan, Patrick

    2010-05-11

    A method and system for producing graphics. A hierarchical structure of a database is determined. A visual table, comprising a plurality of panes, is constructed by providing a specification that is in a language based on the hierarchical structure of the database. In some cases, this language can include fields that are in the database schema. The database is queried to retrieve a set of tuples in accordance with the specification. A subset of the set of tuples is associated with a pane in the plurality of panes.

  13. Computer systems and methods for the query and visualization of multidimensional databases

    DOEpatents

    Stolte, Chris; Tang, Diane L.; Hanrahan, Patrick

    2006-08-08

    A method and system for producing graphics. A hierarchical structure of a database is determined. A visual table, comprising a plurality of panes, is constructed by providing a specification that is in a language based on the hierarchical structure of the database. In some cases, this language can include fields that are in the database schema. The database is queried to retrieve a set of tuples in accordance with the specification. A subset of the set of tuples is associated with a pane in the plurality of panes.

  14. User Satisfaction Evaluation of the EHR4CR Query Builder: A Multisite Patient Count Cohort System

    PubMed Central

    Soto-Rey, Iñaki; N'Dja, Aurèle; Cunningham, James; Newe, Axel; Trinczek, Benjamin; Lafitte, Caroline; Sedlmayr, Brita; Fritz, Fleur

    2015-01-01

    The Electronic Health Records for Clinical Research (EHR4CR) project aims to develop services and technology for the leverage reuse of Electronic Health Records with the purpose of improving the efficiency of clinical research processes. A pilot program was implemented to generate evidence of the value of using the EHR4CR platform. The user acceptance of the platform is a key success factor in driving the adoption of the EHR4CR platform; thus, it was decided to evaluate the user satisfaction. In this paper, we present the results of a user satisfaction evaluation for the EHR4CR multisite patient count cohort system. This study examined the ability of testers (n = 22 and n = 16 from 5 countries) to perform three main tasks (around 20 minutes per task), after a 30-minute period of self-training. The System Usability Scale score obtained was 55.83 (SD: 15.37), indicating a moderate user satisfaction. The responses to an additional satisfaction questionnaire were positive about the design of the interface and the required procedure to design a query. Nevertheless, the most complex of the three tasks proposed in this test was rated as difficult, indicating a need to improve the system regarding complicated queries. PMID:26539525

  15. Design and implementation of the European Space Information System query environment

    SciTech Connect

    Fuchs, J.J. ); Ciarlo, A. ); Benso, S. )

    1993-08-01

    The European Space Information System (ESIS) project is a major pilot project undertaken by the European Space Agency's Research and Information center, ESRIN. It has as its primary aim to design and develop a set of information systems which will form an integrated environment for the retrieval, dissemination, and application of space scientific data. One of these information systems which shall form an important part of the ESIS concept is the ESIS Query Environment (ESIS QE). The ESIS QE project is concerned with the development of a distributed software system which shall provide its users with an environment allowing for uniform and easy access to a set of heterogeneous and geographically distributed databases and space science data archives. (AIP)

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

  17. Army technology development. IBIS query. Software to support the Image Based Information System (IBIS) expansion for mapping, charting and geodesy

    NASA Technical Reports Server (NTRS)

    Friedman, S. Z.; Walker, R. E.; Aitken, R. B.

    1986-01-01

    The Image Based Information System (IBIS) has been under development at the Jet Propulsion Laboratory (JPL) since 1975. It is a collection of more than 90 programs that enable processing of image, graphical, tabular data for spatial analysis. IBIS can be utilized to create comprehensive geographic data bases. From these data, an analyst can study various attributes describing characteristics of a given study area. Even complex combinations of disparate data types can be synthesized to obtain a new perspective on spatial phenomena. In 1984, new query software was developed enabling direct Boolean queries of IBIS data bases through the submission of easily understood expressions. An improved syntax methodology, a data dictionary, and display software simplified the analysts' tasks associated with building, executing, and subsequently displaying the results of a query. The primary purpose of this report is to describe the features and capabilities of the new query software. A secondary purpose of this report is to compare this new query software to the query software developed previously (Friedman, 1982). With respect to this topic, the relative merits and drawbacks of both approaches are covered.

  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. Do Online Information Retrieval Systems Help Experienced Clinicians Answer Clinical Questions?

    PubMed Central

    Westbrook, Johanna I.; Coiera, Enrico W.; Gosling, A. Sophie

    2005-01-01

    Objective: To assess the impact of clinicians' use of an online information retrieval system on their performance in answering clinical questions. Design: Pre-/post-intervention experimental design. Measurements: In a computer laboratory, 75 clinicians (26 hospital-based doctors, 18 family practitioners, and 31 clinical nurse consultants) provided 600 answers to eight clinical scenarios before and after the use of an online information retrieval system. We examined the proportion of correct answers pre- and post-intervention, direction of change in answers, and differences between professional groups. Results: System use resulted in a 21% improvement in clinicians' answers, from 29% (95% confidence interval [CI] 25.4–32.6) correct pre- to 50% (95% CI 46.0–54.0) post-system use. In 33% (95% CI 29.1–36.9) answers were changed from incorrect to correct. In 21% (95% CI 17.1–23.9) correct pre-test answers were supported by evidence found using the system, and in 7% (95% CI 4.9–9.1) correct pre-test answers were changed incorrectly. For 40% (35.4–43.6) of scenarios, incorrect pre-test answers were not rectified following system use. Despite significant differences in professional groups' pre-test scores [family practitioners: 41% (95% CI 33.0–49.0), hospital doctors: 35% (95% CI 28.5–41.2), and clinical nurse consultants: 17% (95% CI 12.3–21.7; χ2 = 29.0, df = 2, p < 0.01)], there was no difference in post-test scores. (χ2 = 2.6, df = 2, p = 0.73). Conclusions: The use of an online information retrieval system was associated with a significant improvement in the quality of answers provided by clinicians to typical clinical problems. In a small proportion of cases, use of the system produced errors. While there was variation in the performance of clinical groups when answering questions unaided, performance did not differ significantly following system use. Online information retrieval systems can be an effective tool in improving the accuracy of

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

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

    PubMed

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

    2012-06-01

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

  2. Reducing the Conflict Factors Strategies in Question Answering System

    NASA Astrophysics Data System (ADS)

    Suwarningsih, W.; Purwarianti, A.; Supriana, I.

    2017-03-01

    A rule-based system is prone to conflict as new knowledge every time will emerge and indirectly must sign in to the knowledge base that is used by the system. A conflict occurred between the rules in the knowledge base can lead to the errors of reasoning or reasoning circulation. Therefore, when added, the new rules will lead to conflict with other rules, and the only rules that really can be added to the knowledge base. From these conditions, this paper aims to propose a conflict resolution strategy for a medical debriefing system by analyzing scenarios based upon the runtime to improve the efficiency and reliability of systems.

  3. Some questions and answers about the Satellite Power System (SPS)

    NASA Technical Reports Server (NTRS)

    1980-01-01

    Progress in the evaluation of the concept of obtaining significant amount of electrical energy from space through the Satellite Power System is reported. The Concept Development and Evaluation Program plan is described including: systems definition, environmental assessment, societal assessment, and comparative assessment.

  4. Reducing Our Ignorance: Finding Answers to Certain Epistemic Questions for Software Systems

    NASA Technical Reports Server (NTRS)

    Holloway, C. Michael; Johnson, Christopher W.

    2011-01-01

    In previous papers, we asserted that software system safety is primarily concerned with epistemic questions, that is, questions concerning knowledge and the degree of confidence that can be placed in that knowledge. We also enumerated a set of 21 foundational epistemic questions, discussed some of the difficulties that exist in answering these questions adequately today, and speculated briefly on possible research that may provide improved confidence in the sufficiency of answers in the future. This paper focuses on three of the foundational questions. For each of these questions, current answers are discussed and potential research is proposed to help increase the justifiable level of confidence.

  5. From Question Answering to Visual Exploration

    SciTech Connect

    McColgin, Dave W.; Gregory, Michelle L.; Hetzler, Elizabeth G.; Turner, Alan E.

    2006-08-11

    Research in Question Answering has focused on the quality of information retrieval or extraction using the metrics of precision and recall to judge success; these metrics drive toward finding the specific best answer(s) and are best supportive of a lookup type of search. These do not address the opportunity that users? natural language questions present for exploratory interactions. In this paper, we present an integrated Question Answering environment that combines a visual analytics tool for unstructured text and a state-of-the-art query expansion tool designed to compliment the cognitive processes associated with an information analysts work flow. Analysts are seldom looking for factoid answers to simple questions; their information needs are much more complex in that they may be interested in patterns of answers over time, conflicting information, and even related non-answer data may be critical to learning about a problem or reaching prudent conclusions. In our visual analytics tool, questions result in a comprehensive answer space that allows users to explore the variety within the answers and spot related information in the rest of the data. The exploratory nature of the dialog between the user and this system requires tailored evaluation methods that better address the evolving user goals and counter cognitive biases inherent to exploratory search tasks.

  6. Decomposition: A Strategy for Query Processing.

    ERIC Educational Resources Information Center

    Wong, Eugene; Youssefi, Karel

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

  7. User Performance with a Natural Language Query System for Command Control.

    DTIC Science & Technology

    1979-01-01

    Tektronix general—putpose interface bus. The 4051 operated the timing generator under program control in order to measure the latenc ies of various user...first and last characters. Times were obtained under program control by the l~ewlett—Packard timing generator . Use of LADDER Reference Folders. After a...query population). Notice that, on the average, LADDER takes more than 2 .5 times as long to reject a query as faulty (38.4 seconds) than it does to

  8. Robust Quantum Private Queries

    NASA Astrophysics Data System (ADS)

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

    2016-07-01

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

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

  10. Intelligent query by humming system based on score level fusion of multiple classifiers

    NASA Astrophysics Data System (ADS)

    Pyo Nam, Gi; Thu Trang Luong, Thi; Ha Nam, Hyun; Ryoung Park, Kang; Park, Sung-Joo

    2011-12-01

    Recently, the necessity for content-based music retrieval that can return results even if a user does not know information such as the title or singer has increased. Query-by-humming (QBH) systems have been introduced to address this need, as they allow the user to simply hum snatches of the tune to find the right song. Even though there have been many studies on QBH, few have combined multiple classifiers based on various fusion methods. Here we propose a new QBH system based on the score level fusion of multiple classifiers. This research is novel in the following three respects: three local classifiers [quantized binary (QB) code-based linear scaling (LS), pitch-based dynamic time warping (DTW), and LS] are employed; local maximum and minimum point-based LS and pitch distribution feature-based LS are used as global classifiers; and the combination of local and global classifiers based on the score level fusion by the PRODUCT rule is used to achieve enhanced matching accuracy. Experimental results with the 2006 MIREX QBSH and 2009 MIR-QBSH corpus databases show that the performance of the proposed method is better than that of single classifier and other fusion methods.

  11. A Social Learning Management System Supporting Feedback for Incorrect Answers Based on Social Network Services

    ERIC Educational Resources Information Center

    Son, Jiseong; Kim, Jeong-Dong; Na, Hong-Seok; Baik, Doo-Kwon

    2016-01-01

    In this research, we propose a Social Learning Management System (SLMS) enabling real-time and reliable feedback for incorrect answers by learners using a social network service (SNS). The proposed system increases the accuracy of learners' assessment results by using a confidence scale and a variety of social feedback that is created and shared…

  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. The CMS DBS query language

    NASA Astrophysics Data System (ADS)

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

    2010-04-01

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

  14. Querying Safety Cases

    NASA Technical Reports Server (NTRS)

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

    2014-01-01

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

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

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

    NASA Astrophysics Data System (ADS)

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

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

  17. The Silver Bullet Skunk Works: Holistic design of the answering system 1300

    SciTech Connect

    Andrews, A.K.

    1991-01-01

    The Silver Bullet Skunk Works, and experimental product realization team at AT T Consumer Products, designed and shipped a new telephone answering system to market in eight months, approximately one year faster than previous AT T products of similar complexity. This paper outlines the Design for X'' (DFX) philosophies and the team structure that enabled the group to accelerate the Product Realization Process. The Answering System 1300, developed in record time, was a successful product that met its schedule and cost objectives, and sold out its entire high-volume manufacturing run. Lessons learned from the Skunk Works experience have since been applied to other development activities in AT T Consumer Products. 3 figs.

  18. Natural language query system design for interactive information storage and retrieval systems. Presentation visuals. M.S. Thesis Final Report, 1 Jul. 1985 - 31 Dec. 1987

    NASA Technical Reports Server (NTRS)

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

    1985-01-01

    This Working Paper Series entry represents a collection of presentation visuals associated with the companion report entitled Natural Language Query System Design for Interactive Information Storage and Retrieval Systems, USL/DBMS NASA/RECON Working Paper Series report number DBMS.NASA/RECON-17.

  19. Vector measure for the intelligence of a Question-Answering (Q-A) system

    SciTech Connect

    Srivastava, A.; Rajaraman, V.

    1995-05-01

    The problem of quantification of intelligence of humans, and of intelligent systems, has been a challenging and controversial topic. IQ tests have been traditionally used to quantify human intelligence based on results of test designed by psychologists. It is in general very difficult to quantify intelligence. In this paper we consider a simple Question-Answering (Q-A) system and use this to quantify intelligence. We quantify intelligence as a vector with three components. The components consist of a measure of knowledge in asking questions, effectiveness of questions asked, and correctness of deduction. We formalize these parameters and have conducted experiments on humans to measure these parameters. 20 refs.

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

    PubMed Central

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

    2014-01-01

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

  1. Protecting count queries in study design

    PubMed Central

    Sarwate, Anand D; Boxwala, Aziz A

    2012-01-01

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

  2. Sample to answer: a fully integrated nucleic acid identification system for bacteria monitoring

    NASA Astrophysics Data System (ADS)

    Kim, Jungkyu; Elsnab, John; Johnson, Michael; Gale, Bruce K.

    2010-02-01

    A fully integrated microfluidic system was developed and incorporates an EC-MWCNT (electrochemical multiwalled carbon nanotube) sensor for the detection of bacteria. Sample metering, reagent metering and delivery was implemented with microvalves and pumps embedded inside the microfluidic system. The nucleic acid extraction was performed using microchannels controlled using automated platforms and a disposable microfluidic silica cartridge. The target samples were flowed and hybridized with probe ssDNA (single strand DNA) across the MWCNT-EC sensor (built on a silicon chip), which was embedded in a microfluidic cell. The 9-pad sensor was scanned before and after hybridization to measure the quantity of RNA (Ribonucleic acid) bound to the array surface. A rapid and accurate sample-in answer-out nucleic acid system was realized with automated volume metering, microfluidic sample preparation, and integrated nano-biosensors.

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

  4. INDUSTRIAL CONTROL SYSTEM CYBER SECURITY: QUESTIONS AND ANSWERS RELEVANT TO NUCLEAR FACILITIES, SAFEGUARDS AND SECURITY

    SciTech Connect

    Robert S. Anderson; Mark Schanfein; Trond Bjornard; Paul Moskowitz

    2011-07-01

    Typical questions surrounding industrial control system (ICS) cyber security always lead back to: What could a cyber attack do to my system(s) and; how much should I worry about it? These two leading questions represent only a fraction of questions asked when discussing cyber security as it applies to any program, company, business, or organization. The intent of this paper is to open a dialog of important pertinent questions and answers that managers of nuclear facilities engaged in nuclear facility security and safeguards should examine, i.e., what questions should be asked; and how do the answers affect an organization's ability to effectively safeguard and secure nuclear material. When a cyber intrusion is reported, what does that mean? Can an intrusion be detected or go un-noticed? Are nuclear security or safeguards systems potentially vulnerable? What about the digital systems employed in process monitoring, and international safeguards? Organizations expend considerable efforts to ensure that their facilities can maintain continuity of operations against physical threats. However, cyber threats particularly on ICSs may not be well known or understood, and often do not receive adequate attention. With the disclosure of the Stuxnet virus that has recently attacked nuclear infrastructure, many organizations have recognized the need for an urgent interest in cyber attacks and defenses against them. Several questions arise including discussions about the insider threat, adequate cyber protections, program readiness, encryption, and many more. These questions, among others, are discussed so as to raise the awareness and shed light on ways to protect nuclear facilities and materials against such attacks.

  5. Exploring U.S Cropland - A Web Service based Cropland Data Layer Visualization, Dissemination and Querying System (Invited)

    NASA Astrophysics Data System (ADS)

    Yang, Z.; Han, W.; di, L.

    2010-12-01

    The National Agricultural Statistics Service (NASS) of the USDA produces the Cropland Data Layer (CDL) product, which is a raster-formatted, geo-referenced, U.S. crop specific land cover classification. These digital data layers are widely used for a variety of applications by universities, research institutions, government agencies, and private industry in climate change studies, environmental ecosystem studies, bioenergy production & transportation planning, environmental health research and agricultural production decision making. The CDL is also used internally by NASS for crop acreage and yield estimation. Like most geospatial data products, the CDL product is only available by CD/DVD delivery or online bulk file downloading via the National Research Conservation Research (NRCS) Geospatial Data Gateway (external users) or in a printed paper map format. There is no online geospatial information access and dissemination, no crop visualization & browsing, no geospatial query capability, nor online analytics. To facilitate the application of this data layer and to help disseminating the data, a web-service based CDL interactive map visualization, dissemination, querying system is proposed. It uses Web service based service oriented architecture, adopts open standard geospatial information science technology and OGC specifications and standards, and re-uses functions/algorithms from GeoBrain Technology (George Mason University developed). This system provides capabilities of on-line geospatial crop information access, query and on-line analytics via interactive maps. It disseminates all data to the decision makers and users via real time retrieval, processing and publishing over the web through standards-based geospatial web services. A CDL region of interest can also be exported directly to Google Earth for mashup or downloaded for use with other desktop application. This web service based system greatly improves equal-accessibility, interoperability, usability

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

    PubMed Central

    Smith, Mark W; Barnett, Paul G

    2008-01-01

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

  7. A Novel Two-Tier Cooperative Caching Mechanism for the Optimization of Multi-Attribute Periodic Queries in Wireless Sensor Networks

    PubMed Central

    Zhou, ZhangBing; Zhao, Deng; Shu, Lei; Tsang, Kim-Fung

    2015-01-01

    Wireless sensor networks, serving as an important interface between physical environments and computational systems, have been used extensively for supporting domain applications, where multiple-attribute sensory data are queried from the network continuously and periodically. Usually, certain sensory data may not vary significantly within a certain time duration for certain applications. In this setting, sensory data gathered at a certain time slot can be used for answering concurrent queries and may be reused for answering the forthcoming queries when the variation of these data is within a certain threshold. To address this challenge, a popularity-based cooperative caching mechanism is proposed in this article, where the popularity of sensory data is calculated according to the queries issued in recent time slots. This popularity reflects the possibility that sensory data are interested in the forthcoming queries. Generally, sensory data with the highest popularity are cached at the sink node, while sensory data that may not be interested in the forthcoming queries are cached in the head nodes of divided grid cells. Leveraging these cooperatively cached sensory data, queries are answered through composing these two-tier cached data. Experimental evaluation shows that this approach can reduce the network communication cost significantly and increase the network capability. PMID:26131665

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

  9. Using Bitmap Indexing Technology for Combined Numerical and TextQueries

    SciTech Connect

    Stockinger, Kurt; Cieslewicz, John; Wu, Kesheng; Rotem, Doron; Shoshani, Arie

    2006-10-16

    In this paper, we describe a strategy of using compressedbitmap indices to speed up queries on both numerical data and textdocuments. By using an efficient compression algorithm, these compressedbitmap indices are compact even for indices with millions of distinctterms. Moreover, bitmap indices can be used very efficiently to answerBoolean queries over text documents involving multiple query terms.Existing inverted indices for text searches are usually inefficient forcorpora with a very large number of terms as well as for queriesinvolving a large number of hits. We demonstrate that our compressedbitmap index technology overcomes both of those short-comings. In aperformance comparison against a commonly used database system, ourindices answer queries 30 times faster on average. To provide full SQLsupport, we integrated our indexing software, called FastBit, withMonetDB. The integrated system MonetDB/FastBit provides not onlyefficient searches on a single table as FastBit does, but also answersjoin queries efficiently. Furthermore, MonetDB/FastBit also provides avery efficient retrieval mechanism of result records.

  10. Querying databases of trajectories of differential equations: Data structures for trajectories

    NASA Technical Reports Server (NTRS)

    Grossman, Robert

    1989-01-01

    One approach to qualitative reasoning about dynamical systems is to extract qualitative information by searching or making queries on databases containing very large numbers of trajectories. The efficiency of such queries depends crucially upon finding an appropriate data structure for trajectories of dynamical systems. 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 in set R sup N denote a parameterized path in Euclidean Space, and let the Euclidean Norm denote a norm on the space of paths. A data structure is defined to represent trajectories of dynamical systems, and an algorithm is sketched which answers queries.

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

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

  13. Visual graph query formulation and exploration: a new perspective on information retrieval at the edge

    NASA Astrophysics Data System (ADS)

    Kase, Sue E.; Vanni, Michelle; Knight, Joanne A.; Su, Yu; Yan, Xifeng

    2016-05-01

    Within operational environments decisions must be made quickly based on the information available. Identifying an appropriate knowledge base and accurately formulating a search query are critical tasks for decision-making effectiveness in dynamic situations. The spreading of graph data management tools to access large graph databases is a rapidly emerging research area of potential benefit to the intelligence community. A graph representation provides a natural way of modeling data in a wide variety of domains. Graph structures use nodes, edges, and properties to represent and store data. This research investigates the advantages of information search by graph query initiated by the analyst and interactively refined within the contextual dimensions of the answer space toward a solution. The paper introduces SLQ, a user-friendly graph querying system enabling the visual formulation of schemaless and structureless graph queries. SLQ is demonstrated with an intelligence analyst information search scenario focused on identifying individuals responsible for manufacturing a mosquito-hosted deadly virus. The scenario highlights the interactive construction of graph queries without prior training in complex query languages or graph databases, intuitive navigation through the problem space, and visualization of results in graphical format.

  14. Translation of the Data Flow Query Language for the Multimodel, Multibackend Database System

    DTIC Science & Technology

    1994-09-01

    the DBMS, but are not there. Or the organization can purchase each of the monolingual database systems it needs separately. Either alternative results...Implementation of a Functional IDaplex Data Interface or the Multlimodel ard Multilingual Database System, Master’s Thesis, Naval Postgraduate Scho’ol

  15. Proactive trust management system (PTMS) for trusted querying in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Shen, Bao-Hong; Tiwari, Abhishek; Topol, Zvi; Chandra, Harish; Xu, Shuli; Yadegar, Joseph; Srivastava, Mani; Luke, Jahn A.

    2009-05-01

    Wireless Sensor Networks (WSNs) are systems that may contain hundreds to thousands of low-power and low-cost sensor nodes. The potential applicability of such systems is enormous; security surveillance and intrusion detection systems for smart buildings and military bases, monitoring chemical plants for safety, wireless body area networks for first responders, and monitoring habitats and natural environments for scientific and other purposes, among others. As sensor network technology matures, we expect to witness an increasing number of such systems deployed in the real world. This renders sensor networks more accessible to a wide variety of possible attacks and functional faults, as they are deployed in remote, un-trusted, hostile environments. While different basic cryptographic building blocks and hardened hardware architectures for most sensor network platforms are currently available and allow for protection on a single sensor node basis, such building blocks are not effective in preventing wider scale attacks once a node has been compromised. To this end, UtopiaCompression is proposing Proactive Trust Management System (PTMS) for WSNs. Our solution is based on an easily extensible framework, tailored to deal with the resource constrained WSNs, and uses a combination of novel outlier detection mechanisms and trust management algorithms to effectively cope with common sensor faults and network attack models. Moreover, our solution is based on distributed in-network processing, which significantly improves scalability and extends life time of the system. This paper also discusses the implementation and evaluation of our solution on Sun SPOT sensors.

  16. Perchlorate Questions and Answers

    MedlinePlus

    ... EPA's Interim Health Advisory for Perchlorate in Public Water Systems On January 8, 2009, the Environmental Protection ... thyroid hormone. Questions and Answers about EPA’s Drinking Water Findings If perchlorate is present in my drinking ...

  17. Developing a registration entry and query system within the scope of harmonizing of the orthophoto metadata with the international standards

    NASA Astrophysics Data System (ADS)

    Şahin, İ.; Alkış, Z.

    2013-10-01

    Increase in the number of satellites and the utilization of digital cameras in the aerial photography has spread the use of satellite image and oriented aerial photograph as real or near-real time resolution, accessible, cost effective spatial data. Co-registered images or aerial photos corrected for the height variations and orthogonality (scale) have become an essential input for geographical information systems and spatial decision making due to their integration with the other spatial data. Beyond that, images and photographs compose infrastructure for the other information in usage of spatial data with the help of the access and query facility web providing. Although the issue of the aerial photo ortho-rectification has been solved long ago, the problems related with the storage of huge amount of photos and images, their management, processes, and user accesses have been raised. These subjects concern the multitudinous private and governmental institutes. Some governmental organizations and private companies have gained the technical ability to perform these works in recent times. This situation has lead to significant increase in the amount of aerial photograph taking and processing in one year for whole country. General Command of Mapping has been using digital aerial camera since 2008 for the photograph taking. The total area covered by the satellite images, purchased for different purposes, and the aerial photographs, taken for some revision purposes or demands of governmental and private institutes, has reached up to 200.000 km². It is considered that, colored and high resolution orthophotos of the whole country can be achieved within four years; provided that the annual production would continue similarly without any increase in amount. From the numbers given above, it is clear and inevitable that the orthophoto production procedure must be improved in order to produce orthophotos in the same year just after the photograph takings. Necessary studies

  18. A Model Driven Question-Answering System for a CAI Environment. Final Report (July 1970 to May 1972).

    ERIC Educational Resources Information Center

    Brown, John S.; And Others

    A question answering system which permits a computer-assisted instruction (CAI) student greater initiative in the variety of questions he can ask is described. A method is presented to represent the dynamic processes of a subject matter area by augmented finite state automata, which permits efficient inferencing about dynamic processes and…

  19. Content Based Retrieval Database Management System with Support for Similarity Searching and Query Refinement

    DTIC Science & Technology

    2002-01-01

    Management System. df Document Frequency. GIF Graphics Interchange Format Image File Format. HSV Hue , Saturation, Value Color Space. idf Inverse Document...is used to verify the safety criteria. A tuple is only returned if it successfully passes the safety test t.score > c, thus every returned tuple was...exploring the streams A and B in rank order. We test the maximum possible similarity score c for the current OABB against the set Saux of candidate tuples, if

  20. Interactive Query Processing in Big Data Systems: A Cross Industry Study of MapReduce Workloads

    DTIC Science & Technology

    2012-04-02

    information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and...MapReduce behavior using existing mental models. We then describe the MapReduce work- load traces (§ 3). The next few sections present empirical evidence...system: − How uniformly or skewed are the data accesses? − How much temporal locality exists ? 2. For workload-level provisioning and load shaping: − How

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

  2. Delay Assessment Framework for Automated Question-Answering System: An Approach for eLearning Paradigm

    ERIC Educational Resources Information Center

    Iqbal, Muhammad Munwar; Saleem, Yasir

    2017-01-01

    Adoption of Electronic Learning (eLearning) for the dissemination of higher education is rapidly increasing day by day. A large number of universities offering hundreds of course and a large number of the students are taking advantage from this type of learning paradigm. The purpose of this study is to investigate the delay factor in answering the…

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

    PubMed

    Taha, Kamal; Elmasri, Ramez

    2011-08-31

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

  4. [Data coding in the Israeli healthcare system - do choices provide the answers to our system's needs?].

    PubMed

    Zelingher, Julian; Ash, Nachman

    2013-05-01

    The IsraeLi healthcare system has undergone major processes for the adoption of health information technologies (HIT), and enjoys high Levels of utilization in hospital and ambulatory care. Coding is an essential infrastructure component of HIT, and ts purpose is to represent data in a simplified and common format, enhancing its manipulation by digital systems. Proper coding of data enables efficient identification, storage, retrieval and communication of data. UtiLization of uniform coding systems by different organizations enables data interoperability between them, facilitating communication and integrating data elements originating in different information systems from various organizations. Current needs in Israel for heaLth data coding include recording and reporting of diagnoses for hospitalized patients, outpatients and visitors of the Emergency Department, coding of procedures and operations, coding of pathology findings, reporting of discharge diagnoses and causes of death, billing codes, organizational data warehouses and national registries. New national projects for cLinicaL data integration, obligatory reporting of quality indicators and new Ministry of Health (MOH) requirements for HIT necessitate a high Level of interoperability that can be achieved only through the adoption of uniform coding. Additional pressures were introduced by the USA decision to stop the maintenance of the ICD-9-CM codes that are also used by Israeli healthcare, and the adoption of ICD-10-C and ICD-10-PCS as the main coding system for billing purpose. The USA has also mandated utilization of SNOMED-CT as the coding terminology for the ELectronic Health Record problem list, and for reporting quality indicators to the CMS. Hence, the Israeli MOH has recently decided that discharge diagnoses will be reported using ICD-10-CM codes, and SNOMED-CT will be used to code the cLinical information in the EHR. We reviewed the characteristics, strengths and weaknesses of these two coding

  5. Qualified answers that reflect user needs and preferences

    SciTech Connect

    Gaasterland, T.; Lobo, J.

    1994-12-31

    This paper introduces a formalism to describe the needs and preferences of database users. Because of the precise formulation of these concepts, we have found an automatic and {ital very simple} mechanism to incorporate user needs and preferences into the query answering process. In the formalism, the user provides a lattice of domain independent values that define preferences and needs and a set of domain specific {ital user constraints} qualified with lattice values. The constraints are automatically incorporated into a relational or deductive database through a series of syntactic transformations that produces an annotated deductive database. Query answering procedures for deductive databases are then used, with minor modifications, to obtain annotated answers to queries. Because preference declaration is separated from data representation and management, preferences can be easily altered without touching the database. Also, the query language allows users to ask for answers at different preference levels. 18 refs., 1 fig.

  6. The answering system to yes-no truth-functional questions in Korean-English bilingual children.

    PubMed

    Choi, Hansook

    2014-06-01

    This study presents an experiment that explores the patterns of answers to yes-no truth-functional questions in English and Korean. The answering patterns are examined from 12 Korean-English bilingual children and 10 Korean-monolingual children. Four types of sentences in relation to given situations (Wason in Br J Psychol 52:133-142, 1961) were provided as questions such as true affirmative (TA), true negative (TN), false affirmative (FA), and false negative (FN). The bilingual children's answers were observed in separate language settings, English and Korean. The results by the bilingual in the Korean setting were compared with those by the monolinguals. The results show that bilingual children can process two systems rather successfully by providing correct responses to the given questions. But difficulty patterns, measured from error rates in each setting, are found different in two languages. The bilinguals' difficulty patterns in English and Korean, however, show deviation from monolinguals' difficulty patterns suggested in previous studies (Wason in Br J Psychol 52:133-142, 1961, Akiyama in Dev Psychol 20:219-228, 1984, Kim in Dev Psychol 21(3):462-472, 1985, Choi in Dev Psychol 29(3):407-420, 1991). The present work also shows that negatives are not uniformly reported with more errors than affirmatives when the truth condition and the answering system are further involved. All in all, the current study suggests that bilingual children have two separate processing systems for yes-no truth-functional questions. However, the two systems cannot be understood as a simple coexistence of two monolingual systems. Interaction of the two competing linguistic systems is discussed further.

  7. QU at TREC-2015: Building Real-Time Systems for Tweet Filtering and Question Answering

    DTIC Science & Technology

    2015-11-20

    stream and responds to users’ information needs in real-time. For the microblog track, given a set of users’ interest pro- files, we developed two online...retrieved back their answers. 1. INTRODUCTION Twitter has rapidly developed over the past years and be- come a massive information sharing network...TWEET FILTERING Tweet filtering is the reverse of ad-hoc tweet search, where a user provides an information need at a certain point in time, and the

  8. Perspectives on the Massachusetts Community Health Information Profile (MassCHIP): developing an online data query system to target a variety of user needs and capabilities.

    PubMed

    Cohen, Bruce B; Franklin, Saul; West, James K

    2006-01-01

    The Massachusetts Community Health Information Profile (MassCHIP) has many distinctive features. These features evolved to maximize the usefulness of this query system for a broad group of users with varied needs, differing levels of knowledge about public health, and diverse experience using public health data. Three major features of MassCHIP help target our large user population. These features are as follows: (1) multiple avenues of entry to initiate queries ranging from an alphabetical list of simple topics to detailed International Classification of Disease codes; (2) the inclusion of data sets from other state agencies in addition to those of the Massachusetts Department of Public Health to reflect a broad view of public health; and (3) the capacity to retrieve data for multiple levels of geography, from the neighborhood through the state, including planning districts and hospitals. In this article, we discuss the history and design of MassCHIP, and focus on the features of MassCHIP that target a great variety of user needs and capabilities, and which are distinctive among Web-based data query systems.

  9. SAM Chemical Methods Query

    EPA Pesticide Factsheets

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

  10. SAM Radiochemical Methods Query

    EPA Pesticide Factsheets

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

  11. SAM Biotoxin Methods Query

    EPA Pesticide Factsheets

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

  12. SAM Pathogen Methods Query

    EPA Pesticide Factsheets

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

  13. SAM Methods Query

    EPA Pesticide Factsheets

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

  14. Neural cryptography with queries

    NASA Astrophysics Data System (ADS)

    Ruttor, Andreas; Kinzel, Wolfgang; Kanter, Ido

    2005-01-01

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

  15. Advanced Query Techniques.

    DTIC Science & Technology

    1979-10-01

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

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

    ERIC Educational Resources Information Center

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

    2003-01-01

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

  17. The RCSB Protein Data Bank: a redesigned query system and relational database based on the mmCIF schema

    PubMed Central

    Deshpande, Nita; Addess, Kenneth J.; Bluhm, Wolfgang F.; Merino-Ott, Jeffrey C.; Townsend-Merino, Wayne; Zhang, Qing; Knezevich, Charlie; Xie, Lie; Chen, Li; Feng, Zukang; Kramer Green, Rachel; Flippen-Anderson, Judith L.; Westbrook, John; Berman, Helen M.; Bourne, Philip E.

    2005-01-01

    The Protein Data Bank (PDB) is the central worldwide repository for three-dimensional (3D) structure data of biological macromolecules. The Research Collaboratory for Structural Bioinformatics (RCSB) has completely redesigned its resource for the distribution and query of 3D structure data. The re-engineered site is currently in public beta test at http://pdbbeta.rcsb.org. The new site expands the functionality of the existing site by providing structure data in greater detail and uniformity, improved query and enhanced analysis tools. A new key feature is the integration and searchability of data from over 20 other sources covering genomic, proteomic and disease relationships. The current capabilities of the re-engineered site, which will become the RCSB production site at http://www.pdb.org in late 2005, are described. PMID:15608185

  18. AN ANALYSIS OF QUESTIONS AND ANSWERS IN LIBRARIES. STUDIES IN THE MAN-SYSTEM INTERFACE IN LIBRARIES, REPORT NO. 1.

    ERIC Educational Resources Information Center

    HIEBER, CAROLINE E.

    TRADITIONAL METHODS OF ANALYZING QUESTIONS AND ANSWERS AS THEY OCCUR IN REFERENCE LIBRARIES ARE DISCUSSED AND CRITICIZED. METHODS OF EXAMINING QUESTIONS, THE QUESTION-ANSWERING PROCESS, AND ANSWERS TO QUESTIONS ARE EVALUATED. A PRAGMATIC SCHEME IS SUGGESTED WHICH CLASSIFIES ANSWERS BY THEIR FORMATS, DIVIDING THEM INTO EXACT-REPRODUCTION TYPE,…

  19. Instance-Based Question Answering

    DTIC Science & Technology

    2006-12-01

    answer clustering, composition, and scoring. Moreover, with the effort dedicated to improving monolingual system performance, system parameters are...text collections: document type, manual or automatic annotations (if any), and stylistic and notational differences in technical terms. Monolingual ...forum in which cross language retrieval systems and question answering systems are tested for various Eu- ropean languages. The CLEF QA monolingual task

  20. Superfund Chemical Data Matrix (SCDM) Query

    EPA Pesticide Factsheets

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

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

    EPA Pesticide Factsheets

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

  2. CMU OAQA at TREC 2015 LiveQA: Discovering the Right Answer with Clues

    DTIC Science & Technology

    2015-11-20

    retrieved a collection of web pages based on those queries. Then we extracted answer can- didates from web pages in the form of answer passages and their...Answer candidates (title/body/answer tuples that represent either con- ceptional questions or answer texts) are extracted from web pages, and ranked...ument title and search snippet extracted from a web page. Finally, we heuristically select answer passage text a passage based on its relative position

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

  4. A Microprocessor Architecture for Bibliographic Retrieval System.

    ERIC Educational Resources Information Center

    Martella, G.; Gobbi, G.

    1981-01-01

    Proposes a microprocessor-based architecture that makes large use of parallelism both in processing and in retrieval operations. The proposed system consists of three functional blocks: the query processor, simple query executers, and the answer composer. Twenty-one references are listed. (FM)

  5. Questions and Answers About the Effects of Septic Systems on Water Quality in the La Pine Area, Oregon

    USGS Publications Warehouse

    Williams, John S.; Morgan, David S.; Hinkle, Stephen R.

    2007-01-01

    Nitrate levels in the ground-water aquifer underlying the central Oregon city of La Pine and the surrounding area are increasing due to contamination from residential septic systems. This contamination has public health implications because ground water is the sole source of drinking water for area residents. The U.S. Geological Survey, in cooperation with Deschutes County and the Oregon Department of Environmental Quality, studied the movement and chemistry of nitrate in the aquifer and developed computer models that can be used to predict future nitrate levels and to evaluate alternatives for protecting water quality. This fact sheet summarizes the results of that study in the form of questions and answers.

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

  7. Managing and Querying Whole Slide Images

    PubMed Central

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

    2012-01-01

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

  8. Managing and querying whole slide images

    NASA Astrophysics Data System (ADS)

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

    2012-02-01

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

  9. Flexible Answers.

    ERIC Educational Resources Information Center

    Seeley, James

    1997-01-01

    Describes how schools are investigating single-ply roofing systems for new and retrofit construction. Discusses some of the considerations in seaming together a single-ply roof, steps in choosing roofing material and a roofing contractor, warranty advice, and the importance of keeping records on roof maintenance. (RJM)

  10. Selecting a computer-assisted retrieval system: one answer to office automation.

    PubMed

    Bogue, D T

    1983-11-01

    Computer-assisted retrieval (CAR) systems combine computers with microfilm to create a cost-effective, productive method of managing information. CAR systems range in size from large computerized mass-storage systems utilizing image scanning and digitized technologies to small, tabletop, standalone microprocessor-driven systems. When properly configured, a CAR system can not only provide vital information today, but will also be able to grow and expand into a total office system.

  11. Getting a Cohesive Answer from a Common Start: Scalable Multidisciplinary Analysis through Transformation of a Systems Model

    NASA Technical Reports Server (NTRS)

    Cole, Bjorn; Chung, Seung

    2012-01-01

    One of the challenges of systems engineering is in working multidisciplinary problems in a cohesive manner. When planning analysis of these problems, system engineers must trade between time and cost for analysis quality and quantity. The quality often correlates with greater run time in multidisciplinary models and the quantity is associated with the number of alternatives that can be analyzed. The trade-off is due to the resource intensive process of creating a cohesive multidisciplinary systems model and analysis. Furthermore, reuse or extension of the models used in one stage of a product life cycle for another is a major challenge. Recent developments have enabled a much less resource-intensive and more rigorous approach than hand-written translation scripts between multi-disciplinary models and their analyses. The key is to work from a core systems model defined in a MOF-based language such as SysML and in leveraging the emerging tool ecosystem, such as Query/View/Transformation (QVT), from the OMG community. SysML was designed to model multidisciplinary systems. The QVT standard was designed to transform SysML models into other models, including those leveraged by engineering analyses. The Europa Habitability Mission (EHM) team has begun to exploit these capabilities. In one case, a Matlab/Simulink model is generated on the fly from a system description for power analysis written in SysML. In a more general case, symbolic analysis (supported by Wolfram Mathematica) is coordinated by data objects transformed from the systems model, enabling extremely flexible and powerful design exploration and analytical investigations of expected system performance.

  12. Getting a Cohesive Answer from a Common Start: Scalable Multidisciplinary Analysis through Transformation of a System Model

    NASA Technical Reports Server (NTRS)

    Cole, Bjorn; Chung, Seung H.

    2012-01-01

    One of the challenges of systems engineering is in working multidisciplinary problems in a cohesive manner. When planning analysis of these problems, system engineers must tradeoff time and cost for analysis quality and quantity. The quality is associated with the fidelity of the multidisciplinary models and the quantity is associated with the design space that can be analyzed. The tradeoff is due to the resource intensive process of creating a cohesive multidisciplinary system model and analysis. Furthermore, reuse or extension of the models used in one stage of a product life cycle for another is a major challenge. Recent developments have enabled a much less resource-intensive and more rigorous approach than handwritten translation scripts or codes of multidisciplinary models and their analyses. The key is to work from a core system model defined in a MOF-based language such as SysML and in leveraging the emerging tool ecosystem, such as Query-View- Transform (QVT), from the OMG community. SysML was designed to model multidisciplinary systems and analyses. The QVT standard was designed to transform SysML models. The Europa Hability Mission (EHM) team has begun to exploit these capabilities. In one case, a Matlab/Simulink model is generated on the fly from a system description for power analysis written in SysML. In a more general case, a symbolic mathematical framework (supported by Wolfram Mathematica) is coordinated by data objects transformed from the system model, enabling extremely flexible and powerful tradespace exploration and analytical investigations of expected system performance.

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

  14. FRS EZ Query

    EPA Pesticide Factsheets

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

  15. The StarView intelligent query mechanism

    NASA Technical Reports Server (NTRS)

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

    1993-01-01

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

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

    PubMed Central

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

    2002-01-01

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

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

    PubMed

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

    2002-01-01

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

  18. Generalized queries on probabilistic context-free grammars

    SciTech Connect

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

    1996-12-31

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

  19. A System for Individualizing Instruction. Practical Answers to U-SAIL Implementation Questions. Monograph No. 4.

    ERIC Educational Resources Information Center

    Utah System Approach to Individualized Learning Project.

    The U-SAIL system is a practical approach to individualization of instruction in which a problem-solving process is employed to install a program in logical sequential phases. U-SAIL is a nationally validated, successfully replicated, cost-feasible system for individualization of instruction which can be implemented in a variety of settings with…

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

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

    PubMed

    Howsepian, A A

    2008-04-01

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

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

  3. A need for closer examination of FASD by the criminal justice system: has the call been answered?

    PubMed

    Gagnier, Karina Royer; Moore, Timothy E; Green, Melvyn

    2011-01-01

    Individuals with FASD exhibit deficits in many domains that can include memory, learning, behavioural inhibition, executive functioning, interpersonal skills, and language. These deficits have serious implications for affected persons when they become engaged in the legal system. In 2004, Moore and Green reviewed case law and psychological literature which suggested that FASD-related deficits placed affected individuals at a significant disadvantage in the justice system. According to them, this disadvantage stemmed from the limited awareness and knowledge of FASD demonstrated by key players in the justice system, as well as the scarcity of effective interventions in place to rehabilitate affected defendants. The aim of the current paper is to assess the extent to which awareness of FASD-related issues in the Canadian justice system has advanced since the publication of Moore and Green's conclusions. First, the deficits associated with FASD and their implications for the justice system are described. Next, recent case law and psychological evidence are reviewed as we consider issues of witness reliability and false confessions. The significance of FASD for sentencing, fitness to stand trial, and the Not Criminally Responsible by Reason of Mental Disorder defence are also briefly discussed. Finally, emerging system wide responses to FASD-related issues are presented. Overall, it appears that the call for closer examination of FASD by the justice system has been answered, but a need for increased education and awareness remains.

  4. A Multi-Agent Question-Answering System for E-Learning and Collaborative Learning Environment

    ERIC Educational Resources Information Center

    Alinaghi, Tannaz; Bahreininejad, Ardeshir

    2011-01-01

    The increasing advances of new Internet technologies in all application domains have changed life styles and interactions. E-learning and collaborative learning environment systems are originated through such changes and aim at providing facilities for people in different times and geographical locations to cooperate, collaborate, learn and work…

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

  6. Injecting New Ideas and New Approaches in Defense Systems: Are "Other Transactions" an Answer?

    DTIC Science & Technology

    2009-04-01

    5 See the notes in the United States Code following Section 10 USC 2371, for the legislative evolution of DoD OTs...virtually unlimited potential to provide the government with novel solutions has been allowed to lapse. Hummingbird Unmanned Aerial Vehicle The A...160 Hummingbird UAV is a rotor-craft built by Frontier Systems, a small non- traditional contractor.13 It incorporates revolutionary rotor technology

  7. Two-stage sample-to-answer system based on nucleic acid amplification approach for detection of malaria parasites.

    PubMed

    Liu, Qing; Nam, Jeonghun; Kim, Sangho; Lim, Chwee Teck; Park, Mi Kyoung; Shin, Yong

    2016-08-15

    Rapid, early, and accurate diagnosis of malaria is essential for effective disease management and surveillance, and can reduce morbidity and mortality associated with the disease. Although significant advances have been achieved for the diagnosis of malaria, these technologies are still far from ideal, being time consuming, complex and poorly sensitive as well as requiring separate assays for sample processing and detection. Therefore, the development of a fast and sensitive method that can integrate sample processing with detection of malarial infection is desirable. Here, we report a two-stage sample-to-answer system based on nucleic acid amplification approach for detection of malaria parasites. It combines the Dimethyl adipimidate (DMA)/Thin film Sample processing (DTS) technique as a first stage and the Mach-Zehnder Interferometer-Isothermal solid-phase DNA Amplification (MZI-IDA) sensing technique as a second stage. The system can extract DNA from malarial parasites using DTS technique in a closed system, not only reducing sample loss and contamination, but also facilitating the multiplexed malarial DNA detection using the fast and accurate MZI-IDA technique. Here, we demonstrated that this system can deliver results within 60min (including sample processing, amplification and detection) with high sensitivity (<1 parasite μL(-1)) in a label-free and real-time manner. The developed system would be of great potential for better diagnosis of malaria in low-resource settings.

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

  9. The Answering System to Yes-No Truth-Functional Questions in Korean-English Bilingual Children

    ERIC Educational Resources Information Center

    Choi, Hansook

    2014-01-01

    This study presents an experiment that explores the patterns of answers to yes-no truth-functional questions in English and Korean. The answering patterns are examined from 12 Korean-English bilingual children and 10 Korean-monolingual children. Four types of sentences in relation to given situations (Wason in "Br J Psychol" 52:133-142,…

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

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

    PubMed

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

    2015-03-01

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

  12. [Benchmarking in the clinical arena. A potential answer to the dynamic changes in the health care system].

    PubMed

    Bredl, K; Hüsig, S; Angele, M K; Lüring, C

    2010-08-01

    Current changes in the health system due to economic restrictions leading to increased competition require the introduction of intelligent management tools in the clinical arena. In a world where change and development are the only constants, flexibility and critical judgment of one's own achievements are requirements for success in all parts of society. Benchmarking, a management tool widely used in industry, represents a potential answer to the dynamic changes in the health system. This article deals with the theoretic basis and the clinical implications of benchmarking. The strategic background of benchmarking is the systematic process of comparison and identification with the best (best practice) leading to improved processes and results in one's own department and hospital. It is the aim of benchmarking in the clinical arena to achieve higher quality and patient directed innovation with less financial resources. This might result in better patient care. In summary, the management tool of benchmarking will be introduced into the clinical arena to keep hospitals competitive. Successful benchmarking will result in a leading position of a certain department in a special field.

  13. CoPub update: CoPub 5.0 a text mining system to answer biological questions.

    PubMed

    Fleuren, Wilco W M; Verhoeven, Stefan; Frijters, Raoul; Heupers, Bart; Polman, Jan; van Schaik, René; de Vlieg, Jacob; Alkema, Wynand

    2011-07-01

    In this article, we present CoPub 5.0, a publicly available text mining system, which uses Medline abstracts to calculate robust statistics for keyword co-occurrences. CoPub was initially developed for the analysis of microarray data, but we broadened the scope by implementing new technology and new thesauri. In CoPub 5.0, we integrated existing CoPub technology with new features, and provided a new advanced interface, which can be used to answer a variety of biological questions. CoPub 5.0 allows searching for keywords of interest and its relations to curated thesauri and provides highlighting and sorting mechanisms, using its statistics, to retrieve the most important abstracts in which the terms co-occur. It also provides a way to search for indirect relations between genes, drugs, pathways and diseases, following an ABC principle, in which A and C have no direct connection but are connected via shared B intermediates. With CoPub 5.0, it is possible to create, annotate and analyze networks using the layout and highlight options of Cytoscape web, allowing for literature based systems biology. Finally, operations of the CoPub 5.0 Web service enable to implement the CoPub technology in bioinformatics workflows. CoPub 5.0 can be accessed through the CoPub portal http://www.copub.org.

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

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

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

  17. Semantic Annotations and Querying of Web Data Sources

    NASA Astrophysics Data System (ADS)

    Hornung, Thomas; May, Wolfgang

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

  18. Scale-Independent Relational Query Processing

    DTIC Science & Technology

    2013-10-04

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

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

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

    NASA Astrophysics Data System (ADS)

    Zhou, Lijuan; Liu, Chi; Liu, Daxin

    2004-04-01

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

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

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

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

    PubMed

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

    2015-01-01

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

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

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

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

    PubMed

    Atkins, David

    2009-03-06

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

  7. Mystery #27 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... of water? Answer: The body of water is the Dead Sea. 4.   At the bottom left of the image, small city developments are ... areas.  Name this feature. Answer: It is the Arabian Desert. What is the country that fills most of the area in this ...

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

    EPA Pesticide Factsheets

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

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

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

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

  12. Accelerating Network Traffic Analytics Using Query-DrivenVisualization

    SciTech Connect

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

    2006-07-29

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

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

    NASA Astrophysics Data System (ADS)

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

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

  14. A spatial query scheduler in a distributed environment

    NASA Astrophysics Data System (ADS)

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

    2008-10-01

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

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

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

  17. Image Querying by Image Professionals.

    ERIC Educational Resources Information Center

    Jorgensen, Corinne; Jorgensen, Peter

    2003-01-01

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

  18. Query Processing in TREC-6.

    ERIC Educational Resources Information Center

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

    2000-01-01

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

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

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

  1. AnswerPro: Designing to Motivate Interaction

    ERIC Educational Resources Information Center

    AlSugair, Balsam; Hopkins, Gail; FitzGerald, Elizabeth; Brailsford, Tim

    2014-01-01

    This paper describes the design and initial testing of AnswerPro, a mobile academic peer support system for school pupils aged 11-16 years. AnswerPro is a mobile optimised web application that enables pupils to seek support with school work from knowledgeable peers on various subjects. This paper presents research findings from the project, and in…

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

    EPA Pesticide Factsheets

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

  3. Mystery #10 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... of an anatomical characteristic otherwise typical of marine turtles. Answer: TRUE The pig-nosed turtle found in northern ... Papua, possesses flippers resembling those of marine turtles. 8.   Insect control has been tested as a means of combatting an ...

  4. Mystery #8 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... species of orchids grow. Answer: True The verdant green hues present in the lower right image corner are characteristic of ... 40-50 million years ago. The impact slowed the northward movement and led   to the formation of the Himalayas. 8.   In the ...

  5. Mystery #1 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... area was designated in 1989, and includes a large complex of sand dunes. What is the park's name? Answer:  Its first national park, the Sigatoka Sand Dunes, was designated in July 1989. 3.   The Independence Day ...

  6. Mystery #23 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... 3.   Three of the following four statements related to energy sources within the image area are false. Which one is true?   A. ... meters deep, which was drilled for the purpose of harnessing geothermal energy. Answer: D is TRUE. The geothermal project at ...

  7. Mystery #5 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... the questions are provided. 1.   There are no endemic species of cactus on any of the islands. Answer: FALSE. Endemic ... on this island. 6.   Several plant species are endangered due to decimation by goats and competition with non-native ...

  8. Mystery #2 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... D.   A lakeside town hosts an annual celebration of Celtic music. Answer: B is false Lake Constance provides drinking water for ... lakeside town of   Konstanz, Germany. An annual Celtic music festival is hosted on the Swiss shores of Lake Constance at the town of ...

  9. Mystery #15 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... referred to as Kamchatka Oblast, defined by its political boundaries within a larger country. Answers to the questions are provided. ... the voyage, Steller identified the now-extinct Steller's sea cow and the spectacled cormorant, and described many other Alaskan species, ...

  10. Mystery #14 Answer

    Atmospheric Science Data Center

    2017-03-16

    ... soils, and a lake infused by volcanic gases which raise the water's pH to about 10. Answer: FALSE The infusion of volcanic gases lowers the pH of a water body. Volcanic gases such as CO 2  and SO 2  react with water to ...

  11. Improving query services of web map by web mining

    NASA Astrophysics Data System (ADS)

    Huang, Maojun

    2007-11-01

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

  12. Monitoring Moving Queries inside a Safe Region

    PubMed Central

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

    2014-01-01

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

  13. Szegedy's quantum walk with queries

    NASA Astrophysics Data System (ADS)

    Santos, Raqueline A. M.

    2016-11-01

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

  14. Mining and Querying Multimedia Data

    DTIC Science & Technology

    2011-09-29

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

  15. Quantum query complexity for qutrits

    NASA Astrophysics Data System (ADS)

    Tamir, Boaz

    2008-02-01

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

  16. An Examination of Performance-Based Teacher Evaluation Systems in Five States. Issues & Answers. REL 2012-No. 129

    ERIC Educational Resources Information Center

    Shakman, Karen; Riordan, Julie; Sanchez, Maria Teresa; Cook, Kyle DeMeo; Fournier, Richard; Brett, Jessica

    2012-01-01

    This study reports on performance-based teacher evaluation systems in five states that have implemented such systems. It investigates two primary research questions: (1) What are the key characteristics of state-level performance-based teacher evaluation systems in the study states?; and (2) How do state teacher evaluation measures, the teaching…

  17. An Examination of Performance-Based Teacher Evaluation Systems in Five States. Summary. Issues & Answers. REL 2012-No. 129

    ERIC Educational Resources Information Center

    Shakman, Karen; Riordan, Julie; Sanchez, Maria Teresa; Cook, Kyle DeMeo; Fournier, Richard; Brett, Jessica

    2012-01-01

    This study reports on performance-based teacher evaluation systems in five states that have implemented such systems. It investigates two primary research questions: (1) What are the key characteristics of state-level performance-based teacher evaluation systems in the study states?; and (2) How do state teacher evaluation measures, the teaching…

  18. Towards spoken clinical-question answering: evaluating and adapting automatic speech-recognition systems for spoken clinical questions

    PubMed Central

    Liu, Feifan; Tur, Gokhan; Hakkani-Tür, Dilek

    2011-01-01

    Objective To evaluate existing automatic speech-recognition (ASR) systems to measure their performance in interpreting spoken clinical questions and to adapt one ASR system to improve its performance on this task. Design and measurements The authors evaluated two well-known ASR systems on spoken clinical questions: Nuance Dragon (both generic and medical versions: Nuance Gen and Nuance Med) and the SRI Decipher (the generic version SRI Gen). The authors also explored language model adaptation using more than 4000 clinical questions to improve the SRI system's performance, and profile training to improve the performance of the Nuance Med system. The authors reported the results with the NIST standard word error rate (WER) and further analyzed error patterns at the semantic level. Results Nuance Gen and Med systems resulted in a WER of 68.1% and 67.4% respectively. The SRI Gen system performed better, attaining a WER of 41.5%. After domain adaptation with a language model, the performance of the SRI system improved 36% to a final WER of 26.7%. Conclusion Without modification, two well-known ASR systems do not perform well in interpreting spoken clinical questions. With a simple domain adaptation, one of the ASR systems improved significantly on the clinical question task, indicating the importance of developing domain/genre-specific ASR systems. PMID:21705457

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

    PubMed

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

    2014-01-01

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

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

    NASA Astrophysics Data System (ADS)

    Huang, Yuan-Ko

    2014-04-01

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

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

  2. From Answer Garden to Answer Jungle.

    ERIC Educational Resources Information Center

    Dron, Jon; Mitchell, Richard; Siviter, Phil

    1998-01-01

    The use of Usenet newsgroups in a computing and information systems classroom at the University of Brighton showed how Internet-based learning systems can encourage rapid evolution so that resources adapt to learners' needs. Although not always used as intended, and including off-topic distractions, newsgroups did accommodate learning styles and…

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

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

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

    SciTech Connect

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

    2013-10-09

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

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

    PubMed Central

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

    2015-01-01

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

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

    PubMed

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

    2015-09-18

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

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

  9. Towards Optimal Multi-Dimensional Query Processing with BitmapIndices

    SciTech Connect

    Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

    2005-09-30

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

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

  11. Secure Nearest Neighbor Query on Crowd-Sensing Data

    PubMed Central

    Cheng, Ke; Wang, Liangmin; Zhong, Hong

    2016-01-01

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

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

    PubMed

    Cheng, Ke; Wang, Liangmin; Zhong, Hong

    2016-09-22

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

  13. Military Medical Care: Questions and Answers

    DTIC Science & Technology

    2008-05-20

    Order Code RL33537 Military Medical Care : Questions and Answers Updated May 20, 2008 Richard A. Best Jr. Specialist in National Defense Foreign...control number. 1. REPORT DATE 20 MAY 2008 2. REPORT TYPE N/A 3. DATES COVERED - 4. TITLE AND SUBTITLE Military Medical Care : Questions and...8-98) Prescribed by ANSI Std Z39-18 Military Medical Care : Questions and Answers Summary The primary mission of the military health system, which

  14. Visual analytics for semantic queries of TerraSAR-X image content

    NASA Astrophysics Data System (ADS)

    Espinoza-Molina, Daniela; Alonso, Kevin; Datcu, Mihai

    2015-10-01

    With the continuous image product acquisition of satellite missions, the size of the image archives is considerably increasing every day as well as the variety and complexity of their content, surpassing the end-user capacity to analyse and exploit them. Advances in the image retrieval field have contributed to the development of tools for interactive exploration and extraction of the images from huge archives using different parameters like metadata, key-words, and basic image descriptors. Even though we count on more powerful tools for automated image retrieval and data analysis, we still face the problem of understanding and analyzing the results. Thus, a systematic computational analysis of these results is required in order to provide to the end-user a summary of the archive content in comprehensible terms. In this context, visual analytics combines automated analysis with interactive visualizations analysis techniques for an effective understanding, reasoning and decision making on the basis of very large and complex datasets. Moreover, currently several researches are focused on associating the content of the images with semantic definitions for describing the data in a format to be easily understood by the end-user. In this paper, we present our approach for computing visual analytics and semantically querying the TerraSAR-X archive. Our approach is mainly composed of four steps: 1) the generation of a data model that explains the information contained in a TerraSAR-X product. The model is formed by primitive descriptors and metadata entries, 2) the storage of this model in a database system, 3) the semantic definition of the image content based on machine learning algorithms and relevance feedback, and 4) querying the image archive using semantic descriptors as query parameters and computing the statistical analysis of the query results. The experimental results shows that with the help of visual analytics and semantic definitions we are able to explain

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

    PubMed Central

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

    2014-01-01

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

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

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

  18. Strategy trials: the answer?

    PubMed

    James, J S

    1999-02-19

    Although a significant amount of promotional information on drugs was presented at the 6th Conference on Retroviruses and Opportunistic Infections, very little of it was related to practical treatment strategy. Doctors and patients have many options but little guidance on selecting which combination of drugs will be most beneficial in long-term use. There is a growing call for "strategy trials" designed to answer those questions. Pharmaceutical companies traditionally have not done strategy trials; their testing is designed to promote their own products. Managing patients in strategy trials is also difficult because they have to fail a treatment before another combination of drugs is used. In addition, collecting valid data from a stragety trial takes longer than collecting data from a starting regimen trial.

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

  20. PrimeAnswers: A practical interface for answering primary care questions.

    PubMed

    Ketchell, Debra S; St Anna, Leilani; Kauff, David; Gaster, Barak; Timberlake, Diane

    2005-01-01

    This paper describes an institutional approach taken to build a primary care reference portal. The objective for the site is to make access to and use of clinical reference faster and easier and to facilitate the use of evidence-based answers in daily practice. Reference objects were selected and metadata applied to a core set of sources. Metadata were used to search, sort, and filter results and to define deep-linked queries and structure the interface. User feedback resulted in an expansion in the scope of reference objects to meet the broad spectrum of information needs, including patient handouts and interactive risk management tools. RESULTS of a user satisfaction survey suggest that a simple interface to customized content makes it faster and easier for primary care clinicians to find information during the clinic day and to improve care to their patients. The PrimeAnswers portal is a first step in creating a fast search of a customized set of reference objects to match a clinician's patient care questions in the clinic. The next step is developing methods to solve the problem of matching a clinician's question to a specific answer through precise retrieval from reference sources; however, lack of internal structure and Web service standards in most clinical reference sources is an unresolved problem.

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

  2. An Analysis of Web Image Queries for Search.

    ERIC Educational Resources Information Center

    Pu, Hsiao-Tieh

    2003-01-01

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

  3. Image query based on color harmony

    NASA Astrophysics Data System (ADS)

    Vasile, Alexandru; Bender, Walter R.

    2001-06-01

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

  4. [About easy answers].

    PubMed

    Hauck, M E

    2002-11-01

    In the last few months all aspects of stem cell research--biomedical, ethical, legal--have been given broad space in the print and electronic media. Biologists, physicians, lawyers and ethicists covered many of the facets and have thus laid a solid foundation of basic information for a very wide public. The political discussions in the context of the new Swiss Federal law governing the use and protection of supernumerary fertilized oocytes in IVF are about to completely and irreversibly change the character of these discussions. Information has been superseded by lobbying for particular interests. Before society has had time to find widely accepted answers to the many questions raised by stem cell research and to come to terms with it, economic pressure groups demand a legal framework in which therapeutic cloning is permitted. At the same time, patents on genes and stem cells are to be introduced to finance research. Together, the two claims shed a new light on stem cell research. Both claims tend to polarize public opinion. Well-known patterns will dominate the communication process and allow both sides to shirk the real issues: what are the broadly accepted ethical answers to the many questions raised by stem cell research? Again scientists will argue for the freedom of research in an economic context on behalf interest groups. Their closeness to interest groups will undermine their own credibility, the credibility of science and the public confidence. It is to be hoped that other scientists will continue to independently argue the case for their research, to talk about it and its problems and to discuss them in an interdisciplinary exchange with their colleagues from other branches of science with a view to a consensus acceptable to a majority of the public. This consensus, even if it has to be reviewed and redefined constantly in the light of new research, will give scientists the inner security needed for their work. Only the dialogue with society can create

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

    PubMed

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

    2012-04-01

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

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

    PubMed Central

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

    2012-01-01

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

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

  8. Query Reformulation for Clinical Decision Support Search

    DTIC Science & Technology

    2014-11-01

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

  9. Fast Inbound Top-K Query for Random Walk with Restart

    PubMed Central

    Zhang, Chao; Jiang, Shan; Chen, Yucheng; Sun, Yidan; Han, Jiawei

    2015-01-01

    Random walk with restart (RWR) is widely recognized as one of the most important node proximity measures for graphs, as it captures the holistic graph structure and is robust to noise in the graph. In this paper, we study a novel query based on the RWR measure, called the inbound top-k (Ink) query. Given a query node q and a number k, the Ink query aims at retrieving k nodes in the graph that have the largest weighted RWR scores to q. Ink queries can be highly useful for various applications such as traffic scheduling, disease treatment, and targeted advertising. Nevertheless, none of the existing RWR computation techniques can accurately and efficiently process the Ink query in large graphs. We propose two algorithms, namely Squeeze and Ripple, both of which can accurately answer the Ink query in a fast and incremental manner. To identify the top-k nodes, Squeeze iteratively performs matrix-vector multiplication and estimates the lower and upper bounds for all the nodes in the graph. Ripple employs a more aggressive strategy by only estimating the RWR scores for the nodes falling in the vicinity of q, the nodes outside the vicinity do not need to be evaluated because their RWR scores are propagated from the boundary of the vicinity and thus upper bounded. Ripple incrementally expands the vicinity until the top-k result set can be obtained. Our extensive experiments on real-life graph data sets show that Ink queries can retrieve interesting results, and the proposed algorithms are orders of magnitude faster than state-of-the-art method. PMID:26709392

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

    NASA Astrophysics Data System (ADS)

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

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

  11. Federated ontology-based queries over cancer data

    PubMed Central

    2012-01-01

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

  12. Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data

    SciTech Connect

    Gosink, Luke J.; Anderson, John C.; Bethel, E. Wes; Joy, Kenneth I.

    2008-08-01

    The visualization and analysis of AMR-based simulations is integral to the process of obtaining new insight in scientific research. We present a new method for performing query-driven visualization and analysis on AMR data, with specific emphasis on time-varying AMR data. Our work introduces a new method that directly addresses the dynamic spatial and temporal properties of AMR grids which challenge many existing visualization techniques. Further, we present the first implementation of query-driven visualization on the GPU that uses a GPU-based indexing structure to both answer queries and efficiently utilize GPU memory. We apply our method to two different science domains to demonstrate its broad applicability.

  13. Getting an Answer Right

    NASA Astrophysics Data System (ADS)

    Moore, John W.

    1999-07-01

    really is.) Or we could ask students to make careful observations as an experiment is being carried out and then decide whether the proposed interpretation was correct. (If the only effect of burning a candle in a beaker inverted in a water bath is to use up the oxygen, then the water should rise slowly and steadily into the beaker as long as the candle burns; it does not.) Getting the right answer is not nearly as important as getting an answer right- exploring and experimenting to eliminate alternative hypotheses and finding the best-supported explanation. Diffusion and the fraction of oxygen in air can be studied with simple, inexpensive equipment, and it is easy for students to experiment with them. If we use them appropriately, these two subjects have great potential for enhancing students' skills in critical thinking and experimental design. Many other phenomena reported in these pages provide similar opportunities. Let's apply our ingenuity and effort to making the most of them. Literature Cited 1. Parsons, L. J. Chem. Educ. 1999, 76, 898. 2. Birk, J. P.; Lawson, A. E. J. Chem. Educ. 1999, 76, 914. 3. Mason, E. A.; Kronstadt, B. J. Chem. Educ. 1967, 44, 740. Kirk, A. D. J. Chem. Educ. 1967, 44, 745. 4. Davis, L. C. J. Chem. Educ. 1996, 73, 824. 5. Westbrook, S.; Marek, E. A. J. Res. Sci. Teach. 1991, 28, 649-660 6. Birk, J. P.; McGrath, L.; Gunter, S. K. J. Chem. Educ. 1981, 58, 804.

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

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

  16. Provenance Storage, Querying, and Visualization in PBase

    SciTech Connect

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

    2015-01-01

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

  17. "Answers," Assemblages, and Qualitative Research

    ERIC Educational Resources Information Center

    Koro-Ljungberg, Mirka; Barko, Tim

    2012-01-01

    Although educational researchers predominately study complex, multidimensional problems, research findings and proposed arguments can sometimes be characterized as definite, simplified, and prone to particular types of answers or expected outcomes. The authors seek to problematize these definite and simplified notions of answers by looking at some…

  18. Investigations of Human Question Answering.

    ERIC Educational Resources Information Center

    Graesser, Arthur C.

    The development and testing of QUEST, a model of human question answering, are reported. QUEST accounts for answers adults produce for different categories of open-class questions, identifying the information sources associated with the content words in questions. Each information source is organized in a conceptual graph structure. The model…

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

    SciTech Connect

    Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

    2006-03-30

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

  20. Mystery #4 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... attribute them with detailed knowledge about a binary star system.   D.   Among their major crops are onions and millet. ... with incredibly detailed knowledge of the Sirius A/B binary star system. 3.   A small city with a rich cultural heritage is located ...

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

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

  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.

  4. 41 CFR 105-70.009 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false Answer. 105-70.009 Section 105-70.009 Public Contracts and Property Management Federal Property Management Regulations System (Continued) GENERAL SERVICES ADMINISTRATION Regional Offices-General Services Administration...

  5. Global Perspectives: Some Questions and Answers.

    ERIC Educational Resources Information Center

    Center for Global Perspectives, New York, NY.

    To enlighten the reader on the status, objectives, and needs of global education, this paper poses and answers questions related to global perspectives. A global perspective is interpreted to include heightened awareness and understanding of the global system as well as increased consciousness of the intimate relationship of self, humankind, and…

  6. Questions and Answers about CD ROM.

    ERIC Educational Resources Information Center

    Kuhn, Carolyn

    1987-01-01

    Question and answer column about the CD ROM medium discusses: (1) optical storage devices available; (2) language teaching applications; (3) types of courseware available; (4) costs to hook up a CD ROM drive as a peripheral to an existing system; (5) how to go about developing and mastering a disk; and (6) mastering and replication costs.…

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

    NASA Technical Reports Server (NTRS)

    Lynnes, Chris; Beaumont, Bruce; Duerr, Ruth; Hua, Hook

    2009-01-01

    This slide presentation reviews a Space-time query system that has been developed to assist the user in finding Earth science data that fulfills the researchers needs. It reviews the reasons why finding Earth science data can be so difficult, and explains the workings of the Space-Time Query with OpenSearch and how this system can assist researchers in finding the required data, It also reviews the developments with client server systems.

  8. Answers at your fingertips: Access to the Internet influences willingness to answer questions.

    PubMed

    Ferguson, Amanda M; McLean, David; Risko, Evan F

    2015-12-01

    Recent technological advances have given rise to an information-gathering tool unparalleled by any in human history-the Internet. Understanding how access to such a powerful informational tool influences how we think represents an important question for psychological science. In the present investigation we examined the impact of access to the Internet on the metacognitive processes that govern our decisions about what we "know" and "don't know." Results demonstrated that access to the Internet influenced individuals' willingness to volunteer answers, which led to fewer correct answers overall but greater accuracy when an answer was offered. Critically, access to the Internet also influenced feeling-of-knowing, and this accounted for some (but not all) of the effect on willingness to volunteer answers. These findings demonstrate that access to the Internet can influence metacognitive processes, and contribute novel insights into the operation of the transactive memory system formed by people and the Internet.

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

    NASA Astrophysics Data System (ADS)

    Santos, Ricardo Jorge; Bernardino, Jorge

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

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

  11. Mystery #21 Answer

    Atmospheric Science Data Center

    2013-04-22

    ... a major role in an early 20th century book released as a motion picture in 1939.   ( O ) Cloud systems of this type are often ... are false. Which one is true?   ( N ) The Coriolis force strongly influences the morphology of these cloud patterns.   ( E ) ...

  12. Looking Abroad for Answers

    ERIC Educational Resources Information Center

    Kisch, Marian

    2009-01-01

    Interacting with school leaders from different countries on overseas study missions can yield practical payoffs. In this article, eight school system leaders describe one valuable practice they observed on their recent trips to sundry spots across the globe. As some educators discover, it helps them better appreciate their own public schools,…

  13. Are Integrated Portfolio Systems the Answer? An Evaluation of a Web-Based Portfolio System to Improve Preservice Teachers' Reflective Thinking Skills

    ERIC Educational Resources Information Center

    Oner, Diler; Adadan, Emine

    2016-01-01

    This study investigated the effectiveness of an integrated web-based portfolio system, namely the BOUNCE System, which primarily focuses on improving preservice teachers' reflective thinking skills. BOUNCE©, the software component of the system, was designed and developed to support a teaching practice model including a cycle of activities to be…

  14. HPV Vaccine - Questions and Answers

    MedlinePlus

    ... and Media Resources News Newsletters Events Redirect for HPV Vaccine FAQ Recommend on Facebook Tweet Share Compartir ... to the address below. http://www.cdc.gov/hpv/parents/questions-answers.html File Formats Help: How ...

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

  16. Enhancing Collaborative Peer-to-Peer Systems Using Resource Aggregation and Caching: A Multi-Attribute Resource and Query Aware Approach

    ERIC Educational Resources Information Center

    Bandara, H. M. N. Dilum

    2012-01-01

    Resource-rich computing devices, decreasing communication costs, and Web 2.0 technologies are fundamentally changing the way distributed applications communicate and collaborate. With these changes, we envision Peer-to-Peer (P2P) systems that will allow for the integration and collaboration of peers with diverse capabilities to a virtual community…

  17. Toward Automated Consumer Question Answering: Automatically Separating Consumer Questions from Professional Questions in the Healthcare Domain

    PubMed Central

    Liu, Feifan; Antieau, Lamont D.; Yu, Hong

    2011-01-01

    Objective Both healthcare professionals and healthcare consumers have information needs that can be met through the use of computers, specifically via medical question answering systems. However, the information needs of both groups are different in terms of literacy levels and technical expertise, and an effective question answering system must be able to account for these differences if it is to formulate the most relevant responses for users from each group. In this paper, we propose that a first step toward answering the queries of different users is automatically classifying questions according to whether they were asked by healthcare professionals or consumers. Design We obtained two sets of consumer questions (~10,000 questions in total) from Yahoo answers. The professional questions consist of two question collections: 4654 point-of-care questions (denoted as PointCare) obtained from interviews of a group of family doctors following patient visits and 5378 questions from physician practices through professional online services (denoted as OnlinePractice). With more than 20,000 questions combined, we developed supervised machine-learning models for automatic classification between consumer questions and professional questions. To evaluate the robustness of our models, we tested the model that was trained on the Consumer-PointCare dataset on the Consumer-OnlinePractice dataset. We evaluated both linguistic features and statistical features and examined how the characteristics in two different types of professional questions (PointCare vs. OnlinePractice) may affect the classification performance. We explored information gain for feature reduction and the back-off linguistic category features. Results 10-fold cross-validation results showed the best F1-measure of 0.936 and 0.946 on Consumer-PointCare and Consumer-OnlinePractice respectively, and the best F1-measure of 0.891 when testing the Consumer-PointCare model on the Consumer-OnlinePractice dataset

  18. Semantic analysis of WebGIS Chinese query sentences

    NASA Astrophysics Data System (ADS)

    Xu, Aiping; Bian, Fuling

    2006-10-01

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

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

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

    PubMed

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

    2016-01-09

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

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

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

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

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

    NASA Astrophysics Data System (ADS)

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

    2015-12-01

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

  5. Data Sharing in P2P Systems

    NASA Astrophysics Data System (ADS)

    Hayek, Rabab; Raschia, Guillaume; Valduriez, Patrick; Mouaddib, Noureddine

    In this chapter, we survey P2P data sharing systems. All along, we focus on the evolution from simple file-sharing systems, with limited functionalities, to Peer Data Management Systems (PDMS) that support advanced applications with more sophisticated data management techniques. Advanced P2P applications are dealing with semantically rich data (e.g., XML documents, relational tables), using a high-level SQL-like query language. We start our survey with an overview over the existing P2P network architectures, and the associated routing protocols. Then, we discuss data indexing techniques based on their distribution degree and the semantics they can capture from the underlying data. We also discuss schema management techniques which allow integrating heterogeneous data. We conclude by discussing the techniques proposed for processing complex queries (e.g., range and join queries). Complex query facilities are necessary for advanced applications which require a high level of search expressiveness. This last part shows the lack of querying techniques that allow for an approximate query answering.

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

    PubMed

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

    2016-11-04

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

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

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

  9. LOGMIS Programmed Texts, Tests and Answers.

    DTIC Science & Technology

    1979-04-01

    This publication contains the programmed text and related test and answer booklets produced to teach field users correct procedures for utilization of the Army’s Logistics Management Information System (LOGMIS). It was prepared by ARINC Research Corporation under Contract DAEA18-77-C-0184 for the Logistics Evaluation Branch, Plans and Programs Division of the Assistant Chief of Staff for Logistics, U.S. Army Communications Command. (Author)

  10. Military Medical Care: Questions and Answers

    DTIC Science & Technology

    2009-01-29

    COVERED 00-00-2009 to 00-00-2009 4. TITLE AND SUBTITLE Military Medical Care : Questions and Answers 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c...deliver health care during wartime. The military health system also provides health care services through either Department of Defense (DOD...medical facilities, known as “military treatment facilities” or “MTFs” as space is available, or, through private health care providers. Known as “Tricare

  11. Military Medical Care: Questions and Answers

    DTIC Science & Technology

    2009-05-14

    providers, subject to regulations. Certain types of care , such as most dentistry and chiropractic services, are excluded. In addition to Tricare...COVERED 00-00-2009 to 00-00-2009 4. TITLE AND SUBTITLE Military Medical Care : Questions and Answers 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c...deliver health care during wartime. The military health system also provides health care services through either Department of Defense (DOD) medical

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

  13. Analysis of Performance Variation Using Query Expansion.

    ERIC Educational Resources Information Center

    Alemayehu, Nega

    2003-01-01

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

  14. IView: Introgression library visualization and query tool

    Technology Transfer Automated Retrieval System (TEKTRAN)

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

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

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

  17. Query Optimization in Distributed Databases.

    DTIC Science & Technology

    1982-10-01

    algebra operations into corresponding data manipulation statements of the underlying data model of the system in order to retrieve data. Chapter 7...translation of requests, formulated in a high-level language on one system of the network, into a sequence of relational algebra operations which retrieve...A3 14 I 1 I 9/81 I Al 15 I 4 I12/81 I A5 I 16 1 I12/81 2.2.3 Operator The operators we use are a subset of the relational algebra (CODD 721

  18. Timing Students' Answers in CAI.

    ERIC Educational Resources Information Center

    Hativa, Nira; And Others

    1991-01-01

    Discussion of limiting response time for students' answers focuses on a study of Israeli elementary students that investigated the effects on their performance of increasing the response time in computer-assisted instruction (CAI) for arithmetic drill and practice. Effects on high- versus low-aptitude students, and younger versus older, are…

  19. War Is Not the Answer.

    ERIC Educational Resources Information Center

    Besteman, Karst J.

    1989-01-01

    Concludes that a war on drugs is not the answer to the problem of drug abuse in the United States. Stresses that the hostile atmosphere generated by the overemphasis upon interdiction and enforcement of penalties undermines the healing and restoring efforts needed in reducing the individual's demand for drugs. (KO)

  20. Answering Your Questions about AIDS.

    ERIC Educational Resources Information Center

    Kalichman, Seth C.

    This book focuses on AIDS education and answers 350 commonly asked questions about Human Immunodeficiency Virus (HIV) and Acquired Immune Deficiency Syndrome (AIDS) taken from questions addressed to two major urban AIDS hotlines (Milwaukee, Wisconsin, and Houston, Texas). Chapter 1, "HIV - The Virus That Causes AIDS," discusses: the HIV…

  1. Million Query Track 2008 Overview

    DTIC Science & Technology

    2008-11-01

    We used several standard Lemur built in systems (tfidf bm25, tfidf log, kl abs, kl dir, inquery, cos, okapi) and combined their output (metasearch...the Lemur implementations: a vector-space cosine similarity run (000cos), a language modeling run (000klabs), an Okapi formula run (000okapi), a BM25

  2. Million Query Track 2007 Overview

    DTIC Science & Technology

    2007-01-01

    Technology, China Used Lemur . IBM Haifa This year, the experiments of IBM Haifa were focused on the scoring function of Lucene, an Apache open-source...several standard Lemur built in systems (tfidf bm25, tfidf log, kl abs,kl dir,inquery,cos, okapi) and combined their output (metasearch) using the

  3. Question, answer, compare: a cross-category comparison of answers on question and answer websites

    NASA Astrophysics Data System (ADS)

    Ocepek, Melissa G.; Westbrook, Lynn

    2015-10-01

    Online information seekers make heavy use of websites that accept their natural language questions. This study compared the three types of such websites: social question and answer (Q&A), digital reference services, and ask-an-expert services. Questions reflecting daily life, research, and crisis situations were posed to high use websites of all three types. The resulting answers' characteristics were analyzed in terms of speed, transparency, formality, and intimacy. The results indicate that social Q&A websites excel in speed, ask-an-expert websites in intimacy, and digital reference services in transparency and formality.

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

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

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

  7. Document Retrieval Using A Fuzzy Knowledge-Based System

    NASA Astrophysics Data System (ADS)

    Subramanian, Viswanath; Biswas, Gautam; Bezdek, James C.

    1986-03-01

    This paper presents the design and development of a prototype document retrieval system using a knowledge-based systems approach. Both the domain-specific knowledge base and the inferencing schemes are based on a fuzzy set theoretic framework. A query in natural language represents a request to retrieve a relevant subset of documents from a document base. Such a query, which can include both fuzzy terms and fuzzy relational operators, is converted into an unambiguous intermediate form by a natural language interface. Concepts that describe domain topics and the relationships between concepts, such as the synonym relation and the implication relation between a general concept and more specific concepts, have been captured in a knowledge base. The knowledge base enables the system to emulate the reasoning process followed by an expert, such as a librarian, in understanding and reformulating user queries. The retrieval mechanism processes the query in two steps. First it produces a pruned list of documents pertinent to the query. Second, it uses an evidence combination scheme to compute a degree of support between the query and individual documents produced in step one. The front-end component of the system then presents a set of document citations to the user in ranked order as an answer to the information request.

  8. Bin-Hash Indexing: A Parallel Method for Fast Query Processing

    SciTech Connect

    Bethel, Edward W; Gosink, Luke J.; Wu, Kesheng; Bethel, Edward Wes; Owens, John D.; Joy, Kenneth I.

    2008-06-27

    This paper presents a new parallel indexing data structure for answering queries. The index, called Bin-Hash, offers extremely high levels of concurrency, and is therefore well-suited for the emerging commodity of parallel processors, such as multi-cores, cell processors, and general purpose graphics processing units (GPU). The Bin-Hash approach first bins the base data, and then partitions and separately stores the values in each bin as a perfect spatial hash table. To answer a query, we first determine whether or not a record satisfies the query conditions based on the bin boundaries. For the bins with records that can not be resolved, we examine the spatial hash tables. The procedures for examining the bin numbers and the spatial hash tables offer the maximum possible level of concurrency; all records are able to be evaluated by our procedure independently in parallel. Additionally, our Bin-Hash procedures access much smaller amounts of data than similar parallel methods, such as the projection index. This smaller data footprint is critical for certain parallel processors, like GPUs, where memory resources are limited. To demonstrate the effectiveness of Bin-Hash, we implement it on a GPU using the data-parallel programming language CUDA. The concurrency offered by the Bin-Hash index allows us to fully utilize the GPU's massive parallelism in our work; over 12,000 records can be simultaneously evaluated at any one time. We show that our new query processing method is an order of magnitude faster than current state-of-the-art CPU-based indexing technologies. Additionally, we compare our performance to existing GPU-based projection index strategies.

  9. Visual Turing test for computer vision systems

    PubMed Central

    Geman, Donald; Geman, Stuart; Hallonquist, Neil; Younes, Laurent

    2015-01-01

    Today, computer vision systems are tested by their accuracy in detecting and localizing instances of objects. As an alternative, and motivated by the ability of humans to provide far richer descriptions and even tell a story about an image, we construct a “visual Turing test”: an operator-assisted device that produces a stochastic sequence of binary questions from a given test image. The query engine proposes a question; the operator either provides the correct answer or rejects the question as ambiguous; the engine proposes the next question (“just-in-time truthing”). The test is then administered to the computer-vision system, one question at a time. After the system’s answer is recorded, the system is provided the correct answer and the next question. Parsing is trivial and deterministic; the system being tested requires no natural language processing. The query engine employs statistical constraints, learned from a training set, to produce questions with essentially unpredictable answers—the answer to a question, given the history of questions and their correct answers, is nearly equally likely to be positive or negative. In this sense, the test is only about vision. The system is designed to produce streams of questions that follow natural story lines, from the instantiation of a unique object, through an exploration of its properties, and on to its relationships with other uniquely instantiated objects. PMID:25755262

  10. The PC Dugout Micro-Mainframe Integration System: PAX Implementation

    DTIC Science & Technology

    1991-05-01

    System Mainframe Implementation Language PC Implementation Language Communications Package and File Transfer Protocol Requirements 5 DUGOUT DESIGN...remember any commands or language syntax. In some cases users are asked to answer a few simple, nontechnical prompts. To download or upload files, a...problem. The database management systems Focus and Structured Query Language /Data System (SQL/DS) successfully circumvent this restriction in the PAX VM/CMS

  11. Answer Set Programming: A Primer

    NASA Astrophysics Data System (ADS)

    Eiter, Thomas; Ianni, Giovambattista; Krennwallner, Thomas

    Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attention during the last years. This article is a gentle introduction to the subject; it starts with motivation and follows the historical development of the challenge of defining a semantics for logic programs with negation. It looks into positive programs over stratified programs to arbitrary programs, and then proceeds to extensions with two kinds of negation (named weak and strong negation), and disjunction in rule heads. The second part then considers the ASP paradigm itself, and describes the basic idea. It shows some programming techniques and briefly overviews Answer Set solvers. The third part is devoted to ASP in the context of the Semantic Web, presenting some formalisms and mentioning some applications in this area. The article concludes with issues of current and future ASP research.

  12. Semantic representation of consumer questions and physician answers.

    PubMed

    Slaughter, Laura A; Soergel, Dagobert; Rindflesch, Thomas C

    2006-07-01

    The aim of this study was to identify the underlying semantics of health consumers' questions and physicians' answers in order to analyze the semantic patterns within these texts. We manually identified semantic relationships within question-answer pairs from Ask-the-Doctor Web sites. Identification of the semantic relationship instances within the texts was based on the relationship classes and structure of the Unified Medical Language System (UMLS) Semantic Network. We calculated the frequency of occurrence of each semantic relationship class, and conceptual graphs were generated, joining concepts together through the semantic relationships identified. We then analyzed whether representations of physician's answers exactly matched the form of the question representations. Lastly, we examined characteristics of the answer conceptual graphs. We identified 97 semantic relationship instances in the questions and 334 instances in the answers. The most frequently identified semantic relationship in both questions and answers was brings_about (causal). We found that the semantic relationship propositions identified in answers that most frequently contain a concept also expressed in the question were: brings_about, isa, co_occurs_with, diagnoses, and treats. Using extracted semantic relationships from real-life questions and answers can produce a valuable analysis of the characteristics of these texts. This can lead to clues for creating semantic-based retrieval techniques that guide users to further information. For example, we determined that both consumers and physicians often express causative relationships and these play a key role in leading to further related concepts.

  13. A Vision for Next Generation Query Processors and an Associated Research Agenda

    NASA Astrophysics Data System (ADS)

    Gounaris, Anastasios

    Query processing is one of the most important mechanisms for data management, and there exist mature techniques for effective query optimization and efficient query execution. The vast majority of these techniques assume workloads of rather small transactional tasks with strong requirements for ACID properties. However, the emergence of new computing paradigms, such as grid and cloud computing, the increasingly large volumes of data commonly processed, the need to support data driven research, intensive data analysis and new scenarios, such as processing data streams on the fly or querying web services, the fact that the metadata fed to optimizers are often missing at compile time, and the growing interest in novel optimization criteria, such as monetary cost or energy consumption, create a unique set of new requirements for query processing systems. These requirements cannot be met by modern techniques in their entirety, although interesting solutions and efficient tools have already been developed for some of them in isolation. Next generation query processors are expected to combine features addressing all of these issues, and, consequently, lie at the confluence of several research initiatives. This paper aims to present a vision for such processors, to explain their functionality requirements, and to discuss the open issues, along with their challenges.

  14. Knowledge-Based Query Construction Using the CDSS Knowledge Base for Efficient Evidence Retrieval

    PubMed Central

    Afzal, Muhammad; Hussain, Maqbool; Ali, Taqdir; Hussain, Jamil; Khan, Wajahat Ali; Lee, Sungyoung; Kang, Byeong Ho

    2015-01-01

    Finding appropriate evidence to support clinical practices is always challenging, and the construction of a query to retrieve such evidence is a fundamental step. Typically, evidence is found using manual or semi-automatic methods, which are time-consuming and sometimes make it difficult to construct knowledge-based complex queries. To overcome the difficulty in constructing knowledge-based complex queries, we utilized the knowledge base (KB) of the clinical decision support system (CDSS), which has the potential to provide sufficient contextual information. To automatically construct knowledge-based complex queries, we designed methods to parse rule structure in KB of CDSS in order to determine an executable path and extract the terms by parsing the control structures and logic connectives used in the logic. The automatically constructed knowledge-based complex queries were executed on the PubMed search service to evaluate the results on the reduction of retrieved citations with high relevance. The average number of citations was reduced from 56,249 citations to 330 citations with the knowledge-based query construction approach, and relevance increased from 1 term to 6 terms on average. The ability to automatically retrieve relevant evidence maximizes efficiency for clinicians in terms of time, based on feedback collected from clinicians. This approach is generally useful in evidence-based medicine, especially in ambient assisted living environments where automation is highly important. PMID:26343669

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

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

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

  18. Magnetoelastic sensors for remote query environmental monitoring

    NASA Astrophysics Data System (ADS)

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

    1999-10-01

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

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

  20. An Ensemble Approach for Expanding Queries

    DTIC Science & Technology

    2012-11-01

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

  1. Map-Based Querying for Multimedia Database

    DTIC Science & Technology

    2014-09-01

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

  2. Information Extraction Supported Question Answering

    DTIC Science & Technology

    1999-10-15

    cymfony.com, wei@cymfony.com phone : (716) 565-9114 fax: (716) 565-0308 15 October, 1999 Abstract This paper discusses the use of our information...display a currently valid OMB control number . 1. REPORT DATE 19 OCT 1999 2. REPORT TYPE 3. DATES COVERED 00-10-1999 to 00-10-1999 4. TITLE AND...SUBTITLE Information Extraction Supported Question Answering 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d. PROJECT

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

  4. STARS 2.0: 2nd-generation open-source archiving and query software

    NASA Astrophysics Data System (ADS)

    Winegar, Tom

    2008-07-01

    The Subaru Telescope is in process of developing an open-source alternative to the 1st-generation software and databases (STARS 1) used for archiving and query. For STARS 2, we have chosen PHP and Python for scripting and MySQL as the database software. We have collected feedback from staff and observers, and used this feedback to significantly improve the design and functionality of our future archiving and query software. Archiving - We identified two weaknesses in 1st-generation STARS archiving software: a complex and inflexible table structure and uncoordinated system administration for our business model: taking pictures from the summit and archiving them in both Hawaii and Japan. We adopted a simplified and normalized table structure with passive keyword collection, and we are designing an archive-to-archive file transfer system that automatically reports real-time status and error conditions and permits error recovery. Query - We identified several weaknesses in 1st-generation STARS query software: inflexible query tools, poor sharing of calibration data, and no automatic file transfer mechanisms to observers. We are developing improved query tools and sharing of calibration data, and multi-protocol unassisted file transfer mechanisms for observers. In the process, we have redefined a 'query': from an invisible search result that can only transfer once in-house right now, with little status and error reporting and no error recovery - to a stored search result that can be monitored, transferred to different locations with multiple protocols, reporting status and error conditions and permitting recovery from errors.

  5. PiCO QL: A software library for runtime interactive queries on program data

    NASA Astrophysics Data System (ADS)

    Fragkoulis, Marios; Spinellis, Diomidis; Louridas, Panos

    PiCO QL is an open source C/C++ software whose scientific scope is real-time interactive analysis of in-memory data through SQL queries. It exposes a relational view of a system's or application's data structures, which is queryable through SQL. While the application or system is executing, users can input queries through a web-based interface or issue web service requests. Queries execute on the live data structures through the respective relational views. PiCO QL makes a good candidate for ad-hoc data analysis in applications and for diagnostics in systems settings. Applications of PiCO QL include the Linux kernel, the Valgrind instrumentation framework, a GIS application, a virtual real-time observatory of stellar objects, and a source code analyser.

  6. 37 CFR 2.114 - Answer.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... withdrawn without prejudice before the answer is filed. After the answer is filed, the petition may not be withdrawn without prejudice except with the written consent of the registrant or the registrant's...

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

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

  9. Berkeley Lab Answers Your Home Energy Efficiency Questions

    SciTech Connect

    Walker, Iain

    2013-02-14

    In this follow-up "Ask Berkeley Lab" video, energy efficiency expert Iain Walker answers some of your questions about home energy efficiency. How do you monitor which appliances use the most energy? Should you replace your old windows? Are photovoltaic systems worth the cost? What to do about a leaky house? And what's the single biggest energy user in your home? Watch the video to get the answers to these and more questions.

  10. Berkeley Lab Answers Your Home Energy Efficiency Questions

    ScienceCinema

    Walker, Iain

    2016-07-12

    In this follow-up "Ask Berkeley Lab" video, energy efficiency expert Iain Walker answers some of your questions about home energy efficiency. How do you monitor which appliances use the most energy? Should you replace your old windows? Are photovoltaic systems worth the cost? What to do about a leaky house? And what's the single biggest energy user in your home? Watch the video to get the answers to these and more questions.

  11. Integration and Querying of Genomic and Proteomic Semantic Annotations for Biomedical Knowledge Extraction.

    PubMed

    Masseroli, Marco; Canakoglu, Arif; Ceri, Stefano

    2016-01-01

    Understanding complex biological phenomena involves answering complex biomedical questions on multiple biomolecular information simultaneously, which are expressed through multiple genomic and proteomic semantic annotations scattered in many distributed and heterogeneous data sources; such heterogeneity and dispersion hamper the biologists' ability of asking global queries and performing global evaluations. To overcome this problem, we developed a software architecture to create and maintain a Genomic and Proteomic Knowledge Base (GPKB), which integrates several of the most relevant sources of such dispersed information (including Entrez Gene, UniProt, IntAct, Expasy Enzyme, GO, GOA, BioCyc, KEGG, Reactome, and OMIM). Our solution is general, as it uses a flexible, modular, and multilevel global data schema based on abstraction and generalization of integrated data features, and a set of automatic procedures for easing data integration and maintenance, also when the integrated data sources evolve in data content, structure, and number. These procedures also assure consistency, quality, and provenance tracking of all integrated data, and perform the semantic closure of the hierarchical relationships of the integrated biomedical ontologies. At http://www.bioinformatics.deib.polimi.it/GPKB/, a Web interface allows graphical easy composition of queries, although complex, on the knowledge base, supporting also semantic query expansion and comprehensive explorative search of the integrated data to better sustain biomedical knowledge extraction.

  12. Answers to Your Questions About American Indians.

    ERIC Educational Resources Information Center

    Bureau of Indian Affairs (Dept. of Interior), Washington, DC.

    Many of the frequent questions which arise concerning the relationship between Indians and the Federal Government are answered in this document. These questions and answers, in general, relate to Indians with whom the Federal government still retains a special relationship. Questions and answers pertain to the following areas: (1) the Indian…

  13. 39 CFR 3030.14 - Answer contents.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 39 Postal Service 1 2014-07-01 2014-07-01 false Answer contents. 3030.14 Section 3030.14 Postal Service POSTAL REGULATORY COMMISSION PERSONNEL RULES FOR COMPLAINTS Form and Manner Requirements of Initial Pleadings § 3030.14 Answer contents. (a) An answer must: (1) Contain a clear and concise statement of any disputed factual allegations...

  14. 39 CFR 3030.14 - Answer contents.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 39 Postal Service 1 2011-07-01 2011-07-01 false Answer contents. 3030.14 Section 3030.14 Postal Service POSTAL REGULATORY COMMISSION PERSONNEL RULES FOR COMPLAINTS Form and Manner Requirements of Initial Pleadings § 3030.14 Answer contents. (a) An answer must: (1) Contain a clear and concise statement of any disputed factual allegations...

  15. 39 CFR 3030.14 - Answer contents.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 39 Postal Service 1 2012-07-01 2012-07-01 false Answer contents. 3030.14 Section 3030.14 Postal Service POSTAL REGULATORY COMMISSION PERSONNEL RULES FOR COMPLAINTS Form and Manner Requirements of Initial Pleadings § 3030.14 Answer contents. (a) An answer must: (1) Contain a clear and concise statement of any disputed factual allegations...

  16. 39 CFR 3030.14 - Answer contents.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 39 Postal Service 1 2013-07-01 2013-07-01 false Answer contents. 3030.14 Section 3030.14 Postal Service POSTAL REGULATORY COMMISSION PERSONNEL RULES FOR COMPLAINTS Form and Manner Requirements of Initial Pleadings § 3030.14 Answer contents. (a) An answer must: (1) Contain a clear and concise statement of any disputed factual allegations...

  17. 10 CFR 820.27 - Answer.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 10 Energy 4 2012-01-01 2012-01-01 false Answer. 820.27 Section 820.27 Energy DEPARTMENT OF ENERGY PROCEDURAL RULES FOR DOE NUCLEAR ACTIVITIES Enforcement Process § 820.27 Answer. (a) General. If a respondent files a request for an on-the-record adjudication pursuant to § 820.25, a written answer to the...

  18. 10 CFR 13.9 - Answer.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 10 Energy 1 2013-01-01 2013-01-01 false Answer. 13.9 Section 13.9 Energy NUCLEAR REGULATORY COMMISSION PROGRAM FRAUD CIVIL REMEDIES § 13.9 Answer. (a) The defendant may request a hearing by filing an answer with the reviewing official within thirty (30) days of service of the complaint. Service of...

  19. 39 CFR 3030.14 - Answer contents.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 39 Postal Service 1 2010-07-01 2010-07-01 false Answer contents. 3030.14 Section 3030.14 Postal Service POSTAL REGULATORY COMMISSION PERSONNEL RULES FOR COMPLAINTS Form and Manner Requirements of Initial Pleadings § 3030.14 Answer contents. (a) An answer must: (1) Contain a clear and concise statement of any disputed factual allegations...

  20. Modeling Answer Changes on Test Items

    ERIC Educational Resources Information Center

    van der Linden, Wim J.; Jeon, Minjeong

    2012-01-01

    The probability of test takers changing answers upon review of their initial choices is modeled. The primary purpose of the model is to check erasures on answer sheets recorded by an optical scanner for numbers and patterns that may be indicative of irregular behavior, such as teachers or school administrators changing answer sheets after their…

  1. 12 CFR 622.5 - Answer.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ...) Requirements of answer; effect of failure to deny. An answer filed under this section shall concisely state any... shall have the effect of a denial. Any allegation not denied shall be deemed to be admitted. A party who... thereto within the time provided in § 622.13. (d) Effect of failure to answer. Failure of a party to...

  2. 37 CFR 41.69 - Examiner's answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Examiner's answer. 41.69... Examiner's answer. (a) The primary examiner may, within such time as directed by the Director, furnish a written answer to the owner's and/or requester's appellant brief or respondent brief including, as may...

  3. 31 CFR 16.9 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 31 Money and Finance: Treasury 1 2010-07-01 2010-07-01 false Answer. 16.9 Section 16.9 Money and Finance: Treasury Office of the Secretary of the Treasury REGULATIONS IMPLEMENTING THE PROGRAM FRAUD CIVIL REMEDIES ACT OF 1986 § 16.9 Answer. (a) The defendant may request a hearing by filing an answer with...

  4. LigDig: a web server for querying ligand–protein interactions

    PubMed Central

    Fuller, Jonathan C.; Martinez, Michael; Henrich, Stefan; Stank, Antonia; Richter, Stefan

    2015-01-01

    Summary: LigDig is a web server designed to answer questions that previously required several independent queries to diverse data sources. It also performs basic manipulations and analyses of the structures of protein–ligand complexes. The LigDig webserver is modular in design and consists of seven tools, which can be used separately, or via linking the output from one tool to the next, in order to answer more complex questions. Currently, the tools allow a user to: (i) perform a free-text compound search, (ii) search for suitable ligands, particularly inhibitors, of a protein and query their interaction network, (iii) search for the likely function of a ligand, (iv) perform a batch search for compound identifiers, (v) find structures of protein–ligand complexes, (vi) compare three-dimensional structures of ligand binding sites and (vii) prepare coordinate files of protein–ligand complexes for further calculations. Availability and implementation: LigDig makes use of freely available databases, including ChEMBL, PubChem and SABIO-RK, and software programs, including cytoscape.js, PDB2PQR, ProBiS and Fconv. LigDig can be used by non-experts in bio- and chemoinformatics. LigDig is available at: http://mcm.h-its.org/ligdig. Contact: jonathan.fuller@h-its.org, rebecca.wade@h-its.org Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25433696

  5. Test of an Electronic Program to Query Clinicians About Nonspecific Causes Reported for Pneumonia Deaths, New York City, 2012

    PubMed Central

    Korin, Laura; Das, Tara; Soto, Antonio; Begier, Elizabeth

    2014-01-01

    We tested an electronic cause-of-death query system at a hospital in New York City to evaluate clinicians’ reporting of cause of death. We used the system to query clinicians about all deaths assigned International Classification of Disease code J189 (pneumonia, unspecified) as the underlying cause of death. Of 29 death certificates that generated queries, 28 were updated with additional information, which led to revisions in the underlying cause of 27 deaths. The electronic system for querying reported cause of death was feasible and enabled quicker than usual responses; however, follow-up with clinicians to ensure timely, accurate, and complete responses was labor-intensive. Educating clinicians and enforcing reporting standards would reduce the time and effort required to ensure accurate and timely cause-of-death reporting. PMID:25427318

  6. Comparing NetCDF and SciDB on managing and querying 5D hydrologic dataset

    NASA Astrophysics Data System (ADS)

    Liu, Haicheng; Xiao, Xiao

    2016-11-01

    Efficiently extracting information from high dimensional hydro-meteorological modelling datasets requires smart solutions. Traditional methods are mostly based on files, which can be edited and accessed handily. But they have problems of efficiency due to contiguous storage structure. Others propose databases as an alternative for advantages such as native functionalities for manipulating multidimensional (MD) arrays, smart caching strategy and scalability. In this research, NetCDF file based solutions and the multidimensional array database management system (DBMS) SciDB applying chunked storage structure are benchmarked to determine the best solution for storing and querying 5D large hydrologic modelling dataset. The effect of data storage configurations including chunk size, dimension order and compression on query performance is explored. Results indicate that dimension order to organize storage of 5D data has significant influence on query performance if chunk size is very large. But the effect becomes insignificant when chunk size is properly set. Compression of SciDB mostly has negative influence on query performance. Caching is an advantage but may be influenced by execution of different query processes. On the whole, NetCDF solution without compression is in general more efficient than the SciDB DBMS.

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

    SciTech Connect

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

    2006-03-30

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

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

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

  10. Bilastine in allergic rhinoconjunctivitis and urticaria: a practical approach to treatment decisions based on queries received by the medical information department

    PubMed Central

    Leceta, Amalia; Sologuren, Ander; Valiente, Román; Campo, Cristina; Labeaga, Luis

    2017-01-01

    Background Bilastine is a safe and effective commonly prescribed non-sedating H1-antihistamine approved for symptomatic treatment in patients with allergic disorders such as rhinoconjunctivitis and urticaria. It was evaluated in many patients throughout the clinical development required for its approval, but clinical trials generally exclude many patients who will benefit in everyday clinical practice (especially those with coexisting diseases and/or being treated with concomitant drugs). Following its introduction into clinical practice, the Medical Information Specialists at Faes Farma have received many practical queries regarding the optimal use of bilastine in different circumstances. Data sources and methods Queries received by the Medical Information Department and the responses provided to senders of these queries. Results The most frequent questions received by the Medical Information Department included the potential for drug-drug interactions with bilastine and commonly used agents such as anticoagulants (including the novel oral anticoagulants), antiretrovirals, antituberculosis regimens, corticosteroids, digoxin, oral contraceptives, and proton pump inhibitors. Most of these medicines are not usually allowed in clinical trials, and so advice needs to be based upon the pharmacological profiles of the drugs involved and expert opinion. The pharmacokinetic profile of bilastine appears favourable since it undergoes negligible metabolism and is almost exclusively eliminated via renal excretion, and it neither induces nor inhibits the activity of several isoenzymes from the CYP 450 system. Consequently, bilastine does not interact with cytochrome metabolic pathways. Other queries involved specific patient groups such as subjects with renal impairment, women who are breastfeeding or who are trying to become pregnant, and patients with other concomitant diseases. Interestingly, several questions related to topics that are well covered in the Summary of Product

  11. Query Modification through External Sources to Support Clinical Decisions

    DTIC Science & Technology

    2014-11-01

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

  12. Query Expansion Using SNOMED-CT and Weighing Schemes

    DTIC Science & Technology

    2014-11-01

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

  13. Query Processing Performance and Searching over Encrypted Data by using an Efficient Algorithm

    NASA Astrophysics Data System (ADS)

    Sharma, Manish; Chaudhary, Atul; Kumar, Santosh

    2013-01-01

    Data is the central asset of today's dynamically operating organization and their business. This data is usually stored in database. A major consideration is applied on the security of that data from the unauthorized access and intruders. Data encryption is a strong option for security of data in database and especially in those organizations where security risks are high. But there is a potential disadvantage of performance degradation. When we apply encryption on database then we should compromise between the security and efficient query processing. The work of this paper tries to fill this gap. It allows the users to query over the encrypted column directly without decrypting all the records. It's improves the performance of the system. The proposed algorithm works well in the case of range and fuzzy match queries.

  14. Distributed query plan generation using multiobjective genetic algorithm.

    PubMed

    Panicker, Shina; Kumar, T V Vijay

    2014-01-01

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

  15. Web Database Schema Identification through Simple Query Interface

    NASA Astrophysics Data System (ADS)

    Lin, Ling; Zhou, Lizhu

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

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

    PubMed Central

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

    2002-01-01

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

  17. Cyber Graph Queries for Geographically Distributed Data Centers

    SciTech Connect

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

    2015-05-01

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

  18. GraQL: A Query Language for High-Performance Attributed Graph Databases

    SciTech Connect

    Chavarría-Miranda, Daniel; Castellana, Vito G.; Morari, Alessandro; Haglin, David J.; Feo, John T.

    2016-05-27

    Graph databases have gained increasing interest in the last few years due to the emergence of data sources which are not easily analyzable in traditional relational models or for which a graph data model is the natural representation. In order to understand the design and implementation choices for an attributed graph database backend and query language, we have started to design our infrastructure for attributed graph databases. In this paper, we describe the design considerations of our in-memory attributed graph database system with a particular focus on the data definition and query language components.

  19. Priority Intelligence Requirement Answering and Commercial Question-Answering: Identifying the Gaps

    DTIC Science & Technology

    2010-06-01

    15th ICCRTS “The Evolution of C2” Priority Intelligence Requirement Answering and Commercial Question-Answering: Identifying the Gaps Topic...2010 4. TITLE AND SUBTITLE Priority Intelligence Requirement Answering and Commercial Question-Answering: Identifying the Gaps 5a. CONTRACT NUMBER...text?based logic or ?semantic web? technologies; and social questionanswering technologies. We identify gaps in the PIR answering process that cannot

  20. Answering Key Fuel Cycle Questions

    SciTech Connect

    Piet, S.J.; Dixon, B.W.; Bennett, R.G.; Smith, J.D.; Hill, R.N.

    2004-10-03

    Given the range of fuel cycle goals and criteria, and the wide range of fuel cycle options, how can the set of options eventually be narrowed in a transparent and justifiable fashion? It is impractical to develop all options. We suggest an approach that starts by considering a range of goals for the Advanced Fuel Cycle Initiative (AFCI) and then posits seven questions, such as whether Cs and Sr isotopes should be separated from spent fuel and, if so, what should be done with them. For each question, we consider which of the goals may be relevant to eventually providing answers. The AFCI program has both ''outcome'' and ''process'' goals because it must address both waste already accumulating as well as completing the fuel cycle in connection with advanced nuclear power plant concepts. The outcome objectives are waste geologic repository capacity and cost, energy security and sustainability, proliferation resistance, fuel cycle economics, and safety. The process objectives are rea diness to proceed and adaptability and robustness in the face of uncertainties.

  1. Measuring persistence of implementation: QUERI Series.

    PubMed

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

    2008-04-22

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

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

  3. Use of synthesized data to support complex ad-hoc queries in an enterprise information warehouse: a diabetes use case.

    PubMed

    Rogers, Patrick; Erdal, Selnur; Santangelo, Jennifer; Liu, Jianhua; Schuster, Dara; Kamal, Jyoti

    2008-11-06

    The Ohio State University Medical Center (OSUMC) Information Warehouse (IW) is a comprehensive data warehousing facility incorporating operational, clinical, and biological data sets from multiple enterprise system. It is common for users of the IW to request complex ad-hoc queries that often require significant intervention by data analyst. In response to this challenge, we have designed a workflow that leverages synthesized data elements to support such queries in an more timely, efficient manner.

  4. An Evaluation of Automatic Query Expansion in an Online Library Catalogue.

    ERIC Educational Resources Information Center

    Hancock-Beaulieu, Micheline; Walker, Stephen

    1992-01-01

    Describes evaluation of an automatic query expansion (AQE) facility in the Okapi System, an online library catalog at City University in London (England). Results of transaction log analysis, search replays, questionnaires, and interviews are presented; and findings are discussed which indicate that AQE was beneficial in many searches. (12…

  5. 37 CFR 2.114 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    .... An answer may contain any defense, including the affirmative defenses of unclean hands, laches... withdrawn without prejudice except with the written consent of the registrant or the registrant's...

  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. Does Anyone Know the Answer to that Question? Individual Differences in Judging Answerability

    PubMed Central

    Karlsson, Bodil S. A.; Allwood, Carl Martin; Buratti, Sandra

    2016-01-01

    Occasionally people may attempt to judge whether a question can be answered today, or if not, if it can be answered in the future. For example, a person may consider whether enough is known about the dangers of living close to a nuclear plant, or to a major electricity cable, for them to be willing to do so, and state-authorities may consider whether questions about the dangers of new technologies have been answered, or in a reasonable future can be, for them to be willing to invest money in research aiming develop such technologies. A total of 476 participants, for each of 22 knowledge questions, either judged whether it was answerable today (current answerability), or judged when it could be answered (future answerability). The knowledge questions varied with respect to the expected consensus concerning their answerability: consensus questions (high expected consensus), non-consensus questions (lower expected consensus), and illusion questions (formulated to appear answerable, but with crucial information absent). The questions’ judged answerability level on the two scales was highly correlated. For both scales, consensus questions were rated more answerable than the non-consensus questions, with illusion questions falling in-between. The result for the illusion questions indicates that a feeling of answerability can be created even when it is unlikely that somebody can come up with an answer. The results also showed that individual difference variables influenced the answerability judgments. Higher levels of belief in certainty of knowledge, mankind’s knowledge, and mankind’s efficacy were related to judging the non-consensus questions as more answerable. Participants rating the illusion questions as answerable rated the other answerability questions as more, or equally, answerable compared to the other participants and showed tendencies to prefer a combination of more epistemic default processing and less intellectual processing. PMID:26793164

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

  9. Topology-free querying of protein interaction networks.

    PubMed

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

    2010-03-01

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

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

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

  12. Locality in Search Engine Queries and Its Implications for Caching

    DTIC Science & Technology

    2001-05-01

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

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

  14. Improving the Retrieval Effectiveness of Very Short Queries.

    ERIC Educational Resources Information Center

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

    2002-01-01

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

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

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

    ERIC Educational Resources Information Center

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

    2001-01-01

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

  17. Textual query of personal photos facilitated by large-scale web data.

    PubMed

    Liu, Yiming; Xu, Dong; Tsang, Ivor Wai-Hung; Luo, Jiebo

    2011-05-01

    The rapid popularization of digital cameras and mobile phone cameras has led to an explosive growth of personal photo collections by consumers. In this paper, we present a real-time textual query-based personal photo retrieval system by leveraging millions of Web images and their associated rich textual descriptions (captions, categories, etc.). After a user provides a textual query (e.g., “water”), our system exploits the inverted file to automatically find the positive Web images that are related to the textual query “water” as well as the negative Web images that are irrelevant to the textual query. Based on these automatically retrieved relevant and irrelevant Web images, we employ three simple but effective classification methods, k-Nearest Neighbor (kNN), decision stumps, and linear SVM, to rank personal photos. To further improve the photo retrieval performance, we propose two relevance feedback methods via cross-domain learning, which effectively utilize both the Web images and personal images. In particular, our proposed crossdomain learning methods can learn robust classifiers with only a very limited amount of labeled personal photos from the user by leveraging the prelearned linear SVM classifiers in real time. We further propose an incremental cross-domain learning method in order to significantly accelerate the relevance feedback process on large consumer photo databases. Extensive experiments on two consumer photo data sets demonstrate the effectiveness and efficiency of our system, which is also inherently not limited by any predefined lexicon.

  18. Answering Key Fuel Cycle Questions

    SciTech Connect

    Steven J. Piet; Brent W. Dixon; J. Stephen Herring; David E. Shropshire; Mary Lou Dunzik-Gougar

    2003-10-01

    The Advanced Fuel Cycle Initiative (AFCI) program has both “outcome” and “process” goals because it must address both waste already accumulating as well as completing the fuel cycle in connection with advanced nuclear power plant concepts. The outcome objectives are waste geological repository capacity and cost, energy security and sustainability, proliferation resistance, fuel cycle economics, and safety. The process objectives are readiness to proceed and adaptability and robustness in the face of uncertainties. A classic decision-making approach to such a multi-attribute problem would be to weight individual quantified criteria and calculate an overall figure of merit. This is inappropriate for several reasons. First, the goals are not independent. Second, the importance of different goals varies among stakeholders. Third, the importance of different goals is likely to vary with time, especially the “energy future.” Fourth, some key considerations are not easily or meaningfully quantifiable at present. Instead, at this point, we have developed 16 questions the AFCI program should answer and suggest an approach of determining for each whether relevant options improve meeting each of the program goals. We find that it is not always clear which option is best for a specific question and specific goal; this helps identify key issues for future work. In general, we suggest attempting to create as many win-win decisions (options that are attractive or neutral to most goals) as possible. Thus, to help clarify why the program is exploring the options it is, and to set the stage for future narrowing of options, we have developed 16 questions, as follows: · What are the AFCI program goals? · Which potential waste disposition approaches do we plan for? · What are the major separations, transmutation, and fuel options? · How do we address proliferation resistance? · Which potential energy futures do we plan for? · What potential external triggers do we

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

    PubMed Central

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

    1998-01-01

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

  20. The role of organizational research in implementing evidence-based practice: QUERI Series

    PubMed Central

    Yano, Elizabeth M

    2008-01-01

    Background Health care organizations exert significant influence on the manner in which clinicians practice and the processes and outcomes of care that patients experience. A greater understanding of the organizational milieu into which innovations will be introduced, as well as the organizational factors that are likely to foster or hinder the adoption and use of new technologies, care arrangements and quality improvement (QI) strategies are central to the effective implementation of research into practice. Unfortunately, much implementation research seems to not recognize or adequately address the influence and importance of organizations. Using examples from the U.S. Department of Veterans Affairs (VA) Quality Enhancement Research Initiative (QUERI), we describe the role of organizational research in advancing the implementation of evidence-based practice into routine care settings. Methods Using the six-step QUERI process as a foundation, we present an organizational research framework designed to improve and accelerate the implementation of evidence-based practice into routine care. Specific QUERI-related organizational research applications are reviewed, with discussion of the measures and methods used to apply them. We describe these applications in the context of a continuum of organizational research activities to be conducted before, during and after implementation. Results Since QUERI's inception, various approaches to organizational research have been employed to foster progress through QUERI's six-step process. We report on how explicit integration of the evaluation of organizational factors into QUERI planning has informed the design of more effective care delivery system interventions and enabled their improved "fit" to individual VA facilities or practices. We examine the value and challenges in conducting organizational research, and briefly describe the contributions of organizational theory and environmental context to the research framework

  1. Recommendation Boosted Query Propagation in the Social Network

    NASA Astrophysics Data System (ADS)

    Kukła, Grzegorz; Kazienko, Przemysław; Bródka, Piotr; Filipowski, Tomasz

    Every single company or institution wants to utilize its resources in the most efficient way and one of the most important resources is knowledge. In the paper, a new SocLaKE system is introduced. It exploits the social network existing within the organization together with information about expertise of community members to recommend the best way to get the answer over the chains of acquaintances. The explanation how the system recommends people and experiments on the sample social network are presented as well.

  2. Questions and Answers About Nuclear Power Plants.

    ERIC Educational Resources Information Center

    Environmental Protection Agency, Washington, DC.

    This pamphlet is designed to answer many of the questions that have arisen about nuclear power plants and the environment. It is organized into a question and answer format, with the questions taken from those most often asked by the public. Topics include regulation of nuclear power sources, potential dangers to people's health, whether nuclear…

  3. Answers to Health Questions in Physical Education.

    ERIC Educational Resources Information Center

    Kaplan, Robert, Ed.

    Culled from the answers of physical education teachers and coaches, this booklet attempts to indicate the scope of health problems and suggests some directions which the solutions may take. It is divided into three parts. Part 1, Health and Safety in Activity Programs, answers questions on first aid, excused absences, and desirability of…

  4. So, What Is the Answer? Questions

    ERIC Educational Resources Information Center

    Hall, Don

    2005-01-01

    Leaders are barraged daily by teachers, administrators, and students seeking answers to questions ranging from the simplistic to the metaphysical in their complexity. The author is sure leaders wonder at times, "How in the world can I free up enough time to answer them all?" Well, the author states that he hates to break the news, but it is…

  5. 12 CFR 19.19 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... fact. A statement of lack of information has the effect of a denial. Denials must fairly meet the... respondent. (c) Default—(1) Effect of failure to answer. Failure of a respondent to file an answer required... for entry of an order of default. Upon a finding that no good cause has been shown for the failure...

  6. 12 CFR 19.19 - Answer.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... fact. A statement of lack of information has the effect of a denial. Denials must fairly meet the... respondent. (c) Default—(1) Effect of failure to answer. Failure of a respondent to file an answer required... for entry of an order of default. Upon a finding that no good cause has been shown for the failure...

  7. Striving for Optimal Relevance when Answering Questions

    ERIC Educational Resources Information Center

    Gibbs, Raymond W., Jr.; Bryant, Gregory A.

    2008-01-01

    When people are asked "Do you have the time?" they can answer in a variety of ways, such as "It is almost 3," "Yeah, it is quarter past two," or more precisely as in "It is now 1:43." We present the results of four experiments that examined people's real-life answers to questions about the time. Our hypothesis, following previous research…

  8. 41 CFR 50-203.3 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... administrative law judge, unless the respondent disclaims knowledge upon which to make a denial. If the answer... consideration, such reasons and circumstances should be fully but concisely stated. (b) Such answer shall be in... shall be filed with the Chief administrative law judge, Department of Labor, Washington, D.C. (e) In...

  9. 12 CFR 308.508 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 12 Banks and Banking 4 2010-01-01 2010-01-01 false Answer. 308.508 Section 308.508 Banks and Banking FEDERAL DEPOSIT INSURANCE CORPORATION PROCEDURE AND RULES OF PRACTICE RULES OF PRACTICE AND PROCEDURE Program Fraud Civil Remedies and Procedures § 308.508 Answer. (a) The defendant may request...

  10. 12 CFR 308.508 - Answer.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 12 Banks and Banking 5 2014-01-01 2014-01-01 false Answer. 308.508 Section 308.508 Banks and Banking FEDERAL DEPOSIT INSURANCE CORPORATION PROCEDURE AND RULES OF PRACTICE RULES OF PRACTICE AND PROCEDURE Program Fraud Civil Remedies and Procedures § 308.508 Answer. (a) The defendant may request...

  11. 12 CFR 308.508 - Answer.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 12 Banks and Banking 5 2012-01-01 2012-01-01 false Answer. 308.508 Section 308.508 Banks and Banking FEDERAL DEPOSIT INSURANCE CORPORATION PROCEDURE AND RULES OF PRACTICE RULES OF PRACTICE AND PROCEDURE Program Fraud Civil Remedies and Procedures § 308.508 Answer. (a) The defendant may request...

  12. 12 CFR 308.508 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 12 Banks and Banking 4 2011-01-01 2011-01-01 false Answer. 308.508 Section 308.508 Banks and Banking FEDERAL DEPOSIT INSURANCE CORPORATION PROCEDURE AND RULES OF PRACTICE RULES OF PRACTICE AND PROCEDURE Program Fraud Civil Remedies and Procedures § 308.508 Answer. (a) The defendant may request...

  13. 37 CFR 41.39 - Examiner's answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Examiner's answer. 41.39... COMMERCE PRACTICE BEFORE THE BOARD OF PATENT APPEALS AND INTERFERENCES Ex Parte Appeals § 41.39 Examiner's... appealable action, the primary examiner shall make such determination of record. (2) An examiner's answer...

  14. 20 CFR 355.9 - Answer.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 20 Employees' Benefits 1 2013-04-01 2012-04-01 true Answer. 355.9 Section 355.9 Employees' Benefits RAILROAD RETIREMENT BOARD ADMINISTRATIVE REMEDIES FOR FRAUDULENT CLAIMS OR STATEMENTS REGULATIONS UNDER THE PROGRAM FRAUD CIVIL REMEDIES ACT OF 1986 § 355.9 Answer. (a) The defendant may request...

  15. 20 CFR 355.9 - Answer.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 20 Employees' Benefits 1 2012-04-01 2012-04-01 false Answer. 355.9 Section 355.9 Employees' Benefits RAILROAD RETIREMENT BOARD ADMINISTRATIVE REMEDIES FOR FRAUDULENT CLAIMS OR STATEMENTS REGULATIONS UNDER THE PROGRAM FRAUD CIVIL REMEDIES ACT OF 1986 § 355.9 Answer. (a) The defendant may request...

  16. 20 CFR 355.9 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 20 Employees' Benefits 1 2011-04-01 2011-04-01 false Answer. 355.9 Section 355.9 Employees' Benefits RAILROAD RETIREMENT BOARD ADMINISTRATIVE REMEDIES FOR FRAUDULENT CLAIMS OR STATEMENTS REGULATIONS UNDER THE PROGRAM FRAUD CIVIL REMEDIES ACT OF 1986 § 355.9 Answer. (a) The defendant may request...

  17. 38 CFR 42.9 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 38 Pensions, Bonuses, and Veterans' Relief 2 2011-07-01 2011-07-01 false Answer. 42.9 Section 42.9 Pensions, Bonuses, and Veterans' Relief DEPARTMENT OF VETERANS AFFAIRS (CONTINUED) STANDARDS IMPLEMENTING THE PROGRAM FRAUD CIVIL REMEDIES ACT § 42.9 Answer. (a) The defendant may request a hearing by...

  18. 38 CFR 42.9 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 38 Pensions, Bonuses, and Veterans' Relief 2 2010-07-01 2010-07-01 false Answer. 42.9 Section 42.9 Pensions, Bonuses, and Veterans' Relief DEPARTMENT OF VETERANS AFFAIRS (CONTINUED) STANDARDS IMPLEMENTING THE PROGRAM FRAUD CIVIL REMEDIES ACT § 42.9 Answer. (a) The defendant may request a hearing by...

  19. Recognizing Question Entailment for Medical Question Answering

    PubMed Central

    Abacha, Asma Ben; Dina, Demner-Fushman

    2016-01-01

    With the increasing heterogeneity and specialization of medical texts, automated question answering is becoming more and more challenging. In this context, answering a given medical question by retrieving similar questions that are already answered by human experts seems to be a promising solution. In this paper, we propose a new approach for the detection of similar questions based on Recognizing Question Entailment (RQE). In particular, we consider Frequently Asked Question (FAQs) as a valuable and widespread source of information. Our final goal is to automatically provide an existing answer if FAQ similar to a consumer health question exists. We evaluate our approach using consumer health questions received by the National Library of Medicine and FAQs collected from NIH websites. Our first results are promising and suggest the feasibility of our approach as a valuable complement to classic question answering approaches. PMID:28269825

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

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

  2. An Architecture for Handling Fuzzy Queries in Data Warehouses

    NASA Astrophysics Data System (ADS)

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

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

  3. Sentence Similarity Analysis with Applications in Automatic Short Answer Grading

    ERIC Educational Resources Information Center

    Mohler, Michael A. G.

    2012-01-01

    In this dissertation, I explore unsupervised techniques for the task of automatic short answer grading. I compare a number of knowledge-based and corpus-based measures of text similarity, evaluate the effect of domain and size on the corpus-based measures, and also introduce a novel technique to improve the performance of the system by integrating…

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

    PubMed

    Behnam, Mohammad; Pourghassem, Hossein

    2015-04-01

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

  5. Chaotic Order Preserving Encryption for Efficient and Secure Queries on Databases

    NASA Astrophysics Data System (ADS)

    Lee, Seungmin; Park, Tae-Jun; Lee, Donghyeok; Nam, Taekyong; Kim, Sehun

    The need for data encryption that protects sensitive data in a database has increased rapidly. However, encrypted data can no longer be efficiently queried because nearly all of the data should be decrypted. Several order-preserving encryption schemes that enable indexes to be built over encrypted data have been suggested to solve this problem. They allow any comparison operation to be directly applied to encrypted data. However, one of the main disadvantages of these schemes is that they expose sensitive data to inference attacks with order information, especially when the data are used together with unencrypted columns in the database. In this study, a new order-preserving encryption scheme that provides secure queries by hiding the order is introduced. Moreover, it provides efficient queries because any user who has the encryption key knows the order. The proposed scheme is designed to be efficient and secure in such an environment. Thus, it is possible to encrypt only sensitive data while leaving other data unencrypted. The encryption is not only robust against order exposure, but also shows high performance for any query over encrypted data. In addition, the proposed scheme provides strong updates without assumptions of the distribution of plaintext. This allows it to be integrated easily with the existing database system.

  6. Use of Numerical Models as Data Proxies for Approximate Ad-Hoc Query Processing

    SciTech Connect

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

    2003-05-19

    As datasets grow beyond the gigabyte scale, there is an increasing demand to develop techniques for dealing/interacting with them. To this end, the DataFoundry team at the Lawrence Livermore National Laboratory has developed a software prototype called Approximate Adhoc Query Engine for Simulation Data (AQSim). The goal of AQSim is to provide a framework that allows scientists to interactively perform adhoc queries over terabyte scale datasets using numerical models as proxies for the original data. The advantages of this system are several. The first is that by storing only the model parameters, each dataset occupies a smaller footprint compared to the original, increasing the shelf-life of such datasets before they are sent to archival storage. Second, the models are geared towards approximate querying as they are built at different resolutions, allowing the user to make the tradeoff between model accuracy and query response time. This allows the user greater opportunities for exploratory data analysis. Lastly, several different models are allowed, each focusing on a different characteristic of the data thereby enhancing the interpretability of the data compared to the original. The focus of this paper is on the modeling aspects of the AQSim framework.

  7. Modeling and query the uncertainty of network constrained moving objects based on RFID data

    NASA Astrophysics Data System (ADS)

    Han, Liang; Xie, Kunqing; Ma, Xiujun; Song, Guojie

    2007-06-01

    The management of network constrained moving objects is more and more practical, especially in intelligent transportation system. In the past, the location information of moving objects on network is collected by GPS, which cost high and has the problem of frequent update and privacy. The RFID (Radio Frequency IDentification) devices are used more and more widely to collect the location information. They are cheaper and have less update. And they interfere in the privacy less. They detect the id of the object and the time when moving object passed by the node of the network. They don't detect the objects' exact movement in side the edge, which lead to a problem of uncertainty. How to modeling and query the uncertainty of the network constrained moving objects based on RFID data becomes a research issue. In this paper, a model is proposed to describe the uncertainty of network constrained moving objects. A two level index is presented to provide efficient access to the network and the data of movement. The processing of imprecise time-slice query and spatio-temporal range query are studied in this paper. The processing includes four steps: spatial filter, spatial refinement, temporal filter and probability calculation. Finally, some experiments are done based on the simulated data. In the experiments the performance of the index is studied. The precision and recall of the result set are defined. And how the query arguments affect the precision and recall of the result set is also discussed.

  8. KBGIS-2: A knowledge-based geographic information system

    NASA Technical Reports Server (NTRS)

    Smith, T.; Peuquet, D.; Menon, S.; Agarwal, P.

    1986-01-01

    The architecture and working of a recently implemented knowledge-based geographic information system (KBGIS-2) that was designed to satisfy several general criteria for the geographic information system are described. The system has four major functions that include query-answering, learning, and editing. The main query finds constrained locations for spatial objects that are describable in a predicate-calculus based spatial objects language. The main search procedures include a family of constraint-satisfaction procedures that use a spatial object knowledge base to search efficiently for complex spatial objects in large, multilayered spatial data bases. These data bases are represented in quadtree form. The search strategy is designed to reduce the computational cost of search in the average case. The learning capabilities of the system include the addition of new locations of complex spatial objects to the knowledge base as queries are answered, and the ability to learn inductively definitions of new spatial objects from examples. The new definitions are added to the knowledge base by the system. The system is currently performing all its designated tasks successfully, although currently implemented on inadequate hardware. Future reports will detail the performance characteristics of the system, and various new extensions are planned in order to enhance the power of KBGIS-2.

  9. MEDLINE as a Source of Just-in-Time Answers to Clinical Questions

    PubMed Central

    Demner-Fushman, Dina; Hauser, Susan E.; Humphrey, Susanne M.; Ford, Glenn M.; Jacobs, Joshua L.; Thoma, George R.

    2006-01-01

    Clinicians increasingly use handheld devices to support evidence-based practice and for clinical decision support. However, support of clinical decisions through information retrieval from MEDLINE® and other databases lags behind popular daily activities such as patient information or drug formulary look-up. The objective of the current study is to determine whether relevant information can be retrieved from MEDLINE to answer clinical questions using a handheld device at the point of care. Analysis of search and retrieval results for 108 clinical questions asked by members of clinical teams during 28 daily rounds in a 12-bed intensive care unit confirm MEDLINE as a potentially valuable resource for just-in-time answers to clinical questions. Answers to 93 (86%) questions were found in MEDLINE by two resident physicians using handheld devices. The majority of answers, 88.9% and 97.7% respectively, were found during rounds. Strategies that facilitated timely retrieval of results include using PubMed® Clinical Queries and Related Articles, spell check, and organizing retrieval results into topical clusters. Further possible improvements in organization of retrieval results such as automatic semantic clustering and providing patient outcome information along with the titles of the retrieved articles are discussed. PMID:17238329

  10. MEDLINE as a source of just-in-time answers to clinical questions.

    PubMed

    Demner-Fushman, Dina; Hauser, Susan E; Humphrey, Susanne M; Ford, Glenn M; Jacobs, Joshua L; Thoma, George R

    2006-01-01

    Clinicians increasingly use handheld devices to support evidence-based practice and for clinical decision support. However, support of clinical decisions through information retrieval from MEDLINE(R) and other databases lags behind popular daily activities such as patient information or drug formulary look-up. The objective of the current study is to determine whether relevant information can be retrieved from MEDLINE to answer clinical questions using a handheld device at the point of care. Analysis of search and retrieval results for 108 clinical questions asked by members of clinical teams during 28 daily rounds in a 12-bed intensive care unit confirm MEDLINE as a potentially valuable resource for just-in-time answers to clinical questions. Answers to 93 (86%) questions were found in MEDLINE by two resident physicians using handheld devices. The majority of answers, 88.9% and 97.7% respectively, were found during rounds. Strategies that facilitated timely retrieval of results include using PubMed(R) Clinical Queries and Related Articles, spell check, and organizing retrieval results into topical clusters. Further possible improvements in organization of retrieval results such as automatic semantic clustering and providing patient outcome information along with the titles of the retrieved articles are discussed.

  11. KBGIS-II: A knowledge-based geographic information system

    NASA Technical Reports Server (NTRS)

    Smith, Terence; Peuquet, Donna; Menon, Sudhakar; Agarwal, Pankaj

    1986-01-01

    The architecture and working of a recently implemented Knowledge-Based Geographic Information System (KBGIS-II), designed to satisfy several general criteria for the GIS, is described. The system has four major functions including query-answering, learning and editing. The main query finds constrained locations for spatial objects that are describable in a predicate-calculus based spatial object language. The main search procedures include a family of constraint-satisfaction procedures that use a spatial object knowledge base to search efficiently for complex spatial objects in large, multilayered spatial data bases. These data bases are represented in quadtree form. The search strategy is designed to reduce the computational cost of search in the average case. The learning capabilities of the system include the addition of new locations of complex spatial objects to the knowledge base as queries are answered, and the ability to learn inductively definitions of new spatial objects from examples. The new definitions are added to the knowledge base by the system. The system is performing all its designated tasks successfully. Future reports will relate performance characteristics of the system.

  12. 37 CFR 2.106 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    .... An answer may contain any defense, including the affirmative defenses of unclean hands, laches... prejudice except with the written consent of the applicant or the applicant's attorney or other...

  13. 7 CFR 15.84 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... deny each allegation of the notice, unless the applicant or recipient is without knowledge, in which case the answer shall so state, and the statement will be considered a denial. Failure to file...

  14. 43 CFR 4.1284 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... Applicable to Surface Coal Mining Hearings and Appeals Appeals to the Board from Decisions of the Office of Surface Mining § 4.1284 Answer. (a) Any party served with a notice of appeal who wishes to participate...

  15. 43 CFR 4.1284 - Answer.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... Applicable to Surface Coal Mining Hearings and Appeals Appeals to the Board from Decisions of the Office of Surface Mining § 4.1284 Answer. (a) Any party served with a notice of appeal who wishes to participate...

  16. 43 CFR 4.1284 - Answer.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... Applicable to Surface Coal Mining Hearings and Appeals Appeals to the Board from Decisions of the Office of Surface Mining § 4.1284 Answer. (a) Any party served with a notice of appeal who wishes to participate...

  17. 43 CFR 4.1284 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... Applicable to Surface Coal Mining Hearings and Appeals Appeals to the Board from Decisions of the Office of Surface Mining § 4.1284 Answer. (a) Any party served with a notice of appeal who wishes to participate...

  18. 43 CFR 4.818 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... Procedural Rules Applicable to Practice and Procedure for Hearings, Decisions, and Administrative Review... Interior-Effectuation of Title VI of the Civil Rights Act of 1964 Procedures § 4.818 Answer. In any...

  19. Questions and Answers for Architectural Coatings Rule

    EPA Pesticide Factsheets

    The EPA compiled this question and answer document from inquiries received after the publication of the 1999 final architectural coatings rule and from questions raised at meetings with industry associations.

  20. Olympics: Questions & Answers on the Major Events.

    ERIC Educational Resources Information Center

    Gibbon, Alan

    This book presents background information on the major Olympic events with a question-answer format. Events considered include track and field, swimming, diving, boxing, weightlifting, the equestrian events, and gymnastics. Line drawings illustrate the text. (MM)

  1. One Answer to "What Is Calculus?"

    ERIC Educational Resources Information Center

    Shilgalis, Thomas W.

    1979-01-01

    A number of questions are posed that can be answered with the aid of calculus. These include best value problems, best shape problems, problems involving integration, and growth and decay problems. (MP)

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

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

    ERIC Educational Resources Information Center

    Woal, S. Theodore

    1974-01-01

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

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

  5. Exploring the Query Expansion Methods for Concept Based Representation

    DTIC Science & Technology

    2014-11-01

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

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

    DTIC Science & Technology

    1991-09-01

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

  7. Do Melt Inclusions Answer Big Questions?

    NASA Astrophysics Data System (ADS)

    Hofmann, A. W.; Sobolev, A. V.

    2009-12-01

    In a pioneering paper, Sobolev and Shimizu (1993) demonstrated the existence of ultra-depleted melt inclusions in olivine phenocrysts in MORB. They interpreted these as evidence for the preservation of parental melts formed by progressive near-fractional melting. Subsequently many cases have been described where melt inclusions from single basalt samples display enormous chemical and isotopic heterogeneity. The interpretation of these observations hinges critically on whether such melt inclusions can faithfully preserve primary or parental melt composition. If they do, melt inclusion data can truly answer big questions from small-scale observations. If they do not, they answer rather small questions. Favoring the second possibility, Danyushevsky et al. (2004) have suggested that much of the observed variability of highly incompatible trace elements in melt inclusions “may not represent geologically significant melts, but instead reflect localized, grain-scale reaction processes within the magmatic plumbing system.” We disagree and show that this mechanism cannot, for example, explain isotopic heterogeneity measured in several suites of melt inclusions, nor does it not account for the presence of ultra-depleted melts and "ghost" plagioclase signatures in other inclusions. More recently, Spandler et al. (2007) have suggested on the basis of experimental evidence that diffusion rates for REE in olivine are so rapid that parental melt compositions in melt inclusions are rapidly falsified by diffusional exchange with (evolved) host lava. We show that the very fact that extreme chemical and isotopic heterogeneities are routinely preserved in melt inclusions demonstrates that this conclusion is unwarranted, either because residence times of the olivine phenocrysts are much shorter than assumed by Spandler et al. or because the high experimental diffusion rates are caused by an unknown experimental artifact. Although there is no obvious flaw in design and execution of

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

  9. Space medicine - Answering the challenge

    NASA Technical Reports Server (NTRS)

    Lloyd, Charles W.

    1991-01-01

    The development of Space Station Freedom (SSF) Health Maintenance Facility (HMF) is discussed. Attention is given to HMF subsystems; the diagnostic radiological imaging system; the physician instruments; the pharmacy and central supply; the Fluid Therapy Subsystem; the restraints to be used for medical procedures; and the Safe Haven mode, which is a mode of station operation in which it is assumed that the HMF has been lost and the medical needs must be provided by the emergency medical equipment and supplies located in the Portable Emergency Provisions. Special attention is given to the pharmaceutical issues involved, including such as the product selection, oral medications, injectable medications, the effect of exposing medications to high vacuum, and the product shelf life.

  10. Prevention of disease the answer.

    PubMed

    1994-10-03

    The director general of the World Health Organization (WHO), Hiroshi Nakajima, in an interview following a two-day visit to Rwanda stressed the need to restore safe blood transfusion services to prevent the spread of AIDS as well as distribution of essential drugs and vaccines. According to WHO, health facilities were looted, while 75% of the more than 5000 health workers fled or were killed since ethnic violence broke out April 6, 1994. Fighting between the majority Hutu-led government and Tutsi-dominated Rwandan Patriotic Front claimed more than 500,000 lives and forced more than two million people to seek refuge in neighboring countries. The WHO will provide training, equipment, and laboratory supplies in order to strengthen epidemiological monitoring of preventable epidemic diseases like cholera, dysentery, acute respiratory infections, meningitis, tuberculosis, and malaria. Of particular concern, was the need to monitor systematically forms of cholera and bacillary dysentery which has the ability to change its resistance to different antibiotics A dysentery epidemic has already claimed thousands of lives in refugee camps in Tanzania, Zaire and Rwanda. War and massive population displacements have dramatically increased transmission of HIV, as HIV prevalence was about 30% in Kigali among women and up to 50% among soldiers. Before the war, HIV infection rates ranged from 20 to 30% among the urban population and less than 10% in rural areas. More than 200,000 persons were already infected with HIV in Rwanda in 1992. The WHO will provide blood transfusion kits to ensure collection, testing and transfusion of blood. It will also train 60 blood transfusion technicians. The WHO will help to supply the management system of the Central Rwandan Pharmaceutical Office and provide essential drugs and vaccines to supplement stocks supplied by international donors. Nakajima appealed to both the international community and Africa to help Rwanda.

  11. Querying Uncertain Data in Geospatial Object-relational Databases Using SQL and Fuzzy Sets

    NASA Astrophysics Data System (ADS)

    Ďuračiová, R.

    2013-12-01

    This paper deals with uncertainty modeling in spatial object-relational databases by the use of Structured Query Language (SQL). The fundamental principles of uncertainty modeling by fuzzy sets are applied in the area of geographic information systems (GIS) and spatial databases. A spatial database system includes types of spatial data and implements the spatial extension of SQL. The implementation of the principles of fuzzy logic to spatial databases brings an opportunity for the efficient processing of uncertain data, which is important, especially when using various data sources (e.g., multi-criteria decision making (MCDM) on the basis of heterogeneous spatial data resources). The modeling and data processing of uncertainties are presented in relation to the applicable International Organization for Standardization (ISO) standards (standards of the series 19100 Geographic information) and the relevant specifications of the Open Geospatial Consortium (OGC). The fuzzy spatial query approach is applied and tested on a case study with a fundamental database for GIS in Slovakia.

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

  13. GELLO: An Object-Oriented Query and Expression Language for Clinical Decision Support

    PubMed Central

    Sordo, Margarita; Ogunyemi, Omolola; Boxwala, Aziz A.; Greenes, Robert A.

    2003-01-01

    GELLO is a purpose-specific, object-oriented (OO) query and expression language [1]. GELLO is the result of a concerted effort of the Decision Systems Group (DSG) working with the HL7 Clinical Decision Support Technical Committee (CDSTC) to provide the HL7 community with a common format for data encoding and manipulation. GELLO will soon be submitted for ballot to the HL7 CDSTC for consideration as a standard. PMID:14728515

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

  15. Understanding the Factors Influencing User Experience of Social Question and Answer Services

    ERIC Educational Resources Information Center

    Deng, Shengli; Fang, Yuling; Liu, Yong; Li, Hongxiu

    2015-01-01

    Introduction: The popularity of social question and answer sites has made it an important and convenient source for obtaining knowledge. This study quantifies how three different system characteristics (interface design, interaction and answer quality) affect users' perceptions (perceived usefulness, perceived ease of use and perceived enjoyment),…

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

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

    NASA Astrophysics Data System (ADS)

    Chatziantoniou, Damianos; Sotiropoulos, Yannis

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

  18. Empirical evaluation of analytical models for parallel relational data-base queries. Master's thesis

    SciTech Connect

    Denham, M.C.

    1990-12-01

    This thesis documents the design and implementation of three parallel join algorithms to be used in the verification of analytical models developed by Kearns. Kearns developed a set of analytical models for a variety of relational database queries. These models serve as tools for the design of parallel relational database system. Each of Kearns' models is classified as either single step or multiple step. The single step models reflect queries that require only one operation while the multiple step models reflect queries that require multiple operations. Three parallel join algorithms were implemented based upon Kearns' models. Two are based upon single step join models and one is based upon a multiple step join model. They are implemented on an Intel iPSC/1 parallel computer. The single step join algorithms include the parallel nested-loop join and the bucket (or hash) join. The multiple step algorithm that was implemented is a pipelined version of the bucket join. The results show that within the constraints of the test cases run, the three models are all at least accurate to within about 8.5% and they should prove useful in the design of parallel relational database systems.

  19. A Querying Method over RDF-ized Health Level Seven v2.5 Messages Using Life Science Knowledge Resources

    PubMed Central

    2016-01-01

    Background Health level seven version 2.5 (HL7 v2.5) is a widespread messaging standard for information exchange between clinical information systems. By applying Semantic Web technologies for handling HL7 v2.5 messages, it is possible to integrate large-scale clinical data with life science knowledge resources. Objective Showing feasibility of a querying method over large-scale resource description framework (RDF)-ized HL7 v2.5 messages using publicly available drug databases. Methods We developed a method to convert HL7 v2.5 messages into the RDF. We also converted five kinds of drug databases into RDF and provided explicit links between the corresponding items among them. With those linked drug data, we then developed a method for query expansion to search the clinical data using semantic information on drug classes along with four types of temporal patterns. For evaluation purpose, medication orders and laboratory test results for a 3-year period at the University of Tokyo Hospital were used, and the query execution times were measured. Results Approximately 650 million RDF triples for medication orders and 790 million RDF triples for laboratory test results were converted. Taking three types of query in use cases for detecting adverse events of drugs as an example, we confirmed these queries were represented in SPARQL Protocol and RDF Query Language (SPARQL) using our methods and comparison with conventional query expressions were performed. The measurement results confirm that the query time is feasible and increases logarithmically or linearly with the amount of data and without diverging. Conclusions The proposed methods enabled query expressions that separate knowledge resources and clinical data, thereby suggesting the feasibility for improving the usability of clinical data by enhancing the knowledge resources. We also demonstrate that when HL7 v2.5 messages are automatically converted into RDF, searches are still possible through SPARQL without

  20. Comparison of individual answer and group answer with and without structured peer assessment

    NASA Astrophysics Data System (ADS)

    Kablan, Zeynel

    2014-09-01

    Background:Cooperative learning activities provide active participation of students leading to better learning. The literature suggests that cooperative learning activities need to be structured for a more effective and productive interaction. Purpose: This study aimed to test the differences among three instructional conditions in terms of science achievement. Sample:A total of 79 fifth-grade students, 42 males (53%) and 37 females (47%), participated in the study. Design and Methods:In the first condition, students answered the teacher's questions individually by raising hands. In the second condition, students discussed the answer in groups and came up with a single group answer. In this condition, the teacher provided only verbal directions to the groups without using any strategy or material. In the third condition, students used a 'peer assessment form' before giving the group answer. A pre-/post-test experimental design was used. Multiple-choice and open-ended tests were used for data collection. One-way analysis of variance (ANOVA) was conducted to test the differences in the test scores between the three groups (individual answer, unstructured group answer and structured group answer). Results:Results showed that there were no significant differences among the three learning conditions in terms of their multiple-choice test scores. In terms of the open-ended test scores, students in the structured group answer condition scored significantly higher than the students in the individual answer condition. Conclusions:Structuring the group work through peer assessment helped to monitor the group discussion, provided a better learning compared to the individual answer condition, and helped students to participate in the activity equally.

  1. A framework for querying a database for structural information on 3D images of macromolecules: A web-based query-by-content prototype on the BioImage macromolecular server.

    PubMed

    de Alarcón, P A; Gupta, A; Carazo, J M

    1999-01-01

    Nowadays we are experiencing a remarkable growth in the number of databases that have become accessible over the Web. However, in a certain number of cases, for example, in the case of BioImage, this information is not of a textual nature, thus posing new challenges in the design of tools to handle these data. In this work, we concentrate on the development of new mechanisms aimed at "querying" these databases of complex data sets by their intrinsic content, rather than by their textual annotations only. We concentrate our efforts on a subset of BioImage containing 3D images (volumes) of biological macromolecules, implementing a first prototype of a "query-by-content" system. In the context of databases of complex data types the term query-by-content makes reference to those data modeling techniques in which user-defined functions aim at "understanding" (to some extent) the informational content of the data sets. In these systems the matching criteria introduced by the user are related to intrinsic features concerning the 3D images themselves, hence, complementing traditional queries by textual key words only. Efficient computational algorithms are required in order to "extract" structural information of the 3D images prior to storing them in the database. Also, easy-to-use interfaces should be implemented in order to obtain feedback from the expert. Our query-by-content prototype is used to construct a concrete query, making use of basic structural features, which are then evaluated over a set of three-dimensional images of biological macromolecules. This experimental implementation can be accessed via the Web at the BioImage server in Madrid, at http://www.bioimage.org/qbc/index.html.

  2. Ontology and rules based model for traffic query

    NASA Astrophysics Data System (ADS)

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

    2008-10-01

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

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

    PubMed

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

    2008-11-06

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

  4. Better Questions and Answers Equal Success.

    ERIC Educational Resources Information Center

    Swicegood, Philip R.; Parsons, James L.

    1989-01-01

    Students with learning disabilities and behavior problems need instruction designed to increase active thinking and questioning skills. Described methods for teaching these skills include T. Raphael's question-answer relationships, A. Hahn's questioning strategy, reciprocal teaching, and the "ReQuest" procedure. Practice activities for…

  5. 40 CFR 209.6 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... (3) contends that he or she is entitled to judgment as a matter of law, he or she shall file a... after service of the complaint. Initiation of informal conferences with the Agency under § 209.19 does not add to the -twenty (20) day period. The time per-iod in which to file an answer may be extended...

  6. 22 CFR 224.9 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 22 Foreign Relations 1 2011-04-01 2011-04-01 false Answer. 224.9 Section 224.9 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT IMPLEMENTATION OF THE PROGRAM FRAUD CIVIL REMEDIES ACT § 224.9... of time as provided in § 224.11. For good cause shown, the ALJ may grant the defendant up to...

  7. 22 CFR 224.9 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Answer. 224.9 Section 224.9 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT IMPLEMENTATION OF THE PROGRAM FRAUD CIVIL REMEDIES ACT § 224.9... of time as provided in § 224.11. For good cause shown, the ALJ may grant the defendant up to...

  8. 7 CFR 47.8 - The answer.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 2 2010-01-01 2010-01-01 false The answer. 47.8 Section 47.8 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... UNDER THE PERISHABLE AGRICULTURAL COMMODITIES ACT Rules Applicable to Reparation Proceedings § 47.8...

  9. Questions & Answers about Aeronautics and Space.

    ERIC Educational Resources Information Center

    National Aeronautics and Space Administration, Washington, DC.

    Answers to 27 questions about aeronautics, space, and the National Aeronautics and Space Administration (NASA) are provided in this pamphlet. Among the topics dealt with in these questions are: costs of the space program; NASA's role in aeronautics; benefits received from the space program; why the United States hasn't developed means of rescuing…

  10. 43 CFR 4.1293 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 43 Public Lands: Interior 1 2011-10-01 2011-10-01 false Answer. 4.1293 Section 4.1293 Public Lands: Interior Office of the Secretary of the Interior DEPARTMENT HEARINGS AND APPEALS PROCEDURES Special Rules Applicable to Surface Coal Mining Hearings and Appeals Petitions for Award of Costs and Expenses...

  11. 43 CFR 4.1293 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 43 Public Lands: Interior 1 2010-10-01 2010-10-01 false Answer. 4.1293 Section 4.1293 Public Lands: Interior Office of the Secretary of the Interior DEPARTMENT HEARINGS AND APPEALS PROCEDURES Special Rules Applicable to Surface Coal Mining Hearings and Appeals Petitions for Award of Costs and Expenses...

  12. American Indians Today: Answers to Your Questions.

    ERIC Educational Resources Information Center

    Bureau of Indian Affairs (Dept. of Interior), Washington, DC.

    This booklet attempts to answer briefly the most common questions about American Indians asked by students, people who believe they have Indian ancestors, individuals who want to visit or volunteer to work on a reservation, or those who want to know the current Indian policy. Separate sections outline President Reagan's American Indian policy;…

  13. 16 CFR 3.12 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... appropriate findings and conclusions and a final order disposing of the proceeding. In such an answer, the respondent may, however, reserve the right to submit proposed findings of fact and conclusions of law under... conclusions and a final order disposing of the proceeding....

  14. Answering Wh- Questions About Sentences and Text.

    ERIC Educational Resources Information Center

    Singer, Murray

    1986-01-01

    Describes a study designed to identify the mental operations that contribute to people's ability to answer wh- questions, that is, questions which request information that plays a particular role in relation to some action or event. Wh- questions are signaled by interrogative pronouns and adverbs like who, what, when, and where. (SED)

  15. 12 CFR 509.19 - Answer.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... OFFICE OF THRIFT SUPERVISION, DEPARTMENT OF THE TREASURY RULES OF PRACTICE AND PROCEDURE IN ADJUDICATORY... the notice, respondent shall file an answer as designated in the notice. In a civil money penalty... upon consent. (2) Effect of failure to request a hearing in civil money penalty proceedings....

  16. 12 CFR 509.19 - Answer.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... OFFICE OF THRIFT SUPERVISION, DEPARTMENT OF THE TREASURY RULES OF PRACTICE AND PROCEDURE IN ADJUDICATORY... the notice, respondent shall file an answer as designated in the notice. In a civil money penalty... upon consent. (2) Effect of failure to request a hearing in civil money penalty proceedings....

  17. Understanding the Minimum Wage: Issues and Answers.

    ERIC Educational Resources Information Center

    Employment Policies Inst. Foundation, Washington, DC.

    This booklet, which is designed to clarify facts regarding the minimum wage's impact on marketplace economics, contains a total of 31 questions and answers pertaining to the following topics: relationship between minimum wages and poverty; impacts of changes in the minimum wage on welfare reform; and possible effects of changes in the minimum wage…

  18. Memory, Knowledge, and the Answering of Questions.

    ERIC Educational Resources Information Center

    Norman, Donald A.

    An examination of the nature of memory reveals that the representation of knowledge cannot be separated from the uses of knowledge. The answering of questions is not a simple retrieval and response of stored information; rather the process is embedded in a general structural framework containing knowledge of the questioner, the question, and the…

  19. What's Your Answer? Searching for Triangles

    ERIC Educational Resources Information Center

    Meagher, Michael S.; Edwards, Michael Todd; Özgün-Koca, S. Asli

    2016-01-01

    The article opens with a Geoboard Triangle Quest in this form: "How many noncongruent triangles can be constructed on a 4 × 4 geoboard? How do you know? Justify your answer with significant supporting work." The use of advanced digital technologies as tools for problem solving receives much attention in the methods classes if the…

  20. 41 CFR 60-30.6 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 41 Public Contracts and Property Management 1 2010-07-01 2010-07-01 true Answer. 60-30.6 Section 60-30.6 Public Contracts and Property Management Other Provisions Relating to Public Contracts OFFICE... attorney, and served on the Government in accordance with § 60-30.4(b). (b) Contents; failure to file....

  1. Survey Questions Answered Only by Psychosocial Experts.

    ERIC Educational Resources Information Center

    American Journal on Mental Retardation, 2000

    2000-01-01

    Twelve tables provide a breakdown of answers to a survey responded to by 48 experts in the psychosocial treatment of psychiatric and behavioral problems in people with mental retardation. Questions address treatment of self-injurious or aggressive behavior, specific psychiatric disorders, specific target symptoms, use of applied behavior analysis…

  2. Test Theory Without an Answer Key.

    ERIC Educational Resources Information Center

    Batchelder, William H.; Romney, A. Kimball

    1988-01-01

    A general model is presented for homogeneous, dichotomous items when the answer key is unknown. The model is related to the two-class latent structure model with the roles of respondents and items interchanged. Iterative maximum likelihood estimates of parameters and Monte Carlo assessment of estimation methods are described. (TJH)

  3. From Asking to Answering: Making Questions Explicit

    ERIC Educational Resources Information Center

    Washington, Gene

    2006-01-01

    "From Asking To Answering: Making Questions Explicit" describes a pedagogical procedure the author has used in writing classes (expository, technical and creative) to help students better understand the purpose, and effect, of text-questions. It accomplishes this by means of thirteen discrete categories (e.g., CLAIMS, COMMITMENT, ANAPHORA, or…

  4. 12 CFR 109.19 - Answer.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... deny each allegation of fact. A statement of lack of information has the effect of a denial. Denials... defenses, if any, asserted by the respondent. (c) Default—(1) Effect of failure to answer. Failure of a..., Enforcement Counsel may file a motion for entry of an order of default. Upon a finding that no good cause...

  5. Questions & Answers about...Marfan Syndrome.

    ERIC Educational Resources Information Center

    National Inst. of Arthritis and Musculoskeletal and Skin Diseases (NIH), Bethesda, MD.

    This fact sheet answers general questions about Marfan syndrome, a heritable condition that affects the connective tissue. It describes the characteristics of the disorder, the diagnostic process, and ways to manage symptoms. Characteristics include: (1) people with Marfan syndrome are typically very tall, slender, and loose jointed; (2) more than…

  6. Answer Set Programming and Other Computing Paradigms

    ERIC Educational Resources Information Center

    Meng, Yunsong

    2013-01-01

    Answer Set Programming (ASP) is one of the most prominent and successful knowledge representation paradigms. The success of ASP is due to its expressive non-monotonic modeling language and its efficient computational methods originating from building propositional satisfiability solvers. The wide adoption of ASP has motivated several extensions to…

  7. The American Indians: Answers to 101 Questions.

    ERIC Educational Resources Information Center

    Bureau of Indian Affairs (Dept. of Interior), Washington, DC.

    Presented in a simple and straightforward manner, this publication answers questions basic to an understanding of the American Indian and his socioeconomic position in the United States. The following identify major areas covered and representative questions: (1) The Indian People (Who is an Indian?); (2) The Legal Status of Indians (Are Indians…

  8. Michigan PTA Presents the Parents' Answer Book.

    ERIC Educational Resources Information Center

    McCarthy, Alice R., Ed.; And Others

    This book was written to help parents build on their already existing skills and knowledge in the area of child rearing, become more competent parents, and mobilize their resources to strengthen family functioning. It consists of a series of questions posed by readers of the "Parent Talk Page" of the "Detroit Free Press" newspaper and answers to…

  9. 47 CFR 1.724 - Answers.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... admitting or denying such averment. General denials are prohibited. Denials based on information and belief... complainant or any other source. If the defendant is without knowledge or information sufficient to form a... made in accordance with paragraph (c) of this section. (f) The answer shall include an...

  10. 20 CFR 901.37 - Answer.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false Answer. 901.37 Section 901.37 Employees' Benefits JOINT BOARD FOR THE ENROLLMENT OF ACTUARIES REGULATIONS GOVERNING THE PERFORMANCE OF ACTUARIAL SERVICES UNDER THE EMPLOYEE RETIREMENT INCOME SECURITY ACT OF 1974 Suspension or Termination of...

  11. Conscience in Childhood: Old Questions, New Answers

    ERIC Educational Resources Information Center

    Aksan, Nazan; Kochanska, Grazyna

    2005-01-01

    Although conscience has been the focus of reflection for centuries, fundamental questions regarding its organization have not been fully answered. To address those questions, the authors applied structural equation modeling techniques to longitudinal data comprising multiple behavioral measures of children's conscience, obtained in parallel…

  12. 7 CFR 47.8 - The answer.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 2 2013-01-01 2013-01-01 false The answer. 47.8 Section 47.8 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... UNDER THE PERISHABLE AGRICULTURAL COMMODITIES ACT Rules Applicable to Reparation Proceedings § 47.8...

  13. 7 CFR 47.8 - The answer.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 2 2014-01-01 2014-01-01 false The answer. 47.8 Section 47.8 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... UNDER THE PERISHABLE AGRICULTURAL COMMODITIES ACT Rules Applicable to Reparation Proceedings § 47.8...

  14. 7 CFR 47.8 - The answer.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 2 2011-01-01 2011-01-01 false The answer. 47.8 Section 47.8 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... UNDER THE PERISHABLE AGRICULTURAL COMMODITIES ACT Rules Applicable to Reparation Proceedings § 47.8...

  15. 47 CFR 1.724 - Answers.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... admitting or denying such averment. General denials are prohibited. Denials based on information and belief... complainant or any other source. If the defendant is without knowledge or information sufficient to form a... made in accordance with paragraph (c) of this section. (f) The answer shall include an...

  16. 47 CFR 1.724 - Answers.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... admitting or denying such averment. General denials are prohibited. Denials based on information and belief... complainant or any other source. If the defendant is without knowledge or information sufficient to form a... made in accordance with paragraph (c) of this section. (f) The answer shall include an...

  17. 47 CFR 14.42 - Answers.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 1 2012-10-01 2012-10-01 false Answers. 14.42 Section 14.42 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL ACCESS TO ADVANCED COMMUNICATIONS SERVICES AND EQUIPMENT BY... search and the criteria used to identify such persons, documents, data compilations, tangible things,...

  18. Question and Answer Guide to OCLC.

    ERIC Educational Resources Information Center

    Yen, Sidney S. C.

    The purpose of this guide is to provide basic factual information about the Ohio College Library Center (OCLC), its data base, its operation, and its functions. It is intended for libraries which have not yet participated in OCLC, but would be useful as a reference guide in all libraries. Presented in question and answer form, the guide consists…

  19. 47 CFR 1.724 - Answers.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... Reports Involving Common Carriers Formal Complaints § 1.724 Answers. (a) Subject to paragraph (k) of this... service of the formal complaint by the complainant, unless otherwise directed by the Commission. (b) The... admitting or denying such averment. General denials are prohibited. Denials based on information and...

  20. Survey Questions Answered Only by Medication Experts.

    ERIC Educational Resources Information Center

    American Journal on Mental Retardation, 2000

    2000-01-01

    Fifty-eight tables provide a breakdown of answers to a survey responded to by 45 experts in the medication treatment of psychiatric and behavioral problems in people with mental retardation. Questions address treatment of specific disorders, ratings of various medications for specific disorders or symptoms, and preferences in mood stabilizers,…

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

  2. Private database queries based on counterfactual quantum key distribution

    NASA Astrophysics Data System (ADS)

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

    2013-08-01

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

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

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

  5. Analysis of DNS Cache Effects on Query Distribution

    PubMed Central

    2013-01-01

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

  6. Morphology-based Query for Galaxy Image Databases

    NASA Astrophysics Data System (ADS)

    Shamir, Lior

    2017-02-01

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

  7. An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.

    PubMed

    Jiang, Han; Li, Xue; Xu, Qiuliang

    2016-12-01

    The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.

  8. Performance of Point and Range Queries for In-memory Databases using Radix Trees on GPUs

    SciTech Connect

    Alam, Maksudul; Yoginath, Srikanth B; Perumalla, Kalyan S

    2016-01-01

    In in-memory database systems augmented by hardware accelerators, accelerating the index searching operations can greatly increase the runtime performance of database queries. Recently, adaptive radix trees (ART) have been shown to provide very fast index search implementation on the CPU. Here, we focus on an accelerator-based implementation of ART. We present a detailed performance study of our GPU-based adaptive radix tree (GRT) implementation over a variety of key distributions, synthetic benchmarks, and actual keys from music and book data sets. The performance is also compared with other index-searching schemes on the GPU. GRT on modern GPUs achieves some of the highest rates of index searches reported in the literature. For point queries, a throughput of up to 106 million and 130 million lookups per second is achieved for sparse and dense keys, respectively. For range queries, GRT yields 600 million and 1000 million lookups per second for sparse and dense keys, respectively, on a large dataset of 64 million 32-bit keys.

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

  10. An Upperbound to the Performance of Ranked-Output Searching: Optimal Weighting of Query Terms Using A Genetic Algorithm.

    ERIC Educational Resources Information Center

    Robertson, Alexander M.; Willett, Peter

    1996-01-01

    Describes a genetic algorithm (GA) that assigns weights to query terms in a ranked-output document retrieval system. Experiments showed the GA often found weights slightly superior to those produced by deterministic weighting (F4). Many times, however, the two methods gave the same results and sometimes the F4 results were superior, indicating…

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

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

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

    NASA Astrophysics Data System (ADS)

    Olejnik, Lukasz

    2011-08-01

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

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

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

    SciTech Connect

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

    1994-12-31

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

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

    ERIC Educational Resources Information Center

    Caltabiano, Leonard F.

    2010-01-01

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

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

    SciTech Connect

    Olejnik, Lukasz

    2011-08-15

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

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

    NASA Astrophysics Data System (ADS)

    Gerlach, Christof; Broughton, Howard; Zaliani, Andrea

    2008-02-01

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

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

    PubMed Central

    Nawrocki, Eric P; Eddy, Sean R

    2007-01-01

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

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