Science.gov

Sample records for private queries based

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

  2. Quantum private query based on single-photon interference

    NASA Astrophysics Data System (ADS)

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

    2016-08-01

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

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

    NASA Astrophysics Data System (ADS)

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

    2015-10-01

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

  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. Practical private database queries based on a quantum-key-distribution protocol

    SciTech Connect

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

    2011-02-15

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

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

  7. Comment on "flexible protocol for quantum private query based on B92 protocol"

    NASA Astrophysics Data System (ADS)

    Chang, Yan; Zhang, Shi-Bin; Zhu, Jing-Min

    2017-03-01

    In a recent paper (Quantum Inf Process 13:805-813, 2014), a flexible quantum private query (QPQ) protocol based on B92 protocol is presented. Here we point out that the B92-based QPQ protocol is insecure in database security when the channel has loss, that is, the user (Alice) will know more records in Bob's database compared with she has bought.

  8. Enhancing user privacy in SARG04-based private database query protocols

    NASA Astrophysics Data System (ADS)

    Yu, Fang; Qiu, Daowen; Situ, Haozhen; Wang, Xiaoming; Long, Shun

    2015-11-01

    The well-known SARG04 protocol can be used in a private query application to generate an oblivious key. By usage of the key, the user can retrieve one out of N items from a database without revealing which one he/she is interested in. However, the existing SARG04-based private query protocols are vulnerable to the attacks of faked data from the database since in its canonical form, the SARG04 protocol lacks means for one party to defend attacks from the other. While such attacks can cause significant loss of user privacy, a variant of the SARG04 protocol is proposed in this paper with new mechanisms designed to help the user protect its privacy in private query applications. In the protocol, it is the user who starts the session with the database, trying to learn from it bits of a raw key in an oblivious way. An honesty test is used to detect a cheating database who had transmitted faked data. The whole private query protocol has O( N) communication complexity for conveying at least N encrypted items. Compared with the existing SARG04-based protocols, it is efficient in communication for per-bit learning.

  9. Practical quantum private query of blocks based on unbalanced-state Bennett-Brassard-1984 quantum-key-distribution protocol

    PubMed Central

    Wei, Chun-Yan; Gao, Fei; Wen, Qiao-Yan; Wang, Tian-Yin

    2014-01-01

    Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message from database, the user Alice has to query l times to get each ai. In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each ai contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary. PMID:25518810

  10. Practical Quantum Private Database Queries Based on Passive Round-Robin Differential Phase-shift Quantum Key Distribution

    NASA Astrophysics Data System (ADS)

    Li, Jian; Yang, Yu-Guang; Chen, Xiu-Bo; Zhou, Yi-Hua; Shi, Wei-Min

    2016-08-01

    A novel quantum private database query protocol is proposed, based on passive round-robin differential phase-shift quantum key distribution. Compared with previous quantum private database query protocols, the present protocol has the following unique merits: (i) the user Alice can obtain one and only one key bit so that both the efficiency and security of the present protocol can be ensured, and (ii) it does not require to change the length difference of the two arms in a Mach-Zehnder interferometer and just chooses two pulses passively to interfere with so that it is much simpler and more practical. The present protocol is also proved to be secure in terms of the user security and database security.

  11. Practical Quantum Private Database Queries Based on Passive Round-Robin Differential Phase-shift Quantum Key Distribution.

    PubMed

    Li, Jian; Yang, Yu-Guang; Chen, Xiu-Bo; Zhou, Yi-Hua; Shi, Wei-Min

    2016-08-19

    A novel quantum private database query protocol is proposed, based on passive round-robin differential phase-shift quantum key distribution. Compared with previous quantum private database query protocols, the present protocol has the following unique merits: (i) the user Alice can obtain one and only one key bit so that both the efficiency and security of the present protocol can be ensured, and (ii) it does not require to change the length difference of the two arms in a Mach-Zehnder interferometer and just chooses two pulses passively to interfere with so that it is much simpler and more practical. The present protocol is also proved to be secure in terms of the user security and database security.

  12. Practical Quantum Private Database Queries Based on Passive Round-Robin Differential Phase-shift Quantum Key Distribution

    PubMed Central

    Li, Jian; Yang, Yu-Guang; Chen, Xiu-Bo; Zhou, Yi-Hua; Shi, Wei-Min

    2016-01-01

    A novel quantum private database query protocol is proposed, based on passive round-robin differential phase-shift quantum key distribution. Compared with previous quantum private database query protocols, the present protocol has the following unique merits: (i) the user Alice can obtain one and only one key bit so that both the efficiency and security of the present protocol can be ensured, and (ii) it does not require to change the length difference of the two arms in a Mach-Zehnder interferometer and just chooses two pulses passively to interfere with so that it is much simpler and more practical. The present protocol is also proved to be secure in terms of the user security and database security. PMID:27539654

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

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

    PubMed Central

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

    2014-01-01

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

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

    NASA Astrophysics Data System (ADS)

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

    2017-01-01

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

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

    PubMed Central

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

    2017-01-01

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

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

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

    SciTech Connect

    Olejnik, Lukasz

    2011-08-15

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

  19. Privacy-preserving point-inclusion protocol for an arbitrary area based on phase-encoded quantum private query

    NASA Astrophysics Data System (ADS)

    Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

    2017-01-01

    The point-inclusion problem is an important secure multi-party computation that it involves two parties, where one has a private point and the other has a private area, and they want to determine whether the point is inside the area without revealing their respective private information. All previously proposed point-inclusion protocols are only suitable for a specific area, such as circle, rectangle and convex polygon. In this paper, we present a novel privacy-preserving point-inclusion quantum protocol for an arbitrary area, which is surrounded by any plane geometric figure. Compared to the classical related protocols, our protocol has the advantages of the higher security and the lower communication complexity.

  20. Quantum private query with perfect user privacy against a joint-measurement attack

    NASA Astrophysics Data System (ADS)

    Yang, Yu-Guang; Liu, Zhi-Chao; Li, Jian; Chen, Xiu-Bo; Zuo, Hui-Juan; Zhou, Yi-Hua; Shi, Wei-Min

    2016-12-01

    The joint-measurement (JM) attack is the most powerful threat to the database security for existing quantum-key-distribution (QKD)-based quantum private query (QPQ) protocols. Wei et al. (2016) [28] proposed a novel QPQ protocol against the JM attack. However, their protocol relies on two-way quantum communication thereby affecting its real implementation and communication efficiency. Moreover, it cannot ensure perfect user privacy. In this paper, we present a new one-way QPQ protocol in which the special way of classical post-processing of oblivious key ensures the security against the JM attack. Furthermore, it realizes perfect user privacy and lower complexity of communication.

  1. Flexible Phrase Based Query Handling Algorithms.

    ERIC Educational Resources Information Center

    Wilbur, W. John; Kim, Won

    2001-01-01

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

  2. Performing private database queries in a real-world environment using a quantum protocol

    NASA Astrophysics Data System (ADS)

    Chan, Philip; Lucio-Martinez, Itzel; Mo, Xiaofan; Simon, Christoph; Tittel, Wolfgang

    2014-06-01

    In the well-studied cryptographic primitive 1-out-of-N oblivious transfer, a user retrieves a single element from a database of size N without the database learning which element was retrieved. While it has previously been shown that a secure implementation of 1-out-of-N oblivious transfer is impossible against arbitrarily powerful adversaries, recent research has revealed an interesting class of private query protocols based on quantum mechanics in a cheat sensitive model. Specifically, a practical protocol does not need to guarantee that the database provider cannot learn what element was retrieved if doing so carries the risk of detection. The latter is sufficient motivation to keep a database provider honest. However, none of the previously proposed protocols could cope with noisy channels. Here we present a fault-tolerant private query protocol, in which the novel error correction procedure is integral to the security of the protocol. Furthermore, we present a proof-of-concept demonstration of the protocol over a deployed fibre.

  3. Performing private database queries in a real-world environment using a quantum protocol

    PubMed Central

    Chan, Philip; Lucio-Martinez, Itzel; Mo, Xiaofan; Simon, Christoph; Tittel, Wolfgang

    2014-01-01

    In the well-studied cryptographic primitive 1-out-of-N oblivious transfer, a user retrieves a single element from a database of size N without the database learning which element was retrieved. While it has previously been shown that a secure implementation of 1-out-of-N oblivious transfer is impossible against arbitrarily powerful adversaries, recent research has revealed an interesting class of private query protocols based on quantum mechanics in a cheat sensitive model. Specifically, a practical protocol does not need to guarantee that the database provider cannot learn what element was retrieved if doing so carries the risk of detection. The latter is sufficient motivation to keep a database provider honest. However, none of the previously proposed protocols could cope with noisy channels. Here we present a fault-tolerant private query protocol, in which the novel error correction procedure is integral to the security of the protocol. Furthermore, we present a proof-of-concept demonstration of the protocol over a deployed fibre. PMID:24913129

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

    PubMed

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

    2016-11-04

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

  5. Practical quantum private query with better performance in resisting joint-measurement attack

    NASA Astrophysics Data System (ADS)

    Wei, Chun-Yan; Wang, Tian-Yin; Gao, Fei

    2016-04-01

    As a kind of practical protocol, quantum-key-distribution (QKD)-based quantum private queries (QPQs) have drawn lots of attention. However, joint-measurement (JM) attack poses a noticeable threat to the database security in such protocols. That is, by JM attack a malicious user can illegally elicit many more items from the database than the average amount an honest one can obtain. Taking Jacobi et al.'s protocol as an example, by JM attack a malicious user can obtain as many as 500 bits, instead of the expected 2.44 bits, from a 104-bit database in one query. It is a noticeable security flaw in theory, and would also arise in application with the development of quantum memories. To solve this problem, we propose a QPQ protocol based on a two-way QKD scheme, which behaves much better in resisting JM attack. Concretely, the user Alice cannot get more database items by conducting JM attack on the qubits because she has to send them back to Bob (the database holder) before knowing which of them should be jointly measured. Furthermore, JM attack by both Alice and Bob would be detected with certain probability, which is quite different from previous protocols. Moreover, our protocol retains the good characters of QKD-based QPQs, e.g., it is loss tolerant and robust against quantum memory attack.

  6. Comment on "Secure quantum private information retrieval using phase-encoded queries"

    NASA Astrophysics Data System (ADS)

    Shi, Run-hua; Mu, Yi; Zhong, Hong; Zhang, Shun

    2016-12-01

    In this Comment, we reexamine the security of phase-encoded quantum private query (QPQ). We find that the current phase-encoded QPQ protocols, including their applications, are vulnerable to a probabilistic entangle-and-measure attack performed by the owner of the database. Furthermore, we discuss how to overcome this security loophole and present an improved cheat-sensitive QPQ protocol without losing the good features of the original protocol.

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

  8. Controllable quantum private queries using an entangled Fibonacci-sequence spiral source

    NASA Astrophysics Data System (ADS)

    Lai, Hong; Orgun, Mehmet A.; Pieprzyk, Josef; Xiao, Jinghua; Xue, Liyin; Jia, Zhongtian

    2015-10-01

    By changing the initial values in entangled Fibonacci-sequence spiral sources in Simon et al.'s (2013) experimental setup [13], we propose a controllable quantum private query protocol. Moreover, our protocol achieves flexible key expansion and even exhibits secure advantages during communications because of the following observations. We observe the close relationships between Lucas numbers and the first kind of Chebyshev maps, and the Chebyshev maps and k-Chebyshev maps; by adjusting the parameter m in k-Chebyshev maps, Alice and Bob can obtain their expected values of the key blocks and database respectively.

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

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

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

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

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

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

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

  17. Image query based on color harmony

    NASA Astrophysics Data System (ADS)

    Vasile, Alexandru; Bender, Walter R.

    2001-06-01

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

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

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

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

  1. Ontology and rules based model for traffic query

    NASA Astrophysics Data System (ADS)

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

    2008-10-01

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

  2. Federated ontology-based queries over cancer data

    PubMed Central

    2012-01-01

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

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

  4. SQL level global query resolving for web based GIS

    NASA Astrophysics Data System (ADS)

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

    2007-06-01

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

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

  6. The JAVA-based DICOM query interface DicoSE.

    PubMed

    Prinz, Michael; Fischer, Georg; Schuster, Ernst

    2005-03-01

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

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

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

    PubMed

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

    2016-03-29

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

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

    PubMed Central

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

    2016-01-01

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

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

    NASA Astrophysics Data System (ADS)

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

    2015-03-01

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

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

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

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

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

    PubMed

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

    2007-01-01

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

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

    PubMed

    Khennak, Ilyes; Drias, Habiba

    2017-02-01

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

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

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

    PubMed Central

    2013-01-01

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

  18. Symmetrically private information retrieval based on blind quantum computing

    NASA Astrophysics Data System (ADS)

    Sun, Zhiwei; Yu, Jianping; Wang, Ping; Xu, Lingling

    2015-05-01

    Universal blind quantum computation (UBQC) is a new secure quantum computing protocol which allows a user Alice who does not have any sophisticated quantum technology to delegate her computing to a server Bob without leaking any privacy. Using the features of UBQC, we propose a protocol to achieve symmetrically private information retrieval, which allows a quantum limited Alice to query an item from Bob with a fully fledged quantum computer; meanwhile, the privacy of both parties is preserved. The security of our protocol is based on the assumption that malicious Alice has no quantum computer, which avoids the impossibility proof of Lo. For the honest Alice, she is almost classical and only requires minimal quantum resources to carry out the proposed protocol. Therefore, she does not need any expensive laboratory which can maintain the coherence of complicated quantum experimental setups.

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

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

  1. DBPQL: A view-oriented query language for the Intel Data Base Processor

    NASA Technical Reports Server (NTRS)

    Fishwick, P. A.

    1983-01-01

    An interactive query language (BDPQL) for the Intel Data Base Processor (DBP) is defined. DBPQL includes a parser generator package which permits the analyst to easily create and manipulate the query statement syntax and semantics. The prototype language, DBPQL, includes trace and performance commands to aid the analyst when implementing new commands and analyzing the execution characteristics of the DBP. The DBPQL grammar file and associated key procedures are included as an appendix to this report.

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

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

  4. Infodemiology of status epilepticus: A systematic validation of the Google Trends-based search queries.

    PubMed

    Bragazzi, Nicola Luigi; Bacigaluppi, Susanna; Robba, Chiara; Nardone, Raffaele; Trinka, Eugen; Brigo, Francesco

    2016-02-01

    People increasingly use Google looking for health-related information. We previously demonstrated that in English-speaking countries most people use this search engine to obtain information on status epilepticus (SE) definition, types/subtypes, and treatment. Now, we aimed at providing a quantitative analysis of SE-related web queries. This analysis represents an advancement, with respect to what was already previously discussed, in that the Google Trends (GT) algorithm has been further refined and correlational analyses have been carried out to validate the GT-based query volumes. Google Trends-based SE-related query volumes were well correlated with information concerning causes and pharmacological and nonpharmacological treatments. Google Trends can provide both researchers and clinicians with data on realities and contexts that are generally overlooked and underexplored by classic epidemiology. In this way, GT can foster new epidemiological studies in the field and can complement traditional epidemiological tools.

  5. Improving Concept-Based Web Image Retrieval by Mixing Semantically Similar Greek Queries

    ERIC Educational Resources Information Center

    Lazarinis, Fotis

    2008-01-01

    Purpose: Image searching is a common activity for web users. Search engines offer image retrieval services based on textual queries. Previous studies have shown that web searching is more demanding when the search is not in English and does not use a Latin-based language. The aim of this paper is to explore the behaviour of the major search…

  6. Privacy-Preserving Location-Based Query Using Location Indexes and Parallel Searching in Distributed Networks

    PubMed Central

    Liu, Lei; Zhao, Jing

    2014-01-01

    An efficient location-based query algorithm of protecting the privacy of the user in the distributed networks is given. This algorithm utilizes the location indexes of the users and multiple parallel threads to search and select quickly all the candidate anonymous sets with more users and their location information with more uniform distribution to accelerate the execution of the temporal-spatial anonymous operations, and it allows the users to configure their custom-made privacy-preserving location query requests. The simulated experiment results show that the proposed algorithm can offer simultaneously the location query services for more users and improve the performance of the anonymous server and satisfy the anonymous location requests of the users. PMID:24790579

  7. Privacy-preserving location-based query using location indexes and parallel searching in distributed networks.

    PubMed

    Zhong, Cheng; Liu, Lei; Zhao, Jing

    2014-01-01

    An efficient location-based query algorithm of protecting the privacy of the user in the distributed networks is given. This algorithm utilizes the location indexes of the users and multiple parallel threads to search and select quickly all the candidate anonymous sets with more users and their location information with more uniform distribution to accelerate the execution of the temporal-spatial anonymous operations, and it allows the users to configure their custom-made privacy-preserving location query requests. The simulated experiment results show that the proposed algorithm can offer simultaneously the location query services for more users and improve the performance of the anonymous server and satisfy the anonymous location requests of the users.

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

  9. Marketing Undergraduates' Attitudes towards Query-based Instructional Machines as a Possible Learning Medium.

    ERIC Educational Resources Information Center

    Bennett, Roger; Kottasz, Rita

    2001-01-01

    Discusses Query-Based Instructional Machines (QBIM), common in museums, which are menu-driven and use touch-screens. Presents results of an investigation of student responses in a London university to the idea of incorporating QBIM instruction, exploring the influences of personal traits that might affect their attitudes as well as the impact of…

  10. Random and directed walk-based top-(k) queries in wireless sensor networks.

    PubMed

    Fu, Jun-Song; Liu, Yun

    2015-05-26

    In wireless sensor networks, filter-based top-  query approaches are the state-of-the-art solutions and have been extensively researched in the literature, however, they are very sensitive to the network parameters, including the size of the network, dynamics of the sensors' readings and declines in the overall range of all the readings. In this work, a random walk-based top-  query approach called RWTQ and a directed walk-based top-  query approach called DWTQ are proposed. At the beginning of a top-  query, one or several tokens are sent to the specific node(s) in the network by the base station. Then, each token walks in the network independently to record and process the readings in a random or directed way. A strategy of choosing the "right" way in DWTQ is carefully designed for the token(s) to arrive at the high-value regions as soon as possible. When designing the walking strategy for DWTQ, the spatial correlations of the readings are also considered. Theoretical analysis and simulation results indicate that RWTQ and DWTQ both are very robust against these parameters discussed previously. In addition, DWTQ outperforms TAG, FILA and EXTOK in transmission cost, energy consumption and network lifetime.

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

  12. Automatic Concept-Based Query Expansion Using Term Relational Pathways Built from a Collection-Specific Association Thesaurus

    ERIC Educational Resources Information Center

    Lyall-Wilson, Jennifer Rae

    2013-01-01

    The dissertation research explores an approach to automatic concept-based query expansion to improve search engine performance. It uses a network-based approach for identifying the concept represented by the user's query and is founded on the idea that a collection-specific association thesaurus can be used to create a reasonable representation of…

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

  14. Age-Related Differences in the Accuracy of Web Query-Based Predictions of Influenza-Like Illness

    PubMed Central

    Domnich, Alexander; Panatto, Donatella; Signori, Alessio; Lai, Piero Luigi; Gasparini, Roberto; Amicizia, Daniela

    2015-01-01

    Background Web queries are now widely used for modeling, nowcasting and forecasting influenza-like illness (ILI). However, given that ILI attack rates vary significantly across ages, in terms of both magnitude and timing, little is known about whether the association between ILI morbidity and ILI-related queries is comparable across different age-groups. The present study aimed to investigate features of the association between ILI morbidity and ILI-related query volume from the perspective of age. Methods Since Google Flu Trends is unavailable in Italy, Google Trends was used to identify entry terms that correlated highly with official ILI surveillance data. All-age and age-class-specific modeling was performed by means of linear models with generalized least-square estimation. Hold-out validation was used to quantify prediction accuracy. For purposes of comparison, predictions generated by exponential smoothing were computed. Results Five search terms showed high correlation coefficients of > .6. In comparison with exponential smoothing, the all-age query-based model correctly predicted the peak time and yielded a higher correlation coefficient with observed ILI morbidity (.978 vs. .929). However, query-based prediction of ILI morbidity was associated with a greater error. Age-class-specific query-based models varied significantly in terms of prediction accuracy. In the 0–4 and 25–44-year age-groups, these did well and outperformed exponential smoothing predictions; in the 15–24 and ≥ 65-year age-classes, however, the query-based models were inaccurate and highly overestimated peak height. In all but one age-class, peak timing predicted by the query-based models coincided with observed timing. Conclusions The accuracy of web query-based models in predicting ILI morbidity rates could differ among ages. Greater age-specific detail may be useful in flu query-based studies in order to account for age-specific features of the epidemiology of ILI. PMID:26011418

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

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

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

  18. Adaptation to Pronunciation Variations in Indonesian Spoken Query-Based Information Retrieval

    NASA Astrophysics Data System (ADS)

    Lestari, Dessi Puji; Furui, Sadaoki

    Recognition errors of proper nouns and foreign words significantly decrease the performance of ASR-based speech applications such as voice dialing systems, speech summarization, spoken document retrieval, and spoken query-based information retrieval (IR). The reason is that proper nouns and words that come from other languages are usually the most important key words. The loss of such words due to misrecognition in turn leads to a loss of significant information from the speech source. This paper focuses on how to improve the performance of Indonesian ASR by alleviating the problem of pronunciation variation of proper nouns and foreign words (English words in particular). To improve the proper noun recognition accuracy, proper-noun specific acoustic models are created by supervised adaptation using maximum likelihood linear regression (MLLR). To improve English word recognition, the pronunciation of English words contained in the lexicon is fixed by using rule-based English-to-Indonesian phoneme mapping. The effectiveness of the proposed method was confirmed through spoken query based Indonesian IR. We used Inference Network-based (IN-based) IR and compared its results with those of the classical Vector Space Model (VSM) IR, both using a tf-idf weighting schema. Experimental results show that IN-based IR outperforms VSM IR.

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

    ERIC Educational Resources Information Center

    Nicholes, Walter

    1988-01-01

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

  20. Research on heterogeneous data query and sharing mode based on XML

    NASA Astrophysics Data System (ADS)

    Sang, Yaqun; Mu, Qi

    2013-07-01

    At present, XML language has been regarded as a standard of data exchange due to such attributes as being unrelevant to platform, auto-description of itself, easy extention, separation of content and form, and so on. Therefore, in the course of study of share of heterogeneous-data in coal enterprises, we design a heterogeneous-data query system based on XML to provide a unified data integration platform and share of information resource with high quality and speed, which will solve a problem with information islands produced in coal enterprises.

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

  2. SAM: String-based sequence search algorithm for mitochondrial DNA database queries

    PubMed Central

    Röck, Alexander; Irwin, Jodi; Dür, Arne; Parsons, Thomas; Parson, Walther

    2011-01-01

    The analysis of the haploid mitochondrial (mt) genome has numerous applications in forensic and population genetics, as well as in disease studies. Although mtDNA haplotypes are usually determined by sequencing, they are rarely reported as a nucleotide string. Traditionally they are presented in a difference-coded position-based format relative to the corrected version of the first sequenced mtDNA. This convention requires recommendations for standardized sequence alignment that is known to vary between scientific disciplines, even between laboratories. As a consequence, database searches that are vital for the interpretation of mtDNA data can suffer from biased results when query and database haplotypes are annotated differently. In the forensic context that would usually lead to underestimation of the absolute and relative frequencies. To address this issue we introduce SAM, a string-based search algorithm that converts query and database sequences to position-free nucleotide strings and thus eliminates the possibility that identical sequences will be missed in a database query. The mere application of a BLAST algorithm would not be a sufficient remedy as it uses a heuristic approach and does not address properties specific to mtDNA, such as phylogenetically stable but also rapidly evolving insertion and deletion events. The software presented here provides additional flexibility to incorporate phylogenetic data, site-specific mutation rates, and other biologically relevant information that would refine the interpretation of mitochondrial DNA data. The manuscript is accompanied by freeware and example data sets that can be used to evaluate the new software (http://stringvalidation.org). PMID:21056022

  3. From Ambiguities to Insights: Query-based Comparisons of High-Dimensional Data

    NASA Astrophysics Data System (ADS)

    Kowalski, Jeanne; Talbot, Conover; Tsai, Hua L.; Prasad, Nijaguna; Umbricht, Christopher; Zeiger, Martha A.

    2007-11-01

    Genomic technologies will revolutionize drag discovery and development; that much is universally agreed upon. The high dimension of data from such technologies has challenged available data analytic methods; that much is apparent. To date, large-scale data repositories have not been utilized in ways that permit their wealth of information to be efficiently processed for knowledge, presumably due in large part to inadequate analytical tools to address numerous comparisons of high-dimensional data. In candidate gene discovery, expression comparisons are often made between two features (e.g., cancerous versus normal), such that the enumeration of outcomes is manageable. With multiple features, the setting becomes more complex, in terms of comparing expression levels of tens of thousands transcripts across hundreds of features. In this case, the number of outcomes, while enumerable, become rapidly large and unmanageable, and scientific inquiries become more abstract, such as "which one of these (compounds, stimuli, etc.) is not like the others?" We develop analytical tools that promote more extensive, efficient, and rigorous utilization of the public data resources generated by the massive support of genomic studies. Our work innovates by enabling access to such metadata with logically formulated scientific inquires that define, compare and integrate query-comparison pair relations for analysis. We demonstrate our computational tool's potential to address an outstanding biomedical informatics issue of identifying reliable molecular markers in thyroid cancer. Our proposed query-based comparison (QBC) facilitates access to and efficient utilization of metadata through logically formed inquires expressed as query-based comparisons by organizing and comparing results from biotechnologies to address applications in biomedicine.

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

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

    PubMed

    Raposo, Ana; Frade, Sofia; Alves, Mara

    2016-08-01

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

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

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

    NASA Astrophysics Data System (ADS)

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

    2013-04-01

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

  8. Value-of-Information based Middleware for Autonomic Querying of Distributed Sensor Databases

    SciTech Connect

    Sukumar, Sreenivas R.; Shankar, Mallikarjun

    2010-01-01

    With particular focus on distributed situational awareness in defense and security applications, we propose a value-of-information based middleware framework as a paradigm shift from crawl-index based centralized search. The proposed approach seeks to improve efficiency in search and retrieval by transforming sensors into programmable information points and enabling ubiquitous data and software flows through the infrastructure of the distributed network. We explain the different components of such a middleware framework to organize, tag and notify emerging spatial, temporal and causal patterns from the sensor measurements. We conclude the paper with a brief discussion on the top-down programming model that can realize the framework as a reconfigurable sensor query system.

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

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

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

  12. Similarity extraction mechanism concerning historical personalities based on SQL queries in an RDBMS environment

    NASA Astrophysics Data System (ADS)

    Barouchou, Alexandra; Dendrinos, Markos

    2015-02-01

    An interesting issue in the domain of history of science and ideas is the concept of similarity of historical personalities. Similar objects of research of philosophers and scientists indicate prospective influences, caused either from one another's reading or meetings, communication or even cooperation. Key methodological role in the surfacing of the sought similarities play the keywords extracted from their works as well as their placement in a philosophical and scientific term taxonomy. The case study examined in the framework of this paper concerns scientists and philosophers, who lived in ancient Greece or Renaissance periods and dealt, in at least one work, with the subject God. All the available data (scientists, studies, recorded relations between scientists, keywords, and thematic hierarchy) have been organized in an RDBMS environment, aiming at the emergence of similarities and influences between scientists through properly created SQL queries based on date and thematic hierarchy criteria.

  13. BredeQuery: Coordinate-Based Meta-analytic Search of Neuroscientific Literature from the SPM Environment

    NASA Astrophysics Data System (ADS)

    Wilkowski, Bartłomiej; Szewczyk, Marcin; Rasmussen, Peter Mondrup; Hansen, Lars Kai; Nielsen, Finn Årup

    Large amounts of neuroimaging studies are collected and have chan-ged our view on human brain function. By integrating multiple studies in meta-analysis a more complete picture is emerging. Brain locations are usually reported as coordinates with reference to a specific brain atlas, thus some of the databases offer so-called coordinate-based searching to the users (e.g. Brede, BrainMap). For such search, the publications, which relate to the brain locations represented by the user coordinates, are retrieved. We present BredeQuery - a plugin for the widely used SPM data analytic pipeline. BredeQuery offers a direct link from SPM to the Brede Database coordinate-based search engine. BredeQuery is able to 'grab' brain location coordinates from the SPM windows and enter them as a query for the Brede Database. Moreover, results of the query can be displayed in a MATLAB window and/or exported directly to some popular bibliographic file formats (BibTeX, Reference Manager, etc).

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

    DTIC Science & Technology

    2014-11-01

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

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

  16. Quantum Private Comparison Based on Quantum Search Algorithm

    NASA Astrophysics Data System (ADS)

    Zhang, Wei-Wei; Li, Dan; Song, Ting-Ting; Li, Yan-Bing

    2013-05-01

    We propose two quantum private comparison protocols based on quantum search algorithm with the help of a semi-honest third party. Our protocols utilize the properties of quantum search algorithm, the unitary operations, and the single-particle measurements. The security of our protocols is discussed with respect to both the outsider attack and the participant attack. There is no information leaked about the private information and the comparison result, even the third party cannot know these information.

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

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

    PubMed Central

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

    2013-01-01

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

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

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

  1. LandEx - Fast, FOSS-Based Application for Query and Retrieval of Land Cover Patterns

    NASA Astrophysics Data System (ADS)

    Netzel, P.; Stepinski, T.

    2012-12-01

    The amount of satellite-based spatial data is continuously increasing making a development of efficient data search tools a priority. The bulk of existing research on searching satellite-gathered data concentrates on images and is based on the concept of Content-Based Image Retrieval (CBIR); however, available solutions are not efficient and robust enough to be put to use as deployable web-based search tools. Here we report on development of a practical, deployable tool that searches classified, rather than raw image. LandEx (Landscape Explorer) is a GeoWeb-based tool for Content-Based Pattern Retrieval (CBPR) contained within the National Land Cover Dataset 2006 (NLCD2006). The USGS-developed NLCD2006 is derived from Landsat multispectral images; it covers the entire conterminous U.S. with the resolution of 30 meters/pixel and it depicts 16 land cover classes. The size of NLCD2006 is about 10 Gpixels (161,000 x 100,000 pixels). LandEx is a multi-tier GeoWeb application based on Open Source Software. Main components are: GeoExt/OpenLayers (user interface), GeoServer (OGC WMS, WCS and WPS server), and GRASS (calculation engine). LandEx performs search using query-by-example approach: user selects a reference scene (exhibiting a chosen pattern of land cover classes) and the tool produces, in real time, a map indicating a degree of similarity between the reference pattern and all local patterns across the U.S. Scene pattern is encapsulated by a 2D histogram of classes and sizes of single-class clumps. Pattern similarity is based on the notion of mutual information. The resultant similarity map can be viewed and navigated in a web browser, or it can download as a GeoTiff file for more in-depth analysis. The LandEx is available at http://sil.uc.edu

  2. Semantic Normalization and Query Abstraction Based on SNOMED-CT and HL7: Supporting Multicentric Clinical Trials.

    PubMed

    Paraiso-Medina, Sergio; Perez-Rey, David; Bucur, Anca; Claerhout, Brecht; Alonso-Calvo, Raul

    2015-05-01

    Advances in the use of omic data and other biomarkers are increasing the number of variables in clinical research. Additional data have stratified the population of patients and require that current studies be performed among multiple institutions. Semantic interoperability and standardized data representation are a crucial task in the management of modern clinical trials. In the past few years, different efforts have focused on integrating biomedical information. Due to the complexity of this domain and the specific requirements of clinical research, the majority of data integration tasks are still performed manually. This paper presents a semantic normalization process and a query abstraction mechanism to facilitate data integration and retrieval. A process based on well-established standards from the biomedical domain and the latest semantic web technologies has been developed. Methods proposed in this paper have been tested within the EURECA EU research project, where clinical scenarios require the extraction of semantic knowledge from biomedical vocabularies. The aim of this paper is to provide a novel method to abstract from the data model and query syntax. The proposed approach has been compared with other initiatives in the field by storing the same dataset with each of those solutions. Results show an extended functionality and query capabilities at the cost of slightly worse performance in query execution. Implementations in real settings have shown that following this approach, usable interfaces can be developed to exploit clinical trial data outcomes.

  3. Evaluation of Internet-based dengue query data: Google Dengue Trends.

    PubMed

    Gluskin, Rebecca Tave; Johansson, Michael A; Santillana, Mauricio; Brownstein, John S

    2014-02-01

    Dengue is a common and growing problem worldwide, with an estimated 70-140 million cases per year. Traditional, healthcare-based, government-implemented dengue surveillance is resource intensive and slow. As global Internet use has increased, novel, Internet-based disease monitoring tools have emerged. Google Dengue Trends (GDT) uses near real-time search query data to create an index of dengue incidence that is a linear proxy for traditional surveillance. Studies have shown that GDT correlates highly with dengue incidence in multiple countries on a large spatial scale. This study addresses the heterogeneity of GDT at smaller spatial scales, assessing its accuracy at the state-level in Mexico and identifying factors that are associated with its accuracy. We used Pearson correlation to estimate the association between GDT and traditional dengue surveillance data for Mexico at the national level and for 17 Mexican states. Nationally, GDT captured approximately 83% of the variability in reported cases over the 9 study years. The correlation between GDT and reported cases varied from state to state, capturing anywhere from 1% of the variability in Baja California to 88% in Chiapas, with higher accuracy in states with higher dengue average annual incidence. A model including annual average maximum temperature, precipitation, and their interaction accounted for 81% of the variability in GDT accuracy between states. This climate model was the best indicator of GDT accuracy, suggesting that GDT works best in areas with intense transmission, particularly where local climate is well suited for transmission. Internet accessibility (average ∼ 36%) did not appear to affect GDT accuracy. While GDT seems to be a less robust indicator of local transmission in areas of low incidence and unfavorable climate, it may indicate cases among travelers in those areas. Identifying the strengths and limitations of novel surveillance is critical for these types of data to be used to make

  4. Evaluation of Internet-Based Dengue Query Data: Google Dengue Trends

    PubMed Central

    Gluskin, Rebecca Tave; Johansson, Michael A.; Santillana, Mauricio; Brownstein, John S.

    2014-01-01

    Dengue is a common and growing problem worldwide, with an estimated 70–140 million cases per year. Traditional, healthcare-based, government-implemented dengue surveillance is resource intensive and slow. As global Internet use has increased, novel, Internet-based disease monitoring tools have emerged. Google Dengue Trends (GDT) uses near real-time search query data to create an index of dengue incidence that is a linear proxy for traditional surveillance. Studies have shown that GDT correlates highly with dengue incidence in multiple countries on a large spatial scale. This study addresses the heterogeneity of GDT at smaller spatial scales, assessing its accuracy at the state-level in Mexico and identifying factors that are associated with its accuracy. We used Pearson correlation to estimate the association between GDT and traditional dengue surveillance data for Mexico at the national level and for 17 Mexican states. Nationally, GDT captured approximately 83% of the variability in reported cases over the 9 study years. The correlation between GDT and reported cases varied from state to state, capturing anywhere from 1% of the variability in Baja California to 88% in Chiapas, with higher accuracy in states with higher dengue average annual incidence. A model including annual average maximum temperature, precipitation, and their interaction accounted for 81% of the variability in GDT accuracy between states. This climate model was the best indicator of GDT accuracy, suggesting that GDT works best in areas with intense transmission, particularly where local climate is well suited for transmission. Internet accessibility (average ∼36%) did not appear to affect GDT accuracy. While GDT seems to be a less robust indicator of local transmission in areas of low incidence and unfavorable climate, it may indicate cases among travelers in those areas. Identifying the strengths and limitations of novel surveillance is critical for these types of data to be used to make

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

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

  7. A real-time proximity querying algorithm for haptic-based molecular docking.

    PubMed

    Iakovou, Georgios; Hayward, Steven; Laycock, Stephen

    2014-01-01

    Intermolecular binding underlies every metabolic and regulatory processes of the cell, and the therapeutic and pharmacological properties of drugs. Molecular docking systems model and simulate these interactions in silico and allow us to study the binding process. Haptic-based docking provides an immersive virtual docking environment where the user can interact with and guide the molecules to their binding pose. Moreover, it allows human perception, intuition and knowledge to assist and accelerate the docking process, and reduces incorrect binding poses. Crucial for interactive docking is the real-time calculation of interaction forces. For smooth and accurate haptic exploration and manipulation, force-feedback cues have to be updated at a rate of 1 kHz. Hence, force calculations must be performed within 1 ms. To achieve this, modern haptic-based docking approaches often utilize pre-computed force grids and linear interpolation. However, such grids are time-consuming to pre-compute (especially for large molecules), memory hungry, can induce rough force transitions at cell boundaries and cannot be applied to flexible docking. Here we propose an efficient proximity querying method for computing intermolecular forces in real time. Our motivation is the eventual development of a haptic-based docking solution that can model molecular flexibility. Uniquely in a haptics application we use octrees to decompose the 3D search space in order to identify the set of interacting atoms within a cut-off distance. Force calculations are then performed on this set in real time. The implementation constructs the trees dynamically, and computes the interaction forces of large molecular structures (i.e. consisting of thousands of atoms) within haptic refresh rates. We have implemented this method in an immersive, haptic-based, rigid-body, molecular docking application called Haptimol_RD. The user can use the haptic device to orientate the molecules in space, sense the interaction

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

  9. Name-Based Address Mapping for Virtual Private Networks

    NASA Astrophysics Data System (ADS)

    Surányi, Péter; Shinjo, Yasushi; Kato, Kazuhiko

    IPv4 private addresses are commonly used in local area networks (LANs). With the increasing popularity of virtual private networks (VPNs), it has become common that a user connects to multiple LANs at the same time. However, private address ranges for LANs frequently overlap. In such cases, existing systems do not allow the user to access the resources on all LANs at the same time. In this paper, we propose name-based address mapping for VPNs, a novel method that allows connecting to hosts through multiple VPNs at the same time, even when the address ranges of the VPNs overlap. In name-based address mapping, rather than using the IP addresses used on the LANs (the real addresses), we assign a unique virtual address to each remote host based on its domain name. The local host uses the virtual addresses to communicate with remote hosts. We have implemented name-based address mapping for layer 3 OpenVPN connections on Linux and measured its performance. The communication overhead of our system is less than 1.5% for throughput and less than 0.2ms for each name resolution.

  10. Efficient Quantum Private Communication Based on Dynamic Control Code Sequence

    NASA Astrophysics Data System (ADS)

    Cao, Zheng-Wen; Feng, Xiao-Yi; Peng, Jin-Ye; Zeng, Gui-Hua; Qi, Jin

    2017-04-01

    Based on chaos and quantum properties, we propose a quantum private communication scheme with dynamic control code sequence. The initial sequence is obtained via chaotic systems, and the control code sequence is derived by grouping, XOR and extracting. A shift cycle algorithm is designed to enable the dynamic change of control code sequence. Analysis shows that transmission efficiency could reach 100 % with high dynamics and security.

  11. Efficient Quantum Private Communication Based on Dynamic Control Code Sequence

    NASA Astrophysics Data System (ADS)

    Cao, Zheng-Wen; Feng, Xiao-Yi; Peng, Jin-Ye; Zeng, Gui-Hua; Qi, Jin

    2016-12-01

    Based on chaos and quantum properties, we propose a quantum private communication scheme with dynamic control code sequence. The initial sequence is obtained via chaotic systems, and the control code sequence is derived by grouping, XOR and extracting. A shift cycle algorithm is designed to enable the dynamic change of control code sequence. Analysis shows that transmission efficiency could reach 100 % with high dynamics and security.

  12. Shark: SQL and Analytics with Cost-Based Query Optimization on Coarse-Grained Distributed Memory

    DTIC Science & Technology

    2014-01-13

    efficient parallel processing of massive data sets. VLDB, 2008. [17] B . Chattopadhyay , , et al. Tenzing a sql implementation on the mapreduce framework...17 19a. NAME OF RESPONSIBLE PERSON a . REPORT unclassified b . ABSTRACT unclassified c. THIS PAGE unclassified Standard Form 298 (Rev. 8-98...the query above is: val visits = spark.hadoopFile("hdfs://...") val counts = visits.map(v => (v.url, 1)) .reduceByKey(( a , b ) => a + b ) RDDs can contain

  13. An informatics supported web-based data annotation and query tool to expedite translational research for head and neck malignancies

    PubMed Central

    2009-01-01

    Background The Specialized Program of Research Excellence (SPORE) in Head and Neck Cancer neoplasm virtual biorepository is a bioinformatics-supported system to incorporate data from various clinical, pathological, and molecular systems into a single architecture based on a set of common data elements (CDEs) that provides semantic and syntactic interoperability of data sets. Results The various components of this annotation tool include the Development of Common Data Elements (CDEs) that are derived from College of American Pathologists (CAP) Checklist and North American Association of Central Cancer Registries (NAACR) standards. The Data Entry Tool is a portable and flexible Oracle-based data entry device, which is an easily mastered web-based tool. The Data Query Tool helps investigators and researchers to search de-identified information within the warehouse/resource through a "point and click" interface, thus enabling only the selected data elements to be essentially copied into a data mart using a multi dimensional model from the warehouse's relational structure. The SPORE Head and Neck Neoplasm Database contains multimodal datasets that are accessible to investigators via an easy to use query tool. The database currently holds 6553 cases and 10607 tumor accessions. Among these, there are 965 metastatic, 4227 primary, 1369 recurrent, and 483 new primary cases. The data disclosure is strictly regulated by user's authorization. Conclusion The SPORE Head and Neck Neoplasm Virtual Biorepository is a robust translational biomedical informatics tool that can facilitate basic science, clinical, and translational research. The Data Query Tool acts as a central source providing a mechanism for researchers to efficiently find clinically annotated datasets and biospecimens that are relevant to their research areas. The tool protects patient privacy by revealing only de-identified data in accordance with regulations and approvals of the IRB and scientific review committee

  14. Image-based query-by-example for big databases of galaxy images

    NASA Astrophysics Data System (ADS)

    Shamir, Lior; Kuminski, Evan

    2017-01-01

    Very large astronomical databases containing millions or even billions of galaxy images have been becoming increasingly important tools in astronomy research. However, in many cases the very large size makes it more difficult to analyze these data manually, reinforcing the need for computer algorithms that can automate the data analysis process. An example of such task is the identification of galaxies of a certain morphology of interest. For instance, if a rare galaxy is identified it is reasonable to expect that more galaxies of similar morphology exist in the database, but it is virtually impossible to manually search these databases to identify such galaxies. Here we describe computer vision and pattern recognition methodology that receives a galaxy image as an input, and searches automatically a large dataset of galaxies to return a list of galaxies that are visually similar to the query galaxy. The returned list is not necessarily complete or clean, but it provides a substantial reduction of the original database into a smaller dataset, in which the frequency of objects visually similar to the query galaxy is much higher. Experimental results show that the algorithm can identify rare galaxies such as ring galaxies among datasets of 10,000 astronomical objects.

  15. Facilitating Learners' Web-Based Information Problem-Solving by Query Expansion-Based Concept Mapping

    ERIC Educational Resources Information Center

    Huang, Yueh-Min; Liu, Ming-Chi; Chen, Nian-Shing; Kinshuk; Wen, Dunwei

    2014-01-01

    Web-based information problem-solving has been recognised as a critical ability for learners. However, the development of students' abilities in this area often faces several challenges, such as difficulty in building well-organised knowledge structures to support complex problems that require higher-order skills (e.g., system thinking). To…

  16. Web-based Visualization and Query of semantically segmented multiresolution 3D Models in the Field of Cultural Heritage

    NASA Astrophysics Data System (ADS)

    Auer, M.; Agugiaro, G.; Billen, N.; Loos, L.; Zipf, A.

    2014-05-01

    Many important Cultural Heritage sites have been studied over long periods of time by different means of technical equipment, methods and intentions by different researchers. This has led to huge amounts of heterogeneous "traditional" datasets and formats. The rising popularity of 3D models in the field of Cultural Heritage in recent years has brought additional data formats and makes it even more necessary to find solutions to manage, publish and study these data in an integrated way. The MayaArch3D project aims to realize such an integrative approach by establishing a web-based research platform bringing spatial and non-spatial databases together and providing visualization and analysis tools. Especially the 3D components of the platform use hierarchical segmentation concepts to structure the data and to perform queries on semantic entities. This paper presents a database schema to organize not only segmented models but also different Levels-of-Details and other representations of the same entity. It is further implemented in a spatial database which allows the storing of georeferenced 3D data. This enables organization and queries by semantic, geometric and spatial properties. As service for the delivery of the segmented models a standardization candidate of the OpenGeospatialConsortium (OGC), the Web3DService (W3DS) has been extended to cope with the new database schema and deliver a web friendly format for WebGL rendering. Finally a generic user interface is presented which uses the segments as navigation metaphor to browse and query the semantic segmentation levels and retrieve information from an external database of the German Archaeological Institute (DAI).

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

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

    PubMed Central

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

    2016-01-01

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

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

  20. The Research on Automatic Construction of Domain Model Based on Deep Web Query Interfaces

    NASA Astrophysics Data System (ADS)

    JianPing, Gu

    The integration of services is transparent, meaning that users no longer face the millions of Web services, do not care about the required data stored, but do not need to learn how to obtain these data. In this paper, we analyze the uncertainty of schema matching, and then propose a series of similarity measures. To reduce the cost of execution, we propose the type-based optimization method and schema matching pruning method of numeric data. Based on above analysis, we propose the uncertain schema matching method. The experiments prove the effectiveness and efficiency of our method.

  1. A magnetostatic-coupling based remote query sensor for environmental monitoring

    NASA Technical Reports Server (NTRS)

    Grimes, C. A.; Stoyanov, P. G.; Liu, Y.; Tong, C.; Ong, K. G.; Loiselle, K.; Shaw, M.; Doherty, S. A.; Seitz, W. R.

    1999-01-01

    A new type of in situ, remotely monitored magnetism-based sensor is presented that is comprised of an array of magnetically soft, magnetostatically-coupled ferromagnetic thin-film elements or particles combined with a chemically responsive material that swells or shrinks in response to the analyte of interest. As the chemically responsive material changes size the distance between the ferromagnetic elements changes, altering the inter-element magnetostatic coupling. This in turn changes the coercive force of the sensor, the amplitude of the voltage spikes detected in nearby pick-up coils upon magnetization reversal and the number of higher-order harmonics generated by the flux reversal. Since the sensor is monitored through changes in magnetic flux, no physical connections such as wires or cables are needed to obtain sensor information, nor is line of sight alignment required as with laser telemetry; the sensors can be detected from within sealed, opaque or thin metallic enclosures.

  2. Cluster-based query expansion using external collections in medical information retrieval.

    PubMed

    Oh, Heung-Seon; Jung, Yuchul

    2015-12-01

    Utilizing external collections to improve retrieval performance is challenging research because various test collections are created for different purposes. Improving medical information retrieval has also gained much attention as various types of medical documents have become available to researchers ever since they started storing them in machine processable formats. In this paper, we propose an effective method of utilizing external collections based on the pseudo relevance feedback approach. Our method incorporates the structure of external collections in estimating individual components in the final feedback model. Extensive experiments on three medical collections (TREC CDS, CLEF eHealth, and OHSUMED) were performed, and the results were compared with a representative expansion approach utilizing the external collections to show the superiority of our method.

  3. Lessons from the private sector on performance-based management

    SciTech Connect

    Stoeckle, K.E.; Kolster, W.G.; Shangraw, R.F.

    1996-03-01

    Implementation of the Government Performance and Results Act of 1993 (GPRA) has provided a unique challenge for Federal Agencies, such as the Department of Energy (DOE) Office of Waste Management (OWM). While performance measurement, as required by GPRA, is new to Federal Agencies, private industry has applied it at all organizational levels to better manage their operations for some time. There has been significant discussion about how the private sector uses performance measures, but there have been very few empirical studies systematically examining their use. To gather information on comparable private industry practices, waste management industry firms were surveyed through questionnaires and follow-on interviews. Questionnaires were sent to 75 waste management firms throughout the United States and Canada. Twenty-four percent of the firms responded to the questionnaire and participated in the follow-on interviews. The questionnaires were typically completed by vice-presidents or senior financial officers. Information collected from the questionnaire and follow-on interviews provided valuable insight into industry practices in the area of performance measurement. This paper discusses the study results and how they can be incorporated in the DOE OWM performance measures and influence the character of the ``critical few`` metrics used by senior DOE managers.

  4. Dynamic link between ECG and clinical data by a CORBA-based query engine and temporal mapping.

    PubMed

    Wang, C; Ohe, K; Kaihara, S

    1997-01-01

    It is important to create a dynamic link method to link distributed patient data across multiple hospitals on an "as needed" basis because the pre-defined links (an item of data has a character or group of characters that indicates the storage of another item of data) are difficult to be managed, or can only be established in part, or are not necessary to be pre-defined in many cases, especially in linking the descriptive data such as history data with the corresponding examination data across multiple hospitals. A method of linking electrocardiogram (ECG) with clinical data dynamically in a Common Object Request Broker Architecture (CORBA) environment has been achieved and verified in a real computing environment to approach to this goal. By this method, distributed patient data can be linked dynamically by a CORBA-based query engine and temporal mapping no matter where they are located on the Internet. The necessary temporal information is provided by either computing or human being. Since multiple time-axes for different databases are involved in, some temporal reasoning methods (such as mapping occurrences across temporal contexts and determining bounds for absolute occurrences, etc.) are applied to this study, and a series of temporal mappings including the first mapping, the secondary mapping, the contextual mapping, the extended mapping, the previous mapping and the next mapping are created. In comparison with the pre-defined link, the major strengths of this method are the dynamic link on an "as needed" basis, no limitation of institutional boundaries, easy creation, simplifying the data storage, and the high flexibility, etc.

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

  6. Query-Biased Preview over Outsourced and Encrypted Data

    PubMed Central

    Luo, Guangchun; Qin, Ke; Chen, Aiguo

    2013-01-01

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

  7. Do Private Conservation Activities Match Science-Based Conservation Priorities?

    PubMed Central

    Fisher, Jonathan R. B.; Dills, Benjamin

    2012-01-01

    Background Private land conservation is an essential strategy for biodiversity protection in the USA, where half of the federally listed species have at least 80% of their habitat on private lands. We investigated the alignment between private land protection conducted by the world's largest land trust (The Nature Conservancy) and the science driven identification of priority areas for conservation. This represents the first quantitative assessment of the influence of defining priority areas on the land acquisitions of a conservation non-governmental organization (NGO). Methodology/Principal Findings The lands acquired by The Nature Conservancy (TNC) were analyzed using GIS to determine to what extent they were in areas defined as priorities for conservation. The spatial analysis of TNC lands was broken up into land known to be acquired in the last five years, five to ten years ago, prior to ten years ago, and anytime during the last sixty years (including previous sets of data plus acquisitions lacking a date). For the entire history of TNC the proportion of TNC lands within the priority areas was 74%. Prior to 10 years ago it was 80%, 5–10 years ago it was 76%, and in the last five years it was 81%. Conservation easements were found to have lower alignment with priority areas (64%) than outright fee simple acquisitions (86%). Conclusions/Significance Overall the location of lands acquired was found to be well aligned with the priority areas. Since there was comparable alignment in lands acquired before and after formalized conservation planning had been implemented as a standard operating procedure, this analysis did not find evidence that defining priority areas has influenced land acquisition decisions. PMID:23029516

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

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

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

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

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

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

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

  15. A novel informatics concept for high-throughput shotgun lipidomics based on the molecular fragmentation query language.

    PubMed

    Herzog, Ronny; Schwudke, Dominik; Schuhmann, Kai; Sampaio, Julio L; Bornstein, Stefan R; Schroeder, Michael; Shevchenko, Andrej

    2011-01-01

    Shotgun lipidome profiling relies on direct mass spectrometric analysis of total lipid extracts from cells, tissues or organisms and is a powerful tool to elucidate the molecular composition of lipidomes. We present a novel informatics concept of the molecular fragmentation query language implemented within the LipidXplorer open source software kit that supports accurate quantification of individual species of any ionizable lipid class in shotgun spectra acquired on any mass spectrometry platform.

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

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

  19. Differentially Private Frequent Sequence Mining via Sampling-based Candidate Pruning

    PubMed Central

    Xu, Shengzhi; Cheng, Xiang; Li, Zhengyi; Xiong, Li

    2016-01-01

    In this paper, we study the problem of mining frequent sequences under the rigorous differential privacy model. We explore the possibility of designing a differentially private frequent sequence mining (FSM) algorithm which can achieve both high data utility and a high degree of privacy. We found, in differentially private FSM, the amount of required noise is proportionate to the number of candidate sequences. If we could effectively reduce the number of unpromising candidate sequences, the utility and privacy tradeoff can be significantly improved. To this end, by leveraging a sampling-based candidate pruning technique, we propose a novel differentially private FSM algorithm, which is referred to as PFS2. The core of our algorithm is to utilize sample databases to further prune the candidate sequences generated based on the downward closure property. In particular, we use the noisy local support of candidate sequences in the sample databases to estimate which sequences are potentially frequent. To improve the accuracy of such private estimations, a sequence shrinking method is proposed to enforce the length constraint on the sample databases. Moreover, to decrease the probability of misestimating frequent sequences as infrequent, a threshold relaxation method is proposed to relax the user-specified threshold for the sample databases. Through formal privacy analysis, we show that our PFS2 algorithm is ε-differentially private. Extensive experiments on real datasets illustrate that our PFS2 algorithm can privately find frequent sequences with high accuracy. PMID:26973430

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

  1. Health-based risk neutralization in private disability insurance

    PubMed Central

    Buitenhuis, Jan; Brouwer, Sandra; van der Klink, Jac J.L.; de Boer, Michiel R.

    2016-01-01

    Background: Exclusions are used by insurers to neutralize higher than average risks of sickness absence (SA). However, differentiating risk groups according to one’s medical situation can be seen as discrimination against people with health problems in violation of a 2006 United Nations convention. The objective of this study is to investigate whether the risk of SA of insured persons with exclusions added to their insurance contract differs from the risk of persons without exclusions. Methods: A dynamic cohort of 15 632 applicants for private disability insurance at a company insuring only college and university educated self-employed in the Netherlands. Mean follow-up was 8.94 years. Duration and number of SA periods were derived from insurance data to calculate the hazard of SA periods and of recurrence of SA periods. Results: Self-employed with an exclusion added to their insurance policy experienced a higher hazard of one or more periods of SA and on average more SA days than self-employed without an exclusion. Conclusion: Persons with an exclusion had a higher risk of SA than persons without an exclusion. The question to what extent an individual should benefit from being less vulnerable to disease and SA must be addressed in a larger societal context, taking other aspects of health inequality and solidarity into account as well. PMID:27371668

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

  3. A comprehensive physiologically based pharmacokinetic knowledgebase and web-based interface for rapid model ranking and querying

    EPA Science Inventory

    Published physiologically based pharmacokinetic (PBPK) models from peer-reviewed articles are often well-parameterized, thoroughly-vetted, and can be utilized as excellent resources for the construction of models pertaining to related chemicals. Specifically, chemical-specific pa...

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

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

  6. A new method for generating an invariant iris private key based on the fuzzy vault system.

    PubMed

    Lee, Youn Joo; Park, Kang Ryoung; Lee, Sung Joo; Bae, Kwanghyuk; Kim, Jaihie

    2008-10-01

    Cryptographic systems have been widely used in many information security applications. One main challenge that these systems have faced has been how to protect private keys from attackers. Recently, biometric cryptosystems have been introduced as a reliable way of concealing private keys by using biometric data. A fuzzy vault refers to a biometric cryptosystem that can be used to effectively protect private keys and to release them only when legitimate users enter their biometric data. In biometric systems, a critical problem is storing biometric templates in a database. However, fuzzy vault systems do not need to directly store these templates since they are combined with private keys by using cryptography. Previous fuzzy vault systems were designed by using fingerprint, face, and so on. However, there has been no attempt to implement a fuzzy vault system that used an iris. In biometric applications, it is widely known that an iris can discriminate between persons better than other biometric modalities. In this paper, we propose a reliable fuzzy vault system based on local iris features. We extracted multiple iris features from multiple local regions in a given iris image, and the exact values of the unordered set were then produced using the clustering method. To align the iris templates with the new input iris data, a shift-matching technique was applied. Experimental results showed that 128-bit private keys were securely and robustly generated by using any given iris data without requiring prealignment.

  7. Quantum Private Comparison of Equality Based on Five-Particle Cluster State

    NASA Astrophysics Data System (ADS)

    Chang, Yan; Zhang, Wen-Bo; Zhang, Shi-Bin; Wang, Hai-Chun; Yan, Li-Li; Han, Gui-Hua; Sheng, Zhi-Wei; Huang, Yuan-Yuan; Suo, Wang; Xiong, Jin-Xin

    2016-12-01

    A protocol for quantum private comparison of equality (QPCE) is proposed based on five-particle cluster state with the help of a semi-honest third party (TP). In our protocol, TP is allowed to misbehave on its own but can not conspire with either of two parties. Compared with most two-user QPCE protocols, our protocol not only can compare two groups of private information (each group has two users) in one execution, but also compare just two private information. Compared with the multi-user QPCE protocol proposed, our protocol is safer with more reasonable assumptions of TP. The qubit efficiency is computed and analyzed. Our protocol can also be generalized to the case of 2N participants with one TP. The 2N-participant protocol can compare two groups (each group has N private information) in one execution or just N private information. Supported by NSFC under Grant Nos. 61402058, 61572086, the Fund for Middle and Young Academic Leaders of CUIT under Grant No. J201511, the Science and Technology Support Project of Sichuan Province of China under Grant No. 2013GZX0137, the Fund for Young Persons Project of Sichuan Province of China under Grant No. 12ZB017, and the Foundation of Cyberspace Security Key Laboratory of Sichuan Higher Education Institutions under Grant No. szjj2014-074

  8. The Effects of a Cognitive-Based Intervention on Drug Awareness in Private School Preadolescent Students

    ERIC Educational Resources Information Center

    Parsons, Phyllis M.

    2005-01-01

    The effects of a Cognitive-Based Intervention on Drug Awareness in Private School Preadolescent Students. Parsons, Phyllis M., 2005: Applied Dissertation, Nova Southeastern University, Fischler School of Education and Human Services. Adolescents/Substance Abuse/Prevention/Family Influence/Drug Education. This applied dissertation was designed to…

  9. Diversity Preparedness: A Reflection on Pre-Service Teacher Preparation in Private, Faith-Based Colleges

    ERIC Educational Resources Information Center

    Maclin, ShaRhonda A.

    2012-01-01

    The purpose of this exploratory, quantitative study is to evaluate the diversity preparedness of teacher education graduates from private, faith-based colleges. More specifically, the study identifies how teacher education graduates perceive their preparation to work with diversity issues in the classroom. Participants shared their perceptions of…

  10. A Taxonomy Based on Revenue Dependency for Private Master's Universities

    ERIC Educational Resources Information Center

    Maniaci, Vincent M.; Poole, Rob

    2005-01-01

    This article expands on the previous work of Maniaci, Poole, and Wilson by presenting a taxonomy based on the level of reliance for operations from annual giving and endowment payout. The authors anticipate that the taxonomy may be a useful means of increasing situational awareness for institutional decision makers. The authors offer possibilities…

  11. Environmental Assessment: Military Family Housing Privatization Maxwell Air Force Base

    DTIC Science & Technology

    2005-06-01

    Water Resources) Montgomery Chamber of Commerce George , Randall (President) Montgomery County – City Public Library Montgomery County...Force Base Personnel, Interviewer; Tamara Carroll. Zervos , Spero G. 2001. A Brief History of Maxwell AFB. Maxwell AFB, AL: Air University History...35486- 6999 205-247-3589 Montgomery Chamber of Commerce President Randall George 41 Commerce Street Montgomery, AL 36101 PO Box 79 Montgomery, AL

  12. Revenue-Based Financial Modeling: A Sustainable Model for Medium-Size, Private, Mission-Based Schools of Education

    ERIC Educational Resources Information Center

    Harbouk, Joseph

    2011-01-01

    This study examined the implementation and assessment of revenue-based budgeting at a medium-size, private, mission-based graduate school of education (SOE), under the pseudonym Peter Claver University (PCU). Additionally, two other similar schools were included in the study because they used revenue-based budgeting for a period of 10 years or…

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

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

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

  16. In-Network Processing of an Iceberg Join Query in Wireless Sensor Networks Based on 2-Way Fragment Semijoins

    PubMed Central

    Kang, Hyunchul

    2015-01-01

    We investigate the in-network processing of an iceberg join query in wireless sensor networks (WSNs). An iceberg join is a special type of join where only those joined tuples whose cardinality exceeds a certain threshold (called iceberg threshold) are qualified for the result. Processing such a join involves the value matching for the join predicate as well as the checking of the cardinality constraint for the iceberg threshold. In the previous scheme, the value matching is carried out as the main task for filtering non-joinable tuples while the iceberg threshold is treated as an additional constraint. We take an alternative approach, meeting the cardinality constraint first and matching values next. In this approach, with a logical fragmentation of the join operand relations on the aggregate counts of the joining attribute values, the optimal sequence of 2-way fragment semijoins is generated, where each fragment semijoin employs a Bloom filter as a synopsis of the joining attribute values. This sequence filters non-joinable tuples in an energy-efficient way in WSNs. Through implementation and a set of detailed experiments, we show that our alternative approach considerably outperforms the previous one. PMID:25774710

  17. In-network processing of an iceberg join query in wireless sensor networks based on 2-way fragment semijoins.

    PubMed

    Kang, Hyunchul

    2015-03-12

    We investigate the in-network processing of an iceberg join query in wireless sensor networks (WSNs). An iceberg join is a special type of join where only those joined tuples whose cardinality exceeds a certain threshold (called iceberg threshold) are qualified for the result. Processing such a join involves the value matching for the join predicate as well as the checking of the cardinality constraint for the iceberg threshold. In the previous scheme, the value matching is carried out as the main task for filtering non-joinable tuples while the iceberg threshold is treated as an additional constraint. We take an alternative approach, meeting the cardinality constraint first and matching values next. In this approach, with a logical fragmentation of the join operand relations on the aggregate counts of the joining attribute values, the optimal sequence of 2-way fragment semijoins is generated, where each fragment semijoin employs a Bloom filter as a synopsis of the joining attribute values. This sequence filters non-joinable tuples in an energy-efficient way in WSNs. Through implementation and a set of detailed experiments, we show that our alternative approach considerably outperforms the previous one.

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

  19. Teaching Tacting of Private Events Based on Public Accompaniments: Effects of Contingencies, Audience Control, and Stimulus Complexity.

    PubMed

    Stocco, Corey S; Thompson, Rachel H; Hart, John M

    2014-06-01

    Our current understanding of the role of private events in the science of behavior is based largely on Skinner's natural science interpretation of private events. Skinner described public accompaniments as one source of control for a verbal community to differentially reinforce verbal behavior regarding private events. In this study, we developed an experimental analogue to study variables influencing tacting of private events. The participant had exclusive access to one set of stimuli (the private stimuli), and the experimenter attempted to teach tacts for private stimuli based on their correspondence with public stimuli accessible to both the experimenter and participant. Results of experiments 1 and 2 demonstrated that reports of private stimuli were a function of degree of public-private correspondence, reinforcement contingency, and audience control. In some cases, we encountered reports controlled exclusively by public stimuli. Results of experiment 3 showed that public control was less likely when public stimuli were more complex and the experimenter had a unique behavioral history with respect to those stimuli that was not shared by the learner. The orderly patterns of data obtained suggest that analogue arrangements might be a useful, and even necessary, starting point for experimental investigations of how private events may enter into the analysis of behavior.

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

  1. Random subspaces for encryption based on a private shared Cartesian frame

    SciTech Connect

    Bartlett, Stephen D.; Hayden, Patrick; Spekkens, Robert W.

    2005-11-15

    A private shared Cartesian frame is a novel form of private shared correlation that allows for both private classical and quantum communication. Cryptography using a private shared Cartesian frame has the remarkable property that asymptotically, if perfect privacy is demanded, the private classical capacity is three times the private quantum capacity. We demonstrate that if the requirement for perfect privacy is relaxed, then it is possible to use the properties of random subspaces to nearly triple the private quantum capacity, almost closing the gap between the private classical and quantum capacities.

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

  3. Final Environmental Assessment for the Military Housing Privatization Initiative (MHPI), Eielson Air Force Base, Alaska

    DTIC Science & Technology

    2011-05-01

    Communities near Eielson AFB include Moose Creek to the north and Salcha to the south. Base lands include 19,790 contiguous acres bounded on the west by...Century Park South Rainbow Court Broadway Moose Lake ~ Ravenswood N 0 0.15 0.3 Purpose and Need for Action May 2011 Military Housing Privatization...Existing Housing Area Estimated Size of Lease (Acres) Length of Lease (Years) Number of Units Conveyed French Creek 50 50 215 Moose Lake 47

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

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

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

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

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

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

  10. Query Expansion and Query Translation as Logical Inference.

    ERIC Educational Resources Information Center

    Nie, Jian-Yun

    2003-01-01

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

  11. Generation of plaintext-independent private key based on conditional decomposition strategy

    NASA Astrophysics Data System (ADS)

    Lin, Chao; Shen, Xueju; Lei, Ming

    2016-11-01

    We propose to generate the plaintext-independent private keys in optical asymmetric cryptosystem (OACS) based on the strategy of conditional decomposition (CD). Following this strategy, an OACS is designed with the principle of superposition of two vectorial beams. The proposed cryptosystem can remove the silhouette which is discovered in the two beams interference-based cryptosystem. To relieve the difficulty of key distribution, a structured spiral phase key (SSPK) is utilized instead of the random phase key (RPK). And a comparison on the performance of two kinds of keys in both the encryption and decryption process is made to show the advantage of SSPK over RPK.

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

  13. IView: Introgression library visualization and query tool

    Technology Transfer Automated Retrieval System (TEKTRAN)

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

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

  15. Prioritizing Public- Private Partnership Models for Public Hospitals of Iran Based on Performance Indicators

    PubMed Central

    Gholamzadeh Nikjoo, Raana; Jabbari Beyrami, Hossein; Jannati, Ali; Asghari Jaafarabadi, Mohammad

    2012-01-01

    Background: The present study was conducted to scrutinize Public- Private Partnership (PPP) models in public hospitals of different countries based on performance indicators in order to se-lect appropriated models for Iran hospitals. Methods: In this mixed (quantitative-qualitative) study, systematic review and expert panel has been done to identify varied models of PPP as well as performance indicators. In the second step we prioritized performance indicator and PPP models based on selected performance indicators by Analytical Hierarchy process (AHP) technique. The data were analyzed by Excel 2007 and Expert Choice11 software’s. Results: In quality – effectiveness area, indicators like the rate of hospital infections (100%), hospital accidents prevalence rate (73%), pure rate of hospital mortality (63%), patient satisfaction percentage (53%), in accessibility equity area indicators such as average inpatient waiting time (100%) and average outpatient waiting time (74%), and in financial – efficiency area, indicators including average length of stay (100%), bed occupation ratio (99%), specific income to total cost ratio (97%) have been chosen to be the most key performance indicators. In the pri¬oritization of the PPP models clinical outsourcing, management, privatization, BOO (build, own, operate) and non-clinical outsourcing models, achieved high priority for various performance in¬dicator areas. Conclusion: This study had been provided the most common PPP options in the field of public hospitals and had gathered suitable evidences from experts for choosing appropriate PPP option for public hospitals. Effect of private sector presence in public hospital performance, based on which PPP options undertaken, will be different. PMID:24688942

  16. Object-based modeling, identification, and labeling of medical images for content-based retrieval by querying on intervals of attribute values

    NASA Astrophysics Data System (ADS)

    Thies, Christian; Ostwald, Tamara; Fischer, Benedikt; Lehmann, Thomas M.

    2005-04-01

    The classification and measuring of objects in medical images is important in radiological diagnostics and education, especially when using large databases as knowledge resources, for instance a picture archiving and communication system (PACS). The main challenge is the modeling of medical knowledge and the diagnostic context to label the sought objects. This task is referred to as closing the semantic gap between low-level pixel information and high level application knowledge. This work describes an approach which allows labeling of a-priori unknown objects in an intuitive way. Our approach consists of four main components. At first an image is completely decomposed into all visually relevant partitions on different scales. This provides a hierarchical organized set of regions. Afterwards, for each of the obtained regions a set of descriptive features is computed. In this data structure objects are represented by regions with characteristic attributes. The actual object identification is the formulation of a query. It consists of attributes on which intervals are defined describing those regions that correspond to the sought objects. Since the objects are a-priori unknown, they are described by a medical expert by means of an intuitive graphical user interface (GUI). This GUI is the fourth component. It enables complex object definitions by browsing the data structure and examinating the attributes to formulate the query. The query is executed and if the sought objects have not been identified its parameterization is refined. By using this heuristic approach, object models for hand radiographs have been developed to extract bones from a single hand in different anatomical contexts. This demonstrates the applicability of the labeling concept. By using a rule for metacarpal bones on a series of 105 images, this type of bone could be retrieved with a precision of 0.53 % and a recall of 0.6%.

  17. A social marketing approach to implementing evidence-based practice in VHA QUERI: the TIDES depression collaborative care model

    PubMed Central

    2009-01-01

    Abstract Collaborative care models for depression in primary care are effective and cost-effective, but difficult to spread to new sites. Translating Initiatives for Depression into Effective Solutions (TIDES) is an initiative to promote evidence-based collaborative care in the U.S. Veterans Health Administration (VHA). Social marketing applies marketing techniques to promote positive behavior change. Described in this paper, TIDES used a social marketing approach to foster national spread of collaborative care models. TIDES social marketing approach The approach relied on a sequential model of behavior change and explicit attention to audience segmentation. Segments included VHA national leadership, Veterans Integrated Service Network (VISN) regional leadership, facility managers, frontline providers, and veterans. TIDES communications, materials and messages targeted each segment, guided by an overall marketing plan. Results Depression collaborative care based on the TIDES model was adopted by VHA as part of the new Primary Care Mental Health Initiative and associated policies. It is currently in use in more than 50 primary care practices across the United States, and continues to spread, suggesting success for its social marketing-based dissemination strategy. Discussion and conclusion Development, execution and evaluation of the TIDES marketing effort shows that social marketing is a promising approach for promoting implementation of evidence-based interventions in integrated healthcare systems. PMID:19785754

  18. Nuclear privatization

    SciTech Connect

    Jeffs, E.

    1995-11-01

    The United Kingdom government announced in May 1995 plans to privatize the country`s two nuclear generating companies, Nuclear Electric and Scottish Nuclear. Under the plan, the two companies will become operating divisions of a unified holding company, to be called British Electric, with headquarters in Scotland. Britain`s nuclear plants were left out of the initial privatization in 1989 because the government believed the financial community would be unwilling to accept the open-ended liability of decommissioning the original nine stations based on the Magnox gas-cooled reactor. Six years later, the government has found a way around this by retaining these power stations in state ownership, leaving the new nuclear company with the eight Advanced Gas-cooled Reactor (AGR) stations and the recently completed Sizewell B PWR stations. The operating Magnox stations are to be transferred to BNFL, which operates two Magnox stations of their own at Calder Hall and Chapelcross.

  19. Sustainability of a privatized community-based animal health worker system in Mwingi District, Kenya.

    PubMed

    Rubyogo, J C; Murithii, P M; Agumbah, G J O; Obhai, G

    2005-05-01

    This paper describes a study on the sustainability of Community-based Animal Health Worker (CAHW) services in Mwingi District, Kenya. These services began in 1992 and were supported by the District Veterinary Authority (DVA) with assistance from the Integrated Food Security Programme-Eastern (IFSP-E). Over time and using a process of participatory reviews with multiple stakeholders, the system evolved into a network of CAHWs. The study focused on CAHWs' service sustainability and their relationships with other animal health service providers. A mutually beneficial and supportive arrangement existed between the CAHWs and Animal Health Assistants (AHAs), based on a private drug supply system, referral and backstopping support. The CAHWs derived sufficient income from their veterinary work to maintain their interest in the system. Seventy percent of CAHWs were continuing to offer adequate animal health services 3 years or more after their initial training and the withdrawal of donor support. Ninety-five percent of sampled CAHWs (n = 40) viewed their business as successful and expanding. Considering the agro-ecological and socio-economic conditions of the district, the CAHW system can be viewed as an initial stage in the process of extending quality private sector veterinary services.

  20. Rainwater drainage management for urban development based on public-private partnership.

    PubMed

    Matsushita, J; Ozaki, M; Nishimura, S; Ohgaki, S

    2001-01-01

    The Urban Development Corporation (UDC) is one of the biggest implementation bodies for urban development in Japan. UDC has developed rainwater infiltration technology since 1975. This technology has effectively reduced runoff to a river and sewer system in the new town project areas. Recently, UDC has developed a new system which is defined as a "Rainwater Recycle Sewer System", which is supported by "Rainwater Storage and Infiltration Technology (RSIT)" applicable to new town creation and urban renewal. The new system consists of two elements: RSIT components based on Public-Private Partnership (PPP) and a stormwater drainage system. Herein, the private sector is responsible for the main part of RSIT, and the public sector is responsible for the stormwater drainage from the development area. As a result, the capacity of public facilities, such as rainwater sewers and stormwater reservoirs, can be reduced effectively. In parallel, the initial/running cost of public facilities is expected to be reduced. In conclusion, the authors would stress the importance of a co-maintenance system also based on PPP, which will be required especially in order to properly operate the whole system for the long term.

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

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

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

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

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

    ERIC Educational Resources Information Center

    Choi, Youngok; Rasmussen, Edie M.

    2003-01-01

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

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

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

    ERIC Educational Resources Information Center

    Woal, S. Theodore

    1974-01-01

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

  8. All-optical virtual private network and ONUs communication in optical OFDM-based PON system.

    PubMed

    Zhang, Chongfu; Huang, Jian; Chen, Chen; Qiu, Kun

    2011-11-21

    We propose and demonstrate a novel scheme, which enables all-optical virtual private network (VPN) and all-optical optical network units (ONUs) inter-communications in optical orthogonal frequency-division multiplexing-based passive optical network (OFDM-PON) system using the subcarrier bands allocation for the first time (to our knowledge). We consider the intra-VPN and inter-VPN communications which correspond to two different cases: VPN communication among ONUs in one group and in different groups. The proposed scheme can provide the enhanced security and a more flexible configuration for VPN users compared to the VPN in WDM-PON or TDM-PON systems. The all-optical VPN and inter-ONU communications at 10-Gbit/s with 16 quadrature amplitude modulation (16 QAM) for the proposed optical OFDM-PON system are demonstrated. These results verify that the proposed scheme is feasible.

  9. Developing an Interventional Pulmonary Service in a Community-Based Private Practice: A Case Study.

    PubMed

    French, Kim D; Desai, Neeraj R; Diamond, Edward; Kovitz, Kevin L

    2016-04-01

    Interventional pulmonology (IP) is a field that uses minimally invasive techniques to diagnose, treat, and palliate advanced lung disease. Technology, formal training, and reimbursement for IP procedures have been slow to catch up with other interventional subspecialty areas. A byproduct of this pattern has been limited IP integration in private practice settings. We describe the key aspects and programmatic challenges of building an IP program in a community-based setting. A philosophical and financial buy-in by stakeholders and a regionalization of services, within and external to a larger practice, are crucial to success. Our experience demonstrates that a successful launch of an IP program increases overall visits as well as procedural volume without cannibalizing existing practice volume. We hope this might encourage others to provide this valuable service to their own communities.

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

    ERIC Educational Resources Information Center

    Jerrard, Jane; Bolt, Nancy; Strege, Karen

    2012-01-01

    This timely special report from ALA Editions provides a succinct but comprehensive overview of the "privatization" of public libraries. It provides a history of the trend of local and state governments privatizing public services and assets, and then examines the history of public library privatization right up to the California…

  12. Private Rehabilitation.

    ERIC Educational Resources Information Center

    McMahon, Brian T., Ed.

    1983-01-01

    Discusses the expanding role of the rehabilitation counselor into private sector rehabilitation in the seven articles of this special issue. Topics cover private rehabilitation in an insurance context including forensics issues, computer applications, recent trends, services in a multiprogram private clinic, and rehabilitation counselor training.…

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

  14. Urban Community Development and Private Education Dilemma: Based on a Field Study of a City in East China

    ERIC Educational Resources Information Center

    Qian, Li; Anlei, Jing

    2014-01-01

    Urbanization is an issue of universal concern today distinctly affecting the supply, content, and orientation of education. Based on a field study in a city in East China, the article argues that rural-urban migration in the process of urbanization created private sectors in education enterprises that were in sync with the urban community…

  15. Private Cost of Education: A Comparative Study of Distance and Campus-Based University Students in Nigeria

    ERIC Educational Resources Information Center

    Olakulehin, Felix K.; Panda, Santosh K.

    2011-01-01

    This paper examines the comparative private costs of distance and conventional (classroom-based) university students in Nigeria. A total of 200 subjects comprising students registered for the B.Sc. Computer Science and B.A. English Studies programmes at the University of Lagos, Nigeria and the National Open University of Nigeria (NOUN) were…

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

    PubMed Central

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

    2016-01-01

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

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

  18. Women and Private Pensions.

    ERIC Educational Resources Information Center

    Benson, Helene A.

    This speech focuses on women and private pension plans, such as private pension coverage and smaller benefit amounts. Pension issues affecting women as employees include participation in plans, vesting, break-in service, benefit accruals, integration with Social Security, sex-based actuarial tables, portability, inflation, and individual…

  19. Querying Large Biological Network Datasets

    ERIC Educational Resources Information Center

    Gulsoy, Gunhan

    2013-01-01

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

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

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

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

  4. Multi-Party Quantum Private Comparison Protocol Based on Entanglement Swapping of Bell Entangled States

    NASA Astrophysics Data System (ADS)

    Ye, Tian-Yu

    2016-09-01

    Recently, Liu et al. proposed a two-party quantum private comparison (QPC) protocol using entanglement swapping of Bell entangled state (Commun. Theor. Phys. 57 (2012) 583). Subsequently Liu et al. pointed out that in Liu et al.'s protocol, the TP can extract the two users' secret inputs without being detected by launching the Bell-basis measurement attack, and suggested the corresponding improvement to mend this loophole (Commun. Theor. Phys. 62 (2014) 210). In this paper, we first point out the information leakage problem toward TP existing in both of the above two protocols, and then suggest the corresponding improvement by using the one-way hash function to encrypt the two users' secret inputs. We further put forward the three-party QPC protocol also based on entanglement swapping of Bell entangled state, and then validate its output correctness and its security in detail. Finally, we generalize the three-party QPC protocol into the multi-party case, which can accomplish arbitrary pair's comparison of equality among K users within one execution. Supported by the National Natural Science Foundation of China under Grant No. 61402407

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

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

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

  8. A Priori Analysis of Natural Language Queries.

    ERIC Educational Resources Information Center

    Spiegler, Israel; Elata, Smadar

    1988-01-01

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

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

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

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

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

  13. Design and Implementation of an Online Private Information Retrieval System for a Technology-Based Consultancy.

    ERIC Educational Resources Information Center

    Tomlinson, Daphne; Cordiner, Mary

    1986-01-01

    Considers factors central to the design, specification, and implementation of a private bibliographic database for the documentation of internally generated techno-commercial reports at PA Technology, a scientific and technical consulting company. A survey of subject access and indexing needs, hardware and software design, and possible future…

  14. The Policy Environment of Private Higher Education in China: A Discussion Based upon Property Ownership Rights

    ERIC Educational Resources Information Center

    Su, Spring

    2012-01-01

    The reemergence and growth of private higher education institutions (HEIs) represent one of the most significant developments in Chinese higher education over recent decades. Against a macroeconomic background of decentralization, this phenomenon is essentially fuelled by a broad spectrum of political and socioeconomic forces. This study sets out…

  15. Analysis of Research Collaboration between Universities and Private Companies in Spain Based on Joint Scientific Publications

    ERIC Educational Resources Information Center

    Olmeda-Gómez, Carlos; Ovalle-Perandones, María Antonia; de Moya-Anegón, Félix

    2015-01-01

    Introduction: The article presents the results of a study on scientific collaboration between Spanish universities and private enterprise, measured in terms of the co-authorship of papers published in international journals. Method: Bibliometric analysis of papers published in journals listed in Scopus in 2003-2011. Indicators were calculated for…

  16. Receiving money for medicine: some tensions and resolutions for community-based private complementary therapists.

    PubMed

    Andrews, Gavin J; Peter, Elizabeth; Hammond, Robin

    2003-03-01

    During recent years, private complementary medicine has grown as a significant provider of healthcare in the UK and much of this provision is through small private businesses financed by out-of-pocket payments made by privately paying clients. Using a combined questionnaire (n = 426) and interview survey (n = 49), the present paper considers the potential tensions and dilemmas which therapists face and the resolutions which they come to in being carers, but in market terms, also profit makers. Therapists generally identified with being carers first and business people second, and this was reflected in their caring decisions. Indeed, under circumstances where the roles potentially conflicted (e.g. when clients could no longer afford to pay for their treatments), most therapists claimed that they continued to provide care, either by providing their services free-of-charge, at a reduced rate, by deferring payment or by accepting alternative forms of compensation. There is a relative lack of dedicated research literature on complementary therapists, their attitudes and actions, and this paper provides some important data on their specific management and caring decisions. At the same time, the evidence also provides some initial food-for-thought and indicates some potential research directions for exploring ethical issues in the private practice of complementary medicine.

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

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

    PubMed Central

    Liu, Yang; Li, Fan; Wang, Yu

    2016-01-01

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

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

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

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

  2. Subsidising artemisinin-based combination therapy in the private retail sector

    PubMed Central

    Opiyo, Newton; Yamey, Gavin; Garner, Paul

    2016-01-01

    Background Malaria causes ill health and death in Africa. Treating illness promptly with artemisinin-based combination therapy (ACT) is likely to cure people and avoid the disease progressing to more severe forms and death. In many countries, ACT use remains low. Part of the problem is that most people seek treatment from the retail sector where ACTs are expensive; this expense is a barrier to their use. The Global Fund and other international organisations are subsidising the cost of ACTs for private retail providers to improve access to ACTs. The subsidy was initially organised through a stand-alone initiative, called the Affordable Medicines Facility-malaria (AMFm), but has since been integrated into the Global Fund core grant management and financial processes. Objectives To assess the effect of programmes that include ACT price subsidies for private retailers on ACT use, availability, price and market share. Search methods We searched the Cochrane Central Register of Controlled Trials (CENTRAL; 2015, Issue 1, The Cochrane Library, including the Cochrane Effective Practice and Organisation of Care (EPOC) Group Specialised Register); MEDLINE (OvidSP), EMBASE (OvidSP), CINAHL (EbscoHost), EconLit (ProQuest), Global Health (OvidSP), Regional Indexes (Global Health Library, WHO), LILACS (Global Health Library, WHO), Science Citation Index and Social Sciences Citation Index (ISI Web of Science) and Health Management (ProQuest). All databases were searched February 2015, except for Health Management which was searched November 2013, without any date, language or publication status restrictions. We also searched the International Clinical Trials Registry Platform (ICTRP; WHO), ClinicalTrials.gov (NIH) and various grey literature sources. We also conducted a cited reference search for all included studies in ISI Web of Knowledge, checked references of identified articles and contacted authors to identify additional studies. Selection criteria Randomised trials, non

  3. Perspectives of comprehensive mineral exploitation based on the principles of public-private partnership

    NASA Astrophysics Data System (ADS)

    Nikitenko, S. M.; Goosen, E. V.; Sablin, K. S.

    2016-10-01

    The opportunities of the public-private partnership instruments using to shift the paradigm of the natural resources development in the fuel and energy complex of Russia are highlighted in the article. Three main directions of PPP projects development in the subsoil use are pointed out. The role of innovations in the implementation of the most perspective PPP projects in the fuel and energy complex of Russia is shown.

  4. Environmental Assessment for the Military Housing Privatization Initiative (MHPI) Tinker Air Force Base, Oklahoma

    DTIC Science & Technology

    2007-10-01

    members and their families will choose to live. A Housing Requirements and Market Analysis (HRMA) conducted in 2006 identified the need to upgrade...Alternative FONSI Finding of No Significant Impact GSF Gross Square Footage HMMS Hazardous Materials Management System HQ AFCEE/HDP Headquarters AFCEE...Housing Privatization HRMA Housing Requirements and Market Analysis HUD U.S. Department of Housing and Urban Development HWBZ Hennessey Water

  5. Final Environmental Assessment: Military Family Housing Privatization Altus Air Force Base

    DTIC Science & Technology

    2004-07-01

    constant, there will be no overall change in community potable water usage, wastewater generation, or electricity/ natura l gas consumption. Construction...99-117-0) from the ODEQ in August 2000 . Because actual emissions from Altus AFB operations are relatively small (i.e., well below the “major...Family Housing Privatization Approximately 21,447 people, or 75 percent, of the estimated 2000 Jackson County population resided in the city of

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

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

    PubMed Central

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

    2015-01-01

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

  8. Using common table expressions to build a scalable Boolean query generator for clinical data warehouses.

    PubMed

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

    2014-09-01

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

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

    PubMed Central

    Kim, Yunsung; Park, Soo-Hyun

    2011-01-01

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

  10. Towards Optimal Multi-Dimensional Query Processing with BitmapIndices

    SciTech Connect

    Rotem, Doron; Stockinger, Kurt; Wu, Kesheng

    2005-09-30

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

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

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

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

    PubMed Central

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

    2014-01-01

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

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

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

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

  17. Semantic Annotations and Querying of Web Data Sources

    NASA Astrophysics Data System (ADS)

    Hornung, Thomas; May, Wolfgang

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

  18. Analysis of DNS Cache Effects on Query Distribution

    PubMed Central

    2013-01-01

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

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

  20. Evidential significance of automotive paint trace evidence using a pattern recognition based infrared library search engine for the Paint Data Query Forensic Database.

    PubMed

    Lavine, Barry K; White, Collin G; Allen, Matthew D; Fasasi, Ayuba; Weakley, Andrew

    2016-10-01

    A prototype library search engine has been further developed to search the infrared spectral libraries of the paint data query database to identify the line and model of a vehicle from the clear coat, surfacer-primer, and e-coat layers of an intact paint chip. For this study, search prefilters were developed from 1181 automotive paint systems spanning 3 manufacturers: General Motors, Chrysler, and Ford. The best match between each unknown and the spectra in the hit list generated by the search prefilters was identified using a cross-correlation library search algorithm that performed both a forward and backward search. In the forward search, spectra were divided into intervals and further subdivided into windows (which corresponds to the time lag for the comparison) within those intervals. The top five hits identified in each search window were compiled; a histogram was computed that summarized the frequency of occurrence for each library sample, with the IR spectra most similar to the unknown flagged. The backward search computed the frequency and occurrence of each line and model without regard to the identity of the individual spectra. Only those lines and models with a frequency of occurrence greater than or equal to 20% were included in the final hit list. If there was agreement between the forward and backward search results, the specific line and model common to both hit lists was always the correct assignment. Samples assigned to the same line and model by both searches are always well represented in the library and correlate well on an individual basis to specific library samples. For these samples, one can have confidence in the accuracy of the match. This was not the case for the results obtained using commercial library search algorithms, as the hit quality index scores for the top twenty hits were always greater than 99%.

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

  3. Design and Evaluation of a User Interface Supporting Multiple Image Query Models.

    ERIC Educational Resources Information Center

    Mostafa, Javed; Dillon, Andrew

    1996-01-01

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

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

    ERIC Educational Resources Information Center

    Lucas, Wendy; Topi, Heikki

    2002-01-01

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

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

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

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

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

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

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

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

    PubMed

    Lu, Zhiyong; Wilbur, W John

    2009-10-01

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

  12. Differentially private distributed logistic regression using private and public data

    PubMed Central

    2014-01-01

    Background Privacy protecting is an important issue in medical informatics and differential privacy is a state-of-the-art framework for data privacy research. Differential privacy offers provable privacy against attackers who have auxiliary information, and can be applied to data mining models (for example, logistic regression). However, differentially private methods sometimes introduce too much noise and make outputs less useful. Given available public data in medical research (e.g. from patients who sign open-consent agreements), we can design algorithms that use both public and private data sets to decrease the amount of noise that is introduced. Methodology In this paper, we modify the update step in Newton-Raphson method to propose a differentially private distributed logistic regression model based on both public and private data. Experiments and results We try our algorithm on three different data sets, and show its advantage over: (1) a logistic regression model based solely on public data, and (2) a differentially private distributed logistic regression model based on private data under various scenarios. Conclusion Logistic regression models built with our new algorithm based on both private and public datasets demonstrate better utility than models that trained on private or public datasets alone without sacrificing the rigorous privacy guarantee. PMID:25079786

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

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

  15. Peru privatizes

    SciTech Connect

    Suttil, K.R.

    1993-02-01

    Peru has been undergoing a revolution since the election of Alberto Fujimori as president in 1990. A revolution that is reversing many of the policies of the past 25 years and one which aims to bring Peru back into the mainstream of the world economy. All the enterprises nationalized in the heady days of the early 1970s are set up for privatization. The most important are the three mining companies: Hierro-Peru, Centromin, and Mineroo-Peru. It will not be easy to attract foreign investment after such a long period of political and economic instability but the rewards are there for the intrepid.

  16. Private Loans: Facts and Trends

    ERIC Educational Resources Information Center

    Institute for College Access & Success, 2014

    2014-01-01

    Private loans are one of the riskiest ways to finance a college education. Like credit cards, they typically have variable interest rates. Both variable and fixed rates are higher for those who can least afford them--as high as 13% in June 2014. Private loans are not eligible for the important deferment, income-based repayment, or loan forgiveness…

  17. The Usefulness and Feasibility of Mobile Interface in Tuberculosis Notification (MITUN) Voice Based System for Notification of Tuberculosis by Private Medical Practitioners – A Pilot Project

    PubMed Central

    Velayutham, Banurekha; Thomas, Beena; Nair, Dina; Thiruvengadam, Kannan; Prashant, Suma; Kittusami, Sathyapriya; Vijayakumar, Harivanzan; Chidambaram, Meenachi; Shivakumar, Shri Vijay Bala Yogendra; Jayabal, Lavanya; Jhunjhunwala, Ashok; Swaminathan, Soumya

    2015-01-01

    Introduction Tuberculosis (TB) is a notifiable disease and health care providers are required to notify every TB case to local authorities. We conducted a pilot study to determine the usefulness and feasibility of mobile interface in TB notification (MITUN) voice based system for notification of TB cases by private medical practitioners. Methodology The study was conducted during September 2013 to October 2014 in three zones of Chennai, an urban setting in South India. Private clinics wherein services are provided by single private medical practitioners were approached. The steps involved in MITUN included: Registration of the practitioners and notification of TB cases by them through voice interactions. Pre and post-intervention questionnaires were administered to collect information on TB notification practices and feasibility of MITUN after an implementation period of 6 months. Results A total of 266 private medical practitioners were approached for the study. Of them, 184 (69%) participated in the study; of whom 11 (6%) practitioners used MITUN for TB notification. Reasons for not using MITUN include lack of time, referral of patients to government facility, issues related to patient confidentiality and technical problems. Suggestions for making mobile phone based TB notification process user-friendly included reducing call duration, including only crucial questions and using missed call or SMS options. Conclusion The performance (feasibility and usefulness) of MITUN voice based system for TB notification in the present format was sub-optimal. Perceived problems, logistical and practical issues preclude scale–up of notification of TB by private practitioners. PMID:26376197

  18. [Study on medical service supply public-private partnership mode: based on the view of public economics].

    PubMed

    Dai, Yue; Sun, Hong; Zhou, Li

    2015-02-01

    Due to the quasi-public attributes of medical service, the supply mode and system could influence equity and fairness of general people's health. Based on the view of public economics, the purpose of this paper was to explain the economic nature of medical service supply. By analyzing the practice of public-private partnership (PPP) mode in medical care supply and the related public economic issues, we summarized the feasibility and risks of PPP model in Chinese medical care supply market. Finally, we discussed the innovative medical service system provided by government, public hospitals, and social capitals together. Therefore, to guarantee further development of this new medical service supply--PPP mode, we should pay attention to some practical problems, such as the share of cooperation cost and the balance between the benefit and risk among all partners.

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

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

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

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

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

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

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

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

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

  8. Evidence-based practice implementation: The impact of public versus private sector organization type on organizational support, provider attitudes, and adoption of evidence-based practice

    PubMed Central

    2009-01-01

    Background The goal of this study is to extend research on evidence-based practice (EBP) implementation by examining the impact of organizational type (public versus private) and organizational support for EBP on provider attitudes toward EBP and EBP use. Both organization theory and theory of innovation uptake and individual adoption of EBP guide the approach and analyses in this study. We anticipated that private sector organizations would provide greater levels of organizational support for EBPs leading to more positive provider attitudes towards EBPs and EBP use. We also expected attitudes toward EBPs to mediate the association of organizational support and EBP use. Methods Participants were mental health service providers from 17 communities in 16 states in the United States (n = 170). Path analyses were conducted to compare three theoretical models of the impact of organization type on organizational support for EBP and of organizational support on provider attitudes toward EBP and EBP use. Results Consistent with our predictions, private agencies provided greater support for EBP implementation, and staff working for private agencies reported more positive attitudes toward adopting EBPs. Organizational support for EBP partially mediated the association of organization type on provider attitudes toward EBP. Organizational support was significantly positively associated with attitudes toward EBP and EBP use in practice. Conclusion This study offers further support for the importance of organizational context as an influence on organizational support for EBP and provider attitudes toward adopting EBP. The study demonstrates the role organizational support in provider use of EBP in practice. This study also suggests that organizational support for innovation is a malleable factor in supporting use of EBP. Greater attention should be paid to organizational influences that can facilitate the dissemination and implementation of EBPs in community settings. PMID

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

    PubMed

    Karakaya, Murat

    2013-01-01

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

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

    PubMed Central

    2013-01-01

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

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

  12. Effectiveness of a workplace-based intervention program to promote mental health among employees in privately owned enterprises in China.

    PubMed

    Sun, Jing; Buys, Nicholas; Wang, Xinchao

    2013-12-01

    This study aims to examine the effectiveness of a workplace-based intervention program to improve mental health, work ability, and work productivity in privately owned enterprises in China. A prospective cohort intervention study design was employed in which the intervention program was implemented for 30 months (from July 2009 to December 2012). Nine privately owned retail enterprises in China participated in the intervention study. Researchers administered a self-report survey to 2768 employees. The research team measured participants' job stress, resilience, work ability, absenteeism, depression, and work performance. A comprehensive Health Promotion Enterprise Program was implemented that entailed the following components: policies to support a healthy work environment, psychosocial interventions to promote mental health, provision of health services to people with mental illness, and professional skills training to deal with stress and build resilience. Analysis of variance was used to examine preintervention versus postintervention differences in stress, resilience, and work ability. Logistic regression was used to examine absenteeism related to depression. The results suggest that the intervention program was effective at improving participants' ability to work, their sense of control over their jobs, and, in particular, their ability to meet the mental demands of work. The intervention program also reduced participants' job stress levels and reduced the probability of absenteeism related to depression. The intervention programs incorporating both individual-level and organizational-level factors to promote mental health were effective and have implications for both practice and policy regarding enterprises taking more responsibility for the provision of mental health services to their employees.

  13. Private Stimuli, Covert Responses, and Private Events: Conceptual Remarks

    PubMed Central

    Tourinho, Emmanuel Zagury

    2006-01-01

    In this article, I discuss the concepts of private stimuli, covert responses, and private events, emphasizing three aspects: the conditions under which private stimuli may acquire discriminative functions to verbal responses, the conditions of unobservability of covert responses, and the complexity of events or phenomena described as private. I argue that the role of private stimuli in the control of self-descriptive verbal responses is dependent on a relation (correlation or equivalence relation) with public stimuli, and that responses vary along a continuum of observability. These remarks on private stimuli and covert responses are introductory to an examination of the varying complexity of phenomena described as private. I argue that private events is a verbal response emitted under the control of phenomena of different degrees of complexity, and I interpret these phenomena, based on the principle of selection by consequences. I introduce the notion of inclusiveness to suggest that some phenomena related to privacy are less or more complex as they include relations of a phylogenetic, ontogenetic, and cultural origin. PMID:22478451

  14. Towards subsidized malaria rapid diagnostic tests. Lessons learned from programmes to subsidise artemisinin-based combination therapies in the private sector: a review

    PubMed Central

    Lussiana, Cristina

    2016-01-01

    The idea of a private sector subsidy programme of artemisinin-based combination therapies (ACTs) was first proposed in 2004. Since then, several countries around the world have hosted pilot projects or programmes on subsidized ACTs and/or the Affordable Medicines Facility-malaria programme (AMFm). Overall the private sector subsidy programmes of ACTs have been effective in increasing availability of ACTs in the private sector and driving down average prices but struggled to crowd out antimalarial monotherapies. The results obtained from this ambitious strategy should inform policy makers in the designing of future interventions aimed to control malaria morbidity and mortality. Among the interventions recently proposed, a subsidy of rapid diagnostic tests (RDTs) in the private sector has been recommended by governments and international donors to cope with over-treatment with ACTs and to delay the emergence of resistance to artemisinin. In order to improve the cost-effectiveness of co-paid RDTs, we should build on the lessons we learned from almost 10 years of private sector subsidy programmes of ACTs in malaria-endemic countries. PMID:25862732

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

  16. Performance-Based Contracting in Residential Care and Treatment: Driving Policy and Practice Change through Public-Private Partnership in Illinois

    ERIC Educational Resources Information Center

    Kearney, Kathleen A.; McEwen, Erwin; Bloom-Ellis, Brice; Jordan, Neil

    2010-01-01

    The National Quality Improvement Center on the Privatization of Child Welfare Services selected Illinois as a demonstration site in 2007 to evaluate performance-based contracting in residential treatment services. This article discusses the first two years of project implementation including developing residential treatment performance indicators,…

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

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

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

  20. Fast Query-Optimized Kernel-Machine Classification

    NASA Technical Reports Server (NTRS)

    Mazzoni, Dominic; DeCoste, Dennis

    2004-01-01

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

  1. Private forest landowner willingness, community impacts and concerns, and the development of a wood-based biofuels industry

    NASA Astrophysics Data System (ADS)

    Larson, Eric C.

    The technical/economic aspects of using wood-based biomass as an alternative source of fuel have been well represented in current academic literature. However, currently very few studies have examined the concerns of private forest landowners (PFLs) and communities toward increased harvesting rates to support a wood-based biofuels industry. Further, few studies have tried to study or to determine what factors might impact such willingness. The absence of studies that focus on understanding PFLs and community concerns as well as PFLs willingness to participate in harvesting biofuels for energy is in part traceable to two basic, but untested, assumptions regarding communities and forest landowners: (1) PFLs are able and willing to participate in the production of raw materials with few obstacles; and (2) they will make the transition because of the opportunity to increase profits. While the technical/economic aspects are clearly important, little attention has been paid to those social and cultural factors that may impact the viability of such activity. To address this issue, the present study focused on three questions. (1) What are the opportunities and concerns of PFLs, communities, residents, and existing wood-based industries regarding the development of a wood-based biofuel industry? (2) Will PFLs be willing to harvest raw materials for a wood-based biofuel industry? (2a) What sociocultural and sociodemographic dimensions influence PFLs' willingness to harvest raw materials for a wood-based biofuel industry? Data was collected using a mixed methods approach including using secondary data, key informant interviews and a phone survey of both the general public and PFLs in the Eastern forest region.

  2. [Impact of demographic chance on pharmaceutical expenses in private health insurance--a scenario-based analysis].

    PubMed

    Böcking, W; Tidelski, O; Skuras, B; Bäumler, A; Kitzmann, F

    2012-08-01

    Health Insurance costs in Germany have grown constantly over the last years. This increase of costs is not only observable in the total consideration but also in all single items. An outstanding growth rate exists in the field of pharmaceutical expenses. Detailed analyses of distribution and development of these costs, separated by age and indication groups, are currently only sporadically available and mostly focusing on the Statutory Health Insurance system in Germany. This research article is based on an initial data analysis and focuses on the question how pharmaceutical expenses in a German private health insurance company will develop until the year 2050, if the observed trend of the past years continues in the same way. This analysis focuses on different age groups. The objective is the demonstration of several scenarios, which illustrate the level of influence of different parameters (demographic changes, developments of prices for pharmaceuticals). Based on the cognition of certain effects measures for handling the growing challenge of financing the health system can be deduced. As a result, both demographic changes and price effects have an significant impact on the future development of per capita pharmaceutical expenses. Whereas older age groups will still cause the highest costs, the middle-aged people will show the highest growth rates. This strong cost increase is not sustainable for the German health insurance system. In addition to previous measures of a regulatory health policy (especially improved cost-benefit-assessments) the article shows new approaches for an intensified prevention and health promotion.

  3. Is School-Based Height and Weight Screening of Elementary Students Private and Reliable?

    ERIC Educational Resources Information Center

    Stoddard, Sarah A.; Kubik, Martha Y.; Skay, Carol

    2008-01-01

    The Institute of Medicine recommends school-based body mass index (BMI) screening as an obesity prevention strategy. While school nurses have provided height/weight screening for years, little has been published describing measurement reliability or process. This study evaluated the reliability of height/weight measures collected by school nurses…

  4. Environmental Assessment: Military Housing Privatization Initiative, Los Angeles Air Force Base, California

    DTIC Science & Technology

    2006-11-01

    California ground squirrel (USAF 2001). Bat species and monarch butterflies may use buildings in urban areas for roosting, but this is not likely to be...near the base. Table 5. Sensitive Species Species Status Terrestrial Invertebrates Monarch butterfly (Danaus plexippus) Species of local concern...Palos Verdes blue butterfly (Glaucopsyche lygdamus palosverdesensis) Federally listed as endangered Reptiles San Diego horned lizard (Phrynosoma

  5. Managing and Querying Image Annotation and Markup in XML

    PubMed Central

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

    2010-01-01

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

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

    SciTech Connect

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

    2015-07-01

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

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

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

    PubMed

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

    2010-01-01

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

  9. Towards improved knowledge sharing: assessment of the HL7 Reference Information Model to support medical logic module queries.

    PubMed

    Jenders, R A; Sujansky, W; Broverman, C A; Chadwick, M

    1997-01-01

    Because clinical databases vary in structure, access methods and vocabulary used to represent data, the Arden Syntax does not define a standard model for querying databases. Consequently, database queries are encoded in ad hoc ways and enclosed in "curly braces" in Medical Logic Modules (MLMs). However, the nonstandard representation of queries impairs sharing of MLMs, an impediment that has come to be known as the "curly braces problem." As a first step in solving this problem, we evaluated the proposed HL7 Reference Information Model (RIM) as a foundation for a standard query model for the Arden Syntax. Specifically, we analyzed the MLM knowledge base at the Columbia-Presbyterian Medical Center and compared the queries in these MLMs to the RIM. We studied 488 queries in 104 MLMs, identifying 674 total query data elements. Laboratory tests accounted for 45.8% of these elements, while demographic and ADT data accounted for 37.6%. Pharmacy orders accounted for 10.5%, medical problems for 4.3% and MLM output messages for 1.6%. We found that the RIM encompasses all but those data elements signifying MLM output (1.6% of the total). We conclude that the majority of queries in the CPMC knowledge base access a relatively small set of data elements and that the RIM encompasses these elements. We propose extensions of this analysis to continue construction of an Arden query model capable of solving the "curly braces problem."

  10. Environmental Assessment Military Housing Privatization Initiative at Beale Air Force Base, California

    DTIC Science & Technology

    2005-06-01

    with a collection of information if it does not display a currently valid OMB control number . 1. REPORT DATE JUN 2005 2. REPORT TYPE 3. DATES COVERED...turkey, California quail, acorn woodpecker, scrub jay, deer, and California ground squirrels. 9 Oak foliage and bark support insect populations ...basing issued in March 2004 by the 4 California Regional Water Quality Control Board (CRWQCB), Central Valley Region. 5 During the rainy season

  11. Private Information Retrieval Techniques for Enabling Location Privacy in Location-Based Services

    NASA Astrophysics Data System (ADS)

    Khoshgozaran, Ali; Shahabi, Cyrus

    The ubiquity of smartphones and other location-aware hand-held devices has resulted in a dramatic increase in popularity of location-based services (LBS) tailored to user locations. The comfort of LBS comes with a privacy cost. Various distressing privacy violations caused by sharing sensitive location information with potentially malicious services have highlighted the importance of location privacy research aiming to protect user privacy while interacting with LBS.

  12. Environmental Assessment: Proposed U.S. Air Force Military Family Housing Privatization Initiative Patrick Air Force Base, Florida

    DTIC Science & Technology

    2008-11-03

    original terms of the privatization of South Housing included the demolition of the remaining 304 Legacy units, as well as building additional housing...terms of the privatization of South Housing included the demolition of the remaining 304 Legacy units, as well as building additional housing units...remaining 303 Legacy units, as well as building additional housing units so the total in South Housing would equal 552 housing units. Legacy homes arc

  13. Final Environmental Assessment of Military Housing Privatization Barksdale Air Force Base, Louisiana

    DTIC Science & Technology

    2006-01-01

    calcareous forest also occurs east of Bodcau Road, just north of the East Reservation housing complex. Nutmeg Woods NA – This area is a wet-mesic...calcareous forest along the northern boundary of the base, west of Flag Lake. The site is named for the numerous nutmeg hickories (uncommon in Louisiana...03-8601-0022 AUSTIN POND NUTMEG WOODS EA ST R ESE R VATIO N H O U SIN G FL A G LA KE PO INT NORTH RED CHUTE B LU FF S Heritage Heights New Heritage

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

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

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

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

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

  19. Cryptanalysis and Improvement for the Quantum Private Comparison Protocol Based on Triplet Entangled State and Single-Particle Measurement

    NASA Astrophysics Data System (ADS)

    Ting, Xu; Tian-Yu, Ye

    2017-03-01

    Quantum private comparison (QPC) aims to accomplish the equality comparison of secret inputs from two users on the basis of not leaking their contents out. Recently, Chen et al. proposed the QPC protocol based on triplet GHZ state and single-particle measurement (Optics Communications 283, 1561-1565 (2010)). In this paper, they suggested the standard model of a semi-honest third party (TP) for the first time, and declared that their protocol is secure. Subsequently, Lin et al. pointed out that in Chen et al.'s protocol, one user can extract the other user's secret without being discovered by performing the intercept-resend attack, and suggested two corresponding improvements (Optics Communications 284, 2412-2414 (2011)). However, Yang et al. first pointed out that the model of TP adopted by both Chen et al.'s protocol and Lin et al.'s improved protocols is unreasonable, and thought that a practical TP may also try any possible means to steal the users' secrets except being corrupted by the adversary including the dishonest user (Quantum Inf Process 12, 877-885 (2013). In this paper, after taking the possible attacks from TP into account, we propose the eavesdropping strategy of TP toward Lin et al.'s improved protocols and suggest two feasible solutions accordingly.

  20. Comparative Analysis of Online Health Queries Originating From Personal Computers and Smart Devices on a Consumer Health Information Portal

    PubMed Central

    Jadhav, Ashutosh; Andrews, Donna; Fiksdal, Alexander; Kumbamu, Ashok; McCormick, Jennifer B; Misitano, Andrew; Nelsen, Laurie; Ryu, Euijung; Sheth, Amit; Wu, Stephen

    2014-01-01

    Background The number of people using the Internet and mobile/smart devices for health information seeking is increasing rapidly. Although the user experience for online health information seeking varies with the device used, for example, smart devices (SDs) like smartphones/tablets versus personal computers (PCs) like desktops/laptops, very few studies have investigated how online health information seeking behavior (OHISB) may differ by device. Objective The objective of this study is to examine differences in OHISB between PCs and SDs through a comparative analysis of large-scale health search queries submitted through Web search engines from both types of devices. Methods Using the Web analytics tool, IBM NetInsight OnDemand, and based on the type of devices used (PCs or SDs), we obtained the most frequent health search queries between June 2011 and May 2013 that were submitted on Web search engines and directed users to the Mayo Clinic’s consumer health information website. We performed analyses on “Queries with considering repetition counts (QwR)” and “Queries without considering repetition counts (QwoR)”. The dataset contains (1) 2.74 million and 3.94 million QwoR, respectively for PCs and SDs, and (2) more than 100 million QwR for both PCs and SDs. We analyzed structural properties of the queries (length of the search queries, usage of query operators and special characters in health queries), types of search queries (keyword-based, wh-questions, yes/no questions), categorization of the queries based on health categories and information mentioned in the queries (gender, age-groups, temporal references), misspellings in the health queries, and the linguistic structure of the health queries. Results Query strings used for health information searching via PCs and SDs differ by almost 50%. The most searched health categories are “Symptoms” (1 in 3 search queries), “Causes”, and “Treatments & Drugs”. The distribution of search queries for

  1. Design of an Algorithm to Translate Nested Relational Algebra Queries to GENESIS Trace Manager Commands

    DTIC Science & Technology

    1987-12-01

    The pre-processing step is based on the pre-processing described in Ceri and Gottlob [3]. This step uses set-theory transformations to convert the... Gottlob [3]. The meaning evaluation step converts the query expressions produced by the pre-processing step into nested relational algebra expressions. The...07. 3. S. Ceri and G. Gottlob . Translating SQL into Relational Algebra Optimization, Semantics, and Equivalence of SQL Queries. In IEEE Transactions

  2. All-optical virtual private network system in OFDM based long-reach PON using RSOA re-modulation technique

    NASA Astrophysics Data System (ADS)

    Kim, Chang-Hun; Jung, Sang-Min; Kang, Su-Min; Han, Sang-Kook

    2015-01-01

    We propose an all-optical virtual private network (VPN) system in an orthogonal frequency division multiplexing (OFDM) based long reach PON (LR-PON). In the optical access network field, technologies based on fundamental upstream (U/S) and downstream (D/S) have been actively researched to accommodate explosion of data capacity. However, data transmission among the end users which is arisen from cloud computing, file-sharing and interactive game takes a large weight inside of internet traffic. Moreover, this traffic is predicted to increase more if Internet of Things (IoT) services are activated. In a conventional PON, VPN data is transmitted through ONU-OLT-ONU via U/S and D/S carriers. It leads to waste of bandwidth and energy due to O-E-O conversion in the OLT and round-trip propagation between OLT and remote node (RN). Also, it causes inevitable load to the OLT for electrical buffer, scheduling and routing. The network inefficiency becomes more critical in a LR-PON which has been researched as an effort to reduce CAPEX and OPEX through metro-access consolidation. In the proposed system, the VPN data is separated from conventional U/S and re-modulated on the D/S carrier by using RSOA in the ONUs to avoid bandwidth consumption of U/S and D/S unlike in previously reported system. Moreover, the transmitted VPN data is re-directed to the ONUs by wavelength selective reflector device in the RN without passing through the OLT. Experimental demonstration for the VPN communication system in an OFDM based LR-PON has been verified.

  3. Web-Based Learning for Cultural Heritage: First Experienced with Students of the Private University of Technology in Northern Taiwan

    NASA Astrophysics Data System (ADS)

    Yen, Y.-N.; Wu, Y.-W.; Weng, K.-H.

    2013-07-01

    E-learning assisted teaching and learning is the trend of the 21st century and has many advantages - freedom from the constraints of time and space, hypertext and multimedia rich resources - enhancing the interaction between students and the teaching materials. The purpose of this study is to explore how rich Internet resources assisted students with the Western Architectural History course. First, we explored the Internet resources which could assist teaching and learning activities. Second, according to course objectives, we built a web-based platform which integrated the Google spreadsheets form, SIMILE widget, Wikipedia and the Google Maps and applied it to the course of Western Architectural History. Finally, action research was applied to understanding the effectiveness of this teaching/learning mode. Participants were the students of the Department of Architecture in the Private University of Technology in northern Taiwan. Results showed that students were willing to use the web-based platform to assist their learning. They found this platform to be useful in understanding the relationship between different periods of buildings. Through the view of the map mode, this platform also helped students expand their international perspective. However, we found that the information shared by students via the Internet were not completely correct. One possible reason was that students could easily acquire information on Internet but they could not determine the correctness of the information. To conclude, this study found some useful and rich resources that could be well-integrated, from which we built a web-based platform to collect information and present this information in diverse modes to stimulate students' learning motivation. We recommend that future studies should consider hiring teaching assistants in order to ease the burden on teachers, and to assist in the maintenance of information quality.

  4. Web Search Queries Can Predict Stock Market Volumes

    PubMed Central

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

    2012-01-01

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

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

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

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

  8. Analysis of Performance Variation Using Query Expansion.

    ERIC Educational Resources Information Center

    Alemayehu, Nega

    2003-01-01

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

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

  10. A New Publicly Available Chemical Query Language, CSRML, to support Chemotype Representations for Application to Data-Mining and Modeling

    EPA Science Inventory

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

  11. Private Information and Insurance Rejections

    PubMed Central

    Hendren, Nathaniel

    2013-01-01

    Across a wide set of non-group insurance markets, applicants are rejected based on observable, often high-risk, characteristics. This paper argues that private information, held by the potential applicant pool, explains rejections. I formulate this argument by developing and testing a model in which agents may have private information about their risk. I first derive a new no-trade result that theoretically explains how private information could cause rejections. I then develop a new empirical methodology to test whether this no-trade condition can explain rejections. The methodology uses subjective probability elicitations as noisy measures of agents beliefs. I apply this approach to three non-group markets: long-term care, disability, and life insurance. Consistent with the predictions of the theory, in all three settings I find significant amounts of private information held by those who would be rejected; I find generally more private information for those who would be rejected relative to those who can purchase insurance; and I show it is enough private information to explain a complete absence of trade for those who would be rejected. The results suggest private information prevents the existence of large segments of these three major insurance markets. PMID:24187381

  12. Privatization and Education

    ERIC Educational Resources Information Center

    Dash, Neena

    2009-01-01

    This paper highlights emerging trends, programmes and policies in privatization of education in Western countries. These trends are educational vouchers, choice of private schools, private school liberalization, private contracting of specific services, tuition tax credits and deductions for parents ,subsidies and assistance grants to private…

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

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

    PubMed Central

    Jung, HaRim; Kim, Ung-Mo

    2014-01-01

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

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

  16. The Maine Vernal Pool Mapping and Assessment Program: engaging municipal officials and private landowners in community-based citizen science.

    PubMed

    Jansujwicz, Jessica S; Calhoun, Aram J K; Lilieholm, Robert J

    2013-12-01

    The Vernal Pool Mapping and Assessment Program (VPMAP) was initiated in 2007 to create a vernal pool database as a planning tool to foster local compliance with new state vernal pool regulations. In the northeastern United States, vernal pools are seasonal wetlands that provide critical breeding habitat for a number of amphibians and invertebrates and provide important resting and foraging habitat for some rare and endangered state-listed species. Using participant observation, interviews, and focus groups, we examined the engagement of municipal officials and private landowners in VPMAP. Important outcomes of municipal and landowner engagement included mobilization of town support for proactive planning, improved awareness and understanding of vernal pools, and increased interactions between program coordinators, municipal officials, and private landowners. Challenges to municipal and landowner engagement included an inconsistency in expectations between coordinators and municipal officials and a lack of time and sufficient information for follow-up with landowners participating in VPMAP. Our study highlights the importance of developing relationships among coordinators, municipal officials, and private landowners in facilitating positive outcomes for all stakeholders and for effective resource management. We suggest an expanded citizen science model that focuses on improving two-way communication among project coordinators, municipal officials, and local citizens and places communication with private landowners on par with volunteer citizen scientist recruitment and field training. Lessons learned from this research can inform the design and implementation of citizen science projects on private land.

  17. The Maine Vernal Pool Mapping and Assessment Program: Engaging Municipal Officials and Private Landowners in Community-Based Citizen Science

    NASA Astrophysics Data System (ADS)

    Jansujwicz, Jessica S.; Calhoun, Aram J. K.; Lilieholm, Robert J.

    2013-12-01

    The Vernal Pool Mapping and Assessment Program (VPMAP) was initiated in 2007 to create a vernal pool database as a planning tool to foster local compliance with new state vernal pool regulations. In the northeastern United States, vernal pools are seasonal wetlands that provide critical breeding habitat for a number of amphibians and invertebrates and provide important resting and foraging habitat for some rare and endangered state-listed species. Using participant observation, interviews, and focus groups, we examined the engagement of municipal officials and private landowners in VPMAP. Important outcomes of municipal and landowner engagement included mobilization of town support for proactive planning, improved awareness and understanding of vernal pools, and increased interactions between program coordinators, municipal officials, and private landowners. Challenges to municipal and landowner engagement included an inconsistency in expectations between coordinators and municipal officials and a lack of time and sufficient information for follow-up with landowners participating in VPMAP. Our study highlights the importance of developing relationships among coordinators, municipal officials, and private landowners in facilitating positive outcomes for all stakeholders and for effective resource management. We suggest an expanded citizen science model that focuses on improving two-way communication among project coordinators, municipal officials, and local citizens and places communication with private landowners on par with volunteer citizen scientist recruitment and field training. Lessons learned from this research can inform the design and implementation of citizen science projects on private land.

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

  19. Mobile Virtual Private Networking

    NASA Astrophysics Data System (ADS)

    Pulkkis, Göran; Grahn, Kaj; Mårtens, Mathias; Mattsson, Jonny

    Mobile Virtual Private Networking (VPN) solutions based on the Internet Security Protocol (IPSec), Transport Layer Security/Secure Socket Layer (SSL/TLS), Secure Shell (SSH), 3G/GPRS cellular networks, Mobile IP, and the presently experimental Host Identity Protocol (HIP) are described, compared and evaluated. Mobile VPN solutions based on HIP are recommended for future networking because of superior processing efficiency and network capacity demand features. Mobile VPN implementation issues associated with the IP protocol versions IPv4 and IPv6 are also evaluated. Mobile VPN implementation experiences are presented and discussed.

  20. 77 FR 30351 - Sec. 221 Public Private Partnerships Public Meeting

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-05-22

    ... Federal Aviation Administration Sec. 221 Public Private Partnerships Public Meeting AGENCY: Federal... such a program be based on public- private partnership (PPP) principles and maximize the use of private... effective public-private partnership equipage incentive program. This notice is for the initial meeting....

  1. Is contracting a form of privatization?

    PubMed Central

    Perrot, Jean

    2006-01-01

    Contracting is often seen as a form of privatization, with contracts functioning as the tool that makes privatization possible. But contracting is also viewed by some as a means for the private sector to expand in a covert way its presence within the health sector. This article discusses the wider meaning of the term privatization in the health sector and the ways in which it is achieved. Privatization is seen here not simply as an action that leads to a new situation but also as one that leads to a change in behaviour. It is proposed that privatization may be assessed by looking at the ownership, management, and mission or objectives of the entity being privatized. Discussed also is the use of contracting by the state as a tool for state interventionism that is not based on authoritarian regulation. PMID:17143466

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

  3. Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval

    NASA Astrophysics Data System (ADS)

    Wang, Yang; Lin, Xuemin; Wu, Lin; Zhang, Wenjie

    2017-03-01

    Given a query photo issued by a user (q-user), the landmark retrieval is to return a set of photos with their landmarks similar to those of the query, while the existing studies on the landmark retrieval focus on exploiting geometries of landmarks for similarity matches between candidate photos and a query photo. We observe that the same landmarks provided by different users over social media community may convey different geometry information depending on the viewpoints and/or angles, and may subsequently yield very different results. In fact, dealing with the landmarks with \\illshapes caused by the photography of q-users is often nontrivial and has seldom been studied. In this paper we propose a novel framework, namely multi-query expansions, to retrieve semantically robust landmarks by two steps. Firstly, we identify the top-$k$ photos regarding the latent topics of a query landmark to construct multi-query set so as to remedy its possible \\illshape. For this purpose, we significantly extend the techniques of Latent Dirichlet Allocation. Then, motivated by the typical \\emph{collaborative filtering} methods, we propose to learn a \\emph{collaborative} deep networks based semantically, nonlinear and high-level features over the latent factor for landmark photo as the training set, which is formed by matrix factorization over \\emph{collaborative} user-photo matrix regarding the multi-query set. The learned deep network is further applied to generate the features for all the other photos, meanwhile resulting into a compact multi-query set within such space. Extensive experiments are conducted on real-world social media data with both landmark photos together with their user information to show the superior performance over the existing methods.

  4. Training America’s Work Force: A Private Sector Base Line and Its Impact on National Security

    DTIC Science & Technology

    1993-04-01

    Child Care Human Services Receptionist Chiropractic Assistant Illustrator Recording Specialist Civil Engineering Technician Import/Export Specialist...Engraver Office Machine Reao Air Conditioning/Heating/Ventilation Environmental Health Ophthalmic Dispensing and Optical Animal Trainer Equine Studies...Building Maintenance Technician Home Health Care Aide Private Security/Investigations/ Business Administration Horsemanship Specialist Corrections

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

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

  7. QuIN: A Web Server for Querying and Visualizing Chromatin Interaction Networks

    PubMed Central

    Thibodeau, Asa; Márquez, Eladio J.; Luo, Oscar; Ruan, Yijun; Shin, Dong-Guk; Stitzel, Michael L.; Ucar, Duygu

    2016-01-01

    Recent studies of the human genome have indicated that regulatory elements (e.g. promoters and enhancers) at distal genomic locations can interact with each other via chromatin folding and affect gene expression levels. Genomic technologies for mapping interactions between DNA regions, e.g., ChIA-PET and HiC, can generate genome-wide maps of interactions between regulatory elements. These interaction datasets are important resources to infer distal gene targets of non-coding regulatory elements and to facilitate prioritization of critical loci for important cellular functions. With the increasing diversity and complexity of genomic information and public ontologies, making sense of these datasets demands integrative and easy-to-use software tools. Moreover, network representation of chromatin interaction maps enables effective data visualization, integration, and mining. Currently, there is no software that can take full advantage of network theory approaches for the analysis of chromatin interaction datasets. To fill this gap, we developed a web-based application, QuIN, which enables: 1) building and visualizing chromatin interaction networks, 2) annotating networks with user-provided private and publicly available functional genomics and interaction datasets, 3) querying network components based on gene name or chromosome location, and 4) utilizing network based measures to identify and prioritize critical regulatory targets and their direct and indirect interactions. AVAILABILITY: QuIN’s web server is available at http://quin.jax.org QuIN is developed in Java and JavaScript, utilizing an Apache Tomcat web server and MySQL database and the source code is available under the GPLV3 license available on GitHub: https://github.com/UcarLab/QuIN/. PMID:27336171

  8. Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval.

    PubMed

    Wang, Yang; Lin, Xuemin; Wu, Lin; Zhang, Wenjie

    2017-03-01

    Given a query photo issued by a user (q-user), the landmark retrieval is to return a set of photos with their landmarks similar to those of the query, while the existing studies on the landmark retrieval focus on exploiting geometries of landmarks for similarity matches between candidate photos and a query photo. We observe that the same landmarks provided by different users over social media community may convey different geometry information depending on the viewpoints and/or angles, and may, subsequently, yield very different results. In fact, dealing with the landmarks with low quality shapes caused by the photography of q-users is often nontrivial and has seldom been studied. In this paper, we propose a novel framework, namely, multi-query expansions, to retrieve semantically robust landmarks by two steps. First, we identify the top- k photos regarding the latent topics of a query landmark to construct multi-query set so as to remedy its possible low quality shape. For this purpose, we significantly extend the techniques of Latent Dirichlet Allocation. Then, motivated by the typical collaborative filtering methods, we propose to learn a collaborative deep networks-based semantically, nonlinear, and high-level features over the latent factor for landmark photo as the training set, which is formed by matrix factorization over collaborative user-photo matrix regarding the multi-query set. The learned deep network is further applied to generate the features for all the other photos, meanwhile resulting into a compact multi-query set within such space. Then, the final ranking scores are calculated over the high-level feature space between the multi-query set and all other photos, which are ranked to serve as the final ranking list of landmark retrieval. Extensive experiments are conducted on real-world social media data with both landmark photos together with their user information to show the superior performance over the existing methods, especially our recently

  9. Effective Filtering of Query Results on Updated User Behavioral Profiles in Web Mining.

    PubMed

    Sadesh, S; Suganthe, R C

    2015-01-01

    Web with tremendous volume of information retrieves result for user related queries. With the rapid growth of web page recommendation, results retrieved based on data mining techniques did not offer higher performance filtering rate because relationships between user profile and queries were not analyzed in an extensive manner. At the same time, existing user profile based prediction in web data mining is not exhaustive in producing personalized result rate. To improve the query result rate on dynamics of user behavior over time, Hamilton Filtered Regime Switching User Query Probability (HFRS-UQP) framework is proposed. HFRS-UQP framework is split into two processes, where filtering and switching are carried out. The data mining based filtering in our research work uses the Hamilton Filtering framework to filter user result based on personalized information on automatic updated profiles through search engine. Maximized result is fetched, that is, filtered out with respect to user behavior profiles. The switching performs accurate filtering updated profiles using regime switching. The updating in profile change (i.e., switches) regime in HFRS-UQP framework identifies the second- and higher-order association of query result on the updated profiles. Experiment is conducted on factors such as personalized information search retrieval rate, filtering efficiency, and precision ratio.

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

  11. Improve Performance of Data Warehouse by Query Cache

    NASA Astrophysics Data System (ADS)

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

    2010-11-01

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

  12. Advanced Query and Data Mining Capabilities for MaROS

    NASA Technical Reports Server (NTRS)

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

    2013-01-01

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

  13. Privatization in Education.

    ERIC Educational Resources Information Center

    Rehfuss, John

    1995-01-01

    Privatization calls for substantially trimming the scope and breadth of government services, replacing them with private or other nongovernmental operators. The attraction of privatization is reduced costs and increased management flexibility. To date, the arrangement has received substantial support from students and parents in situations that…

  14. Privacy-Aware Relevant Data Access with Semantically Enriched Search Queries for Untrusted Cloud Storage Services.

    PubMed

    Pervez, Zeeshan; Ahmad, Mahmood; Khattak, Asad Masood; Lee, Sungyoung; Chung, Tae Choong

    2016-01-01

    Privacy-aware search of outsourced data ensures relevant data access in the untrusted domain of a public cloud service provider. Subscriber of a public cloud storage service can determine the presence or absence of a particular keyword by submitting search query in the form of a trapdoor. However, these trapdoor-based search queries are limited in functionality and cannot be used to identify secure outsourced data which contains semantically equivalent information. In addition, trapdoor-based methodologies are confined to pre-defined trapdoors and prevent subscribers from searching outsourced data with arbitrarily defined search criteria. To solve the problem of relevant data access, we have proposed an index-based privacy-aware search methodology that ensures semantic retrieval of data from an untrusted domain. This method ensures oblivious execution of a search query and leverages authorized subscribers to model conjunctive search queries without relying on predefined trapdoors. A security analysis of our proposed methodology shows that, in a conspired attack, unauthorized subscribers and untrusted cloud service providers cannot deduce any information that can lead to the potential loss of data privacy. A computational time analysis on commodity hardware demonstrates that our proposed methodology requires moderate computational resources to model a privacy-aware search query and for its oblivious evaluation on a cloud service provider.

  15. Privacy-Aware Relevant Data Access with Semantically Enriched Search Queries for Untrusted Cloud Storage Services

    PubMed Central

    Pervez, Zeeshan; Ahmad, Mahmood; Khattak, Asad Masood; Lee, Sungyoung; Chung, Tae Choong

    2016-01-01

    Privacy-aware search of outsourced data ensures relevant data access in the untrusted domain of a public cloud service provider. Subscriber of a public cloud storage service can determine the presence or absence of a particular keyword by submitting search query in the form of a trapdoor. However, these trapdoor-based search queries are limited in functionality and cannot be used to identify secure outsourced data which contains semantically equivalent information. In addition, trapdoor-based methodologies are confined to pre-defined trapdoors and prevent subscribers from searching outsourced data with arbitrarily defined search criteria. To solve the problem of relevant data access, we have proposed an index-based privacy-aware search methodology that ensures semantic retrieval of data from an untrusted domain. This method ensures oblivious execution of a search query and leverages authorized subscribers to model conjunctive search queries without relying on predefined trapdoors. A security analysis of our proposed methodology shows that, in a conspired attack, unauthorized subscribers and untrusted cloud service providers cannot deduce any information that can lead to the potential loss of data privacy. A computational time analysis on commodity hardware demonstrates that our proposed methodology requires moderate computational resources to model a privacy-aware search query and for its oblivious evaluation on a cloud service provider. PMID:27571421

  16. Setting Up Private Practice in Psychiatry*

    PubMed Central

    De Sousa, Alan; De Sousa, Avinash

    2015-01-01

    Setting up a private practice in Mumbai is an onerous task. The present paper looks at the difficulties face by young psychiatrists when starting a private practice in psychiatry. It suggests certain guidelines to be followed to ensure the development of a successful practice. It also suggests methods to gain popularity among patients and society along with the ethics to be followed, knowledge base to be garnered, and the role of using multiple therapies and versatility in private practice. PMID:25838718

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

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

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

  20. Using relevant regions in image search and query refinement for medical CBIR

    NASA Astrophysics Data System (ADS)

    Kim, Edward; Antani, Sameer; Huang, Xiaolei; Long, L. Rodney; Demner-Fushman, Dina

    2011-03-01

    In clinical decision processes, relevant scientific publications and their associated medical images can provide valuable and insightful information. However, effectively searching through both text and image data is a difficult and arduous task. More specifically in the area of image search, finding similar images (or regions within images) poses another significant hurdle for effective knowledge dissemination. Thus, we propose a method using local regions within images to perform and refine medical image retrieval. In our first example, we define and extract large, characteristic regions within an image, and then show how to use these regions to match a query image to similar content. In our second example, we enable the formulation of a mixed query based upon text, image, and region information, to better represent the end user's search intentions. Given our new framework for region-based queries, we present an improved set of similar search results.

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

  2. Ambulatory care for HIV-infected patients: differences in outcomes between hospital-based units and private practices: analysis of the RESINA cohort

    PubMed Central

    2013-01-01

    Background The efficacy of highly active antiretroviral therapy (HAART) in the treatment of HIV infection is influenced by factors such as potency of applied drugs, adherence of the patient, and resistance-associated mutations. Up to now, there is insufficient data on the impact of the therapeutic setting. Methods Since 2001, the prospective multicenter RESINA study has examined the epidemiology of transmitted HIV drug resistance in Nordrhein-Westfalen, the largest federal state of Germany by population. Characteristics of patients treated in hospital-based outpatient units were compared to those of patients treated in medical practices. Longitudinal data of all participants are being followed in a cohort study. Results Overall, 1,591 patients were enrolled between 2001 and 2009 with follow-up until the end of 2010. Of these, 1,099 cases were treated in hospital-based units and 492 in private practices. Significant differences were found with respect to baseline characteristics. A higher rate of patients with advanced disease and non-European nationality were cared for in hospital units. Patients in medical practices were predominantly Caucasian men who have sex with men (MSM) harboring HIV-1 subtype B, with lower CDC stage and higher CD4 cell count. Median viral load was 68,828 c/mL in hospital-based units and 100,000 c/mL in private practices (P = 0.041). Only median age and rate of transmitted drug resistance were not significantly different. After 48 weeks, 81.9% of patients in hospital units and 85.9% in private practices had a viral load below the limit of detection (P = 0.12). A similar result was seen after 96 weeks (P = 0.54). Although the baseline CD4 cell count was different (189.5/μL in hospital units and 246.5/μL in private practices, P <0.001), a consistent and almost identical increase was determined in both groups. Conclusions The RESINA study covers a large HIV-infected patient cohort cared for in specialized facilities in Germany

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

  4. An Application of Multivariate Statistical Analysis for Query-Driven Visualization

    SciTech Connect

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

    2010-03-01

    Abstract?Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex datasets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates non-parametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they may be used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to datasets from two different scientific domains to demonstrate its broad applicability.

  5. Advances in nowcasting influenza-like illness rates using search query logs

    PubMed Central

    Lampos, Vasileios; Miller, Andrew C.; Crossan, Steve; Stefansen, Christian

    User-generated content can assist epidemiological surveillance in the early detection and prevalence estimation of infectious diseases, such as influenza. Google Flu Trends embodies the first public platform for transforming search queries to indications about the current state of flu in various places all over the world. However, the original model significantly mispredicted influenza-like illness rates in the US during the 2012–13 flu season. In this work, we build on the previous modeling attempt, proposing substantial improvements. Firstly, we investigate the performance of a widely used linear regularized regression solver, known as the Elastic Net. Then, we expand on this model by incorporating the queries selected by the Elastic Net into a nonlinear regression framework, based on a composite Gaussian Process. Finally, we augment the query-only predictions with an autoregressive model, injecting prior knowledge about the disease. We assess predictive performance using five consecutive flu seasons spanning from 2008 to 2013 and qualitatively explain certain shortcomings of the previous approach. Our results indicate that a nonlinear query modeling approach delivers the lowest cumulative nowcasting error, and also suggest that query information significantly improves autoregressive inferences, obtaining state-of-the-art performance. PMID:26234783

  6. Analytics-Driven Lossless Data Compression for Rapid In-situ Indexing, Storing, and Querying

    SciTech Connect

    Jenkins, John; Arkatkar, Isha; Lakshminarasimhan, Sriram; Shah, Neil; Schendel, Eric; Ethier, Stephane; Chang, C. S.; Chen, Jacqueline H; Kolla, Hemanth; Klasky, Scott A; Ross, Rob; Samatova, Nagiza F.

    2013-01-01

    The analysis of scientific simulations is highly data-intensive and is becoming an increasingly important challenge. Peta-scale data sets require the use of light-weight query-driven analysis methods, as opposed to heavy-weight schemes that optimize for speed at the expense of size. This paper is an attempt in the direction of query processing over losslessly compressed scientific data. We propose a co-designed double-precision compression and indexing methodology for range queries by performing unique-value-based binning on the most significant bytes of double precision data (sign, exponent, and most significant mantissa bits), and inverting the resulting metadata to produce an inverted index over a reduced data representation. Without the inverted index, our method matches or improves compression ratios over both general-purpose and floating-point compression utilities. The inverted index is light-weight, and the overall storage requirement for both reduced column and index is less than 135%, whereas existing DBMS technologies can require 200-400%. As a proof-of-concept, we evaluate univariate range queries that additionally return column values, a critical component of data analytics, against state-of-the-art bitmap indexing technology, showing multi-fold query performance improvements.

  7. Advances in nowcasting influenza-like illness rates using search query logs

    NASA Astrophysics Data System (ADS)

    Lampos, Vasileios; Miller, Andrew C.; Crossan, Steve; Stefansen, Christian

    2015-08-01

    User-generated content can assist epidemiological surveillance in the early detection and prevalence estimation of infectious diseases, such as influenza. Google Flu Trends embodies the first public platform for transforming search queries to indications about the current state of flu in various places all over the world. However, the original model significantly mispredicted influenza-like illness rates in the US during the 2012-13 flu season. In this work, we build on the previous modeling attempt, proposing substantial improvements. Firstly, we investigate the performance of a widely used linear regularized regression solver, known as the Elastic Net. Then, we expand on this model by incorporating the queries selected by the Elastic Net into a nonlinear regression framework, based on a composite Gaussian Process. Finally, we augment the query-only predictions with an autoregressive model, injecting prior knowledge about the disease. We assess predictive performance using five consecutive flu seasons spanning from 2008 to 2013 and qualitatively explain certain shortcomings of the previous approach. Our results indicate that a nonlinear query modeling approach delivers the lowest cumulative nowcasting error, and also suggest that query information significantly improves autoregressive inferences, obtaining state-of-the-art performance.

  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. Multicriteria approaches for a private equity fund

    NASA Astrophysics Data System (ADS)

    Tammer, Christiane; Tannert, Johannes

    2012-09-01

    We develop a new model for a Private Equity Fund based on stochastic differential equations. In order to find efficient strategies for the fund manager we formulate a multicriteria optimization problem for a Private Equity Fund. Using the e-constraint method we solve this multicriteria optimization problem. Furthermore, a genetic algorithm is applied in order to get an approximation of the efficient frontier.

  11. Private Schools Put Spotlight on Safety

    ERIC Educational Resources Information Center

    Zehr, Mary Ann

    2005-01-01

    Administrators and students at private schools tend to see their schools as safer than public schools. Spurred in part by the terrorist attacks of Sept. 11, 2001, many private schools have joined the national push to revamp campus safety plans. Kenneth S. Trump, the president of the Cleveland-based National School Safety and Security Services,…

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

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

  14. Web Image Re-Ranking UsingQuery-Specific Semantic Signatures.

    PubMed

    Wang, Xiaogang; Qiu, Shi; Liu, Ke; Tang, Xiaoou

    2014-04-01

    Image re-ranking, as an effective way to improve the results of web-based image search, has been adopted by current commercial search engines such as Bing and Google. Given a query keyword, a pool of images are first retrieved based on textual information. By asking the user to select a query image from the pool, the remaining images are re-ranked based on their visual similarities with the query image. A major challenge is that the similarities of visual features do not well correlate with images' semantic meanings which interpret users' search intention. Recently people proposed to match images in a semantic space which used attributes or reference classes closely related to the semantic meanings of images as basis. However, learning a universal visual semantic space to characterize highly diverse images from the web is difficult and inefficient. In this paper, we propose a novel image re-ranking framework, which automatically offline learns different semantic spaces for different query keywords. The visual features of images are projected into their related semantic spaces to get semantic signatures. At the online stage, images are re-ranked by comparing their semantic signatures obtained from the semantic space specified by the query keyword. The proposed query-specific semantic signatures significantly improve both the accuracy and efficiency of image re-ranking. The original visual features of thousands of dimensions can be projected to the semantic signatures as short as 25 dimensions. Experimental results show that 25-40 percent relative improvement has been achieved on re-ranking precisions compared with the state-of-the-art methods.

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

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

    NASA Astrophysics Data System (ADS)

    Wang, Song; Gupta, Chetan; Mehta, Abhay

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

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

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

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

  20. Importance of the texture features in a query from a spectral image database

    NASA Astrophysics Data System (ADS)

    Kohonen, Oili; Hauta-Kasari, Markku

    2006-01-01

    A new, semantically meaningful technique for querying the images from a spectral image database is proposed. The technique is based on the use of both color- and texture features. The color features are calculated from spectral images by using the Self-Organizing Map (SOM) when methods of Gray Level Co-occurrence Matrix (GLCM) and Local Binary Pattern (LBP) are used for constructing the texture features. The importance of texture features in a querying is seen in experimental results, which are given by using a real spectral image database. Also the differences between the results gained by the use of co-occurrence matrix and LBP are introduced.

  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. Reading a Critical Review of Evidence: Notes and Queries on Research Programmes in Environmental Education.

    ERIC Educational Resources Information Center

    Reid, Alan D.; Nikel, Jutta

    2003-01-01

    Explores the notion that a review communicates a research program and how it might extend and disrupt readings of Rickinson's (2001) review of the evidence base for environmental education learning. Investigates, through a series of notes and queries using Lakatos's ideas, the production and possibilities of the review rather than the findings.…

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

    PubMed Central

    Kristoufek, Ladislav

    2013-01-01

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

  5. GO2PUB: Querying PubMed with semantic expansion of gene ontology terms

    PubMed Central

    2012-01-01

    Background With the development of high throughput methods of gene analyses, there is a growing need for mining tools to retrieve relevant articles in PubMed. As PubMed grows, literature searches become more complex and time-consuming. Automated search tools with good precision and recall are necessary. We developed GO2PUB to automatically enrich PubMed queries with gene names, symbols and synonyms annotated by a GO term of interest or one of its descendants. Results GO2PUB enriches PubMed queries based on selected GO terms and keywords. It processes the result and displays the PMID, title, authors, abstract and bibliographic references of the articles. Gene names, symbols and synonyms that have been generated as extra keywords from the GO terms are also highlighted. GO2PUB is based on a semantic expansion of PubMed queries using the semantic inheritance between terms through the GO graph. Two experts manually assessed the relevance of GO2PUB, GoPubMed and PubMed on three queries about lipid metabolism. Experts’ agreement was high (kappa = 0.88). GO2PUB returned 69% of the relevant articles, GoPubMed: 40% and PubMed: 29%. GO2PUB and GoPubMed have 17% of their results in common, corresponding to 24% of the total number of relevant results. 70% of the articles returned by more than one tool were relevant. 36% of the relevant articles were returned only by GO2PUB, 17% only by GoPubMed and 14% only by PubMed. For determining whether these results can be generalized, we generated twenty queries based on random GO terms with a granularity similar to those of the first three queries and compared the proportions of GO2PUB and GoPubMed results. These were respectively of 77% and 40% for the first queries, and of 70% and 38% for the random queries. The two experts also assessed the relevance of seven of the twenty queries (the three related to lipid metabolism and four related to other domains). Expert agreement was high (0.93 and 0.8). GO2PUB and GoPubMed performances

  6. The Limits of Privatization.

    ERIC Educational Resources Information Center

    Starr, Paul

    Transferring public services and public assets to private ownership is not an entirely new idea. Governments at all levels in the United States have for years contracted out many services. However, under the recently coined label "privatization," such policies now come recommended as a more comprehensive approach to the problems of…

  7. Private Speech in Ballet

    ERIC Educational Resources Information Center

    Johnston, Dale

    2006-01-01

    Authoritarian teaching practices in ballet inhibit the use of private speech. This paper highlights the critical importance of private speech in the cognitive development of young ballet students, within what is largely a non-verbal art form. It draws upon research by Russian psychologist Lev Vygotsky and contemporary socioculturalists, to…

  8. Laboring through Privatization.

    ERIC Educational Resources Information Center

    Bushweller, Kevin

    1994-01-01

    Hiring private contractors to manage school support services, such as food, maintenance, and busing, is a growing trend. Companies such as Marriott Corp., ServiceMaster, ARA Services, and Laidlaw Transit report that school business is steadily increasing. Unions staunchly oppose privatization. This article balances advantages and disadvantages,…

  9. Public Values, Private Schools.

    ERIC Educational Resources Information Center

    Devins, Neal E.

    Controversy surrounding private education involves questions of compulsory education's role in inculcating values, how much alike public and private schools should be, and the duty of educational institutions to conform to constitutional norms. This book examines government regulation and resistance, legislative and judicial approaches, and issues…

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

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

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

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

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

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

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

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

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

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

    Code of Federal Regulations, 2010 CFR

    2010-07-01

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

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

    Code of Federal Regulations, 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...

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

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

  3. Dialogue on private events

    PubMed Central

    Palmer, David C.; Eshleman, John; Brandon, Paul; Layng, T. V. Joe; McDonough, Christopher; Michael, Jack; Schoneberger, Ted; Stemmer, Nathan; Weitzman, Ray; Normand, Matthew

    2004-01-01

    In the fall of 2003, the authors corresponded on the topic of private events on the listserv of the Verbal Behavior Special Interest Group. Extracts from that correspondence raised questions about the role of response amplitude in determining units of analysis, whether private events can be investigated directly, and whether covert behavior differs from other behavior except in amplitude. Most participants took a cautious stance, noting not only conceptual pitfalls and empirical difficulties in the study of private events, but doubting the value of interpretive exercises about them. Others argued that despite such obstacles, in domains where experimental analyses cannot be done, interpretation of private events in the light of laboratory principles is the best that science can offer. One participant suggested that the notion that private events can be behavioral in nature be abandoned entirely; as an alternative, the phenomena should be reinterpreted only as physiological events. PMID:22477293

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

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

  6. Differentially Private Frequent Subgraph Mining

    PubMed Central

    Xu, Shengzhi; Xiong, Li; Cheng, Xiang; Xiao, Ke

    2016-01-01

    Mining frequent subgraphs from a collection of input graphs is an important topic in data mining research. However, if the input graphs contain sensitive information, releasing frequent subgraphs may pose considerable threats to individual's privacy. In this paper, we study the problem of frequent subgraph mining (FGM) under the rigorous differential privacy model. We introduce a novel differentially private FGM algorithm, which is referred to as DFG. In this algorithm, we first privately identify frequent subgraphs from input graphs, and then compute the noisy support of each identified frequent subgraph. In particular, to privately identify frequent subgraphs, we present a frequent subgraph identification approach which can improve the utility of frequent subgraph identifications through candidates pruning. Moreover, to compute the noisy support of each identified frequent subgraph, we devise a lattice-based noisy support derivation approach, where a series of methods has been proposed to improve the accuracy of the noisy supports. Through formal privacy analysis, we prove that our DFG algorithm satisfies ε-differential privacy. Extensive experimental results on real datasets show that the DFG algorithm can privately find frequent subgraphs with high data utility. PMID:27616876

  7. When Negotiation Fails: Private Education as a Disciplinary Strategy

    ERIC Educational Resources Information Center

    de Regt, Ali; Weenink, Don

    2005-01-01

    This articles deals with the question why Dutch upper-middle-class parents resort to fee-paying private education, a tiny, recently developed sector of the Dutch educational system. The research is based on interviews with 37 parents and 20 students attending private schools, and on a survey among 376 parents involved in private schooling. From…

  8. Privatizing policy: Market solutions to energy and environmental problems

    SciTech Connect

    Stroup, R.

    1995-12-31

    This paper discusses how and why privatization can improve policy, not only in terms of managing production, but also in terms of regulation. Three major aspects of privatization are discussed. The importance for the environment of economic efficiency and prosperity is examined. The role of private law and a rights-based policy for controlling pollution is considered. Finally the claim that privatization would replace farsighted government decisions with shortsighted decisions by owners is examined. 83 refs., 2 figs.

  9. 47 CFR 1.9080 - Private commons.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... employing advanced communications technologies that involve peer-to-peer (device-to-device) communications... infrastructure (e.g., base stations, mobile stations, or other related elements). In a private...

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

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

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

    PubMed

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

    2013-12-01

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

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

  14. Health-Care-Seeking Patterns in the Emerging Private Sector in Burkina Faso: A Population-Based Study of Urban Adult Residents in Ouagadougou

    PubMed Central

    Beogo, Idrissa; Liu, Chieh-Yu; Chou, Yiing-Jenq; Chen, Chuan-Yu; Huang, Nicole

    2014-01-01

    Background The private medical care sector is expanding in urban cities in Sub-Saharan Africa (SSA). However, people’s health-care-seeking behaviors in this new landscape remain poorly understood; furthermore, distinguishing between public and private providers and among various types of private providers is critical in this investigation. This study assessed, by type, the healthcare providers urban residents in Burkina Faso visit, and their choice determinants. Method We conducted a population-based survey of a representative sample of 1,600 households in Ouagadougou from July to November 2011, consisting of 5,820 adults. We assessed the types of providers people typically sought for severe and non-severe conditions. We applied generalized estimating equations in this study. Results Among those surveyed, 97.7% and 53.1% indicated that they seek a formal provider for treating severe and non-severe conditions, respectively. Among the formal provider seekers, 20.5% and 17.0% chose for-profit (FP) providers for treating severe and non-severe conditions, respectively. Insurance coverage was held by 2.0% of those surveyed. Possessing insurance was the strongest predictor for seeking FP, for both severe (odds ratio [OR] = 1.15, 95% confidence interval [CI] = 1.04–1.28), and non-severe conditions (OR = 1.22, 95% CI = 1.07–1.39). Other predictors included being a formal jobholder and holding a higher level education. By contrast, we observed no significant difference in predisposing, enabling, or need characteristics between not-for-profit (NFP) provider seekers and public provider seekers. Proximity was the primary reason for choosing a provider. Conclusion The results suggested that FP providers play a crucial role in the urban healthcare market in SSA. Socioeconomic status and insurance status are significant predictors of provider choice. The findings can serve as a crucial reference for policymakers in response to the emergence of FP providers in

  15. The impact of population-based disease management services for selected chronic conditions: the Costs to Australian Private Insurance - Coaching Health (CAPICHe) study protocol

    PubMed Central

    2012-01-01

    Background Recent evidence from a large scale trial conducted in the United States indicates that enhancing shared decision-making and improving knowledge, self-management, and provider communication skills to at-risk patients can reduce health costs and utilisation of healthcare resources. Although this trial has provided a significant advancement in the evidence base for disease management programs it is still left for such results to be replicated and/or generalised for populations in other countries and other healthcare environments. This trial responds to the limited analyses on the effectiveness of providing chronic disease management services through telephone health coaching in Australia. The size of this trial and it's assessment of cost utility with respect to potentially preventable hospitalisations adds significantly to the body of knowledge to support policy and investment decisions in Australia as well as to the international debate regarding the effect of disease management programs on financial outcomes. Methods Intention to treat study applying a prospective randomised design comparing usual care with extensive outreach to encourage use of telephone health coaching for those people identified from a risk scoring algorithm as having a higher likelihood of future health costs. The trial population has been limited to people with one or more of the following selected chronic conditions: namely, low back pain, diabetes, coronary artery disease, heart failure, and chronic obstructive pulmonary disease. This trial will enrol at least 64,835 sourced from the approximately 3 million Bupa Australia private health insured members located across Australia. The primary outcome will be the total (non-maternity) cost per member as reported to the private health insurer (i.e. charged to the insurer) 12 months following entry into the trial for each person. Study recruitment will be completed in early 2012 and the results will be available in late 2013. Discussion

  16. Rice SNP-seek database update: new SNPs, indels, and queries

    PubMed Central

    Mansueto, Locedie; Fuentes, Roven Rommel; Borja, Frances Nikki; Detras, Jeffery; Abriol-Santos, Juan Miguel; Chebotarov, Dmytro; Sanciangco, Millicent; Palis, Kevin; Copetti, Dario; Poliakov, Alexandre; Dubchak, Inna; Solovyev, Victor; Wing, Rod A.; Hamilton, Ruaraidh Sackville; Mauleon, Ramil; McNally, Kenneth L.; Alexandrov, Nickolai

    2017-01-01

    We describe updates to the Rice SNP-Seek Database since its first release. We ran a new SNP-calling pipeline followed by filtering that resulted in complete, base, filtered and core SNP datasets. Besides the Nipponbare reference genome, the pipeline was run on genome assemblies of IR 64, 93-11, DJ 123 and Kasalath. New genotype query and display features are added for reference assemblies, SNP datasets and indels. JBrowse now displays BAM, VCF and other annotation tracks, the additional genome assemblies and an embedded VISTA genome comparison viewer. Middleware is redesigned for improved performance by using a hybrid of HDF5 and RDMS for genotype storage. Query modules for genotypes, varieties and genes are improved to handle various constraints. An integrated list manager allows the user to pass query parameters for further analysis. The SNP Annotator adds traits, ontology terms, effects and interactions to markers in a list. Web-service calls were implemented to access most data. These features enable seamless querying of SNP-Seek across various biological entities, a step toward semi-automated gene-trait association discovery. URL: http://snp-seek.irri.org. PMID:27899667

  17. Rice SNP-seek database update: new SNPs, indels, and queries.

    PubMed

    Mansueto, Locedie; Fuentes, Roven Rommel; Borja, Frances Nikki; Detras, Jeffery; Abriol-Santos, Juan Miguel; Chebotarov, Dmytro; Sanciangco, Millicent; Palis, Kevin; Copetti, Dario; Poliakov, Alexandre; Dubchak, Inna; Solovyev, Victor; Wing, Rod A; Hamilton, Ruaraidh Sackville; Mauleon, Ramil; McNally, Kenneth L; Alexandrov, Nickolai

    2017-01-04

    We describe updates to the Rice SNP-Seek Database since its first release. We ran a new SNP-calling pipeline followed by filtering that resulted in complete, base, filtered and core SNP datasets. Besides the Nipponbare reference genome, the pipeline was run on genome assemblies of IR 64, 93-11, DJ 123 and Kasalath. New genotype query and display features are added for reference assemblies, SNP datasets and indels. JBrowse now displays BAM, VCF and other annotation tracks, the additional genome assemblies and an embedded VISTA genome comparison viewer. Middleware is redesigned for improved performance by using a hybrid of HDF5 and RDMS for genotype storage. Query modules for genotypes, varieties and genes are improved to handle various constraints. An integrated list manager allows the user to pass query parameters for further analysis. The SNP Annotator adds traits, ontology terms, effects and interactions to markers in a list. Web-service calls were implemented to access most data. These features enable seamless querying of SNP-Seek across various biological entities, a step toward semi-automated gene-trait association discovery. URL: http://snp-seek.irri.org.

  18. Query-seeded iterative sequence similarity searching improves selectivity 5-20-fold.

    PubMed

    Pearson, William R; Li, Weizhong; Lopez, Rodrigo

    2016-12-06

    Iterative similarity search programs, like psiblast, jackhmmer, and psisearch, are much more sensitive than pairwise similarity search methods like blast and ssearch because they build a position specific scoring model (a PSSM or HMM) that captures the pattern of sequence conservation characteristic to a protein family. But models are subject to contamination; once an unrelated sequence has been added to the model, homologs of the unrelated sequence will also produce high scores, and the model can diverge from the original protein family. Examination of alignment errors during psiblast PSSM contamination suggested a simple strategy for dramatically reducing PSSM contamination. psiblast PSSMs are built from the query-based multiple sequence alignment (MSA) implied by the pairwise alignments between the query model (PSSM, HMM) and the subject sequences in the library. When the original query sequence residues are inserted into gapped positions in the aligned subject sequence, the resulting PSSM rarely produces alignment over-extensions or alignments to unrelated sequences. This simple step, which tends to anchor the PSSM to the original query sequence and slightly increase target percent identity, can reduce the frequency of false-positive alignments more than 20-fold compared with psiblast and jackhmmer, with little loss in search sensitivity.

  19. [The national union for private hospital oncology].

    PubMed

    Parmentier, Gérard

    2013-06-01

    In the French health system, social security is the same for both public and private hospitals regardless of their status. In terms of number of patients screened, diagnosed, or treated, independant medicine is the most important sector in the French oncology. The multitude of organizations representing private hospitals or independant oncologists, physicians, radiologists or pathologists have a common organization, the National Union for Private Hospital Oncology (UNHPC). It bases its action on two founding postulates to ensure the quality of the oncology practice : the medical and managerial cultures are complementary and should be articulated ; the quality of organizations is as important as professional competence.

  20. Quantum Private Comparison Protocol with Linear Optics

    NASA Astrophysics Data System (ADS)

    Luo, Qing-bin; Yang, Guo-wu; She, Kun; Li, Xiaoyu

    2016-12-01

    In this paper, we propose an innovative quantum private comparison(QPC) protocol based on partial Bell-state measurement from the view of linear optics, which enabling two parties to compare the equality of their private information with the help of a semi-honest third party. Partial Bell-state measurement has been realized by using only linear optical elements in experimental measurement-device-independent quantum key distribution(MDI-QKD) schemes, which makes us believe that our protocol can be realized in the near future. The security analysis shows that the participants will not leak their private information.

  1. Latin American privatization

    SciTech Connect

    Anderson, J.; Hennagir, T.; Hernandez, L.A. Jr. )

    1994-01-01

    Fundamental change is reshaping the Latin America power sector as governments explore new and improved privatization schemes. Latin American power markets are second in size only to those found in Asia. As the region grows and capacity needs increase, governments are turning to private power as a way to meet new demands for electric energy. Following the privatization model initiated by Chile, an increasing number of Latin American countries are following suit with an array of private power schemes for their state-owned utilities. The move means great opportunities for developers willing to enter this growing market. The recently established Scudder Latin American Trust for Independent Power is a prime example of new equity players becoming involved in this region. In Chile, the privatization process started more than 12 years ago. Currently, the power sector has been fully restructured to concentrate price and quality regulation on transmission and distribution, leaving generation and sales to a marketplace largely in the hands of the private sector. Furthermore, the Chilean government controls only about 15 percent of the installed generation in the country, so there is free-flow in this segment of the industry or a free market modality.

  2. BetaSearch: a new method for querying β-residue motifs

    PubMed Central

    2012-01-01

    Background Searching for structural motifs across known protein structures can be useful for identifying unrelated proteins with similar function and characterising secondary structures such as β-sheets. This is infeasible using conventional sequence alignment because linear protein sequences do not contain spatial information. β-residue motifs are β-sheet substructures that can be represented as graphs and queried using existing graph indexing methods, however, these approaches are designed for general graphs that do not incorporate the inherent structural constraints of β-sheets and require computationally-expensive filtering and verification procedures. 3D substructure search methods, on the other hand, allow β-residue motifs to be queried in a three-dimensional context but at significant computational costs. Findings We developed a new method for querying β-residue motifs, called BetaSearch, which leverages the natural planar constraints of β-sheets by indexing them as 2D matrices, thus avoiding much of the computational complexities involved with structural and graph querying. BetaSearch exhibits faster filtering, verification, and overall query time than existing graph indexing approaches whilst producing comparable index sizes. Compared to 3D substructure search methods, BetaSearch achieves 33 and 240 times speedups over index-based and pairwise alignment-based approaches, respectively. Furthermore, we have presented case-studies to demonstrate its capability of motif matching in sequentially dissimilar proteins and described a method for using BetaSearch to predict β-strand pairing. Conclusions We have demonstrated that BetaSearch is a fast method for querying substructure motifs. The improvements in speed over existing approaches make it useful for efficiently performing high-volume exploratory querying of possible protein substructural motifs or conformations. BetaSearch was used to identify a nearly identical β-residue motif between an entirely

  3. Sound-Based Number Facts Training in a Private Speech Internalization Perspective: Evidence for Effectiveness of an Intervention in Grade 3

    ERIC Educational Resources Information Center

    Ostad, Snorre A.; Askeland, Margit

    2008-01-01

    The overall purpose of the present study was to examine whether an intervention program (50 weeks), modeled as training in accordance with the developmental course of private speech (from audible private speech to silent inner speech), itself would add positively to the development of mathematical competence. The sample comprised two comparable…

  4. NoSQL: collection document and cloud by using a dynamic web query form

    NASA Astrophysics Data System (ADS)

    Abdalla, Hemn B.; Lin, Jinzhao; Li, Guoquan

    2015-07-01

    Mongo-DB (from "humongous") is an open-source document database and the leading NoSQL database. A NoSQL (Not Only SQL, next generation databases, being non-relational, deal, open-source and horizontally scalable) presenting a mechanism for storage and retrieval of documents. Previously, we stored and retrieved the data using the SQL queries. Here, we use the MonogoDB that means we are not utilizing the MySQL and SQL queries. Directly importing the documents into our Drives, retrieving the documents on that drive by not applying the SQL queries, using the IO BufferReader and Writer, BufferReader for importing our type of document files to my folder (Drive). For retrieving the document files, the usage is BufferWriter from the particular folder (or) Drive. In this sense, providing the security for those storing files for what purpose means if we store the documents in our local folder means all or views that file and modified that file. So preventing that file, we are furnishing the security. The original document files will be changed to another format like in this paper; Binary format is used. Our documents will be converting to the binary format after that direct storing in one of our folder, that time the storage space will provide the private key for accessing that file. Wherever any user tries to discover the Document files means that file data are in the binary format, the document's file owner simply views that original format using that personal key from receive the secret key from the cloud.

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

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

  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. A journey to Semantic Web query federation in the life sciences

    PubMed Central

    Cheung, Kei-Hoi; Frost, H Robert; Marshall, M Scott; Prud'hommeaux, Eric; Samwald, Matthias; Zhao, Jun; Paschke, Adrian

    2009-01-01

    Background As interest in adopting the Semantic Web in the biomedical domain continues to grow, Semantic Web technology has been evolving and maturing. A variety of technological approaches including triplestore technologies, SPARQL endpoints, Linked Data, and Vocabulary of Interlinked Datasets have emerged in recent years. In addition to the data warehouse construction, these technological approaches can be used to support dynamic query federation. As a community effort, the BioRDF task force, within the Semantic Web for Health Care and Life Sciences Interest Group, is exploring how these emerging approaches can be utilized to execute distributed queries across different neuroscience data sources. Methods and results We have created two health care and life science knowledge bases. We have explored a variety of Semantic Web approaches to describe, map, and dynamically query multiple datasets. We have demonstrated several federation approaches that integrate diverse types of information about neurons and receptors that play an important role in basic, clinical, and translational neuroscience research. Particularly, we have created a prototype receptor explorer which uses OWL mappings to provide an integrated list of receptors and executes individual queries against different SPARQL endpoints. We have also employed the AIDA Toolkit, which is directed at groups of knowledge workers who cooperatively search, annotate, interpret, and enrich large collections of heterogeneous documents from diverse locations. We have explored a tool called "FeDeRate", which enables a global SPARQL query to be decomposed into subqueries against the remote databases offering either SPARQL or SQL query interfaces. Finally, we have explored how to use the vocabulary of interlinked Datasets (voiD) to create metadata for describing datasets exposed as Linked Data URIs or SPARQL endpoints. Conclusion We have demonstrated the use of a set of novel and state-of-the-art Semantic Web technologies

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

  11. Private cord blood banking: current use and clinical future.

    PubMed

    Hollands, Peter; McCauley, Catherina

    2009-09-01

    International private umbilical cord blood banking has expanded rapidly in recent years since the first cord blood transplant which was 20 years ago. Private companies offer parents the opportunity to store umbilical cord blood for the possible future use by their child or other family members. The private cord blood industry has been criticised by a number of professional bodies including the EU Ethics Committee, the Royal College of Obstetrics and Gynaecology, the Royal College of Midwives and the US College of Paediatrics. This review presents the arguments from the opponents of private cord blood banking, and then makes the case for private cord banking based on the latest scientific and clinical evidence.

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

    DTIC Science & Technology

    1991-09-01

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

  13. Secure and Privacy-Preserving Body Sensor Data Collection and Query Scheme.

    PubMed

    Zhu, Hui; Gao, Lijuan; Li, Hui

    2016-02-01

    With the development of body sensor networks and the pervasiveness of smart phones, different types of personal data can be collected in real time by body sensors, and the potential value of massive personal data has attracted considerable interest recently. However, the privacy issues of sensitive personal data are still challenging today. Aiming at these challenges, in this paper, we focus on the threats from telemetry interface and present a secure and privacy-preserving body sensor data collection and query scheme, named SPCQ, for outsourced computing. In the proposed SPCQ scheme, users' personal information is collected by body sensors in different types and converted into multi-dimension data, and each dimension is converted into the form of a number and uploaded to the cloud server, which provides a secure, efficient and accurate data query service, while the privacy of sensitive personal information and users' query data is guaranteed. Specifically, based on an improved homomorphic encryption technology over composite order group, we propose a special weighted Euclidean distance contrast algorithm (WEDC) for multi-dimension vectors over encrypted data. With the SPCQ scheme, the confidentiality of sensitive personal data, the privacy of data users' queries and accurate query service can be achieved in the cloud server. Detailed analysis shows that SPCQ can resist various security threats from telemetry interface. In addition, we also implement SPCQ on an embedded device, smart phone and laptop with a real medical database, and extensive simulation results demonstrate that our proposed SPCQ scheme is highly efficient in terms of computation and communication costs.

  14. Secure and Privacy-Preserving Body Sensor Data Collection and Query Scheme

    PubMed Central

    Zhu, Hui; Gao, Lijuan; Li, Hui

    2016-01-01

    With the development of body sensor networks and the pervasiveness of smart phones, different types of personal data can be collected in real time by body sensors, and the potential value of massive personal data has attracted considerable interest recently. However, the privacy issues of sensitive personal data are still challenging today. Aiming at these challenges, in this paper, we focus on the threats from telemetry interface and present a secure and privacy-preserving body sensor data collection and query scheme, named SPCQ, for outsourced computing. In the proposed SPCQ scheme, users’ personal information is collected by body sensors in different types and converted into multi-dimension data, and each dimension is converted into the form of a number and uploaded to the cloud server, which provides a secure, efficient and accurate data query service, while the privacy of sensitive personal information and users’ query data is guaranteed. Specifically, based on an improved homomorphic encryption technology over composite order group, we propose a special weighted Euclidean distance contrast algorithm (WEDC) for multi-dimension vectors over encrypted data. With the SPCQ scheme, the confidentiality of sensitive personal data, the privacy of data users’ queries and accurate query service can be achieved in the cloud server. Detailed analysis shows that SPCQ can resist various security threats from telemetry interface. In addition, we also implement SPCQ on an embedded device, smart phone and laptop with a real medical database, and extensive simulation results demonstrate that our proposed SPCQ scheme is highly efficient in terms of computation and communication costs. PMID:26840319

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

  16. Generalized queries on probabilistic context-free grammars

    SciTech Connect

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

    1996-12-31

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

  17. EarthServer: Information Retrieval and Query Language

    NASA Astrophysics Data System (ADS)

    Perperis, Thanassis; Koltsida, Panagiota; Kakaletris, George

    2013-04-01

    Establishing open, unified, seamless, access and ad-hoc analytics on cross-disciplinary, multi-source, multi-dimensional, spatiotemporal Earth Science data of extreme-size and their supporting metadata are the main challenges of the EarthServer project (www.earthserver.eu), funded by the European Commission under its Seventh Framework Program. One of EarthServer's main objectives is to provide users with higher level coverage and metadata search, retrieval and processing capabilities to multi-disciplinary Earth Science data. Six Lighthouse Applications are being established, each one providing access to Cryospheric, Airborne, Atmospheric, Geology, Oceanography and Planetary science raster data repositories through strictly WCS 2.0 standard based service endpoints. EarthServers' information retrieval subsystem aims towards exploiting the WCS endpoints through a physically and logically distributed service oriented architecture, foreseeing the collaboration of several standard compliant services, capable of exploiting modern large grid and cloud infrastructures and of dynamically responding to availability and capabilities of underlying resources. Towards furthering technology for integrated, coherent service provision based on WCS and WCPS the concept of a query language (QL), unifying coverage and metadata processing and retrieval is introduced. EarthServer's information retrieval subsystem receives QL requests involving high volumes of all Earth Science data categories, executes them on the services that reside on the infrastructure and sends the results back to the requester through a high performance pipeline. In this contribution we briefly discuss EarthServer's service oriented coverage data and metadata search and retrieval architecture and further elaborate on the potentials of EarthServer's Query Language, called xWCPS (XQuery compliant WCPS). xWCPS aims towards merging the path that the two widely adopted standards (W3C XQuery, OGC WCPS) have paved, into a

  18. The Impact of Intercollegiate Athletics on Undergraduate Enrollment at a Small, Private, Southern, Faith-Based Institution

    ERIC Educational Resources Information Center

    Brunet, Matthew J.

    2010-01-01

    Based on previous research, it is apparent that many National Collegiate Athletic Association (NCAA) Division I institutions benefit from the existence of and success in intercollegiate athletics. However, there are few, if any, studies that have researched the impact of intercollegiate athletics at National Association of Intercollegiate…

  19. Differentiation and Diversification in Higher Education: The Case of Private, Faith-Based Higher Education in Manitoba

    ERIC Educational Resources Information Center

    Smith, Dan

    2013-01-01

    The central proposition of this article is that Manitoba's faith-based higher education institutions have become more accepted by, and more closely integrated into, the mainstream post-secondary system in the province. Drawing on theoretical work explaining change in higher education systems, the article examines legislative and policy actions by…

  20. Motivational Factors of Pay-for-Performance Plans in Educational Institutions: A Study of Select Private, Faith-Based Schools

    ERIC Educational Resources Information Center

    Wrobbel, Paul H.

    2009-01-01

    In the United States there is considerable focus on the need for continuous improvement in the quality of schools, including student achievement and teacher performance. Performance-based pay has been repeatedly suggested as a way to improve teaching in school systems. Therefore, a more thorough understanding of the differences in the perceptions…

  1. Constructing query-driven dynamic machine learning model with application to protein-ligand binding sites prediction.

    PubMed

    Yu, Dong-Jun; Hu, Jun; Li, Qian-Mu; Tang, Zhen-Min; Yang, Jing-Yu; Shen, Hong-Bin

    2015-01-01

    We are facing an era with annotated biological data rapidly and continuously generated. How to effectively incorporate new annotated data into the learning step is crucial for enhancing the performance of a bioinformatics prediction model. Although machine-learning-based methods have been extensively used for dealing with various biological problems, existing approaches usually train static prediction models based on fixed training datasets. The static approaches are found having several disadvantages such as low scalability and impractical when training dataset is huge. In view of this, we propose a dynamic learning framework for constructing query-driven prediction models. The key difference between the proposed framework and the existing approaches is that the training set for the machine learning algorithm of the proposed framework is dynamically generated according to the query input, as opposed to training a general model regardless of queries in traditional static methods. Accordingly, a query-driven predictor based on the smaller set of data specifically selected from the entire annotated base dataset will be applied on the query. The new way for constructing the dynamic model enables us capable of updating the annotated base dataset flexibly and using the most relevant core subset as the training set makes the constructed model having better generalization ability on the query, showing "part could be better than all" phenomenon. According to the new framework, we have implemented a dynamic protein-ligand binding sites predictor called OSML (On-site model for ligand binding sites prediction). Computer experiments on 10 different ligand types of three hierarchically organized levels show that OSML outperforms most existing predictors. The results indicate that the current dynamic framework is a promising future direction for bridging the gap between the rapidly accumulated annotated biological data and the effective machine-learning-based predictors. OSML

  2. Are Selective Private and Public Colleges Affordable?

    ERIC Educational Resources Information Center

    Karikari, John A.; Dezhbakhsh, Hashem

    2013-01-01

    We examine college affordability under the existing pricing and financial aid system that awards both non need-based and need-based aid. Using data of freshmen attending a large number of selective private and public colleges in the USA, we find that the prices students actually pay for college have increased over time. Need-based grant aid has…

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

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

  5. A study of the age attribute in a query tool for a clinical data warehouse.

    PubMed

    Scheufele, Elisabeth L; Scheufele, Elisabeth Lee; Dubey, Anil; Dubey, Anil Kumar; Murphy, Shawn N

    2008-11-06

    The RPDR, a clinical data warehouse with a user-friendly Querytool, allows researchers to perform studies on patient data. Currently, the RPDR represents age as the patient's age at the present time, which is problematic in situations where age at the time of the event is more appropriate. We will modify the Querytool to consider this by assessing the perception of age via survey, testing backend query solutions, and developing modifications based on these results.

  6. In Reputation We Believe: Query Processing in Mobile Ad-Hoc Networks

    DTIC Science & Technology

    2005-01-01

    peers as: Definition 5 A device is a trusted peer for device if and only if $ &%(’ where ’ is ’s trust threshold. When a device receives a...not yet trusted devices. Consequently, the querying device cannot learn and adjust its trust degree about other peers in its vicinity it does not...out the discovery mes- sages more than once based on the responses it receives from its peers . 3.1.2. Information Advertisement When a cooperating

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

  8. Query by synthesized sketch in an architectural database

    NASA Astrophysics Data System (ADS)

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

    1997-01-01

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

  9. Determining conserved metabolic biomarkers from a million database queries

    PubMed Central

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

    2015-01-01

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

  10. An Agent-Based Model of Private Woodland Owner Management Behavior Using Social Interactions, Information Flow, and Peer-To-Peer Networks.

    PubMed

    Huff, Emily Silver; Leahy, Jessica E; Hiebeler, David; Weiskittel, Aaron R; Noblet, Caroline L

    2015-01-01

    Privately owned woodlands are an important source of timber and ecosystem services in North America and worldwide. Impacts of management on these ecosystems and timber supply from these woodlands are difficult to estimate because complex behavioral theory informs the owner's management decisions. The decision-making environment consists of exogenous market factors, internal cognitive processes, and social interactions with fellow landowners, foresters, and other rural community members. This study seeks to understand how social interactions, information flow, and peer-to-peer networks influence timber harvesting behavior using an agent-based model. This theoretical model includes forested polygons in various states of 'harvest readiness' and three types of agents: forest landowners, foresters, and peer leaders (individuals trained in conservation who use peer-to-peer networking). Agent rules, interactions, and characteristics were parameterized with values from existing literature and an empirical survey of forest landowner attitudes, intentions, and demographics. The model demonstrates that as trust in foresters and peer leaders increases, the percentage of the forest that is harvested sustainably increases. Furthermore, peer leaders can serve to increase landowner trust in foresters. Model output and equations will inform forest policy and extension/outreach efforts. The model also serves as an important testing ground for new theories of landowner decision making and behavior.

  11. An Agent-Based Model of Private Woodland Owner Management Behavior Using Social Interactions, Information Flow, and Peer-To-Peer Networks

    PubMed Central

    Huff, Emily Silver; Leahy, Jessica E.; Hiebeler, David; Weiskittel, Aaron R.; Noblet, Caroline L.

    2015-01-01

    Privately owned woodlands are an important source of timber and ecosystem services in North America and worldwide. Impacts of management on these ecosystems and timber supply from these woodlands are difficult to estimate because complex behavioral theory informs the owner’s management decisions. The decision-making environment consists of exogenous market factors, internal cognitive processes, and social interactions with fellow landowners, foresters, and other rural community members. This study seeks to understand how social interactions, information flow, and peer-to-peer networks influence timber harvesting behavior using an agent-based model. This theoretical model includes forested polygons in various states of ‘harvest readiness’ and three types of agents: forest landowners, foresters, and peer leaders (individuals trained in conservation who use peer-to-peer networking). Agent rules, interactions, and characteristics were parameterized with values from existing literature and an empirical survey of forest landowner attitudes, intentions, and demographics. The model demonstrates that as trust in foresters and peer leaders increases, the percentage of the forest that is harvested sustainably increases. Furthermore, peer leaders can serve to increase landowner trust in foresters. Model output and equations will inform forest policy and extension/outreach efforts. The model also serves as an important testing ground for new theories of landowner decision making and behavior. PMID:26562429

  12. Privatization and Educational Choice.

    ERIC Educational Resources Information Center

    Lieberman, Myron

    This book describes how and why educational choice movements will affect public education. It uses a public-choice approach to argue that both the supporters and opponents of private and school choice have failed to address several critical issues. Following an introductory chapter, chapter 2 is devoted to the rationale for contracting out…

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

  14. Private Stimuli, Covert Responses, and Private Events: Conceptual Remarks

    ERIC Educational Resources Information Center

    Tourinho, E. Z.

    2006-01-01

    In this article, I discuss the concepts of "private stimuli," "covert responses," and "private events," emphasizing three aspects: the conditions under which private stimuli may acquire discriminative functions to verbal responses, the conditions of unobservability of covert responses, and the complexity of events or phenomena described as…

  15. High-performance web services for querying gene and variant annotation.

    PubMed

    Xin, Jiwen; Mark, Adam; Afrasiabi, Cyrus; Tsueng, Ginger; Juchler, Moritz; Gopal, Nikhil; Stupp, Gregory S; Putman, Timothy E; Ainscough, Benjamin J; Griffith, Obi L; Torkamani, Ali; Whetzel, Patricia L; Mungall, Christopher J; Mooney, Sean D; Su, Andrew I; Wu, Chunlei

    2016-05-06

    Efficient tools for data management and integration are essential for many aspects of high-throughput biology. In particular, annotations of genes and human genetic variants are commonly used but highly fragmented across many resources. Here, we describe MyGene.info and MyVariant.info, high-performance web services for querying gene and variant annotation information. These web services are currently accessed more than three million times permonth. They also demonstrate a generalizable cloud-based model for organizing and querying biological annotation information. MyGene.info and MyVariant.info are provided as high-performance web services, accessible at http://mygene.info and http://myvariant.info . Both are offered free of charge to the research community.

  16. Clinical task-specific query expansion for the retrieval of scientifically rigorous research documents.

    PubMed

    Yoo, Sooyoung; Choi, Jinwook; Choi, Sungbin

    2010-01-01

    To support the practice of evidence-based medicine (EBM), clinically relevant and scientifically sound articles should be easily accessible. Due to the huge volume of medical literature and the low performance of present retrieval models, clinicians could only get relevant documents in the order of publication time. This study propose a new clinical task-specific retrieval technique that improves retrieval accuracy by exploiting clinical task-specific EBM terms to query expansion using co-occurrence analysis technique. The idea is aimed at selecting query expansion terms that are relevant to a specific clinical-task using task-specific EBM terms. Focusing on treatment and diagnosis tasks, the new method which was performed on the OHSUMED collection showed a further improved result than the existing method.

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

  18. A Study on Pubmed Search Tag Usage Pattern: Association Rule Mining of a Full-day Pubmed Query Log

    PubMed Central

    2013-01-01

    Background The practice of evidence-based medicine requires efficient biomedical literature search such as PubMed/MEDLINE. Retrieval performance relies highly on the efficient use of search field tags. The purpose of this study was to analyze PubMed log data in order to understand the usage pattern of search tags by the end user in PubMed/MEDLINE search. Methods A PubMed query log file was obtained from the National Library of Medicine containing anonymous user identification, timestamp, and query text. Inconsistent records were removed from the dataset and the search tags were extracted from the query texts. A total of 2,917,159 queries were selected for this study issued by a total of 613,061 users. The analysis of frequent co-occurrences and usage patterns of the search tags was conducted using an association mining algorithm. Results The percentage of search tag usage was low (11.38% of the total queries) and only 2.95% of queries contained two or more tags. Three out of four users used no search tag and about two-third of them issued less than four queries. Among the queries containing at least one tagged search term, the average number of search tags was almost half of the number of total search terms. Navigational search tags are more frequently used than informational search tags. While no strong association was observed between informational and navigational tags, six (out of 19) informational tags and six (out of 29) navigational tags showed strong associations in PubMed searches. Conclusions The low percentage of search tag usage implies that PubMed/MEDLINE users do not utilize the features of PubMed/MEDLINE widely or they are not aware of such features or solely depend on the high recall focused query translation by the PubMed’s Automatic Term Mapping. The users need further education and interactive search application for effective use of the search tags in order to fulfill their biomedical information needs from PubMed/MEDLINE. PMID:23302604

  19. Parallel multi-join query optimization algorithm for distributed sensor network in the internet of things

    NASA Astrophysics Data System (ADS)

    Zheng, Yan

    2015-03-01

    Internet of things (IoT), focusing on providing users with information exchange and intelligent control, attracts a lot of attention of researchers from all over the world since the beginning of this century. IoT is consisted of large scale of sensor nodes and data processing units, and the most important features of IoT can be illustrated as energy confinement, efficient communication and high redundancy. With the sensor nodes increment, the communication efficiency and the available communication band width become bottle necks. Many research work is based on the instance which the number of joins is less. However, it is not proper to the increasing multi-join query in whole internet of things. To improve the communication efficiency between parallel units in the distributed sensor network, this paper proposed parallel query optimization algorithm based on distribution attributes cost graph. The storage information relations and the network communication cost are considered in this algorithm, and an optimized information changing rule is established. The experimental result shows that the algorithm has good performance, and it would effectively use the resource of each node in the distributed sensor network. Therefore, executive efficiency of multi-join query between different nodes could be improved.

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

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

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

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

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

  5. Defusion: A Behavior-Analytic Strategy for Addressing Private Events

    PubMed Central

    Snyder, Katie; Lambert, Joseph; Twohig, Michael P

    2011-01-01

    Applied behavior analysts encounter situations in which private events hinder client progress, and additional techniques to address these issues are needed. By conceptualizing private events as verbal rules, we provide a behavior-analytic framework for understanding and addressing these events. Relational frame theory (RFT) is the basis for this conceptual foundation; the empirically based principles of RFT are presented along with direct implications for understanding private events. Defusion, an RFT-based technique for addressing private events, is then described and empirical studies that evaluate the effects of defusion are reviewed. Finally, potential clinical applications for practicing behavior analysts are offered. PMID:22649574

  6. Privatizing responsibility: public sector reform under neoliberal government.

    PubMed

    Ilcan, Suzan

    2009-08-01

    In light of public sector reforms in Canada and elsewhere, this paper focuses on the shift of emphasis from social to private responsibilities and raises new questions about the forces of private enterprise and market-based partnerships. Under neoliberal governmental agendas, privatizing responsibility links to three main developments: the reconsideration of the relations of public and private; the mobilization of responsible citizenship; and the formation of a cultural mentality of rule that works alongside these developments. The research for this article is based on extensive analysis of policy documents and public sector reform initiatives, as well as interviews with Canadian federal public service employees.

  7. Film Images of Private Schools.

    ERIC Educational Resources Information Center

    Resnick, David

    2000-01-01

    Examines public debate over private education in the context of the Hollywood dramatic feature film. Analyses four recent films that all portray private schools negatively. Film representation of public schools is more optimistic. Asserts that the films ignore or misrepresent three strengths of private education: effective leadership, small school…

  8. Stimuli, Reinforcers, and Private Events

    ERIC Educational Resources Information Center

    Nevin, John A.

    2008-01-01

    Radical behaviorism considers private events to be a part of ongoing observable behavior and to share the properties of public events. Although private events cannot be measured directly, their roles in overt action can be inferred from mathematical models that relate private responses to external stimuli and reinforcers according to the same…

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

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

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

  12. SUCCESSFUL PRIVATIZATION OF HANFORD SITE FABRICATION SERVICES

    SciTech Connect

    KELLY, D.S.

    2004-11-18

    This paper describes the elements of Fluor Hanford's successful privatization of a major support services function. The privatization has accelerated the closure of the Department of Energy's Hanford Site by streamlining operations and using the realized cost savings to maintain the accelerated schedules set by the Department of Energy (DOE) and other regulatory stakeholders. Issues with worker demographics, future workload forecasting, budget optimization, and long-term community economic development were key components to Fluor Hanford's decision to choose the controversial and difficult pathway of outsourcing a Cold War legacy function to a private company. Many privatization efforts are abandoned in the preliminary planning stages due to extreme risk: frequently the final return on investment is less than anticipated. In this case, Fluor Hanford has successfully leveraged onsite assets to support the ongoing clean-up mission, provide potential long-term employment for the displaced workforce as site closure progresses, and establish a manufacturing base supporting the local economy. Based on several factors, which are described in this paper, the privatization of the Hanford Site Fabrication Services to an offsite vendor operating a large local business unit has been successful for virtually all of the stakeholders.

  13. Querying Co-regulated Genes on Diverse Gene Expression Datasets Via Biclustering.

    PubMed

    Deveci, Mehmet; Küçüktunç, Onur; Eren, Kemal; Bozdağ, Doruk; Kaya, Kamer; Çatalyürek, Ümit V

    2016-01-01

    Rapid development and increasing popularity of gene expression microarrays have resulted in a number of studies on the discovery of co-regulated genes. One important way of discovering such co-regulations is the query-based search since gene co-expressions may indicate a shared role in a biological process. Although there exist promising query-driven search methods adapting clustering, they fail to capture many genes that function in the same biological pathway because microarray datasets are fraught with spurious samples or samples of diverse origin, or the pathways might be regulated under only a subset of samples. On the other hand, a class of clustering algorithms known as biclustering algorithms which simultaneously cluster both the items and their features are useful while analyzing gene expression data, or any data in which items are related in only a subset of their samples. This means that genes need not be related in all samples to be clustered together. Because many genes only interact under specific circumstances, biclustering may recover the relationships that traditional clustering algorithms can easily miss. In this chapter, we briefly summarize the literature using biclustering for querying co-regulated genes. Then we present a novel biclustering approach and evaluate its performance by a thorough experimental analysis.

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

  15. Semantics Enabled Queries in EuroGEOSS: a Discovery Augmentation Approach

    NASA Astrophysics Data System (ADS)

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

    2010-12-01

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

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

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

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

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

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

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

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

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

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

  5. Remote query pressure measurement using magnetoelastic sensors

    NASA Astrophysics Data System (ADS)

    Grimes, C. A.; Stoyanov, P. G.; Kouzoudis, D.; Ong, K. G.

    1999-12-01

    Two magnetostriction-based methods for measuring atmospheric pressure are presented. Each technique correlates changes in pressure with the characteristic resonant frequency of a magnetoelastic magnetostrictive thick-film sensor. In each case the sensor is monitored remotely, using an adjacently located pickup coil, without the use of physical connections to the sensor.

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

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

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

  9. Inner behavior: Empirical investigations of private events

    PubMed Central

    Calkin, Abigail B.

    2002-01-01

    The special section on private events in the Spring 2000 issue of The Behavior Analyst discussed the exploration of private events. The four articles focused on conceptualizations of issues related to private events and on behavior analysts' neglect of the area. This response cites 19 data-based articles and two doctoral dissertations involving measurement of what precision teachers term inner behavior—thoughts, feelings, and urges. Of the estimated 1.2 million standard celeration charts, at least 1,600 are inner behavior charts. These extensive data indicate that people can and do count and chart their inner behavior. This response discusses findings on inner behavior and its frequency, celeration (growth), variability, and improvement using antecedent and consequent events. PMID:22478390

  10. A Partnership Experience in Private Education

    ERIC Educational Resources Information Center

    Pacino, Maria A.; Watkins, Alice; Warren, Susan R.; Yee-Sakamoto, Ivy; Lawson, Dan

    2007-01-01

    The purpose of the study was to document the planning, process, and outcomes resulting from a partnership between two private, faith-based institutions a kindergarten through fifth grade (K-5) school and a university. A team of five university professors formed a partnership with the K-5 school in February 2003. The university faculty continues to…

  11. Privatization of Early Childhood Education in Iceland

    ERIC Educational Resources Information Center

    Dýrfjörð, Kristín; Magnúsdóttir, Berglind Rós

    2016-01-01

    The overall aim of this paper is to give a comprehensive picture of the marketization of early childhood education in Iceland. Our theoretical framework is based on Hursh's (2007) analysis of how the governance of schools is reshaped to serve a neoliberal agenda with the help of internal and external privatization (Ball and Youdell, 2007). In this…

  12. Institutionalisation in a Newly Created Private University

    ERIC Educational Resources Information Center

    Hodson, Peter; Connolly, Michael; Younes, Said

    2008-01-01

    Purpose: The purpose of this paper is to examine the introduction of a quality assurance system in a new, private university in Syria, and considers the extent to which the theoretical model based on institutional theory and isomorphism is reflected in practice. Design/methodology/approach: A five year longitudinal study which reviews the design,…

  13. Private Training Providers: Their Characteristics and Training Activities. Support Document

    ERIC Educational Resources Information Center

    Harris, Roger; Simons, Michele; McCarthy, Carmel

    2006-01-01

    This document was produced by the authors based on their research for the report, "Private Training Providers: Their Characteristics and Training Activities," [ED495181] and is an added resource for further information. That study examined the nature of the training activity of private registered training organisations (RTOs) offered to…

  14. Differentially Private Distributed Sensing

    SciTech Connect

    Fink, Glenn A.

    2016-12-11

    The growth of the Internet of Things (IoT) creates the possibility of decentralized systems of sensing and actuation, potentially on a global scale. IoT devices connected to cloud networks can offer Sensing and Actuation as a Service (SAaaS) enabling networks of sensors to grow to a global scale. But extremely large sensor networks can violate privacy, especially in the case where IoT devices are mobile and connected directly to the behaviors of people. The thesis of this paper is that by adapting differential privacy (adding statistically appropriate noise to query results) to groups of geographically distributed sensors privacy could be maintained without ever sending all values up to a central curator and without compromising the overall accuracy of the data collected. This paper outlines such a scheme and performs an analysis of differential privacy techniques adapted to edge computing in a simulated sensor network where ground truth is known. The positive and negative outcomes of employing differential privacy in distributed networks of devices are discussed and a brief research agenda is presented.

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

  16. Wastewater privatization: A beneficial alternative

    SciTech Connect

    Wakeman, R.F.; Drewry, W.A.

    1999-07-01

    Municipalities with wastewater operations face increasing requirements to maximize efficiency, implement capital improvements, and ensure environmental compliance. Privatization is a relatively unused alternative offering benefits in the areas of cost-effective operations, flexible financing, technology access, and compliance assurance. Recent executive direction and tax code changes have opened new doors for mutually beneficial public-private partnerships. Wastewater privatization has historically consisted of short-term contract agreements for treatment operations, but looming infrastructure recapitalization and development requirements have catalyzed an exploration of non-traditional alternatives that include private sector financing, development, and operation of entire wastewater systems, The purpose of this paper is to show why privatization must be considered, evaluate the different levels available, and generate an analytical aid for communities taking their first look at privatization opportunities.

  17. Automatic query generation using word embeddings for retrieving passages describing experimental methods

    PubMed Central

    Aydın, Ferhat; Hüsünbeyi, Zehra Melce; Özgür, Arzucan

    2017-01-01

    Information regarding the physical interactions among proteins is crucial, since protein–protein interactions (PPIs) are central for many biological processes. The experimental techniques used to verify PPIs are vital for characterizing and assessing the reliability of the identified PPIs. A lot of information about PPIs and the experimental methods are only available in the text of the scientific publications that report them. In this study, we approach the problem of identifying passages with experimental methods for physical interactions between proteins as an information retrieval search task. The baseline system is based on query matching, where the queries are generated by utilizing the names (including synonyms) of the experimental methods in the Proteomics Standard Initiative–Molecular Interactions (PSI-MI) ontology. We propose two methods, where the baseline queries are expanded by including additional relevant terms. The first method is a supervised approach, where the most salient terms for each experimental method are obtained by using the term frequency–relevance frequency (tf.rf) metric over 13 articles from our manually annotated data set of 30 full text articles, which is made publicly available. On the other hand, the second method is an unsupervised approach, where the queries for each experimental method are expanded by using the word embeddings of the names of the experimental methods in the PSI-MI ontology. The word embeddings are obtained by utilizing a large unlabeled full text corpus. The proposed methods are evaluated on the test set consisting of 17 articles. Both methods obtain higher recall scores compared with the baseline, with a loss in precision. Besides higher recall, the word embeddings based approach achieves higher F-measure than the baseline and the tf.rf based methods. We also show that incorporating gene name and interaction keyword identification leads to improved precision and F-measure scores for all three evaluated

  18. A METHOD FOR ESTIMATING GAS PRESSURE IN 3013 CONTAINERS USING AN ISP DATABASE QUERY

    SciTech Connect

    Friday, G; L. G. Peppers, L; D. K. Veirs, D

    2008-07-31

    The U.S. Department of Energy's Integrated Surveillance Program (ISP) is responsible for the storage and surveillance of plutonium-bearing material. During storage, plutonium-bearing material has the potential to generate hydrogen gas from the radiolysis of adsorbed water. The generation of hydrogen gas is a safety concern, especially when a container is breached within a glove box during destructive evaluation. To address this issue, the DOE established a standard (DOE, 2004) that sets the criteria for the stabilization and packaging of material for up to 50 years. The DOE has now packaged most of its excess plutonium for long-term storage in compliance with this standard. As part of this process, it is desirable to know within reasonable certainty the total maximum pressure of hydrogen and other gases within the 3013 container if safety issues and compliance with the DOE standards are to be attained. The principal goal of this investigation is to document the method and query used to estimate total (i.e. hydrogen and other gases) gas pressure within a 3013 container based on the material properties and estimated moisture content contained in the ISP database. Initial attempts to estimate hydrogen gas pressure in 3013 containers was based on G-values (hydrogen gas generation per energy input) derived from small scale samples. These maximum G-values were used to calculate worst case pressures based on container material weight, assay, wattage, moisture content, container age, and container volume. This paper documents a revised hydrogen pressure calculation that incorporates new surveillance results and includes a component for gases other than hydrogen. The calculation is produced by executing a query of the ISP database. An example of manual mathematical computations from the pressure equation is compared and evaluated with results from the query. Based on the destructive evaluation of 17 containers, the estimated mean absolute pressure was significantly higher

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

    PubMed

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

    2004-03-01

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

  20. Inductive Queries for a Drug Designing Robot Scientist

    NASA Astrophysics Data System (ADS)

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

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

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

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

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

    DTIC Science & Technology

    2006-01-01

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

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

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

    NASA Astrophysics Data System (ADS)

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

    1993-12-01

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

  6. TWRS privatization bibliography

    SciTech Connect

    1996-03-01

    The purpose of this bibliography is to present a select set of documents that may be of interest to the Offeror, covering a variety of subject areas related to the TWRS Privatization Project. This bibliography is not, nor is intended to be, exhaustive or complete. It was prepared with the intent of providing a sampling of representative documents potentially helpful to Offerors. The documents referenced herein have been identified as representative of those potentially helpful to Offerors. This list of documents does not represent the full extent of available and potentially helpful information, nor should it be taken as a representation of documents determined to be of greater importance than other documents not referenced herein. There are numerous documents available to the public that are NOT cited in this bibliography; the Offeror is encouraged to perform searches for alternate sources of information.

  7. TWRS privatization bibliography

    SciTech Connect

    1996-02-01

    The purpose of this bibliography is to present a select set of documents that may be of interest to the Offeror, covering a variety of subject areas related to the TWRS Privatization Project. The organization of this bibliography is by subject area. Some of the documents overlap subject areas, and may be presented in more than one. Additionally, assignment of a document to one subject area does not necessarily preclude that document from containing information relevant to other subject areas not identified. The subject areas include, in order of presentation:. Waste Characterization; Pre-treatment; High-level Waste Immobilization; Low-level Waste Immobilization; Low-level Waste Melter Test Program; Performance Assessment; and General Safety.

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

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

  10. Using Genome Query Language to uncover genetic variation

    PubMed Central

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

    2014-01-01

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

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

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

  13. Autocorrelation and Regularization of Query-Based Information Retrieval Scores

    DTIC Science & Technology

    2008-02-01

    projected scores. This problem has similar solutions to monolingual regularization. The iterative solution is, ft+1t = (1− α)yt + αStf t t (8.7) The... multilingual corpora. In Manuela M. Veloso, editor, IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial In- telligence

  14. Assessing Systematic Topic Difficulty Based on Query and Collection Features

    ERIC Educational Resources Information Center

    Lu, Kun

    2012-01-01

    The performance of information retrieval systems varies significantly by test topics. Even for those systems that have performed well on average, the results for some difficult topics are still poor. Previous studies have revealed that different optimization techniques should be used for those difficult topics. However, a prerequisite of the…

  15. A new technique for improving the dispersion of a set of samples. Application in multi-query motion planning

    NASA Astrophysics Data System (ADS)

    Khaksar, Weria; Hong, Tang Sai; Sahari, Khairul Salleh Bin Mohamed; Khaksar, Mansoor

    2015-05-01

    In this paper, we proposed a new learning strategy for probabilistic roadmap (PRM) algorithm. The proposed strategy is based on reducing the dispersion of the generated set of samples. We defined a forbidden range around each selected sample and ignore this region in further sampling. The resulted planner called LD-PRM is an effective multi-query sampling-based planner which is able to solve motion planning queries with smaller graphs. Simulation results indicated that the proposed planner improve the runtime of the PRM algorithm. Furthermore, the proposed planner is able to solve difficult motion planning cases including narrow passages and bug traps, which is a difficult task for classic sampling-based algorithms. For measuring the uniformity of the generated samples, a new algorithm was created to measure the dispersion of a set of samples based on any desired resolution. Also, comparison studies are provided to support the superiority claim of the proposed algorithm.

  16. Michigan School Privatization Survey 2010

    ERIC Educational Resources Information Center

    Hohman, James M.; Anderson, Dustin D.

    2010-01-01

    Privatization of support services has been a method that Michigan school districts have used for several years to lower costs. More than ever before, Michigan school districts are privatizing the three main support services they offer--food, custodial and transportation. The annual survey finds that 48.8 percent of Michigan school districts are…

  17. Public/Private Partnership Programs.

    ERIC Educational Resources Information Center

    District of Columbia Public Schools, Washington, DC.

    This document presents the Public/Private Partnership Programs, a school-community project developed in 1981 by the District of Columbia public schools and the private sector community to provide career-focused high school programs. The project was designed to motivate and support young people to stay in school, graduate from high school, and…

  18. Private Faith and Public Education

    ERIC Educational Resources Information Center

    Trigg, Roger

    2008-01-01

    Must faith be privatized? Taken at face value, this could seem a curious question, since no one is in a position to "sell off" any religion to private interests, in the way that, for example, British Rail was dismembered. Yet the question is an important one in a contemporary society, characterized as it is by a significant divergence of views…

  19. The Future of Private Colleges.

    ERIC Educational Resources Information Center

    Brooks, Norward J.

    While the elite private colleges may survive the enrollment declines of the 1980's and 1990's, the less elite, so-called invisible private colleges may have more difficulty. Finance, enrollment, and competition are the three major elements seen to threaten these institutions' futures. They face an uncertain financial future since historically they…

  20. The Law and Private Police.

    ERIC Educational Resources Information Center

    Kakalik, James S.; Wildhorn, Sorrel

    This report is one of a series of five describing a 16-month study of the nature and extent of the private police industry in the United States, its problems, its present regulation, and how the law impinges on it. A general discussion of the sources of legal limitations upon private police activities and personnel and sources of legal powers is…