WorldWideScience

Sample records for based query expansion

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

    Science.gov (United States)

    Khennak, Ilyes; Drias, Habiba

    2017-02-01

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

  2. Query Expansion: Is It Necessary In Textual Case-Based Reasoning ...

    African Journals Online (AJOL)

    Query expansion (QE) is the process of transforming a seed query to improve retrieval performance in information retrieval operations. It is often intended to overcome a vocabulary mismatch between the query and the document collection. Query expansion is known to improve retrieval effectiveness of some information ...

  3. Knowledge based query expansion in complex multimedia event detection

    NARCIS (Netherlands)

    Boer, M. de; Schutte, K.; Kraaij, W.

    2016-01-01

    A common approach in content based video information retrieval is to perform automatic shot annotation with semantic labels using pre-trained classifiers. The visual vocabulary of state-of-the-art automatic annotation systems is limited to a few thousand concepts, which creates a semantic gap

  4. An IR-Based Approach Utilizing Query Expansion for Plagiarism Detection in MEDLINE.

    Science.gov (United States)

    Nawab, Rao Muhammad Adeel; Stevenson, Mark; Clough, Paul

    2017-01-01

    The identification of duplicated and plagiarized passages of text has become an increasingly active area of research. In this paper, we investigate methods for plagiarism detection that aim to identify potential sources of plagiarism from MEDLINE, particularly when the original text has been modified through the replacement of words or phrases. A scalable approach based on Information Retrieval is used to perform candidate document selection-the identification of a subset of potential source documents given a suspicious text-from MEDLINE. Query expansion is performed using the ULMS Metathesaurus to deal with situations in which original documents are obfuscated. Various approaches to Word Sense Disambiguation are investigated to deal with cases where there are multiple Concept Unique Identifiers (CUIs) for a given term. Results using the proposed IR-based approach outperform a state-of-the-art baseline based on Kullback-Leibler Distance.

  5. Ontology-based vector space model and fuzzy query expansion to retrieve knowledge on medical computational problem solutions.

    Science.gov (United States)

    Bratsas, Charalampos; Koutkias, Vassilis; Kaimakamis, Evangelos; Bamidis, Panagiotis; Maglaveras, Nicos

    2007-01-01

    Medical Computational Problem (MCP) solving is related to medical problems and their computerized algorithmic solutions. In this paper, an extension of an ontology-based model to fuzzy logic is presented, as a means to enhance the information retrieval (IR) procedure in semantic management of MCPs. We present herein the methodology followed for the fuzzy expansion of the ontology model, the fuzzy query expansion procedure, as well as an appropriate ontology-based Vector Space Model (VSM) that was constructed for efficient mapping of user-defined MCP search criteria and MCP acquired knowledge. The relevant fuzzy thesaurus is constructed by calculating the simultaneous occurrences of terms and the term-to-term similarities derived from the ontology that utilizes UMLS (Unified Medical Language System) concepts by using Concept Unique Identifiers (CUI), synonyms, semantic types, and broader-narrower relationships for fuzzy query expansion. The current approach constitutes a sophisticated advance for effective, semantics-based MCP-related IR.

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

    Science.gov (United States)

    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

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

    Science.gov (United States)

    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. Copyright © 2015 Elsevier Inc. All rights reserved.

  8. A Revisit of Query Expansion with Different Semantic Levels

    DEFF Research Database (Denmark)

    Zhang, Ce; Cui, Bin; Cong, Gao

    2009-01-01

    Query expansion has received extensive attention in information retrieval community. Although semantic based query expansion appears to be promising in improving retrieval performance, previous research has shown that it cannot consistently improve retrieval performance. It is a tricky problem...... to automatically determine whether to do query expansion for a given query. In this paper, we introduce Compact Concept Ontology (CCO) and provide users the option of exploring different semantic levels by using different CCOs. Experimental results show our approach is superior to previous work in many cases....... Additionally, we integrate the proposed methods into a text-based video search system (iVSearcher), to improve the user’s experience and retrieval performance significantly. To the best of our knowledge, this is the first system that integrates semantic information into video search and explores different...

  9. Querying Natural Logic Knowledge Bases

    DEFF Research Database (Denmark)

    Andreasen, Troels; Bulskov, Henrik; Jensen, Per Anker

    2017-01-01

    This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes in ontol......This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes...... in ontologies and class-relationships such as are common in life-science descriptions. The paper adopts a version of natural logic with recursive restrictive clauses such as relative clauses and adnominal prepositional phrases. It includes passive as well as active voice sentences. We outline a prototype...

  10. Heuristics-based query optimisation for SPARQL

    NARCIS (Netherlands)

    P. Tsialiamanis (Petros); E. Sidirourgos (Eleftherios); I. Fundulaki; V. Christophides; P.A. Boncz (Peter)

    2012-01-01

    textabstractQuery optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join order search space. In such cases, cost-based query optimization often is not possible. One practical reason for

  11. Path-based Queries on Trajectory Data

    DEFF Research Database (Denmark)

    Krogh, Benjamin Bjerre; Pelekis, Nikos; Theodoridis, Yannis

    2014-01-01

    In traffic research, management, and planning a number of path-based analyses are heavily used, e.g., for computing turn-times, evaluating green waves, or studying traffic flow. These analyses require retrieving the trajectories that follow the full path being analyzed. Existing path queries cannot...... sufficiently support such path-based analyses because they retrieve all trajectories that touch any edge in the path. In this paper, we define and formalize the strict path query. This is a novel query type tailored to support path-based analysis, where trajectories must follow all edges in the path...... a specific path by only retrieving data from the first and last edge in the path. To correctly answer strict path queries existing network-constrained trajectory indexes must retrieve data from all edges in the path. An extensive performance study of NETTRA using a very large real-world trajectory data set...

  12. Hit expansion approaches using multiple similarity methods and virtualized query structures.

    Science.gov (United States)

    Bergner, Andreas; Parel, Serge P

    2013-05-24

    Ligand-based virtual screening and computational hit expansion methods undoubtedly facilitate the finding of novel active chemical entities, utilizing already existing knowledge of active compounds. It has been demonstrated that the parallel execution of complementary similarity search methods enhances the performance of such virtual screening campaigns. In this article, we examine the use of virtualized template (query, seed) structures as an extension to common search methods, such as fingerprint and pharmacophore graph-based similarity searches. We demonstrate that template virtualization by bioisosteric enumeration and other rule-based methods, in combination with standard similarity search techniques, represents a powerful approach for hit expansion following high-throughput screening campaigns. The reliability of the methods is demonstrated by four different test data sets representing different target classes and two hit finding case studies on the epigenetic targets G9a and LSD1.

  13. Improving biomedical information retrieval by linear combinations of different query expansion techniques.

    Science.gov (United States)

    Abdulla, Ahmed AbdoAziz Ahmed; Lin, Hongfei; Xu, Bo; Banbhrani, Santosh Kumar

    2016-07-25

    Biomedical literature retrieval is becoming increasingly complex, and there is a fundamental need for advanced information retrieval systems. Information Retrieval (IR) programs scour unstructured materials such as text documents in large reserves of data that are usually stored on computers. IR is related to the representation, storage, and organization of information items, as well as to access. In IR one of the main problems is to determine which documents are relevant and which are not to the user's needs. Under the current regime, users cannot precisely construct queries in an accurate way to retrieve particular pieces of data from large reserves of data. Basic information retrieval systems are producing low-quality search results. In our proposed system for this paper we present a new technique to refine Information Retrieval searches to better represent the user's information need in order to enhance the performance of information retrieval by using different query expansion techniques and apply a linear combinations between them, where the combinations was linearly between two expansion results at one time. Query expansions expand the search query, for example, by finding synonyms and reweighting original terms. They provide significantly more focused, particularized search results than do basic search queries. The retrieval performance is measured by some variants of MAP (Mean Average Precision) and according to our experimental results, the combination of best results of query expansion is enhanced the retrieved documents and outperforms our baseline by 21.06 %, even it outperforms a previous study by 7.12 %. We propose several query expansion techniques and their combinations (linearly) to make user queries more cognizable to search engines and to produce higher-quality search results.

  14. Web-Based Distributed XML Query Processing

    NARCIS (Netherlands)

    Smiljanic, M.; Feng, L.; Jonker, Willem; Blanken, Henk; Grabs, T.; Schek, H-J.; Schenkel, R.; Weikum, G.

    2003-01-01

    Web-based distributed XML query processing has gained in importance in recent years due to the widespread popularity of XML on the Web. Unlike centralized and tightly coupled distributed systems, Web-based distributed database systems are highly unpredictable and uncontrollable, with a rather

  15. OntoQuery: easy-to-use web-based OWL querying

    Science.gov (United States)

    Tudose, Ilinca; Hastings, Janna; Muthukrishnan, Venkatesh; Owen, Gareth; Turner, Steve; Dekker, Adriano; Kale, Namrata; Ennis, Marcus; Steinbeck, Christoph

    2013-01-01

    Summary: The Web Ontology Language (OWL) provides a sophisticated language for building complex domain ontologies and is widely used in bio-ontologies such as the Gene Ontology. The Protégé-OWL ontology editing tool provides a query facility that allows composition and execution of queries with the human-readable Manchester OWL syntax, with syntax checking and entity label lookup. No equivalent query facility such as the Protégé Description Logics (DL) query yet exists in web form. However, many users interact with bio-ontologies such as chemical entities of biological interest and the Gene Ontology using their online Web sites, within which DL-based querying functionality is not available. To address this gap, we introduce the OntoQuery web-based query utility. Availability and implementation: The source code for this implementation together with instructions for installation is available at http://github.com/IlincaTudose/OntoQuery. OntoQuery software is fully compatible with all OWL-based ontologies and is available for download (CC-0 license). The ChEBI installation, ChEBI OntoQuery, is available at http://www.ebi.ac.uk/chebi/tools/ontoquery. Contact: hastings@ebi.ac.uk PMID:24008420

  16. CUFID-query: accurate network querying through random walk based network flow estimation.

    Science.gov (United States)

    Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

    2017-12-28

    Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Through extensive

  17. Query-Structure Based Web Page Indexing

    Science.gov (United States)

    2012-11-01

    task. 15. SUBJECT TERMS 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT Same as Report (SAR) 18. NUMBER OF PAGES 13 19a. NAME OF...finding, Entity finding, and Web pages classification . The design of highly-scalable indexing algorithms is needed, especially with an estimate of one...content, e.g., “ Fibromyalgia " or "Lipoma". • Combining: this type of query is processed using primitive keywords from urls and/or titles that imply

  18. Nearest private query based on quantum oblivious key distribution

    Science.gov (United States)

    Xu, Min; Shi, Run-hua; Luo, Zhen-yu; Peng, Zhen-wan

    2017-12-01

    Nearest private query is a special private query which involves two parties, a user and a data owner, where the user has a private input (e.g., an integer) and the data owner has a private data set, and the user wants to query which element in the owner's private data set is the nearest to his input without revealing their respective private information. In this paper, we first present a quantum protocol for nearest private query, which is based on quantum oblivious key distribution (QOKD). Compared to the classical related protocols, our protocol has the advantages of the higher security and the better feasibility, so it has a better prospect of applications.

  19. Better Search Through Query Expansion Using Controlled Vocabularies and Apache Solr

    Directory of Open Access Journals (Sweden)

    Scott Williams

    2013-04-01

    Full Text Available This article describes how the University of Pennsylvania Museum of Archaeology and Anthropology (Penn Museum modified its Solr-based discovery interface to improve recall and enable end users to benefit from the power of their in-house controlled vocabularies. These modifications automatically expand the query generated by any search term that matches their controlled vocabulary to include all related alternate and narrower terms. For example, if a user enters Ohio, that search will retrieve the record for an arrowhead found in Cincinnati (a narrower term of Ohio even if that record does not include the term Ohio.

  20. Web page sorting algorithm based on query keyword distance relation

    Science.gov (United States)

    Yang, Han; Cui, Hong Gang; Tang, Hao

    2017-08-01

    In order to optimize the problem of page sorting, according to the search keywords in the web page in the relationship between the characteristics of the proposed query keywords clustering ideas. And it is converted into the degree of aggregation of the search keywords in the web page. Based on the PageRank algorithm, the clustering degree factor of the query keyword is added to make it possible to participate in the quantitative calculation. This paper proposes an improved algorithm for PageRank based on the distance relation between search keywords. The experimental results show the feasibility and effectiveness of the method.

  1. In-route skyline querying for location-based services

    DEFF Research Database (Denmark)

    Xuegang, Huang; Jensen, Kristian S.

    2005-01-01

    With the emergence of an infrastructure for location-aware mobile services, the processing of advanced, location-based queries that are expected to underlie such services is gaining in relevance, While much work has assumed that users move in Euclidean space, this paper assumes that movement is c...

  2. Frequent Itemset Mining for Query Expansion in Microblog Ad-hoc Search

    Science.gov (United States)

    2012-11-01

    that increase diversity and ones that increase specificity of the query. More diversity is achieved by using itemsets that satisfy the disjunction of...contribute, @i kill termites , abating, upends, salts, h1n1, infestation, swine, @healthqd, paralysis, obesity, heart, epidemic*, #obesity, @n1hc, specialists

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

    Science.gov (United States)

    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…

  4. Ad-hoc Content-based Queries and Data Analysis for Virtual Observatories, Phase II

    Data.gov (United States)

    National Aeronautics and Space Administration — Aquilent, Inc. proposes to support ad-hoc, content-based query and data retrieval from virtual observatories (VxO) by developing 1) Higher Order Query Services that...

  5. Cardinal Direction Relations Query Modeling Based on Geo-Ontology

    Science.gov (United States)

    Zhu, X.; Chen, D.; Zhou, C.; Li, M.; Xiao, W.

    2012-08-01

    Direction relations, as an important spatial relationship, is simply expressed as object prosperity in traditional geo-ontology. The lacking of explicit specifications and reasoning rules of direction relations in geo-ontology result in the difficult or inflexible of spatial reasoning. Also, digital gazetteers provide information on named features, linking the feature's name with its location and its type. Although the location information is incomplete and not exact, the implicit spatial information, for example spatial relationships and spatial scale, can be extract using the appropriate models based on geo-ontology. In this paper, we proposed a novel conceptual framework of direction relations in order to formalize the semantics and implicit information of direction relations, and present an extraction algorithm of implicit information based on previous researches, which will produce a complete query instance of direction relations. At last, the most suitable direction physical model is recommended to calculation module according to relevant rules. And the experimental results show that this direction query model not only extracted the implicit information effectively, but also made a reasonable interpretation for the user's intention.

  6. Ontology based heterogeneous materials database integration and semantic query

    Science.gov (United States)

    Zhao, Shuai; Qian, Quan

    2017-10-01

    Materials digital data, high throughput experiments and high throughput computations are regarded as three key pillars of materials genome initiatives. With the fast growth of materials data, the integration and sharing of data is very urgent, that has gradually become a hot topic of materials informatics. Due to the lack of semantic description, it is difficult to integrate data deeply in semantic level when adopting the conventional heterogeneous database integration approaches such as federal database or data warehouse. In this paper, a semantic integration method is proposed to create the semantic ontology by extracting the database schema semi-automatically. Other heterogeneous databases are integrated to the ontology by means of relational algebra and the rooted graph. Based on integrated ontology, semantic query can be done using SPARQL. During the experiments, two world famous First Principle Computational databases, OQMD and Materials Project are used as the integration targets, which show the availability and effectiveness of our method.

  7. Expansion-based passive ranging

    Science.gov (United States)

    Barniv, Yair

    1993-01-01

    This paper describes a new technique of passive ranging which is based on utilizing the image-plane expansion experienced by every object as its distance from the sensor decreases. This technique belongs in the feature/object-based family. The motion and shape of a small window, assumed to be fully contained inside the boundaries of some object, is approximated by an affine transformation. The parameters of the transformation matrix are derived by initially comparing successive images, and progressively increasing the image time separation so as to achieve much larger triangulation baseline than currently possible. Depth is directly derived from the expansion part of the transformation. To a first approximation, image-plane expansion is independent of image-plane location with respect to the focus of expansion (FOE) and of platform maneuvers. Thus, an expansion-based method has the potential of providing a reliable range in the difficult image area around the FOE. In areas far from the FOE the shift parameters of the affine transformation can provide more accurate depth information than the expansion alone, and can thus be used similarly to the way they have been used in conjunction with the Inertial Navigation Unit (INU) and Kalman filtering. However, the performance of a shift-based algorithm, when the shifts are derived from the affine transformation, would be much improved compared to current algorithms because the shifts--as well as the other parameters--can be obtained between widely separated images. Thus, the main advantage of this new approach is that, allowing the tracked window to expand and rotate, in addition to moving laterally, enables one to correlate images over a very long time span which, in turn, translates into a large spatial baseline resulting in a proportionately higher depth accuracy.

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

    Directory of Open Access Journals (Sweden)

    Muhammad Afzal

    2015-08-01

    Full Text Available 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.

  9. A Web-Based Data-Querying Tool Based on Ontology-Driven Methodology and Flowchart-Based Model

    Science.gov (United States)

    Ping, Xiao-Ou; Chung, Yufang; Liang, Ja-Der; Yang, Pei-Ming; Huang, Guan-Tarn; Lai, Feipei

    2013-01-01

    Background Because of the increased adoption rate of electronic medical record (EMR) systems, more health care records have been increasingly accumulating in clinical data repositories. Therefore, querying the data stored in these repositories is crucial for retrieving the knowledge from such large volumes of clinical data. Objective The aim of this study is to develop a Web-based approach for enriching the capabilities of the data-querying system along the three following considerations: (1) the interface design used for query formulation, (2) the representation of query results, and (3) the models used for formulating query criteria. Methods The Guideline Interchange Format version 3.5 (GLIF3.5), an ontology-driven clinical guideline representation language, was used for formulating the query tasks based on the GLIF3.5 flowchart in the Protégé environment. The flowchart-based data-querying model (FBDQM) query execution engine was developed and implemented for executing queries and presenting the results through a visual and graphical interface. To examine a broad variety of patient data, the clinical data generator was implemented to automatically generate the clinical data in the repository, and the generated data, thereby, were employed to evaluate the system. The accuracy and time performance of the system for three medical query tasks relevant to liver cancer were evaluated based on the clinical data generator in the experiments with varying numbers of patients. Results In this study, a prototype system was developed to test the feasibility of applying a methodology for building a query execution engine using FBDQMs by formulating query tasks using the existing GLIF. The FBDQM-based query execution engine was used to successfully retrieve the clinical data based on the query tasks formatted using the GLIF3.5 in the experiments with varying numbers of patients. The accuracy of the three queries (ie, “degree of liver damage,” “degree of liver damage

  10. Improving the dictionary lookup approach for disease normalization using enhanced dictionary and query expansion.

    Science.gov (United States)

    Jonnagaddala, Jitendra; Jue, Toni Rose; Chang, Nai-Wen; Dai, Hong-Jie

    2016-01-01

    The rapidly increasing biomedical literature calls for the need of an automatic approach in the recognition and normalization of disease mentions in order to increase the precision and effectivity of disease based information retrieval. A variety of methods have been proposed to deal with the problem of disease named entity recognition and normalization. Among all the proposed methods, conditional random fields (CRFs) and dictionary lookup method are widely used for named entity recognition and normalization respectively. We herein developed a CRF-based model to allow automated recognition of disease mentions, and studied the effect of various techniques in improving the normalization results based on the dictionary lookup approach. The dataset from the BioCreative V CDR track was used to report the performance of the developed normalization methods and compare with other existing dictionary lookup based normalization methods. The best configuration achieved an F-measure of 0.77 for the disease normalization, which outperformed the best dictionary lookup based baseline method studied in this work by an F-measure of 0.13.Database URL: https://github.com/TCRNBioinformatics/DiseaseExtract. © The Author(s) 2016. Published by Oxford University Press.

  11. Entropy Based Analysis of DNS Query Traffic in the Campus Network

    Directory of Open Access Journals (Sweden)

    Dennis Arturo Ludeña Romaña

    2008-10-01

    Full Text Available We carried out the entropy based study on the DNS query traffic from the campus network in a university through January 1st, 2006 to March 31st, 2007. The results are summarized, as follows: (1 The source IP addresses- and query keyword-based entropies change symmetrically in the DNS query traffic from the outside of the campus network when detecting the spam bot activity on the campus network. On the other hand (2, the source IP addresses- and query keywordbased entropies change similarly each other when detecting big DNS query traffic caused by prescanning or distributed denial of service (DDoS attack from the campus network. Therefore, we can detect the spam bot and/or DDoS attack bot by only watching DNS query access traffic.

  12. Relaxing rdf queries based on user and domain preferences

    DEFF Research Database (Denmark)

    Dolog, Peter; Stueckenschmidt, Heiner; Wache, Holger

    2009-01-01

    knowledge and user preferences. We describe a framework for information access that combines query refinement and relaxation in order to provide robust, personalized access to heterogeneous resource description framework data as well as an implementation in terms of rewriting rules and explain its...

  13. Constraint based frequent pattern mining for generalized query ...

    African Journals Online (AJOL)

    The World-Wide Web provides every Internet citizen access to an abundance of information, but difficulty increases in identifying the relevant piece of information. Popular Search engine uses log for keeping track of user activities including user queries, click-through and their behavior. Research in web mining tries to ...

  14. Algebra-Based Optimization of XML-Extended OLAP Queries

    DEFF Research Database (Denmark)

    Yin, Xuepeng; Pedersen, Torben Bach

    2006-01-01

    In today’s OLAP systems, integrating fast changing data physically into a cube is complex and time-consuming. Our solution, the “OLAP-XML Federation System,” makes it possible to reference the fast changing data in XML format in OLAP queries without physical integration. In this paper, we introdu...

  15. MRA Based Efficient Database Storing and Fast Querying Technique

    Directory of Open Access Journals (Sweden)

    Mitko Kostov

    2017-02-01

    Full Text Available In this paper we consider a specific way of organizing 1D signals or 2D image databases, such that a more efficient storage and faster querying is achieved. A multiresolution technique of data processing is used in order of saving the most significant processed data.

  16. Memory-Aware Query Routing in Interactive Web-based Information Systems

    NARCIS (Netherlands)

    F. Waas; M.L. Kersten (Martin)

    2001-01-01

    textabstractQuery throughput is one of the primary optimization goals in interactive web-based information systems in order to achieve the performance necessary to serve large user communities. Queries in this application domain differ significantly from those in traditional database applications:

  17. An Overview of Data Models and Query Languages for Content-based Video Retrieval

    NARCIS (Netherlands)

    Petkovic, M.; Jonker, Willem

    As a large amount of video data becomes publicly available, the need to model and query this data efficiently becomes significant. Consequently, content-based retrieval of video data turns out to be a challenging and important problem addressing areas such as video modelling, indexing, querying,

  18. Query responses

    Directory of Open Access Journals (Sweden)

    Paweł Łupkowski

    2017-05-01

    Full Text Available In this article we consider the phenomenon of answering a query with a query. Although such answers are common, no large scale, corpus-based characterization exists, with the exception of clarification requests. After briefly reviewing different theoretical approaches on this subject, we present a corpus study of query responses in the British National Corpus and develop a taxonomy for query responses. We point at a variety of response categories that have not been formalized in previous dialogue work, particularly those relevant to adversarial interaction. We show that different response categories have significantly different rates of subsequent answer provision. We provide a formal analysis of the response categories in the framework of KoS.

  19. Expanded and updated data and a query pipeline for iBeetle-Base.

    Science.gov (United States)

    Dönitz, Jürgen; Gerischer, Lizzy; Hahnke, Stefan; Pfeiffer, Stefan; Bucher, Gregor

    2018-01-04

    The iBeetle-Base provides access to sequence and phenotype information for genes of the beetle Tribolium castaneum. It has been updated including more and updated data and new functions. RNAi phenotypes are now available for >50% of the genes, which represents an expansion of 60% compared to the previous version. Gene sequence information has been updated based on the new official gene set OGS3 and covers all genes. Interoperability with FlyBase has been enhanced: First, gene information pages of homologous genes are interlinked between both databases. Second, some steps of a new query pipeline allow transforming gene lists from either species into lists with related gene IDs, names or GO terms. This facilitates the comparative analysis of gene functions between fly and beetle. The backend of the pipeline is implemented as endpoints of a RESTful interface, such that it can be reused by other projects or tools. A novel online interface allows the community to propose GO terms for their gene of interest expanding the range of animals where GO terms are defined. iBeetle-Base is available at http://ibeetle-base.uni-goettingen.de/. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

  20. Web-based topology queries on a BIM model

    DEFF Research Database (Denmark)

    Rasmussen, Mads Holten; Hviid, Christian Anker; Karlshøj, Jan

    Building Information Modeling (BIM) is in the industry often confused with 3D-modeling regardless that the potential of modeling information goes way beyond performing clash detections on geometrical objects occupying the same physical space. Lately, several research projects have tried to change...... that by extending BIM with information using linked data technologies. However, when showing information alone the strong communication benefits of 3D are neglected, and a practical way of connecting the two worlds is currently missing. In this paper, we present a prototype of a visual query interface running...... is to establish a baseline for discussion of the general design choices that have been considered, and the developed application further serves as a proof of concept for combining BIM model data with a knowledge graph and potentially other sources of Linked Open Data, in a simple web interface....

  1. CSA: A Credibility Search Algorithm Based on Different Query in Unstructured Peer-to-Peer Networks

    Directory of Open Access Journals (Sweden)

    Hongyan Mei

    2014-01-01

    Full Text Available Efficient searching for resources has become a challenging task with less network bandwidth consumption in unstructured peer-to-peer (P2P networks. Heuristic search mechanism is an effective method which depends on the previous searches to guide future ones. In the proposed methods, searching for high-repetition resources is more effective. However, the performances of the searches for nonrepetition or low-repetition or rare resources need to be improved. As for this problem, considering the similarity between social networks and unstructured P2P networks, we present a credibility search algorithm based on different queries according to the trust production principle in sociology and psychology. In this method, queries are divided into familiar queries and unfamiliar queries. For different queries, we adopt different ways to get the credibility of node to its each neighbor. And then queries should be forwarded by the neighbor nodes with higher credibility. Experimental results show that our method can improve query hit rate and reduce search delay with low bandwidth consumption in three different network topologies under static and dynamic network environments.

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

    Science.gov (United States)

    2002-01-01

    can pose queries via a simple point-and-click, form-based user interface without ever needing to write SQL queries. Similarity searching also allows...monotonic scor- ing functions that has been adopted by the Garlic multimedia information system under develop- ment at the IBM Almaden Research Center...product memory costs [60]. On the other hand, in Garlic , the data items returned by each stream must wait in a temporary file until the completion of the

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

    International Nuclear Information System (INIS)

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

    2011-01-01

    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.

  4. An XML-Based Manipulation and Query Language for Rule-Based Information

    Science.gov (United States)

    Mansour, Essam; Höpfner, Hagen

    Rules are utilized to assist in the monitoring process that is required in activities, such as disease management and customer relationship management. These rules are specified according to the application best practices. Most of research efforts emphasize on the specification and execution of these rules. Few research efforts focus on managing these rules as one object that has a management life-cycle. This paper presents our manipulation and query language that is developed to facilitate the maintenance of this object during its life-cycle and to query the information contained in this object. This language is based on an XML-based model. Furthermore, we evaluate the model and language using a prototype system applied to a clinical case study.

  5. Robust QKD-based private database queries based on alternative sequences of single-qubit measurements

    Science.gov (United States)

    Yang, YuGuang; Liu, ZhiChao; Chen, XiuBo; Zhou, YiHua; Shi, WeiMin

    2017-12-01

    Quantum channel noise may cause the user to obtain a wrong answer and thus misunderstand the database holder for existing QKD-based quantum private query (QPQ) protocols. In addition, an outside attacker may conceal his attack by exploiting the channel noise. We propose a new, robust QPQ protocol based on four-qubit decoherence-free (DF) states. In contrast to existing QPQ protocols against channel noise, only an alternative fixed sequence of single-qubit measurements is needed by the user (Alice) to measure the received DF states. This property makes it easy to implement the proposed protocol by exploiting current technologies. Moreover, to retain the advantage of flexible database queries, we reconstruct Alice's measurement operators so that Alice needs only conditioned sequences of single-qubit measurements.

  6. An Ontology-Based Reasoning Framework for Querying Satellite Images for Disaster Monitoring

    Directory of Open Access Journals (Sweden)

    Marjan Alirezaie

    2017-11-01

    Full Text Available This paper presents a framework in which satellite images are classified and augmented with additional semantic information to enable queries about what can be found on the map at a particular location, but also about paths that can be taken. This is achieved by a reasoning framework based on qualitative spatial reasoning that is able to find answers to high level queries that may vary on the current situation. This framework called SemCityMap, provides the full pipeline from enriching the raw image data with rudimentary labels to the integration of a knowledge representation and reasoning methods to user interfaces for high level querying. To illustrate the utility of SemCityMap in a disaster scenario, we use an urban environment—central Stockholm—in combination with a flood simulation. We show that the system provides useful answers to high-level queries also with respect to the current flood status. Examples of such queries concern path planning for vehicles or retrieval of safe regions such as “find all regions close to schools and far from the flooded area”. The particular advantage of our approach lies in the fact that ontological information and reasoning is explicitly integrated so that queries can be formulated in a natural way using concepts on appropriate level of abstraction, including additional constraints.

  7. Performance evaluation of unified medical language system®'s synonyms expansion to query PubMed

    Directory of Open Access Journals (Sweden)

    Griffon Nicolas

    2012-02-01

    Full Text Available Abstract Background PubMed is the main access to medical literature on the Internet. In order to enhance the performance of its information retrieval tools, primarily non-indexed citations, the authors propose a method: expanding users' queries using Unified Medical Language System' (UMLS synonyms i.e. all the terms gathered under one unique Concept Unique Identifier. Methods This method was evaluated using queries constructed to emphasize the differences between this new method and the current PubMed automatic term mapping. Four experts assessed citation relevance. Results Using UMLS, we were able to retrieve new citations in 45.5% of queries, which implies a small increase in recall. The new strategy led to a heterogeneous 23.7% mean increase in non-indexed citation retrieved. Of these, 82% have been published less than 4 months earlier. The overall mean precision was 48.4% but differed according to the evaluators, ranging from 36.7% to 88.1% (Inter rater agreement was poor: kappa = 0.34. Conclusions This study highlights the need for specific search tools for each type of user and use-cases. The proposed strategy may be useful to retrieve recent scientific advancement.

  8. QueryArch3D: Querying and Visualising 3D Models of a Maya Archaeological Site in a Web-Based Interface

    Directory of Open Access Journals (Sweden)

    Giorgio Agugiaro

    2011-12-01

    Full Text Available Constant improvements in the field of surveying, computing and distribution of digital-content are reshaping the way Cultural Heritage can be digitised and virtually accessed, even remotely via web. A traditional 2D approach for data access, exploration, retrieval and exploration may generally suffice, however more complex analyses concerning spatial and temporal features require 3D tools, which, in some cases, have not yet been implemented or are not yet generally commercially available. Efficient organisation and integration strategies applicable to the wide array of heterogeneous data in the field of Cultural Heritage represent a hot research topic nowadays. This article presents a visualisation and query tool (QueryArch3D conceived to deal with multi-resolution 3D models. Geometric data are organised in successive levels of detail (LoD, provided with geometric and semantic hierarchies and enriched with attributes coming from external data sources. The visualisation and query front-end enables the 3D navigation of the models in a virtual environment, as well as the interaction with the objects by means of queries based on attributes or on geometries. The tool can be used as a standalone application, or served through the web. The characteristics of the research work, along with some implementation issues and the developed QueryArch3D tool will be discussed and presented.

  9. Interactive Query Workstation: standardizing access to computer-based medical resources.

    Science.gov (United States)

    Cimino, C; Barnett, G O; Hassan, L; Blewett, D R; Piggins, J L

    1991-08-01

    Methods of using multiple computer-based medical resources efficiently have previously required either the user to manage the choice of resource and terms, or specialized programming. Standardized descriptions of what resources can do and how they may be accessed would allow the creation of an interface for multiple resources. This interface would assist a user in formulating queries, accessing the resources and managing the results. This paper describes a working prototype, the Interactive Query Workstation (IQW). The IQW allows users to query multiple resources: a medical knowledge base (DXplain), a clinical database (COSTAR/MQL), a bibliographic database (MEDLINE), a cancer database (PDQ), and a drug interaction database (PDR). Descriptions of each resource were developed to allow IQW to access these resources. The descriptions are composed of information on how data are sent and received from a resource, information on types of query to which a resource can respond, and information on what types of information are needed to execute a query. These components form the basis of a standard description of resources.

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

    Science.gov (United States)

    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. Copyright © 2015 Elsevier Inc. All rights reserved.

  11. TERM WEIGHTING BASED ON POSITIVE IMPACT FACTOR QUERY FOR ARABIC FIQH DOCUMENT RANKING

    Directory of Open Access Journals (Sweden)

    Rizka Sholikah

    2017-02-01

    Full Text Available Query becomes one of the most decisive factor on documents searching. A query contains several words, where one of them will become a key term. Key term is a word that has higher information and value than the others in query. It can be used in any kind of text documents, including Arabic Fiqh documents. Using key term in term weighting process could led to an improvement on result’s relevancy. In Arabic Fiqh document searching, not using the proper method in term weighting will relieve important value of key term. In this paper, we propose a new term weighting method based on Positive Impact Factor Query (PIFQ for Arabic Fiqh documents ranking. PIFQ calculated using key term’s frequency on each category (mazhab on Fiqh. The key term that frequently appear on a certain mazhab will get higher score on that mazhab, and vice versa. After PIFQ values are acquired, TF.IDF calculation will be done to each words. Then, PIFQ weight will be combine with the result from TF.IDF so that the new weight values for each words will be produced. Experimental result performed on a number of queries using 143 Arabic Fiqh documents show that the proposed method is better than traditional TF.IDF, with 77.9%, 83.1%, and 80.1% of precision, recall, and F-measure respectively.

  12. Autocorrelation and Regularization of Query-Based Information Retrieval Scores

    Science.gov (United States)

    2008-02-01

    like dogs, are digitigrades: they walk directly on their toes, the bones of their feet making up the lower part of the visible leg. (b) Molecular...techniques in information retrieval. Artif . Intell. Rev., 11(6):453–482, 1997. W. B. Croft. A model of cluster searching based on classification

  13. Smart Agent Based Mobile Tutoring and Querying System

    Directory of Open Access Journals (Sweden)

    Suresh Sankaranarayanan

    2012-08-01

    Full Text Available With our busy schedules today and the rising cost of education there is a need to find a convenient and cost effective means of maximizing our educational/training experiences. New trends in the delivery/access of information are becoming more technology based in all areas of society with education being no exception. The ubiquitous use of mobile devices has led to a boom in m-commerce. Mobile devices provide many services in commercial environments such as mobile banking, mobile purchasing, mobile learning, etc. It is therefore fitting that we seek to use mobile devices as a platform in delivering our convenient and cost effective solution. The proposed agent based Mobile tutoring system seeks to provide a student with a rich learning experience that will provide them with the relevant reading material based on their stage of development which allows them to move at their own pace. The system will allow the user to be able to ask certain questions and get explanations as if they were interacting with a human tutor but with the added benefit of being able to do this anytime in any location via their mobile phone.

  14. Image-based querying of urban knowledge databases

    Science.gov (United States)

    Cho, Peter; Bae, Soonmin; Durand, Fredo

    2009-05-01

    We extend recent automated computer vision algorithms to reconstruct the global three-dimensional structures for photos and videos shot at fixed points in outdoor city environments. Mosaics of digital stills and embedded videos are georegistered by matching a few of their 2D features with 3D counterparts in aerial ladar imagery. Once image planes are aligned with world maps, abstract urban knowledge can propagate from the latter into the former. We project geotagged annotations from a 3D map into a 2D video stream and demonstrate their tracking buildings and streets in a clip with significant panning motion. We also present an interactive tool which enables users to select city features of interest in video frames and retrieve their geocoordinates and ranges. Implications of this work for future augmented reality systems based upon mobile smart phones are discussed.

  15. Retrieval Architecture with Classified Query for Content Based Image Recognition

    Directory of Open Access Journals (Sweden)

    Rik Das

    2016-01-01

    Full Text Available The consumer behavior has been observed to be largely influenced by image data with increasing familiarity of smart phones and World Wide Web. Traditional technique of browsing through product varieties in the Internet with text keywords has been gradually replaced by the easy accessible image data. The importance of image data has portrayed a steady growth in application orientation for business domain with the advent of different image capturing devices and social media. The paper has described a methodology of feature extraction by image binarization technique for enhancing identification and retrieval of information using content based image recognition. The proposed algorithm was tested on two public datasets, namely, Wang dataset and Oliva and Torralba (OT-Scene dataset with 3688 images on the whole. It has outclassed the state-of-the-art techniques in performance measure and has shown statistical significance.

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

    Science.gov (United States)

    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.

  17. Query and Update Efficient B+-Tree Based Indexing of Moving Objects

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Lin, Dan; Ooi, Beng Chin

    2004-01-01

    are streamed to a database. Indexes for moving objects must support queries efficiently, but must also support frequent updates. Indexes based on minimum bounding regions (MBRs) such as the R-tree exhibit high concurrency overheads during node splitting, and each individual update is known to be quite costly...

  18. haploR: an R package for querying web-based annotation tools.

    Science.gov (United States)

    Zhbannikov, Ilya Y; Arbeev, Konstantin; Ukraintseva, Svetlana; Yashin, Anatoliy I

    2017-01-01

    We developed haploR , an R package for querying web based genome annotation tools HaploReg and RegulomeDB. haploR gathers information in a data frame which is suitable for downstream bioinformatic analyses. This will facilitate post-genome wide association studies streamline analysis for rapid discovery and interpretation of genetic associations.

  19. A Streams-Based Framework for Defining Location-Based Queries

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Xuegang, Huang

    2007-01-01

    n infrastructure is emerging that supports the delivery of on-line, location-enabled services to mobile users. Such services involve novel database queries, and the database research community is quite active in proposing techniques for the efficient processing of such queries. In parallel to this......, the management of data streams has become an active area of research. While most research in mobile services concerns performance issues, this paper aims to establish a formal framework for defining the semantics of queries encountered in mobile services, most notably the so-called continuous queries...... that are particularly relevant in this context. Rather than inventing an entirely new framework, the paper proposes a framework that builds on concepts from data streams and temporal databases. Definitions of example queries demonstrates how the framework enables clear formulation of query semantics and the comparison...

  20. Towards A Streams-Based Framework for Defining Location-Based Queries

    DEFF Research Database (Denmark)

    Huang, Xuegang; Jensen, Christian S.

    2004-01-01

    An infrastructure is emerging that supports the delivery of on-line, location-enabled services to mobile users. Such services involve novel database queries, and the database research community is quite active in proposing techniques for the effi- cient processing of such queries. In parallel...... to this, the management of data streams has become an active area of research. While most research in mobile services concerns performance issues, this paper aims to establish a formal framework for defining the semantics of queries encountered in mobile services, most notably the so-called continuous...... queries that are particularly relevant in this context. Rather than inventing an entirely new framework, the paper proposes a framework that builds on concepts from data streams and temporal databases. Definitions of example queries demonstrates how the framework enables clear formulation of query...

  1. Advanced hybrid query tree algorithm based on slotted backoff mechanism in RFID

    Directory of Open Access Journals (Sweden)

    XIE Xiaohui

    2013-12-01

    Full Text Available The merits of performance quality for a RFID system are determined by the effectiveness of tag anti-collision algorithm.Many algorithms for RFID system of tag identification have been proposed,but they all have obvious weaknesses,such as slow speed of identification,unstable and so on.The existing algorithms can be divided into two groups,one is based on ALOHA and another is based on query tree.This article is based on the hybrid query tree algorithm,combined with a slotted backoff mechanism and a specific encoding (Manchester encoding.The number of value“1” in every three consecutive bits of tags is used to determine the tag response time slots,which will greatly reduce the time slot of the collision and improve the recognition efficiency.

  2. MHBase: A Distributed Real-Time Query Scheme for Meteorological Data Based on HBase

    Directory of Open Access Journals (Sweden)

    Tinghuai Ma

    2016-03-01

    Full Text Available Meteorological technology has evolved rapidly in recent years to provide enormous, accurate and personalized advantages in the public service. Large volumes of observational data are generated gradually by technologies such as geographical remote sensing, meteorological radar satellite, etc. that makes data analysis in weather forecasting more precise but also poses a threat to the traditional method of data storage. In this paper, we present MHBase, (Meteorological data based on HBase (Hadoop Database, a distributed real-time query scheme for meteorological data based on HBase. The calibrated data obtained from terminal devices will be partitioned into HBase and persisted to HDFS (the Hadoop Distributed File System. We propose two algorithms (the Indexed Store and the Indexed Retrieve Algorithms to implement a secondary index using HBase Coprocessors, which allow MHbase to provide high performance data querying on columns other than rowkey. Experimental results show that the performance of MHBase can satisfy the basic demands of meteorological business services.

  3. Age-related differences in the accuracy of web query-based predictions of influenza-like illness.

    Directory of Open Access Journals (Sweden)

    Alexander Domnich

    Full Text Available 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.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.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.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.

  4. Estimating Selectivity for Current Query of Moving Objects Using Index-Based Histogram

    Science.gov (United States)

    Chi, Jeong Hee; Kim, Sang Ho

    Selectivity estimation is one of the query optimization techniques. It is difficult for the previous selectivity estimation techniques for moving objects to apply the location change of moving objects to synopsis. Therefore, they result in much error when estimating selectivity for queries, because they are based on the extended spatial synopsis which does not consider the property of the moving objects. In order to reduce the estimation error, the existing techniques should often rebuild the synopsis. Consequently problem occurs, that is, the whole database should be read frequently. In this paper, we proposed a moving object histogram method based on quadtree to develop a selectivity estimation technique for moving object queries. We then analyzed the performance of the proposed method through the implementation and evaluation of the proposed method. Our method can be used in various location management systems such as vehicle location tracking systems, location based services, telematics services, emergency rescue service, etc in which the location information of moving objects changes over time.

  5. Location-Based Top-k Term Querying over Sliding Window

    KAUST Repository

    Xu, Ying

    2017-10-03

    In part due to the proliferation of GPS-equipped mobile devices, massive svolumes of geo-tagged streaming text messages are becoming available on social media. It is of great interest to discover most frequent nearby terms from such tremendous stream data. In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering top-k locally popular nearby terms over a sliding window. Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering both the term frequency and the proximities between the messages containing the term and the query location. We develop a novel and efficient mechanism to solve the problem, including a quad-tree based indexing structure, indexing update technique, and a best-first based searching algorithm. An empirical study is conducted to show that our proposed techniques are efficient and fit for users’ requirements through varying a number of parameters.

  6. Probabilistic Data Modeling and Querying for Location-Based Data Warehouses

    DEFF Research Database (Denmark)

    Timko, Igor; Dyreson, Curtis E.; Pedersen, Torben Bach

    2005-01-01

    Motivated by the increasing need to handle complex, dynamic, uncertain multidimensional data in location-based warehouses, this paper proposes a novel probabilistic data model that can address the complexities of such data. The model provides a foundation for handling complex hierarchical...... and uncertain data, e.g., data from the location-based services domain such as transportation infrastructures and the attached static and dynamic content such as speed limits and vehicle positions. The paper also presents algebraic operators that support querying of such data. The work is motivated...... with a realworld case study, based on our collaboration with a leading Danish vendor of location-based services....

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

    DEFF Research Database (Denmark)

    Wilkowski, Bartlomiej; Szewczyk, Marcin Marek; Rasmussen, Peter Mondrup

    2010-01-01

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

  8. INTEGRATIVE METHOD OF TEACHING INFORMATION MODELING IN PRACTICAL HEALTH SERVICE BASED ON MICROSOFT ACCESS QUERIES

    Directory of Open Access Journals (Sweden)

    Svetlana A. Firsova

    2016-06-01

    Full Text Available Introduction: this article explores the pedagogical technology employed to teach medical students foundations of work with MICROSOFT ACCESS databases. The above technology is based on integrative approach to the information modeling in public health practice, drawing upon basic didactic concepts that pertain to objects and tools databases created in MICROSOFT ACCESS. The article examines successive steps in teaching the topic “Queries in MICROSOFT ACCESS” – from simple queries to complex ones. The main attention is paid to such components of methodological system, as the principles and teaching methods classified according to the degree of learners’ active cognitive activity. The most interesting is the diagram of the relationship of learning principles, teaching methods and specific types of requests. Materials and Methods: the authors used comparative analysis of literature, syllabi, curricula in medical informatics taught at leading medical universities in Russia. Results: the original technique of training in putting queries with databases of MICROSOFT ACCESS is presented for analysis of information models in practical health care. Discussion and Conclusions: it is argued that the proposed pedagogical technology will significantly improve the effectiveness of teaching the course “Medical Informatics”, that includes development and application of models to simulate the operation of certain facilities and services of the health system which, in turn, increases the level of information culture of practitioners.

  9. Superfund Query

    Data.gov (United States)

    U.S. Environmental Protection Agency — The Superfund Query allows users to retrieve data from the Comprehensive Environmental Response, Compensation, and Liability Information System (CERCLIS) database.

  10. A Novel Quantum Solution to Privacy-Preserving Nearest Neighbor Query in Location-Based Services

    Science.gov (United States)

    Luo, Zhen-yu; Shi, Run-hua; Xu, Min; Zhang, Shun

    2018-04-01

    We present a cheating-sensitive quantum protocol for Privacy-Preserving Nearest Neighbor Query based on Oblivious Quantum Key Distribution and Quantum Encryption. Compared with the classical related protocols, our proposed protocol has higher security, because the security of our protocol is based on basic physical principles of quantum mechanics, instead of difficulty assumptions. Especially, our protocol takes single photons as quantum resources and only needs to perform single-photon projective measurement. Therefore, it is feasible to implement this protocol with the present technologies.

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

    Science.gov (United States)

    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.

  12. Scribble query

    DEFF Research Database (Denmark)

    Nielsen, Matthias; Elmqvist, Niklas; Grønbæk, Kaj

    2016-01-01

    The wide availability of touch-enabled devices is a unique opportunity for visualization research to invent novel techniques to fluently explore, analyse, and understand complex and large-scale data. In this paper, we introduce Scribble Query, a novel interaction technique for fluid freehand scri...... visualization with Scribble Query. The studies suggest that Scribble Query has a low entry barrier facilitating easy adoption, casual and infrequent usage, and in one case, enabled live dissemination of findings by the domain expert to managers in the organization....... scribbling (casual drawing) on touch-enabled devices to support interactive querying in data visualizations. Inspired by the low-entry yet rich interaction of touch drawing applications, a Scribble Query can be created with a single touch stroke yet have the expressiveness of multiple brushes (a...

  13. Development and empirical user-centered evaluation of semantically-based query recommendation for an electronic health record search engine.

    Science.gov (United States)

    Hanauer, David A; Wu, Danny T Y; Yang, Lei; Mei, Qiaozhu; Murkowski-Steffy, Katherine B; Vydiswaran, V G Vinod; Zheng, Kai

    2017-03-01

    The utility of biomedical information retrieval environments can be severely limited when users lack expertise in constructing effective search queries. To address this issue, we developed a computer-based query recommendation algorithm that suggests semantically interchangeable terms based on an initial user-entered query. In this study, we assessed the value of this approach, which has broad applicability in biomedical information retrieval, by demonstrating its application as part of a search engine that facilitates retrieval of information from electronic health records (EHRs). The query recommendation algorithm utilizes MetaMap to identify medical concepts from search queries and indexed EHR documents. Synonym variants from UMLS are used to expand the concepts along with a synonym set curated from historical EHR search logs. The empirical study involved 33 clinicians and staff who evaluated the system through a set of simulated EHR search tasks. User acceptance was assessed using the widely used technology acceptance model. The search engine's performance was rated consistently higher with the query recommendation feature turned on vs. off. The relevance of computer-recommended search terms was also rated high, and in most cases the participants had not thought of these terms on their own. The questions on perceived usefulness and perceived ease of use received overwhelmingly positive responses. A vast majority of the participants wanted the query recommendation feature to be available to assist in their day-to-day EHR search tasks. Challenges persist for users to construct effective search queries when retrieving information from biomedical documents including those from EHRs. This study demonstrates that semantically-based query recommendation is a viable solution to addressing this challenge. Published by Elsevier Inc.

  14. A Weighted K-AP Query Method for RSSI based Indoor Positioning

    DEFF Research Database (Denmark)

    Huo, Huan; Liu, Xiufeng; Li, Jifeng

    2016-01-01

    The paper studies the establishment of offline fingerprint library based on RSSI (Received Signal Strength Indication), and proposes WF-SKL algorithm by introducing the correlation between RSSIs. The correlations can be transformed as AP fingerprint sequence to build the offline fingerprint library....... To eliminate the positioning error caused by instable RSSI value, WF-SKL can filter the noise AP via online AP selection, meanwhile it also reduces the computation load. WF-SKL utilizes LCS algorithm to find out the measurement between the nearest neighbors, and it proposes K-AP (P,Q) nearest neighbor queries...

  15. An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ehsan Ahvar

    2014-01-01

    attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

  16. PROTICdb: a web-based application to store, track, query, and compare plant proteome data.

    Science.gov (United States)

    Ferry-Dumazet, Hélène; Houel, Gwenn; Montalent, Pierre; Moreau, Luc; Langella, Olivier; Negroni, Luc; Vincent, Delphine; Lalanne, Céline; de Daruvar, Antoine; Plomion, Christophe; Zivy, Michel; Joets, Johann

    2005-05-01

    PROTICdb is a web-based application, mainly designed to store and analyze plant proteome data obtained by two-dimensional polyacrylamide gel electrophoresis (2-D PAGE) and mass spectrometry (MS). The purposes of PROTICdb are (i) to store, track, and query information related to proteomic experiments, i.e., from tissue sampling to protein identification and quantitative measurements, and (ii) to integrate information from the user's own expertise and other sources into a knowledge base, used to support data interpretation (e.g., for the determination of allelic variants or products of post-translational modifications). Data insertion into the relational database of PROTICdb is achieved either by uploading outputs of image analysis and MS identification software, or by filling web forms. 2-D PAGE annotated maps can be displayed, queried, and compared through a graphical interface. Links to external databases are also available. Quantitative data can be easily exported in a tabulated format for statistical analyses. PROTICdb is based on the Oracle or the PostgreSQL Database Management System and is freely available upon request at the following URL: http://moulon.inra.fr/ bioinfo/PROTICdb.

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

    Science.gov (United States)

    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

  18. Hardware Acceleration of SQL-Queries Processing in MDM-Systems Based on MISDSolution

    Directory of Open Access Journals (Sweden)

    V. E. Podol'skii

    2015-01-01

    Full Text Available In this article we examine the possibility of hardware support for functions of mobile device management platform (MDM-platform using a Multiple Instructions and Single Data stream computer system, developed within the framework of the project in Bauman Moscow State Technical University. At the universities the MDM-platform is used to provide various mobile services for the faculty, students and administration to facilitate the learning process: a mobile schedule, document sharing, text messages, and other interactive activities. Most of these services are provided by the extensive use of data stored in MDM-platform databases. When accessing the databases SQL- queries are commonly used. These queries comprise operators of SQL-language that are based on mathematical sets theory. Hardware support for operations on sets is implemented in Multiple Instructions and Single Data stream computer system (MISD System. This allows performance improvement of algorithms and operations on sets. Thus, the hardware support for the processing of SQL-queries in MISD system allows us to benefit from the implementation of SQL-queries in the MISD paradigm.The scientific novelty of the work lies in the fact that it is the first time a set of algorithms for basic SQL statements has been presented in a format supported by MISD system. In addition, for the first time operators INNER JOIN, LEFT JOIN and LEFT OUTER JOIN have been implemented for MISD system and tested for it (testing was done for FPGA Xilinx Virtex-II Pro XC2VP30 implementation of MISD system. The practical significance of the work lies in the fact that the results of the study will be used in the project "Development of the Russian analogue of the system software for centralized management of personal devices and platforms in enterprise networks" of the St. Petersburg Polytechnic University (with the financial support of the state represented by the Ministry of Education and Science of the Russian

  19. FORECASTING URBAN EXPANSION BASED ON NIGHT LIGHTS

    Directory of Open Access Journals (Sweden)

    D. Stathakis

    2016-06-01

    Full Text Available Forecasting urban expansion models are a very powerful tool in the hands of urban planners in order to anticipate and mitigate future urbanization pressures. In this paper, a linear regression forecasting urban expansion model is implemented based on the annual composite night lights time series available from National Oceanic and Atmospheric Administration (NOAA. The product known as 'stable lights' is used in particular, after it has been corrected with a standard intercalibration process to reduce artificial year-to-year fluctuations as much as possible. Forecasting is done for ten years after the end of the time series. Because the method is spatially explicit the predicted expansion trends are relatively accurately mapped. Two metrics are used to validate the process. The first one is the year-to-year Sum of Lights (SoL variation. The second is the year-to-year image correlation coefficient. Overall it is evident that the method is able to provide an insight on future urbanization pressures in order to be taken into account in planning. The trends are quantified in a clear spatial manner.

  20. Random Secure Comparator Selection Based Privacy-Preserving MAX/MIN Query Processing in Two-Tiered Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hua Dai

    2016-01-01

    Full Text Available Privacy-preserving data queries for wireless sensor networks (WSNs have drawn much attention recently. This paper proposes a privacy-preserving MAX/MIN query processing approach based on random secure comparator selection in two-tiered sensor network, which is denoted by RSCS-PMQ. The secret comparison model is built on the basis of the secure comparator which is defined by 0-1 encoding and HMAC. And the minimal set of highest secure comparators generating algorithm MaxRSC is proposed, which is the key to realize RSCS-PMQ. In the data collection procedures, the sensor node randomly selects a generated secure comparator of the maximum data into ciphertext which is submitted to the nearby master node. In the query processing procedures, the master node utilizes the MaxRSC algorithm to determine the corresponding minimal set of candidate ciphertexts containing the query results and returns it to the base station. And the base station obtains the plaintext query result through decryption. The theoretical analysis and experimental result indicate that RSCS-PMQ can preserve the privacy of sensor data and query result from master nodes even if they are compromised, and it has a better performance on the network communication cost than the existing approaches.

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

    Science.gov (United States)

    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

  2. Linearity of network proximity measures: implications for set-based queries and significance testing.

    Science.gov (United States)

    Maxwell, Sean; Chance, Mark R; Koyutürk, Mehmet

    2017-05-01

    In recent years, various network proximity measures have been proposed to facilitate the use of biomolecular interaction data in a broad range of applications. These applications include functional annotation, disease gene prioritization, comparative analysis of biological systems and prediction of new interactions. In such applications, a major task is the scoring or ranking of the nodes in the network in terms of their proximity to a given set of 'seed' nodes (e.g. a group of proteins that are identified to be associated with a disease, or are deferentially expressed in a certain condition). Many different network proximity measures are utilized for this purpose, and these measures are quite diverse in terms of the benefits they offer. We propose a unifying framework for characterizing network proximity measures for set-based queries. We observe that many existing measures are linear, in that the proximity of a node to a set of nodes can be represented as an aggregation of its proximity to the individual nodes in the set. Based on this observation, we propose methods for processing of set-based proximity queries that take advantage of sparse local proximity information. In addition, we provide an analytical framework for characterizing the distribution of proximity scores based on reference models that accurately capture the characteristics of the seed set (e.g. degree distribution and biological function). The resulting framework facilitates computation of exact figures for the statistical significance of network proximity scores, enabling assessment of the accuracy of Monte Carlo simulation based estimation methods. Implementations of the methods in this paper are available at https://bioengine.case.edu/crosstalker which includes a robust visualization for results viewing. stm@case.edu or mxk331@case.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions

  3. KoralQuery -- A General Corpus Query Protocol

    DEFF Research Database (Denmark)

    Bingel, Joachim; Diewald, Nils

    2015-01-01

    The task-oriented and format-driven development of corpus query systems has led to the creation of numerous corpus query languages (QLs) that vary strongly in expressiveness and syntax. This is a severe impediment for the interoperability of corpus analysis systems, which lack a common protocol....... In this paper, we present KoralQuery, a JSON-LD based general corpus query protocol, aiming to be independent of particular QLs, tasks and corpus formats. In addition to describing the system of types and operations that KoralQuery is built on, we exemplify the representation of corpus queries in the serialized...

  4. Querying Workflow Logs

    Directory of Open Access Journals (Sweden)

    Yan Tang

    2018-01-01

    Full Text Available A business process or workflow is an assembly of tasks that accomplishes a business goal. Business process management is the study of the design, configuration/implementation, enactment and monitoring, analysis, and re-design of workflows. The traditional methodology for the re-design and improvement of workflows relies on the well-known sequence of extract, transform, and load (ETL, data/process warehousing, and online analytical processing (OLAP tools. In this paper, we study the ad hoc queryiny of process enactments for (data-centric business processes, bypassing the traditional methodology for more flexibility in querying. We develop an algebraic query language based on “incident patterns” with four operators inspired from Business Process Model and Notation (BPMN representation, allowing the user to formulate ad hoc queries directly over workflow logs. A formal semantics of this query language, a preliminary query evaluation algorithm, and a group of elementary properties of the operators are provided.

  5. A hybrid technique for private location-based queries with database protection

    KAUST Repository

    Ghinita, Gabriel

    2009-01-01

    Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. To protect user privacy, it is important not to disclose exact user coordinates to un-trusted entities that provide location-based services. Currently, there are two main approaches to protect the location privacy of users: (i) hiding locations inside cloaking regions (CRs) and (ii) encrypting location data using private information retrieval (PIR) protocols. Previous work focused on finding good trade-offs between privacy and performance of user protection techniques, but disregarded the important issue of protecting the POI dataset D. For instance, location cloaking requires large-sized CRs, leading to excessive disclosure of POIs (O(|D|) in the worst case). PIR, on the other hand, reduces this bound to , but at the expense of high processing and communication overhead. We propose a hybrid, two-step approach to private location-based queries, which provides protection for both the users and the database. In the first step, user locations are generalized to coarse-grained CRs which provide strong privacy. Next, a PIR protocol is applied with respect to the obtained query CR. To protect excessive disclosure of POI locations, we devise a cryptographic protocol that privately evaluates whether a point is enclosed inside a rectangular region. We also introduce an algorithm to efficiently support PIR on dynamic POI sub-sets. Our method discloses O(1) POI, orders of magnitude fewer than CR- or PIR-based techniques. Experimental results show that the hybrid approach is scalable in practice, and clearly outperforms the pure-PIR approach in terms of computational and communication overhead. © 2009 Springer Berlin Heidelberg.

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

    Science.gov (United States)

    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.

  7. An energy-aware routing protocol for query-based applications in wireless sensor networks.

    Science.gov (United States)

    Ahvar, Ehsan; Ahvar, Shohreh; Lee, Gyu Myoung; Crespi, Noel

    2014-01-01

    Wireless sensor network (WSN) typically has energy consumption restriction. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saving protocols are used to minimize the overall energy consumed by a WSN, while energy balancing protocols attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP) for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

  8. Consciousness as a process of queries and answers in architectures based on in situ representations

    NARCIS (Netherlands)

    van der Velde, F.; van der Velde, Frank

    2013-01-01

    Functional or access consciousness can be described as an ongoing dynamic process of queries and answers. Whenever we have an awareness of an object or its surroundings, it consists of the dynamic process that answers (implicit) queries like "What is the color or shape of the object?" or "What

  9. Counting, Enumerating and Sampling of Execution Plans in a Cost-Based Query Optimizer

    NARCIS (Netherlands)

    F. Waas; C.A. Galindo-Legaria

    2000-01-01

    textabstractTesting an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects often remain undetected as the query optimizer's choice of an execution plan is not only depending on the query

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

    Science.gov (United States)

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

    2011-12-01

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

  11. Evaluating XML-Extended OLAP Queries Based on a Physical Algebra

    DEFF Research Database (Denmark)

    Yin, Xuepeng; Pedersen, Torben Bach

    2006-01-01

    In today’s OLAP systems, physically integrating fast-changing data, e.g., stock quotes, into a cube is complex and time-consuming. This data is likely to be available in XML format on the WWW; thus, instead of physical integration, making XML data logically federated with OLAP systems is desirable....... In this paper, we extend previous work on the logical federation of OLAP and XML data sources by presenting a simplified query semantics, a physical query algebra and a robust OLAP-XML query engine as well as the query evaluation techniques. Performance experiments with a prototypical implementation suggest...... that the performance for OLAP-XML federations is comparable to queries on physically integrated data....

  12. Query Expansion: Is It Necessary In Textual Case-Based Reasoning ...

    African Journals Online (AJOL)

    Questions (FAQs). FAQs are documents of question and answer pairs used to provide basic information to users in an organization. A recurring question can be solved once and stored, and for its subsequent recurrence, its already stored answer can be reused instead of treating the question as a new problem. The Case.

  13. A semantic-based approach for querying linked data using natural language

    KAUST Repository

    Paredes-Valverde, Mario Andrés

    2016-01-11

    The semantic Web aims to provide to Web information with a well-defined meaning and make it understandable not only by humans but also by computers, thus allowing the automation, integration and reuse of high-quality information across different applications. However, current information retrieval mechanisms for semantic knowledge bases are intended to be only used by expert users. In this work, we propose a natural language interface that allows non-expert users the access to this kind of information through formulating queries in natural language. The present approach uses a domain-independent ontology model to represent the question\\'s structure and context. Also, this model allows determination of the answer type expected by the user based on a proposed question classification. To prove the effectiveness of our approach, we have conducted an evaluation in the music domain using LinkedBrainz, an effort to provide the MusicBrainz information as structured data on the Web by means of Semantic Web technologies. Our proposal obtained encouraging results based on the F-measure metric, ranging from 0.74 to 0.82 for a corpus of questions generated by a group of real-world end users. © The Author(s) 2015.

  14. An organizational framework and strategic implementation for system-level change to enhance research-based practice: QUERI Series.

    Science.gov (United States)

    Stetler, Cheryl B; McQueen, Lynn; Demakis, John; Mittman, Brian S

    2008-05-29

    The continuing gap between available evidence and current practice in health care reinforces the need for more effective solutions, in particular related to organizational context. Considerable advances have been made within the U.S. Veterans Health Administration (VA) in systematically implementing evidence into practice. These advances have been achieved through a system-level program focused on collaboration and partnerships among policy makers, clinicians, and researchers. The Quality Enhancement Research Initiative (QUERI) was created to generate research-driven initiatives that directly enhance health care quality within the VA and, simultaneously, contribute to the field of implementation science. This paradigm-shifting effort provided a natural laboratory for exploring organizational change processes. This article describes the underlying change framework and implementation strategy used to operationalize QUERI. QUERI used an evidence-based organizational framework focused on three contextual elements: 1) cultural norms and values, in this case related to the role of health services researchers in evidence-based quality improvement; 2) capacity, in this case among researchers and key partners to engage in implementation research; 3) and supportive infrastructures to reinforce expectations for change and to sustain new behaviors as part of the norm. As part of a QUERI Series in Implementation Science, this article describes the framework's application in an innovative integration of health services research, policy, and clinical care delivery. QUERI's experience and success provide a case study in organizational change. It demonstrates that progress requires a strategic, systems-based effort. QUERI's evidence-based initiative involved a deliberate cultural shift, requiring ongoing commitment in multiple forms and at multiple levels. VA's commitment to QUERI came in the form of visionary leadership, targeted allocation of resources, infrastructure refinements

  15. An organizational framework and strategic implementation for system-level change to enhance research-based practice: QUERI Series

    Directory of Open Access Journals (Sweden)

    Mittman Brian S

    2008-05-01

    Full Text Available Abstract Background The continuing gap between available evidence and current practice in health care reinforces the need for more effective solutions, in particular related to organizational context. Considerable advances have been made within the U.S. Veterans Health Administration (VA in systematically implementing evidence into practice. These advances have been achieved through a system-level program focused on collaboration and partnerships among policy makers, clinicians, and researchers. The Quality Enhancement Research Initiative (QUERI was created to generate research-driven initiatives that directly enhance health care quality within the VA and, simultaneously, contribute to the field of implementation science. This paradigm-shifting effort provided a natural laboratory for exploring organizational change processes. This article describes the underlying change framework and implementation strategy used to operationalize QUERI. Strategic approach to organizational change QUERI used an evidence-based organizational framework focused on three contextual elements: 1 cultural norms and values, in this case related to the role of health services researchers in evidence-based quality improvement; 2 capacity, in this case among researchers and key partners to engage in implementation research; 3 and supportive infrastructures to reinforce expectations for change and to sustain new behaviors as part of the norm. As part of a QUERI Series in Implementation Science, this article describes the framework's application in an innovative integration of health services research, policy, and clinical care delivery. Conclusion QUERI's experience and success provide a case study in organizational change. It demonstrates that progress requires a strategic, systems-based effort. QUERI's evidence-based initiative involved a deliberate cultural shift, requiring ongoing commitment in multiple forms and at multiple levels. VA's commitment to QUERI came in the

  16. Ant-Based Delay-Sensitive Query Processing for Wireless Sensor Networks

    OpenAIRE

    Yu, Jianping; Lin, Yaping; Hu, Yupeng

    2009-01-01

    The technologies of wireless sensor networks (WSNs) have been developed rapidly in the most recent years. As WSNs are characterized by data-centric storage and routing under most circumstances, any application involved requires data management and processing technologies, especially the query processing mechanisms. The WSNs are often deployed in diverse application specific contexts, which can be treated as distributed databases. The event-involved responses can be obtained by issuing queries...

  17. Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning

    KAUST Repository

    Al-Harbi, Razen

    2016-02-08

    State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation. Others try to minimize inter-node communication, which requires an expensive data preprocessing phase, leading to a high startup cost. Apriori knowledge of the query workload has also been used to create partitions, which, however, are static and do not adapt to workload changes. In this paper, we propose AdPart, a distributed RDF system, which addresses the shortcomings of previous work. First, AdPart applies lightweight partitioning on the initial data, which distributes triples by hashing on their subjects; this renders its startup overhead low. At the same time, the locality-aware query optimizer of AdPart takes full advantage of the partitioning to (1) support the fully parallel processing of join patterns on subjects and (2) minimize data communication for general queries by applying hash distribution of intermediate results instead of broadcasting, wherever possible. Second, AdPart monitors the data access patterns and dynamically redistributes and replicates the instances of the most frequent ones among workers. As a result, the communication cost for future queries is drastically reduced or even eliminated. To control replication, AdPart implements an eviction policy for the redistributed patterns. Our experiments with synthetic and real data verify that AdPart: (1) starts faster than all existing systems; (2) processes thousands of queries before other systems become online; and (3) gracefully adapts to the query load, being able to evaluate queries on billion-scale RDF data in subseconds.

  18. Querying Archetype-Based Electronic Health Records Using Hadoop and Dewey Encoding of openEHR Models.

    Science.gov (United States)

    Sundvall, Erik; Wei-Kleiner, Fang; Freire, Sergio M; Lambrix, Patrick

    2017-01-01

    Archetype-based Electronic Health Record (EHR) systems using generic reference models from e.g. openEHR, ISO 13606 or CIMI should be easy to update and reconfigure with new types (or versions) of data models or entries, ideally with very limited programming or manual database tweaking. Exploratory research (e.g. epidemiology) leading to ad-hoc querying on a population-wide scale can be a challenge in such environments. This publication describes implementation and test of an archetype-aware Dewey encoding optimization that can be used to produce such systems in environments supporting relational operations, e.g. RDBMs and distributed map-reduce frameworks like Hadoop. Initial testing was done using a nine-node 2.2 GHz quad-core Hadoop cluster querying a dataset consisting of targeted extracts from 4+ million real patient EHRs, query results with sub-minute response time were obtained.

  19. MyBestQuery - A serious game to collect manual query reformulation

    OpenAIRE

    Chifu, Adrian-Gabriel; Molina, Serge; Mothe, Josiane

    2016-01-01

    This paper presents MyBestQuery, a serious game designed to collect query reformulations from players. Query reformulation is a hot topic in information retrieval and covers many aspects. One of them is query reformulation analysis which is based on users' session. It can be used to understand user's intent or to measure his satisfaction with regards to the results he obtained when querying the search engine. Automatic query reformulation is another aspect of query reformulation. It automatic...

  20. Query optimization over crowdsourced data

    KAUST Repository

    Park, Hyunjung

    2013-08-26

    Deco is a comprehensive system for answering declarative queries posed over stored relational data together with data obtained on-demand from the crowd. In this paper we describe Deco\\'s cost-based query optimizer, building on Deco\\'s data model, query language, and query execution engine presented earlier. Deco\\'s objective in query optimization is to find the best query plan to answer a query, in terms of estimated monetary cost. Deco\\'s query semantics and plan execution strategies require several fundamental changes to traditional query optimization. Novel techniques incorporated into Deco\\'s query optimizer include a cost model distinguishing between "free" existing data versus paid new data, a cardinality estimation algorithm coping with changes to the database state during query execution, and a plan enumeration algorithm maximizing reuse of common subplans in a setting that makes reuse challenging. We experimentally evaluate Deco\\'s query optimizer, focusing on the accuracy of cost estimation and the efficiency of plan enumeration.

  1. Application of shape-based similarity query for aerodynamic optimization of wind tunnel primary nozzle

    Directory of Open Access Journals (Sweden)

    Kolář Jan

    2012-04-01

    Full Text Available The aerodynamic shape optimization of the supersonic flat nozzle is the aim of proposed paper. The nozzle discussed, is applied as a primary nozzle of the inlet part of supersonic wind tunnel. Supersonic nozzles of the measure area inlet parts need to guarantee several requirements of flow properties and quality. Mach number and minimal differences between real and required velocity and turbulence profiles at the nozzle exit are the most important parameters to meet. The aerodynamic shape optimization of the flat 2D nozzle in CFD is employed to reach as uniform exit velocity profile as possible, with the mean Mach number 1.4. Optimization process does not use any of standard routines of global or local optimum searching. Instead, newly formed routine, which exploits shape-based oriented sequence of nozzles, is used to research within whole discretized parametric space. The movement within optimization process is not driven by gradient or evolutionary too, instead, the Path of Minimal Shape Deformation is followed. Dynamic mesh approach is used to deform the shape and mesh from the actual nozzle to the subsequent one. Dynamic deformation of mesh allows to speed up whole converging process as an initialization of flow at the newly formed mesh is based on afore-computed shape. Shape-based similarity query in field of supersonic nozzles is discussed and applied. Evolutionary technique with genetic algorithm is used to search for minimal deformational path. As a result, the best variant from the set of solved shapes is analyzed at the base of momentum coefficient and desired Mach number at the nozzle exit.

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

    Directory of Open Access Journals (Sweden)

    Rebecca Tave Gluskin

    2014-02-01

    Full Text Available 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

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

    Science.gov (United States)

    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. Counting, enumerating and sampling of execution plans in a cost-based query optimizer

    NARCIS (Netherlands)

    F. Waas; C.A. Galindo-Legaria

    1999-01-01

    textabstractTesting an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects often remain undetected as the query optimizer's choice of an execution plan is not only depending on

  5. Medical Query Language

    OpenAIRE

    Morgan, Mary M.; Beaman, Peter D.; Shusman, Daniel J.; Hupp, Jon A.; Zielstorff, Rita D.; Barnett, G. Octo

    1981-01-01

    This paper describes the Medical Query Language (MQL), a “formal” language which enables unsophisticated users, having no background in programming or computer science, to express information retrieval and analysis questions of their data bases. MQL is designed to access any MUMPS data base. Most MQL applications to date have dealt with the COmputer STored Ambulatory Record (COSTAR) data base.

  6. Bulk Expansion Effect of Gallium-Based Thermal Interface Material

    Science.gov (United States)

    Ding, Yujie; Deng, Zhongshan; Cai, Changli; Yang, Zejun; Yang, Yingbao; Lu, Jinrong; Gao, Yunxia; Liu, Jing

    2017-06-01

    The bulk expansion effect of gallium-based thermal interface materials (GBTIMs) was experimentally disclosed and clarified for the first time. GBTIMs were prepared under low (26 %) and high (96 %) relative humidity for a short (2 h) and long (5 h) time periods. An evident volume expansion phenomenon was observed with adequate humidity. Higher humidity resulted in bigger expansion rate and expansion coefficient. The expansion coefficient could reach surprisingly large value of 1.5 for GBTIMs under 96% relative humidity. Assuming that the volume change was related to chemical reactions in the mixture, SEM and XRD were adopted to determine the structure and phase components of the samples. The gases produced in the expansion process were detected with gas chromatography and a large amount of hydrogen was found. The results indicated that the hydrogen produced by the reaction between gallium oxide \\hbox {Ga}2\\hbox {O} and water in GBTIMs caused the expansion effect. The corroded GBTIMs were mainly composed of gallium oxide \\hbox {Ga}2\\hbox {O}3 and became loose and porous solids after expansion. Thermal conductivity decreased dramatically after the expansion process due to the composition and structure changes. From the view point of application, the ambient humidity and oxidation degree must be controlled during preparation of such thermal interface material to avoid its bulk expansion effect.

  7. Systematic data ingratiation of clinical trial recruitment locations for geographic-based query and visualization.

    Science.gov (United States)

    Luo, Jake; Chen, Weiheng; Wu, Min; Weng, Chunhua

    2017-12-01

    Prior studies of clinical trial planning indicate that it is crucial to search and screen recruitment sites before starting to enroll participants. However, currently there is no systematic method developed to support clinical investigators to search candidate recruitment sites according to their interested clinical trial factors. In this study, we aim at developing a new approach to integrating the location data of over one million heterogeneous recruitment sites that are stored in clinical trial documents. The integrated recruitment location data can be searched and visualized using a map-based information retrieval method. The method enables systematic search and analysis of recruitment sites across a large amount of clinical trials. The location data of more than 1.4 million recruitment sites of over 183,000 clinical trials was normalized and integrated using a geocoding method. The integrated data can be used to support geographic information retrieval of recruitment sites. Additionally, the information of over 6000 clinical trial target disease conditions and close to 4000 interventions was also integrated into the system and linked to the recruitment locations. Such data integration enabled the construction of a novel map-based query system. The system will allow clinical investigators to search and visualize candidate recruitment sites for clinical trials based on target conditions and interventions. The evaluation results showed that the coverage of the geographic location mapping for the 1.4 million recruitment sites was 99.8%. The evaluation of 200 randomly retrieved recruitment sites showed that the correctness of geographic information mapping was 96.5%. The recruitment intensities of the top 30 countries were also retrieved and analyzed. The data analysis results indicated that the recruitment intensity varied significantly across different countries and geographic areas. This study contributed a new data processing framework to extract and integrate

  8. Code query by example

    Science.gov (United States)

    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.

  9. Information Extraction from Large-scale WSNs: Approaches and Research Issues Part II: Query-Based and Macroprogramming Approaches

    Directory of Open Access Journals (Sweden)

    Tessa DANIEL

    2008-07-01

    Full Text Available Regardless of the application domain and deployment scope, the ability to retrieve information is critical to the successful functioning of any wireless sensor network (WSN system. In general, information extraction procedures can be categorized into three main approaches: agent-based, query-based and macroprogramming led. Whilst query-based systems are the most popular, macroprogramming techniques provide a more general-purpose approach to distributed computation. Finally, the agent-based approaches tailor the information extraction mechanism to the type of information needed and the configuration of the network it needs to be extracted from. This suite of three papers (Part I-III offers an extensive survey of the literature in the area of WSN information extraction, covering in Part I and Part II the three main approaches above. Part III highlights the open research questions and issues faced by deployable WSN system designers and discusses the potential benefits of both in-network processing and complex querying for large scale wireless informational systems.

  10. Conceptual Pathway Querying of Natural Logic Knowledge Bases from Text Bases

    DEFF Research Database (Denmark)

    Andreasen, Troels; Bulskov, Henrik; Nilsson, Jørgen Fischer

    2013-01-01

    language than predicate logic. Natural logic accommodates a variety of scientific parlance, ontologies and domain models. It also supports a semantic net or graph view of the knowledge base. This admits computation of relationships between concepts simultaneously through pathfinding in the knowledge base...

  11. Issues in the Design of a Pilot Concept-Based Query Interface for the Neuroinformatics Information Framework

    Science.gov (United States)

    Li, Yuli; Martone, Maryann E.; Sternberg, Paul W.; Shepherd, Gordon M.; Miller, Perry L.

    2009-01-01

    This paper describes a pilot query interface that has been constructed to help us explore a “concept-based” approach for searching the Neuroscience Information Framework (NIF). The query interface is concept-based in the sense that the search terms submitted through the interface are selected from a standardized vocabulary of terms (concepts) that are structured in the form of an ontology. The NIF contains three primary resources: the NIF Resource Registry, the NIF Document Archive, and the NIF Database Mediator. These NIF resources are very different in their nature and therefore pose challenges when designing a single interface from which searches can be automatically launched against all three resources simultaneously. The paper first discusses briefly several background issues involving the use of standardized biomedical vocabularies in biomedical information retrieval, and then presents a detailed example that illustrates how the pilot concept-based query interface operates. The paper concludes by discussing certain lessons learned in the development of the current version of the interface. PMID:18953674

  12. The CMS DBS Query Language

    CERN Document Server

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

    2009-01-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, provid...

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

    Science.gov (United States)

    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.

  14. Learning via Query Synthesis

    KAUST Repository

    Alabdulmohsin, Ibrahim Mansour

    2017-05-07

    Active learning is a subfield of machine learning that has been successfully used in many applications. One of the main branches of active learning is query synthe- sis, where the learning agent constructs artificial queries from scratch in order to reveal sensitive information about the underlying decision boundary. It has found applications in areas, such as adversarial reverse engineering, automated science, and computational chemistry. Nevertheless, the existing literature on membership query synthesis has, generally, focused on finite concept classes or toy problems, with a limited extension to real-world applications. In this thesis, I develop two spectral algorithms for learning halfspaces via query synthesis. The first algorithm is a maximum-determinant convex optimization method while the second algorithm is a Markovian method that relies on Khachiyan’s classical update formulas for solving linear programs. The general theme of these methods is to construct an ellipsoidal approximation of the version space and to synthesize queries, afterward, via spectral decomposition. Moreover, I also describe how these algorithms can be extended to other settings as well, such as pool-based active learning. Having demonstrated that halfspaces can be learned quite efficiently via query synthesis, the second part of this thesis proposes strategies for mitigating the risk of reverse engineering in adversarial environments. One approach that can be used to render query synthesis algorithms ineffective is to implement a randomized response. In this thesis, I propose a semidefinite program (SDP) for learning a distribution of classifiers, subject to the constraint that any individual classifier picked at random from this distributions provides reliable predictions with a high probability. This algorithm is, then, justified both theoretically and empirically. A second approach is to use a non-parametric classification method, such as similarity-based classification. In this

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

    International Nuclear Information System (INIS)

    Amin, Waqas; Kang, Hyunseok P; Egloff, Ann Marie; Singh, Harpreet; Trent, Kerry; Ridge-Hetrick, Jennifer; Seethala, Raja R; Grandis, Jennifer; Parwani, Anil V

    2009-01-01

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

  16. QUERY SUPPORT FOR GMZ

    Directory of Open Access Journals (Sweden)

    A. Khandelwal

    2017-07-01

    Full Text Available Generic text-based compression models are simple and fast but there are two issues that needs to be addressed. They cannot leverage the structure that exists in data to achieve better compression and there is an unnecessary decompression step before the user can actually use the data. To address these issues, we came up with GMZ, a lossless compression model aimed at achieving high compression ratios. The decision to design GMZ (Khandelwal and Rajan, 2017 exclusively for GML's Simple Features Profile (SFP seems fair because of the high use of SFP in WFS and that it facilitates high optimisation of the compression model. This is an extension of our work on GMZ. In a typical server-client model such as Web Feature Service, the server is the primary creator and provider of GML, and therefore, requires compression and query capabilities. On the other hand, the client is the primary consumer of GML, and therefore, requires decompression and visualisation capabilities. In the first part of our work, we demonstrated compression using a python script that can be plugged in a server architecture, and decompression and visualisation in a web browser using a Firefox addon. The focus of this work is to develop the already existing tools to provide query capability to server. Our model provides the ability to decompress individual features in isolation, which is an essential requirement for realising query in compressed state. We con - struct an R-Tree index for spatial data and a custom index for non-spatial data and store these in a separate index file to prevent alter - ing the compression model. This facilitates independent use of compressed GMZ file where index can be constructed when required. The focus of this work is the bounding-box or range query commonly used in webGIS with provision for other spatial and non-spatial queries. The decrement in compression ratios due to the new index file is in the range of 1–3 percent which is trivial considering

  17. Multi-Classifier Based on a Query-by-Singing/Humming System

    Directory of Open Access Journals (Sweden)

    Gi Pyo Nam

    2015-06-01

    Full Text Available With the increase in the number of music files on various devices, it can be difficult to locate a desired file, especially when the title of the song or the name of the singer is not known. We propose a new query-by-singing/humming (QbSH system that can find music files that match what the user is singing or humming. This research is novel in the following three ways: first, the Fourier descriptor (FD method is proposed as the first classifier; it transforms the humming or music waveform into the frequency domain. Second, quantized dynamic time warping (QDTW using symmetrical search space and quantized linear scaling (QLS are used as the second and third classifiers, respectively, which increase the accuracy of the QbSH system compared to the conventional DTW and LS methods. Third, five classifiers, which include the three already mentioned along with the conventional DTW using symmetrical search space and LS methods, are combined using score level fusion, which further enhances performance. Experimental results with the 2009 MIR-QbSH corpus and the AFA MIDI 100 databases show that the proposed method outperforms those using a single classifier and other fusion methods.

  18. Approximate dictionary queries

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Gasieniec, Leszek

    1996-01-01

    Given a set of n binary strings of length m each. We consider the problem of answering d-queries. Given a binary query string of length m, a d-query is to report if there exists a string in the set within Hamming distance d of . We present a data structure of size O(nm) supporting 1-queries in ti...

  19. Recommendation Sets and Choice Queries

    DEFF Research Database (Denmark)

    Viappiani, Paolo Renato; Boutilier, Craig

    2011-01-01

    Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and offer recommendations based on the system's belief about the user's utility function. We analyze the connection between...... the problem of generating optimal recommendation sets and the problem of generating optimal choice queries, considering both Bayesian and regret-based elicitation. Our results show that, somewhat surprisingly, under very general circumstances, the optimal recommendation set coincides with the optimal query....

  20. Conceptual querying through ontologies

    DEFF Research Database (Denmark)

    Andreasen, Troels; Bulskov, Henrik

    2009-01-01

    is motivated by an obvious need for users to survey huge volumes of objects in query answers. An ontology formalism and a special notion of-instantiated ontology" are introduced. The latter is a structure reflecting the content in the document collection in that; it is a restriction of a general world......We present here ail approach to conceptual querying where the aim is, given a collection of textual database objects or documents, to target an abstraction of the entire database content in terms of the concepts appearing in documents, rather than the documents in the collection. The approach...... knowledge ontology to the concepts instantiated in the collection. The notion of ontology-based similarity is briefly described, language constructs for direct navigation and retrieval of concepts in the ontology are discussed and approaches to conceptual summarization are presented....

  1. On the query reformulation technique for effective MEDLINE document retrieval.

    Science.gov (United States)

    Yoo, Sooyoung; Choi, Jinwook

    2010-10-01

    Improving the retrieval accuracy of MEDLINE documents is still a challenging issue due to low retrieval precision. Focusing on a query expansion technique based on pseudo-relevance feedback (PRF), this paper addresses the problem by systematically examining the effects of expansion term selection and adjustment of the term weights of the expanded query using a set of MEDLINE test documents called OHSUMED. Implementing a baseline information retrieval system based on the Okapi BM25 retrieval model, we compared six well-known term ranking algorithms for useful expansion term selection and then compared traditional term reweighting algorithms with our new variant of the standard Rocchio's feedback formula, which adopts a group-based weighting scheme. Our experimental results on the OHSUMED test collection showed a maximum improvement of 20.2% and 20.4% for mean average precision and recall measures over unexpanded queries when terms were expanded using a co-occurrence analysis-based term ranking algorithm in conjunction with our term reweighting algorithm (p-valueretrieval.

  2. Task-Based Language Teaching and Expansive Learning Theory

    Science.gov (United States)

    Robertson, Margaret

    2014-01-01

    Task-Based Language Teaching (TBLT) has become increasingly recognized as an effective pedagogy, but its location in generalized sociocultural theories of learning has led to misunderstandings and criticism. The purpose of this article is to explain the congruence between TBLT and Expansive Learning Theory and the benefits of doing so. The merit…

  3. Optimizing Temporal Queries

    DEFF Research Database (Denmark)

    Toman, David; Bowman, Ivan Thomas

    2003-01-01

    , these query languages are implemented by translating temporal queries into standard relational queries. However, the compiled queries are often quite cumbersome and expensive to execute even using state-of-the-art relational products. This paper presents an optimization technique that produces more efficient...... translated SQL queries by taking into account the properties of the encoding used for temporal attributes. For concreteness, this translation technique is presented in the context of SQL/TP; however, these techniques are also applicable to other temporal query languages....

  4. SoQueT : Query-Based Documentation of Crosscutting Concerns

    NARCIS (Netherlands)

    Marin, M.; Moonen, L.; Van Deursen, A.

    2007-01-01

    Understanding crosscutting concerns is difficult because their underlying relations remain hidden in a class-based decomposition of a system. Based on an extensive investigation of crosscutting concerns in existing systems and literature, we identified a number of typical implementation idioms and

  5. Probabilistic Data Modeling and Querying for Location-Based Data Warehouses

    DEFF Research Database (Denmark)

    Timko, Igor; Dyreson, Curtis E.; Pedersen, Torben Bach

    Motivated by the increasing need to handle complex, dynamic, uncertain multidimensional data in location-based warehouses, this paper proposes a novel probabilistic data model that can address the complexities of such data. The model provides a foundation for handling complex hierarchical and unc......-aggregation for implementation of the operators is also discussed. The work is motivated with a real-world case study, based on our collaboration with a leading Danish vendor of location-based services.......Motivated by the increasing need to handle complex, dynamic, uncertain multidimensional data in location-based warehouses, this paper proposes a novel probabilistic data model that can address the complexities of such data. The model provides a foundation for handling complex hierarchical...

  6. Probabilistic Data Modeling and Querying for Location-Based Data Warehouses

    DEFF Research Database (Denmark)

    Timko, Igor; Dyreson, Curtis E.; Pedersen, Torben Bach

    2005-01-01

    Motivated by the increasing need to handle complex, dynamic, uncertain multidimensional data in location-based warehouses, this paper proposes a novel probabilistic data model that can address the complexities of such data. The model provides a foundation for handling complex hierarchical...

  7. H-Metric: Characterizing Image Datasets via Homogenization Based on KNN-Queries

    Directory of Open Access Journals (Sweden)

    Welington M da Silva

    2012-01-01

    Full Text Available Precision-Recall is one of the main metrics for evaluating content-based image retrieval techniques. However, it does not provide an ample perception of the properties of an image dataset immersed in a metric space. In this work, we describe an alternative metric named H-Metric, which is determined along a sequence of controlled modifications in the image dataset. The process is named homogenization and works by altering the homogeneity characteristics of the classes of the images. The result is a process that measures how hard it is to deal with a set of images in respect to content-based retrieval, offering support in the task of analyzing configurations of distance functions and of features extractors.

  8. Capacity expansion model of wind power generation based on ELCC

    Science.gov (United States)

    Yuan, Bo; Zong, Jin; Wu, Shengyu

    2018-02-01

    Capacity expansion is an indispensable prerequisite for power system planning and construction. A reasonable, efficient and accurate capacity expansion model (CEM) is crucial to power system planning. In most current CEMs, the capacity of wind power generation is considered as boundary conditions instead of decision variables, which may lead to curtailment or over construction of flexible resource, especially at a high renewable energy penetration scenario. This paper proposed a wind power generation capacity value(CV) calculation method based on effective load-carrying capability, and a CEM that co-optimizes wind power generation and conventional power sources. Wind power generation is considered as decision variable in this model, and the model can accurately reflect the uncertainty nature of wind power.

  9. Co-expressed Pathways DataBase for Tomato: a database to predict pathways relevant to a query gene.

    Science.gov (United States)

    Narise, Takafumi; Sakurai, Nozomu; Obayashi, Takeshi; Ohta, Hiroyuki; Shibata, Daisuke

    2017-06-05

    Gene co-expression, the similarity of gene expression profiles under various experimental conditions, has been used as an indicator of functional relationships between genes, and many co-expression databases have been developed for predicting gene functions. These databases usually provide users with a co-expression network and a list of strongly co-expressed genes for a query gene. Several of these databases also provide functional information on a set of strongly co-expressed genes (i.e., provide biological processes and pathways that are enriched in these strongly co-expressed genes), which is generally analyzed via over-representation analysis (ORA). A limitation of this approach may be that users can predict gene functions only based on the strongly co-expressed genes. In this study, we developed a new co-expression database that enables users to predict the function of tomato genes from the results of functional enrichment analyses of co-expressed genes while considering the genes that are not strongly co-expressed. To achieve this, we used the ORA approach with several thresholds to select co-expressed genes, and performed gene set enrichment analysis (GSEA) applied to a ranked list of genes ordered by the co-expression degree. We found that internal correlation in pathways affected the significance levels of the enrichment analyses. Therefore, we introduced a new measure for evaluating the relationship between the gene and pathway, termed the percentile (p)-score, which enables users to predict functionally relevant pathways without being affected by the internal correlation in pathways. In addition, we evaluated our approaches using receiver operating characteristic curves, which concluded that the p-score could improve the performance of the ORA. We developed a new database, named Co-expressed Pathways DataBase for Tomato, which is available at http://cox-path-db.kazusa.or.jp/tomato . The database allows users to predict pathways that are relevant to a

  10. A Fine-Grained and Privacy-Preserving Query Scheme for Fog Computing-Enhanced Location-Based Service.

    Science.gov (United States)

    Yang, Xue; Yin, Fan; Tang, Xiaohu

    2017-07-11

    Location-based services (LBS), as one of the most popular location-awareness applications, has been further developed to achieve low-latency with the assistance of fog computing. However, privacy issues remain a research challenge in the context of fog computing. Therefore, in this paper, we present a fine-grained and privacy-preserving query scheme for fog computing-enhanced location-based services, hereafter referred to as FGPQ. In particular, mobile users can obtain the fine-grained searching result satisfying not only the given spatial range but also the searching content. Detailed privacy analysis shows that our proposed scheme indeed achieves the privacy preservation for the LBS provider and mobile users. In addition, extensive performance analyses and experiments demonstrate that the FGPQ scheme can significantly reduce computational and communication overheads and ensure the low-latency, which outperforms existing state-of-the art schemes. Hence, our proposed scheme is more suitable for real-time LBS searching.

  11. High-precision positioning system of four-quadrant detector based on the database query

    Science.gov (United States)

    Zhang, Xin; Deng, Xiao-guo; Su, Xiu-qin; Zheng, Xiao-qiang

    2015-02-01

    The fine pointing mechanism of the Acquisition, Pointing and Tracking (APT) system in free space laser communication usually use four-quadrant detector (QD) to point and track the laser beam accurately. The positioning precision of QD is one of the key factors of the pointing accuracy to APT system. A positioning system is designed based on FPGA and DSP in this paper, which can realize the sampling of AD, the positioning algorithm and the control of the fast swing mirror. We analyze the positioning error of facular center calculated by universal algorithm when the facular energy obeys Gauss distribution from the working principle of QD. A database is built by calculation and simulation with MatLab software, in which the facular center calculated by universal algorithm is corresponded with the facular center of Gaussian beam, and the database is stored in two pieces of E2PROM as the external memory of DSP. The facular center of Gaussian beam is inquiry in the database on the basis of the facular center calculated by universal algorithm in DSP. The experiment results show that the positioning accuracy of the high-precision positioning system is much better than the positioning accuracy calculated by universal algorithm.

  12. FRACTAL DIMENSION OF URBAN EXPANSION BASED ON REMOTE SENSING IMAGES

    Directory of Open Access Journals (Sweden)

    IACOB I. CIPRIAN

    2012-11-01

    Full Text Available Fractal Dimension of Urban Expansion Based on Remote Sensing Images: In Cluj-Napoca city the process of urbanization has been accelerated during the years and implication of local authorities reflects a relevant planning policy. A good urban planning framework should take into account the society demands and also it should satisfy the natural conditions of local environment. The expansion of antropic areas it can be approached by implication of 5D variables (time as a sequence of stages, space: with x, y, z and magnitude of phenomena into the process, which will allow us to analyse and extract the roughness of city shape. Thus, to improve the decision factor we take a different approach in this paper, looking at geometry and scale composition. Using the remote sensing (RS and GIS techniques we manage to extract a sequence of built-up areas (from 1980 to 2012 and used the result as an input for modelling the spatialtemporal changes of urban expansion and fractal theory to analysed the geometric features. Taking the time as a parameter we can observe behaviour and changes in urban landscape, this condition have been known as self-organized – a condition which in first stage the system was without any turbulence (before the antropic factor and during the time tend to approach chaotic behaviour (entropy state without causing an disequilibrium in the main system.

  13. Recommending Multidimensional Queries

    Science.gov (United States)

    Giacometti, Arnaud; Marcel, Patrick; Negre, Elsa

    Interactive analysis of datacube, in which a user navigates a cube by launching a sequence of queries is often tedious since the user may have no idea of what the forthcoming query should be in his current analysis. To better support this process we propose in this paper to apply a Collaborative Work approach that leverages former explorations of the cube to recommend OLAP queries. The system that we have developed adapts Approximate String Matching, a technique popular in Information Retrieval, to match the current analysis with the former explorations and help suggesting a query to the user. Our approach has been implemented with the open source Mondrian OLAP server to recommend MDX queries and we have carried out some preliminary experiments that show its efficiency for generating effective query recommendations.

  14. Indexing for summary queries

    DEFF Research Database (Denmark)

    Yi, Ke; Wang, Lu; Wei, Zhewei

    2014-01-01

    returned by reporting queries. In this article, we design indexing techniques that allow for extracting a statistical summary of all the records in the query. The summaries we support include frequent items, quantiles, and various sketches, all of which are of central importance in massive data analysis....... Our indexes require linear space and extract a summary with the optimal or near-optimal query cost. We illustrate the efficiency and usefulness of our designs through extensive experiments and a system demonstration....

  15. Flexible Query Answering Systems

    DEFF Research Database (Denmark)

    This book constitutes the refereed proceedings of the 12th International Conference on Flexible Query Answering Systems, FQAS 2017, held in London, UK, in June 2017. The 21 full papers presented in this book together with 4 short papers were carefully reviewed and selected from 43 submissions....... The papers cover the following topics: foundations of flexible querying; recommendation and ranking; technologies for flexible representations and querying; knowledge discovery and information/data retrieval; intuitionistic sets; and generalized net model....

  16. Unemployment Insurance Query (UIQ)

    Data.gov (United States)

    Social Security Administration — The Unemployment Insurance Query (UIQ) provides State Unemployment Insurance agencies real-time online access to SSA data. This includes SSN verification and Title...

  17. Domainwise Web Page Optimization Based On Clustered Query Sessions Using Hybrid Of Trust And ACO For Effective Information Retrieval

    Directory of Open Access Journals (Sweden)

    Dr. Suruchi Chawla

    2015-08-01

    Full Text Available Abstract In this paper hybrid of Ant Colony OptimizationACO and trust has been used for domainwise web page optimization in clustered query sessions for effective Information retrieval. The trust of the web page identifies its degree of relevance in satisfying specific information need of the user. The trusted web pages when optimized using pheromone updates in ACO will identify the trusted colonies of web pages which will be relevant to users information need in a given domain. Hence in this paper the hybrid of Trust and ACO has been used on clustered query sessions for identifying more and more relevant number of documents in a given domain in order to better satisfy the information need of the user. Experiment was conducted on the data set of web query sessions to test the effectiveness of the proposed approach in selected three domains Academics Entertainment and Sports and the results confirm the improvement in the precision of search results.

  18. GenoLink: a graph-based querying and browsing system for investigating the function of genes and proteins

    Directory of Open Access Journals (Sweden)

    Divo1 Jean-Louis

    2006-01-01

    Full Text Available Abstract Background A large variety of biological data can be represented by graphs. These graphs can be constructed from heterogeneous data coming from genomic and post-genomic technologies, but there is still need for tools aiming at exploring and analysing such graphs. This paper describes GenoLink, a software platform for the graphical querying and exploration of graphs. Results GenoLink provides a generic framework for representing and querying data graphs. This framework provides a graph data structure, a graph query engine, allowing to retrieve sub-graphs from the entire data graph, and several graphical interfaces to express such queries and to further explore their results. A query consists in a graph pattern with constraints attached to the vertices and edges. A query result is the set of all sub-graphs of the entire data graph that are isomorphic to the pattern and satisfy the constraints. The graph data structure does not rely upon any particular data model but can dynamically accommodate for any user-supplied data model. However, for genomic and post-genomic applications, we provide a default data model and several parsers for the most popular data sources. GenoLink does not require any programming skill since all operations on graphs and the analysis of the results can be carried out graphically through several dedicated graphical interfaces. Conclusion GenoLink is a generic and interactive tool allowing biologists to graphically explore various sources of information. GenoLink is distributed either as a standalone application or as a component of the Genostar/Iogma platform. Both distributions are free for academic research and teaching purposes and can be requested at academy@genostar.com. A commercial licence form can be obtained for profit company at info@genostar.com. See also http://www.genostar.org.

  19. Hierarchical Fuzzy Sets To Query Possibilistic Databases

    OpenAIRE

    Thomopoulos, Rallou; Buche, Patrice; Haemmerlé, Ollivier

    2008-01-01

    Within the framework of flexible querying of possibilistic databases, based on the fuzzy set theory, this chapter focuses on the case where the vocabulary used both in the querying language and in the data is hierarchically organized, which occurs in systems that use ontologies. We give an overview of previous works concerning two issues: firstly, flexible querying of imprecise data in the relational model; secondly, the introduction of fuzziness in hierarchies. Concerning the latter point, w...

  20. Mastering jQuery

    CERN Document Server

    Libby, Alex

    2015-01-01

    If you are a developer who is already familiar with using jQuery and wants to push your skill set further, then this book is for you. The book assumes an intermediate knowledge level of jQuery, JavaScript, HTML5, and CSS.

  1. Range-clustering queries

    DEFF Research Database (Denmark)

    Abrahamsen, Mikkel; de Berg, Mark; Buchin, Kevin

    2017-01-01

    an optimal k-clustering for S P ∩ Q. We obtain the following results. • We present a general method to compute a (1 + ϵ)-approximation to a range-clustering query, where ϵ > 0 is a parameter that can be specified as part of the query. Our method applies to a large class of clustering problems, including k...

  2. Query complexity in expectation

    NARCIS (Netherlands)

    Kaniewski, J.; Lee, T.; de Wolf, R.; Halldórsson, M.M.; Iwama, K.; Kobayashi, N.; Speckmann, B.

    2015-01-01

    We study the query complexity of computing a function f:{0,1}n→R+ in expectation. This requires the algorithm on input x to output a nonnegative random variable whose expectation equals f(x), using as few queries to the input x as possible. We exactly characterize both the randomized and the quantum

  3. Multi-Dimensional Path Queries

    DEFF Research Database (Denmark)

    Bækgaard, Lars

    1998-01-01

    that connects a pair of paths. A path expression is a function that maps a set of path sets into a path set. Path sets can be joined, filtering conditions can restrict the set of qualifying paths, and aggregation functions can be applied to path elements. In particular, the aggregation function SET can be used...... to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments...

  4. Adding query privacy to robust DHTs

    DEFF Research Database (Denmark)

    Backes, Michael; Goldberg, Ian; Kate, Aniket

    2012-01-01

    Interest in anonymous communication over distributed hash tables (DHTs) has increased in recent years. However, almost all known solutions solely aim at achieving sender or requestor anonymity in DHT queries. In many application scenarios, it is crucial that the queried key remains secret from...... intermediate peers that (help to) route the queries towards their destinations. In this paper, we satisfy this requirement by presenting an approach for providing privacy for the keys in DHT queries. We use the concept of oblivious transfer (OT) in communication over DHTs to preserve query privacy without...... compromising spam resistance. Although our OT-based approach can work over any DHT, we concentrate on robust DHTs that can tolerate Byzantine faults and resist spam. We choose the best-known robust DHT construction, and employ an efficient OT protocol well-suited for achieving our goal of obtaining query...

  5. UMLS-based conceptual queries to biomedical information databases: an overview of the project ARIANE. Unified Medical Language System.

    Science.gov (United States)

    Joubert, M; Fieschi, M; Robert, J J; Volot, F; Fieschi, D

    1998-01-01

    The aim of the project ARIANE is to model and implement seamless, natural, and easy-to-use interfaces with various kinds of heterogeneous biomedical information databases. A conceptual model of some of the Unified Medical Language System (UMLS) knowledge sources has been developed to help end users to query information databases. A query is represented by a conceptual graph that translates the deep structure of an end-user's interest in a topic. A computational model exploits this conceptual model to build a query interactively represented as query graph. A query graph is then matched to the data graph built with data issued from each record of a database by means of a pattern-matching (projection) rule that applies to conceptual graphs. Prototypes have been implemented to test the feasibility of the model with different kinds of information databases. Three cases are studied: 1) information in records is structured according to the UMLS knowledge sources; 2) information is able to be structured without error in the frame of the UMLS knowledge; 3) information cannot be structured. In each case the pattern-matching is processed by the projection rule according to the structure of information that has been implemented in the databases. The conceptual graphs theory provides with a homogeneous and powerful formalism able to represent both concepts, instances of concepts in medical contexts, and associations by means of relationships, and to represent data at different levels of details. The conceptual-graphs formalism allows powerful capabilities to operate a semantic integration of information databases using the UMLS knowledge sources.

  6. A structural query system for Han characters

    DEFF Research Database (Denmark)

    Skala, Matthew

    2016-01-01

    The IDSgrep structural query system for Han character dictionaries is presented. This dictionary search system represents the spatial structure of Han characters using Extended Ideographic Description Sequences (EIDSes), a data model and syntax based on the Unicode IDS concept. It includes a query...... language for EIDS databases, with a freely available implementation and format translation from popular third-party IDS and XML character databases. The system is designed to suit the needs of font developers and foreign language learners. The search algorithm includes a bit vector index inspired by Bloom...... filters to support faster query operations. Experimental results are presented, evaluating the effect of the indexing on query performance....

  7. Fuzzy Query Processing Using Clustering Techniques.

    Science.gov (United States)

    Kamel, M.; And Others

    1990-01-01

    Discusses the problem of processing fuzzy queries in databases and information retrieval systems and presents a prototype of a fuzzy query processing system for databases that is based on data clustering and uses Pascal programing language. Clustering schemes are explained, and the system architecture that uses natural language is described. (14…

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

    Science.gov (United States)

    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.

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

    Directory of Open Access Journals (Sweden)

    Yan Wang

    2016-01-01

    Full Text Available 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.

  10. The Medical Query Language

    Science.gov (United States)

    Shusman, Daniel J.; Morgan, Mary M.; Zielstorff, Rita; Barnett, G. Octo

    1983-01-01

    The Medical Query Language (MQL) is an English-like query language with which a user with little or no training in programming or computer science can formulate and satisfy inquiries on data contained in his/her Standard MUMPS database. To date, major applications of MQL have been in the areas of quality assurance, medical research, and practice administration at sites using the COmputer STored Ambulatory Record (COSTAR) database system.

  11. Querying and Mining Strings Made Easy

    KAUST Repository

    Sahli, Majed

    2017-10-13

    With the advent of large string datasets in several scientific and business applications, there is a growing need to perform ad-hoc analysis on strings. Currently, strings are stored, managed, and queried using procedural codes. This limits users to certain operations supported by existing procedural applications and requires manual query planning with limited tuning opportunities. This paper presents StarQL, a generic and declarative query language for strings. StarQL is based on a native string data model that allows StarQL to support a large variety of string operations and provide semantic-based query optimization. String analytic queries are too intricate to be solved on one machine. Therefore, we propose a scalable and efficient data structure that allows StarQL implementations to handle large sets of strings and utilize large computing infrastructures. Our evaluation shows that StarQL is able to express workloads of application-specific tools, such as BLAST and KAT in bioinformatics, and to mine Wikipedia text for interesting patterns using declarative queries. Furthermore, the StarQL query optimizer shows an order of magnitude reduction in query execution time.

  12. Edgeworth Expansion Based Model for the Convolutional Noise pdf

    Directory of Open Access Journals (Sweden)

    Yonatan Rivlin

    2014-01-01

    Full Text Available Recently, the Edgeworth expansion up to order 4 was used to represent the convolutional noise probability density function (pdf in the conditional expectation calculations where the source pdf was modeled with the maximum entropy density approximation technique. However, the applied Lagrange multipliers were not the appropriate ones for the chosen model for the convolutional noise pdf. In this paper we use the Edgeworth expansion up to order 4 and up to order 6 to model the convolutional noise pdf. We derive the appropriate Lagrange multipliers, thus obtaining new closed-form approximated expressions for the conditional expectation and mean square error (MSE as a byproduct. Simulation results indicate hardly any equalization improvement with Edgeworth expansion up to order 4 when using optimal Lagrange multipliers over a nonoptimal set. In addition, there is no justification for using the Edgeworth expansion up to order 6 over the Edgeworth expansion up to order 4 for the 16QAM and easy channel case. However, Edgeworth expansion up to order 6 leads to improved equalization performance compared to the Edgeworth expansion up to order 4 for the 16QAM and hard channel case as well as for the case where the 64QAM is sent via an easy channel.

  13. Adding Query Privacy to Robust DHTs

    DEFF Research Database (Denmark)

    Backes, Michael; Goldberg, Ian; Kate, Aniket

    2011-01-01

    Interest in anonymous communication over distributed hash tables (DHTs) has increased in recent years. However, almost all known solutions solely aim at achieving sender or requestor anonymity in DHT queries. In many application scenarios, it is crucial that the queried key remains secret from...... intermediate peers that (help to) route the queries towards their destinations. In this paper, we satisfy this requirement by presenting an approach for providing privacy for the keys in DHT queries. We use the concept of oblivious transfer (OT) in communication over DHTs to preserve query privacy without...... compromising spam resistance. Although our OT-based approach can work over any DHT, we concentrate on communication over robust DHTs that can tolerate Byzantine faults and resist spam. We choose the best-known robust DHT construction, and employ an efficient OT protocol well-suited for achieving our goal...

  14. Querying metabolism under different physiological constraints.

    Science.gov (United States)

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

    2010-04-01

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

  15. jQuery Mobile

    CERN Document Server

    Reid, Jon

    2011-01-01

    Native apps have distinct advantages, but the future belongs to mobile web apps that function on a broad range of smartphones and tablets. Get started with jQuery Mobile, the touch-optimized framework for creating apps that look and behave consistently across many devices. This concise book provides HTML5, CSS3, and JavaScript code examples, screen shots, and step-by-step guidance to help you build a complete working app with jQuery Mobile. If you're already familiar with the jQuery JavaScript library, you can use your existing skills to build cross-platform mobile web apps right now. This b

  16. Flexible Query Answering Systems

    DEFF Research Database (Denmark)

    are organized in a general session train and a parallel special session track. The general session train covers the following topics: querying-answering systems; semantic technology; patterns and classification; personalization and recommender systems; searching and ranking; and Web and human......-computer interaction. The special track covers some some specific and, typically, newer fields, namely: environmental scanning for strategic early warning; generating linguistic descriptions of data; advances in fuzzy querying and fuzzy databases: theory and applications; fusion and ensemble techniques for on......This book constitutes the refereed proceedings of the 10th International Conference on Flexible Query Answering Systems, FQAS 2013, held in Granada, Spain, in September 2013. The 59 full papers included in this volume were carefully reviewed and selected from numerous submissions. The papers...

  17. Robust Optimization of Database Queries

    Indian Academy of Sciences (India)

    JAYANT

    2011-07-06

    Jul 6, 2011 ... join order [ ((S R) C) or ((R C) S) ? ] join techniques [ Nested-Loops or Sort-Merge or Hash ? ] ○ DBMS query optimizer identifies the optimal. ○ DBMS query optimizer identifies the optimal evaluation strategy: “query execution plan”. July 2011. Robust Query Optimization (IASc Mid-year Meeting). 6 ...

  18. Collective spatial keyword querying

    DEFF Research Database (Denmark)

    Cao, Xin; Cong, Gao; Jensen, Christian S.

    2011-01-01

    With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and spatial keyword queries that exploit both location and textual description are gaining in prominence. However, the quer......With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and spatial keyword queries that exploit both location and textual description are gaining in prominence. However...

  19. Flexible Query Answering Systems

    DEFF Research Database (Denmark)

    are organized in a general session train and a parallel special session track. The general session train covers the following topics: querying-answering systems; semantic technology; patterns and classification; personalization and recommender systems; searching and ranking; and Web and human......This book constitutes the refereed proceedings of the 10th International Conference on Flexible Query Answering Systems, FQAS 2013, held in Granada, Spain, in September 2013. The 59 full papers included in this volume were carefully reviewed and selected from numerous submissions. The papers...

  20. Learning jQuery

    CERN Document Server

    Chaffer, Jonathan

    2013-01-01

    Step through each of the core concepts of the jQuery library, building an overall picture of its capabilities. Once you have thoroughly covered the basics, the book returns to each concept to cover more advanced examples and techniques.This book is for web designers who want to create interactive elements for their designs, and for developers who want to create the best user interface for their web applications. Basic JavaScript programming and knowledge of HTML and CSS is required. No knowledge of jQuery is assumed, nor is experience with any other JavaScript libraries.

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

    Science.gov (United States)

    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.

  2. Querying temporal databases via OWL 2 QL

    CSIR Research Space (South Africa)

    Klarman, S

    2014-06-01

    Full Text Available SQL:2011, the most recently adopted version of the SQL query language, has unprecedentedly standardized the representation of temporal data in relational databases. Following the successful paradigm of ontology-based data access, we develop a...

  3. Spatial Keyword Querying

    DEFF Research Database (Denmark)

    Cao, Xin; Chen, Lisi; Cong, Gao

    2012-01-01

    The web is increasingly being used by mobile users. In addition, it is increasingly becoming possible to accurately geo-position mobile users and web content. This development gives prominence to spatial web data management. Specifically, a spatial keyword query takes a user location and user...

  4. Approximating terminological queries

    NARCIS (Netherlands)

    Stuckenschmidt, Heiner; Van Harmelen, Frank

    2002-01-01

    Current proposals for languages to encode terminological knowledge in intelligent systems support logical reasoning for answering user queries about objects and classes. An application of these languages on the World Wide Web, however, is hampered by the limitations of logical reasoning in terms

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

    Directory of Open Access Journals (Sweden)

    Amalia Leceta

    2017-02-01

    Full Text Available 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

  6. Responsive web design with jQuery

    CERN Document Server

    Carlos, Gilberto

    2013-01-01

    Responsive Web Design with jQuery follows a standard tutorial-based approach, covering various aspects of responsive web design by building a comprehensive website.""Responsive Web Design with jQuery"" is aimed at web designers who are interested in building device-agnostic websites. You should have a grasp of standard HTML, CSS, and JavaScript development, and have a familiarity with graphic design. Some exposure to jQuery and HTML5 will be beneficial but isn't essential.

  7. Cumulative query method for influenza surveillance using search engine data.

    Science.gov (United States)

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

    2014-12-16

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

  8. Query Optimizations over Decentralized RDF Graphs

    KAUST Repository

    Abdelaziz, Ibrahim

    2017-05-18

    Applications in life sciences, decentralized social networks, Internet of Things, and statistical linked dataspaces integrate data from multiple decentralized RDF graphs via SPARQL queries. Several approaches have been proposed to optimize query processing over a small number of heterogeneous data sources by utilizing schema information. In the case of schema similarity and interlinks among sources, these approaches cause unnecessary data retrieval and communication, leading to poor scalability and response time. This paper addresses these limitations and presents Lusail, a system for scalable and efficient SPARQL query processing over decentralized graphs. Lusail achieves scalability and low query response time through various optimizations at compile and run times. At compile time, we use a novel locality-aware query decomposition technique that maximizes the number of query triple patterns sent together to a source based on the actual location of the instances satisfying these triple patterns. At run time, we use selectivity-awareness and parallel query execution to reduce network latency and to increase parallelism by delaying the execution of subqueries expected to return large results. We evaluate Lusail using real and synthetic benchmarks, with data sizes up to billions of triples on an in-house cluster and a public cloud. We show that Lusail outperforms state-of-the-art systems by orders of magnitude in terms of scalability and response time.

  9. Approximate furthest neighbor with application to annulus query

    DEFF Research Database (Denmark)

    Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen

    2016-01-01

    Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries and present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclid......Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries and present a simple, fast, and highly practical data structure for answering AFN queries in high...... a variation based on a query-independent ordering of the database points; while this does not have the provable approximation factor of the query-dependent data structure, it offers significant improvement in time and space complexity. We give a theoretical analysis and experimental results. As an application...

  10. Google BigQuery analytics

    CERN Document Server

    Tigani, Jordan

    2014-01-01

    How to effectively use BigQuery, avoid common mistakes, and execute sophisticated queries against large datasets Google BigQuery Analytics is the perfect guide for business and data analysts who want the latest tips on running complex queries and writing code to communicate with the BigQuery API. The book uses real-world examples to demonstrate current best practices and techniques, and also explains and demonstrates streaming ingestion, transformation via Hadoop in Google Compute engine, AppEngine datastore integration, and using GViz with Tableau to generate charts of query results. In addit

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

    Directory of Open Access Journals (Sweden)

    Hyunchul Kang

    2015-03-01

    Full Text Available 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.

  12. COMPLEX QUERY AND METADATA

    OpenAIRE

    Nakatoh, Tetsuya; Omori, Keisuke; Yamada, Yasuhiro; Hirokawa, Sachio

    2003-01-01

    We are developing a search system DAISEn which integrates multiple search engines and generates a metasearch engine automatically. The target search engines of DAISEn are not general search engines, but are search engines specialized in some area. Integration of such engines yields efficiency and quality. There are search engines of new type which accept complex query and return structured data. Integration of such search engines is much harder than that of simple search engines which accept ...

  13. Mastering jQuery mobile

    CERN Document Server

    Lambert, Chip

    2015-01-01

    You've started down the path of jQuery Mobile, now begin mastering some of jQuery Mobile's higher level topics. Go beyond jQuery Mobile's documentation and master one of the hottest mobile technologies out there. Previous JavaScript and PHP experience can help you get the most out of this book.

  14. Heuristic query optimization for query multiple table and multiple clausa on mobile finance application

    Science.gov (United States)

    Indrayana, I. N. E.; P, N. M. Wirasyanti D.; Sudiartha, I. KG

    2018-01-01

    Mobile application allow many users to access data from the application without being limited to space, space and time. Over time the data population of this application will increase. Data access time will cause problems if the data record has reached tens of thousands to millions of records.The objective of this research is to maintain the performance of data execution for large data records. One effort to maintain data access time performance is to apply query optimization method. The optimization used in this research is query heuristic optimization method. The built application is a mobile-based financial application using MySQL database with stored procedure therein. This application is used by more than one business entity in one database, thus enabling rapid data growth. In this stored procedure there is an optimized query using heuristic method. Query optimization is performed on a “Select” query that involves more than one table with multiple clausa. Evaluation is done by calculating the average access time using optimized and unoptimized queries. Access time calculation is also performed on the increase of population data in the database. The evaluation results shown the time of data execution with query heuristic optimization relatively faster than data execution time without using query optimization.

  15. Evaluating SPARQL queries on massive RDF datasets

    KAUST Repository

    Al-Harbi, Razen

    2015-08-01

    Distributed RDF systems partition data across multiple computer nodes. Partitioning is typically based on heuristics that minimize inter-node communication and it is performed in an initial, data pre-processing phase. Therefore, the resulting partitions are static and do not adapt to changes in the query workload; as a result, existing systems are unable to consistently avoid communication for queries that are not favored by the initial data partitioning. Furthermore, for very large RDF knowledge bases, the partitioning phase becomes prohibitively expensive, leading to high startup costs. In this paper, we propose AdHash, a distributed RDF system which addresses the shortcomings of previous work. First, AdHash initially applies lightweight hash partitioning, which drastically minimizes the startup cost, while favoring the parallel processing of join patterns on subjects, without any data communication. Using a locality-aware planner, queries that cannot be processed in parallel are evaluated with minimal communication. Second, AdHash monitors the data access patterns and adapts dynamically to the query load by incrementally redistributing and replicating frequently accessed data. As a result, the communication cost for future queries is drastically reduced or even eliminated. Our experiments with synthetic and real data verify that AdHash (i) starts faster than all existing systems, (ii) processes thousands of queries before other systems become online, and (iii) gracefully adapts to the query load, being able to evaluate queries on billion-scale RDF data in sub-seconds. In this demonstration, audience can use a graphical interface of AdHash to verify its performance superiority compared to state-of-the-art distributed RDF systems.

  16. Indirect Inference for Stochastic Differential Equations Based on Moment Expansions

    KAUST Repository

    Ballesio, Marco

    2016-01-06

    We provide an indirect inference method to estimate the parameters of timehomogeneous scalar diffusion and jump diffusion processes. We obtain a system of ODEs that approximate the time evolution of the first two moments of the process by the approximation of the stochastic model applying a second order Taylor expansion of the SDE s infinitesimal generator in the Dynkin s formula. This method allows a simple and efficient procedure to infer the parameters of such stochastic processes given the data by the maximization of the likelihood of an approximating Gaussian process described by the two moments equations. Finally, we perform numerical experiments for two datasets arising from organic and inorganic fouling deposition phenomena.

  17. Spatio-temporal databases complex motion pattern queries

    CERN Document Server

    Vieira, Marcos R

    2013-01-01

    This brief presents several new query processing techniques, called complex motion pattern queries, specifically designed for very large spatio-temporal databases of moving objects. The brief begins with the definition of flexible pattern queries, which are powerful because of the integration of variables and motion patterns. This is followed by a summary of the expressive power of patterns and flexibility of pattern queries. The brief then present the Spatio-Temporal Pattern System (STPS) and density-based pattern queries. STPS databases contain millions of records with information about mobi

  18. Instant Cassandra query language

    CERN Document Server

    Singh, Amresh

    2013-01-01

    Get to grips with a new technology, understand what it is and what it can do for you, and then get to work with the most important features and tasks. It's an Instant Starter guide.Instant Cassandra Query Language is great for those who are working with Cassandra databases and who want to either learn CQL to check data from the console or build serious applications using CQL. If you're looking for something that helps you get started with CQL in record time and you hate the idea of learning a new language syntax, then this book is for you.

  19. PESCADOR, a web-based tool to assist text-mining of biointeractions extracted from PubMed queries.

    Science.gov (United States)

    Barbosa-Silva, Adriano; Fontaine, Jean-Fred; Donnard, Elisa R; Stussi, Fernanda; Ortega, J Miguel; Andrade-Navarro, Miguel A

    2011-11-09

    Biological function is greatly dependent on the interactions of proteins with other proteins and genes. Abstracts from the biomedical literature stored in the NCBI's PubMed database can be used for the derivation of interactions between genes and proteins by identifying the co-occurrences of their terms. Often, the amount of interactions obtained through such an approach is large and may mix processes occurring in different contexts. Current tools do not allow studying these data with a focus on concepts of relevance to a user, for example, interactions related to a disease or to a biological mechanism such as protein aggregation. To help the concept-oriented exploration of such data we developed PESCADOR, a web tool that extracts a network of interactions from a set of PubMed abstracts given by a user, and allows filtering the interaction network according to user-defined concepts. We illustrate its use in exploring protein aggregation in neurodegenerative disease and in the expansion of pathways associated to colon cancer. PESCADOR is a platform independent web resource available at: http://cbdm.mdc-berlin.de/tools/pescador/

  20. [Simulation of urban expansion based on SLEUTH model in Fuxin City, Northeast China].

    Science.gov (United States)

    Wu, Chun-Hua; Hu, Yuan-Man; Huang, Pei-Quan

    2014-09-01

    Urban expansion was simulated by SLEUTH model based on the data of Fuxin City, Northeast China in 1997-2013. The optimal parameters of urban expansion were obtained from SLEUTH model calibration, with the diffusion coefficient as 6, breed coefficient as 64, spread coefficient as 44, slope resistance as 52 and road gravity as 90. Urban growth types in Fuxin mainly belonged to new center growth and edge growth, i.e., the further expansion of new and old urban centers. Urban expansion was greatly influenced by roads. Fuxin, as a resource-exhausted city, suffered from the natural disasters, such as landslides, subsidence, and so on. The slope resistance of urban expansion was large in the development of urban land. From the perspective of urban scale, road gravity in smaller city was greater than in larger city. The urban expansion in smaller city was more inclined to the new center growth. The locations of enterprises and new development zones were more interested in the area of good transport facilities. Meanwhile, they were inclined to new center growth. Urban expansions were simulated based on optimal parameters of SLEUTH model. The simulated result of edge growth was better than the simulated result of new spreading center growth, because new spreading center growth was susceptible to policymaking, and cellular influence was little. The simulated accuracy of urban land in 2001, 2006, 2010 and 2013 was high.

  1. From Questions to Queries

    Directory of Open Access Journals (Sweden)

    M. Drlík

    2007-12-01

    Full Text Available The extension of (Internet databases forceseveryone to become more familiar with techniques of datastorage and retrieval because users’ success often dependson their ability to pose right questions and to be able tointerpret their answers. University programs pay moreattention to developing database programming skills than todata exploitation skills. To educate our students to become“database users”, the authors intensively exploit supportivetools simplifying the production of database elements astables, queries, forms, reports, web pages, and macros.Videosequences demonstrating “standard operations” forcompleting them have been prepared to enhance out-ofclassroomlearning. The use of SQL and other professionaltools is reduced to the cases when the wizards are unable togenerate the intended construct.

  2. SNUMedinfo at TREC CDS Track 2014: Medical Case-based Retrieval Task

    Science.gov (United States)

    2014-11-01

    knowledge-based query expansion We used external medical literature corpus ( MEDLINE ® ) as a tagged knowledge source to acquire useful query expansion terms...We leased the 2014 MEDLINE ® /PubMed® Journal Citations from the U.S. National Library of Medi- cine. There are approximately 22 million MEDLINE ...documents from external corpus ( MEDLINE ) using query likelihood model. We extracted MeSH MajorTopic de- scriptors from top-k ranked documents. The original

  3. Research Issues in Mobile Querying

    DEFF Research Database (Denmark)

    Breunig, M.; Jensen, Christian Søndergaard; Klein, M.

    2004-01-01

    This document reports on key aspects of the discussions conducted within the working group. In particular, the document aims to offer a structured and somewhat digested summary of the group's discussions. The document first offers concepts that enable characterization of "mobile queries" as well...... as the types of systems that enable such queries. It explores the notion of context in mobile queries. The document ends with a few observations, mainly regarding challenges....

  4. Lost in translation? A multilingual Query Builder improves the quality of PubMed queries: a randomised controlled trial.

    Science.gov (United States)

    Schuers, Matthieu; Joulakian, Mher; Kerdelhué, Gaetan; Segas, Léa; Grosjean, Julien; Darmoni, Stéfan J; Griffon, Nicolas

    2017-07-03

    MEDLINE is the most widely used medical bibliographic database in the world. Most of its citations are in English and this can be an obstacle for some researchers to access the information the database contains. We created a multilingual query builder to facilitate access to the PubMed subset using a language other than English. The aim of our study was to assess the impact of this multilingual query builder on the quality of PubMed queries for non-native English speaking physicians and medical researchers. A randomised controlled study was conducted among French speaking general practice residents. We designed a multi-lingual query builder to facilitate information retrieval, based on available MeSH translations and providing users with both an interface and a controlled vocabulary in their own language. Participating residents were randomly allocated either the French or the English version of the query builder. They were asked to translate 12 short medical questions into MeSH queries. The main outcome was the quality of the query. Two librarians blind to the arm independently evaluated each query, using a modified published classification that differentiated eight types of errors. Twenty residents used the French version of the query builder and 22 used the English version. 492 queries were analysed. There were significantly more perfect queries in the French group vs. the English group (respectively 37.9% vs. 17.9%; p < 0.01). It took significantly more time for the members of the English group than the members of the French group to build each query, respectively 194 sec vs. 128 sec; p < 0.01. This multi-lingual query builder is an effective tool to improve the quality of PubMed queries in particular for researchers whose first language is not English.

  5. jQuery UI 1.10 the user interface library for jQuery

    CERN Document Server

    Libby, Alex

    2013-01-01

    This book consists of an easy-to-follow, example-based approach that leads you step-by-step through the implementation and customization of each library component.This book is for frontend designers and developers who need to learn how to use jQuery UI quickly. To get the most out of this book, you should have a good working knowledge of HTML, CSS, and JavaScript, and should ideally be comfortable using jQuery.

  6. Reevaluating Suitability Estimates Based on Dynamics of Cropland Expansion in the Brazilian Amazon

    Science.gov (United States)

    Morton, Douglas C.; Noojipady, Praveen; Macedo, Marcia M.; Victoria, Daniel C.; Bolfe, Edson L.

    2016-01-01

    Agricultural suitability maps are a key input for land use zoning and projections of cropland expansion. Suitability assessments typically consider edaphic conditions, climate, crop characteristics, and sometimes incorporate accessibility to transportation and market infrastructure. However, correct weighting among these disparate factors is challenging, given rapid development of new crop varieties, irrigation, and road networks, as well as changing global demand for agricultural commodities. Here, we compared three independent assessments of cropland suitability to spatial and temporal dynamics of agricultural expansion in the Brazilian state of Mato Grosso during 2001 2012. We found that areas of recent cropland expansion identified using satellite data were generally designated as low to moderate suitability for rainfed crop production. Our analysis highlighted the abrupt nature of suitability boundaries, rather than smooth gradients of agricultural potential, with little additional cropland expansion beyond the extent of the flattest areas (0-2% slope). Satellite-based estimates of the interannual variability in the use of existing crop areas also provided an alternate means to assess suitability. On average, cropland areas in the Cerrado biome had higher utilization (84%) than croplands in the Amazon region of northern Mato Grosso (74%). Areas of more recent expansion had lower utilization than croplands established before 2002, providing empirical evidence for lower suitability or alternative management strategies (e.g., pasture soya rotations) for lands undergoing more recent land use transitions. This unplanted reserve constitutes a large area of potentially available cropland (PAC)without further expansion, within the management limits imposed for pest management and fallow cycles. Using two key constraints on future cropland expansion, slope and restrictions on further deforestation of Amazon or Cerrado vegetation, we found little available flat land for

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

    Science.gov (United States)

    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

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

    Science.gov (United States)

    Luck, Jeff; Hagigi, Fred; Parker, Louise E; Yano, Elizabeth M; Rubenstein, Lisa V; Kirchner, JoAnn E

    2009-09-28

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

  9. SM4MQ: A Semantic Model for Multidimensional Queries

    DEFF Research Database (Denmark)

    Varga, Jovan; Dobrokhotova, Ekaterina; Romero, Oscar

    2017-01-01

    On-Line Analytical Processing (OLAP) is a data analysis approach to support decision-making. On top of that, Exploratory OLAP is a novel initiative for the convergence of OLAP and the Semantic Web (SW) that enables the use of OLAP techniques on SW data. Moreover, OLAP approaches exploit different...... metadata artifacts (e.g., queries) to assist users with the analysis. However, modeling and sharing of most of these artifacts are typically overlooked. Thus, in this paper we focus on the query metadata artifact in the Exploratory OLAP context and propose an RDF-based vocabulary for its representation......, sharing, and reuse on the SW. As OLAP is based on the underlying multidimensional (MD) data model we denote such queries as MD queries and define SM4MQ: A Semantic Model for Multidimensional Queries. Furthermore, we propose a method to automate the exploitation of queries by means of SPARQL. We apply...

  10. Enabling Semantic Queries Against the Spatial Database

    Directory of Open Access Journals (Sweden)

    PENG, X.

    2012-02-01

    Full Text Available The spatial database based upon the object-relational database management system (ORDBMS has the merits of a clear data model, good operability and high query efficiency. That is why it has been widely used in spatial data organization and management. However, it cannot express the semantic relationships among geospatial objects, making the query results difficult to meet the user's requirement well. Therefore, this paper represents an attempt to combine the Semantic Web technology with the spatial database so as to make up for the traditional database's disadvantages. In this way, on the one hand, users can take advantages of ORDBMS to store and manage spatial data; on the other hand, if the spatial database is released in the form of Semantic Web, the users could describe a query more concisely with the cognitive pattern which is similar to that of daily life. As a consequence, this methodology enables the benefits of both Semantic Web and the object-relational database (ORDB available. The paper discusses systematically the semantic enriched spatial database's architecture, key technologies and implementation. Subsequently, we demonstrate the function of spatial semantic queries via a practical prototype system. The query results indicate that the method used in this study is feasible.

  11. Computing derivative-based global sensitivity measures using polynomial chaos expansions

    International Nuclear Information System (INIS)

    Sudret, B.; Mai, C.V.

    2015-01-01

    In the field of computer experiments sensitivity analysis aims at quantifying the relative importance of each input parameter (or combinations thereof) of a computational model with respect to the model output uncertainty. Variance decomposition methods leading to the well-known Sobol' indices are recognized as accurate techniques, at a rather high computational cost though. The use of polynomial chaos expansions (PCE) to compute Sobol' indices has allowed to alleviate the computational burden though. However, when dealing with large dimensional input vectors, it is good practice to first use screening methods in order to discard unimportant variables. The derivative-based global sensitivity measures (DGSMs) have been developed recently in this respect. In this paper we show how polynomial chaos expansions may be used to compute analytically DGSMs as a mere post-processing. This requires the analytical derivation of derivatives of the orthonormal polynomials which enter PC expansions. Closed-form expressions for Hermite, Legendre and Laguerre polynomial expansions are given. The efficiency of the approach is illustrated on two well-known benchmark problems in sensitivity analysis. - Highlights: • Derivative-based global sensitivity measures (DGSM) have been developed for screening purpose. • Polynomial chaos expansions (PC) are used as a surrogate model of the original computational model. • From a PC expansion the DGSM can be computed analytically. • The paper provides the derivatives of Hermite, Legendre and Laguerre polynomials for this purpose

  12. A Survey on Efficient Power Consumption Method for Continuous Location-Based Spatial Queries in Mobile Environment

    Directory of Open Access Journals (Sweden)

    Vijay Kumar

    2014-07-01

    Full Text Available In today’s growing world saving of time and energy is much considerable. Mobile users are very common for human beings. It is beneficial in use not only for call but also for different uses i.e. find a particular place in unknown city or place. It saves both time and energy towards searching the place. Many researchers have been done in this regard. But they have problem like consuming time and speed to search the location by mobile. Approach: This paper proposed algorithm based on circular location finder (CLF. There are many algorithms available like proxy based location search for continuous near neighbor (CNN, estimated valid region (EVR, and estimated window vector (EWV for region search. These are not efficient in sense of consumption of time and energy. Results: Based on our study, circular location finder (CLF increases approximately 68% speed and decrease 3 times power consumption taken by mobile application. CLF algorithm is efficient in both speed and power consumption

  13. Smart query answering for marine sensor data.

    Science.gov (United States)

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

    2011-01-01

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

  14. Smart Query Answering for Marine Sensor Data

    Directory of Open Access Journals (Sweden)

    Paulo de Souza

    2011-03-01

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

  15. VMQL: A Visual Language for Ad-Hoc Model Querying

    DEFF Research Database (Denmark)

    Störrle, Harald

    2011-01-01

    facilities are inadequate. The Visual Model Query Language (VMQL) is a novel approach that uses the respective modeling language of the source model as the query language, too. The semantics of VMQL is defined formally based on graphs, so that query execution can be defined as graph matching. VMQL has been...... applied to several visual modeling languages, implemented, and validated in small case studies, and several controlled experiments....

  16. Object-Extended OLAP Querying

    DEFF Research Database (Denmark)

    Pedersen, Torben Bach; Gu, Junmin; Shoshani, Arie

    2009-01-01

    On-line analytical processing (OLAP) systems based on a dimensional view of data have found widespread use in business applications and are being used increasingly in non-standard applications. These systems provide good performance and ease-of-use. However, the complex structures and relationships...... inherent in data in non-standard applications are not accommodated well by OLAP systems. In contrast, object database systems are built to handle such complexity, but do not support OLAP-type querying well. This paper presents the concepts and techniques underlying a flexible, "multi-model" federated...... system that enables OLAP users to exploit simultaneously the features of OLAP and object systems. The system allows data to be handled using the most appropriate data model and technology: OLAP systems for dimensional data and object database systems for more complex, general data. This allows data...

  17. jQuery Mobile Up and Running

    CERN Document Server

    Firtman, Maximiliano

    2012-01-01

    Would you like to build one mobile web application that works on iPad and Kindle Fire as well as iPhone and Android smartphones? This introductory guide to jQuery Mobile shows you how. Through a series of hands-on exercises, you'll learn the best ways to use this framework's many interface components to build customizable, multiplatform apps. You don't need any programming skills or previous experience with jQuery to get started. By the time you finish this book, you'll know how to create responsive, Ajax-based interfaces that work on a variety of smartphones and tablets, using jQuery Mobile

  18. A Query System for Texts with Macros

    Science.gov (United States)

    Kwon, Keehang; Kang, Dae-Seong; Kim, Jinsoo

    We propose a query language based on extended regular expressions. This language extends texts with text-generating macros. These macros make it possible to define languages in a compressed, elegant way. This paper also extends queries with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D _??_ G and G1 & G2 where D is a text or a macro and G is a query. The first goal is solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.

  19. The expansion of farm-based plantation forestry in Vietnam.

    Science.gov (United States)

    Sandewall, Mats; Ohlsson, Bo; Sandewall, R Kajsa; Viet, Le Sy

    2010-12-01

    This study targets plantation forestry by farm households (small holders), which is increasing globally and most rapidly in China and Vietnam. By use of an interdisciplinary approach on three study sites in Vietnam, we examined the trends in farmers' tree planting over time, the various pre-requisites for farm-based plantation forestry and its impact on rural people's livelihood strategies, socioeconomic status, income and security. The findings indicated a change from subsistence to cash-based household economy, diversification of farmers' incomes and a transformation of the landscape from mainly natural forests, via deforestation and shifting cultivation, to a landscape dominated by farm-based plantations. The trend of transformation, over a period of some 30 years, towards cash crops and forestry was induced by a combination of policy, market, institutional, infrastructural and other conditions and the existence of professional farming communities, and was most rapid close to the industrial market.

  20. User perspectives on query difficulty

    DEFF Research Database (Denmark)

    Lioma, Christina; Larsen, Birger; Schütze, Hinrich

    2011-01-01

    The difficulty of a user query can affect the performance of Information Retrieval (IR) systems. What makes a query difficult and how one may predict this is an active research area, focusing mainly on factors relating to the retrieval algorithm, to the properties of the retrieval data...

  1. Querying Sentiment Development over Time

    DEFF Research Database (Denmark)

    Andreasen, Troels; Christiansen, Henning; Have, Christian Theil

    2013-01-01

    that measures how well a hypothesis characterizes a given time interval; the semantics is parameterized so it can be adjusted to different views of the data. EmoEpisodes is extended to a query language with variables standing for unknown topics and emotions, and the query-answering mechanism will return...

  2. Fundamentals of Physical Design and Query Compilation

    CERN Document Server

    Toman, David

    2011-01-01

    Query compilation is the problem of translating user requests formulated over purely conceptual and domain specific ways of understanding data, commonly called logical designs, to efficient executable programs called query plans. Such plans access various concrete data sources through their low-level often iterator-based interfaces. An appreciation of the concrete data sources, their interfaces and how such capabilities relate to logical design is commonly called a physical design. This book is an introduction to the fundamental methods underlying database technology that solves the problem of

  3. jQuery Pocket Reference

    CERN Document Server

    Flanagan, David

    2010-01-01

    "As someone who uses jQuery on a regular basis, it was surprising to discover how much of the library I'm not using. This book is indispensable for anyone who is serious about using jQuery for non-trivial applications."-- Raffaele Cecco, longtime developer of video games, including Cybernoid, Exolon, and Stormlord jQuery is the "write less, do more" JavaScript library. Its powerful features and ease of use have made it the most popular client-side JavaScript framework for the Web. This book is jQuery's trusty companion: the definitive "read less, learn more" guide to the library. jQuery P

  4. Instant jQuery selectors

    CERN Document Server

    De Rosa, Aurelio

    2013-01-01

    Filled with practical, step-by-step instructions and clear explanations for the most important and useful tasks. Instant jQuery Selectors follows a simple how-to format with recipes aimed at making you well versed with the wide range of selectors that jQuery has to offer through a myriad of examples.Instant jQuery Selectors is for web developers who want to delve into jQuery from its very starting point: selectors. Even if you're already familiar with the framework and its selectors, you could find several tips and tricks that you aren't aware of, especially about performance and how jQuery ac

  5. jQuery UI cookbook

    CERN Document Server

    Boduch, Adam

    2013-01-01

    Filled with a practical collection of recipes, jQuery UI Cookbook is full of clear, step-by-step instructions that will help you harness the powerful UI framework in jQuery. Depending on your needs, you can dip in and out of the Cookbook and its recipes, or follow the book from start to finish.If you are a jQuery UI developer looking to improve your existing applications, extract ideas for your new application, or to better understand the overall widget architecture, then jQuery UI Cookbook is a must-have for you. The reader should at least have a rudimentary understanding of what jQuery UI is

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

    Science.gov (United States)

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

    2016-01-01

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

  7. Multi-Dimensional Top-k Dominating Queries

    DEFF Research Database (Denmark)

    Yiu, Man Lung; Mamoulis, Nikos

    2009-01-01

    The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it provides data analysts an intuitive way for finding significant objects. In addition, it combines the advantages of top......-k and skyline queries without sharing their disadvantages: (i) the output size can be controlled, (ii) no ranking functions need to be specified by users, and (iii) the result is independent of the scales at different dimensions. Despite their importance, top-k dominating queries have not received adequate...... of the query which considers dominance in dimensional subspaces. Experiments using synthetic and real datasets demonstrate that our algorithms significantly outperform a previous skyline-based approach. We also illustrate the applicability of this multi-dimensional analysis query by studying the meaningfulness...

  8. An Approach to Assist Designers With Their Queries and Designs

    DEFF Research Database (Denmark)

    Ahmed, Saeema

    2006-01-01

    Recent research investigating how engineers search for information has concluded that engineering designers acquire assistance when formulating queries. An approach to assist designers with their queries is presented. This approach forms part of a knowledge management system, where indexed...... documents are entered in to a knowledge-based system and is generated dynamically. The network can be used to assist a designer in searching for information; reformulating a query and; to prompt design tasks. This paper presents an approach to prompt designers with their design queries, along with some...

  9. Query-by-Emoji Video Search

    NARCIS (Netherlands)

    Cappallo, S.; Mensink, T.; Snoek, C.G.M.

    2015-01-01

    This technical demo presents Emoji2Video, a query-by-emoji interface for exploring video collections. Ideogram-based video search and representation presents an opportunity for an intuitive, visual interface and concise non-textual summary of video contents, in a form factor that is ideal for small

  10. Query and document models for enterprise search

    NARCIS (Netherlands)

    Balog, K.; Hofmann, K.; Weerkamp, W.; de Rijke, M.; Voorhees, E.M.; Buckland, L.P.

    2008-01-01

    We describe our participation in the TREC 2007 Enterprise track and detail our language modeling-based approaches. For document search, our focus was on estimating a mixture model using a standard web collection, and on constructing query models by employing blind relevance feedback and using the

  11. Expansion of biological pathways based on evolutionary inference.

    Science.gov (United States)

    Li, Yang; Calvo, Sarah E; Gutman, Roee; Liu, Jun S; Mootha, Vamsi K

    2014-07-03

    The availability of diverse genomes makes it possible to predict gene function based on shared evolutionary history. This approach can be challenging, however, for pathways whose components do not exhibit a shared history but rather consist of distinct "evolutionary modules." We introduce a computational algorithm, clustering by inferred models of evolution (CLIME), which inputs a eukaryotic species tree, homology matrix, and pathway (gene set) of interest. CLIME partitions the gene set into disjoint evolutionary modules, simultaneously learning the number of modules and a tree-based evolutionary history that defines each module. CLIME then expands each module by scanning the genome for new components that likely arose under the inferred evolutionary model. Application of CLIME to ∼1,000 annotated human pathways and to the proteomes of yeast, red algae, and malaria reveals unanticipated evolutionary modularity and coevolving components. CLIME is freely available and should become increasingly powerful with the growing wealth of eukaryotic genomes. Copyright © 2014 Elsevier Inc. All rights reserved.

  12. Location-Dependent Query Processing Under Soft Real-Time Constraints

    Directory of Open Access Journals (Sweden)

    Zoubir Mammeri

    2009-01-01

    Full Text Available In recent years, mobile devices and applications achieved an increasing development. In database field, this development required methods to consider new query types like location-dependent queries (i.e. the query results depend on the query issuer location. Although several researches addressed problems related to location-dependent query processing, a few works considered timing requirements that may be associated with queries (i.e., the query results must be delivered to mobile clients on time. The main objective of this paper is to propose a solution for location-dependent query processing under soft real-time constraints. Hence, we propose methods to take into account client location-dependency and to maximize the percentage of queries respecting their deadlines. We validate our proposal by implementing a prototype based on Oracle DBMS. Performance evaluation results show that the proposed solution optimizes the percentage of queries meeting their deadlines and the communication cost.

  13. Web Database Schema Identification through Simple Query Interface

    Science.gov (United States)

    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.

  14. Grid Transmission Expansion Planning Model Based on Grid Vulnerability

    Science.gov (United States)

    Tang, Quan; Wang, Xi; Li, Ting; Zhang, Quanming; Zhang, Hongli; Li, Huaqiang

    2018-03-01

    Based on grid vulnerability and uniformity theory, proposed global network structure and state vulnerability factor model used to measure different grid models. established a multi-objective power grid planning model which considering the global power network vulnerability, economy and grid security constraint. Using improved chaos crossover and mutation genetic algorithm to optimize the optimal plan. For the problem of multi-objective optimization, dimension is not uniform, the weight is not easy given. Using principal component analysis (PCA) method to comprehensive assessment of the population every generation, make the results more objective and credible assessment. the feasibility and effectiveness of the proposed model are validated by simulation results of Garver-6 bus system and Garver-18 bus.

  15. Adaptive and Optimized RDF Query Interface for Distributed WFS Data

    Directory of Open Access Journals (Sweden)

    Tian Zhao

    2017-04-01

    Full Text Available Web Feature Service (WFS is a protocol for accessing geospatial data stores such as databases and Shapefiles over the Web. However, WFS does not provide direct access to data distributed in multiple servers. In addition, WFS features extracted from their original sources are not convenient for user access due to the lack of connection to high-level concepts. Users are facing the choices of either querying each WFS server first and then integrating the results, or converting the data from all WFS servers to a more expressive format such as RDF (Resource Description Framework and then querying the integrated data. The first choice requires additional programming while the second choice is not practical for large or frequently updated datasets. The new contribution of this paper is that we propose a novel adaptive and optimized RDF query interface to overcome the aforementioned limitation. Specifically, in this paper, we propose a novel algorithm to query and synthesize distributed WFS data through an RDF query interface, where users can specify data requests to multiple WFS servers using a single RDF query. Users can also define a simple configuration to associate WFS feature types, attributes, and values with RDF classes, properties, and values so that user queries can be written using a more uniform and informative vocabulary. The algorithm translates each RDF query written in SPARQL-like syntax to multiple WFS GetFeature requests, and then converts and integrates the multiple WFS results to get the answers to the original query. The generated GetFeature requests are sent asynchronously and simultaneously to WFS servers to take advantage of the server parallelism. The results of each GetFeature request are cached to improve query response time for subsequent queries that involve one or more of the cached requests. A JavaScript-based prototype is implemented and experimental results show that the query response time can be greatly reduced through

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

    Directory of Open Access Journals (Sweden)

    Smith Mark W

    2008-04-01

    Full Text Available Abstract 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.

  17. Expansion of mesenchymal stem cells using a microcarrier-based cultivation system: growth and metabolism

    NARCIS (Netherlands)

    Schop, D.; Janssen, F.W.; Borgart, E.; de Bruijn, Joost Dick; van Dijkhuizen-Radersma, R.

    2008-01-01

    For the continuous and fast expansion of mesenchymal stem cells (MSCs), microcarriers have gained increasing interest. The aim of this study was to evaluate the growth and metabolism profiles of MSCs, expanded in a microcarrier-based cultivation system. We investigated various cultivation conditions

  18. ASR potential of quartz based on expansion values and microscopic characteristics of mortar bars

    Science.gov (United States)

    Stastna, Aneta; Sachlova, Sarka; Kuchynova, Marketa; Pertold, Zdenek; Prikryl, Richard

    2016-04-01

    The alkali-silica reaction (ASR) is one of the most damaging factors for concrete structures. Different analytical techniques are used to quantify ASR potential of aggregates. The accelerated mortar bar test (ASTM C1260) in combination with the petrographic examination of aggregates by microscopic techniques belongs to the frequently employed methods. Such a methodical approach enables quantification of the ASR potential, based on the expansion values of accelerated mortar bars; and also to identify deleterious components in aggregates. In this study, the accelerated mortar bar test (ASTM C1260) was modified and combined with the scanning electron microscopy of polished sections prepared from mortar bars. The standard 14-day test period of mortar bars was prolonged to 1-year. ASR potential of aggregates was assessed based on expansion values (both 14-day and 1-year) of mortar bars and microscopic analysis of ASR products (alkali silica gels, microcracks, dissolution gaps) detected in the sections. Different varieties of quartz-rich rocks including chert, quartz meta-greywacke, three types of quartzite and pegmatite were used as aggregate. Only quartz from pegmatite was assessed to be non reactive (14-day expansion of 0.08%, 1-year expansion of 1.25%). Aggregate sections exhibited minor ASR products even after 1-year of mortar bar immersion in 1 M NaOH. Expansion values of the rest of samples exceeded the limit of 0.10% after 14-day test period indicating aggregates as reactive. The highest ASR potential was detected in mortar bars containing chert (14-day expansion of 0.55%, 1-year expansion of 2.70%) and quartz meta-greywacke (14-day expansion of 0.46%, 1-year expansion of 2.41%). The high ASR potential was explained by presence of cryptocrystalline matrix in significant volumes (24 - 65 vol%). Influence of the lengths of the immersion in the alkaline solution was observed mainly in the microstructure of the cement paste and on the extension of ASR products. The

  19. Comparison of district heating expansion potential based on consumer-economy or socio-economy

    DEFF Research Database (Denmark)

    Grundahl, Lars; Nielsen, Steffen; Lund, Henrik

    2016-01-01

    Recent studies show that a high share of district heating is an important part of a future sustainable energy system or smart energy system with a high renewable energy penetration. These studies also show socio-economic benefits of expanding the district heating coverage. However, in order...... to implement such an expansion, district heating needs to be economically feasible for the heat consumers. This aspect is often not investigated and hence it is unknown if calculations based on consumer-economy, where tax payment is included, will yield the same potential of expansion. This study identifies...... the differences in the expansion potential of district heating calculated with a socio-economic and a consumer-economic approach, respectively, in a case study of Denmark. By also investigating the consumer-economy of expanding district heating, a deeper insight is obtained of possible locations for expanding...

  20. jQuery For Dummies

    CERN Document Server

    Beighley, Lynn

    2010-01-01

    Learn how jQuery can make your Web page or blog stand out from the crowd!. jQuery is free, open source software that allows you to extend and customize Joomla!, Drupal, AJAX, and WordPress via plug-ins. Assuming no previous programming experience, Lynn Beighley takes you through the basics of jQuery from the very start. You'll discover how the jQuery library separates itself from other JavaScript libraries through its ease of use, compactness, and friendliness if you're a beginner programmer. Written in the easy-to-understand style of the For Dummies brand, this book demonstrates how you can a

  1. Schedule Sales Query Raw Data

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

  2. Enabling Incremental Query Re-Optimization.

    Science.gov (United States)

    Liu, Mengmeng; Ives, Zachary G; Loo, Boon Thau

    2016-01-01

    As declarative query processing techniques expand to the Web, data streams, network routers, and cloud platforms, there is an increasing need to re-plan execution in the presence of unanticipated performance changes. New runtime information may affect which query plan we prefer to run. Adaptive techniques require innovation both in terms of the algorithms used to estimate costs , and in terms of the search algorithm that finds the best plan. We investigate how to build a cost-based optimizer that recomputes the optimal plan incrementally given new cost information, much as a stream engine constantly updates its outputs given new data. Our implementation especially shows benefits for stream processing workloads. It lays the foundations upon which a variety of novel adaptive optimization algorithms can be built. We start by leveraging the recently proposed approach of formulating query plan enumeration as a set of recursive datalog queries ; we develop a variety of novel optimization approaches to ensure effective pruning in both static and incremental cases. We further show that the lessons learned in the declarative implementation can be equally applied to more traditional optimizer implementations.

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

    Science.gov (United States)

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

    2015-02-01

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

  4. Automatic Query Generation and Query Relevance Measurement for Unsupervised Language Model Adaptation of Speech Recognition

    Directory of Open Access Journals (Sweden)

    Suzuki Motoyuki

    2009-01-01

    Full Text Available Abstract We are developing a method of Web-based unsupervised language model adaptation for recognition of spoken documents. The proposed method chooses keywords from the preliminary recognition result and retrieves Web documents using the chosen keywords. A problem is that the selected keywords tend to contain misrecognized words. The proposed method introduces two new ideas for avoiding the effects of keywords derived from misrecognized words. The first idea is to compose multiple queries from selected keyword candidates so that the misrecognized words and correct words do not fall into one query. The second idea is that the number of Web documents downloaded for each query is determined according to the "query relevance." Combining these two ideas, we can alleviate bad effect of misrecognized keywords by decreasing the number of downloaded Web documents from queries that contain misrecognized keywords. Finally, we examine a method of determining the number of iterative adaptations based on the recognition likelihood. Experiments have shown that the proposed stopping criterion can determine almost the optimum number of iterations. In the final experiment, the word accuracy without adaptation (55.29% was improved to 60.38%, which was 1.13 point better than the result of the conventional unsupervised adaptation method (59.25%.

  5. Automatic Query Generation and Query Relevance Measurement for Unsupervised Language Model Adaptation of Speech Recognition

    Directory of Open Access Journals (Sweden)

    Akinori Ito

    2009-01-01

    Full Text Available We are developing a method of Web-based unsupervised language model adaptation for recognition of spoken documents. The proposed method chooses keywords from the preliminary recognition result and retrieves Web documents using the chosen keywords. A problem is that the selected keywords tend to contain misrecognized words. The proposed method introduces two new ideas for avoiding the effects of keywords derived from misrecognized words. The first idea is to compose multiple queries from selected keyword candidates so that the misrecognized words and correct words do not fall into one query. The second idea is that the number of Web documents downloaded for each query is determined according to the “query relevance.” Combining these two ideas, we can alleviate bad effect of misrecognized keywords by decreasing the number of downloaded Web documents from queries that contain misrecognized keywords. Finally, we examine a method of determining the number of iterative adaptations based on the recognition likelihood. Experiments have shown that the proposed stopping criterion can determine almost the optimum number of iterations. In the final experiment, the word accuracy without adaptation (55.29% was improved to 60.38%, which was 1.13 point better than the result of the conventional unsupervised adaptation method (59.25%.

  6. Top-k Spatial Preference Queries in Directed Road Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Attique

    2016-09-01

    Full Text Available Top-k spatial preference queries rank objects based on the score of feature objects in their spatial neighborhood. Top-k preference queries are crucial for a wide range of location based services such as hotel browsing and apartment searching. In recent years, a lot of research has been conducted on processing of top-k spatial preference queries in Euclidean space. While few algorithms study top-k preference queries in road networks, they all focus on undirected road networks. In this paper, we investigate the problem of processing the top-k spatial preference queries in directed road networks where each road segment has a particular orientation. Computation of data object scores requires examining the scores of each feature object in its spatial neighborhood. This may cause the computational delay, thus resulting in a high query processing time. In this paper, we address this problem by proposing a pruning and grouping of feature objects to reduce the number of feature objects. Furthermore, we present an efficient algorithm called TOPS that can process top-k spatial preference queries in directed road networks. Experimental results indicate that our algorithm significantly reduces the query processing time compared to period solution for a wide range of problem settings.

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

    Science.gov (United States)

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

    2009-12-01

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

  8. Macromolecular query language (MMQL): prototype data model and implementation.

    Science.gov (United States)

    Shindyalov, I N; Chang, W; Pu, C; Bourne, P E

    1994-11-01

    Macromolecular query language (MMQL) is an extensible interpretive language in which to pose questions concerning the experimental or derived features of the 3-D structure of biological macromolecules. MMQL portends to be intuitive with a simple syntax, so that from a user's perspective complex queries are easily written. A number of basic queries and a more complex query--determination of structures containing a five-strand Greek key motif--are presented to illustrate the strengths and weaknesses of the language. The predominant features of MMQL are a filter and pattern grammar which are combined to express a wide range of interesting biological queries. Filters permit the selection of object attributes, for example, compound name and resolution, whereas the patterns currently implemented query primary sequence, close contacts, hydrogen bonding, secondary structure, conformation and amino acid properties (volume, polarity, isoelectric point, hydrophobicity and different forms of exposure). MMQL queries are processed by MMQLlib; a C++ class library, to which new query methods and pattern types are easily added. The prototype implementation described uses PDBlib, another C(++)-based class library from representing the features of biological macromolecules at the level of detail parsable from a PDB file. Since PDBlib can represent data stored in relational and object-oriented databases, as well as PDB files, once these data are loaded they too can be queried by MMQL. Performance metrics are given for queries of PDB files for which all derived data are calculated at run time and compared to a preliminary version of OOPDB, a prototype object-oriented database with a schema based on a persistent version of PDBlib which offers more efficient data access and the potential to maintain derived information. MMQLlib, PDBlib and associated software are available via anonymous ftp from cuhhca.hhmi.columbia.edu.

  9. Fingerprinting Keywords in Search Queries over Tor

    Directory of Open Access Journals (Sweden)

    Oh Se Eun

    2017-10-01

    Full Text Available Search engine queries contain a great deal of private and potentially compromising information about users. One technique to prevent search engines from identifying the source of a query, and Internet service providers (ISPs from identifying the contents of queries is to query the search engine over an anonymous network such as Tor.

  10. Mining Longitudinal Web Queries: Trends and Patterns.

    Science.gov (United States)

    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. EXPANSION OF A RELATIONAL DATABASE TO SUPPORT SEMANTIC WEB QUERIES

    OpenAIRE

    Januzaj, Ylber; Krrabaj, Samedin; Luma, Artan; Hajra, Arben; Selimi, Besnik

    2017-01-01

    Nowadays various types of data, especially those with public character,are stored and represented in relational databases. While this way of storingdata is a practice for most of the institutions, it turns them into isolatedsilos with low level of accessibility and interoperability in the web.  Indeed not all datasets are readable from theWorld Wide Web, therefore to increase their access it is necessary to providemapping from relational databases to any serialization format of ResourceDescri...

  12. Condorcet query engine: A query engine for coordinated index terms

    NARCIS (Netherlands)

    van der Vet, P.E.; Mars, Nicolaas

    1999-01-01

    On-line information retrieval systems often offer their users some means to tune the query to match the level of granularity of the information request. Users can be offered a far greater range of possibilities, however, if documents are indexed with coordinated index concepts. Coordinated index

  13. Graphical modeling and query language for hospitals.

    Science.gov (United States)

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

    2013-01-01

    So far there has been little evidence that implementation of the health information technologies (HIT) is leading to health care cost savings. One of the reasons for this lack of impact by the HIT likely lies in the complexity of the business process ownership in the hospitals. The goal of our research is to develop a business model-based method for hospital use which would allow doctors to retrieve directly the ad-hoc information from various hospital databases. We have developed a special domain-specific process modelling language called the MedMod. Formally, we define the MedMod language as a profile on UML Class diagrams, but we also demonstrate it on examples, where we explain the semantics of all its elements informally. Moreover, we have developed the Process Query Language (PQL) that is based on MedMod process definition language. The purpose of PQL is to allow a doctor querying (filtering) runtime data of hospital's processes described using MedMod. The MedMod language tries to overcome deficiencies in existing process modeling languages, allowing to specify the loosely-defined sequence of the steps to be performed in the clinical process. The main advantages of PQL are in two main areas - usability and efficiency. They are: 1) the view on data through "glasses" of familiar process, 2) the simple and easy-to-perceive means of setting filtering conditions require no more expertise than using spreadsheet applications, 3) the dynamic response to each step in construction of the complete query that shortens the learning curve greatly and reduces the error rate, and 4) the selected means of filtering and data retrieving allows to execute queries in O(n) time regarding the size of the dataset. We are about to continue developing this project with three further steps. First, we are planning to develop user-friendly graphical editors for the MedMod process modeling and query languages. The second step is to do evaluation of usability the proposed language and tool

  14. Head First jQuery

    CERN Document Server

    Benedetti, Ryan

    2011-01-01

    Want to add more interactivity and polish to your websites? Discover how jQuery can help you build complex scripting functionality in just a few lines of code. With Head First jQuery, you'll quickly get up to speed on this amazing JavaScript library by learning how to navigate HTML documents while handling events, effects, callbacks, and animations. By the time you've completed the book, you'll be incorporating Ajax apps, working seamlessly with HTML and CSS, and handling data with PHP, MySQL and JSON. If you want to learn-and understand-how to create interactive web pages, unobtrusive scrip

  15. Processing SPARQL queries with regular expressions in RDF databases.

    Science.gov (United States)

    Lee, Jinsoo; Pham, Minh-Duc; Lee, Jihwan; Han, Wook-Shin; Cho, Hune; Yu, Hwanjo; Lee, Jeong-Hoon

    2011-03-29

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

  16. Aft-body loading function for penetrators based on the spherical cavity-expansion approximation.

    Energy Technology Data Exchange (ETDEWEB)

    Longcope, Donald B., Jr.; Warren, Thomas Lynn; Duong, Henry

    2009-12-01

    In this paper we develop an aft-body loading function for penetration simulations that is based on the spherical cavity-expansion approximation. This loading function assumes that there is a preexisting cavity of radius a{sub o} before the expansion occurs. This causes the radial stress on the cavity surface to be less than what is obtained if the cavity is opened from a zero initial radius. This in turn causes less resistance on the aft body as it penetrates the target which allows for greater rotation of the penetrator. Results from simulations are compared with experimental results for oblique penetration into a concrete target with an unconfined compressive strength of 23 MPa.

  17. A Nonparametric Operational Risk Modeling Approach Based on Cornish-Fisher Expansion

    Directory of Open Access Journals (Sweden)

    Xiaoqian Zhu

    2014-01-01

    Full Text Available It is generally accepted that the choice of severity distribution in loss distribution approach has a significant effect on the operational risk capital estimation. However, the usually used parametric approaches with predefined distribution assumption might be not able to fit the severity distribution accurately. The objective of this paper is to propose a nonparametric operational risk modeling approach based on Cornish-Fisher expansion. In this approach, the samples of severity are generated by Cornish-Fisher expansion and then used in the Monte Carlo simulation to sketch the annual operational loss distribution. In the experiment, the proposed approach is employed to calculate the operational risk capital charge for the overall Chinese banking. The experiment dataset is the most comprehensive operational risk dataset in China as far as we know. The results show that the proposed approach is able to use the information of high order moments and might be more effective and stable than the usually used parametric approach.

  18. Transmission network expansion planning based on hybridization model of neural networks and harmony search algorithm

    Directory of Open Access Journals (Sweden)

    Mohammad Taghi Ameli

    2012-01-01

    Full Text Available Transmission Network Expansion Planning (TNEP is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimization problem in which the expansion purposes are optimized. Artificial Intelligence (AI tools such as Genetic Algorithm (GA, Simulated Annealing (SA, Tabu Search (TS and Artificial Neural Networks (ANNs are methods used for solving the TNEP problem. Today, by using the hybridization models of AI tools, we can solve the TNEP problem for large-scale systems, which shows the effectiveness of utilizing such models. In this paper, a new approach to the hybridization model of Probabilistic Neural Networks (PNNs and Harmony Search Algorithm (HSA was used to solve the TNEP problem. Finally, by considering the uncertain role of the load based on a scenario technique, this proposed model was tested on the Garver’s 6-bus network.

  19. Parameter Curation for Benchmark Queries

    NARCIS (Netherlands)

    Gubichev, Andrey; Boncz, Peter

    2014-01-01

    In this paper we consider the problem of generating parameters for benchmark queries so these have stable behavior despite being executed on datasets (real-world or synthetic) with skewed data distributions and value correlations. We show that uniform random sampling of the substitution parameters

  20. Automatically Preparing Safe SQL Queries

    Science.gov (United States)

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

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

  1. Fuzzy Querying: Issues and Perspectives..

    Czech Academy of Sciences Publication Activity Database

    Kacprzyk, J.; Pasi, G.; Vojtáš, Peter; Zadrozny, S.

    2000-01-01

    Roč. 36, č. 6 (2000), s. 605-616 ISSN 0023-5954 Institutional research plan: AV0Z1030915 Keywords : flexible querying * information retrieval * fuzzy databases Subject RIV: BA - General Mathematics http://dml.cz/handle/10338.dmlcz/135376

  2. Enhancing Recall in Semantic Querying

    DEFF Research Database (Denmark)

    Rouces, Jacobo

    2013-01-01

    RDF and SPARQL are currently state-of-the-art W3C standards to respectively represent and query structured information, especially when information from different sources must be federated. However, there are various reasons for which the same knowledge can be modeled in RDF graphs that are both ...

  3. Querying Large Biological Network Datasets

    Science.gov (United States)

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

  4. Unnatural base pair systems toward the expansion of the genetic alphabet in the central dogma.

    Science.gov (United States)

    Hirao, Ichiro; Kimoto, Michiko

    2012-01-01

    Toward the expansion of the genetic alphabet of DNA, several artificial third base pairs (unnatural base pairs) have been created. Synthetic DNAs containing the unnatural base pairs can be amplified faithfully by PCR, along with the natural A-T and G-C pairs, and transcribed into RNA. The unnatural base pair systems now have high potential to open the door to next generation biotechnology. The creation of unnatural base pairs is a consequence of repeating "proof of concept" experiments. In the process, initially designed base pairs were modified to address their weak points. Some of them were artificially evolved to ones with higher efficiency and selectivity in polymerase reactions, while others were eliminated from the analysis. Here, we describe the process of unnatural base pair development, as well as the tests of their applications.

  5. jQuery 2.0 animation techniques beginner's guide

    CERN Document Server

    Culpepper, Adam

    2013-01-01

    This book is a guide to help you create attractive web page animations using jQuery. Written in a friendly and engaging approach this book is designed to be placed alongside your computer as a mentor.If you are a web designer or a frontend developer or if you want to learn how to animate the user interface of your web applications with jQuery, this book is for you. Experience with jQuery or Javascript would be helpful but solid knowledge base of HTML and CSS is assumed.

  6. Assessing Ebola-related web search behaviour: insights and implications from an analytical study of Google Trends-based query volumes.

    Science.gov (United States)

    Alicino, Cristiano; Bragazzi, Nicola Luigi; Faccio, Valeria; Amicizia, Daniela; Panatto, Donatella; Gasparini, Roberto; Icardi, Giancarlo; Orsi, Andrea

    2015-12-10

    The 2014 Ebola epidemic in West Africa has attracted public interest worldwide, leading to millions of Ebola-related Internet searches being performed during the period of the epidemic. This study aimed to evaluate and interpret Google search queries for terms related to the Ebola outbreak both at the global level and in all countries where primary cases of Ebola occurred. The study also endeavoured to look at the correlation between the number of overall and weekly web searches and the number of overall and weekly new cases of Ebola. Google Trends (GT) was used to explore Internet activity related to Ebola. The study period was from 29 December 2013 to 14 June 2015. Pearson's correlation was performed to correlate Ebola-related relative search volumes (RSVs) with the number of weekly and overall Ebola cases. Multivariate regression was performed using Ebola-related RSV as a dependent variable, and the overall number of Ebola cases and the Human Development Index were used as predictor variables. The greatest RSV was registered in the three West African countries mainly affected by the Ebola epidemic. The queries varied in the different countries. Both quantitative and qualitative differences between the affected African countries and other Western countries with primary cases were noted, in relation to the different flux volumes and different time courses. In the affected African countries, web query search volumes were mostly concentrated in the capital areas. However, in Western countries, web queries were uniformly distributed over the national territory. In terms of the three countries mainly affected by the Ebola epidemic, the correlation between the number of new weekly cases of Ebola and the weekly GT index varied from weak to moderate. The correlation between the number of Ebola cases registered in all countries during the study period and the GT index was very high. Google Trends showed a coarse-grained nature, strongly correlating with global

  7. A Proposed Stochastic Finite Difference Approach Based on Homogenous Chaos Expansion

    Directory of Open Access Journals (Sweden)

    O. H. Galal

    2013-01-01

    Full Text Available This paper proposes a stochastic finite difference approach, based on homogenous chaos expansion (SFDHC. The said approach can handle time dependent nonlinear as well as linear systems with deterministic or stochastic initial and boundary conditions. In this approach, included stochastic parameters are modeled as second-order stochastic processes and are expanded using Karhunen-Loève expansion, while the response function is approximated using homogenous chaos expansion. Galerkin projection is used in converting the original stochastic partial differential equation (PDE into a set of coupled deterministic partial differential equations and then solved using finite difference method. Two well-known equations were used for efficiency validation of the method proposed. First one being the linear diffusion equation with stochastic parameter and the second is the nonlinear Burger's equation with stochastic parameter and stochastic initial and boundary conditions. In both of these examples, the probability distribution function of the response manifested close conformity to the results obtained from Monte Carlo simulation with optimized computational cost.

  8. Summarization of Text Document Using Query Dependent Parsing Techniques

    Science.gov (United States)

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

    2010-11-01

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

  9. Investigation on the Expansion of Urban Construction Land Use Based on the CART-CA Model

    Directory of Open Access Journals (Sweden)

    Yongxiang Yao

    2017-05-01

    Full Text Available Change in urban construction land use is an important factor when studying urban expansion. Many scholars have combined cellular automata (CA with data mining algorithms to perform relevant simulation studies. However, the parameters for rule extraction are difficult to determine and the rules are simplex, and together, these factors tend to introduce excessive fitting problems and low modeling accuracy. In this paper, we propose a method to extract the transformation rules for a CA model based on the Classification and Regression Tree (CART. In this method, CART is used to extract the transformation rules for the CA. This method first adopts the CART decision tree using the bootstrap algorithm to mine the rules from the urban land use while considering the factors that impact the geographic spatial variables in the CART regression procedure. The weights of individual impact factors are calculated to generate a logistic regression function that reflects the change in urban construction land use. Finally, a CA model is constructed to simulate and predict urban construction land expansion. The urban area of Xinyang City in China is used as an example for this experimental research. After removing the spatial invariant region, the overall simulation accuracy is 81.38% and the kappa coefficient is 0.73. The results indicate that by using the CART decision tree to train the impact factor weights and extract the rules, it can effectively increase the simulation accuracy of the CA model. From convenience and accuracy perspectives for rule extraction, the structure of the CART decision tree is clear, and it is very suitable for obtaining the cellular rules. The CART-CA model has a relatively high simulation accuracy in modeling urban construction land use expansion, it provides reliable results, and is suitable for use as a scientific reference for urban construction land use expansion.

  10. Optimizing Temporal Queries: Efficient Handling of Duplicates

    DEFF Research Database (Denmark)

    Toman, David; Bowman, Ivan Thomas

    2001-01-01

    , these query languages are implemented by translating temporal queries into standard relational queries. However, the compiled queries are often quite cumbersome and expensive to execute even using state-of-the- art relational products. This paper presents an optimization technique that produces more efficient...... translated SQL queries by taking into account the properties of the encoding used for temporal attributes. For concreteness, this translation technique is presented in the context of SQL/TP; however, these techniques are also applicable to other temporal query languages....

  11. Maxillary Expansion

    OpenAIRE

    Agarwal, Anirudh; Mathur, Rinku

    2010-01-01

    ABSTRACT Maxillary transverse discrepancy usually requires expansion of the palate by a combination of orthopedic and orthodontic tooth movements. Three expansion treatment modalities are used today: rapid maxillary expansion, slow maxillary expansion and surgically assisted maxillary expansion.This article aims to review the maxillary expansion by all the three modalities and a brief on commonly used appliances.

  12. LAILAPS-QSM: A RESTful API and JAVA library for semantic query suggestions.

    Science.gov (United States)

    Chen, Jinbo; Scholz, Uwe; Zhou, Ruonan; Lange, Matthias

    2018-03-12

    In order to access and filter content of life-science databases, full text search is a widely applied query interface. But its high flexibility and intuitiveness is paid for with potentially imprecise and incomplete query results. To reduce this drawback, query assistance systems suggest those combinations of keywords with the highest potential to match most of the relevant data records. Widespread approaches are syntactic query corrections that avoid misspelling and support expansion of words by suffixes and prefixes. Synonym expansion approaches apply thesauri, ontologies, and query logs. All need laborious curation and maintenance. Furthermore, access to query logs is in general restricted. Approaches that infer related queries by their query profile like research field, geographic location, co-authorship, affiliation etc. require user's registration and its public accessibility that contradict privacy concerns. To overcome these drawbacks, we implemented LAILAPS-QSM, a machine learning approach that reconstruct possible linguistic contexts of a given keyword query. The context is referred from the text records that are stored in the databases that are going to be queried or extracted for a general purpose query suggestion from PubMed abstracts and UniProt data. The supplied tool suite enables the pre-processing of these text records and the further computation of customized distributed word vectors. The latter are used to suggest alternative keyword queries. An evaluated of the query suggestion quality was done for plant science use cases. Locally present experts enable a cost-efficient quality assessment in the categories trait, biological entity, taxonomy, affiliation, and metabolic function which has been performed using ontology term similarities. LAILAPS-QSM mean information content similarity for 15 representative queries is 0.70, whereas 34% have a score above 0.80. In comparison, the information content similarity for human expert made query suggestions

  13. Flexible Query Answering Systems 2006

    DEFF Research Database (Denmark)

    This volume constitutes the proceedings of the Seventh International Conference on Flexible Query Answering Systems, FQAS 2006, held in Milan, Italy, on June 7--10, 2006. FQAS is the premier conference for researchers and practitioners concerned with the vital task of providing easy, flexible......, and intuitive access to information for every type of need. This multidisciplinary conference draws on several research areas, including information retrieval, database management, information filtering, knowledge representation, soft computing, management of multimedia information, and human...... submissions, relating to the topic of users posing queries and systems producing answers. The papers cover the fields: Database Management, Information Retrieval, Domain Modeling, Knowledge Representation and Ontologies, Knowledge Discovery and Data Mining, Artificial Intelligence, Classical and Non...

  14. Querying Sentiment Development over Time

    DEFF Research Database (Denmark)

    Andreasen, Troels; Christiansen, Henning; Have, Christian Theil

    2013-01-01

    A new language is introduced for describing hypotheses about fluctuations of measurable properties in streams of timestamped data, and as prime example, we consider trends of emotions in the constantly flowing stream of Twitter messages. The language, called EmoEpisodes, has a precise semantics...... that measures how well a hypothesis characterizes a given time interval; the semantics is parameterized so it can be adjusted to different views of the data. EmoEpisodes is extended to a query language with variables standing for unknown topics and emotions, and the query-answering mechanism will return...... instantiations for topics and emotions as well as time intervals that provide the largest deflections in this measurement. Experiments are performed on a selection of Twitter data to demonstrates the usefulness of the approach....

  15. Mobile Information Access with Spoken Query Answering

    DEFF Research Database (Denmark)

    Brøndsted, Tom; Larsen, Henrik Legind; Larsen, Lars Bo

    2006-01-01

    This paper addresses the problem of information and service accessibility in mobile devices with limited resources. A solution is developed and tested through a prototype that applies state-of-the-art Distributed Speech Recognition (DSR) and knowledge-based Information Retrieval (IR) processing...... for spoken query answering. For the DSR part, a configurable DSR system is implemented on the basis of the ETSI-DSR advanced front-end and the SPHINX IV recognizer. For the knowledge-based IR part, a distributed system solution is developed for fast retrieval of the most relevant documents, with a text...

  16. XML Multidimensional Modelling and Querying

    OpenAIRE

    Boucher, Serge; Verhaegen, Boris; Zimányi, Esteban

    2009-01-01

    As XML becomes ubiquitous and XML storage and processing becomes more efficient, the range of use cases for these technologies widens daily. One promising area is the integration of XML and data warehouses, where an XML-native database stores multidimensional data and processes OLAP queries written in the XQuery interrogation language. This paper explores issues arising in the implementation of such a data warehouse. We first compare approaches for multidimensional data modelling in XML, then...

  17. Final Environmental Assessment for the Okaloosa Regional Airport Expansion at Eglin Air Force Base, FL

    Science.gov (United States)

    2006-06-01

    proposed to be a N/S Corporation 5- Brush system, would require a power usage between 0.5 and 3.4 amps maximum for the wash cycle, which is a minimal...a water recovery system. The water recovery system of the proposed car wash model (N/S Corporation 5- Brush System) is built to reclaim...Expansion at Eglin Air Force Base, FL Erica L. Teets , SAIC NEPA Specialist Planner/Author B.S. Biochemistry M.A. Biology M.S. Biological

  18. Design and analysis of stochastic DSS query optimizers in a distributed database system

    Directory of Open Access Journals (Sweden)

    Manik Sharma

    2016-07-01

    Full Text Available Query optimization is a stimulating task of any database system. A number of heuristics have been applied in recent times, which proposed new algorithms for substantially improving the performance of a query. The hunt for a better solution still continues. The imperishable developments in the field of Decision Support System (DSS databases are presenting data at an exceptional rate. The massive volume of DSS data is consequential only when it is able to access and analyze by distinctive researchers. Here, an innovative stochastic framework of DSS query optimizer is proposed to further optimize the design of existing query optimization genetic approaches. The results of Entropy Based Restricted Stochastic Query Optimizer (ERSQO are compared with the results of Exhaustive Enumeration Query Optimizer (EAQO, Simple Genetic Query Optimizer (SGQO, Novel Genetic Query Optimizer (NGQO and Restricted Stochastic Query Optimizer (RSQO. In terms of Total Costs, EAQO outperforms SGQO, NGQO, RSQO and ERSQO. However, stochastic approaches dominate in terms of runtime. The Total Costs produced by ERSQO is better than SGQO, NGQO and RGQO by 12%, 8% and 5% respectively. Moreover, the effect of replicating data on the Total Costs of DSS query is also examined. In addition, the statistical analysis revealed a 2-tailed significant correlation between the number of join operations and the Total Costs of distributed DSS query. Finally, in regard to the consistency of stochastic query optimizers, the results of SGQO, NGQO, RSQO and ERSQO are 96.2%, 97.2%, 97.45 and 97.8% consistent respectively.

  19. Identifying Aspects for Web-Search Queries

    OpenAIRE

    Wu, Fei; Madhavan, Jayant; Halevy, Alon

    2014-01-01

    Many web-search queries serve as the beginning of an exploration of an unknown space of information, rather than looking for a specific web page. To answer such queries effec- tively, the search engine should attempt to organize the space of relevant information in a way that facilitates exploration. We describe the Aspector system that computes aspects for a given query. Each aspect is a set of search queries that together represent a distinct information need relevant to the original search...

  20. How Good Are Query Optimizers, Really?

    NARCIS (Netherlands)

    Leis, Viktor; Gubichev, Andrey; Mirchev, Atanas; Boncz, Peter; Kemper, Alfons; Neumann, Thomas

    2016-01-01

    Finding a good join order is crucial for query performance. In this paper, we introduce the Join Order Benchmark (JOB) and experimentally revisit the main components in the classic query optimizer architecture using a complex, real-world data set and realistic multi-join queries. We investigate the

  1. How Good Are Query Optimizers, Really?

    NARCIS (Netherlands)

    V. Leis (Viktor); A. Gubichev (Andrey); A. Mirchev (Atanas); P.A. Boncz (Peter); T. Neumann (Thomas); A. Kemper (Alfons)

    2015-01-01

    htmlabstractFinding a good join order is crucial for query performance. In this paper, we introduce the Join Order Benchmark (JOB) and experimentally revisit the main components in the classic query optimizer architecture using a complex, real-world data set and realistic multi-join queries. We

  2. Predecessor queries in dynamic integer sets

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting

    1997-01-01

    We consider the problem of maintaining a set of n integers in the range 0.2w–1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum queries on a unit cost RAM with word size w bits. Let f (n) be an arbitrary nondecreasing smooth function satisfying n...

  3. A high capacity reversible watermarking scheme for relational databases based on mapping difference expansion

    Science.gov (United States)

    Qing, Yin; Zhu, Yuesheng; Yang, Fan; Jiang, Yifeng

    2017-07-01

    The watermarking technique can be used to protect the copyright of relational databases by hiding the ownership information into the relational databases. Difference expansion (DE) technique is one of the common reversible watermarking techniques for numerical relational databases. However, most previous schemes based on DE suffer the problem of low embedding capacity when the difference values between different attributes are relatively large. In this paper, we propose a novel reversible watermarking scheme to solve the above problem. In the scheme, a mapping difference expansion (MDE) method is proposed to convert the differences between attributes to small mapping differences. Based on the MDE, an attribute and tuple selection algorithm is designed to select the suitable data for watermarking, which can increase embedding capacity and reduce distortion. In addition, the majority voting technique is utilized to enhance the robustness of watermarking with the high embedding capacity. The experimental results have shown that the proposed scheme can provide higher embedding capacity, lower distortion and stronger robustness than other schemes.

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

    Science.gov (United States)

    Adams, Norman H.; Wakefield, Gregory H.

    2005-09-01

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

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

    Science.gov (United States)

    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.

  6. Optimizing queries in SQL Server 2008

    Directory of Open Access Journals (Sweden)

    Ion LUNGU

    2010-05-01

    Full Text Available Starting from the need to develop efficient IT systems, we intend to review theoptimization methods and tools that can be used by SQL Server database administratorsand developers of applications based on Microsoft technology, focusing on the latestversion of the proprietary DBMS, SQL Server 2008. We’ll reflect on the objectives tobe considered in improving the performance of SQL Server instances, we will tackle themostly used techniques for analyzing and optimizing queries and we will describe the“Optimize for ad hoc workloads”, “Plan Freezing” and “Optimize for unknown" newoptions, accompanied by relevant code examples.

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

    Science.gov (United States)

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

    2016-07-04

    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. 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. 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. 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; Psearch queries to enhance influenza surveillance in South Korea. In addition, an approach for query selection using social media data seems ideal for supporting influenza surveillance based on search query data.

  8. Web development with jQuery

    CERN Document Server

    York, Richard

    2015-01-01

    Newly revised and updated resource on jQuery's many features and advantages Web Development with jQuery offers a major update to the popular Beginning JavaScript and CSS Development with jQuery from 2009. More than half of the content is new or updated, and reflects recent innovations with regard to mobile applications, jQuery mobile, and the spectrum of associated plugins. Readers can expect thorough revisions with expanded coverage of events, CSS, AJAX, animation, and drag and drop. New chapters bring developers up to date on popular features like jQuery UI, navigation, tables, interacti

  9. Time-based lateral hygroscopic expansion of a water-expandable endodontic obturation point.

    Science.gov (United States)

    Didato, Anthony; Eid, Ashraf A; Levin, Martin D; Khan, Sara; Tay, Franklin R; Rueggeberg, Frederick A

    2013-09-01

    This study compared the time-based lateral expansion of two sizes and two batches of water-expandable obturation points (CPoint, EndoTechnologies, LLC) and a similar-sized gutta-percha point (control) at various distances from the point apex: 5, 10, and 15mm. Two batches of sizes 25 and 40 (0.06 taper) CPoints and a single lot of size 40 (0.06 taper) gutta-percha were tested (N=5). Points were fixed to the bottom of a Petri dish, and digital images of each point location were obtained under 50× magnification, which also captured a calibrated linear scale reticule. After imaging each dry cone location, 10mL of water was added, and images were obtained at various time points: 20 and 40min, 1, 2, 3, 4, 5, 6, 7, 8, and 24h. Between measurements, dishes were stored at 37°C. Side-to-side dimension of each point was determined using imaging software No significant differences (p>0.05) in lateral dimension at each tip distance between batches of similar-sized CPoint samples were found (2-tailed unpaired Student's t-test). Changes in CPoint dimension were significantly higher (p0.05). When exposed to water, the lateral expansion of a new hydrophilic endodontic obturation point significantly increases in dimension within 20min, whereas a conventional gutta-percha point does not. Copyright © 2013 Elsevier Ltd. All rights reserved.

  10. New wrought Ni-based superalloys with low thermal expansion for 700C steam turbines

    Energy Technology Data Exchange (ETDEWEB)

    Yamamoto, R.; Kadoya, Y. [Takasago Research and Development Center, Mitsubishi Heavy Industries, Ltd., Takasago, Hyogo (Japan); Kawai, H.; Magoshi, R. [Takasago Machinery Works, Mitsubishi Heavy Industries, Ltd., Takasago, Hyogo (Japan); Noda, T.; Hamano, S.; Ueta, S.; Isobe, S. [Research and Development Lab., Daido Steel Co., Ltd., Minamiku, Nagoya (Japan)

    2002-07-01

    Advanced 700C class steam turbines require austenitic alloys to replace conventional ferritic 12Cr steels, which lose creep strength and oxidation resistance above 650C. The austenitic alloys, however, possess a higher thermal expansion coefficient than ferritic 12Cr steels. Therefore, Ni-based superalloys were tailored to reduce their coefficients to the level of 12Cr steels. A regression analysis of commercial superalloys proves that Ti, Mo and Al decrease the coefficient quantitatively in this order, while Cr increases it so significantly that Cr should be limited to 12wt% to secure oxidation resistance. The newly designed Ni-18Mo-12Cr-1.1Ti-0.9Al alloy is strengthened by gamma-prime [Ni{sub 3}(Al,Ti)] and also Laves [Ni{sub 2}(Mo,Cr)] phase precipitates. It bears a RT/700C mean expansion coefficient equivalent to that of 12Cr steels and far lower than that of low-alloyed heat resistant steels. It surpasses a current turbine alloy, Refractaloy 26, in tensile strength at RT to 700C and SCC life in 330C deaerated pure water. Its creep rupture life at 700C is equivalent to that of Refractaloy 26. The developed alloy will be suitable for fasteners and/or blades in steam turbines at present and future USC power plants. (orig.)

  11. Reliability worth applied to transmission expansion planning based on ant colony system

    Energy Technology Data Exchange (ETDEWEB)

    Leite da Silva, Armando M.; Rezende, Leandro S. [Institute of Electric Systems and Energy, Federal University of Itajuba, UNIFEI (Brazil); da Fonseca Manso, Luiz A.; de Resende, Leonidas C. [Department of Electrical Engineering, Federal University of Sao Joao del Rei, UFSJ (Brazil)

    2010-12-15

    This paper proposes a new methodology to solve transmission expansion planning (TEP) problems in power system, based on the metaheuristic ant colony optimisation (ACO). The TEP problem includes the search for the least cost solution, bearing in mind investment cost and reliability worth. Reliability worth is considered through the assessment of the interruption costs represented by the index LOLC - loss of load cost. The focus of this work is the development of a tool for the multi-stage planning of transmission systems and how reliability aspects can influence on the decision-making process. The applications of the proposed methodology are illustrated through case studies carried out using a test system and a real sub-transmission network. (author)

  12. Concept indexing and expansion for social multimedia websites based on semantic processing and graph analysis

    Science.gov (United States)

    Lin, Po-Chuan; Chen, Bo-Wei; Chang, Hangbae

    2016-07-01

    This study presents a human-centric technique for social video expansion based on semantic processing and graph analysis. The objective is to increase metadata of an online video and to explore related information, thereby facilitating user browsing activities. To analyze the semantic meaning of a video, shots and scenes are firstly extracted from the video on the server side. Subsequently, this study uses annotations along with ConceptNet to establish the underlying framework. Detailed metadata, including visual objects and audio events among the predefined categories, are indexed by using the proposed method. Furthermore, relevant online media associated with each category are also analyzed to enrich the existing content. With the above-mentioned information, users can easily browse and search the content according to the link analysis and its complementary knowledge. Experiments on a video dataset are conducted for evaluation. The results show that our system can achieve satisfactory performance, thereby demonstrating the feasibility of the proposed idea.

  13. Efficient and Flexible KNN Query Processing in Real-Life Road Networks

    DEFF Research Database (Denmark)

    Lu, Yang; Bui, Bin; Zhao, Jiakui

    2008-01-01

    Along with the developments of mobile services, effectively modeling road networks and efficiently indexing and querying network constrained objects has become a challenging problem. In this paper, we first introduce a road network model which captures real-life road networks better than previous...... models. Then, based on the proposed model, we propose a novel index named the RNG (Road Network Grid) index for accelerating KNN queries and continuous KNN queries over road network constrained data points. In contrast to conventional methods, speed limitations and blocking information of roads...... are included into the RNG index, which enables the index to support both distance-based and time-based KNN queries and continuous KNN queries. Our work extends previous ones by taking into account more practical scenarios, such as complexities in real-life road networks and time-based KNN queries. Extensive...

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

    Science.gov (United States)

    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%. Copyright © 2016 Elsevier B.V. All rights reserved.

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

    Science.gov (United States)

    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)

  16. Thermal expansion of Pd-based metallic glasses by ab initio methods and high energy X-ray diffraction.

    Science.gov (United States)

    Evertz, Simon; Music, Denis; Schnabel, Volker; Bednarcik, Jozef; Schneider, Jochen M

    2017-11-16

    Metallic glasses are promising structural materials due to their unique properties. For structural applications and processing the coefficient of thermal expansion is an important design parameter. Here we demonstrate that predictions of the coefficient of thermal expansion for metallic glasses by density functional theory based ab initio calculations are efficient both with respect to time and resources. The coefficient of thermal expansion is predicted by an ab initio based method utilising the Debye-Grüneisen model for a Pd-based metallic glass, which exhibits a pronounced medium range order. The predictions are critically appraised by in situ synchrotron X-ray diffraction and excellent agreement is observed. Through this combined theoretical and experimental research strategy, we show the feasibility to predict the coefficient of thermal expansion from the ground state structure of a metallic glass until the onset of structural changes. Thereby, we provide a method to efficiently probe a potentially vast number of metallic glass alloying combinations regarding thermal expansion.

  17. Secure Nearest Neighbor Query on Crowd-Sensing Data

    Directory of Open Access Journals (Sweden)

    Ke Cheng

    2016-09-01

    Full Text Available 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.

  18. Compressed Representations of Conjunctive Query Results

    OpenAIRE

    Deep, Shaleen; Koutris, Paraschos

    2017-01-01

    Relational queries, and in particular join queries, often generate large output results when executed over a huge dataset. In such cases, it is often infeasible to store the whole materialized output if we plan to reuse it further down a data processing pipeline. Motivated by this problem, we study the construction of space-efficient compressed representations of the output of conjunctive queries, with the goal of supporting the efficient access of the intermediate compressed result for a giv...

  19. jQuery Tools UI Library

    CERN Document Server

    Libby, Alex

    2012-01-01

    A practical tutorial with powerful yet simple projects that are quick to implement. This book is aimed at developers who have prior jQuery knowledge, but may not have any prior experience with jQuery Tools. It is possible that they may have started with the basics of jQuery Tools, but want to learn more about how it can be used, as well as get ideas for future projects.

  20. Flexible and Efficient Resolution of Skyline Query Size Constraints

    DEFF Research Database (Denmark)

    Lu, Hua; Jensen, Christian S.; Zhang, Zhenjie

    2011-01-01

    , the former often incurs too many ties in its ranking, and the latter is inapplicable for k>;s. Based on these observations, the paper proposes a new approach, called skyline ordering, that forms a skyline-based partitioning of a given data set such that an order exists among the partitions. Then, set......Given a set of multidimensional points, a skyline query returns the interesting points that are not dominated by other points. It has been observed that the actual cardinality (s) of a skyline query result may differ substantially from the desired result cardinality (k), which has prompted studies...

  1. Tag cloud generation for results of multiple keywords queries

    DEFF Research Database (Denmark)

    Leginus, Martin; Dolog, Peter; Lage, Ricardo Gomes

    2013-01-01

    In this paper we study tag cloud generation for retrieved results of multiple keyword queries. It is motivated by many real world scenarios such as personalization tasks, surveillance systems and information retrieval tasks defined with multiple keywords. We adjust the state-of-the-art tag cloud...... generation techniques for multiple keywords query results. Consequently, we conduct the extensive evaluation on top of three distinct collaborative tagging systems. The graph-based methods perform significantly better for the Movielens and Bibsonomy datasets. Tag cloud generation based on maximal coverage...

  2. Secure Skyline Queries on Cloud Platform.

    Science.gov (United States)

    Liu, Jinfei; Yang, Juncheng; Xiong, Li; Pei, Jian

    2017-04-01

    Outsourcing data and computation to cloud server provides a cost-effective way to support large scale data storage and query processing. However, due to security and privacy concerns, sensitive data (e.g., medical records) need to be protected from the cloud server and other unauthorized users. One approach is to outsource encrypted data to the cloud server and have the cloud server perform query processing on the encrypted data only. It remains a challenging task to support various queries over encrypted data in a secure and efficient way such that the cloud server does not gain any knowledge about the data, query, and query result. In this paper, we study the problem of secure skyline queries over encrypted data. The skyline query is particularly important for multi-criteria decision making but also presents significant challenges due to its complex computations. We propose a fully secure skyline query protocol on data encrypted using semantically-secure encryption. As a key subroutine, we present a new secure dominance protocol, which can be also used as a building block for other queries. Finally, we provide both serial and parallelized implementations and empirically study the protocols in terms of efficiency and scalability under different parameter settings, verifying the feasibility of our proposed solutions.

  3. Optimizing RDF Data Cubes for Efficient Processing of Analytical Queries

    DEFF Research Database (Denmark)

    Jakobsen, Kim Ahlstrøm; Andersen, Alex B.; Hose, Katja

    2015-01-01

    data warehouses and data cubes. Today, external data sources are essential for analytics and, as the Semantic Web gains popularity, more and more external sources are available in native RDF. With the recent SPARQL 1.1 standard, performing analytical queries over RDF data sources has finally become......In today’s data-driven world, analytical querying, typically based on the data cube concept, is the cornerstone of answering important business questions and making data-driven decisions. Traditionally, the underlying analytical data was mostly internal to the organization and stored in relational...... feasible. However, unlike their relational counterparts, RDF data cubes stores lack optimizations that enable fast querying. In this paper, we present an approach to optimizing RDF data cubes that is based on three novel cube patterns that optimize RDF data cubes, as well as associated algorithms...

  4. Biomechanical evaluation of fixation strength of conventional and expansive pedicle screws with or without calcium based cement augmentation.

    Science.gov (United States)

    Gao, Mingxuan; Lei, Wei; Wu, Zixiang; Liu, Da; Shi, Lei

    2011-03-01

    The expansive pedicle screw was originally developed to be installed in the bone of compromised quality, but there are some concerns whether it can provide enough fixation strength in the spine with osteoporosis or severe osteoporosis. Twelve fresh human cadaver spines were stratified into four levels: normal, osteopenia, osteoporosis and severe osteoporosis. The vertebra was bilaterally instrumented with pedicle screws according to four protocols, including conventional pedicle screw without augmentation, expansive pedicle screw without augmentation, conventional screw with augmentation and expansive screw with augmentation. Screw pullout tests were conducted. Given the same specimen, the fixation strength of expansive screw was significantly higher than that of the conventional screw. When the same type of screw was used, the fixation strength of the calcium based cement augmented group was stronger than that of the non-augmented group. The pullout strength and stiffness of the expansive screw, augmented conventional screw and augmented expansive screw groups at the osteoporotic level were comparable to those of the conventional pedicle screw group at the osteopenic level. However, under the severely osteoporotic bone environment, the pullout strength of pedicle screw with whatever placement protocol was significantly lower than that of the conventional screw group at the osteopenic level. Our results demonstrate that (i) the expansive pedicle screw appears feasible and safe in either osteopenic or osteoporotic spine; (ii) calcium based cement augmentation can offer improved initial fixation strength of pedicle screws.; and (iii) no screw placement protocol we examined is efficacious in the bone at the severely osteoporotic level. Copyright © 2010 Elsevier Ltd. All rights reserved.

  5. Excellent approach to modeling urban expansion by fuzzy cellular automata: agent base model

    Science.gov (United States)

    Khajavigodellou, Yousef; Alesheikh, Ali A.; Mohammed, Abdulrazak A. S.; Chapi, Kamran

    2014-09-01

    Recently, the interaction between humans and their environment is the one of important challenges in the world. Landuse/ cover change (LUCC) is a complex process that includes actors and factors at different social and spatial levels. The complexity and dynamics of urban systems make the applicable practice of urban modeling very difficult. With the increased computational power and the greater availability of spatial data, micro-simulation such as the agent based and cellular automata simulation methods, has been developed by geographers, planners, and scholars, and it has shown great potential for representing and simulating the complexity of the dynamic processes involved in urban growth and land use change. This paper presents Fuzzy Cellular Automata in Geospatial Information System and remote Sensing to simulated and predicted urban expansion pattern. These FCA-based dynamic spatial urban models provide an improved ability to forecast and assess future urban growth and to create planning scenarios, allowing us to explore the potential impacts of simulations that correspond to urban planning and management policies. A fuzzy inference guided cellular automata approach. Semantic or linguistic knowledge on Land use change is expressed as fuzzy rules, based on which fuzzy inference is applied to determine the urban development potential for each pixel. The model integrates an ABM (agent-based model) and FCA (Fuzzy Cellular Automata) to investigate a complex decision-making process and future urban dynamic processes. Based on this model rapid development and green land protection under the influences of the behaviors and decision modes of regional authority agents, real estate developer agents, resident agents and non- resident agents and their interactions have been applied to predict the future development patterns of the Erbil metropolitan region.

  6. Refrigerant flow characteristics of electronic expansion valve based on thermodynamic analysis and experiment

    International Nuclear Information System (INIS)

    Xue Zhifang; Shi Lin; Ou Hongfei

    2008-01-01

    A mass flow correlation for R134a through an EEV (electronic expansion valve) is developed from extensive experimental data. The refrigerant mass flow characteristics of the EEV are an important issue in heat pump/refrigeration system operation because the valve regulates the refrigerant flow to match various operating conditions. Based on the throttling mechanism and thermodynamic analysis, the mass flow rate is a function of various parameters. The selected decision parameters include the valve's geometric parameters, the inlet refrigerant pressure and temperature, the outlet refrigerant pressure, and the refrigerant thermophysical properties represented by the dynamic viscosity and the surface tension, which are sufficient and irredundant for determining the flow coefficient. Because these parameters have very complex and coupled effects on the mass flow characteristics, two combined non-dimensional parameters are defined to describe the coupled effects based on the influence and uncertainty analysis of parameters. The experimental results illustrate that the defined non-dimensional parameters can reveal the EEV flow characteristics correctly. Then, the semi-theoretical flow coefficient correlation with respect to the defined non-dimensional parameters is proposed and identified from several hundred sets of experimental samples using multivariable regression analysis. The proposed correlation agrees well with experimental data for R134a within a wide range of operating conditions. The investigation method in this paper can be adopted by the flow characteristics studies for other types of the EEVs and refrigerants

  7. Application of Machine Learning Algorithms for the Query Performance Prediction

    Directory of Open Access Journals (Sweden)

    MILICEVIC, M.

    2015-08-01

    Full Text Available This paper analyzes the relationship between the system load/throughput and the query response time in a real Online transaction processing (OLTP system environment. Although OLTP systems are characterized by short transactions, which normally entail high availability and consistent short response times, the need for operational reporting may jeopardize these objectives. We suggest a new approach to performance prediction for concurrent database workloads, based on the system state vector which consists of 36 attributes. There is no bias to the importance of certain attributes, but the machine learning methods are used to determine which attributes better describe the behavior of the particular database server and how to model that system. During the learning phase, the system's profile is created using multiple reference queries, which are selected to represent frequent business processes. The possibility of the accurate response time prediction may be a foundation for automated decision-making for database (DB query scheduling. Possible applications of the proposed method include adaptive resource allocation, quality of service (QoS management or real-time dynamic query scheduling (e.g. estimation of the optimal moment for a complex query execution.

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

    Science.gov (United States)

    Liu, Yang; Li, Fan; Wang, Yu

    2016-07-21

    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.

  9. An hybrid method for the Arabic queries disambiguation to improve the relevance calculation in the IRS

    OpenAIRE

    Adil ENAANAI, Aziz SDIGUI DOUKKALI, El habib BENLAHMER

    2012-01-01

    In the information systems, the query’s expansion brings more benefices in the relevant documents extraction. However, the current expansion types are focused on the retrieve of the maximum of documents (reduce the silence). In Arabic, the queries are derived in many morphosemantical variants. Hence the diversity of the semantic interpretations that often creates a problem of ambiguity. Our objective is to prepare the Arabic request before its introduction to the document retrieval system. Th...

  10. Accelerating SPARQL Queries and Analytics on RDF Data

    KAUST Repository

    Al-Harbi, Razen

    2016-11-09

    The complexity of SPARQL queries and RDF applications poses great challenges on distributed RDF management systems. SPARQL workloads are dynamic and con- sist of queries with variable complexities. Hence, systems that use static partitioning su↵er from communication overhead for workloads that generate excessive communi- cation. Concurrently, RDF applications are becoming more sophisticated, mandating analytical operations that extend beyond SPARQL queries. Being primarily designed and optimized to execute SPARQL queries, which lack procedural capabilities, exist- ing systems are not suitable for rich RDF analytics. This dissertation tackles the problem of accelerating SPARQL queries and RDF analytics on distributed shared-nothing RDF systems. First, a distributed RDF en- gine, coined AdPart, is introduced. AdPart uses lightweight hash partitioning for sharding triples using their subject values; rendering its startup overhead very low. The locality-aware query optimizer of AdPart takes full advantage of the partition- ing to (i) support the fully parallel processing of join patterns on subjects and (ii) minimize data communication for general queries by applying hash distribution of intermediate results instead of broadcasting, wherever possible. By exploiting hash- based locality, AdPart achieves better or comparable performance to systems that employ sophisticated partitioning schemes. To cope with workloads dynamism, AdPart is extended to dynamically adapt to workload changes. AdPart monitors the data access patterns and dynamically redis- tributes and replicates the instances of the most frequent patterns among workers.Consequently, the communication cost for future queries is drastically reduced or even eliminated. Experiments with synthetic and real data verify that AdPart starts faster than all existing systems and gracefully adapts to the query load. Finally, to support and accelerate rich RDF analytical tasks, a vertex-centric RDF analytics framework is

  11. Extending OLAP Querying to External Object

    DEFF Research Database (Denmark)

    Pedersen, Torben Bach; Shoshani, Arie; Gu, Junmin

    On-Line Analytical Processing (OLAP) systems based on a dimensional view of data have found widespread use in business applications and are being used increasingly in non-standard applications. These systems provide good performance and ease-of-use. However, the complex structures and relationships...... inherent in data in nonstandard applications are not accommodated well by OLAP systems. In contrast, object database systems are built to handle such complexity, but do not support OLAP-type querying well. This paper presents the concepts and techniques underlying a flexible, multi-model federated system...... that enables OLAP users to exploit simultaneously the features of OLAP and object systems. The system allows data to be handled using the most appropriate data model and technology: OLAP systems for dimensional data and object database systems for more complex, general data. Additionally, physical data...

  12. GeoSpark SQL: An Effective Framework Enabling Spatial Queries on Spark

    Directory of Open Access Journals (Sweden)

    Zhou Huang

    2017-09-01

    Full Text Available In the era of big data, Internet-based geospatial information services such as various LBS apps are deployed everywhere, followed by an increasing number of queries against the massive spatial data. As a result, the traditional relational spatial database (e.g., PostgreSQL with PostGIS and Oracle Spatial cannot adapt well to the needs of large-scale spatial query processing. Spark is an emerging outstanding distributed computing framework in the Hadoop ecosystem. This paper aims to address the increasingly large-scale spatial query-processing requirement in the era of big data, and proposes an effective framework GeoSpark SQL, which enables spatial queries on Spark. On the one hand, GeoSpark SQL provides a convenient SQL interface; on the other hand, GeoSpark SQL achieves both efficient storage management and high-performance parallel computing through integrating Hive and Spark. In this study, the following key issues are discussed and addressed: (1 storage management methods under the GeoSpark SQL framework, (2 the spatial operator implementation approach in the Spark environment, and (3 spatial query optimization methods under Spark. Experimental evaluation is also performed and the results show that GeoSpark SQL is able to achieve real-time query processing. It should be noted that Spark is not a panacea. It is observed that the traditional spatial database PostGIS/PostgreSQL performs better than GeoSpark SQL in some query scenarios, especially for the spatial queries with high selectivity, such as the point query and the window query. In general, GeoSpark SQL performs better when dealing with compute-intensive spatial queries such as the kNN query and the spatial join query.

  13. Lazy Toggle PRM: A single-query approach to motion planning

    KAUST Repository

    Denny, Jory

    2013-05-01

    Probabilistic RoadMaps (PRMs) are quite suc-cessful in solving complex and high-dimensional motion plan-ning problems. While particularly suited for multiple-query scenarios and expansive spaces, they lack efficiency in both solving single-query scenarios and mapping narrow spaces. Two PRM variants separately tackle these gaps. Lazy PRM reduces the computational cost of roadmap construction for single-query scenarios by delaying roadmap validation until query time. Toggle PRM is well suited for mapping narrow spaces by mapping both Cfree and Cobst, which gives certain theoretical benefits. However, fully validating the two resulting roadmaps can be costly. We present a strategy, Lazy Toggle PRM, for integrating these two approaches into a method which is both suited for narrow passages and efficient single-query calculations. This simultaneously addresses two challenges of PRMs. Like Lazy PRM, Lazy Toggle PRM delays validation of roadmaps until query time, but if no path is found, the algorithm augments the roadmap using the Toggle PRM methodology. We demonstrate the effectiveness of Lazy Toggle PRM in a wide range of scenarios, including those with narrow passages and high descriptive complexity (e.g., those described by many triangles), concluding that it is more effective than existing methods in solving difficult queries. © 2013 IEEE.

  14. An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries

    DEFF Research Database (Denmark)

    Agarwal, Pankaj K.; Arge, Lars; Kaplan, Haim

    2012-01-01

    {R}$, the stabbing-semigroup query asks for computing $\\sum_{s \\in S(q)} \\omega(s)$. We propose a linear-size dynamic data structure, under the pointer-machine model, that answers queries in worst-case $O(\\log n)$ time and supports both insertions and deletions of intervals in amortized $O(\\log n)$ time....... It is the first data structure that attains the optimal $O(\\log n)$ bound for all three operations. Furthermore, our structure can easily be adapted to external memory, where we obtain a linear-size structure that answers queries and supports updates in $O(\\log_B n)$ I/Os, where B is the disk block size....... For the restricted case of a nested family of intervals (either every pair of intervals is disjoint or one contains the other), we present a simpler solution based on dynamic trees...

  15. A general approach to query flattening

    NARCIS (Netherlands)

    van Ruth, J.

    The translation of queries from complex data models to simpler data models is a recurring theme in the construction of efficient data management systems. In this paper we propose a general framework to guide the translation from data models with nested types to a flat relational model (query

  16. The Data Cyclotron query processing scheme

    NARCIS (Netherlands)

    Goncalves, R.; Kersten, M.

    2011-01-01

    A grand challenge of distributed query processing is to devise a self-organizing architecture which exploits all hardware resources optimally to manage the database hot set, minimize query response time, and maximize throughput without single point global coordination. The Data Cyclotron

  17. The Data Cyclotron query processing scheme.

    NARCIS (Netherlands)

    R.A. Goncalves (Romulo); M.L. Kersten (Martin)

    2011-01-01

    htmlabstractA grand challenge of distributed query processing is to devise a self-organizing architecture which exploits all hardware resources optimally to manage the database hot set, minimize query response time, and maximize throughput without single point global coordination. The Data Cyclotron

  18. Instant jQuery Flot visual data analysis

    CERN Document Server

    Peiris, Brian

    2013-01-01

    Filled with practical, step-by-step instructions and clear explanations for the most important and useful tasks. A quick, instruction-based guide full of examples that details on the various aspects of Flot and how users can apply it to data groups for interactive data representation techniques.If you are a data visualization developer, mapping and presentation software developer, or anyone with an interest in jQuery visualization, this book is ideal for you. If you have a working knowledge of jQuery and JavaScript, you can use this book to add sophisticated visualizations to your web applicat

  19. SM4MQ: A Semantic Model for Multidimensional Queries

    DEFF Research Database (Denmark)

    Varga, Jovan; Dobrokhotova, Ekaterina; Romero, Oscar

    2017-01-01

    metadata artifacts (e.g., queries) to assist users with the analysis. However, modeling and sharing of most of these artifacts are typically overlooked. Thus, in this paper we focus on the query metadata artifact in the Exploratory OLAP context and propose an RDF-based vocabulary for its representation......On-Line Analytical Processing (OLAP) is a data analysis approach to support decision-making. On top of that, Exploratory OLAP is a novel initiative for the convergence of OLAP and the Semantic Web (SW) that enables the use of OLAP techniques on SW data. Moreover, OLAP approaches exploit different...

  20. New environmental policy instruments to realize forest expansion in Flanders (northern Belgium): A base for smart regulation?

    NARCIS (Netherlands)

    Gossum, Van P.; Ledene, L.; Arts, B.J.M.; Vreese, De R.; Langenhove, Van G.; Verheyen, K.

    2009-01-01

    This paper evaluates the current instrument mix, designs options for smart regulation and estimates the support base of new instruments for the forest expansion policy in Flanders (northern Belgium). The framework applied is a combination of theories on instrument choice (ICT), policy transfer and

  1. An analytical method based on multipole moment expansion to calculate the flux distribution in Gammacell-220

    Science.gov (United States)

    Rezaeian, P.; Ataenia, V.; Shafiei, S.

    2017-12-01

    In this paper, the flux of photons inside the irradiation cell of the Gammacell-220 is calculated using an analytical method based on multipole moment expansion. The flux of the photons inside the irradiation cell is introduced as the function of monopole, dipoles and quadruples in the Cartesian coordinate system. For the source distribution of the Gammacell-220, the values of the multipole moments are specified by direct integrating. To confirm the validation of the presented methods, the flux distribution inside the irradiation cell was determined utilizing MCNP simulations as well as experimental measurements. To measure the flux inside the irradiation cell, Amber dosimeters were employed. The calculated values of the flux were in agreement with the values obtained by simulations and measurements, especially in the central zones of the irradiation cell. In order to show that the present method is a good approximation to determine the flux in the irradiation cell, the values of the multipole moments were obtained by fitting the simulation and experimental data using Levenberg-Marquardt algorithm. The present method leads to reasonable results for the all source distribution even without any symmetry which makes it a powerful tool for the source load planning.

  2. Study on Electricity Business Expansion and Electricity Sales Based on Seasonal Adjustment

    Science.gov (United States)

    Zhang, Yumin; Han, Xueshan; Wang, Yong; Zhang, Li; Yang, Guangsen; Sun, Donglei; Wang, Bolun

    2017-05-01

    [1] proposed a novel analysis and forecast method of electricity business expansion based on Seasonal Adjustment, we extend this work to include the effect the micro and macro aspects, respectively. From micro aspect, we introduce the concept of load factor to forecast the stable value of electricity consumption of single new consumer after the installation of new capacity of the high-voltage transformer. From macro aspects, considering the growth of business expanding is also stimulated by the growth of electricity sales, it is necessary to analyse the antecedent relationship between business expanding and electricity sales. First, forecast electricity consumption of customer group and release rules of expanding capacity, respectively. Second, contrast the degree of fitting and prediction accuracy to find out the antecedence relationship and analyse the reason. Also, it can be used as a contrast to observe the influence of customer group in different ranges on the prediction precision. Finally, Simulation results indicate that the proposed method is accurate to help determine the value of expanding capacity and electricity consumption.

  3. Accelerating Atomic Orbital-based Electronic Structure Calculation via Pole Expansion plus Selected Inversion

    Energy Technology Data Exchange (ETDEWEB)

    Lin, Lin; Chen, Mohan; Yang, Chao; He, Lixin

    2012-02-10

    We describe how to apply the recently developed pole expansion plus selected inversion (PEpSI) technique to Kohn-Sham density function theory (DFT) electronic structure calculations that are based on atomic orbital discretization. We give analytic expressions for evaluating charge density, total energy, Helmholtz free energy and atomic forces without using the eigenvalues and eigenvectors of the Kohn-Sham Hamiltonian. We also show how to update the chemical potential without using Kohn-Sham eigenvalues. The advantage of using PEpSI is that it has a much lower computational complexity than that associated with the matrix diagonalization procedure. We demonstrate the performance gain by comparing the timing of PEpSI with that of diagonalization on insulating and metallic nanotubes. For these quasi-1D systems, the complexity of PEpSI is linear with respect to the number of atoms. This linear scaling can be observed in our computational experiments when the number of atoms in a nanotube is larger than a few hundreds. Both the wall clock time and the memory requirement of PEpSI is modest. This makes it even possible to perform Kohn-Sham DFT calculations for 10,000-atom nanotubes on a single processor. We also show that the use of PEpSI does not lead to loss of accuracy required in a practical DFT calculation.

  4. 8760-Based Method for Representing Variable Generation Capacity Value in Capacity Expansion Models

    Energy Technology Data Exchange (ETDEWEB)

    Frew, Bethany A [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

    2017-08-03

    Capacity expansion models (CEMs) are widely used to evaluate the least-cost portfolio of electricity generators, transmission, and storage needed to reliably serve load over many years or decades. CEMs can be computationally complex and are often forced to estimate key parameters using simplified methods to achieve acceptable solve times or for other reasons. In this paper, we discuss one of these parameters -- capacity value (CV). We first provide a high-level motivation for and overview of CV. We next describe existing modeling simplifications and an alternate approach for estimating CV that utilizes hourly '8760' data of load and VG resources. We then apply this 8760 method to an established CEM, the National Renewable Energy Laboratory's (NREL's) Regional Energy Deployment System (ReEDS) model (Eurek et al. 2016). While this alternative approach for CV is not itself novel, it contributes to the broader CEM community by (1) demonstrating how a simplified 8760 hourly method, which can be easily implemented in other power sector models when data is available, more accurately captures CV trends than a statistical method within the ReEDS CEM, and (2) providing a flexible modeling framework from which other 8760-based system elements (e.g., demand response, storage, and transmission) can be added to further capture important dynamic interactions, such as curtailment.

  5. Eco-trench: a novel trench solution based on reusing excavated material and a finishing layer of expansive concrete

    Directory of Open Access Journals (Sweden)

    A. Blanco

    2017-09-01

    Full Text Available Installing utility pipelines generates a significant amount of trench arisings, which are usually transported to landfills instead of being reused as backfill material. This practice generates CO2 emissions and wastes raw materials. This paper presents a more sustainable solution, an eco-trench, which is based on re-using trench arisings as backfill and adding a top layer of expansive concrete to improve the eco-trench’s structural performance. The technical feasibility of the eco-trench was evaluated through a finite element model, which identified the degree of expansion in concrete required to avoid failure or subside the stresses caused by traffic. The potential expansion of concrete was measured under confined conditions in the laboratory by means of a novel test developed for this purpose. The results showed that adding calcium oxide generates the required internal stress. The results were then confirmed in a pilot experience.

  6. jQuery UI 1.7 the user interface library for jQuery

    CERN Document Server

    Wellman, Dan

    2009-01-01

    An example-based approach leads you step-by-step through the implementation and customization of each library component and its associated resources in turn. To emphasize the way that jQuery UI takes the difficulty out of user interface design and implementation, each chapter ends with a 'fun with' section that puts together what you've learned throughout the chapter to make a usable and fun page. In these sections you'll often get to experiment with the latest associated technologies like AJAX and JSON. This book is for front-end designers and developers who need to quickly learn how to use t

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

    Science.gov (United States)

    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. A NOVEL APPROACH OF INDEXING AND RETRIEVING SPATIAL POLYGONS FOR EFFICIENT SPATIAL REGION QUERIES

    Directory of Open Access Journals (Sweden)

    J. H. Zhao

    2017-10-01

    Full Text Available Spatial region queries are more and more widely used in web-based applications. Mechanisms to provide efficient query processing over geospatial data are essential. However, due to the massive geospatial data volume, heavy geometric computation, and high access concurrency, it is difficult to get response in real time. Spatial indexes are usually used in this situation. In this paper, based on k-d tree, we introduce a distributed KD-Tree (DKD-Tree suitbable for polygon data, and a two-step query algorithm. The spatial index construction is recursive and iterative, and the query is an in memory process. Both the index and query methods can be processed in parallel, and are implemented based on HDFS, Spark and Redis. Experiments on a large volume of Remote Sensing images metadata have been carried out, and the advantages of our method are investigated by comparing with spatial region queries executed on PostgreSQL and PostGIS. Results show that our approach not only greatly improves the efficiency of spatial region query, but also has good scalability, Moreover, the two-step spatial range query algorithm can also save cluster resources to support a large number of concurrent queries. Therefore, this method is very useful when building large geographic information systems.

  9. a Novel Approach of Indexing and Retrieving Spatial Polygons for Efficient Spatial Region Queries

    Science.gov (United States)

    Zhao, J. H.; Wang, X. Z.; Wang, F. Y.; Shen, Z. H.; Zhou, Y. C.; Wang, Y. L.

    2017-10-01

    Spatial region queries are more and more widely used in web-based applications. Mechanisms to provide efficient query processing over geospatial data are essential. However, due to the massive geospatial data volume, heavy geometric computation, and high access concurrency, it is difficult to get response in real time. Spatial indexes are usually used in this situation. In this paper, based on k-d tree, we introduce a distributed KD-Tree (DKD-Tree) suitbable for polygon data, and a two-step query algorithm. The spatial index construction is recursive and iterative, and the query is an in memory process. Both the index and query methods can be processed in parallel, and are implemented based on HDFS, Spark and Redis. Experiments on a large volume of Remote Sensing images metadata have been carried out, and the advantages of our method are investigated by comparing with spatial region queries executed on PostgreSQL and PostGIS. Results show that our approach not only greatly improves the efficiency of spatial region query, but also has good scalability, Moreover, the two-step spatial range query algorithm can also save cluster resources to support a large number of concurrent queries. Therefore, this method is very useful when building large geographic information systems.

  10. Towards Optimal Multi-Dimensional Query Processing with BitmapIndices

    Energy Technology Data Exchange (ETDEWEB)

    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. Energy and entropy analysis of closed adiabatic expansion based trilateral cycles

    International Nuclear Information System (INIS)

    Garcia, Ramon Ferreiro; Carril, Jose Carbia; Gomez, Javier Romero; Gomez, Manuel Romero

    2016-01-01

    Highlights: • The adiabatic expansion based TC surpass Carnot factor at low temperatures. • The fact of surpassing Carnot factor doesn’t violate the 2nd law. • An entropy analysis is applied to verify the fulfilment of the second law. • Correction of the exergy transfer associated with heat transferred to a cycle. - Abstract: A vast amount of heat energy is available at low cost within the range of medium and low temperatures. Existing thermal cycles cannot make efficient use of such available low grade heat because they are mainly based on conventional organic Rankine cycles which are limited by Carnot constraints. However, recent developments related to the performance of thermal cycles composed of closed processes have led to the exceeding of the Carnot factor. Consequently, once the viability of closed process based thermal cycles that surpass the Carnot factor operating at low and medium temperatures is globally accepted, research work will aim at looking into the consequences that lead from surpassing the Carnot factor while fulfilling the 2nd law, its impact on the 2nd law efficiency definition as well as the impact on the exergy transfer from thermal power sources to any heat consumer, including thermal cycles. The methodology used to meet the proposed objectives involves the analysis of energy and entropy on trilateral closed process based thermal cycles. Thus, such energy and entropy analysis is carried out upon non-condensing mode trilateral thermal cycles (TCs) characterised by the conversion of low grade heat into mechanical work undergoing closed adiabatic path functions: isochoric heat absorption, adiabatic heat to mechanical work conversion and isobaric heat rejection. Firstly, cycle energy analysis is performed to determine the range of some relevant cycle parameters, such as the operating temperatures and their associated pressures, entropies, internal energies and specific volumes. In this way, the ranges of temperatures within which

  12. From Nested-Loop to Join Queries in OODB

    NARCIS (Netherlands)

    Steenhagen, H.J.; Steenhagen, H.J.; Apers, Peter M.G.; Blanken, Henk; de By, R.A.

    Most declarative SQL-like query languages for object-oriented database systems are orthogonal languages allowing for arbitrary nesting of expressions in the select-, from-, and where-clause. Expressions in the from-clause may be base tables as well as set-valued attributes. In this paper, we propose

  13. Extracting Rankings for Spatial Keyword Queries from GPS Data

    DEFF Research Database (Denmark)

    Keles, Ilkcan; Jensen, Christian Søndergaard; Saltenis, Simonas

    2018-01-01

    a model that synthesizes a ranking of points of interest (PoI) for a given query using historical trips extracted from GPS data. To extract trips, we propose a novel PoI assignment method that makes use of distances and temporal information. We also propose a PageRank-based smoothing method to be able...

  14. Learning from the History of Distributed Query Processing

    DEFF Research Database (Denmark)

    Betz, Heiko; Gropengießer, Francis; Hose, Katja

    2012-01-01

    The vision of the Semantic Web has triggered the development of various new applications and opened up new directions in research. Recently, much effort has been put into the development of techniques for query processing over Linked Data. Being based upon techniques originally developed for dist...

  15. Multidimensional Data Model and Query Language for Informetrics.

    Science.gov (United States)

    Niemi, Timo; Hirvonen, Lasse; Jarvelin, Kalervo

    2003-01-01

    Discusses multidimensional data analysis, or online analytical processing (OLAP), which offer a single subject-oriented source for analyzing summary data based on various dimensions. Develops a conceptual/logical multidimensional model for supporting the needs of informetrics, including a multidimensional query language whose basic idea is to…

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

    Science.gov (United States)

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

    2014-01-01

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

  17. Generic multiset programming for language-integrated querying

    DEFF Research Database (Denmark)

    Henglein, Fritz; Larsen, Ken Friis

    2010-01-01

    This paper demonstrates how relational algebraic programming based on efficient symbolic representations of multisets and operations on them can be applied to the query sublanguage of SQL in a type-safe fashion. In essence, it provides a library for naïve programming with multisets in a generalized...

  18. ConnectomeExplorer: Query-guided visual analysis of large volumetric neuroscience data

    KAUST Repository

    Beyer, Johanna

    2013-12-01

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

  19. Neoglacial ice expansion and late Holocene cold-based ice cap dynamics on Cumberland Peninsula, Baffin Island, Arctic Canada

    Science.gov (United States)

    Margreth, Annina; Dyke, Arthur S.; Gosse, John C.; Telka, Alice M.

    2014-05-01

    Radiocarbon dating of fossil flora and fauna collected along receding cold-based ice caps and cold-based sections of polythermal glaciers on Cumberland Peninsula reveal insights into Neoglacial ice expansion and late Holocene ice dynamics. The taphonomic advantages of subfossilized moss were exploited to precisely document regional expansions of ice caps through the late Holocene. When compared with climate proxies and records of volcanic eruptions, the moss radiocarbon age distributions indicate i) onset of Neoglaciation shortly after 5 ka, concomitant with increased sea ice cover, ii) intensification of ice expansion between 1.9 and 1.1 ka, followed by halt of ice growth, or ice recession during the Medieval Warm Period, and iii) renewed ice expansion after 0.8 ka, in response to cooling related to a combination of large volcanic eruptions and low solar activity. Overall, the observations support a model of near-instantaneous glacial response to regional climate controls and that these responses were synchronous throughout eastern Canadian Arctic and possibly eastern Greenland.

  20. The impact of green logistics-based activities on the sustainable monetary expansion indicators of Oman

    International Nuclear Information System (INIS)

    Alshubiri, Faris

    2017-01-01

    The purpose of this study is to examine green logistic activities by three axes (financial economic, social and environment activities) and how these activities affect on sustainable monetary expansion indicators as an evidence of Sultanate of Oman. Design/methodology/approach: This study began by definition elements of logistic green and how evolution of this concept in recent years. This concept analyzed after survey of previous studies on green logistic. The independent variables of green logistic are includes of three components of financial economic , social and environment and applies these components to clarify the impact on expansionary monetary policy indicators ( broad , narrow and reserve money ) as a important signals in determining a country's economy. This study used data published in statistical annual report of central bank of Oman as representative of country economic of sultanate of Oman from the period 2008 to 2015. Findings: The results found two variables of government support to electricity sector (GSE) and subsidy on soft loans to private sector and housing (SSLPH) based on environment activities are statistical significant 1% and 5%. Only one variable of transport and communication (TC) in financial economic activates is statistical significant at 1% and 5% , but all variables community, social and personal (CSP) , cultural and religious affairs (CRA) and social security and welfare (SSW) in social activities are statistical significant at 1% 5% and 10% , finally , also the multiple regression test run of all variables of green logistics activities and each monetary expansion indicators and found there are a statistical significant at 1% and 5%, .The study recommends that should be attention with financial economic activities as a quantitative standard contributes to build the green logistic by diagnosed the priorities and existing economic and financial system that contributes of sustainable development system in the country

  1. The impact of green logistics-based activities on the sustainable monetary expansion indicators of Oman

    Energy Technology Data Exchange (ETDEWEB)

    Alshubiri, Faris

    2017-07-01

    The purpose of this study is to examine green logistic activities by three axes (financial economic, social and environment activities) and how these activities affect on sustainable monetary expansion indicators as an evidence of Sultanate of Oman. Design/methodology/approach: This study began by definition elements of logistic green and how evolution of this concept in recent years. This concept analyzed after survey of previous studies on green logistic. The independent variables of green logistic are includes of three components of financial economic , social and environment and applies these components to clarify the impact on expansionary monetary policy indicators ( broad , narrow and reserve money ) as a important signals in determining a country's economy. This study used data published in statistical annual report of central bank of Oman as representative of country economic of sultanate of Oman from the period 2008 to 2015. Findings: The results found two variables of government support to electricity sector (GSE) and subsidy on soft loans to private sector and housing (SSLPH) based on environment activities are statistical significant 1% and 5%. Only one variable of transport and communication (TC) in financial economic activates is statistical significant at 1% and 5% , but all variables community, social and personal (CSP) , cultural and religious affairs (CRA) and social security and welfare (SSW) in social activities are statistical significant at 1% 5% and 10% , finally , also the multiple regression test run of all variables of green logistics activities and each monetary expansion indicators and found there are a statistical significant at 1% and 5%, .The study recommends that should be attention with financial economic activities as a quantitative standard contributes to build the green logistic by diagnosed the priorities and existing economic and financial system that contributes of sustainable development system in the country

  2. Dynein-Based Accumulation of Membranes Regulates Nuclear Expansion in Xenopus laevis Egg Extracts.

    Science.gov (United States)

    Hara, Yuki; Merten, Christoph A

    2015-06-08

    Nuclear size changes dynamically during development and has long been observed to correlate with the space surrounding the nucleus, as well as with the volume of the cell. Here we combine an in vitro cell-free system of Xenopus laevis egg extract with microfluidic devices to systematically analyze the effect of spatial constraints. The speed of nuclear expansion depended on the available space surrounding the nucleus up to a threshold volume in the nanoliter range, herein referred to as the nuclear domain. Under spatial constraints smaller than this nuclear domain, the size of microtubule-occupied space surrounding the nucleus turned out to be limiting for the accumulation of membranes around the nucleus via the motor protein dynein, therefore determining the speed of nuclear expansion. This mechanism explains how spatial information surrounding the nucleus, such as the positioning of the nucleus inside the cell, can control nuclear expansion. Copyright © 2015 Elsevier Inc. All rights reserved.

  3. Stochastic-based resource expansion planning for a grid-connected microgrid using interval linear programming

    International Nuclear Information System (INIS)

    Shaban Boloukat, Mohammad Hadi; Akbari Foroud, Asghar

    2016-01-01

    This paper represents a stochastic approach for long-term optimal resource expansion planning of a grid-connected microgrid (MG) containing different technologies as intermittent renewable energy resources, energy storage systems and thermal resources. Maximizing profit and reliability, along with minimizing investment and operation costs, are major objectives which have been considered in this model. Also, the impacts of intermittency and uncertainty in renewable energy resources were investigated. The interval linear programming (ILP) was applied for modelling inherent stochastic nature of the renewable energy resources. ILP presents some superiority in modelling of uncertainties in MG planning. The problem was formulated as a mixed-integer linear programming. It has been demonstrated previously that the benders decomposition (BD) served as an effective tool for solving such problems. BD divides the original problem into a master (investment) problem and operation and reliability subproblems. In this paper a multiperiod MG planning is presented, considering life time, maximum penetration limit of each technology, interest rate, capital recovery factor and investment fund. Real-time energy exchange with the utility is covered, with a consideration of variable tariffs at different load blocks. The presented approach can help MG planners to adopt best decision under various uncertainty levels based on their budgetary policies. - Highlights: • Considering uncertain nature of the renewable resources with applying ILP. • Considering the effect of intermittency of renewable in MG planning. • Multiobjective MG planning problem which covers cost, profit and reliability. • Multiperiod approach for MG planning considering life time and MPL of technologies. • Presenting real-time energy exchange with the utility considering variable tariffs.

  4. 8760-Based Method for Representing Variable Generation Capacity Value in Capacity Expansion Models: Preprint

    Energy Technology Data Exchange (ETDEWEB)

    Frew, Bethany A [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Cole, Wesley J [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Sun, Yinong [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Mai, Trieu T [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Richards, James [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

    2017-08-01

    Capacity expansion models (CEMs) are widely used to evaluate the least-cost portfolio of electricity generators, transmission, and storage needed to reliably serve demand over the evolution of many years or decades. Various CEM formulations are used to evaluate systems ranging in scale from states or utility service territories to national or multi-national systems. CEMs can be computationally complex, and to achieve acceptable solve times, key parameters are often estimated using simplified methods. In this paper, we focus on two of these key parameters associated with the integration of variable generation (VG) resources: capacity value and curtailment. We first discuss common modeling simplifications used in CEMs to estimate capacity value and curtailment, many of which are based on a representative subset of hours that can miss important tail events or which require assumptions about the load and resource distributions that may not match actual distributions. We then present an alternate approach that captures key elements of chronological operation over all hours of the year without the computationally intensive economic dispatch optimization typically employed within more detailed operational models. The updated methodology characterizes the (1) contribution of VG to system capacity during high load and net load hours, (2) the curtailment level of VG, and (3) the potential reductions in curtailments enabled through deployment of storage and more flexible operation of select thermal generators. We apply this alternate methodology to an existing CEM, the Regional Energy Deployment System (ReEDS). Results demonstrate that this alternate approach provides more accurate estimates of capacity value and curtailments by explicitly capturing system interactions across all hours of the year. This approach could be applied more broadly to CEMs at many different scales where hourly resource and load data is available, greatly improving the representation of challenges

  5. Obstacle Detection and Avoidance System Based on Monocular Camera and Size Expansion Algorithm for UAVs.

    Science.gov (United States)

    Al-Kaff, Abdulla; García, Fernando; Martín, David; De La Escalera, Arturo; Armingol, José María

    2017-05-07

    One of the most challenging problems in the domain of autonomous aerial vehicles is the designing of a robust real-time obstacle detection and avoidance system. This problem is complex, especially for the micro and small aerial vehicles, that is due to the Size, Weight and Power (SWaP) constraints. Therefore, using lightweight sensors (i.e., Digital camera) can be the best choice comparing with other sensors; such as laser or radar.For real-time applications, different works are based on stereo cameras in order to obtain a 3D model of the obstacles, or to estimate their depth. Instead, in this paper, a method that mimics the human behavior of detecting the collision state of the approaching obstacles using monocular camera is proposed. The key of the proposed algorithm is to analyze the size changes of the detected feature points, combined with the expansion ratios of the convex hull constructed around the detected feature points from consecutive frames. During the Aerial Vehicle (UAV) motion, the detection algorithm estimates the changes in the size of the area of the approaching obstacles. First, the method detects the feature points of the obstacles, then extracts the obstacles that have the probability of getting close toward the UAV. Secondly, by comparing the area ratio of the obstacle and the position of the UAV, the method decides if the detected obstacle may cause a collision. Finally, by estimating the obstacle 2D position in the image and combining with the tracked waypoints, the UAV performs the avoidance maneuver. The proposed algorithm was evaluated by performing real indoor and outdoor flights, and the obtained results show the accuracy of the proposed algorithm compared with other related works.

  6. Experimental quantum private queries with linear optics

    International Nuclear Information System (INIS)

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

    2009-01-01

    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.

  7. Instant MDX queries for SQL Server 2012

    CERN Document Server

    Emond, Nicholas

    2013-01-01

    Get to grips with a new technology, understand what it is and what it can do for you, and then get to work with the most important features and tasks. This short, focused guide is a great way to get stated with writing MDX queries. New developers can use this book as a reference for how to use functions and the syntax of a query as well as how to use Calculated Members and Named Sets.This book is great for new developers who want to learn the MDX query language from scratch and install SQL Server 2012 with Analysis Services

  8. Federated query processing for the semantic web

    CERN Document Server

    Buil-Aranda, C

    2014-01-01

    During the last years, the amount of RDF data has increased exponentially over the Web, exposed via SPARQL endpoints. These SPARQL endpoints allow users to direct SPARQL queries to the RDF data. Federated SPARQL query processing allows to query several of these RDF databases as if they were a single one, integrating the results from all of them. This is a key concept in the Web of Data and it is also a hot topic in the community. Besides of that, the W3C SPARQL-WG has standardized it in the new Recommendation SPARQL 1.1.This book provides a formalisation of the W3C proposed recommendation. Thi

  9. Cooperative Scalable Moving Continuous Query Processing

    DEFF Research Database (Denmark)

    Li, Xiaohui; Karras, Panagiotis; Jensen, Christian S.

    2012-01-01

    A range of applications call for a mobile client to continuously monitor others in close proximity. Past research on such problems has covered two extremes: It has offered totally centralized solutions, where a server takes care of all queries, and totally distributed solutions, in which...... there is no central authority at all. Unfortunately, none of these two solutions scales to intensive moving object tracking applications, where each client poses a query. In this paper, we formulate the moving continuous query (MCQ) problem and propose a balanced model where servers cooperatively take care...... and computation cost for both servers and clients. An experimental study demonstrates that our approaches offer better scalability than competitors...

  10. Query transformations and their role in Web searching by the members of the general public

    Directory of Open Access Journals (Sweden)

    Martin Whittle

    2006-01-01

    Full Text Available Introduction. This paper reports preliminary research in a primarily experimental study of how the general public search for information on the Web. The focus is on the query transformation patterns that characterise searching. Method. In this work, we have used transaction logs from the Excite search engine to develop methods for analysing query transformations that should aid the analysis of our ongoing experimental work. Our methods involve the use of similarity techniques to link queries with the most similar previous query in a train. The resulting query transformations are represented as a list of codes representing a whole search. Analysis. It is shown how query transformation sequences can be represented as graphical networks and some basic statistical results are shown. A correlation analysis is performed to examine the co-occurrence of Boolean and quotation mark changes with the syntactic changes. Results. A frequency analysis of the occurrence of query transformation codes is presented. The connectivity of graphs obtained from the query transformation is investigated and found to follow an exponential scaling law. The correlation analysis reveals a number of patterns that provide some interesting insights into Web searching by the general public. Conclusion. We have developed analytical methods based on query similarity that can be applied to our current experimental work with volunteer subjects. The results of these will form part of a database with the aim of developing an improved understanding of how the public search the Web.

  11. Bimetallic low thermal-expansion panels of Co-base and silicide-coated Nb-base alloys for high-temperature structural applications

    International Nuclear Information System (INIS)

    Rhein, R.K.; Novak, M.D.; Levi, C.G.; Pollock, T.M.

    2011-01-01

    Research highlights: → Low net thermal expansion bimetallic structural lattice constructed. → Temperatures on the order of 1000 deg. C reached. → Improved silicide coating for niobium alloy developed. - Abstract: The fabrication and high temperature performance of low thermal expansion bimetallic lattices composed of Co-base and Nb-base alloys have been investigated. A 2D sheet lattice with a coefficient of thermal expansion (CTE) lower than the constituent materials of construction was designed for thermal cycling to 1000 deg. C with the use of elastic-plastic finite element analyses. The low CTE lattice consisted of a continuous network of the Nb-base alloy C-103 with inserts of high CTE Co-base alloy Haynes 188. A new coating approach wherein submicron alumina particles were incorporated into (Nb, Cr, Fe) silicide coatings was employed for oxidation protection of the Nb-base alloy. Thermal gravimetric analysis results indicate that the addition of submicron alumina particles reduced the oxidative mass gain by a factor of four during thermal cycling, increasing lifetime. Bimetallic cells with net expansion of 6 x 10 -6 /deg. C and 1 x 10 -6 /deg. C at 1000 deg. C were demonstrated and their measured thermal expansion characteristics were consistent with analytical models and finite element analysis predictions.

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

    Science.gov (United States)

    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.

  13. Practical querying of temporal data via OWL 2 QL and SQL: 2011

    CSIR Research Space (South Africa)

    Klarman, S

    2013-12-01

    Full Text Available We develop a practical approach to querying temporal data stored in temporal SQL:2011 databases through the semantic layer of OWL 2 QL ontologies. An interval-based temporal query language (TQL), which we propose for this task, is defined via...

  14. DirQ: A Directed Query Dissemination Scheme for Wireless Sensor Networks

    NARCIS (Netherlands)

    Chatterjea, Supriyo; De Luigi, Simone; Havinga, Paul J.M.; Kaminska, B

    This paper describes a Directed Query Dissemination Scheme, DirQ that routes queries to the appropriate source nodes based on both constant and dynamic-valued attributes such as sensor types and sensor values. Location information is not essential for the operation of DirQ. DirQ only uses locally

  15. Anisotropic thermal expansion of SnSe from first-principles calculations based on Grüneisen's theory.

    Science.gov (United States)

    Liu, Gang; Zhou, Jian; Wang, Hui

    2017-06-14

    Based on Grüneisen's theory, the elastic properties and thermal expansion of bulk SnSe with the Pnma phase are investigated by using first-principles calculations. Our numerical results indicate that the linear thermal expansion coefficient along the a direction is smaller than the one along the b direction, while the one along the c direction shows a significant negative value, even at high temperature. The numerical results are in good accordance with experimental results. In addition, generalized and macroscopic Grüneisen parameters are also presented. It is also found that SnSe possesses negative Possion's ratio. The contributions of different phonon modes to NTE along the c direction are investigated, and it is found that the two modes which make the most important contributions to NTE are transverse vibrations perpendicular to the c direction. Finally, we analyze the relation of elastic constants to negative thermal expansion, and demonstrate that negative thermal expansion can also occur even with all positive macroscopic Grüneisen parameters.

  16. Validation of New Signal Detection Methods for Web Query Log Data Compared to Signal Detection Algorithms Used With FAERS.

    Science.gov (United States)

    Colilla, Susan; Tov, Elad Yom; Zhang, Ling; Kurzinger, Marie-Laure; Tcherny-Lessenot, Stephanie; Penfornis, Catherine; Jen, Shang; Gonzalez, Danny S; Caubel, Patrick; Welsh, Susan; Juhaeri, Juhaeri

    2017-05-01

    Post-marketing drug surveillance is largely based on signals found in spontaneous reports from patients and healthcare providers. Rare adverse drug reactions and adverse events (AEs) that may develop after long-term exposure to a drug or from drug interactions may be missed. The US FDA and others have proposed that web-based data could be mined as a resource to detect latent signals associated with adverse drug reactions. Recently, a web-based search query method called a query log reaction score (QLRS) was developed to detect whether AEs associated with certain drugs could be found from search engine query data. In this study, we compare the performance of two other algorithms, the proportional query ratio (PQR) and the proportional query rate ratio (Q-PRR) against that of two reference signal-detection algorithms (SDAs) commonly used with the FDA AE Reporting System (FAERS) database. In summary, the web query methods have moderate sensitivity (80%) in detecting signals in web query data compared with reference SDAs in FAERS when the web query data are filtered, but the query metrics generate many false-positives and have low specificity compared with reference SDAs in FAERS. Future research is needed to find better refinements of query data and/or the metrics to improve the specificity of these web query log algorithms.

  17. Schedule Sales Query Report Generation System

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

  18. Pro PHP and jQuery

    CERN Document Server

    Lengstorf, Jason

    2010-01-01

    This book is for intermediate programmers interested in building AJAX web applications using jQuery and PHP. Along with teaching some advanced PHP techniques, it will teach you how to take your dynamic applications to the next level by adding a JavaScript layer with jQuery. * Learn to utilize built-in PHP functions to build calendar tools.* Learn how jQuery can be used for AJAX, animation, client-side validation, and more.What you'll learn* Use PHP to build a calendar application that allows users to post, view, edit, and delete events.* Use jQuery to allow the calendar app to be viewed and ed

  19. Clean Air Markets - Compliance Query Wizard

    Data.gov (United States)

    U.S. Environmental Protection Agency — The Compliance Query Wizard is part of a suite of Clean Air Markets-related tools that are accessible at http://ampd.epa.gov/ampd/. The Compliance module provides...

  20. Clean Air Markets - Allowances Query Wizard

    Data.gov (United States)

    U.S. Environmental Protection Agency — The Allowances Query Wizard is part of a suite of Clean Air Markets-related tools that are accessible at http://camddataandmaps.epa.gov/gdm/index.cfm. The Allowances...

  1. ANSWERING GEOSPARQL QUERIES OVER RELATIONAL DATA

    Directory of Open Access Journals (Sweden)

    K. Bereta

    2017-07-01

    Full Text Available In this paper we present the system Ontop-spatial that is able to answer GeoSPARQL queries on top of geospatial relational databases, performing on-the-fly GeoSPARQL-to-SQL translation using ontologies and mappings. GeoSPARQL is a geospatial extension of the query language SPARQL standardized by OGC for querying geospatial RDF data. Our approach goes beyond relational databases and covers all data that can have a relational structure even at the logical level. Our purpose is to enable GeoSPARQL querying on-the-fly integrating multiple geospatial sources, without converting and materializing original data as RDF and then storing them in a triple store. This approach is more suitable in the cases where original datasets are stored in large relational databases (or generally in files with relational structure and/or get frequently updated.

  2. Efficient Approximate OLAP Querying Over Time Series

    DEFF Research Database (Denmark)

    Perera, Kasun Baruhupolage Don Kasun Sanjeewa; Hahmann, Martin; Lehner, Wolfgang

    2016-01-01

    The ongoing trend for data gathering not only produces larger volumes of data, but also increases the variety of recorded data types. Out of these, especially time series, e.g. various sensor readings, have attracted attention in the domains of business intelligence and decision making. As OLAP...... queries play a major role in these domains, it is desirable to also execute them on time series data. While this is not a problem on the conceptual level, it can become a bottleneck with regards to query run-time. In general, processing OLAP queries gets more computationally intensive as the volume...... are either costly or require continuous maintenance. In this paper we propose an approach for approximate OLAP querying of time series that offers constant latency and is maintenance-free. To achieve this, we identify similarities between aggregation cuboids and propose algorithms that eliminate...

  3. Superfund Chemical Data Matrix (SCDM) Query

    Science.gov (United States)

    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.

  4. A Pragmatic Evaluation of the National Cancer Institute Physician Data Query (PDQ)®-Based Brief Counseling on Cancer-Related Fatigue among Patients Undergoing Radiation Therapy.

    Science.gov (United States)

    Bauml, Joshua; Xie, Sharon X; Penn, Courtney; Desai, Krupali; Dong, Kimberly W; Bruner, Deborah Watkins; Vapiwala, Neha; Mao, Jun James

    2012-01-01

    Cancer-Related Fatigue (CRF) negatively affects quality of life among cancer patients. This study seeks to evaluate the outcome and patient receptiveness of a brief counseling program based on National Cancer Institute (NCI) PDQ® information to manage CRF when integrated into Radiation Therapy (RT). We conducted a prospective cohort study among patients undergoing non-palliative RT. Patients with stage I-III tumors and with Karnofsky score 60 or better were given a ten-minute behavioral counseling session during the first two weeks of RT. The Brief Fatigue Inventory (BFI) was administered at baseline/end of RT. Of 93 patients enrolled, 89% found the counseling useful and practical. By the end of RT, 59% reported increased exercise, 41.6% sought nutrition counseling, 72.7% prioritized daily activities, 74.4% took daytime naps, and 70.5% talked with other cancer patients. Regarding counseling, patients who had received chemotherapy prior to RT had no change in fatigue (-0.2), those who received RT alone had mild increase in fatigue (0.7, p=0.02), and those who received concurrent chemotherapy experienced a substantial increase in fatigue (3.0 to 5.2, p=0.05). Higher baseline fatigue and receipt of chemotherapy were predictive of worsened fatigue in a multivariate model (both pbrief behavioral counseling based on NCI guidelines is well accepted by patients showing an uptake in many activities to cope with CRF. Those who receive concurrent chemotherapy and with higher baseline fatigue are at risk for worsening fatigue despite of guideline-based therapy.

  5. Menangkal Serangan SQL Injection Dengan Parameterized Query

    Directory of Open Access Journals (Sweden)

    Yulianingsih Yulianingsih

    2016-06-01

    Full Text Available Semakin meningkat pertumbuhan layanan informasi maka semakin tinggi pula tingkat kerentanan keamanan dari suatu sumber informasi. Melalui tulisan ini disajikan penelitian yang dilakukan secara eksperimen yang membahas tentang kejahatan penyerangan database secara SQL Injection. Penyerangan dilakukan melalui halaman autentikasi dikarenakan halaman ini merupakan pintu pertama akses yang seharusnya memiliki pertahanan yang cukup. Kemudian dilakukan eksperimen terhadap metode Parameterized Query untuk mendapatkan solusi terhadap permasalahan tersebut.   Kata kunci— Layanan Informasi, Serangan, eksperimen, SQL Injection, Parameterized Query.

  6. Queryll: Java Database Queries through Bytecode Rewriting

    OpenAIRE

    Iu, Christopher Ming-Yee; Zwaenepoel, Willy

    2006-01-01

    When interfacing Java with other systems such as databases, programmers must often program in special interface languages like SQL. Code written in these languages often needs to be embedded in strings where they cannot be error-checked at compile-time, or the Java compiler needs to be altered to directly recognize code written in these languages. We have taken a different approach to adding database query facilities to Java. Bytecode rewriting allows us to add query facilities to Java whose ...

  7. Nearest Neighbor Queries in Road Networks

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Kolar, Jan; Pedersen, Torben Bach

    2003-01-01

    With wireless communications and geo-positioning being widely available, it becomes possible to offer new e-services that provide mobile users with information about other mobile objects. This paper concerns active, ordered k-nearest neighbor queries for query and data objects that are moving in ...... for the nearest neighbor search in the prototype is presented in detail. In addition, the paper reports on results from experiments with the prototype system....

  8. An Architectural Based Framework for the Distributed Collection, Analysis and Query from Inhomogeneous Time Series Data Sets and Wearables for Biofeedback Applications

    Directory of Open Access Journals (Sweden)

    James Lee

    2017-02-01

    Full Text Available The increasing professionalism of sports persons and desire of consumers to imitate this has led to an increased metrification of sport. This has been driven in no small part by the widespread availability of comparatively cheap assessment technologies and, more recently, wearable technologies. Historically, whilst these have produced large data sets, often only the most rudimentary analysis has taken place (Wisbey et al in: “Quantifying movement demands of AFL football using GPS tracking”. This paucity of analysis is due in no small part to the challenges of analysing large sets of data that are often from disparate data sources to glean useful key performance indicators, which has been a largely a labour intensive process. This paper presents a framework that can be cloud based for the gathering, storing and algorithmic interpretation of large and inhomogeneous time series data sets. The framework is architecture based and technology agnostic in the data sources it can gather, and presents a model for multi set analysis for inter- and intra- devices and individual subject matter. A sample implementation demonstrates the utility of the framework for sports performance data collected from distributed inertial sensors in the sport of swimming.

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

    Energy Technology Data Exchange (ETDEWEB)

    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.

  10. An empirical study on SAJQ (Sorting Algorithm for Join Queries

    Directory of Open Access Journals (Sweden)

    Hassan I. Mathkour

    2010-06-01

    Full Text Available Most queries that applied on database management systems (DBMS depend heavily on the performance of the used sorting algorithm. In addition to have an efficient sorting algorithm, as a primary feature, stability of such algorithms is a major feature that is needed in performing DBMS queries. In this paper, we study a new Sorting Algorithm for Join Queries (SAJQ that has both advantages of being efficient and stable. The proposed algorithm takes the advantage of using the m-way-merge algorithm in enhancing its time complexity. SAJQ performs the sorting operation in a time complexity of O(nlogm, where n is the length of the input array and m is number of sub-arrays used in sorting. An unsorted input array of length n is arranged into m sorted sub-arrays. The m-way-merge algorithm merges the sorted m sub-arrays into the final output sorted array. The proposed algorithm keeps the stability of the keys intact. An analytical proof has been conducted to prove that, in the worst case, the proposed algorithm has a complexity of O(nlogm. Also, a set of experiments has been performed to investigate the performance of the proposed algorithm. The experimental results have shown that the proposed algorithm outperforms other Stable–Sorting algorithms that are designed for join-based queries.

  11. VIGOR: Interactive Visual Exploration of Graph Query Results.

    Science.gov (United States)

    Pienta, Robert; Hohman, Fred; Endert, Alex; Tamersoy, Acar; Roundy, Kevin; Gates, Chris; Navathe, Shamkant; Chau, Duen Horng

    2018-01-01

    Finding patterns in graphs has become a vital challenge in many domains from biological systems, network security, to finance (e.g., finding money laundering rings of bankers and business owners). While there is significant interest in graph databases and querying techniques, less research has focused on helping analysts make sense of underlying patterns within a group of subgraph results. Visualizing graph query results is challenging, requiring effective summarization of a large number of subgraphs, each having potentially shared node-values, rich node features, and flexible structure across queries. We present VIGOR, a novel interactive visual analytics system, for exploring and making sense of query results. VIGOR uses multiple coordinated views, leveraging different data representations and organizations to streamline analysts sensemaking process. VIGOR contributes: (1) an exemplar-based interaction technique, where an analyst starts with a specific result and relaxes constraints to find other similar results or starts with only the structure (i.e., without node value constraints), and adds constraints to narrow in on specific results; and (2) a novel feature-aware subgraph result summarization. Through a collaboration with Symantec, we demonstrate how VIGOR helps tackle real-world problems through the discovery of security blindspots in a cybersecurity dataset with over 11,000 incidents. We also evaluate VIGOR with a within-subjects study, demonstrating VIGOR's ease of use over a leading graph database management system, and its ability to help analysts understand their results at higher speed and make fewer errors.

  12. Modeling the thermal deformation of TATB-based explosives. Part 1: Thermal expansion of “neat-pressed” polycrystalline TATB

    Energy Technology Data Exchange (ETDEWEB)

    Luscher, Darby J. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2014-05-08

    We detail a modeling approach to simulate the anisotropic thermal expansion of polycrystalline (1,3,5-triamino-2,4,6-trinitrobenzene) TATB-based explosives that utilizes microstructural information including porosity, crystal aspect ratio, and processing-induced texture. This report, the first in a series, focuses on nonlinear thermal expansion of “neat-pressed” polycrystalline TATB specimens which do not contain any binder; additional complexities related to polymeric binder and irreversible ratcheting behavior are briefly discussed, however detailed investigation of these aspects are deferred to subsequent reports. In this work we have, for the first time, developed a mesoscale continuum model relating the thermal expansion of polycrystal TATB specimens to their microstructural characteristics. A self-consistent homogenization procedure is used to relate macroscopic thermoelastic response to the constitutive behavior of single-crystal TATB. The model includes a representation of grain aspect ratio, porosity, and crystallographic texture attributed to the consolidation process. A quantitative model is proposed to describe the evolution of preferred orientation of graphitic planes in TATB during consolidation and an algorithm constructed to develop a discrete representation of the associated orientation distribution function. Analytical and numerical solutions using this model are shown to produce textures consistent with previous measurements and characterization for isostatic and uniaxial “die-pressed” specimens. Predicted thermal strain versus temperature for textured specimens are shown to be in agreement with corresponding experimental measurements. Using the developed modeling approach, several simulations have been run to investigate the influence of microstructure on macroscopic thermal expansion behavior. Results from these simulations are used to identify qualitative trends. Implications of the identified trends are discussed in the context of

  13. Query by image example: The CANDID approach

    Energy Technology Data Exchange (ETDEWEB)

    Kelly, P.M.; Cannon, M. [Los Alamos National Lab., NM (United States). Computer Research and Applications Group; Hush, D.R. [Univ. of New Mexico, Albuquerque, NM (United States). Dept. of Electrical and Computer Engineering

    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.

  14. Shrub growth and expansion in the Arctic tundra: an assessment of controlling factors using an evidence-based approach

    Science.gov (United States)

    Martin, Andrew C.; Jeffers, Elizabeth S.; Petrokofsky, Gillian; Myers-Smith, Isla; Macias-Fauria, Marc

    2017-08-01

    Woody shrubs have increased in biomass and expanded into new areas throughout the Pan-Arctic tundra biome in recent decades, which has been linked to a biome-wide observed increase in productivity. Experimental, observational, and socio-ecological research suggests that air temperature—and to a lesser degree precipitation—trends have been the predominant drivers of this change. However, a progressive decoupling of these drivers from Arctic vegetation productivity has been reported, and since 2010, vegetation productivity has also been declining. We created a protocol to (a) identify the suite of controls that may be operating on shrub growth and expansion, and (b) characterise the evidence base for controls on Arctic shrub growth and expansion. We found evidence for a suite of 23 proximal controls that operate directly on shrub growth and expansion; the evidence base focused predominantly on just four controls (air temperature, soil moisture, herbivory, and snow dynamics). 65% of evidence was generated in the warmest tundra climes, while 24% was from only one of 28 floristic sectors. Temporal limitations beyond 10 years existed for most controls, while the use of space-for-time approaches was high, with 14% of the evidence derived via experimental approaches. The findings suggest the current evidence base is not sufficiently robust or comprehensive at present to answer key questions of Pan-Arctic shrub change. We suggest future directions that could strengthen the evidence, and lead to an understanding of the key mechanisms driving changes in Arctic shrub environments.

  15. A dynamic force balance model for colloidal expansion and its DLVO-based application.

    Science.gov (United States)

    Liu, Longcheng; Moreno, Luis; Neretnieks, Ivars

    2009-01-20

    A force balance model that describes the dynamic expansion of colloidal bentonite gels/sols is presented. The colloidal particles are assumed to consist of one or several thin sheets with the other dimensions much larger than their thickness. The forces considered include van der Waals force, diffuse double layer force, thermal force giving rise to Brownian motion, gravity, as well as friction force. The model results in an expression resembling the instationary diffusion equation but with an immensely variable diffusivity. This diffusivity is strongly influenced by the concentration of counterions as well as by the particle concentration in the colloid gel/sol. The properties of the model are explored and discussed, exemplified by the upward expansion of an originally highly compacted bentonite tablet in a test tube. Examples are presented for a number of cases with ionic concentrations varying between very dilute waters up to several molar of counterions. The volume fraction of particles ranges from 40% to very dilute sols.

  16. Information hiding technology and application analysis based on decimal expansion of irrational numbers

    Science.gov (United States)

    Liu, Xiaoyong; Lu, Pei; Shao, Jianxin; Cao, Haibin; Zhu, Zhenmin

    2017-10-01

    In this paper, an information hiding method using decimal expansion of irrational numbers to generate random phase mask is proposed. Firstly, the decimal expansion parts of irrational numbers generate pseudo-random sequences using a new coding schemed, the irrational number and start and end bit numbers were used as keys in image information hiding. Secondly, we apply the coding schemed to the double phase encoding system, the pseudo-random sequences are taken to generate random phase masks. The mean square error is used to calculate the quality of the recovered image information. Finally, two tests had been carried out to verify the security of our method; the experimental results demonstrate that the cipher image has such features, strong robustness, key sensitivity, and resistance to brute force attack.

  17. Nickel-base alloys having a low coefficient of thermal expansion

    International Nuclear Information System (INIS)

    Baldwin, J.F.; Maxwell, D.H.

    1975-01-01

    Alloy compositions consisting predominantly of nickel, chromium, molybdenum, carbon, and boron are disclosed. The alloys possess a duplex structure consisting of a nickel--chromium--molybdenum matrix and a semi-continuous network of refractory carbides and borides. A combination of desirable properties is provided by these alloys, including elevated temperature strength, resistance to oxidation and hot corrosion, and a very low coefficient of thermal expansion

  18. Rapid Urban Expansion and Its Implications on Geomorphology: A Remote Sensing and GIS Based Study

    Directory of Open Access Journals (Sweden)

    S. N. Mohapatra

    2014-01-01

    Full Text Available Topography, vegetation, climate, water table, and even the anthropogenic activities all are affected by urban growth through diverse mechanisms. The present study focuses on the implications of urban expansion on geomorphology in the historical city of Gwalior in central India. The expansion of urban area has been quantified by deriving data for four decades (1972–2013 from the Landsat images. The results show that the urban built-up area has increased by 08.48 sq. km during the first eighteen years (1972–1990 which has increased to 16.28 sq. km during the next sixteen years (1990–2006. The built-up area has gone up to 23.19 sq. km in the next seven years (2006–2013. Overall during the last 40 years the growth of the urban built-up is nearly three times of the built-up areas in 1972. The average decadal growth rate of population is 27.28 percent while that of built-up land is 36.29 percent. The construction activities have affected important geomorphic features such pediplain, buried pediplain, residual hills, and denudational hills. It was concluded that, instead of shortsighted urban development, proper measures should be taken in accordance with scientific planning for the urban expansion of the city in the future.

  19. Efficient structure from motion for oblique UAV images based on maximal spanning tree expansion

    Science.gov (United States)

    Jiang, San; Jiang, Wanshou

    2017-10-01

    The primary contribution of this paper is an efficient Structure from Motion (SfM) solution for oblique unmanned aerial vehicle (UAV) images. First, an algorithm, considering spatial relationship constraints between image footprints, is designed for match pair selection with the assistance of UAV flight control data and oblique camera mounting angles. Second, a topological connection network (TCN), represented by an undirected weighted graph, is constructed from initial match pairs, which encodes the overlap areas and intersection angles into edge weights. Then, an algorithm, termed MST-Expansion, is proposed to extract the match graph from the TCN, where the TCN is first simplified by a maximum spanning tree (MST). By further analysis of the local structure in the MST, expansion operations are performed on the vertices of the MST for match graph enhancement, which is achieved by introducing critical connections in the expansion directions. Finally, guided by the match graph, an efficient SfM is proposed. Under extensive analysis and comparison, its performance is verified by using three oblique UAV datasets captured with different multi-camera systems. Experimental results demonstrate that the efficiency of image matching is improved, with speedup ratios ranging from 19 to 35, and competitive orientation accuracy is achieved from both relative bundle adjustment (BA) without GCPs (Ground Control Points) and absolute BA with GCPs. At the same time, images in the three datasets are successfully oriented. For the orientation of oblique UAV images, the proposed method can be a more efficient solution.

  20. Brain expansion in patients with type II diabetes following insulin therapy: a preliminary study with longitudinal voxel-based morphometry.

    Science.gov (United States)

    Chen, Zhiye; Li, Jinfeng; Sun, Jie; Ma, Lin

    2014-01-01

    We performed a longitudinal analysis based on magnetic resonance (MR) imaging to investigate the brain structural and perfusion changes caused by insulin therapy in patients with type II diabetes. High resolution three-dimensional T1-weighted fast spoiled gradient recalled echo images and flow-sensitive alternating inversion recovery (FAIR) images were obtained from 11 patients with type II diabetes before and 1 year after initiation of insulin therapy and 11 normal controls. Brain volume changes were investigated by a longitudinal voxel-based morphometry (VBM), and perfusion changes were evaluated by FAIR imaging between baseline and follow-up data. Significant regional gray matter (GM) expansion located in bilateral frontal, parietal, and left occipital lobes, and regional white matter (WM) expansion was shown in left precentral subcortical WM and right angular subcortical WM after insulin therapy (P Brain hyperperfusion was detected in bilateral frontal cortex, left occipital cortex, and right temporal cortex after insulin therapy (P brain expansion and hyperperfusion were demonstrated 1 year after initiation of insulin therapy, and insulin therapy could contribute to the brain volume gainment in the patients with type II diabetes. Copyright © 2013 by the American Society of Neuroimaging.

  1. Identification of invasive and expansive plant species based on airborne hyperspectral and ALS data

    Science.gov (United States)

    Szporak-Wasilewska, Sylwia; Kuc, Gabriela; Jóźwiak, Jacek; Demarchi, Luca; Chormański, Jarosław; Marcinkowska-Ochtyra, Adriana; Ochtyra, Adrian; Jarocińska, Anna; Sabat, Anita; Zagajewski, Bogdan; Tokarska-Guzik, Barbara; Bzdęga, Katarzyna; Pasierbiński, Andrzej; Fojcik, Barbara; Jędrzejczyk-Korycińska, Monika; Kopeć, Dominik; Wylazłowska, Justyna; Woziwoda, Beata; Michalska-Hejduk, Dorota; Halladin-Dąbrowska, Anna

    2017-04-01

    The aim of Natura 2000 network is to ensure the long term survival of most valuable and threatened species and habitats in Europe. The encroachment of invasive alien and expansive native plant species is among the most essential threat that can cause significant damage to protected habitats and their biodiversity. The phenomenon requires comprehensive and efficient repeatable solutions that can be applied to various areas in order to assess the impact on habitats. The aim of this study is to investigate of the issue of invasive and expansive plant species as they affect protected areas at a larger scale of Natura 2000 network in Poland. In order to determine the scale of the problem we have been developing methods of identification of invasive and expansive species and then detecting their occurrence and mapping their distribution in selected protected areas within Natura 2000 network using airborne hyperspectral and airborne laser scanning data. The aerial platform used consists of hyperspectral HySpex scanner (451 bands in VNIR and SWIR), Airborne Laser Scanner (FWF) Riegl Lite Mapper and RGB camera. It allowed to obtain simultaneous 1 meter resolution hyperspectral image, 0.1 m resolution orthophotomaps and point cloud data acquired with 7 points/m2. Airborne images were acquired three times per year during growing season to account for plant seasonal change (in May/June, July/August and September/October 2016). The hyperspectral images were radiometrically, geometrically and atmospherically corrected. Atmospheric correction was performed and validated using ASD FieldSpec 4 measurements. ALS point cloud data were used to generate several different topographic, vegetation and intensity products with 1 m spatial resolution. Acquired data (both hyperspectral and ALS) were used to test different classification methods including Mixture Tuned Matched Filtering (MTMF), Spectral Angle Mapper (SAM), Random Forest (RF), Support Vector Machines (SVM), among others

  2. Applying GA for Optimizing the User Query in Image and Video Retrieval

    OpenAIRE

    Ehsan Lotfi

    2014-01-01

    In an information retrieval system, the query can be made by user sketch. The new method presented here, optimizes the user sketch and applies the optimized query to retrieval the information. This optimization may be used in Content-Based Image Retrieval (CBIR) and Content-Based Video Retrieval (CBVR) which is based on trajectory extraction. To optimize the retrieval process, one stage of retrieval is performed by the user sketch. The retrieval criterion is based on the proposed distance met...

  3. Review: Implementasi Holap Untuk Optimasi Query Sistem Basis Data Terdistribusi Dengan Pendekatan Algoritma Genetik

    Directory of Open Access Journals (Sweden)

    Rahmad Syaifudin

    2016-01-01

    Full Text Available Distributed Database is one of database that is under control of the Database Management System (DBMS was focused on storage devices are separated from one and another. Optimization data query on distributed database system not be separated from data processing methods that used. Then for fast query optimization this database need some required methods that can optimize it. Hybrid online analytical processing (HOLAP or often to call Hybrid-OLAP is one of technology for optimization query on distributed database. Genetic Algorithm is one of algorithm for heuristic searching was based on the mechanisms of biological evolution. Process of genetic algorithm is combining a selection process, using a crossover operator and mutation to get the best solution. From the reviews about implementation HOLAP with Genetic Algorithm approach was expected being used as a basis research on HOLAP implementation for query optimization on distributed database with genetic algorithm approach. Keywords : Query Optimization; Distributed database; HOLAP; OLAP; Genetetic algorithm.

  4. Index and query methods in road networks

    CERN Document Server

    Feng, Jun

    2015-01-01

    This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures. Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly de...

  5. Monitoring rubber plantation expansion using Landsat data time series and a Shapelet-based approach

    Science.gov (United States)

    Ye, Su; Rogan, John; Sangermano, Florencia

    2018-02-01

    The expansion of tree plantations in tropical forests for commercial rubber cultivation threatens biodiversity which may affect ecosystem services, and hinders ecosystem productivity, causing net carbon emission. Numerous studies refer to the challenge of reliably distinguishing rubber plantations from natural forest, using satellite data, due to their similar spectral signatures, even when phenology is incorporated into an analysis. This study presents a novel approach for monitoring the establishment and expansion of rubber plantations in Seima Protection Forest (SPF), Cambodia (1995-2015), by detecting and analyzing the 'shapelet' structure in a Landsat-NDVI time series. This paper introduces a new classification procedure consisting of two steps: (1) an exhaustive-searching algorithm to detect shapelets that represent a period for relatively low NDVI values within an image time series; and (2) a t-test used to determine if NDVI values of detected shapelets are significantly different than their non-shapelet trend, thereby indicating the presence of rubber plantations. Using this approach, historical rubber plantation events were mapped over the twenty-year timespan. The shapelet algorithm produced two types of information: (1) year of rubber plantation establishment; and (2) pre-conversion land-cover type (i.e., agriculture, or natural forest). The overall accuracy of the rubber plantation map for the year of 2015 was 89%. The multi-temporal map products reveal that more than half of the rubber planting activity (57%) took place in 2010 and 2011, following the granting of numerous rubber concessions two years prior. Seventy-three percent of the rubber plantations were converted from natural forest and twenty-three percent were established on non-forest land-cover. The shapelet approach developed here can be used reliably to improve our understanding of the expansion of rubber production beyond Seima Protection Forest of Cambodia, and likely elsewhere in the

  6. Distribution Network Expansion Planning Based on Multi-objective PSO Algorithm

    DEFF Research Database (Denmark)

    Zhang, Chunyu; Ding, Yi; Wu, Qiuwei

    2013-01-01

    This paper presents a novel approach for electrical distribution network expansion planning using multi-objective particle swarm optimization (PSO). The optimization objectives are: investment and operation cost, energy losses cost, and power congestion cost. A two-phase multi-objective PSO...... algorithm was proposed to solve this optimization problem, which can accelerate the convergence and guarantee the diversity of Pareto-optimal front set as well. The feasibility and effectiveness of both the proposed multi-objective planning approach and the improved multi-objective PSO have been verified...

  7. EFFECTIVELY SEARCHING SPECIMEN AND OBSERVATION DATA WITH TOQE, THE THESAURUS OPTIMIZED QUERY EXPANDER

    Directory of Open Access Journals (Sweden)

    Anton Güntsch

    2009-09-01

    Full Text Available Today’s specimen and observation data portals lack a flexible mechanism, able to link up thesaurus-enabled data sources such as taxonomic checklist databases and expand user queries to related terms, significantly enhancing result sets. The TOQE system (Thesaurus Optimized Query Expander is a REST-like XML web-service implemented in Python and designed for this purpose. Acting as an interface between portals and thesauri, TOQE allows the implementation of specialized portal systems with a set of thesauri supporting its specific focus. It is both easy to use for portal programmers and easy to configure for thesaurus database holders who want to expose their system as a service for query expansions. Currently, TOQE is used in four specimen and observation data portals. The documentation is available from http://search.biocase.org/toqe/.

  8. Culture expansion of adipose derived stromal cells. A closed automated Quantum Cell Expansion System compared with manual flask-based culture

    DEFF Research Database (Denmark)

    Haack-Sørensen, Mandana; Follin, Bjarke; Juhl, Morten

    2016-01-01

    Background: Adipose derived stromal cells (ASCs) are a rich and convenient source of cells for clinical regenerative therapeutic approaches. However, applications of ASCs often require cell expansion to reach the needed dose. In this study, cultivation of ASCs from stromal vascular fraction (SVF......) over two passages in the automated and functionally closed Quantum Cell Expansion System (Quantum system) is compared with traditional manual cultivation. Methods: Stromal vascular fraction was isolated from abdominal fat, suspended in α-MEM supplemented with 10% Fetal Bovine Serum and seeded......, and endotoxins, in addition to the assessment of cell counts, viability, immunophenotype, and differentiation potential. Results: The viability of ASCs passage 0 (P0) and P1 was above 96%, regardless of cultivation in flasks or Quantum system. Expression of surface markers and differentiation potential...

  9. Integrating future scenario‐based crop expansion and crop conditions to map switchgrass biofuel potential in eastern Nebraska, USA

    Science.gov (United States)

    Gu, Yingxin; Wylie, Bruce K.

    2018-01-01

    Switchgrass (Panicum virgatum) has been evaluated as one potential source for cellulosic biofuel feedstocks. Planting switchgrass in marginal croplands and waterway buffers can reduce soil erosion, improve water quality, and improve regional ecosystem services (i.e. it serves as a potential carbon sink). In previous studies, we mapped high risk marginal croplands and highly erodible cropland buffers that are potentially suitable for switchgrass development, which would improve ecosystem services and minimally impact food production. In this study, we advance our previous study results and integrate future crop expansion information to develop a switchgrass biofuel potential ensemble map for current and future croplands in eastern Nebraska. The switchgrass biomass productivity and carbon benefits (i.e. NEP: net ecosystem production) for the identified biofuel potential ensemble areas were quantified. The future scenario‐based (‘A1B’) land use and land cover map for 2050, the US Geological Survey crop type and Compound Topographic Index (CTI) maps, and long‐term (1981–2010) averaged annual precipitation data were used to identify future crop expansion regions that are suitable for switchgrass development. Results show that 2528 km2 of future crop expansion regions (~3.6% of the study area) are potentially suitable for switchgrass development. The total estimated biofuel potential ensemble area (including cropland buffers, marginal croplands, and future crop expansion regions) is 4232 km2 (~6% of the study area), potentially producing 3.52 million metric tons of switchgrass biomass per year. Converting biofuel ensemble regions to switchgrass leads to potential carbon sinks (the total NEP for biofuel potential areas is 0.45 million metric tons C) and is environmentally sustainable. Results from this study improve our understanding of environmental conditions and ecosystem services of current and future cropland systems in eastern Nebraska and provide

  10. Optimal Planar Orthogonal Skyline Counting Queries

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Larsen, Kasper Green

    2014-01-01

    The skyline of a set of points in the plane is the subset of maximal points, where a point (x,y) is maximal if no other point (x',y') satisfies x'≥ x and y'≥ x. We consider the problem of preprocessing a set P of n points into a space efficient static data structure supporting orthogonal skyline...... counting queries, i.e. given a query rectangle R to report the size of the skyline of P\\cap R. We present a data structure for storing n points with integer coordinates having query time O(lg n/lglg n) and space usage O(n). The model of computation is a unit cost RAM with logarithmic word size. We prove...

  11. jQuery for designers beginner's guide

    CERN Document Server

    MacLees, Natalie

    2014-01-01

    A step-by-step guide that spices up your web pages and designs them in the way you want using the most widely used JavaScript library, jQuery. The beginner-friendly and easy-to-understand approach of the book will help get to grips with jQuery in no time. If you know the fundamentals of HTML and CSS, and want to extend your knowledge by learning to use JavaScript, then this is just the book for you. jQuery makes JavaScript straightforward and approachable - you'll be surprised at how easy it can be to add animations and special effects to your beautifully designed pages.

  12. Mining and Querying Multimedia Data

    Science.gov (United States)

    2011-09-29

    2007. [63] Edwin M. Knorr, Raymond T. Ng, and Vladimir Tucakov. Distance-based outliers: algo- rithms and applications. The VLDB Journal, 8(3-4):237–253...Ashburner, Kathleen Falls, Paul Leyland, Peter McQuilton, Steven Marygold, Gillian Millburn, David Osumi- Sutherland , Andrew Schroeder, Ruth Seal, Haiyan

  13. Evaluating Trajectory Queries over Imprecise Location Data

    DEFF Research Database (Denmark)

    Xie, Scott, Xike; Cheng, Reynold; Yiu, Man Lung

    2012-01-01

    Trajectory queries, which retrieve nearby objects for every point of a given route, can be used to identify alerts of potential threats along a vessel route, or monitor the adjacent rescuers to a travel path. However, the locations of these objects (e.g., threats, succours) may not be precisely...... obtained due to hardware limitations of measuring devices, as well as the constantly-changing nature of the external environment. Ignoring data uncertainty can render low query quality, and cause undesirable consequences such as missing alerts of threats and poor response time in rescue operations. Also...

  14. Query Optimization Techniques in Microsoft SQL Server

    Directory of Open Access Journals (Sweden)

    Costel Gabriel CORLATAN

    2014-09-01

    Full Text Available Microsoft SQL Server is a relational database management system, having MS-SQL and Transact-SQL as primary structured programming languages. They rely on relational algebra which is mainly used for data insertion, modifying, deletion and retrieval, as well as for data access controlling. The problem with getting the expected results is handled by the management system which has the purpose of finding the best execution plan, this process being called optimization. The most frequently used queries are those of data retrieval through SELECT command. We have to take into consideration that not only the select queries need optimization, but also other objects, such as: index, view or statistics.

  15. Implementation of Quantum Private Queries Using Nuclear Magnetic Resonance

    International Nuclear Information System (INIS)

    Wang Chuan; Hao Liang; Zhao Lian-Jie

    2011-01-01

    We present a modified protocol for the realization of a quantum private query process on a classical database. Using one-qubit query and CNOT operation, the query process can be realized in a two-mode database. In the query process, the data privacy is preserved as the sender would not reveal any information about the database besides her query information, and the database provider cannot retain any information about the query. We implement the quantum private query protocol in a nuclear magnetic resonance system. The density matrix of the memory registers are constructed. (general)

  16. Using evolutionary conserved modules in gene networks as a strategy to leverage high throughput gene expression queries.

    Directory of Open Access Journals (Sweden)

    Jeanne M Serb

    Full Text Available BACKGROUND: Large-scale gene expression studies have not yielded the expected insight into genetic networks that control complex processes. These anticipated discoveries have been limited not by technology, but by a lack of effective strategies to investigate the data in a manageable and meaningful way. Previous work suggests that using a pre-determined seed-network of gene relationships to query large-scale expression datasets is an effective way to generate candidate genes for further study and network expansion or enrichment. Based on the evolutionary conservation of gene relationships, we test the hypothesis that a seed network derived from studies of retinal cell determination in the fly, Drosophila melanogaster, will be an effective way to identify novel candidate genes for their role in mouse retinal development. METHODOLOGY/PRINCIPAL FINDINGS: Our results demonstrate that a number of gene relationships regulating retinal cell differentiation in the fly are identifiable as pairwise correlations between genes from developing mouse retina. In addition, we demonstrate that our extracted seed-network of correlated mouse genes is an effective tool for querying datasets and provides a context to generate hypotheses. Our query identified 46 genes correlated with our extracted seed-network members. Approximately 54% of these candidates had been previously linked to the developing brain and 33% had been previously linked to the developing retina. Five of six candidate genes investigated further were validated by experiments examining spatial and temporal protein expression in the developing retina. CONCLUSIONS/SIGNIFICANCE: We present an effective strategy for pursuing a systems biology approach that utilizes an evolutionary comparative framework between two model organisms, fly and mouse. Future implementation of this strategy will be useful to determine the extent of network conservation, not just gene conservation, between species and will

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

    Science.gov (United States)

    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.

  18. Towards Automatic Improvement of Patient Queries in Health Retrieval Systems

    Directory of Open Access Journals (Sweden)

    Nesrine KSENTINI

    2016-07-01

    Full Text Available With the adoption of health information technology for clinical health, e-health is becoming usual practice today. Users of this technology find it difficult to seek information relevant to their needs due to the increasing amount of the clinical and medical data on the web, and the lack of knowledge of medical jargon. In this regards, a method is described to improve user's needs by automatically adding new related terms to their queries which appear in the same context of the original query in order to improve final search results. This method is based on the assessment of semantic relationships defined by a proposed statistical method between a set of terms or keywords. Experiments were performed on CLEF-eHealth-2015 database and the obtained results show the effectiveness of our proposed method.

  19. Managing and querying image annotation and markup in XML

    Science.gov (United States)

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Hong, Seokyong [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lim, Seung -Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sukumar, Sreenivas R. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Vatsavai, Ranga Raju [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    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.

  1. New recurrence relations for the rapid evaluation of electron repulsion integrals based on the accompanying coordinate expansion formula

    Science.gov (United States)

    Kobayashi, Masato; Nakai, Hiromi

    2004-09-01

    We present an algorithm for the rapid computation of electron repulsion integrals (ERIs) over Gaussian basis functions based on the accompanying coordinate expansion (ACE) formula. The present algorithm uses equations termed angular momentum reduced expressions and introduces two types of recurrence relations to ACE formulas. Numerical efficiencies are assessed for (p p|p p) and (sp sp|sp sp) ERIs by using the floating-point operation count. The algorithm is suitable for calculating ERIs for the same exponents but different angular momentum functions, such as L shells and derivatives of ERIs. The present algorithm is also capable of calculating ERIs with highly contracted Gaussian basis functions.

  2. Modeling and Querying Business Data with Artifact Lifecycle

    Directory of Open Access Journals (Sweden)

    Danfeng Zhao

    2015-01-01

    Full Text Available Business data has been one of the current and future research frontiers, with such big data characteristics as high-volume, high-velocity, high-privacy, and so forth. Most corporations view their business data as a valuable asset and make efforts on the development and optimal utilization on these data. Unfortunately, data management technology at present has been lagging behind the requirements of business big data era. Based on previous business process knowledge, a lifecycle of business data is modeled to achieve consistent description between the data and processes. On this basis, a business data partition method based on user interest is proposed which aims to get minimum number of interferential tuples. Then, to balance data privacy and data transmission cost, our strategy is to explore techniques to execute SQL queries over encrypted business data, split the computations of queries across the server and the client, and optimize the queries with syntax tree. Finally, an instance is provided to verify the usefulness and availability of the proposed method.

  3. Flow and linear coefficient of thermal expansion of four types of Base Plate waxes compared with ADA standard

    Directory of Open Access Journals (Sweden)

    Monzavi A

    2002-07-01

    Full Text Available Waxes have a lot of applications in dentistry. Such materials are of thermoplastic type that undergoes deformation in different temperatures. Two important properties of base plate waxes are flow and their coefficient of linear thermal expansion. Recently, different institutions, inside the country, produce dentistry waxes, while they have not been standardized. Consequently, consumers' dissatisfaction are observed. In this research, the two above- mentioned factors were compared between three kinds of Iranian waxes with Cavex that is foreign production, based on test number 24 of ADA. To measure the flow rate in the temperatures of 23, 37 and 45°c, Wilcoxon statistical analysis was used. The results showed that in 23°c, the flow rate of Cavex and Azardent waxes met ADA standards; however, it was not true for two others types. In 37°c, the flow of none of the waxes was standardized and in 45°c their flow was acceptable, moreover, thermal expansion coefficient, for Cavex and Azardent types, was based on ADA standard.

  4. Evolutionary Algorithms for Boolean Queries Optimization

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.

    2006-01-01

    Roč. 3, č. 1 (2006), s. 15-20 ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics

  5. Boolean Queries Optimization by Genetic Algorithms

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav

    2005-01-01

    Roč. 15, - (2005), s. 395-409 ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research

  6. An Ensemble Approach for Expanding Queries

    Science.gov (United States)

    2012-11-01

    nephritis ” in query number 145. lupus nephritis ( nephritis OR lupus lupus OR glomerulonephritis mycophenolate OR mofetil glomerulonephritis OR... lupus cyclophosphamide membranous OR lupus OR nephritis OR syndrome diffuse OR lupus OR glomerulonephritis OR syndrome sle OR...document collection (Table 1). Table 1. Stop words. High frequency words Common English stop words but treatment normal him who after over

  7. Flattening Queries over Nested Data Types

    NARCIS (Netherlands)

    van Ruth, J.

    2006-01-01

    The theory developed in this thesis provides a method to improve the efficiency of querying nested data. The roots of this research lie in the tension between data model expressiveness and performance. Obviously, more expressive data models are more convenient for application programmers. For many

  8. Path Minima Queries in Dynamic Weighted Trees

    DEFF Research Database (Denmark)

    Davoodi, Pooya; Brodal, Gerth Stølting; Satti, Srinivasa Rao

    2011-01-01

    update time?} in the comparison and the RAM models. These structures also support inserting a node on an edge, inserting a leaf, and contracting edges. When only insertion and deletion of leaves are desired, we give data structures in the comparison and the RAM models, with optimal query time...

  9. Sonata: Query-Driven Network Telemetry

    KAUST Repository

    Gupta, Arpit

    2017-05-02

    Operating networks depends on collecting and analyzing measurement data. Current technologies do not make it easy to do so, typically because they separate data collection (e.g., packet capture or flow monitoring) from analysis, producing either too much data to answer a general question or too little data to answer a detailed question. In this paper, we present Sonata, a network telemetry system that uses a uniform query interface to drive the joint collection and analysis of network traffic. Sonata takes the advantage of two emerging technologies---streaming analytics platforms and programmable network devices---to facilitate joint collection and analysis. Sonata allows operators to more directly express network traffic analysis tasks in terms of a high-level language. The underlying runtime partitions each query into a portion that runs on the switch and another that runs on the streaming analytics platform iteratively refines the query to efficiently capture only the traffic that pertains to the operator\\'s query, and exploits sketches to reduce state in switches in exchange for more approximate results. Through an evaluation of a prototype implementation, we demonstrate that Sonata can support a wide range of network telemetry tasks with less state in the network, and lower data rates to streaming analytics systems, than current approaches can achieve.

  10. Beginning SQL queries from novice to professional

    CERN Document Server

    Churcher, Clare

    2016-01-01

    Anyone who does any work at all with databases needs to know something of SQL. This is a friendly and easy-to-read guide to writing queries with the all-important - in the database world - SQL language. The author writes with exceptional clarity.

  11. Approximate Nearest Neighbor Queries among Parallel Segments

    DEFF Research Database (Denmark)

    Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias

    2010-01-01

    We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...

  12. Exploiting cost distributions for query optimization

    NARCIS (Netherlands)

    F. Waas; A.J. Pellenkoft (Jan)

    1998-01-01

    textabstractLarge-scale query optimization is, besides its practical relevance, a hard test case for optimization techniques. Since exact methods cannot be applied due to the combinatorial explosion of the search space, heuristics and probabilistic strategies have been deployed for more than a

  13. Preparatory Work for a Scenario-Based Electricity Expansion Plan for North Korea after Hypothetical Reunification using WASP-IV

    International Nuclear Information System (INIS)

    Kim, Young Joo; Chang, Choong Koo

    2014-01-01

    It is noteworthy that North Korean government itself has demanded other parties' cooperation in the field of power sector as the top priority to deal with North Korean own economic issues. In this light, the researcher consider that how to build power capacity in North Korean area after reunification needs to be studied with priority. A scenario-based approach is being adopted, and three scenarios are proposed: Scenario increasing capacity at 2.4% annual rate, Imitating South Korean electricity expansion history, and reaching 80% of South Korean Annual Peak Load in 35 years. In order to carry out the research, WASP-IV (Wien Automation System Planning-IV) code developed by IAEA is, with reasonable assumptions, being executed. Annual Peak Load prediction for each scenario, load duration curve, and existing power generating facilities in North Korea are presented herein. This research is being conducted as a preparatory work for the further study. IAEA's WASP-IV is adopted for a scenario-based electricity expansion plan for North Korea after hypothetical reunification between Koreas. Input data including Annual Peak Load, load duration curve, and existing facilities are built and presented. Additional future research includes inputting candidate plants data, cost data such as construction period, operation and maintenance costs, and fuel costs, as well as decommissioning of aged power plants in North Korea to complete WASP-IV execution. Assuming reunification, electricity expansion plan would need to integrate North and South Koreas demands and facilities. However, this research narrows down its scope to North Korean demand and facilities only. Such integrated simulation could be the topic for the later research. This work was supported by the 2014 Research Fund of the KINGS

  14. Giant negative thermal expansion in bonded MnCoGe-based compounds with Ni2In-type hexagonal structure.

    Science.gov (United States)

    Zhao, Ying-Ying; Hu, Feng-Xia; Bao, Li-Fu; Wang, Jing; Wu, Hui; Huang, Qing-Zhen; Wu, Rong-Rong; Liu, Yao; Shen, Fei-Ran; Kuang, Hao; Zhang, Ming; Zuo, Wen-Liang; Zheng, Xin-Qi; Sun, Ji-Rong; Shen, Bao-Gen

    2015-02-11

    MnCoGe-based compounds undergo a giant negative thermal expansion (NTE) during the martensitic structural transition from Ni2In-type hexagonal to TiNiSi-type orthorhombic structure. High-resolution neutron diffraction experiments revealed that the expansion of unit cell volume can be as large as ΔV/V ∼ 3.9%. The optimized compositions with concurrent magnetic and structural transitions have been studied for magnetocaloric effect. However, these materials have not been considered as NTE materials partially due to the limited temperature window of phase transition. The as-prepared MnCoGe-based compounds are quite brittle and naturally collapse into powders. By using a few percents (3-4%) of epoxy to bond the powders, we introduced residual stress in the bonded samples and thus realized the broadening of structural transition by utilizing the specific characteristics of lattice softening enforced by the stress. As a result, giant NTE (not only the linear NTE coefficient α but also the operation-temperature window) has been achieved. For example, the average α̅ as much as -51.5 × 10(-6)/K with an operating temperature window as wide as 210 K from 122 to 332 K has been observed in a bonded MnCo0.98Cr0.02Ge compound. Moreover, in the region between 250 and 305 K near room temperature, the α value (-119 × 10(-6)/K) remains nearly independent of temperature. Such an excellent performance exceeds that of most other materials reported previously, suggesting it can potentially be used as a NTE material, particularly for compensating the materials with large positive thermal expansions.

  15. BioFed: federated query processing over life sciences linked open data.

    Science.gov (United States)

    Hasnain, Ali; Mehmood, Qaiser; Sana E Zainab, Syeda; Saleem, Muhammad; Warren, Claude; Zehra, Durre; Decker, Stefan; Rebholz-Schuhmann, Dietrich

    2017-03-15

    Biomedical data, e.g. from knowledge bases and ontologies, is increasingly made available following open linked data principles, at best as RDF triple data. This is a necessary step towards unified access to biological data sets, but this still requires solutions to query multiple endpoints for their heterogeneous data to eventually retrieve all the meaningful information. Suggested solutions are based on query federation approaches, which require the submission of SPARQL queries to endpoints. Due to the size and complexity of available data, these solutions have to be optimised for efficient retrieval times and for users in life sciences research. Last but not least, over time, the reliability of data resources in terms of access and quality have to be monitored. Our solution (BioFed) federates data over 130 SPARQL endpoints in life sciences and tailors query submission according to the provenance information. BioFed has been evaluated against the state of the art solution FedX and forms an important benchmark for the life science domain. The efficient cataloguing approach of the federated query processing system 'BioFed', the triple pattern wise source selection and the semantic source normalisation forms the core to our solution. It gathers and integrates data from newly identified public endpoints for federated access. Basic provenance information is linked to the retrieved data. Last but not least, BioFed makes use of the latest SPARQL standard (i.e., 1.1) to leverage the full benefits for query federation. The evaluation is based on 10 simple and 10 complex queries, which address data in 10 major and very popular data sources (e.g., Dugbank, Sider). BioFed is a solution for a single-point-of-access for a large number of SPARQL endpoints providing life science data. It facilitates efficient query generation for data access and provides basic provenance information in combination with the retrieved data. BioFed fully supports SPARQL 1.1 and gives access to the

  16. Sharing-Aware Horizontal Partitioning for Exploiting Correlations during Query Processing

    DEFF Research Database (Denmark)

    Tzoumas, Kostas; Deshpande, Amol; Jensen, Christian Søndergaard

    2010-01-01

    Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each partition having substantially different statistical characteristics. It is very compelling to discover such data...... partitions during query optimization and create multiple plans for a given query, one plan being optimal for a particular combination of data partitions. This scenario calls for the sharing of state among plans, so that common intermediate results are not recomputed. We study this problem in a setting...

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

    International Nuclear Information System (INIS)

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

    2002-01-01

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

  18. BAMQL: a query language for extracting reads from BAM files.

    Science.gov (United States)

    Masella, Andre P; Lalansingh, Christopher M; Sivasundaram, Pragash; Fraser, Michael; Bristow, Robert G; Boutros, Paul C

    2016-08-11

    It is extremely common to need to select a subset of reads from a BAM file based on their specific properties. Typically, a user unpacks the BAM file to a text stream using SAMtools, parses and filters the lines using AWK, then repacks them using SAMtools. This process is tedious and error-prone. In particular, when working with many columns of data, mix-ups are common and the bit field containing the flags is unintuitive. There are several libraries for reading BAM files, such as Bio-SamTools for Perl and pysam for Python. Both allow access to the BAM's read information and can filter reads, but require substantial boilerplate code; this is high overhead for mostly ad hoc filtering. We have created a query language that gathers reads using a collection of predicates and common logical connectives. Queries run faster than equivalents and can be compiled to native code for embedding in larger programs. BAMQL provides a user-friendly, powerful and performant way to extract subsets of BAM files for ad hoc analyses or integration into applications. The query language provides a collection of predicates beyond those in SAMtools, and more flexible connectives.

  19. Query-Biased Preview over Outsourced and Encrypted Data

    Directory of Open Access Journals (Sweden)

    Ningduo Peng

    2013-01-01

    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.

  20. FastQuery: A Parallel Indexing System for Scientific Data

    Energy Technology Data Exchange (ETDEWEB)

    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.

  1. Web search queries can predict stock market volumes.

    Science.gov (United States)

    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.

  2. Web Search Queries Can Predict Stock Market Volumes

    Science.gov (United States)

    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

  3. Web search queries can predict stock market volumes.

    Directory of Open Access Journals (Sweden)

    Ilaria Bordino

    Full Text Available 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.

  4. Prediction of hole expansion ratio for various steel sheets based on uniaxial tensile properties

    Science.gov (United States)

    Kim, Jae Hyung; Kwon, Young Jin; Lee, Taekyung; Lee, Kee-Ahn; Kim, Hyoung Seop; Lee, Chong Soo

    2018-01-01

    Stretch-flangeability is one of important formability parameters of thin steel sheets used in the automotive industry. There have been many attempts to predict hole expansion ratio (HER), a typical term to evaluate stretch-flangeability, using uniaxial tensile properties for convenience. This paper suggests a new approach that uses total elongation and average normal anisotropy to predict HER of thin steel sheets. The method provides a good linear relationship between HER of the machined hole and the predictive variables in a variety of materials with different microstructures obtained using different processing methods. The HER of the punched hole was also well predicted using the similar approach, which reflected only the portion of post uniform elongation. The physical meaning drawn by our approach successfully explained the poor HER of austenitic steels despite their considerable elongation. The proposed method to predict HER is simple and cost-effective, so it will be useful in industry. In addition, the model provides a physical explanation of HER, so it will be useful in academia.

  5. Homogenization-Based Numerical Mathods, Homogenization, Asymptotic Analysis, Asymptotic Expansion, Numerical Simulation

    OpenAIRE

    Frenod, Emmanuel

    2013-01-01

    In this note, a classification of Homogenization-Based Numerical Methods and (in particular) of Numerical Methods that are based on the Two-Scale Convergence is done. In this classification stand: Direct Homogenization-Based Numerical Methods; H-Measure-Based Numerical Methods; Two-Scale Numerical Methods and TSAPS: Two-Scale Asymptotic Preserving Schemes.

  6. Expansion dynamics

    International Nuclear Information System (INIS)

    Knoll, J.

    1985-10-01

    A quantum dynamical model is suggested which describes the expansion and disassembly phase of highly excited compounds formed in energetic heavy-ion collisions. First applications in two space and one time dimensional model world are discussed and qualitatively compared to standard freeze-out concepts. (orig.)

  7. expansion method

    Indian Academy of Sciences (India)

    ... (G /G)-expansion method, here in the present work, we investigate five nonlinear equations of physical importance, namely the (2+1)-dimensional Maccari system, the Pochhammer–Chree equation, the Newell–. Whitehead equation, the Fitzhugh–Nagumo equation and the Burger–Fisher equation. The organization of the ...

  8. Multiple k Nearest Neighbor Query Processing in Spatial Network Databases

    DEFF Research Database (Denmark)

    Xuegang, Huang; Jensen, Christian Søndergaard; Saltenis, Simonas

    2006-01-01

    This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries...... for points of interest that are accessible via the road network. Given multiple k nearest neighbor queries, the paper proposes progressive techniques that selectively cache query results in main memory and subsequently reuse these for query processing. The paper initially proposes techniques for the case...... neighbor query processing....

  9. The survey of large-scale query classification

    Science.gov (United States)

    Zhou, Sanduo; Cheng, Kefei; Men, Lijun

    2017-04-01

    In recent years, a lot of researches have been done on query classification. The paper introduces the recent researches on query classification in detail, mainly including the source of query log, the category systems, the feature extraction methods, classification methods and the evaluation methodology. Then it discusses the issues of large-scale query classification and the solved methods combined with big data analysis systems. The research result shows there still are several problems and challenges, such as lack of authoritative classification system and evaluation methodology, efficiency of the feature extraction method, uncertainty of the performance on large-scale query log and the further query classification on the big data platform, etc.

  10. The optimized expansion based low-rank method for wavefield extrapolation

    KAUST Repository

    Wu, Zedong

    2014-03-01

    Spectral methods are fast becoming an indispensable tool for wavefield extrapolation, especially in anisotropic media because it tends to be dispersion and artifact free as well as highly accurate when solving the wave equation. However, for inhomogeneous media, we face difficulties in dealing with the mixed space-wavenumber domain extrapolation operator efficiently. To solve this problem, we evaluated an optimized expansion method that can approximate this operator with a low-rank variable separation representation. The rank defines the number of inverse Fourier transforms for each time extrapolation step, and thus, the lower the rank, the faster the extrapolation. The method uses optimization instead of matrix decomposition to find the optimal wavenumbers and velocities needed to approximate the full operator with its explicit low-rank representation. As a result, we obtain lower rank representations compared with the standard low-rank method within reasonable accuracy and thus cheaper extrapolations. Additional bounds set on the range of propagated wavenumbers to adhere to the physical wave limits yield unconditionally stable extrapolations regardless of the time step. An application on the BP model provided superior results compared to those obtained using the decomposition approach. For transversely isotopic media, because we used the pure P-wave dispersion relation, we obtained solutions that were free of the shear wave artifacts, and the algorithm does not require that n > 0. In addition, the required rank for the optimization approach to obtain high accuracy in anisotropic media was lower than that obtained by the decomposition approach, and thus, it was more efficient. A reverse time migration result for the BP tilted transverse isotropy model using this method as a wave propagator demonstrated the ability of the algorithm.

  11. Linear precoding based on polynomial expansion: reducing complexity in massive MIMO

    KAUST Repository

    Mueller, Axel

    2016-02-29

    Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal non-linear precoding are solved more or less automatically by enlarging system dimensions. However, the computational precoding complexity grows with the system dimensions. For example, the close-to-optimal and relatively “antenna-efficient” regularized zero-forcing (RZF) precoding is very complicated to implement in practice, since it requires fast inversions of large matrices in every coherence period. Motivated by the high performance of RZF, we propose to replace the matrix inversion and multiplication by a truncated polynomial expansion (TPE), thereby obtaining the new TPE precoding scheme which is more suitable for real-time hardware implementation and significantly reduces the delay to the first transmitted symbol. The degree of the matrix polynomial can be adapted to the available hardware resources and enables smooth transition between simple maximum ratio transmission and more advanced RZF. By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.

  12. Stochastic Simulation and Forecast of Hydrologic Time Series Based on Probabilistic Chaos Expansion

    Science.gov (United States)

    Li, Z.; Ghaith, M.

    2017-12-01

    Hydrological processes are characterized by many complex features, such as nonlinearity, dynamics and uncertainty. How to quantify and address such complexities and uncertainties has been a challenging task for water engineers and managers for decades. To support robust uncertainty analysis, an innovative approach for the stochastic simulation and forecast of hydrologic time series is developed is this study. Probabilistic Chaos Expansions (PCEs) are established through probabilistic collocation to tackle uncertainties associated with the parameters of traditional hydrological models. The uncertainties are quantified in model outputs as Hermite polynomials with regard to standard normal random variables. Sequentially, multivariate analysis techniques are used to analyze the complex nonlinear relationships between meteorological inputs (e.g., temperature, precipitation, evapotranspiration, etc.) and the coefficients of the Hermite polynomials. With the established relationships between model inputs and PCE coefficients, forecasts of hydrologic time series can be generated and the uncertainties in the future time series can be further tackled. The proposed approach is demonstrated using a case study in China and is compared to a traditional stochastic simulation technique, the Markov-Chain Monte-Carlo (MCMC) method. Results show that the proposed approach can serve as a reliable proxy to complicated hydrological models. It can provide probabilistic forecasting in a more computationally efficient manner, compared to the traditional MCMC method. This work provides technical support for addressing uncertainties associated with hydrological modeling and for enhancing the reliability of hydrological modeling results. Applications of the developed approach can be extended to many other complicated geophysical and environmental modeling systems to support the associated uncertainty quantification and risk analysis.

  13. Efficient Verifiable Range and Closest Point Queries in Zero-Knowledge

    Directory of Open Access Journals (Sweden)

    Ghosh Esha

    2016-10-01

    Full Text Available We present an efficient method for answering one-dimensional range and closest-point queries in a verifiable and privacy-preserving manner. We consider a model where a data owner outsources a dataset of key-value pairs to a server, who answers range and closest-point queries issued by a client and provides proofs of the answers. The client verifies the correctness of the answers while learning nothing about the dataset besides the answers to the current and previous queries. Our work yields for the first time a zero-knowledge privacy assurance to authenticated range and closest-point queries. Previous work leaked the size of the dataset and used an inefficient proof protocol. Our construction is based on hierarchical identity-based encryption. We prove its security and analyze its efficiency both theoretically and with experiments on synthetic and real data (Enron email and Boston taxi datasets.

  14. Oligonucleotide-Based Therapy for FTD/ALS Caused by the C9orf72 Repeat Expansion: A Perspective

    Directory of Open Access Journals (Sweden)

    Stephanie A. Fernandes

    2013-01-01

    Full Text Available Amyotrophic lateral sclerosis (ALS is a progressive and lethal disease of motor neuron degeneration, leading to paralysis of voluntary muscles and death by respiratory failure within five years of onset. Frontotemporal dementia (FTD is characterised by degeneration of frontal and temporal lobes, leading to changes in personality, behaviour, and language, culminating in death within 5–10 years. Both of these diseases form a clinical, pathological, and genetic continuum of diseases, and this link has become clearer recently with the discovery of a hexanucleotide repeat expansion in the C9orf72 gene that causes the FTD/ALS spectrum, that is, c9FTD/ALS. Two basic mechanisms have been proposed as being potentially responsible for c9FTD/ALS: loss-of-function of the protein encoded by this gene (associated with aberrant DNA methylation and gain of function through the formation of RNA foci or protein aggregates. These diseases currently lack any cure or effective treatment. Antisense oligonucleotides (ASOs are modified nucleic acids that are able to silence targeted mRNAs or perform splice modulation, and the fact that they have proved efficient in repeat expansion diseases including myotonic dystrophy type 1 makes them ideal candidates for c9FTD/ALS therapy. Here, we discuss potential mechanisms and challenges for developing oligonucleotide-based therapy for c9FTD/ALS.

  15. A biofuel-based cogeneration plant in a natural gas expansion system: An energetic and economic assessment

    International Nuclear Information System (INIS)

    Badami, Marco; Modica, Stefano; Portoraro, Armando

    2017-01-01

    Highlights: • A Natural Gas Turbo Expander system with a rapeseed oil fueled CHP is studied. • The experimental data of the plant are considered in the analyses. • The energetic index of performance shows the attractiveness of the plant. • Incentives and fuel price volatility effects on economic profitability are analysed. - Abstract: The paper deals with an analysis of the energetic and economic performance of a City Gas Station (CGS) plant, made up of a rapeseed oil cogenerator coupled to a turbo-expansion system for the reduction of natural gas pressure, which is currently in operation in Italy. Although this kind of systems concept is well known, the plant can be considered unusual because the heat needed to pre-heat the gas before its expansion is obtained from a renewable source. The aim of the paper is to analyse the energetic efficiency of the plant and its economic viability, which is affected to a great extent by subsidizing energy policies and by the volatility of vegetable oil prices. All the evaluations have been based on a real set of experimental data.

  16. Date restricted queries in web search engines

    OpenAIRE

    Lewandowski, Dirk

    2004-01-01

    Search engines usually offer a date restricted search on their advanced search pages. But determining the actual update of a web page is not without problems. We conduct a study testing date restricted queries on the search engines Google, Teoma and Yahoo!. We find that these searches fail to work properly in the examined engines. We discuss implications of this for further research and search engine development.

  17. Advanced SPARQL querying in small molecule databases

    Czech Academy of Sciences Publication Activity Database

    Galgonek, Jakub; Hurt, T.; Michlíková, V.; Onderka, P.; Schwarz, J.; Vondrášek, Jiří

    2016-01-01

    Roč. 8, Jun 6 (2016), č. článku 31. ISSN 1758-2946 R&D Projects : GA MŠk(CZ) LM2015047 Institutional support: RVO:61388963 Keywords : Resource Description Framework * SPARQL query language * Database of small molecules Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 4.220, year: 2016 http://jcheminf.springeropen.com/articles/10.1186/s13321-016-0144-4

  18. TEMPORAL QUERY PROCESSIG USING SQL SERVER

    OpenAIRE

    Vali Shaik, Mastan; Sujatha, P

    2017-01-01

    Most data sources in real-life are not static but change their information in time. This evolution of data in time can give valuable insights to business analysts. Temporal data refers to data, where changes over time or temporal aspects play a central role. Temporal data denotes the evaluation of object characteristics over time. One of the main unresolved problems that arise during the data mining process is treating data that contains temporal information. Temporal queries on time evolving...

  19. A Practical Python API for Querying AFLOWLIB

    OpenAIRE

    Rosenbrock, Conred W.

    2017-01-01

    Large databases such as aflowlib.org provide valuable data sources for discovering material trends through machine learning. Although a REST API and query language are available, there is a learning curve associated with the AFLUX language that acts as a barrier for new users. Additionally, the data is stored using non-standard serialization formats. Here we present a high-level API that allows immediate access to the aflowlib data using standard python operators and language features. It pro...

  20. STOQS: The Spatial Temporal Oceanographic Query System

    Science.gov (United States)

    McCann, M. P.; Schramm, R.

    2010-12-01

    The Spatial-Temporal Oceanographic Query System (STOQS) has been developed at the Monterey Bay Aquarium Research Institute to improve access and visualization of a multi-decadal archive of upper water column observations. STOQS consists of a set of applications, operational procedures, and a geospatial relational database. Borrowing a database schema from the Geographic Information System community we've implemented a database that is tuned for efficient queries across several dimensions of the data model. An Object Relational Mapping (ORM) tool was used to hide the complexity of SQL that results from our highly normalized data model. The Python scripting language is used to write the Extract Translate Load (ETL) programs for populating the database with data from our long-term operational archives. These archives include collections of Climate Forecast convention netCDF files of mooring and autonomous underwater vehicle data and other special purpose relational databases. This poster describes the specific tools and techniques used to implement STOQS. Though still in development the system already provides benefits to users through a Google Earth interface and an ability to conduct fast queries across multiple previously non-interoperable data sets.

  1. Application of discriminative models for interactive query refinement in video retrieval

    Science.gov (United States)

    Srivastava, Amit; Khanwalkar, Saurabh; Kumar, Anoop

    2013-12-01

    The ability to quickly search for large volumes of videos for specific actions or events can provide a dramatic new capability to intelligence agencies. Example-based queries from video are a form of content-based information retrieval (CBIR) where the objective is to retrieve clips from a video corpus, or stream, using a representative query sample to find more like this. Often, the accuracy of video retrieval is largely limited by the gap between the available video descriptors and the underlying query concept, and such exemplar queries return many irrelevant results with relevant ones. In this paper, we present an Interactive Query Refinement (IQR) system which acts as a powerful tool to leverage human feedback and allow intelligence analyst to iteratively refine search queries for improved precision in the retrieved results. In our approach to IQR, we leverage discriminative models that operate on high dimensional features derived from low-level video descriptors in an iterative framework. Our IQR model solicits relevance feedback on examples selected from the region of uncertainty and updates the discriminating boundary to produce a relevance ranked results list. We achieved 358% relative improvement in Mean Average Precision (MAP) over initial retrieval list at a rank cutoff of 100 over 4 iterations. We compare our discriminative IQR model approach to a naïve IQR and show our model-based approach yields 49% relative improvement over the no model naïve system.

  2. Indexing, Query Processing, and Clustering of Spatio-Temporal Text Objects

    DEFF Research Database (Denmark)

    Skovsgaard, Anders

    With the increasing mobile use of the web from geo-positioned devices, the Internet is increasingly acquiring a spatial aspect, with still more types of content being geo-tagged. As a result of this development, a wide range of location-aware queries and applications have emerged. The large amoun...... partial results. The results shows excellent indexing and query execution performance on a standard DBMS......) spatio-temporal aggregates, and (iii) spatio-textual region querying without special purpose index structures. First, two novel techniques to perform grouping of spatio-textual objects are presented. In the first technique, top-k groups of objects are returned while taking into account aspects......, the grouping of spatio-textual objects is done without considering query locations, and a clustering approach is proposed that takes into account both the spatial and textual attributes of the objects. The technique expands clusters based on a proposed quality function that enables clusters of arbitrary shape...

  3. Medical Information Retrieval Enhanced with User's Query Expanded with Tag-Neighbors

    DEFF Research Database (Denmark)

    Durao, Frederico; Bayyapu, Karunakar Reddy; Xu, Guandong

    2013-01-01

    Under-specified queries often lead to undesirable search results that do not contain the information needed. This problem gets worse when it comes to medical information, a natural human demand everywhere. Existing search engines on the Web often are unable to handle medical search well because...... they do not consider its special requirements. Often a medical information searcher is uncertain about his exact questions and unfamiliar with medical terminology. To overcome the limitations of under-specified queries, we utilize tags to enhance information retrieval capabilities by expanding users......’ original queries with context-relevant information. We compute a set of significant tag neighbor candidates based on the neighbor frequency and weight, and utilize the qualified tag neighbors to expand an entry query. The proposed approach is evaluated by using MedWorm medical article collection...

  4. A Coding Method for Efficient Subgraph Querying on Vertex- and Edge-Labeled Graphs

    Science.gov (United States)

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

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

    Science.gov (United States)

    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.

  6. Rapid shear alignment of sub-10 nm cylinder-forming block copolymer films based on thermal expansion mismatch

    Science.gov (United States)

    Nicaise, Samuel M.; Gadelrab, Karim R.; G, Amir Tavakkoli K.; Ross, Caroline A.; Alexander-Katz, Alfredo; Berggren, Karl K.

    2018-01-01

    Directed self-assembly of block copolymers (BCPs) provided by shear-stress can produce aligned sub-10 nm structures over large areas for applications in integrated circuits, next-generation data storage, and plasmonic structures. In this work, we present a fast, versatile BCP shear-alignment process based on coefficient of thermal expansion mismatch of the BCP film, a rigid top coat and a substrate. Monolayer and bilayer cylindrical microdomains of poly(styrene-b-dimethylsiloxane) aligned preferentially in-plane and orthogonal to naturally-forming or engineered cracks in the top coat film, allowing for orientation control over 1 cm2 substrates. Annealing temperatures, up to 275 °C, provided low-defect alignment up to 2 mm away from cracks for rapid (thermal annealing was critical for the observed microdomain alignment.

  7. Modeling urban expansion policy scenarios using an agent-based approach for Guangzhou Metropolitan Region of China

    Directory of Open Access Journals (Sweden)

    Guangjin Tian

    2014-09-01

    Full Text Available Policy makers and the human decision processes of urban planning have an impact on urban expansion. The behaviors and decision modes of regional authority, real estate developer, resident, and farmer agents and their interactions can be simulated by the analytical hierarchy process (AHP method. The driving factors are regressed with urban dynamics instead of static land-use types. Agents' behaviors and decision modes have an impact on the urban dynamic pattern by adjusting parameter weights. We integrate an agent-based model (ABM with AHP to investigate a complex decision-making process and future urban dynamic processes. Three policy scenarios for baseline development, rapid development, and green land protection have been applied to predict the future development patterns of the Guangzhou metropolitan region. A future policy scenario analysis can help policy makers to understand the possible results. These individuals can adjust their policies and decisions according to their different objectives.

  8. Atomistic Modeling of the Negative Thermal Expansion in δ- Plutonium Based on the Two-State Description.

    Science.gov (United States)

    Lee, Tongsik; Baskes, Michael I; Lawson, A C; Chen, Shao Ping; Valone, Steven M

    2012-06-07

    The δ phase of plutonium with the fcc structure exhibits an unusual negative thermal expansion (NTE) over its narrow temperature range of stability, 593-736 K. An accurate description of the anomalous high-temperature volume effect of plutonium goes beyond the current capability of electronic-structure calculations. We propose an atomistic scheme to model the thermodynamic properties of δ-Pu based on the two-state model of Weiss for the Invar alloys, inspired by the simple free-energy analysis previously conducted by Lawson et al. The two-state mechanism is incorporated into the atomistic description of a many-body interacting system. Two modified embedded atom method potentials are employed to represent the binding energies of two competing electronic states in δ-Pu. We demonstrate how the NTE takes place in δ-Pu by means of Monte Carlo simulations implemented with the two-state mechanism.

  9. Multifaceted characterization of cell wall decomposition products formed during ammonia fiber expansion (AFEX) and dilute acid based pretreatments.

    Science.gov (United States)

    Chundawat, Shishir P S; Vismeh, Ramin; Sharma, Lekh N; Humpula, James F; da Costa Sousa, Leonardo; Chambliss, C Kevin; Jones, A Daniel; Balan, Venkatesh; Dale, Bruce E

    2010-11-01

    Decomposition products formed/released during ammonia fiber expansion (AFEX) and dilute acid (DA) pretreatment of corn stover (CS) were quantified using robust mass spectrometry based analytical platforms. Ammonolytic cleavage of cell wall ester linkages during AFEX resulted in the formation of acetamide (25mg/g AFEX CS) and various phenolic amides (15mg/g AFEX CS) that are effective nutrients for downstream fermentation. After ammonolysis, Maillard reactions with carbonyl-containing intermediates represent the second largest sink for ammonia during AFEX. On the other hand, several carboxylic acids were formed (e.g. 35mg acetic acid/g DA CS) during DA pretreatment. Formation of furans was 36-fold lower for AFEX compared to DA treatment; while carboxylic acids (e.g. lactic and succinic acids) yield was 100-1000-fold lower during AFEX compared to previous reports using sodium hydroxide as pretreatment reagent. Copyright 2010 Elsevier Ltd. All rights reserved.

  10. Semantic querying of data guided by Formal Concept Analysis

    OpenAIRE

    Codocedo , Victor; Lykourentzou , Ioanna; Napoli , Amedeo

    2012-01-01

    International audience; In this paper we present a novel approach to handle querying over a concept lattice of documents and annotations. We focus on the problem of "non-matching documents", which are those that, despite being semantically relevant to the user query, do not contain the query's elements and hence cannot be retrieved by typical string matching approaches. In order to find these documents, we modify the initial user query using the concept lattice as a guide. We achieve this by ...

  11. Allocation of the transmission service cost with base in marginal costs of the transmission network expansion; Asignacion del costo del servicio de transmision con base en costos marginales de expansion de la red de transmision

    Energy Technology Data Exchange (ETDEWEB)

    Ruiz Casillas, Manuel E.; Nieva Gomez, Rolando [Instituto de Investigaciones Electricas, Temixco, Morelos (Mexico)

    2001-07-01

    The transmission charges to the users must be completely defined in those systems where the restructuring has broken up the traditional functions of the companies; in order to introduce competition in the generation and commercialization segments of the electrical energy. The fundamentals of a method used are explained to assure the transmission service cases between their users. The method is based on the marginal expansion costs of the transmission network. Their more known applications have been in competitive markets of energy, in particular, where the energy price is the same one in all the localities. Nevertheless, it can be used under other forms of organization of the electrical industry. In order to illustrate results, the obtained ones from their application to the most important part of the transmission network of the Mexican system that operates interconnected, are presented. [Spanish] Los cargos de transmision a los usuarios deben estar completamente definidos en aquellos sistemas donde la reestructuracion ha desagregado las funciones tradicionales de las empresas; para introducir competencia en los segmentos de generacion y comercializacion de la energia electrica. Se explican los fundamentos de un metodo utilizado para asegurar los casos del servicio de transmision entre sus usuarios. El metodo se basa en los costos marginales de expansion de la red de transmision. Sus aplicaciones mas conocidas han sido en mercados competitivos de energia, en particular, donde el precio de la energia es el mismo en todas las localidades. Sin embargo, puede utilizarse bajo otras formas de organizacion de la industria electrica. Con el proposito de ilustrar resultados, se muestran los obtenidos de su aplicacion a la parte mas importante de la red de transmision del sistema mexicano que opera interconectada.

  12. Is There Any Evidence for Rapid, Genetically-Based, Climatic Niche Expansion in the Invasive Common Ragweed?

    Directory of Open Access Journals (Sweden)

    Laure Gallien

    Full Text Available Climatic niche shifts have been documented in a number of invasive species by comparing the native and adventive climatic ranges in which they occur. However, these shifts likely represent changes in the realized climatic niches of invasive species, and may not necessarily be driven by genetic changes in climatic affinities. Until now the role of rapid niche evolution in the spread of invasive species remains a challenging issue with conflicting results. Here, we document a likely genetically-based climatic niche expansion of an annual plant invader, the common ragweed (Ambrosia artemisiifolia L., a highly allergenic invasive species causing substantial public health issues. To do so, we looked for recent evolutionary change at the upward migration front of its adventive range in the French Alps. Based on species climatic niche models estimated at both global and regional scales we stratified our sampling design to adequately capture the species niche, and localized populations suspected of niche expansion. Using a combination of species niche modeling, landscape genetics models and common garden measurements, we then related the species genetic structure and its phenotypic architecture across the climatic niche. Our results strongly suggest that the common ragweed is rapidly adapting to local climatic conditions at its invasion front and that it currently expands its niche toward colder and formerly unsuitable climates in the French Alps (i.e. in sites where niche models would not predict its occurrence. Such results, showing that species climatic niches can evolve on very short time scales, have important implications for predictive models of biological invasions that do not account for evolutionary processes.

  13. Is There Any Evidence for Rapid, Genetically-Based, Climatic Niche Expansion in the Invasive Common Ragweed?

    Science.gov (United States)

    Gallien, Laure; Thuiller, Wilfried; Fort, Noémie; Boleda, Marti; Alberto, Florian J; Rioux, Delphine; Lainé, Juliette; Lavergne, Sébastien

    2016-01-01

    Climatic niche shifts have been documented in a number of invasive species by comparing the native and adventive climatic ranges in which they occur. However, these shifts likely represent changes in the realized climatic niches of invasive species, and may not necessarily be driven by genetic changes in climatic affinities. Until now the role of rapid niche evolution in the spread of invasive species remains a challenging issue with conflicting results. Here, we document a likely genetically-based climatic niche expansion of an annual plant invader, the common ragweed (Ambrosia artemisiifolia L.), a highly allergenic invasive species causing substantial public health issues. To do so, we looked for recent evolutionary change at the upward migration front of its adventive range in the French Alps. Based on species climatic niche models estimated at both global and regional scales we stratified our sampling design to adequately capture the species niche, and localized populations suspected of niche expansion. Using a combination of species niche modeling, landscape genetics models and common garden measurements, we then related the species genetic structure and its phenotypic architecture across the climatic niche. Our results strongly suggest that the common ragweed is rapidly adapting to local climatic conditions at its invasion front and that it currently expands its niche toward colder and formerly unsuitable climates in the French Alps (i.e. in sites where niche models would not predict its occurrence). Such results, showing that species climatic niches can evolve on very short time scales, have important implications for predictive models of biological invasions that do not account for evolutionary processes.

  14. Parallelizing Federated SPARQL Queries in Presence of Replicated Data

    DEFF Research Database (Denmark)

    Minier, Thomas; Montoya, Gabriela; Skaf-Molli, Hala

    2017-01-01

    Federated query engines have been enhanced to exploit new data localities created by replicated data, e.g., Fedra. However, existing replication aware federated query engines mainly focus on pruning sources during the source selection and query decomposition in order to reduce intermediate results...

  15. User Simulations for Interactive Search : Evaluating Personalized Query Suggestion

    NARCIS (Netherlands)

    Verberne, S.; Sappelli, M.; Järvelin, K.; Kraaij, W.

    2015-01-01

    In this paper, we address the question “what is the influence of user search behaviour on the effectiveness of personalized query suggestion?”. We implemented a method for query suggestion that generates candidate follow-up queries from the documents clicked by the user. This is a potentially

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

    Science.gov (United States)

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

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

    Science.gov (United States)

    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.

  18. jQuery 2.0 development cookbook

    CERN Document Server

    Revill, Leon

    2014-01-01

    Taking a recipe-based approach, this book presents numerous practical examples that you can use directly in your applications. The book covers the essential issues you will face while developing your web applications and gives you solutions to them. The recipes in this book are written in a manner that rapidly takes you from beginner to expert level.This book is for web developers of all skill levels. Although some knowledge of JavaScript, HTML, and CSS is required, this Cookbook will teach jQuery newcomers all the basics required to move on to the more complex examples of this book, which wil

  19. The impact of semantic document expansion on cluster-based fusion for microblog search

    NARCIS (Netherlands)

    Liang, S.; Ren, Z.; de Rijke, M.; de Rijke, M.; Kenter, T.; de Vries, A.P.; Zhai, C.X.; de Jong, F.; Radinsky, K.; Hofmann, K.

    2014-01-01

    Searching microblog posts, with their limited length and creative language usage, is challenging. We frame the microblog search problem as a data fusion problem. We examine the effectiveness of a recent cluster-based fusion method on the task of retrieving microblog posts. We find that in the

  20. Analytical double-hybrid density functional based on the polynomial series expansion of adiabatic connection: a quadratic approximation.

    Science.gov (United States)

    Kim, Jaehoon; Jung, Yousung

    2015-01-13

    We present a systematic derivation of double-hybrid density functional (DHDF) based on the polynomial series expansion of adiabatic connection formula in the closed interval λ = [0,1] without a loss of generality. Because of the tendency of Wλ having a small (but not negligible) curvature at equilibrium, we first evaluate the chemical validity of quadratic approximation for Wλ using the large GMTKN30 benchmark database. The resulting functional, obtained analytically and denoted by quadratic adiabatic connection functional-PT2 (QACF-2), is found to be robust and accurate (2.35 kcal/mol of weighted total mean absolute deviation error, WTMAD), comparable or slightly improved compared to other flavors of existing parameter-free DHDFs (2.45 or 3.29 kcal/mol for PBE0-2 or PBE0-DH, respectively). The nonlocal expansion coefficients obtained for the current QACF-2 (aHF = 2/3, aPT2 = 1/3) also offer some interesting observation, in that the latter analytical coefficients are very similar to the empirically optimized coefficients in some of the best DHDFs today with high accuracy (1.5 kcal/mol). Effects of quadratic truncation in QACF-2 have been further assessed and justified by estimating the higher-order corrections to be as much as 0.54 kcal/mol. The present derivation and numerical experiments suggest that the quadratic λ dependence, despite its simplicity, is a surprisingly good approximation to the adiabatic connection that can serve as a good starting point for further development of accurate parameter-free density functionals.

  1. Final A Street Pond Expansion Environmental Assessment at Beale Air Force Base, California

    Science.gov (United States)

    2008-09-01

    EUCALYPTUS STANDS OTHER SEASONAL WETLAND PERMANENT MARSH RIPARIAN WETLANDS SEASONAL SWALE VERNAL POOL 0 1 20.5 Miles Figure 3-1 Habitat Communities Beale Air...Part B permit. Contaminated soil was identified and removed from the site. Soil vapor extraction and bioventing systems were installed within this...daytime 40 Quiet urban night time 30 Quiet rural night time 20 Rustling leaves 10 Mosquito at 3 feet Beale Air Force Base Final A Street Pond

  2. Secure Count Query on Encrypted Genomic Data.

    Science.gov (United States)

    Hasan, Mohammad Zahidul; Rahman Mahdi, Md Safiur; Sadat, Md Nazmus; Mohammed, Noman

    2018-03-14

    Human genomic information can yield more effective healthcare by guiding medical decisions. Therefore, genomics research is gaining popularity as it can identify potential correlations between a disease and a certain gene, which improves the safety and efficacy of drug treatment and can also develop more effective prevention strategies [1]. To reduce the sampling error and to increase the statistical accuracy of this type of research projects, data from different sources need to be brought together since a single organization does not necessarily possess required amount of data. In this case, data sharing among multiple organizations must satisfy strict policies (for instance, HIPAA and PIPEDA) that have been enforced to regulate privacy-sensitive data sharing. Storage and computation on the shared data can be outsourced to a third party cloud service provider, equipped with enormous storage and computation resources. However, outsourcing data to a third party is associated with a potential risk of privacy violation of the participants, whose genomic sequence or clinical profile is used in these studies. In this article, we propose a method for secure sharing and computation on genomic data in a semi-honest cloud server. In particular, there are two main contributions. Firstly, the proposed method can handle biomedical data containing both genotype and phenotype. Secondly, our proposed index tree scheme reduces the computational overhead significantly for executing secure count query operation. In our proposed method, the confidentiality of shared data is ensured through encryption, while making the entire computation process efficient and scalable for cutting-edge biomedical applications. We evaluated our proposed method in terms of efficiency on a database of Single-Nucleotide Polymorphism (SNP) sequences, and experimental results demonstrate that the execution time for a query of 50 SNPs in a database of 50000 records is approximately 5 seconds, where each

  3. Deep web query interface understanding and integration

    CERN Document Server

    Dragut, Eduard C; Yu, Clement T

    2012-01-01

    There are millions of searchable data sources on the Web and to a large extent their contents can only be reached through their own query interfaces. There is an enormous interest in making the data in these sources easily accessible. There are primarily two general approaches to achieve this objective. The first is to surface the contents of these sources from the deep Web and add the contents to the index of regular search engines. The second is to integrate the searching capabilities of these sources and support integrated access to them. In this book, we introduce the state-of-the-art tech

  4. Downloading Multiple Records Using Query Strings

    Directory of Open Access Journals (Sweden)

    Adam Crymble

    2012-11-01

    Full Text Available Downloading a single record from a website is easy, but downloading many records at a time – an increasingly frequent need for a historian – is much more efficient using a programming language such as Python. In this lesson, we will write a program that will download a series of records from the Old Bailey Online using custom search criteria, and save them to a directory on our computer. This process involves interpreting and manipulating URL Query Strings. In this case, the tutorial will seek to download sources that contain references to people of African descent that were published in the Old Bailey Proceedings between 1700 and 1750.

  5. Numerical analytic continuation by a mollification method based on Hermite function expansion

    Science.gov (United States)

    Zhao, Zhenyu

    2012-04-01

    The numerical analytic continuation of a function f(z) = f(x + iy) on a strip is discussed in this paper. Data are only given approximately on the real axis. A mollification method based on expanded Hermite functions has been introduced to deal with the ill-posedness of the problem. We have shown that the mollification parameter can be chosen by a discrepancy principle and a corresponding error estimate has also been obtained. Numerical tests are given to show the effectiveness of the method.

  6. Time-to-digital converter based on analog time expansion for 3D time-of-flight cameras

    Science.gov (United States)

    Tanveer, Muhammad; Nissinen, Ilkka; Nissinen, Jan; Kostamovaara, Juha; Borg, Johan; Johansson, Jonny

    2014-03-01

    This paper presents an architecture and achievable performance for a time-to-digital converter, for 3D time-of-flight cameras. This design is partitioned in two levels. In the first level, an analog time expansion, where the time interval to be measured is stretched by a factor k, is achieved by charging a capacitor with current I, followed by discharging the capacitor with a current I/k. In the second level, the final time to digital conversion is performed by a global gated ring oscillator based time-to-digital converter. The performance can be increased by exploiting its properties of intrinsic scrambling of quantization noise and mismatch error, and first order noise shaping. The stretched time interval is measured by counting full clock cycles and storing the states of nine phases of the gated ring oscillator. The frequency of the gated ring oscillator is approximately 131 MHz, and an appropriate stretch factor k, can give a resolution of ≍ 57 ps. The combined low nonlinearity of the time stretcher and the gated ring oscillator-based time-to-digital converter can achieve a distance resolution of a few centimeters with low power consumption and small area occupation. The carefully optimized circuit configuration achieved by using an edge aligner, the time amplification property and the gated ring oscillator-based time-to-digital converter may lead to a compact, low power single photon configuration for 3D time-of-flight cameras, aimed for a measurement range of 10 meters.

  7. Modeling and Querying Moving Objects with Social Relationships

    Directory of Open Access Journals (Sweden)

    Hengcai Zhang

    2016-07-01

    Full Text Available Current moving-object database (MOD systems focus on management of movement data, but pay less attention to modelling social relationships between moving objects and spatial-temporal trajectories in an integrated manner. This paper combines moving-object database and social network systems and presents a novel data model called Geo-Social-Moving (GSM that enables the unified management of trajectories, underlying geographical space and social relationships for mass moving objects. A bulk of user-defined data types and corresponding operators are also proposed to facilitate geo-social queries on moving objects. An implementation framework for the GSM model is proposed, and a prototype system based on native Neo4J is then developed with two real-world data sets from the location-based social network systems. Compared with solutions based on traditional extended relational database management systems characterized by time-consuming table join operations, the proposed GSM model characterized by graph traversal is argued to be more powerful in representing mass moving objects with social relationships, and more efficient and stable for geo-social querying.

  8. A multistage framework for reliability-based distribution expansion planning considering distributed generations by a self-adaptive global-based harmony search algorithm

    International Nuclear Information System (INIS)

    Shivaie, Mojtaba; Ameli, Mohammad T.; Sepasian, Mohammad S.; Weinsier, Philip D.; Vahidinasab, Vahid

    2015-01-01

    In this paper, the authors present a new multistage framework for reliability-based Distribution Expansion Planning (DEP) in which expansion options are a reinforcement and/or installation of substations, feeders, and Distributed Generations (DGs). The proposed framework takes into account not only costs associated with investment, maintenance, and operation, but also expected customer interruption cost in the optimization as four problem objectives. At the same time, operational restrictions, Kirchhoff's laws, radial structure limitation, voltage limits, and capital expenditure budget restriction are considered as problem constraints. The proposed model is a non-convex optimization problem having a non-linear, mixed-integer nature. Hence, a hybrid Self-adaptive Global-based Harmony Search Algorithm (SGHSA) and Optimal Power Flow (OPF) were used and followed by a fuzzy satisfying method in order to obtain the final optimal solution. The SGHSA is a recently developed optimization algorithm which imitates the music improvisation process. In this process, the harmonists improvise their instrument pitches, searching for the perfect state of harmony. The planning methodology was demonstrated on the 27-node, 13.8-kV test system in order to demonstrate the feasibility and capability of the proposed model. Simulation results illustrated the sufficiency and profitableness of the newly developed framework, when compared with other methods. - Highlights: • A new multistage framework is presented for reliability-based DEP problem. • In this paper, DGs are considered as an expansion option to increase the flexibility of the proposed model. • In this paper, effective factors of DEP problem are incorporated as a multi-objective model. • In this paper, three new algorithms HSA, IHSA and SGHSA are proposed. • Results obtained by the proposed SGHSA algorithm are better than others

  9. Advanced Query and Data Mining Capabilities for MaROS

    Science.gov (United States)

    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

  10. Microcarrier-based expansion process for hMSCs with high vitality and undifferentiated characteristics

    DEFF Research Database (Denmark)

    Elseberg, Christiane L; Leber, Jasmin; Salzig, Denise

    2012-01-01

    For cell therapy, a high biomass of human mesenchymal stem cells (hMSCs) is required for clinical applications, such as in the form of encapsulated implants. An easy and reproducible microcarrier-based stirred tank reactor cultivation process for hMSCs in 1.68 L scale is described. To avoid medium...... changes, studies comparing high-glucose DMEM (DMEM-HG) with low-glucose EMEM were performed showing that high-glucose medium has positive effects on cell proliferation and that cell differentiability remains. Studies on the inoculation strategy and cell density, carrier concentration, volume, and stirrer....../L. For the described reactor system, a stirrer speed of 120 rpm for the inoculation process and a daily increase of 10 rpm up to 160 rpm were found to be suitable. Process reproducibility was shown by 3 repeated cultivations at the determined set of parameters allowing high biomass values of up to 7×10⁸ cells per...

  11. Stepwise expansion of evidence-based care is needed for mental health reform.

    Science.gov (United States)

    McGorry, Patrick D; Hamilton, Matthew P

    2016-05-16

    Mortality from mental illnesses is increasing and, because they frequently occur early in the life cycle, they are the largest source of disability and reduced economic productivity of all non-communicable diseases. Successful mental health reform can reduce the mortality, morbidity, growing welfare costs and losses in economic productivity caused by mental illness. The government has largely adopted the recommendations of the National Mental Health Commission focusing on early intervention and stepwise care and will implement a reform plan that involves devolving commissioning of federally funded mental health services to primary health networks, along with a greater emphasis on e-mental health. Stepwise expanded investment in and structural support (data collection, evaluation, model fidelity, workforce training) for evidence-based care that rectifies high levels of undertreatment are essential for these reforms to succeed. However, the reforms are currently constrained by a cost-containment policy framework that envisages no additional funding. The early intervention reform aim requires financing for the next stage of development of Australia's youth mental health system, rather than redirecting funds from existing evidence-based programs. People with complex, enduring mental disorders need more comprehensive care. In the context of the National Disability Insurance Scheme, there is a risk that these already seriously underserved patients may paradoxically receive a reduction in coverage. E-health has a key role to play at all stages of illness but must be integrated in a complementary way, rather than as a barrier to access. Research and evaluation are the keys to cost-effective, sustainable reform.

  12. Simulation of expansion in cement based materials subjected to external sulfate attack

    Directory of Open Access Journals (Sweden)

    O.A. Hodhod

    2014-03-01

    Full Text Available The standard test for length change in hydraulic-cement mortars exposed to sulfate solution, ASTM C1012-95, has been widely used by researchers to study the sulfate resistance of cement based materials. However, there are deficiencies in this test method including lengthy measuring period, insensitivity of the measurement tool to sulfate attack, effect of curing and pH change. So, in this study, a model will be built by artificial neural networks (ANNs to simulate this test and overcome these defects. This model will deal with different types of cement in the presence of blast-furnace slag (GGBFS or fly ash (PFA. From the results of simulations, it is possible to understand the impact of cement chemistry and these two types of additions on resistance of sulfate attack more readily, faster, and accurately. Such an understanding improves the decision making process in every stage of construction and maintenance and will help in better administration of resources.

  13. The I4 Online Query Tool for Earth Observations Data

    Science.gov (United States)

    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

  14. Genetic Code Expansion- and Click Chemistry-Based Site-Specific Protein Labeling for Intracellular DNA-PAINT Imaging.

    Science.gov (United States)

    Nikić-Spiegel, Ivana

    2018-01-01

    Super-resolution microscopy allows imaging of cellular structures at nanometer resolution. This comes with a demand for small labels which can be attached directly to the structures of interest. In the context of protein labeling, one way to achieve this is by using genetic code expansion (GCE) and click chemistry. With GCE, small labeling handles in the form of noncanonical amino acids (ncAAs) are site-specifically introduced into a target protein. In a subsequent step, these amino acids can be directly labeled with small organic dyes by click chemistry reactions. Click chemistry labeling can also be combined with other methods, such as DNA-PAINT in which a "clickable" oligonucleotide is first attached to the ncAA-bearing target protein and then labeled with complementary fluorescent oligonucleotides. This protocol will cover both aspects: I describe (1) how to encode ncAAs and perform intracellular click chemistry-based labeling with an improved GCE system for eukaryotic cells and (2) how to combine click chemistry-based labeling with DNA-PAINT super-resolution imaging. As an example, I show click-PAINT imaging of vimentin and low-abundance nuclear protein, nucleoporin 153.

  15. A Taylor Expansion-Based Adaptive Design Strategy for Global Surrogate Modeling With Applications in Groundwater Modeling

    Science.gov (United States)

    Mo, Shaoxing; Lu, Dan; Shi, Xiaoqing; Zhang, Guannan; Ye, Ming; Wu, Jianfeng; Wu, Jichun

    2017-12-01

    Global sensitivity analysis (GSA) and uncertainty quantification (UQ) for groundwater modeling are challenging because of the model complexity and significant computational requirements. To reduce the massive computational cost, a cheap-to-evaluate surrogate model is usually constructed to approximate and replace the expensive groundwater models in the GSA and UQ. Constructing an accurate surrogate requires actual model simulations on a number of parameter samples. Thus, a robust experimental design strategy is desired to locate informative samples so as to reduce the computational cost in surrogate construction and consequently to improve the efficiency in the GSA and UQ. In this study, we develop a Taylor expansion-based adaptive design (TEAD) that aims to build an accurate global surrogate model with a small training sample size. TEAD defines a novel hybrid score function to search informative samples, and a robust stopping criterion to terminate the sample search that guarantees the resulted approximation errors satisfy the desired accuracy. The good performance of TEAD in building global surrogate models is demonstrated in seven analytical functions with different dimensionality and complexity in comparison to two widely used experimental design methods. The application of the TEAD-based surrogate method in two groundwater models shows that the TEAD design can effectively improve the computational efficiency of GSA and UQ for groundwater modeling.

  16. A Conceptual Framework for the Expansion of Behavioral Interventions for Youth Obesity: A Family-Based Mindful Eating Approach.

    Science.gov (United States)

    Dalen, Jeanne; Brody, Janet L; Staples, Julie K; Sedillo, Donna

    2015-10-01

    Currently, over 30% of US youth are overweight and 1 in 6 have metabolic syndrome, making youth obesity one of the major global health challenges of the 21st century. Few enduring treatment strategies have been identified in youth populations, and the majority of standard weight loss programs fail to adequately address the impact of psychological factors on eating behavior and the beneficial contribution of parental involvement in youth behavior change. A critical need exists to expand treatment development efforts beyond traditional education and cognitive-behavioral programs and explore alternative treatment models for youth obesity. Meditation-based mindful eating programs represent a unique and novel scientific approach to the current youth obesity epidemic given that they address key psychological variables affecting weight. The recent expansion of mindfulness programs to include family relationships shows the immense potential for broadening the customarily individual focus of this intervention to include contextual factors thought to influence youth health outcomes. This article provides an overview of how both mindful eating and family systems theory fits within a conceptual framework in order to guide development of a comprehensive family-based mindful eating program for overweight youth.

  17. Efficient Partitioning of Large Databases without Query Statistics

    Directory of Open Access Journals (Sweden)

    Shahidul Islam KHAN

    2016-11-01

    Full Text Available An efficient way of improving the performance of a database management system is distributed processing. Distribution of data involves fragmentation or partitioning, replication, and allocation process. Previous research works provided partitioning based on empirical data about the type and frequency of the queries. These solutions are not suitable at the initial stage of a distributed database as query statistics are not available then. In this paper, I have presented a fragmentation technique, Matrix based Fragmentation (MMF, which can be applied at the initial stage as well as at later stages of distributed databases. Instead of using empirical data, I have developed a matrix, Modified Create, Read, Update and Delete (MCRUD, to partition a large database properly. Allocation of fragments is done simultaneously in my proposed technique. So using MMF, no additional complexity is added for allocating the fragments to the sites of a distributed database as fragmentation is synchronized with allocation. The performance of a DDBMS can be improved significantly by avoiding frequent remote access and high data transfer among the sites. Results show that proposed technique can solve the initial partitioning problem of large distributed databases.

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

    Science.gov (United States)

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

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

    Directory of Open Access Journals (Sweden)

    S. Sadesh

    2015-01-01

    Full Text Available 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.

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

    Science.gov (United States)

    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.

  1. Ultra-wideband pose detection system for boom-type roadheader based on Caffery transform and Taylor series expansion

    Science.gov (United States)

    Fu, Shichen; Li, Yiming; Zhang, Minjun; Zong, Kai; Cheng, Long; Wu, Miao

    2018-01-01

    To realize unmanned pose detection of a coalmine boom-type roadheader, an ultra-wideband (UWB) pose detection system (UPDS) for a roadheader is designed, which consists of four UWB positioning base stations and three roadheader positioning nodes. The positioning base stations are used in turn to locate the positioning nodes of the roadheader fuselage. Using 12 sets of distance measurement information, a time-of-arrival (TOA) positioning model is established to calculate the 3D coordinates of three positioning nodes of the roadheader fuselage, and the three attitude angles (heading, pitch, and roll angles) of the roadheader fuselage are solved. A range accuracy experiment of a UWB P440 module was carried out in a narrow and closed tunnel, and the experiment data show that the mean error and standard deviation of the module can reach below 2 cm. Based on the TOA positioning model of the UPDS, we propose a fusion-positioning algorithm based on a Caffery transform and Taylor series expansion (CTFPA). We derived the complete calculation process, designed a flowchart, and carried out a simulation of CTFPA in MATLAB, comparing 1000 simulated positioning nodes of CTFPA and the Caffery positioning algorithm (CPA) for a 95 m long tunnel. The positioning error field of the tunnel was established, and the influence of the spatial variation on the positioning accuracy of CPA and CTFPA was analysed. The simulation results show that, compared with CPA, the positioning accuracy of CTFPA is clearly improved, and the accuracy of each axis can reach more than 5 mm. The accuracy of the X-axis is higher than that of the Y- and Z-axes. In section X-Y of the tunnel, the root mean square error (RMSE) contours of CTFPA are clear and orderly, and with an increase in the measuring distance, RMSE increases linearly. In section X-Z, the RMSE contours are concentric circles, and the variation ratio is nonlinear.

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

    Directory of Open Access Journals (Sweden)

    Toni U Wagner

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

  3. Sharing-aware horizontal partitioning for exploiting correlations during query processing

    DEFF Research Database (Denmark)

    Tzoumas, Kostas; Deshpande, Amol; Jensen, Christian S.

    2010-01-01

    Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each partition having substantially different statistical characteristics. It is very compelling to discover such data...... with a routing-based query execution engine based on eddies [1]. Eddies naturally encapsulate horizontal partitioning and maximal state sharing across multiple plans. We define the notion of a conditional join plan, a novel representation of the search space that enables us to address the problem in a principled...

  4. Empirical modeling of single-wake advection and expansion using full-scale pulsed lidar-based measurements

    DEFF Research Database (Denmark)

    Machefaux, Ewan; Larsen, Gunner Chr.; Troldborg, Niels

    2015-01-01

    and to obtain an estimate of the wake expansion in a fixed frame of reference. A comparison shows good agreement between the measured average expansion and the Computational Fluid Dynamics (CFD) large eddy simulation–actuator line computations. Frandsen’s expansion model seems to predict the wake expansion......In the present paper, single-wake dynamics have been studied both experimentally and numerically. The use of pulsed lidar measurements allows for validation of basic dynamic wake meandering modeling assumptions. Wake center tracking is used to estimate the wake advection velocity experimentally...... fairly well in the far wake but lacks accuracy in the outer region of the near wake. An empirical relationship, relating maximum wake induction and wake advection velocity, is derived and linked to the characteristics of a spherical vortex structure. Furthermore, a new empirical model for single...

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

    Science.gov (United States)

    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.

  6. Efficient pricing of Asian options under Lévy processes based on Fourier cosine expansions Part I : European-style products

    NARCIS (Netherlands)

    Zhang, B.; Oosterlee, C.W.

    2011-01-01

    We propose an efficient pricing method for arithmetic, and geometric, Asian options under Levy processes, based on Fourier cosine expansions and Clenshaw–Curtis quadrature. The pricing method is developed for both European–style and American–style Asian options, and for discretely and continuously

  7. Efficient pricing of Asian options under Lévy processes based on Fourier cosine expansions. Part II. Early-exercise features and GPU implementation

    NARCIS (Netherlands)

    Zhang, B.; Van der Weide, J.A.M.; Oosterlee, C.W.

    2012-01-01

    In this article, we propose an efficient pricing method for Asian options with early–exercise features. It is based on a two–dimensional integration and a backward recursion of the Fourier coefficients, in which several numerical techniques, like Fourier cosine expansions, Clenshaw–Curtis quadrature

  8. Pre-expansion before risk reducing mastectomy combined with lipomodelling to enhance results from implant based reconstruction.

    Science.gov (United States)

    Katerinaki, E; Sircar, T; Fatah, F

    2012-02-01

    Implant based breast reconstruction after risk reducing mastectomy (RRM) is challenging as implants are inadequately covered in their lower pole. Also complication rates with one stage procedures are significant. We describe a novel method of pre-expansion by inserting subpectoral anatomical expandable implants to prepare the breast mound before RRM is carried out. Lipomodelling is later used to enhance the overall result of the reconstruction. Six patients who were BRCA 1 mutation carriers requested bilateral RRM. Median age was 31. All were non-smokers. Anatomical expandable implants were inserted via an inframammary incision and were expanded in the next two months. RRM was carried out 6-13 months later and was followed by lipomodelling seven months afterwards. Four patients had a nipple sparing mastectomy. In three cases access was via the previous inframammary scar. In all cases complete implant cover had been achieved. There were no early postoperative complications but one patient has developed grade III capsular contracture on the side of previous wide local tumour excision and radiotherapy. Five patients have so far undergone post-mastectomy lipomodelling to improve breast contour. In conclusion, we believe that our technique provides better aesthetic results with reduced complication rates for these patients. Copyright © 2011 British Association of Plastic, Reconstructive and Aesthetic Surgeons. Published by Elsevier Ltd. All rights reserved.

  9. Policy Research Using Agent-Based Modeling to Assess Future Impacts of Urban Expansion into Farmlands and Forests

    Directory of Open Access Journals (Sweden)

    Michael R. Guzy

    2008-06-01

    Full Text Available The expansion of urban land uses into farmlands and forests requires an assessment of future ecological impacts. Spatially explicit agent-based models can represent the changes in resilience and ecological services that result from different land-use policies. When modeling complex adaptive systems, both the methods used to interpret results and the standards of rigor used to judge adequacy are complicated and require additional research. Recent studies suggest that it would be appropriate to use these models as an extension of exploratory analysis. This type of analysis generates ensembles of alternate plausible representations of future system conditions. User expertise steers interactive, stepwise system exploration toward inductive reasoning about potential changes to the system. In this study, we develop understanding of the potential alternative futures for a social-ecological system by way of successive simulations that test variations in the types and numbers of policies. The model addresses the agricultural-urban interface and the preservation of ecosystem services. The landscape analyzed is at the junction of the McKenzie and Willamette Rivers adjacent to the cities of Eugene and Springfield in Lane County, Oregon. Our exploration of alternative future scenarios suggests that policies that constrain urban growth and create incentives for farming and forest enterprises to preserve and enhance habitat can protect ecosystem resilience and services.

  10. Para-hydrogen and helium cluster size distributions in free jet expansions based on Smoluchowski theory with kernel scaling.

    Science.gov (United States)

    Kornilov, Oleg; Toennies, J Peter

    2015-02-21

    The size distribution of para-H2 (pH2) clusters produced in free jet expansions at a source temperature of T0 = 29.5 K and pressures of P0 = 0.9-1.96 bars is reported and analyzed according to a cluster growth model based on the Smoluchowski theory with kernel scaling. Good overall agreement is found between the measured and predicted, Nk = A k(a) e(-bk), shape of the distribution. The fit yields values for A and b for values of a derived from simple collision models. The small remaining deviations between measured abundances and theory imply a (pH2)k magic number cluster of k = 13 as has been observed previously by Raman spectroscopy. The predicted linear dependence of b(-(a+1)) on source gas pressure was verified and used to determine the value of the basic effective agglomeration reaction rate constant. A comparison of the corresponding effective growth cross sections σ11 with results from a similar analysis of He cluster size distributions indicates that the latter are much larger by a factor 6-10. An analysis of the three body recombination rates, the geometric sizes and the fact that the He clusters are liquid independent of their size can explain the larger cross sections found for He.

  11. Para-hydrogen and helium cluster size distributions in free jet expansions based on Smoluchowski theory with kernel scaling

    Energy Technology Data Exchange (ETDEWEB)

    Kornilov, Oleg; Toennies, J. Peter [Max-Planck-Institut für Dynamik und Selbstorganisation, Am Fassberg 17, 37077 Göttingen (Germany)

    2015-02-21

    The size distribution of para-H{sub 2} (pH{sub 2}) clusters produced in free jet expansions at a source temperature of T{sub 0} = 29.5 K and pressures of P{sub 0} = 0.9–1.96 bars is reported and analyzed according to a cluster growth model based on the Smoluchowski theory with kernel scaling. Good overall agreement is found between the measured and predicted, N{sub k} = A k{sup a} e{sup −bk}, shape of the distribution. The fit yields values for A and b for values of a derived from simple collision models. The small remaining deviations between measured abundances and theory imply a (pH{sub 2}){sub k} magic number cluster of k = 13 as has been observed previously by Raman spectroscopy. The predicted linear dependence of b{sup −(a+1)} on source gas pressure was verified and used to determine the value of the basic effective agglomeration reaction rate constant. A comparison of the corresponding effective growth cross sections σ{sub 11} with results from a similar analysis of He cluster size distributions indicates that the latter are much larger by a factor 6-10. An analysis of the three body recombination rates, the geometric sizes and the fact that the He clusters are liquid independent of their size can explain the larger cross sections found for He.

  12. Atomistic Modeling of the Negative Thermal Expansion in δ- Plutonium  Based on the Two-State Description

    Directory of Open Access Journals (Sweden)

    Steven M. Valone

    2012-06-01

    Full Text Available The δ phase  of plutonium with the fcc structure exhibits an unusual negative thermal expansion (NTE over its narrow  temperature range of stability, 593–736 K. An accurate description  of the anomalous high-temperature volume effect of plutonium  goes beyond the current capability  of electronic-structure  calculations.  We propose an atomistic scheme to model the thermodynamic properties of δ-Pu based on the two-state model of Weiss for the Invar alloys, inspired by the simple free-energy analysis previously conducted by Lawson et al. The two-state mechanism is incorporated into the atomistic description of a many-body  interacting  system.  Two modified  embedded atom method potentials are employed to represent the binding energies of two competing  electronic  states in δ-Pu. We demonstrate how the NTE takes place in δ-Pu by means of Monte Carlo simulations implemented with the two-state mechanism.

  13. Performance analysis of a direct expansion air dehumidification system combined with membrane-based total heat recovery

    Energy Technology Data Exchange (ETDEWEB)

    Liang, Cai-Hang; Zhang, Li-Zhi; Pei, Li-Xia [Key Laboratory of Enhanced Heat Transfer and Energy Conservation of Education Ministry, School of Chemistry and Chemical Engineering, South China University of Technology, Guangzhou 510640 (China)

    2010-09-15

    A direct expansion (DX) air dehumidification system is an efficient way to supply fresh and dry air to a built environment. It plays a key role in preventing the spread of respiratory disease like Swine flu (H1N1). To improve the efficiency of a conventional DX system in hot and humid regions, a new system of DX in combination with a membrane-based total heat exchanger is proposed. Air is supplied with dew points. A detailed mathematical modeling is performed. A cell-by-cell simulation technique is used to simulate its performances. A real prototype is built in our laboratory in South China University of Technology to validate the model. The effects of inlet air humidity and temperature, evaporator and condenser sizes on the system performance are investigated. The results indicate that the model can predict the system accurately. Compared to a conventional DX system, the air dehumidification rate (ADR) of the novel system is 0.5 times higher, and the coefficient of performance (COP) is 1 times higher. Furthermore, the system performs well even under harsh hot and humid weather conditions. (author)

  14. On summation of perturbation expansions

    International Nuclear Information System (INIS)

    Horzela, A.

    1985-04-01

    The problem of the restoration of physical quantities defined by divergent perturbation expansions is analysed. The Pad'e and Borel summability is proved for alternating perturbation expansions with factorially growing coefficients. The proof is based on the methods of the classical moments theory. 17 refs. (author)

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

    Science.gov (United States)

    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.

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

    Directory of Open Access Journals (Sweden)

    Ramalingam Gomathi

    2014-01-01

    Full Text Available 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.

  17. Structured Query Translation in Peer to Peer Database Sharing Systems

    Directory of Open Access Journals (Sweden)

    Mehedi Masud

    2009-10-01

    Full Text Available This paper presents a query translation mechanism between heterogeneous peers in Peer to Peer Database Sharing Systems (PDSSs. A PDSS combines a database management system with P2P functionalities. The local databases on peers are called peer databases. In a PDSS, each peer chooses its own data model and schema and maintains data independently without any global coordinator. One of the problems in such a system is translating queries between peers, taking into account both the schema and data heterogeneity. Query translation is the problem of rewriting a query posed in terms of one peer schema to a query in terms of another peer schema. This paper proposes a query translation mechanism between peers where peers are acquainted in data sharing systems through data-level mappings for sharing data.

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

    Science.gov (United States)

    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.

  19. Evaluation of Sub Query Performance in SQL Server

    Directory of Open Access Journals (Sweden)

    Oktavia Tanty

    2014-03-01

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

  20. Development of a code in three-dimensional cylindrical geometry based on analytic function expansion nodal (AFEN) method

    International Nuclear Information System (INIS)

    Lee, Joo Hee

    2006-02-01

    There is growing interest in developing pebble bed reactors (PBRs) as a candidate of very high temperature gas-cooled reactors (VHTRs). Until now, most existing methods of nuclear design analysis for this type of reactors are base on old finite-difference solvers or on statistical methods. But for realistic analysis of PBRs, there is strong desire of making available high fidelity nodal codes in three-dimensional (r,θ,z) cylindrical geometry. Recently, the Analytic Function Expansion Nodal (AFEN) method developed quite extensively in Cartesian (x,y,z) geometry and in hexagonal-z geometry was extended to two-group (r,z) cylindrical geometry, and gave very accurate results. In this thesis, we develop a method for the full three-dimensional cylindrical (r,θ,z) geometry and implement the method into a code named TOPS. The AFEN methodology in this geometry as in hexagonal geometry is 'robus' (e.g., no occurrence of singularity), due to the unique feature of the AFEN method that it does not use the transverse integration. The transverse integration in the usual nodal methods, however, leads to an impasse, that is, failure of the azimuthal term to be transverse-integrated over r-z surface. We use 13 nodal unknowns in an outer node and 7 nodal unknowns in an innermost node. The general solution of the node can be expressed in terms of that nodal unknowns, and can be updated using the nodal balance equation and the current continuity condition. For more realistic analysis of PBRs, we implemented em Marshak boundary condition to treat the incoming current zero boundary condition and the partial current translation (PCT) method to treat voids in the core. The TOPS code was verified in the various numerical tests derived from Dodds problem and PBMR-400 benchmark problem. The results of the TOPS code show high accuracy and fast computing time than the VENTURE code that is based on finite difference method (FDM)

  1. Adverse Reactions Associated With Cannabis Consumption as Evident From Search Engine Queries.

    Science.gov (United States)

    Yom-Tov, Elad; Lev-Ran, Shaul

    2017-10-26

    Cannabis is one of the most widely used psychoactive substances worldwide, but adverse drug reactions (ADRs) associated with its use are difficult to study because of its prohibited status in many countries. Internet search engine queries have been used to investigate ADRs in pharmaceutical drugs. In this proof-of-concept study, we tested whether these queries can be used to detect the adverse reactions of cannabis use. We analyzed anonymized queries from US-based users of Bing, a widely used search engine, made over a period of 6 months and compared the results with the prevalence of cannabis use as reported in the US National Survey on Drug Use in the Household (NSDUH) and with ADRs reported in the Food and Drug Administration's Adverse Drug Reporting System. Predicted prevalence of cannabis use was estimated from the fraction of people making queries about cannabis, marijuana, and 121 additional synonyms. Predicted ADRs were estimated from queries containing layperson descriptions to 195 ICD-10 symptoms list. Our results indicated that the predicted prevalence of cannabis use at the US census regional level reaches an R 2 of .71 NSDUH data. Queries for ADRs made by people who also searched for cannabis reveal many of the known adverse effects of cannabis (eg, cough and psychotic symptoms), as well as plausible unknown reactions (eg, pyrexia). These results indicate that search engine queries can serve as an important tool for the study of adverse reactions of illicit drugs, which are difficult to study in other settings. ©Elad Yom-Tov, Shaul Lev-Ran. Originally published in JMIR Public Health and Surveillance (http://publichealth.jmir.org), 26.10.2017.

  2. A System for Conceptual Pathway Finding and Deductive Querying

    DEFF Research Database (Denmark)

    Andreasen, Troels; Styltsvig, Henrik Bulskov; Fischer Nilsson, Jørgen

    . The system applies a graph form computed from the input natural logic sentences. The graph form generalizes the usual partial-order ontological sub-class structures by accommodation of affirmative sentences comprising recursive phrase structures. In this paper we focus on the logical inference rules......We describe principles and design of a system for knowledge bases applying a natural logic. Natural logics are forms of logic which appear as stylized fragments of natural language sentences. Accordingly, such knowledge base sentences can be read and understood directly by a domain expert...... for extending the concept graph form enabling deductive querying as well as computation of pathways between the concepts mentioned in the sentences....

  3. A System for Conceptual Pathway Finding and Deductive Querying

    DEFF Research Database (Denmark)

    Andreasen, Troels; Bulskov, Henrik; Nilsson, Jørgen Fischer

    2015-01-01

    . The system applies a graph form computed from the input natural logic sentences. The graph form generalizes the usual partial-order ontological sub-class structures by accommodation of affirmative sentences comprising recursive phrase structures. In this paper we focus on the logical inference rules......We describe principles and design of a system for knowledge bases applying a natural logic. Natural logics are forms of logic which appear as stylized fragments of natural language sentences. Accordingly, such knowledge base sentences can be read and understood directly by a domain expert...... for extending the concept graph form enabling deductive querying as well as computation of pathways between the concepts mentioned in the sentences....

  4. Group-by Skyline Query Processing in Relational Engines

    DEFF Research Database (Denmark)

    Yiu, Man Lung; Luk, Ming-Hay; Lo, Eric

    2009-01-01

    The skyline operator was first proposed in 2001 for retrieving interesting tuples from a dataset. Since then, 100+ skyline-related papers have been published; however, we discovered that one of the most intuitive and practical type of skyline queries, namely, group-by skyline queries remains...... the missing cost model for the BBS algorithm. Experimental results show that our techniques are able to devise the best query plans for a variety of group-by skyline queries. Our focus is on algorithms that can be directly implemented in today's commercial database systems without the addition of new access...

  5. The Query Complexity of Finding a Hidden Permutation

    DEFF Research Database (Denmark)

    Afshani, Peyman; Afrawal, Manindra; Benjamin, Doerr

    2012-01-01

    We study the query complexity of determining a hidden permutation. More specifically, we study the problem of learning a secret (z) consisting of a binary string z of length n and a permutation of [n]. The secret must be unveiled by asking queries x01n , and for each query asked, we are returned ...... applications in many other query complexity problems.......We study the query complexity of determining a hidden permutation. More specifically, we study the problem of learning a secret (z) consisting of a binary string z of length n and a permutation of [n]. The secret must be unveiled by asking queries x01n , and for each query asked, we are returned...... the score fz(x) defined as fz(x):=maxi[0n]ji:z(j)=x(j); i.e., the length of the longest common prefix of x and z with respect to . The goal is to minimize the number of queries asked. Our main result are matching upper and lower bounds for this problem, both for deterministic and randomized query schemes...

  6. The effect of query complexity on Web searching results

    Directory of Open Access Journals (Sweden)

    B.J. Jansen

    2000-01-01

    Full Text Available This paper presents findings from a study of the effects of query structure on retrieval by Web search services. Fifteen queries were selected from the transaction log of a major Web search service in simple query form with no advanced operators (e.g., Boolean operators, phrase operators, etc. and submitted to 5 major search engines - Alta Vista, Excite, FAST Search, Infoseek, and Northern Light. The results from these queries became the baseline data. The original 15 queries were then modified using the various search operators supported by each of the 5 search engines for a total of 210 queries. Each of these 210 queries was also submitted to the applicable search service. The results obtained were then compared to the baseline results. A total of 2,768 search results were returned by the set of all queries. In general, increasing the complexity of the queries had little effect on the results with a greater than 70% overlap in results, on average. Implications for the design of Web search services and directions for future research are discussed.

  7. PAQ: Persistent Adaptive Query Middleware for Dynamic Environments

    Science.gov (United States)

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

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

  8. Efficient Processing of Multiple DTW Queries in Time Series Databases

    DEFF Research Database (Denmark)

    Kremer, Hardy; Günnemann, Stephan; Ivanescu, Anca-Maria

    2011-01-01

    Dynamic Time Warping (DTW) is a widely used distance measure for time series that has been successfully used in science and many other application domains. As DTW is computationally expensive, there is a strong need for efficient query processing algorithms. Such algorithms exist for single queries....... In many of today’s applications, however, large numbers of queries arise at any given time. Existing DTW techniques do not process multiple DTW queries simultaneously, a serious limitation which slows down overall processing. In this paper, we propose an efficient processing approach for multiple DTW...

  9. Efficient Processing of Continuous Skyline Query over Smarter Traffic Data Stream for Cloud Computing

    Directory of Open Access Journals (Sweden)

    Wang Hanning

    2013-01-01

    Full Text Available The analyzing and processing of multisource real-time transportation data stream lay a foundation for the smart transportation's sensibility, interconnection, integration, and real-time decision making. Strong computing ability and valid mass data management mode provided by the cloud computing, is feasible for handling Skyline continuous query in the mass distributed uncertain transportation data stream. In this paper, we gave architecture of layered smart transportation about data processing, and we formalized the description about continuous query over smart transportation data Skyline. Besides, we proposed mMR-SUDS algorithm (Skyline query algorithm of uncertain transportation stream data based on micro-batchinMap Reduce based on sliding window division and architecture.

  10. SeqWare Query Engine: storing and searching sequence data in the cloud

    Directory of Open Access Journals (Sweden)

    Merriman Barry

    2010-12-01

    Full Text Available Abstract Background Since the introduction of next-generation DNA sequencers the rapid increase in sequencer throughput, and associated drop in costs, has resulted in more than a dozen human genomes being resequenced over the last few years. These efforts are merely a prelude for a future in which genome resequencing will be commonplace for both biomedical research and clinical applications. The dramatic increase in sequencer output strains all facets of computational infrastructure, especially databases and query interfaces. The advent of cloud computing, and a variety of powerful tools designed to process petascale datasets, provide a compelling solution to these ever increasing demands. Results In this work, we present the SeqWare Query Engine which has been created using modern cloud computing technologies and designed to support databasing information from thousands of genomes. Our backend implementation was built using the highly scalable, NoSQL HBase database from the Hadoop project. We also created a web-based frontend that provides both a programmatic and interactive query interface and integrates with widely used genome browsers and tools. Using the query engine, users can load and query variants (SNVs, indels, translocations, etc with a rich level of annotations including coverage and functional consequences. As a proof of concept we loaded several whole genome datasets including the U87MG cell line. We also used a glioblastoma multiforme tumor/normal pair to both profile performance and provide an example of using the Hadoop MapReduce framework within the query engine. This software is open source and freely available from the SeqWare project (http://seqware.sourceforge.net. Conclusions The SeqWare Query Engine provided an easy way to make the U87MG genome accessible to programmers and non-programmers alike. This enabled a faster and more open exploration of results, quicker tuning of parameters for heuristic variant calling filters

  11. SeqWare Query Engine: storing and searching sequence data in the cloud.

    Science.gov (United States)

    O'Connor, Brian D; Merriman, Barry; Nelson, Stanley F

    2010-12-21

    Since the introduction of next-generation DNA sequencers the rapid increase in sequencer throughput, and associated drop in costs, has resulted in more than a dozen human genomes being resequenced over the last few years. These efforts are merely a prelude for a future in which genome resequencing will be commonplace for both biomedical research and clinical applications. The dramatic increase in sequencer output strains all facets of computational infrastructure, especially databases and query interfaces. The advent of cloud computing, and a variety of powerful tools designed to process petascale datasets, provide a compelling solution to these ever increasing demands. In this work, we present the SeqWare Query Engine which has been created using modern cloud computing technologies and designed to support databasing information from thousands of genomes. Our backend implementation was built using the highly scalable, NoSQL HBase database from the Hadoop project. We also created a web-based frontend that provides both a programmatic and interactive query interface and integrates with widely used genome browsers and tools. Using the query engine, users can load and query variants (SNVs, indels, translocations, etc) with a rich level of annotations including coverage and functional consequences. As a proof of concept we loaded several whole genome datasets including the U87MG cell line. We also used a glioblastoma multiforme tumor/normal pair to both profile performance and provide an example of using the Hadoop MapReduce framework within the query engine. This software is open source and freely available from the SeqWare project (http://seqware.sourceforge.net). The SeqWare Query Engine provided an easy way to make the U87MG genome accessible to programmers and non-programmers alike. This enabled a faster and more open exploration of results, quicker tuning of parameters for heuristic variant calling filters, and a common data interface to simplify development of

  12. The impact of green logistic based on financial economic, social and environment activities on sustainable monetary expansion indicators of Oman

    Directory of Open Access Journals (Sweden)

    Faris Alshubiri

    2017-05-01

    Full Text Available Purpose: The purpose of this study is to examine green logistic activities by three axes (financial economic, social and environment activities and how these activities affect on sustainable monetary expansion indicators as an evidence of Sultanate of Oman. Design/methodology/approach: This study began by definition elements of logistic green and how evolution of this concept in recent years. This concept analyzed after survey of previous studies on green logistic. The independent variables of green logistic  are includes of three components of financial economic , social and environment and applies these components to clarify the impact on expansionary monetary policy indicators ( broad , narrow and reserve money as a important signals  in determining a country's economy. This study used data published in statistical annual report of central bank of Oman as representative of country economic of sultanate of Oman from the period 2008 to 2015.  Findings: The results found two variables of government support to electricity sector (GSE and subsidy on soft loans to private sector and housing (SSLPH based on environment activities are statistical significant 1% and 5%. Only one variable of transport and communication (TC in financial economic activates is statistical significant at 1% and 5% , but all variables community, social and personal (CSP , cultural and religious affairs (CRA and social security and welfare (SSW in social activities are statistical significant at 1% 5% and 10% , finally , also the multiple regression test run of all variables of green logistics activities and each monetary expansion indicators and found there are a statistical significant at 1% and 5%, .The study recommends that should be attention with financial economic activities as a quantitative standard contributes to build the green logistic by diagnosed the priorities and existing economic and financial system that contributes of  sustainable development system in

  13. The part of acoustic phonons in the negative thermal expansion of the layered structures and nanotubes based on them

    International Nuclear Information System (INIS)

    Eremenko, V.V.; Sirenko, V.A.; Dolbin, A.V.; Gospodarev, I.A.; Syrkin, E.S.; Feodos'ev, S.B.; Bondar', I.S.; Sirenko, A.F.; Minakova, K.A.

    2016-01-01

    A negative linear thermal expansion observed experimentally in a number of crystalline compounds with a complicated lattice and anisotropic interaction between atoms. The nature of negative linear thermal expansion along a number of directions is explained on the basis of calculations which were carried out at a microscopic level. We analyze anomalies in the temperature dependence of the coefficients of linear thermal expansion (the LTEC) along different directions: in layered crystals, formed as a monoatomic layers (graphite and carbon nanofilms) and multilayer ''sand-wiches'' (dichalcogenides of transition metals); in multilayer crystal structures such as high-temperature superconductors in which the anisotropy of the interatomic interaction is not saved in the long-range order; in carbon nanotubes. The results of theoretical calculations are compared with the data of x-ray, neutron diffraction and dilatometric measurements.

  14. Simplifying Bridge Expansion Joint Design and Maintenance

    Science.gov (United States)

    2011-10-19

    This report presents a study focused on identifying the most durable expansion joints for the South : Carolina Department of Transportation. This is performed by proposing a degradation model for the : expansion joints and updating it based on bridge...

  15. Microscopically-Based Energy Density Functionals for Nuclei Using the Density Matrix Expansion. I: Implementation and Pre-Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Stoitsov, M. V. [University of Tennessee, Knoxville (UTK) & Oak Ridge National Laboratory (ORNL); Kortelainen, Erno M [ORNL; Bogner, S. K. [Michigan State University, East Lansing; Duguet, T. [CEA, Saclay, France; Furnstahl, R. J. [Ohio State University; Gebremariam, B. [Michigan State University, East Lansing; Schunck, N. [University of Tennessee, Knoxville (UTK) & Oak Ridge National Laboratory (ORNL)

    2010-01-01

    In a recent series of papers, Gebremariam, Bogner, and Duguet derived a microscopically-based nuclear energy density functional by applying the Density Matrix Expansion (DME) to the Hartree-Fock energy obtained from chiral effective field theory (EFT) two- and three-nucleon interactions. Due to the structure of the chiral interactions, each coupling in the DME functional is given as the sum of a coupling constant arising from zero-range contact interactions and a coupling function of the density arising from the finite-range pion exchanges. Since the contact contributions have essentially the same structure as those entering empirical Skyrme functionals, a microscopically guided Skyrme phenomenology has been suggested in which the contact terms in the DME functional are released for optimization to finite-density observables to capture short-range correlation energy contributions from beyond Hartree-Fock. The present paper is the first attempt to assess the ability of the newly suggested DME functional, which has a much richer set of density dependencies than traditional Skyrme functionals, to generate sensible and stable results for nuclear applications. The results of the first proof-of-principle calculations are given, and numerous practical issues related to the implementation of the new functional in existing Skyrme codes are discussed. Using a restricted singular value decomposition (SVD) optimization procedure, it is found that the new DME functional gives numerically stable results and exhibits a small but systematic reduction in {chi}^{2} compared to standard Skyrme functionals, thus justifying its suitability for future global optimizations and large-scale calculations.

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

    Energy Technology Data Exchange (ETDEWEB)

    Gosink, Luke J. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Garth, Christoph [Univ. of California, Davis, CA (United States); Anderson, John C. [Univ. of California, Davis, CA (United States); Bethel, E. Wes [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Joy, Kenneth I. [Univ. of California, Davis, CA (United States)

    2011-03-01

    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.

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

    Science.gov (United States)

    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.

  18. Design and evaluation of a NoSQL database for storing and querying RDF data

    Directory of Open Access Journals (Sweden)

    Kanda Runapongsa Saikaew

    2014-12-01

    Full Text Available Currently the amount of web data has increased excessively. Its metadata is widely used in order to fully exploit web information resources. This causes the need for Semantic Web technology to quickly analyze such big data. Resource Description Framework (RDF is a standard for describing web resources. In this paper, we propose a method to exploit a NoSQL database, specifically MongoDB, to store and query RDF data. We choose MongoDB to represent a NoSQL database because it is one of the most popular high-performance NoSQL databases. We evaluate the proposed design and implementation by using the Berlin SPARQL Benchmark, which is one of the most widely accepted benchmarks for comparing the performance of RDF storage systems. We compare three database systems, which are Apache Jena TDB (native RDF store, MySQL (relational database, and our proposed system with MongoDB (NoSQL database. Based on the experimental results analysis, our proposed system outperforms other database systems for most queries when the data set size is small. However, for a larger data set, MongoDB performs well for queries with simple operators while MySQL offers an efficient solution for complex queries. The result of this work can provide some guideline for choosing an appropriate RDF database system and applying a NoSQL database in storing and querying RDF data.

  19. Node Query Preservation for Deterministic Linear Top-Down Tree Transducers

    Directory of Open Access Journals (Sweden)

    Kazuki Miyahara

    2013-11-01

    Full Text Available This paper discusses the decidability of node query preservation problems for XML document transformations. We assume a transformation given by a deterministic linear top-down data tree transducer (abbreviated as DLT^V and an n-ary query based on runs of a tree automaton. We say that a DLT^V Tr strongly preserves a query Q if there is a query Q' such that for every document t, the answer set of Q' for Tr(t is equal to the answer set of Q for t. Also we say that Tr weakly preserves Q if there is a query Q' such that for every t_d in the range of Tr, the answer set of Q' for t_d is equal to the union of the answer set of Q for t such that t_d = Tr(t. We show that the weak preservation problem is coNP-complete and the strong preservation problem is in 2-EXPTIME.

  20. Role of acoustic phonons in the negative thermal expansion of layered structures and nanotubes based on them

    Science.gov (United States)

    Eremenko, V. V.; Sirenko, A. F.; Sirenko, V. A.; Dolbin, A. V.; Gospodarev, I. A.; Syrkin, E. S.; Feodosyev, S. B.; Bondar, I. S.; Minakova, K. A.

    2016-05-01

    Calculations on a microscopic level are used to explain the experimentally observed negative linear thermal expansion along some directions in a number of crystalline compounds with complicated lattices and anisotropic interactions between atoms. Anomalies in the temperature dependence of the coefficient of linear thermal expansion are analyzed in layered crystals made up of monatomic layers (graphite and graphene nanofilms) and multilayer "sandwiches" (transition metal dichalcogenides), in multilayered crystal structures such as high-temperature superconductors where the anisotropy of the interatomic interactions is not conserved in the long-range order, and in graphene nanotubes. The theoretical calculations are compared with data from x-ray, neutron diffraction, and dilatometric measurements.