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.

User perspectives on query difficulty

DEFF Research Database (Denmark)

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

2011-01-01

be difficult for the system to address? (2) Are users aware of specific features in their query (e.g., domain-specificity, vagueness) that may render their query difficult for an IR system to address? A study of 420 queries from a Web search engine query log that are pre-categorised as easy, medium, hard...

Seasonal trends in sleep-disordered breathing: evidence from Internet search engine query data.

Science.gov (United States)

Ingram, David G; Matthews, Camilla K; Plante, David T

2015-03-01

The primary aim of the current study was to test the hypothesis that there is a seasonal component to snoring and obstructive sleep apnea (OSA) through the use of Google search engine query data. Internet search engine query data were retrieved from Google Trends from January 2006 to December 2012. Monthly normalized search volume was obtained over that 7-year period in the USA and Australia for the following search terms: "snoring" and "sleep apnea". Seasonal effects were investigated by fitting cosinor regression models. In addition, the search terms "snoring children" and "sleep apnea children" were evaluated to examine seasonal effects in pediatric populations. Statistically significant seasonal effects were found using cosinor analysis in both USA and Australia for "snoring" (p search term in Australia (p = 0.13). Seasonal patterns for "snoring children" and "sleep apnea children" were observed in the USA (p = 0.002 and p search volume to examine these search terms in Australia. All searches peaked in the winter or early spring in both countries, with the magnitude of seasonal effect ranging from 5 to 50 %. Our findings indicate that there are significant seasonal trends for both snoring and sleep apnea internet search engine queries, with a peak in the winter and early spring. Further research is indicated to determine the mechanisms underlying these findings, whether they have clinical impact, and if they are associated with other comorbid medical conditions that have similar patterns of seasonal exacerbation.

Seasonal trends in tinnitus symptomatology: evidence from Internet search engine query data.

Science.gov (United States)

Plante, David T; Ingram, David G

2015-10-01

The primary aim of this study was to test the hypothesis that the symptom of tinnitus demonstrates a seasonal pattern with worsening in the winter relative to the summer using Internet search engine query data. Normalized search volume for the term 'tinnitus' from January 2004 through December 2013 was retrieved from Google Trends. Seasonal effects were evaluated using cosinor regression models. Primary countries of interest were the United States and Australia. Secondary exploratory analyses were also performed using data from Germany, the United Kingdom, Canada, Sweden, and Switzerland. Significant seasonal effects for 'tinnitus' search queries were found in the United States and Australia (p search volume in the winter relative to the summer. Our findings indicate that there are significant seasonal trends for Internet search queries for tinnitus, with a zenith in winter months. Further research is indicated to determine the biological mechanisms underlying these findings, as they may provide insights into the pathophysiology of this common and debilitating medical symptom.

An end user evaluation of query formulation and results review tools in three medical meta-search engines.

Science.gov (United States)

Leroy, Gondy; Xu, Jennifer; Chung, Wingyan; Eggers, Shauna; Chen, Hsinchun

2007-01-01

Retrieving sufficient relevant information online is difficult for many people because they use too few keywords to search and search engines do not provide many support tools. To further complicate the search, users often ignore support tools when available. Our goal is to evaluate in a realistic setting when users use support tools and how they perceive these tools. We compared three medical search engines with support tools that require more or less effort from users to form a query and evaluate results. We carried out an end user study with 23 users who were asked to find information, i.e., subtopics and supporting abstracts, for a given theme. We used a balanced within-subjects design and report on the effectiveness, efficiency and usability of the support tools from the end user perspective. We found significant differences in efficiency but did not find significant differences in effectiveness between the three search engines. Dynamic user support tools requiring less effort led to higher efficiency. Fewer searches were needed and more documents were found per search when both query reformulation and result review tools dynamically adjust to the user query. The query reformulation tool that provided a long list of keywords, dynamically adjusted to the user query, was used most often and led to more subtopics. As hypothesized, the dynamic result review tools were used more often and led to more subtopics than static ones. These results were corroborated by the usability questionnaires, which showed that support tools that dynamically optimize output were preferred.

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.

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

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.

Group-by Skyline Query Processing in Relational Engines

DEFF Research Database (Denmark)

Yiu, Man Lung; Luk, Ming-Hay; Lo, Eric

2009-01-01

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

Improving Web Search for Difficult Queries

Science.gov (United States)

Wang, Xuanhui

2009-01-01

Search engines have now become essential tools in all aspects of our life. Although a variety of information needs can be served very successfully, there are still a lot of queries that search engines can not answer very effectively and these queries always make users feel frustrated. Since it is quite often that users encounter such "difficult…

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

Science.gov (United States)

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

2010-12-28

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

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)

Federated querying architecture with clinical & translational health IT application.

Science.gov (United States)

Livne, Oren E; Schultz, N Dustin; Narus, Scott P

2011-10-01

We present a software architecture that federates data from multiple heterogeneous health informatics data sources owned by multiple organizations. The architecture builds upon state-of-the-art open-source Java and XML frameworks in innovative ways. It consists of (a) federated query engine, which manages federated queries and result set aggregation via a patient identification service; and (b) data source facades, which translate the physical data models into a common model on-the-fly and handle large result set streaming. System modules are connected via reusable Apache Camel integration routes and deployed to an OSGi enterprise service bus. We present an application of our architecture that allows users to construct queries via the i2b2 web front-end, and federates patient data from the University of Utah Enterprise Data Warehouse and the Utah Population database. Our system can be easily adopted, extended and integrated with existing SOA Healthcare and HL7 frameworks such as i2b2 and caGrid.

Predicting the hand, foot, and mouth disease incidence using search engine query data and climate variables: an ecological study in Guangdong, China.

Science.gov (United States)

Du, Zhicheng; Xu, Lin; Zhang, Wangjian; Zhang, Dingmei; Yu, Shicheng; Hao, Yuantao

2017-10-06

Hand, foot, and mouth disease (HFMD) has caused a substantial burden in China, especially in Guangdong Province. Based on the enhanced surveillance system, we aimed to explore whether the addition of temperate and search engine query data improves the risk prediction of HFMD. Ecological study. Information on the confirmed cases of HFMD, climate parameters and search engine query logs was collected. A total of 1.36 million HFMD cases were identified from the surveillance system during 2011-2014. Analyses were conducted at aggregate level and no confidential information was involved. A seasonal autoregressive integrated moving average (ARIMA) model with external variables (ARIMAX) was used to predict the HFMD incidence from 2011 to 2014, taking into account temperature and search engine query data (Baidu Index, BDI). Statistics of goodness-of-fit and precision of prediction were used to compare models (1) based on surveillance data only, and with the addition of (2) temperature, (3) BDI, and (4) both temperature and BDI. A high correlation between HFMD incidence and BDI ( r =0.794, pengine query data significantly improved the prediction of HFMD. Further studies are warranted to examine whether including search engine query data also improves the prediction of other infectious diseases in other settings. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2017. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

Predicting the hand, foot, and mouth disease incidence using search engine query data and climate variables: an ecological study in Guangdong, China

Science.gov (United States)

Du, Zhicheng; Xu, Lin; Zhang, Wangjian; Zhang, Dingmei; Yu, Shicheng; Hao, Yuantao

2017-01-01

Objectives Hand, foot, and mouth disease (HFMD) has caused a substantial burden in China, especially in Guangdong Province. Based on the enhanced surveillance system, we aimed to explore whether the addition of temperate and search engine query data improves the risk prediction of HFMD. Design Ecological study. Setting and participants Information on the confirmed cases of HFMD, climate parameters and search engine query logs was collected. A total of 1.36 million HFMD cases were identified from the surveillance system during 2011–2014. Analyses were conducted at aggregate level and no confidential information was involved. Outcome measures A seasonal autoregressive integrated moving average (ARIMA) model with external variables (ARIMAX) was used to predict the HFMD incidence from 2011 to 2014, taking into account temperature and search engine query data (Baidu Index, BDI). Statistics of goodness-of-fit and precision of prediction were used to compare models (1) based on surveillance data only, and with the addition of (2) temperature, (3) BDI, and (4) both temperature and BDI. Results A high correlation between HFMD incidence and BDI (r=0.794, pmodel. Compared with the model based on surveillance data only, the ARIMAX model including BDI reached the best goodness-of-fit with an Akaike information criterion (AIC) value of −345.332, whereas the model including both BDI and temperature had the most accurate prediction in terms of the mean absolute percentage error (MAPE) of 101.745%. Conclusions An ARIMAX model incorporating search engine query data significantly improved the prediction of HFMD. Further studies are warranted to examine whether including search engine query data also improves the prediction of other infectious diseases in other settings. PMID:28988169

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.

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

Evaluating XML-Extended OLAP Queries Based on a Physical Algebra

DEFF Research Database (Denmark)

Yin, Xuepeng; Pedersen, Torben Bach

2006-01-01

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

Genetic algorithms for RDF chain query optimization

NARCIS (Netherlands)

Hogenboom, A.C.; Milea, D.V.; Frasincar, F.; Kaymak, U.; Calders, T.; Tuyls, K.; Pechenizkiy, M.

2009-01-01

The application of Semantic Web technologies in an Electronic Commerce environment implies a need for good support tools. Fast query engines are required for efficient real-time querying of large amounts of data, usually represented using RDF. We focus on optimizing a special class of SPARQL

Extracting Rankings for Spatial Keyword Queries from GPS Data

DEFF Research Database (Denmark)

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

2018-01-01

Studies suggest that many search engine queries have local intent. We consider the evaluation of ranking functions important for such queries. The key challenge is to be able to determine the “best” ranking for a query, as this enables evaluation of the results of ranking functions. We propose...

Query Classification and Study of University Students' Search Trends

Science.gov (United States)

Maabreh, Majdi A.; Al-Kabi, Mohammed N.; Alsmadi, Izzat M.

2012-01-01

Purpose: This study is an attempt to develop an automatic identification method for Arabic web queries and divide them into several query types using data mining. In addition, it seeks to evaluate the impact of the academic environment on using the internet. Design/methodology/approach: The web log files were collected from one of the higher…

Manchester visual query language

Science.gov (United States)

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

1993-04-01

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

Querying Business Process Models with VMQL

DEFF Research Database (Denmark)

Störrle, Harald; Acretoaie, Vlad

2013-01-01

The Visual Model Query Language (VMQL) has been invented with the objectives (1) to make it easier for modelers to query models effectively, and (2) to be universally applicable to all modeling languages. In previous work, we have applied VMQL to UML, and validated the first of these two claims. ...

Are cannabis prevalence estimates comparable across countries and regions? A cross-cultural validation using search engine query data.

Science.gov (United States)

Steppan, Martin; Kraus, Ludwig; Piontek, Daniela; Siciliano, Valeria

2013-01-01

Prevalence estimation of cannabis use is usually based on self-report data. Although there is evidence on the reliability of this data source, its cross-cultural validity is still a major concern. External objective criteria are needed for this purpose. In this study, cannabis-related search engine query data are used as an external criterion. Data on cannabis use were taken from the 2007 European School Survey Project on Alcohol and Other Drugs (ESPAD). Provincial data came from three Italian nation-wide studies using the same methodology (2006-2008; ESPAD-Italia). Information on cannabis-related search engine query data was based on Google search volume indices (GSI). (1) Reliability analysis was conducted for GSI. (2) Latent measurement models of "true" cannabis prevalence were tested using perceived availability, web-based cannabis searches and self-reported prevalence as indicators. (3) Structure models were set up to test the influences of response tendencies and geographical position (latitude, longitude). In order to test the stability of the models, analyses were conducted on country level (Europe, US) and on provincial level in Italy. Cannabis-related GSI were found to be highly reliable and constant over time. The overall measurement model was highly significant in both data sets. On country level, no significant effects of response bias indicators and geographical position on perceived availability, web-based cannabis searches and self-reported prevalence were found. On provincial level, latitude had a significant positive effect on availability indicating that perceived availability of cannabis in northern Italy was higher than expected from the other indicators. Although GSI showed weaker associations with cannabis use than perceived availability, the findings underline the external validity and usefulness of search engine query data as external criteria. The findings suggest an acceptable relative comparability of national (provincial) prevalence

Using Search Engine Query Data to Explore the Epidemiology of Common Gastrointestinal Symptoms.

Science.gov (United States)

Hassid, Benjamin G; Day, Lukejohn W; Awad, Mohannad A; Sewell, Justin L; Osterberg, E Charles; Breyer, Benjamin N

2017-03-01

Internet searches are an increasingly used tool in medical research. To date, no studies have examined Google search data in relation to common gastrointestinal symptoms. The aim of this study was to compare trends in Internet search volume with clinical datasets for common gastrointestinal symptoms. Using Google Trends, we recorded relative changes in volume of searches related to dysphagia, vomiting, and diarrhea in the USA between January 2008 and January 2011. We queried the National Inpatient Sample (NIS) and the National Hospital Ambulatory Medical Care Survey (NHAMCS) during this time period and identified cases related to these symptoms. We assessed the correlation between Google Trends and these two clinical datasets, as well as examined seasonal variation trends. Changes to Google search volume for all three symptoms correlated significantly with changes to NIS output (dysphagia: r = 0.5, P = 0.002; diarrhea: r = 0.79, P search engine query volume over time. These data demonstrate that the prevalence of common GI symptoms is rising over time.

Evaluating XML-Extended OLAP Queries Based on a Physical Algebra

DEFF Research Database (Denmark)

Yin, Xuepeng; Pedersen, Torben Bach

2004-01-01

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.Performance experiments with a prototypical implementation suggest that the performance for OLAP...

A hierarchical recurrent encoder-decoder for generative context-aware query suggestion

DEFF Research Database (Denmark)

Sordoni, Alessandro; Bengio, Yoshua; Vahabi, Hossein

2015-01-01

Users may strive to formulate an adequate textual query for their information need. Search engines assist the users by presenting query suggestions. To preserve the original search intent, suggestions should be context-aware and account for the previous queries issued by the user. Achieving context...

Error Checking for Chinese Query by Mining Web Log

Directory of Open Access Journals (Sweden)

Jianyong Duan

2015-01-01

Full Text Available For the search engine, error-input query is a common phenomenon. This paper uses web log as the training set for the query error checking. Through the n-gram language model that is trained by web log, the queries are analyzed and checked. Some features including query words and their number are introduced into the model. At the same time data smoothing algorithm is used to solve data sparseness problem. It will improve the overall accuracy of the n-gram model. The experimental results show that it is effective.

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 into the system (or are automatically indexed by tools within a system). The method builds up a network based upon indices assigned to documents. The network (or chunk) is presented back to the user once a search for knowledge has been completed. The network is build up as 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...

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.

KoralQuery -- A General Corpus Query Protocol

DEFF Research Database (Denmark)

Bingel, Joachim; Diewald, Nils

2015-01-01

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

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.

Algebra-Based Optimization of XML-Extended OLAP Queries

DEFF Research Database (Denmark)

Yin, Xuepeng; Pedersen, Torben Bach

In today’s OLAP systems, integrating fast changing data, e.g., stock quotes, physically into a cube is complex and time-consuming. The widespread use of XML makes it very possible that this data is available in XML format on the WWW; thus, making XML data logically federated with OLAP systems...... is desirable. This report presents a complete foundation for such OLAP-XML federations. This includes a prototypical query engine, a simplified query semantics based on previous work, and a complete physical algebra which enables precise modeling of the execution tasks of an OLAP-XML query. Effective algebra...

Truth Space Method for Caching Database Queries

Directory of Open Access Journals (Sweden)

S. V. Mosin

2015-01-01

Full Text Available We propose a new method of client-side data caching for relational databases with a central server and distant clients. Data are loaded into the client cache based on queries executed on the server. Every query has the corresponding DB table – the result of the query execution. These queries have a special form called "universal relational query" based on three fundamental Relational Algebra operations: selection, projection and natural join. We have to mention that such a form is the closest one to the natural language and the majority of database search queries can be expressed in this way. Besides, this form allows us to analyze query correctness by checking lossless join property. A subsequent query may be executed in a client’s local cache if we can determine that the query result is entirely contained in the cache. For this we compare truth spaces of the logical restrictions in a new user’s query and the results of the queries execution in the cache. Such a comparison can be performed analytically , without need in additional Database queries. This method may be used to define lacking data in the cache and execute the query on the server only for these data. To do this the analytical approach is also used, what distinguishes our paper from the existing technologies. We propose four theorems for testing the required conditions. The first and the third theorems conditions allow us to define the existence of required data in cache. The second and the fourth theorems state conditions to execute queries with cache only. The problem of cache data actualizations is not discussed in this paper. However, it can be solved by cataloging queries on the server and their serving by triggers in background mode. The article is published in the author’s wording.

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.

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

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.

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.

A Query System Implementation Case Study.

Science.gov (United States)

Hiser, Judith N.; Neil, M. Elizabeth

1985-01-01

The Department of Administrative Programming Services of Clemson University investigated products available in user-friendly retrieval systems. The test of INTELLECT, a natural language query system written by Artifical Intelligence Corporation, is described. (Author/MLW)

A web-based data-querying tool based on ontology-driven methodology and flowchart-based model.

Science.gov (United States)

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

2013-10-08

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. 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. 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. 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 when applying a mutually exclusive setting

Using Query Languages and Mobile Code to Reduce Service Invocation Costs

National Research Council Canada - National Science Library

Szymanski, R; Palmer, N; Chase, T

2006-01-01

.... As a concrete example, this paper describes work being performed by CERDEC C2D (Communications Electronics Research, Development, and Engineering Center - Command and Control Directorate) at Fort Monmouth, NJ to expose a military mission plan as a web service through the use of simple SQL-like (Structured Query Language) statements optimized for mission data query.

QuerySpaces on Hadoop for the ATLAS EventIndex

CERN Document Server

Hrivnac, Julius; The ATLAS collaboration; Cranshaw, Jack; Favareto, Andrea; Prokoshin, Fedor; Glasman, Claudia; Toebbicke, Rainer

2015-01-01

A Hadoop-based implementation of the adaptive query engine serving as the back-end for the ATLAS EventIndex. The QuerySpaces implementation handles both original data and search results providing fast and efficient mechanisms for new user queries using already accumulated knowledge for optimization. Detailed descriptions and statistics about user requests are collected in HBase tables and HDFS files. Requests are associated to their results and a graph of relations between them is created to be used to find the most efficient way of providing answers to new requests The environment is completely transparent to users and is accessible over several command-line interfaces, a Web Service and a programming API.

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.

University Experiences and Women Engineering Student Persistence

Science.gov (United States)

Ayers, LoAnn Debra Gienger

Riverside University (a pseudonym), like many universities, has not significantly increased the number of women who graduate with bachelor's degrees in engineering. The purpose of the study is to understand how the university experiences of women students influence the decision to persist in an undergraduate engineering degree and to understand the role of self-perception in how the students perceive experiences as supporting or hindering their persistence in the major. Archival data, documents and artifacts, observations, individual interviews, and a focus group with women engineering students provide insights into students' perceived barriers and supports of student success. Analysis of the data results in two major themes. First, students' self-confidence and self-efficacy influence how women assimilate university experiences as either supportive or diminishing of academic success. Second, university policies and practices shape the campus environment within which student experiences are formed and influence a student's level of institutional, academic, and social integration. The results of the study indicate opportunities for university leadership to enhance strategies that positively shape students' institutional, academic and social integration as precursors toward increasing the number of women students who successfully complete undergraduate engineering degrees at Riverside University. Future research is indicated to better understand how gender and gender identity intersects with other demographic factors, such as socio-economic status, immigration status, and life stage (e.g., traditional versus non-traditional students), to support or deter the persistence of engineering students to degree completion.

Advanced SPARQL querying in small molecule databases.

Science.gov (United States)

Galgonek, Jakub; Hurt, Tomáš; Michlíková, Vendula; Onderka, Petr; Schwarz, Jan; Vondrášek, Jiří

2016-01-01

In recent years, the Resource Description Framework (RDF) and the SPARQL query language have become more widely used in the area of cheminformatics and bioinformatics databases. These technologies allow better interoperability of various data sources and powerful searching facilities. However, we identified several deficiencies that make usage of such RDF databases restrictive or challenging for common users. We extended a SPARQL engine to be able to use special procedures inside SPARQL queries. This allows the user to work with data that cannot be simply precomputed and thus cannot be directly stored in the database. We designed an algorithm that checks a query against data ontology to identify possible user errors. This greatly improves query debugging. We also introduced an approach to visualize retrieved data in a user-friendly way, based on templates describing visualizations of resource classes. To integrate all of our approaches, we developed a simple web application. Our system was implemented successfully, and we demonstrated its usability on the ChEBI database transformed into RDF form. To demonstrate procedure call functions, we employed compound similarity searching based on OrChem. The application is publicly available at https://bioinfo.uochb.cas.cz/projects/chemRDF.

Processing SPARQL queries with regular expressions in RDF databases

Science.gov (United States)

2011-01-01

Background 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. Results 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. Conclusions 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. PMID:21489225

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.

External query expansion in the blogosphere

NARCIS (Netherlands)

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

2009-01-01

We describe the participation of the University of Amsterdam’s ILPS group in the blog track at TREC 2008. We mainly explored different ways of using external corpora to expand the original query. In the blog post retrieval task we did not succeed in improving over a simple baseline (equal weights

Processing SPARQL queries with regular expressions in RDF databases

Directory of Open Access Journals (Sweden)

Cho Hune

2011-03-01

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

Development of university-industry partnerships in railroad engineering education

Science.gov (United States)

Lautala, Pasi T.

Rail transportation has been an important part of the North American transportation network since the 19th century and it continues to be a major contributor to the economic well-being and the global competitiveness of the U.S. The recent expansion in freight rail volumes and forecasts for continuous growth, together with more favorable attitudes for urban passenger rail present several challenges for the rail industry. One of the challenges is the availability of a well educated engineering workforce. The rail industry has recognized a need to attract new railroad professionals from various disciplines for management and technical positions, but most universities eliminated railroad engineering from their curricula after the recruitment levels faded several decades ago. Today, railroad expertise and related engineering courses exist at only a few universities and most students graduate without any exposure to rail topics. While industry representatives have expressed their concern about a future workforce, little data is available on the extent of the demand, on the characteristics and skills of preferred candidates, and on the role that universities can play. A benchmarking study was undertaken to investigate the demand for university engineering graduates and assess whether current methods are sufficient to attract, educate, recruit, train and retain engineering students in the railroad profession. Data was collected from industry human resources and training managers to define the quantitative and qualitative needs for railroad engineers. In addition, recently hired engineers working in the rail industry were surveyed to determine the extent of their university exposure in rail topics and how it affected their career choice. The surveys indicated an increase of over 300 percent in the annual recruitment for railroad engineers by the participating companies between 2002 and 2005. Recruitment levels are expected to remain high for the next five to ten years due

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

Seasonal trends in hypertension in Poland: evidence from Google search engine query data.

Science.gov (United States)

Płatek, Anna E; Sierdziński, Janusz; Krzowski, Bartosz; Szymański, Filip M

2018-01-01

Various conditions, including arterial hypertension, exhibit seasonal trends in their occurrence and magnitude. Those trends correspond to an interest exhibited in the number of Internet searches for the specific conditions per month. The aim of the study was to show seasonal trends in the hypertension prevalence in Poland relate to the data from the Google Trends tool. Internet search engine query data were retrieved from Google Trends from January 2008 to November 2017. Data were calculated as a monthly normalised search volume from the nine-year period. Data was presented for specific geographic regions, including Poland, the United States of America, Australia, and worldwide for the following search terms: "arterial hypertension (pol. nadciśnienie tętnicze)", "hypertension (pol. nadciśnienie)" and "hypertension medical condition". Seasonal effects were calculated using regression models and presented graphically. In Poland the search volume is the highest between November and May, while patients exhibit the least interest in arterial hypertension during summer holidays (p Google.

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.

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.

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.

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

Science.gov (United States)

Smith, Mark W; Barnett, Paul G

2008-04-22

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

ENGINEERING OF UNIVERSITY INTELLIGENT LEARNING SYSTEMS

Directory of Open Access Journals (Sweden)

Vasiliy M. Trembach

2016-01-01

Full Text Available In the article issues of engineering intelligent tutoring systems of University with adaptation are considered. The article also dwells on some modern approaches to engineering of information systems. It shows the role of engineering e-learning devices (systems in system engineering. The article describes the basic principles of system engineering and these principles are expanded regarding to intelligent information systems. The structure of intelligent learning systems with adaptation of the individual learning environments based on services is represented in the article.

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.

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.

In-context query reformulation for failing SPARQL queries

Science.gov (United States)

Viswanathan, Amar; Michaelis, James R.; Cassidy, Taylor; de Mel, Geeth; Hendler, James

2017-05-01

Knowledge bases for decision support systems are growing increasingly complex, through continued advances in data ingest and management approaches. However, humans do not possess the cognitive capabilities to retain a bird's-eyeview of such knowledge bases, and may end up issuing unsatisfiable queries to such systems. This work focuses on the implementation of a query reformulation approach for graph-based knowledge bases, specifically designed to support the Resource Description Framework (RDF). The reformulation approach presented is instance-and schema-aware. Thus, in contrast to relaxation techniques found in the state-of-the-art, the presented approach produces in-context query reformulation.

VMQL: A Visual Language for Ad-Hoc Model Querying

DEFF Research Database (Denmark)

Störrle, Harald

2011-01-01

In large scale model based development, analysis level models are more like knowledge bases than engineering artifacts. Their effectiveness depends, to a large degree, on the ability of domain experts to retrieve information from them ad hoc. For large scale models, however, existing query...

[Comparison of biomedical engineering education between Southeast University (China) and American universities].

Science.gov (United States)

Wang, Xi; Huang Ningping; Sun Xiao; Gu Ning

2011-06-01

Taking Duke University as an example, this article makes a comparison between the major of biomedical engineering in the Southeast University and that in American universities in term of subject direction, faculty, teaching principle and status of publishing academic papers. Through the comparison and analysis, the problems we face were explored. From the comparison and summary the future improvements in four aspects, such as strengthening the interdisciplinary among different majors, etc. so as to provide an inspiration on the future perspectives of research and teaching in biomedical engineering in China.

Querying on Federated Sensor Networks

Directory of Open Access Journals (Sweden)

Zuhal Can

2016-09-01

Full Text Available A Federated Sensor Network (FSN is a network of geographically distributed Wireless Sensor Networks (WSNs called islands. For querying on an FSN, we introduce the Layered Federated Sensor Network (L-FSN Protocol. For layered management, L-FSN provides communication among islands by its inter-island querying protocol by which a query packet routing path is determined according to some path selection policies. L-FSN allows autonomous management of each island by island-specific intra-island querying protocols that can be selected according to island properties. We evaluate the applicability of L-FSN and compare the L-FSN protocol with various querying protocols running on the flat federation model. Flat federation is a method to federate islands by running a single querying protocol on an entire FSN without distinguishing communication among and within islands. For flat federation, we select a querying protocol from geometrical, hierarchical cluster-based, hash-based, and tree-based WSN querying protocol categories. We found that a layered federation of islands by L-FSN increases the querying performance with respect to energy-efficiency, query resolving distance, and query resolving latency. Moreover, L-FSN’s flexibility of choosing intra-island querying protocols regarding the island size brings advantages on energy-efficiency and query resolving latency.

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......, the queries studied so far generally focus on finding individual objects that each satisfy a query rather than finding groups of objects where the objects in a group collectively satisfy a query. We define the problem of retrieving a group of spatial web objects such that the group's keywords cover the query......'s keywords and such that objects are nearest to the query location and have the lowest inter-object distances. Specifically, we study two variants of this problem, both of which are NP-complete. We devise exact solutions as well as approximate solutions with provable approximation bounds to the problems. We...

Development of security engineering curricula at US universities

Energy Technology Data Exchange (ETDEWEB)

Garcia, M.L.

1998-08-01

The Southwest Surety Institute was formed in June 1996 by Arizona State University (ASU), New Mexico Institute of Mining and Technology (NM Tech), New Mexico State University (NMSU), and Sandia National Laboratories (SNL) to provide educational programs in Security Engineering, and to conduct research and development in security technologies. This is the first science-based program of its kind in the US, focused on educating Security Engineers to help government and industry address their security needs. Each member brings a unique educational capability to the Institute. NM Tech has a formidable explosives testing and evaluation facility. ASU is developing a Masters program in Security Engineering at their School of Technology located on a new campus in Mesa, Arizona. NMSU provides a Security Technology minor, merging programs in Criminal Justice and Engineering Technology. The Sandia National Laboratories security system design and evaluation process forms the basis for the Security Engineering curricula. In an effort to leverage the special capabilities of each university, distance education will be used to share courses among Institute members and eventually with other sites across the country.

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.

A SQL-Database Based Meta-CASE System and its Query Subsystem

Science.gov (United States)

Eessaar, Erki; Sgirka, Rünno

Meta-CASE systems simplify the creation of CASE (Computer Aided System Engineering) systems. In this paper, we present a meta-CASE system that provides a web-based user interface and uses an object-relational database system (ORDBMS) as its basis. The use of ORDBMSs allows us to integrate different parts of the system and simplify the creation of meta-CASE and CASE systems. ORDBMSs provide powerful query mechanism. The proposed system allows developers to use queries to evaluate and gradually improve artifacts and calculate values of software measures. We illustrate the use of the systems by using SimpleM modeling language and discuss the use of SQL in the context of queries about artifacts. We have created a prototype of the meta-CASE system by using PostgreSQL™ ORDBMS and PHP scripting language.

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

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

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

TopFed: TCGA tailored federated query processing and linking to LOD.

Science.gov (United States)

Saleem, Muhammad; Padmanabhuni, Shanmukha S; Ngomo, Axel-Cyrille Ngonga; Iqbal, Aftab; Almeida, Jonas S; Decker, Stefan; Deus, Helena F

2014-01-01

The Cancer Genome Atlas (TCGA) is a multidisciplinary, multi-institutional effort to catalogue genetic mutations responsible for cancer using genome analysis techniques. One of the aims of this project is to create a comprehensive and open repository of cancer related molecular analysis, to be exploited by bioinformaticians towards advancing cancer knowledge. However, devising bioinformatics applications to analyse such large dataset is still challenging, as it often requires downloading large archives and parsing the relevant text files. Therefore, it is making it difficult to enable virtual data integration in order to collect the critical co-variates necessary for analysis. We address these issues by transforming the TCGA data into the Semantic Web standard Resource Description Format (RDF), link it to relevant datasets in the Linked Open Data (LOD) cloud and further propose an efficient data distribution strategy to host the resulting 20.4 billion triples data via several SPARQL endpoints. Having the TCGA data distributed across multiple SPARQL endpoints, we enable biomedical scientists to query and retrieve information from these SPARQL endpoints by proposing a TCGA tailored federated SPARQL query processing engine named TopFed. We compare TopFed with a well established federation engine FedX in terms of source selection and query execution time by using 10 different federated SPARQL queries with varying requirements. Our evaluation results show that TopFed selects on average less than half of the sources (with 100% recall) with query execution time equal to one third to that of FedX. With TopFed, we aim to offer biomedical scientists a single-point-of-access through which distributed TCGA data can be accessed in unison. We believe the proposed system can greatly help researchers in the biomedical domain to carry out their research effectively with TCGA as the amount and diversity of data exceeds the ability of local resources to handle its retrieval and

SkyQuery - A Prototype Distributed Query and Cross-Matching Web Service for the Virtual Observatory

Science.gov (United States)

Thakar, A. R.; Budavari, T.; Malik, T.; Szalay, A. S.; Fekete, G.; Nieto-Santisteban, M.; Haridas, V.; Gray, J.

2002-12-01

We have developed a prototype distributed query and cross-matching service for the VO community, called SkyQuery, which is implemented with hierarchichal Web Services. SkyQuery enables astronomers to run combined queries on existing distributed heterogeneous astronomy archives. SkyQuery provides a simple, user-friendly interface to run distributed queries over the federation of registered astronomical archives in the VO. The SkyQuery client connects to the portal Web Service, which farms the query out to the individual archives, which are also Web Services called SkyNodes. The cross-matching algorithm is run recursively on each SkyNode. Each archive is a relational DBMS with a HTM index for fast spatial lookups. The results of the distributed query are returned as an XML DataSet that is automatically rendered by the client. SkyQuery also returns the image cutout corresponding to the query result. SkyQuery finds not only matches between the various catalogs, but also dropouts - objects that exist in some of the catalogs but not in others. This is often as important as finding matches. We demonstrate the utility of SkyQuery with a brown-dwarf search between SDSS and 2MASS, and a search for radio-quiet quasars in SDSS, 2MASS and FIRST. The importance of a service like SkyQuery for the worldwide astronomical community cannot be overstated: data on the same objects in various archives is mapped in different wavelength ranges and looks very different due to different errors, instrument sensitivities and other peculiarities of each archive. Our cross-matching algorithm preforms a fuzzy spatial join across multiple catalogs. This type of cross-matching is currently often done by eye, one object at a time. A static cross-identification table for a set of archives would become obsolete by the time it was built - the exponential growth of astronomical data means that a dynamic cross-identification mechanism like SkyQuery is the only viable option. SkyQuery was funded by a

Nuclear engineering education initiative at Ibaraki University

International Nuclear Information System (INIS)

Matsumura, Kunihito; Kanto, Yasuhiro; Tanaka, Nobuatsu; Saigusa, Mikio; Kurumada, Akira; Kikuchi, Kenji

2015-01-01

With the help of a grant from the Ministry of Education, Culture, Sports, Science and Technology, Ibaraki University has been engaging for six years in the development and preparation of educational environment on nuclear engineering for each of graduate and undergraduate. Core faculty conducts general services including the design and implementation of curriculum, operational improvement, and implementation of lectures. 'Beginner-friendly introduction for nuclear power education' is provided at the Faculty of Engineering, and 'nuclear engineering education program' at the Graduate School of Science and Engineering. All the students who have interest or concern in the accidents at nuclear power plants or the future of nuclear power engineering have opportunities to learn actively. This university participates in the alliance or association with other universities, builds industry - government - academia cooperation with neighboring institutions such as the Japan Atomic Energy Agency, and makes efforts to promote the learning and development of applied skills related to nuclear engineering through training and study tours at each facility. For example, it established the Frontier Applied Atomic Science Center to analyze the structure and function of materials using the strong neutron source of J-PARC. As the efforts after the earthquake accident, it carried out a radiation survey work in Fukushima Prefecture. In addition, it proposed and practiced the projects such as 'development of methods for the evaluation of transfer/fixation properties and decontamination of radioactive substances,' and 'structure analysis of radioactive substances remaining in soil, litter, and polluted water and its application to the decontamination.' (A.O.)

Indexing for summary queries

DEFF Research Database (Denmark)

Yi, Ke; Wang, Lu; Wei, Zhewei

2014-01-01

), of a particular attribute of these records. Aggregation queries are especially useful in business intelligence and data analysis applications where users are interested not in the actual records, but some statistics of them. They can also be executed much more efficiently than reporting queries, by embedding...... 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....

University Engineering Education and Training in Nigeria ...

African Journals Online (AJOL)

The Nigerian University engineering education and training system is be-set by a number of inadequacies - low entry standards, non-uniformity in entry process for all engineering faculties in the country, moderate academic quality of entrants for the profession, low level knowledge of Mathematics and physical Sciences for ...

Biomedical Engineering at the Technical University of Denmark

DEFF Research Database (Denmark)

Jensen, Jørgen Arendt; Andersen, Ole Trier; Wilhjelm, Jens Erik

1998-01-01

The paper gives a brief overview of the biomedical engineering research and education at the Technical University of Denmark. An account of the research activities since the 1950?s is given, and examples of major efforts within ultrasound, biomagnetism, and neuroimaging are described. The evolution...... of the teaching activities since the late 1960?s along with an account of the recent initiatives to make a biomedical engineering profile at the university is described....

The CMS DBS query language

International Nuclear Information System (INIS)

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

2010-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, provide details of the language components and overview of how this component fits into the overall data discovery system architecture.

Engineering Education at a New Public University in Brazil: First Students' Contact with Engineering Methods

Science.gov (United States)

Romero, Jesus Franklin A.; Leite, Patricia; Mantovani, Gerson L.; Lanfredi, Alexandre J. C.; Martins-Filho, Luiz S.

2011-01-01

This paper describes the experience of an introductory discipline to the engineering curricula at the Brazilian Federal University of ABC (UFABC). The university offers a common basic curriculum that must be accomplished by every student and can be followed by professionalising courses. The discipline "Introduction to Engineering"…

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.

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

jQuery cookbook

CERN Document Server

2010-01-01

jQuery simplifies building rich, interactive web frontends. Getting started with this JavaScript library is easy, but it can take years to fully realize its breadth and depth; this cookbook shortens the learning curve considerably. With these recipes, you'll learn patterns and practices from 19 leading developers who use jQuery for everything from integrating simple components into websites and applications to developing complex, high-performance user interfaces. Ideal for newcomers and JavaScript veterans alike, jQuery Cookbook starts with the basics and then moves to practical use cases w

Fuzzy Approaches to Flexible Querying in XML Retrieval

Directory of Open Access Journals (Sweden)

Stefania Marrara

2016-04-01

Full Text Available In this paper we review some approaches to flexible querying in XML that apply several techniques among which Fuzzy Set Theory. In particular we focus on FleXy, a flexible extension of XQuery-FT that was developed as a library on the open source engine Base-X. We then present PatentLight, a tool for patent retrieval that was developed to show the expressive power of Flexy.

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.

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.

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.

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.

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

Aerospace engineering training: universities experience

Directory of Open Access Journals (Sweden)

Mertins Kseniya

2016-01-01

Full Text Available Contemporary professional working in aerospace engineering must have a set of soft and hard skills. The experience gained in universities shows that training of a competent professional is impossible without an employer involved in this process. The paper provides an analysis of missions, tasks and experience of aerospace professionals and identifies the present and future roles, missions and required skills of a highly qualified specialist in aerospace engineering. This analysis can be used to design a master’s program aiming at providing students with the required knowledge, know-how and attitudes needed to succeed as professionals in industrial companies.

New Capabilities in the Astrophysics Multispectral Archive Search Engine

Science.gov (United States)

Cheung, C. Y.; Kelley, S.; Roussopoulos, N.

The Astrophysics Multispectral Archive Search Engine (AMASE) uses object-oriented database techniques to provide a uniform multi-mission and multi-spectral interface to search for data in the distributed archives. We describe our experience of porting AMASE from Illustra object-relational DBMS to the Informix Universal Data Server. New capabilities and utilities have been developed, including a spatial datablade that supports Nearest Neighbor queries.

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

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.

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

Optimizing Temporal Queries

DEFF Research Database (Denmark)

Toman, David; Bowman, Ivan Thomas

2003-01-01

Recent research in the area of temporal databases has proposed a number of query languages that vary in their expressive power and the semantics they provide to users. These query languages represent a spectrum of solutions to the tension between clean semantics and efficient evaluation. Often, t...

Forming engineers' sociocultural competence: Engineering ethics at tomsk polytechnic university

Science.gov (United States)

Galanina, E.; Dulzon, A.; Schwab, A.

2015-10-01

The aim of the present research is to discuss Tomsk Polytechnic University in respect of forming engineers’ sociocultural competence and teaching engineering ethics. Today international standards of training engineers cover efficient communication skills, ability to understand societal and environment context, professional and ethical responsibility. This article deals with the problem of contradiction between the need to form engineers’ sociocultural competence in Russian higher education institutions in order to meet the requirements of international accreditation organizations and the real capabilities of existing engineering curricula. We have described ethics teaching experience of TPU, studied the engineering master programs of TPU to see how the planned results are achieved. We have also given our recommendations to alter the structure of TPU educational curricula, which can also be applied in other higher education institutions.

Development of Nuclear Engineering Educational Program at Ibaraki University with Regional Collaboration

Science.gov (United States)

Matsumura, Kunihito; Kaminaga, Fumito; Kanto, Yasuhiro; Tanaka, Nobuatsu; Saigusa, Mikio; Kikuchi, Kenji; Kurumada, Akira

The College of Engineering, Ibaraki University is located at the Hitachi city, in the north part of Ibaraki prefecture. Hitachi and Tokai areas are well known as concentration of advanced technology center of nuclear power research organizations. By considering these regional advantages, we developed a new nuclear engineering educational program for students in the Collage of Engineering and The Graduate School of Science and Engineering of Ibaraki University. The program is consisted of the fundamental lectures of nuclear engineering and nuclear engineering experiments. In addition, several observation learning programs by visiting cooperative organizations are also included in the curriculum. In this paper, we report about the progress of the new educational program for nuclear engineering in Ibaraki University.

Nuclear engineering education in italian universities

International Nuclear Information System (INIS)

Dulla, S.; Panella, B.; Ravetto, P.

2011-01-01

The paper illustrates the evolution and the present situation of the university-level nuclear engineering education in Italy. The problems connected with the need of qualified faculty in view of a dramatic increase of students is pointed out. A short description of the programs at present available at Italian universities is also presented, together with some statistics referred to Politecnico di Torino. The mathematical and computation content of each programs is also analyzed. (author)

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

Query-Biased Preview over Outsourced and Encrypted Data

Science.gov (United States)

Luo, Guangchun; Qin, Ke; Chen, Aiguo

2013-01-01

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

Query-biased preview over outsourced and encrypted data.

Science.gov (United States)

Peng, Ningduo; Luo, Guangchun; Qin, Ke; Chen, Aiguo

2013-01-01

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

Behavior of Engineering Students in Kuwait University

OpenAIRE

M. A. Al-Ajmi; R. S. Al-Kandari

2015-01-01

This initial study is concerned with the behavior of engineering students in Kuwait University which became a concern due to the global issues of education in all levels. A survey has been conducted to identify academic and societal issues affecting the engineering student performance. The study is drawing major conclusions with regard to private tutoring and the online availability of textbooks’ solution manuals.

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.

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.

Educating nuclear engineers at German universities

International Nuclear Information System (INIS)

Knorr, J.

1995-01-01

Nuclear technology is a relatively young university discipline. Yet, as a consequence of the declining public acceptance of the peaceful use of nuclear power, its very existence is already being threatened at many universities. However, if Germany needs nuclear power, which undoubtedly is the case, highly qualified, committed experts are required above all. Nuclear technology develops internationally. Consequently, also university education must meet international standards. Generally, university education has been found to be the most effective way of increasing the number of scientific and engineering personnel. Nuclear techniques have meanwhile found acceptance in many other scientific disciplines, thus advancing those branches of science. Teaching needs research; like research in nucelar technology at the national research centers, also the universities are suffering massive financial disadvantages. Research is possible only if outside funds are solicited, which increase dependency and decreases basic research. (orig.) [de

Incremental Query Rewriting with Resolution

Science.gov (United States)

Riazanov, Alexandre; Aragão, Marcelo A. T.

We address the problem of semantic querying of relational databases (RDB) modulo knowledge bases using very expressive knowledge representation formalisms, such as full first-order logic or its various fragments. We propose to use a resolution-based first-order logic (FOL) reasoner for computing schematic answers to deductive queries, with the subsequent translation of these schematic answers to SQL queries which are evaluated using a conventional relational DBMS. We call our method incremental query rewriting, because an original semantic query is rewritten into a (potentially infinite) series of SQL queries. In this chapter, we outline the main idea of our technique - using abstractions of databases and constrained clauses for deriving schematic answers, and provide completeness and soundness proofs to justify the applicability of this technique to the case of resolution for FOL without equality. The proposed method can be directly used with regular RDBs, including legacy databases. Moreover, we propose it as a potential basis for an efficient Web-scale semantic search technology.

Range-clustering queries

NARCIS (Netherlands)

Abrahamsen, M.; de Berg, M.T.; Buchin, K.A.; Mehr, M.; Mehrabi, A.D.

2017-01-01

In a geometric k -clustering problem the goal is to partition a set of points in R d into k subsets such that a certain cost function of the clustering is minimized. We present data structures for orthogonal range-clustering queries on a point set S : given a query box Q and an integer k>2 , compute

Annual report of Nuclear Engineering Research Laboratory, Faculty of Engineering, University of Tokyo, fiscal year 1995

International Nuclear Information System (INIS)

1996-08-01

This is an annual report prepared on research education action, operation state of research instruments and others in FY 1995 at Nuclear Engineering Research Laboratory, Faculty of Engineering, University of Tokyo. The laboratory has four large instruments such as high speed neutron source reactor, 'Yayoi', electron linac, fundamentally experimental equipment for blanket design of nuclear fusion reactor, and heavy radiation research equipment (HIT), of which former two are used for cooperative research with universities in Japan, and the next blanket and the last HIT are also presented for cooperative researches in Faculty of Engineering and in University of Tokyo, respectively. FY 1995 was the beginning year of earnest discussion on future planning of this facility with concentrated effort. These four large research instruments are all in their active use. And, their further improvement is under preparation. In this report, the progress in FY 1995 on operation and management of the four large instruments are described at first, and on next, research actions, contents of theses for degree and graduation of students as well as research results of laboratory stuffs are summarized. These researches are constituted mainly using these large instruments in the facility, aiming at development of advanced and new field of atomic energy engineering and relates to nuclear reactor first wall engineering, nuclear reactor fuel cycle engineering, electromagnetic structure engineering, thermal-liquid engineering, mathematical information engineering, quantum beam engineering, new type reactor design and so on. (G.K.)

Annual report of Nuclear Engineering Research Laboratory, Faculty of Engineering, University of Tokyo, fiscal year 1995

Energy Technology Data Exchange (ETDEWEB)

NONE

1996-08-01

This is an annual report prepared on research education action, operation state of research instruments and others in FY 1995 at Nuclear Engineering Research Laboratory, Faculty of Engineering, University of Tokyo. The laboratory has four large instruments such as high speed neutron source reactor, `Yayoi`, electron linac, fundamentally experimental equipment for blanket design of nuclear fusion reactor, and heavy radiation research equipment (HIT), of which former two are used for cooperative research with universities in Japan, and the next blanket and the last HIT are also presented for cooperative researches in Faculty of Engineering and in University of Tokyo, respectively. FY 1995 was the beginning year of earnest discussion on future planning of this facility with concentrated effort. These four large research instruments are all in their active use. And, their further improvement is under preparation. In this report, the progress in FY 1995 on operation and management of the four large instruments are described at first, and on next, research actions, contents of theses for degree and graduation of students as well as research results of laboratory stuffs are summarized. These researches are constituted mainly using these large instruments in the facility, aiming at development of advanced and new field of atomic energy engineering and relates to nuclear reactor first wall engineering, nuclear reactor fuel cycle engineering, electromagnetic structure engineering, thermal-liquid engineering, mathematical information engineering, quantum beam engineering, new type reactor design and so on. (G.K.)

SPARK: Adapting Keyword Query to Semantic Search

Science.gov (United States)

Zhou, Qi; Wang, Chong; Xiong, Miao; Wang, Haofen; Yu, Yong

Semantic search promises to provide more accurate result than present-day keyword search. However, progress with semantic search has been delayed due to the complexity of its query languages. In this paper, we explore a novel approach of adapting keywords to querying the semantic web: the approach automatically translates keyword queries into formal logic queries so that end users can use familiar keywords to perform semantic search. A prototype system named 'SPARK' has been implemented in light of this approach. Given a keyword query, SPARK outputs a ranked list of SPARQL queries as the translation result. The translation in SPARK consists of three major steps: term mapping, query graph construction and query ranking. Specifically, a probabilistic query ranking model is proposed to select the most likely SPARQL query. In the experiment, SPARK achieved an encouraging translation result.

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

endpoint's availability based on the EndpointData graph. Our evaluation of BioFed against FedX is based on 20 heterogeneous federated SPARQL queries and shows competitive execution performance in comparison to FedX, which can be attributed to the provision of provenance information for the source selection. Developing and testing federated query engines for life sciences data is still a challenging task. According to our findings, it is advantageous to optimise the source selection. The cataloguing of SPARQL endpoints, including type and property indexing, leads to efficient querying of data resources over the Web of Data. This could even be further improved through the use of ontologies, e.g., for abstract normalisation of query terms.

A case for the revision of power engineering syllabi at Kenyan universities

Energy Technology Data Exchange (ETDEWEB)

Abungu, N.; Akumu, A. [Jomo Kenyatta Univ. of Agriculture and Technology, Nairobi (Kenya). Dept. of Electrical and Electronic Engineering; Munda, J. [Tshwane Univ. of Technology, Pretoria (South Africa). Dept. of Power Engineering

2005-07-01

A summary of electrical power engineering education in Kenyan universities was presented. Industry expectations for power systems graduates were discussed. Despite rapid changes in electrical power industries around the world, electrical power engineering in Kenya has remained the same for several years. Curriculum changes were last initiated in the 1980s. Universities have not promoted power engineering and its importance to society, and misunderstandings have led to a lack of employment opportunities for graduates and low enrolment levels. Recent advances in artificial neural networks, genetic algorithms, and fuzzy logic within power systems engineering are not currently taught at Kenyan universities. The deregulation of the power industry calls for a re-assessment of how power engineering is taught. Accidents related to poor engineering designs are relatively common in Kenya and have led to the loss of lives. Severe capacity shortfalls experienced in the country have led to a renewed interest in alternative sources of electricity generation. Environmental studies will help students appreciate the importance of using energy sources that do not degrade the environment. It was concluded that the introduction of new approaches to power engineering will result in increased interest from students. The establishment of industry-university collaborations was recommended, as well as active links with international universities. 12 refs.

Meta Search Engines.

Science.gov (United States)

Garman, Nancy

1999-01-01

Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)

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.

Harvesting All Matching Information To A Given Query From a Deep Website

NARCIS (Netherlands)

Khelghati, Mohammadreza; Hiemstra, Djoerd; van Keulen, Maurice; Armano, Giuliano; Bozzon, Alessandro; Giuliani, Alessandro

In this paper, the goal is harvesting all documents matching a given (entity) query from a deep web source. The objective is to retrieve all information about for instance "Denzel Washington", "Iran Nuclear Deal", or "FC Barcelona" from data hidden behind web forms. Policies of web search engines

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.

Nuclear science and engineering education at a university research reactor

International Nuclear Information System (INIS)

Loveland, W.

1993-01-01

The role of an on-site irradiation facility in nuclear science and engineering education is examined. Using the example of a university research reactor, the use of such devices in laboratory instruction, public outreach programs, special instructional programs, research, etc. is discussed. Examples from the Oregon State University curriculum in nuclear chemistry, nuclear engineering and radiation health are given. (author) 1 tab

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 PubMed queries in particular for researchers whose first language is not English.

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.

Multi-Dimensional Path Queries

DEFF Research Database (Denmark)

Bækgaard, Lars

1998-01-01

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......We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path...

Learning via Query Synthesis

KAUST Repository

Alabdulmohsin, Ibrahim

2017-01-01

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

Comparative analysis of some search engines

Directory of Open Access Journals (Sweden)

Taiwo O. Edosomwan

2010-10-01

Full Text Available We compared the information retrieval performances of some popular search engines (namely, Google, Yahoo, AlltheWeb, Gigablast, Zworks and AltaVista and Bing/MSN in response to a list of ten queries, varying in complexity. These queries were run on each search engine and the precision and response time of the retrieved results were recorded. The first ten documents on each retrieval output were evaluated as being ‘relevant’ or ‘non-relevant’ for evaluation of the search engine’s precision. To evaluate response time, normalised recall ratios were calculated at various cut-off points for each query and search engine. This study shows that Google appears to be the best search engine in terms of both average precision (70% and average response time (2 s. Gigablast and AlltheWeb performed the worst overall in this study.

Comparing relational model transformation technologies: implementing Query/View/Transformation with Triple Graph Grammars

DEFF Research Database (Denmark)

Greenyer, Joel; Kindler, Ekkart

2010-01-01

and for model-based software engineering approaches in general. QVT (Query/View/Transformation) is the transformation technology recently proposed for this purpose by the OMG. TGGs (Triple Graph Grammars) are another transformation technology proposed in the mid-nineties, used for example in the FUJABA CASE...

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

Searching for rare diseases in PubMed: a blind comparison of Orphanet expert query and query based on terminological knowledge.

Science.gov (United States)

Griffon, N; Schuers, M; Dhombres, F; Merabti, T; Kerdelhué, G; Rollin, L; Darmoni, S J

2016-08-02

Despite international initiatives like Orphanet, it remains difficult to find up-to-date information about rare diseases. The aim of this study is to propose an exhaustive set of queries for PubMed based on terminological knowledge and to evaluate it versus the queries based on expertise provided by the most frequently used resource in Europe: Orphanet. Four rare disease terminologies (MeSH, OMIM, HPO and HRDO) were manually mapped to each other permitting the automatic creation of expended terminological queries for rare diseases. For 30 rare diseases, 30 citations retrieved by Orphanet expert query and/or query based on terminological knowledge were assessed for relevance by two independent reviewers unaware of the query's origin. An adjudication procedure was used to resolve any discrepancy. Precision, relative recall and F-measure were all computed. For each Orphanet rare disease (n = 8982), there was a corresponding terminological query, in contrast with only 2284 queries provided by Orphanet. Only 553 citations were evaluated due to queries with 0 or only a few hits. There were no significant differences between the Orpha query and terminological query in terms of precision, respectively 0.61 vs 0.52 (p = 0.13). Nevertheless, terminological queries retrieved more citations more often than Orpha queries (0.57 vs. 0.33; p = 0.01). Interestingly, Orpha queries seemed to retrieve older citations than terminological queries (p < 0.0001). The terminological queries proposed in this study are now currently available for all rare diseases. They may be a useful tool for both precision or recall oriented literature search.

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

Query recommendation for children

NARCIS (Netherlands)

Duarte Torres, Sergio; Hiemstra, Djoerd; Weber, Ingmar; Serdyukov, Pavel

2012-01-01

One of the biggest problems that children experience while searching the web occurs during the query formulation process. Children have been found to struggle formulating queries based on keywords given their limited vocabulary and their difficulty to choose the right keywords. In this work we

Mapping queries to the Linking Open Data cloud: a case study using DBpedia

NARCIS (Netherlands)

Meij, E.; Bron, M.; Hollink, L.; Huurnink, B.; de Rijke, M.

2011-01-01

We introduce the task of mapping search engine queries to DBpedia, a major linking hub in the Linking Open Data cloud. We propose and compare various methods for addressing this task, using a mixture of information retrieval and machine learning techniques. Specifically, we present a supervised

Towards Verbalizing SPARQL Queries in Arabic

Directory of Open Access Journals (Sweden)

I. Al Agha

2016-04-01

Full Text Available With the wide spread of Open Linked Data and Semantic Web technologies, a larger amount of data has been published on the Web in the RDF and OWL formats. This data can be queried using SPARQL, the Semantic Web Query Language. SPARQL cannot be understood by ordinary users and is not directly accessible to humans, and thus they will not be able to check whether the retrieved answers truly correspond to the intended information need. Driven by this challenge, natural language generation from SPARQL data has recently attracted a considerable attention. However, most existing solutions to verbalize SPARQL in natural language focused on English and Latin-based languages. Little effort has been made on the Arabic language which has different characteristics and morphology. This work aims to particularly help Arab users to perceive SPARQL queries on the Semantic Web by translating SPARQL to Arabic. It proposes an approach that gets a SPARQL query as an input and generates a query expressed in Arabic as an output. The translation process combines both morpho-syntactic analysis and language dependencies to generate a legible and understandable Arabic query. The approach was preliminary assessed with a sample query set, and results indicated that 75% of the queries were correctly translated into Arabic.

Reconstruction of nuclear engineering education in universities

International Nuclear Information System (INIS)

Kitamura, Masaharu; Tomota, Yo; Tanaka, Shunichi

2005-01-01

Nuclear engineering has become the area gradually loosing appeal to the young for these twenty years taking all the circumstances into consideration. However nuclear power is predicted to be primary energy of greatest importance even in the future and this needs highly motivated and excellent personnel in nuclear industry and society so as to develop and maintain nuclear power to a high degree. Under these circumstances discussions on how should be nuclear engineering research and education in the new era were presented from various viewpoints and they led to the direction of reconstruction of nuclear engineering education in universities and relevant organizations to train and ensure personnel. (T. Tanaka)

EmptyHeaded: A Relational Engine for Graph Processing.

Science.gov (United States)

Aberger, Christopher R; Tu, Susan; Olukotun, Kunle; Ré, Christopher

2016-01-01

There are two types of high-performance graph processing engines: low- and high-level engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures and computation models but require users to write low-level imperative code, hence ensuring that efficiency is the burden of the user. In high-level engines, users write in query languages like datalog (SociaLite) or SQL (Grail). High-level engines are easier to use but are orders of magnitude slower than the low-level graph engines. We present EmptyHeaded, a high-level engine that supports a rich datalog-like query language and achieves performance comparable to that of low-level engines. At the core of EmptyHeaded's design is a new class of join algorithms that satisfy strong theoretical guarantees but have thus far not achieved performance comparable to that of specialized graph processing engines. To achieve high performance, EmptyHeaded introduces a new join engine architecture, including a novel query optimizer and data layouts that leverage single-instruction multiple data (SIMD) parallelism. With this architecture, EmptyHeaded outperforms high-level approaches by up to three orders of magnitude on graph pattern queries, PageRank, and Single-Source Shortest Paths (SSSP) and is an order of magnitude faster than many low-level baselines. We validate that EmptyHeaded competes with the best-of-breed low-level engine (Galois), achieving comparable performance on PageRank and at most 3× worse performance on SSSP.

A Framework for WWW Query Processing

Science.gov (United States)

Wu, Binghui Helen; Wharton, Stephen (Technical Monitor)

2000-01-01

Query processing is the most common operation in a DBMS. Sophisticated query processing has been mainly targeted at a single enterprise environment providing centralized control over data and metadata. Submitting queries by anonymous users on the web is different in such a way that load balancing or DBMS' accessing control becomes the key issue. This paper provides a solution by introducing a framework for WWW query processing. The success of this framework lies in the utilization of query optimization techniques and the ontological approach. This methodology has proved to be cost effective at the NASA Goddard Space Flight Center Distributed Active Archive Center (GDAAC).

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

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.

Joint Top-K Spatial Keyword Query Processing

DEFF Research Database (Denmark)

Wu, Dingming; Yiu, Man Lung; Cong, Gao

2012-01-01

Web users and content are increasingly being geopositioned, and increased focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content. We study the effici......Web users and content are increasingly being geopositioned, and increased focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content. We study...... the efficient, joint processing of multiple top-k spatial keyword queries. Such joint processing is attractive during high query loads and also occurs when multiple queries are used to obfuscate a user's true query. We propose a novel algorithm and index structure for the joint processing of top-k spatial...... keyword queries. Empirical studies show that the proposed solution is efficient on real data sets. We also offer analytical studies on synthetic data sets to demonstrate the efficiency of the proposed solution. Index Terms IEEE Terms Electronic mail , Google , Indexes , Joints , Mobile communication...

Annual report of Nuclear Engineering Research Laboratory, Faculty of Engineering, University of Tokyo, fiscal year 1996

International Nuclear Information System (INIS)

1997-08-01

This report summarizes research and educational activities, operation status of the research facilities of the Nuclear Engineering Research Laboratory, Faculty of Engineering, University of Tokyo on fiscal year 1996. This facility has four major research facilities such as fast neutron source reactor 'Yayoi', electron Linac, fundamental experiment facility for nuclear fusion reactor blanket design and high fluence irradiation facility(HIT). Education and research activities are conducted in a wide fields of nuclear engineering using these facilities. The former two facilities are available for various studies by universities all over Japan, facility for nuclear fusion reactor blanket design is utilized for research within the Faculty of Engineering and HIT is used for the research within the University of Tokyo. The facility established a plan to reorganized into a nation wide research collaboration center in fiscal year 1995 and after further discussion of a future program it is decided to hold 'Nuclear energy symposium' periodically after fiscal year 1997 as a part of the activity for appealing the research results to the public. (G.K.)

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

Manually Classifying User Search Queries on an Academic Library Web Site

Science.gov (United States)

Chapman, Suzanne; Desai, Shevon; Hagedorn, Kat; Varnum, Ken; Mishra, Sonali; Piacentine, Julie

2013-01-01

The University of Michigan Library wanted to learn more about the kinds of searches its users were conducting through the "one search" search box on the Library Web site. Library staff conducted two investigations. A preliminary investigation in 2011 involved the manual review of the 100 most frequently occurring queries conducted…

On tractable query evaluation for SPARQL

OpenAIRE

Mengel, Stefan; Skritek, Sebastian

2017-01-01

Despite much work within the last decade on foundational properties of SPARQL - the standard query language for RDF data - rather little is known about the exact limits of tractability for this language. In particular, this is the case for SPARQL queries that contain the OPTIONAL-operator, even though it is one of the most intensively studied features of SPARQL. The aim of our work is to provide a more thorough picture of tractable classes of SPARQL queries. In general, SPARQL query evaluatio...

Man vs. Machine: Differences in SPARQL Queries

NARCIS (Netherlands)

Rietveld, L.; Hoekstra, R.

2014-01-01

Server-side SPARQL query logs have been a topic of study for some time now. The USEWOD collection of query logs is currently the primary source of information for researchers. A recurring problem is that these logs leave application queries and queries created by humans indistinguishable. In this

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

Querying XML Data with SPARQL

Science.gov (United States)

Bikakis, Nikos; Gioldasis, Nektarios; Tsinaraki, Chrisa; Christodoulakis, Stavros

SPARQL is today the standard access language for Semantic Web data. In the recent years XML databases have also acquired industrial importance due to the widespread applicability of XML in the Web. In this paper we present a framework that bridges the heterogeneity gap and creates an interoperable environment where SPARQL queries are used to access XML databases. Our approach assumes that fairly generic mappings between ontology constructs and XML Schema constructs have been automatically derived or manually specified. The mappings are used to automatically translate SPARQL queries to semantically equivalent XQuery queries which are used to access the XML databases. We present the algorithms and the implementation of SPARQL2XQuery framework, which is used for answering SPARQL queries over XML databases.

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.

Optimizing queries in distributed systems

Directory of Open Access Journals (Sweden)

Ion LUNGU

2006-01-01

Full Text Available This research presents the main elements of query optimizations in distributed systems. First, data architecture according with system level architecture in a distributed environment is presented. Then the architecture of a distributed database management system (DDBMS is described on conceptual level followed by the presentation of the distributed query execution steps on these information systems. The research ends with presentation of some aspects of distributed database query optimization and strategies used for that.

Advanced Query Formulation in Deductive Databases.

Science.gov (United States)

Niemi, Timo; Jarvelin, Kalervo

1992-01-01

Discusses deductive databases and database management systems (DBMS) and introduces a framework for advanced query formulation for end users. Recursive processing is described, a sample extensional database is presented, query types are explained, and criteria for advanced query formulation from the end user's viewpoint are examined. (31…

Dynamic Planar Range Maxima Queries

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Tsakalidis, Konstantinos

2011-01-01

We consider the dynamic two-dimensional maxima query problem. Let P be a set of n points in the plane. A point is maximal if it is not dominated by any other point in P. We describe two data structures that support the reporting of the t maximal points that dominate a given query point, and allow...... for insertions and deletions of points in P. In the pointer machine model we present a linear space data structure with O(logn + t) worst case query time and O(logn) worst case update time. This is the first dynamic data structure for the planar maxima dominance query problem that achieves these bounds...... are integers in the range U = {0, …,2 w  − 1 }. We present a linear space data structure that supports 3-sided range maxima queries in O(logn/loglogn+t) worst case time and updates in O(logn/loglogn) worst case time. These are the first sublogarithmic worst case bounds for all operations in the RAM model....

Nearest Neighbor Queries in Road Networks

DEFF Research Database (Denmark)

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

2003-01-01

in road networks. Such queries may be of use in many services. Specifically, we present an easily implementable data model that serves well as a foundation for such queries. We also present the design of a prototype system that implements the queries based on the data model. The algorithm used...

Clinician search behaviors may be influenced by search engine design.

Science.gov (United States)

Lau, Annie Y S; Coiera, Enrico; Zrimec, Tatjana; Compton, Paul

2010-06-30

Searching the Web for documents using information retrieval systems plays an important part in clinicians' practice of evidence-based medicine. While much research focuses on the design of methods to retrieve documents, there has been little examination of the way different search engine capabilities influence clinician search behaviors. Previous studies have shown that use of task-based search engines allows for faster searches with no loss of decision accuracy compared with resource-based engines. We hypothesized that changes in search behaviors may explain these differences. In all, 75 clinicians (44 doctors and 31 clinical nurse consultants) were randomized to use either a resource-based or a task-based version of a clinical information retrieval system to answer questions about 8 clinical scenarios in a controlled setting in a university computer laboratory. Clinicians using the resource-based system could select 1 of 6 resources, such as PubMed; clinicians using the task-based system could select 1 of 6 clinical tasks, such as diagnosis. Clinicians in both systems could reformulate search queries. System logs unobtrusively capturing clinicians' interactions with the systems were coded and analyzed for clinicians' search actions and query reformulation strategies. The most frequent search action of clinicians using the resource-based system was to explore a new resource with the same query, that is, these clinicians exhibited a "breadth-first" search behaviour. Of 1398 search actions, clinicians using the resource-based system conducted 401 (28.7%, 95% confidence interval [CI] 26.37-31.11) in this way. In contrast, the majority of clinicians using the task-based system exhibited a "depth-first" search behavior in which they reformulated query keywords while keeping to the same task profiles. Of 585 search actions conducted by clinicians using the task-based system, 379 (64.8%, 95% CI 60.83-68.55) were conducted in this way. This study provides evidence that

Adding Query Privacy to Robust DHTs

DEFF Research Database (Denmark)

Backes, Michael; Goldberg, Ian; Kate, Aniket

2011-01-01

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...... of obtaining query privacy over robust DHTs. Finally, we compare the performance of our privacy-preserving protocols with their more privacy-invasive counterparts. We observe that there is no increase in the message complexity and only a small overhead in the computational complexity....

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

Ranking Queries on Uncertain Data

CERN Document Server

Hua, Ming

2011-01-01

Uncertain data is inherent in many important applications, such as environmental surveillance, market analysis, and quantitative economics research. Due to the importance of those applications and rapidly increasing amounts of uncertain data collected and accumulated, analyzing large collections of uncertain data has become an important task. Ranking queries (also known as top-k queries) are often natural and useful in analyzing uncertain data. Ranking Queries on Uncertain Data discusses the motivations/applications, challenging problems, the fundamental principles, and the evaluation algorith

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

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

Flexible Query Answering Systems 2006

DEFF Research Database (Denmark)

-computer interaction. The overall theme of the FQAS conferences is innovative query systems aimed at providing easy, flexible, and intuitive access to information. Such systems are intended to facilitate retrieval from information repositories such as databases, libraries, and the World-Wide Web. These repositories......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...... are typically equipped with standard query systems which are often inadequate, and the focus of FQAS is the development of query systems that are more expressive, informative, cooperative, and productive. These proceedings contain contributions from invited speakers and 53 original papers out of about 100...

Understanding the Experience of Women in Undergraduate Engineering Programs at Public Universities

Science.gov (United States)

Perez, Jessica Ohanian

2017-01-01

Women earn bachelor's degrees in engineering at a rate of less than 17% at public universities in California. The purpose of this study was to understand how women experience undergraduate engineering programs at public universities. To understand this lack of attainment, a qualitative methodology and Feminist Poststructuralist perspective were…

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

Distance Teaching of Environmental Engineering Courses at the Open University.

Science.gov (United States)

Porteous, Andrew; Nesaratnam, Suresh T.; Anderson, Judith

1997-01-01

Describes two integrated distance learning environmental engineering degree courses offered by the environmental engineering group of the Open University in Great Britain. Discusses admission requirements for courses, advantages offered by distance learning, professional accreditation, site visits, and tutors. (AIM)

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.

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

Science.gov (United States)

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

2011-01-01

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

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

Query optimization over crowdsourced data

KAUST Repository

Park, Hyunjung; Widom, Jennifer

2013-01-01

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

DCODE: A Distributed Column-Oriented Database Engine for Big Data Analytics

OpenAIRE

Liu, Yanchen; Cao, Fang; Mortazavi, Masood; Chen, Mengmeng; Yan, Ning; Ku, Chi; Adnaik, Aniket; Morgan, Stephen; Shi, Guangyu; Wang, Yuhu; Fang, Fan

2015-01-01

Part 10: Big Data and Text Mining; International audience; We propose a novel Distributed Column-Oriented Database Engine (DCODE) for efficient analytic query processing that combines advantages of both column storage and parallel processing. In DCODE, we enhance an existing open-source columnar database engine by adding the capability for handling queries over a cluster. Specifically, we studied parallel query execution and optimization techniques such as horizontal partitioning, exchange op...

Correlation between National Influenza Surveillance Data and Search Queries from Mobile Devices and Desktops in South Korea.

Science.gov (United States)

Shin, Soo-Yong; Kim, Taerim; Seo, Dong-Woo; Sohn, Chang Hwan; Kim, Sung-Hoon; Ryoo, Seung Mok; Lee, Yoon-Seon; Lee, Jae Ho; Kim, Won Young; Lim, Kyoung Soo

2016-01-01

Digital surveillance using internet search queries can improve both the sensitivity and timeliness of the detection of a health event, such as an influenza outbreak. While it has recently been estimated that the mobile search volume surpasses the desktop search volume and mobile search patterns differ from desktop search patterns, the previous digital surveillance systems did not distinguish mobile and desktop search queries. The purpose of this study was to compare the performance of mobile and desktop search queries in terms of digital influenza surveillance. The study period was from September 6, 2010 through August 30, 2014, which consisted of four epidemiological years. Influenza-like illness (ILI) and virologic surveillance data from the Korea Centers for Disease Control and Prevention were used. A total of 210 combined queries from our previous survey work were used for this study. Mobile and desktop weekly search data were extracted from Naver, which is the largest search engine in Korea. Spearman's correlation analysis was used to examine the correlation of the mobile and desktop data with ILI and virologic data in Korea. We also performed lag correlation analysis. We observed that the influenza surveillance performance of mobile search queries matched or exceeded that of desktop search queries over time. The mean correlation coefficients of mobile search queries and the number of queries with an r-value of ≥ 0.7 equaled or became greater than those of desktop searches over the four epidemiological years. A lag correlation analysis of up to two weeks showed similar trends. Our study shows that mobile search queries for influenza surveillance have equaled or even become greater than desktop search queries over time. In the future development of influenza surveillance using search queries, the recognition of changing trend of mobile search data could be necessary.

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.

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.

The University, the Market, and the Geodetic Engineer or

DEFF Research Database (Denmark)

Stubkjær, Erik

2002-01-01

In Europe, universities have existed for more than 800 years. The university is the place in society for higher learning and related research. Through the ages, the universities have enjoyed a remarkably freedom relative to religious and secular powers. In recent years, the objectives and practises...... project, which concerned the education of geodetic engineers in Slovenia. The body of the paper presents a selection of ideas that shaped the university through the centuries, with a view to balance the present interest in advancing market-directed behaviour....

Optimal Planar Orthogonal Skyline Counting Queries

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Larsen, Kasper Green

2014-01-01

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

Universities and national laboratory roles in nuclear engineering

International Nuclear Information System (INIS)

Sackett, J.I.

1991-01-01

Nuclear Engineering Education is being significantly challenged in the United States. The decline in enrollment generally and the reduction of the number of nuclear engineering departments has been well documented. These declines parallel a lack of new construction for nuclear power plants and a decline in research and development to support new plant design. Precisely at a time when innovation is is needed to deal with many issues facing nuclear power, the number of qualified people to do so is being reduced. It is important that the University and National Laboratory Communities cooperate to address these issues. The Universities must increasingly identify challenges facing nuclear power that demand innovative solutions and pursue them. To be drawn into the technology the best students must see a future, a need and identify challenges that they can meet. The University community can provide that vision with help from the National Laboratories. It has been a major goal within the reactor development program at Argonne National Laboratory to establish the kind of program that can help accomplish this

Study of Search Engine Transaction Logs Shows Little Change in How Users use Search Engines. A review of: Jansen, Bernard J., and Amanda Spink. “How Are We Searching the World Wide Web? A Comparison of Nine Search Engine Transaction Logs.” Information Processing & Management 42.1 (2006: 248‐263.

Directory of Open Access Journals (Sweden)

David Hook

2006-09-01

Full Text Available Objective – To examine the interactions between users and search engines, and how they have changed over time. Design – Comparative analysis of search engine transaction logs. Setting – Nine major analyses of search engine transaction logs. Subjects – Nine web search engine studies (4 European, 5 American over a seven‐year period, covering the search engines Excite, Fireball, AltaVista, BWIE and AllTheWeb. Methods – The results from individual studies are compared by year of study for percentages of single query sessions, one term queries, operator (and, or, not, etc. usage and single result page viewing. As well, the authors group the search queries into eleven different topical categories and compare how the breakdown has changed over time. Main Results – Based on the percentage of single query sessions, it does not appear that the complexity of interactions has changed significantly for either the U.S.‐based or the European‐based search engines. As well, there was little change observed in the percentage of one‐term queries over the years of study for either the U.S.‐based or the European‐based search engines. Few users (generally less than 20% use Boolean or other operators in their queries, and these percentages have remained relatively stable. One area of noticeable change is in the percentage of users viewing only one results page, which has increased over the years of study. Based on the studies of the U.S.‐based search engines, the topical categories of ‘People, Place or Things’ and ‘Commerce, Travel, Employment or Economy’ are becoming more popular, while the categories of ‘Sex and Pornography’ and ‘Entertainment or Recreation’ are declining. Conclusions – The percentage of users viewing only one results page increased during the years of the study, while the percentages of single query sessions, oneterm sessions and operator usage remained stable. The increase in single result page viewing

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.

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.

QUERY RESPONSE TIME COMPARISON NOSQLDB MONGODB WITH SQLDB ORACLE

Directory of Open Access Journals (Sweden)

Humasak T. A. Simanjuntak

2015-01-01

Full Text Available Penyimpanan data saat ini terdapat dua jenis yakni relational database dan non-relational database. Kedua jenis DBMS (Database Managemnet System tersebut berbeda dalam berbagai aspek seperti per-formansi eksekusi query, scalability, reliability maupun struktur penyimpanan data. Kajian ini memiliki tujuan untuk mengetahui perbandingan performansi DBMS antara Oracle sebagai jenis relational data-base dan MongoDB sebagai jenis non-relational database dalam mengolah data terstruktur. Eksperimen dilakukan untuk mengetahui perbandingan performansi kedua DBMS tersebut untuk operasi insert, select, update dan delete dengan menggunakan query sederhana maupun kompleks pada database Northwind. Untuk mencapai tujuan eksperimen, 18 query yang terdiri dari 2 insert query, 10 select query, 2 update query dan 2 delete query dieksekusi. Query dieksekusi melalui sebuah aplikasi .Net yang dibangun sebagai perantara antara user dengan basis data. Eksperimen dilakukan pada tabel dengan atau tanpa relasi pada Oracle dan embedded atau bukan embedded dokumen pada MongoDB. Response time untuk setiap eksekusi query dibandingkan dengan menggunakan metode statistik. Eksperimen menunjukkan response time query untuk proses select, insert, dan update pada MongoDB lebih cepatdaripada Oracle. MongoDB lebih cepat 64.8 % untuk select query;MongoDB lebihcepat 72.8 % untuk insert query dan MongoDB lebih cepat 33.9 % untuk update query. Pada delete query, Oracle lebih cepat 96.8 % daripada MongoDB untuk table yang berelasi, tetapi MongoDB lebih cepat 83.8 % daripada Oracle untuk table yang tidak memiliki relasi.Untuk query kompleks dengan Map Reduce pada MongoDB lebih lambat 97.6% daripada kompleks query dengan aggregate function pada Oracle.

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.

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.

Knowledge Query Language (KQL)

Science.gov (United States)

2016-02-12

described as a sparse, distributed multidimensional sorted map. Unlike a relational database , BigTable has no multicolumn primary keys or constraints. The...in query languages such as SQL. Figure 3. Address expression-based querying. Each circled step in Figure 3 is described below. Datastore/ Database ...implementation we describe in later sections stores the instance of registry ontology in JSON files. 7 Throughout the rest of this report, we use the

XQOWL: An Extension of XQuery for OWL Querying and Reasoning

Directory of Open Access Journals (Sweden)

Jesús M. Almendros-Jiménez

2015-01-01

Full Text Available One of the main aims of the so-called Web of Data is to be able to handle heterogeneous resources where data can be expressed in either XML or RDF. The design of programming languages able to handle both XML and RDF data is a key target in this context. In this paper we present a framework called XQOWL that makes possible to handle XML and RDF/OWL data with XQuery. XQOWL can be considered as an extension of the XQuery language that connects XQuery with SPARQL and OWL reasoners. XQOWL embeds SPARQL queries (via Jena SPARQL engine in XQuery and enables to make calls to OWL reasoners (HermiT, Pellet and FaCT++ from XQuery. It permits to combine queries against XML and RDF/OWL resources as well as to reason with RDF/OWL data. Therefore input data can be either XML or RDF/OWL and output data can be formatted in XML (also using RDF/OWL XML serialization.

Enhancing Recall in Semantic Querying

DEFF Research Database (Denmark)

Rouces, Jacobo

2013-01-01

lexically and structurally different, which we will introduce in the next section. As RDF graphs from different sources are expected to be linked, the modeling heterogeneities will make the federated graph become sparser and inconsistent. This is detrimental to the recall of SPARQL queries, as the query...

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.

SCRY: Enabling quantitative reasoning in SPARQL queries

NARCIS (Netherlands)

Meroño-Peñuela, A.; Stringer, Bas; Loizou, Antonis; Abeln, Sanne; Heringa, Jaap

2015-01-01

The inability to include quantitative reasoning in SPARQL queries slows down the application of Semantic Web technology in the life sciences. SCRY, our SPARQL compatible service layer, improves this by executing services at query time and making their outputs query-accessible, generating RDF data on

Answering SPARQL queries modulo RDF Schema with paths

OpenAIRE

Alkhateeb, Faisal; Euzenat, Jérôme

2013-01-01

alkhateeb2013a; SPARQL is the standard query language for RDF graphs. In its strict instantiation, it only offers querying according to the RDF semantics and would thus ignore the semantics of data expressed with respect to (RDF) schemas or (OWL) ontologies. Several extensions to SPARQL have been proposed to query RDF data modulo RDFS, i.e., interpreting the query with RDFS semantics and/or considering external ontologies. We introduce a general framework which allows for expressing query ans...

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

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

INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR

OpenAIRE

Fadhilah Mat Yamin; T. Ramayah

2013-01-01

The behaviour of the searcher when using the search engine especially during the query formulation is crucial. Search engines capture users’ activities in the search log, which is stored at the search engine server. Due to the difficulty of obtaining this search log, this paper proposed and develops an interface framework to interface a Google search engine. This interface will capture users’ queries before redirect them to Google. The analysis of the search log will show that users are utili...

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)

The University of Michigan's Computer-Aided Engineering Network.

Science.gov (United States)

Atkins, D. E.; Olsen, Leslie A.

1986-01-01

Presents an overview of the Computer-Aided Engineering Network (CAEN) of the University of Michigan. Describes its arrangement of workstations, communication networks, and servers. Outlines the factors considered in hardware and software decision making. Reviews the program's impact on students. (ML)

SPARQL Query Re-writing Using Partonomy Based Transformation Rules

Science.gov (United States)

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

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

Mobile Information Access with Spoken Query Answering

DEFF Research Database (Denmark)

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

2006-01-01

window focused over the part which most likely contains an answer to the query. The two systems are integrated into a full spoken query answering system. The prototype can answer queries and questions within the chosen football (soccer) test domain, but the system has the flexibility for being ported...

On the formulation of performant sparql queries

NARCIS (Netherlands)

Loizou, A.; Angles, R.; Groth, P.T.

2014-01-01

Abstract The combination of the flexibility of RDF and the expressiveness of SPARQL provides a powerful mechanism to model, integrate and query data. However, these properties also mean that it is nontrivial to write performant SPARQL queries. Indeed, it is quite easy to create queries that tax even

Job Satisfaction Analysis of Faculty Members in Public Sector Engineering Universities: An Empirical Investigation

Directory of Open Access Journals (Sweden)

AMEER ALI SHAHANI

2017-07-01

Full Text Available Most of the researchers have conducted study on the job satisfaction of the faculty members in Non? Engineering Universities only few have paid their attention in the Public Sector Engineering Universities. This study is the first attempt towards the research on faculty members? job satisfaction in public sector engineering universities of Sindh, Pakistan. The focus of this research is to assess the faculty members?job satisfaction on the perspectives of different factors i.e. compensation, research and technology, management style, recognition, working environment, in-service teaching training. The data was collected and analyzed using SPSS version 17.0 on five point likert scale. Regression, Correlation and ANOVAs (Analysis of Variance tests were conducted. Results showed that faculty members of the public sector engineering universities have lower job satisfaction. The finding suggested that, the study is useful for the management of universities in order to rectify the areas of dissatisfaction and to tackle the issues related to the faculty members regarding their job satisfaction.

Evaluation of Sub Query Performance in SQL Server

Science.gov (United States)

Oktavia, Tanty; Sujarwo, Surya

2014-03-01

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.

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.

Adding query privacy to robust DHTs

DEFF Research Database (Denmark)

Backes, Michael; Goldberg, Ian; Kate, Aniket

2012-01-01

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...... privacy over robust DHTs. Finally, we compare the performance of our privacy-preserving protocols with their more privacy-invasive counterparts. We observe that there is no increase in the message complexity...

SPARQL Assist language-neutral query composer

Science.gov (United States)

2012-01-01

Background SPARQL query composition is difficult for the lay-person, and even the experienced bioinformatician in cases where the data model is unfamiliar. Moreover, established best-practices and internationalization concerns dictate that the identifiers for ontological terms should be opaque rather than human-readable, which further complicates the task of synthesizing queries manually. Results We present SPARQL Assist: a Web application that addresses these issues by providing context-sensitive type-ahead completion during SPARQL query construction. Ontological terms are suggested using their multi-lingual labels and descriptions, leveraging existing support for internationalization and language-neutrality. Moreover, the system utilizes the semantics embedded in ontologies, and within the query itself, to help prioritize the most likely suggestions. Conclusions To ensure success, the Semantic Web must be easily available to all users, regardless of locale, training, or preferred language. By enhancing support for internationalization, and moreover by simplifying the manual construction of SPARQL queries through the use of controlled-natural-language interfaces, we believe we have made some early steps towards simplifying access to Semantic Web resources. PMID:22373327

SPARQL assist language-neutral query composer.

Science.gov (United States)

McCarthy, Luke; Vandervalk, Ben; Wilkinson, Mark

2012-01-25

SPARQL query composition is difficult for the lay-person, and even the experienced bioinformatician in cases where the data model is unfamiliar. Moreover, established best-practices and internationalization concerns dictate that the identifiers for ontological terms should be opaque rather than human-readable, which further complicates the task of synthesizing queries manually. We present SPARQL Assist: a Web application that addresses these issues by providing context-sensitive type-ahead completion during SPARQL query construction. Ontological terms are suggested using their multi-lingual labels and descriptions, leveraging existing support for internationalization and language-neutrality. Moreover, the system utilizes the semantics embedded in ontologies, and within the query itself, to help prioritize the most likely suggestions. To ensure success, the Semantic Web must be easily available to all users, regardless of locale, training, or preferred language. By enhancing support for internationalization, and moreover by simplifying the manual construction of SPARQL queries through the use of controlled-natural-language interfaces, we believe we have made some early steps towards simplifying access to Semantic Web resources.

Query Optimizations over Decentralized RDF Graphs

KAUST Repository

Abdelaziz, Ibrahim; Mansour, Essam; Ouzzani, Mourad; Aboulnaga, Ashraf; Kalnis, Panos

2017-01-01

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

On a New Approach to Education about Ethics for Engineers at Meijou University

Science.gov (United States)

Fukaya, Minoru; Morimoto, Tsukasa; Kimura, Noritsugu

We propose a new approach to education of so called “engineering ethics”. This approach has two important elements in its teaching system. One is “problem-solving learning”, and the other is “discussion ability”. So far, engineering ethics started at the ethical standpoint. But we put the viewpoint of problem-solving learning at the educational base of engineering ethics. Because many problems have complicated structures, so if we want to solve them, we should discuss each other. Problem-solving ability and discussion ability, they help engineers to solve the complex problems in their social everyday life. Therefore, Meijo University names engineering ethics “ethics for engineers”. At Meijou University about 1300 students take classes in both ethics for engineers and environmental ethics for one year.

Perm State University HPC-hardware and software services: capabilities for aircraft engine aeroacoustics problems solving

Science.gov (United States)

Demenev, A. G.

2018-02-01

The present work is devoted to analyze high-performance computing (HPC) infrastructure capabilities for aircraft engine aeroacoustics problems solving at Perm State University. We explore here the ability to develop new computational aeroacoustics methods/solvers for computer-aided engineering (CAE) systems to handle complicated industrial problems of engine noise prediction. Leading aircraft engine engineering company, including “UEC-Aviadvigatel” JSC (our industrial partners in Perm, Russia), require that methods/solvers to optimize geometry of aircraft engine for fan noise reduction. We analysed Perm State University HPC-hardware resources and software services to use efficiently. The performed results demonstrate that Perm State University HPC-infrastructure are mature enough to face out industrial-like problems of development CAE-system with HPC-method and CFD-solvers.

PERANGKAT BANTU UNTUK OPTIMASI QUERY PADA ORACLE DENGAN RESTRUKTURISASI SQL

Directory of Open Access Journals (Sweden)

Darlis Heru Murti

2006-07-01

Full Text Available Query merupakan bagian dari bahasa pemrograman SQL (Structured Query Language yang berfungsi untuk mengambil data (read dalam DBMS (Database Management System, termasuk Oracle [3]. Pada Oracle, ada tiga tahap proses yang dilakukan dalam pengeksekusian query, yaitu Parsing, Execute dan Fetch. Sebelum proses execute dijalankan, Oracle terlebih dahulu membuat execution plan yang akan menjadi skenario dalam proses excute.Dalam proses pengeksekusian query, terdapat faktor-faktor yang mempengaruhi kinerja query, di antaranya access path (cara pengambilan data dari sebuah tabel dan operasi join (cara menggabungkan data dari dua tabel. Untuk mendapatkan query dengan kinerja optimal, maka diperlukan pertimbangan-pertimbangan dalam menyikapi faktor-faktor tersebut.  Optimasi query merupakan suatu cara untuk mendapatkan query dengan kinerja seoptimal mungkin, terutama dilihat dari sudut pandang waktu. Ada banyak metode untuk mengoptimasi query, tapi pada Penelitian ini, penulis membuat sebuah aplikasi untuk mengoptimasi query dengan metode restrukturisasi SQL statement. Pada metode ini, objek yang dianalisa adalah struktur klausa yang membangun sebuah query. Aplikasi ini memiliki satu input dan lima jenis output. Input dari aplikasi ini adalah sebuah query sedangkan kelima jenis output aplikasi ini adalah berupa query hasil optimasi, saran perbaikan, saran pembuatan indeks baru, execution plan dan data statistik. Cara kerja aplikasi ini dibagi menjadi empat tahap yaitu mengurai query menjadi sub query, mengurai query per-klausa, menentukan access path dan operasi join dan restrukturisasi query.Dari serangkaian ujicoba yang dilakukan penulis, aplikasi telah dapat berjalan sesuai dengan tujuan pembuatan Penelitian ini, yaitu mendapatkan query dengan kinerja optimal.Kata Kunci : Query, SQL, DBMS, Oracle, Parsing, Execute, Fetch, Execution Plan, Access Path, Operasi Join, Restrukturisasi SQL statement.

University Teachers' Perspectives on the Role of the Laplace Transform in Engineering Education

Science.gov (United States)

Holmberg, Margarita; Bernhard, Jonte

2017-01-01

The Laplace transform is an important tool in many branches of engineering, for example, electric and control engineering, but is also regarded as a difficult topic for students to master. We have interviewed 22 university teachers from five universities in three countries (Mexico, Spain and Sweden) about their views on relationships among…

Evaluating SPARQL queries on massive RDF datasets

KAUST Repository

Al-Harbi, Razen; Abdelaziz, Ibrahim; Kalnis, Panos; Mamoulis, Nikos

2015-01-01

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.

The University of Utah Nuclear Engineering Program

International Nuclear Information System (INIS)

Jevremovic, T.; McDonald, L. IV; Schow, R.

2016-01-01

As of 2014, the University of Utah Nuclear Engineering Program (UNEP) manages and maintains over 7,000 ft 2 (~650 m 2 ) nuclear engineering facilities that includes 100 kW TRIGA Mark I and numerous laboratories such as radiochemistry, microscopy, nuclear forensics, nuclear medicine, radiation detection and instrumentation laboratories. The UNEP offers prestigious educational and training programs in the field of faculty reserach: reactor physics, reactor design and operation, advanced numerical modeling and visualizations in radiation transport, radiochemistry, nuclear forensics, radiation detection and detector designs, signal processing, nuclear medicine, nuclear space and nuclear robotic’s engineering and radiological sciences. With the state-of-the-art nuclear instrumentation and state-of-the-art numerical modeling tools, reserach reactor and modernized educational and training programs, we positioned ourselves in the last five years as the fastest growing national nuclear engineering program attracting the students from many disciplines such as but not limited to: chemical engineering, civil engineering, environmental engineering, chemistry, physics, astronomy, medical sciences, and others. From 2012, we uniquely developed and implemented the nuclear power plants’ safety culture paradigm that we use for day-to-day operation, management and maintenance of our facilities, as well as train all our students at undergraduate and graduate levels of studies. We developed also a new distance-learning approaches in sharing knowledge about experiential learning based on no-cost internet-tools combined with the use of mobile technologies. (author)

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.

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.

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...... of data grows. This is a particular problem when querying time series data, which generally contains multiple measures recorded at fine time granularities. Usually, this issue is addressed either by scaling up hardware or by employing workload based query optimization techniques. However, these solutions...

Educating Maritime Engineers for a Globalised Industry - Bridging the Gap Between Industry and Universities

DEFF Research Database (Denmark)

Andersen, Ingrid Marie Vincent; Nielsen, Ulrik Dam

2012-01-01

In Denmark, the maritime engineering competences requested by the industry have changed in the past one to two decades. The typical naval architects do no longer find themselves working in the ship-building industry but rather in the industry of ship operators, consultancies, class societies, etc....... This means that universities educating maritime engineers need to reflect the changes in the curricula for their maritime engineering students. Topics and issues regarding this matter have recently been addressed in a survey made in the Danish maritime industry. The survey concludes that the demand...... for maritime engineers in the industry is considerably larger than the output from the technical universities. Moreover, it sets forth a series of recommendations to the industry as well as to the universities to facilitate meeting the demand for maritime engineers in Denmark in the future. The recommendations...

Flexible Query Answering Systems

DEFF Research Database (Denmark)

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

Transferring experience labs for production engineering students to universities in newly industrialized countries

Science.gov (United States)

Leiden, A.; Posselt, G.; Bhakar, V.; Singh, R.; Sangwan, K. S.; Herrmann, C.

2018-01-01

The Indian economy is one of the fastest growing economies in the world and the demand for the skilled engineers is increasing. Subsequently the Indian education sector is growing to provide the necessary number of skilled engineers. Current Indian engineering graduates have broad theoretical background but lack in methodological, soft and practical skills. To bridge this gap, the experience lab ideas from the engineering education at “Die Lernfabrik” (learning factory) of the Technische Universität Braunschweig (TU Braunschweig) is transferred to the Birla Institute of Technology and Science in Pilani (BITS Pilani), India. This Lernfabrik successfully strengthened the methodological, soft and practical skills of the TU Braunschweig production-engineering graduates. The target group is discrete manufacturing education with focusing on energy and resource efficiency as well as cyber physical production systems. As the requirements of industry and academia in India differs from Germany, the transfer of the experience lab to the Indian education system needs special attention to realize a successful transfer project. This publication provides a unique approach to systematically transfer the educational concept in Learning Factory from a specific university environment to a different environment in a newly industrialized country. The help of a bilateral university driven practice partnership between the two universities creates a lighthouse for the Indian university environment.

Algebraic Optimization of Recursive Database Queries

DEFF Research Database (Denmark)

Hansen, Michael Reichhardt

1988-01-01

Queries are expressed by relational algebra expressions including a fixpoint operation. A condition is presented under which a natural join commutes with a fixpoint operation. This condition is a simple check of attribute sets of sub-expressions of the query. The work may be considered a generali......Queries are expressed by relational algebra expressions including a fixpoint operation. A condition is presented under which a natural join commutes with a fixpoint operation. This condition is a simple check of attribute sets of sub-expressions of the query. The work may be considered...... a generalization of Aho and Ullman, (1979). The result is interpreted in function free logic database terms as a transformation of the recursively defined predicate involving: (a) elimination of an argument, and (b) propagation of selections (instantiations) to the extensionally defined predicates. A collection...

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......, 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...... the method to a use case of transforming queries from SM4MQ to a vector representation. For the use case, we developed the prototype and performed an evaluation that shows how our approach can significantly ease and support user assistance such as query recommendation....

Keeping Dublin Core Simple: Cross-Domain Discovery or Resource Description?; First Steps in an Information Commerce Economy: Digital Rights Management in the Emerging E-Book Environment; Interoperability: Digital Rights Management and the Emerging EBook Environment; Searching the Deep Web: Direct Query Engine Applications at the Department of Energy.

Science.gov (United States)

Lagoze, Carl; Neylon, Eamonn; Mooney, Stephen; Warnick, Walter L.; Scott, R. L.; Spence, Karen J.; Johnson, Lorrie A.; Allen, Valerie S.; Lederman, Abe

2001-01-01

Includes four articles that discuss Dublin Core metadata, digital rights management and electronic books, including interoperability; and directed query engines, a type of search engine designed to access resources on the deep Web that is being used at the Department of Energy. (LRW)

Mining the SDSS SkyServer SQL queries log

Science.gov (United States)

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

2016-05-01

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

Fragger: a protein fragment picker for structural queries.

Science.gov (United States)

Berenger, Francois; Simoncini, David; Voet, Arnout; Shrestha, Rojan; Zhang, Kam Y J

2017-01-01

Protein modeling and design activities often require querying the Protein Data Bank (PDB) with a structural fragment, possibly containing gaps. For some applications, it is preferable to work on a specific subset of the PDB or with unpublished structures. These requirements, along with specific user needs, motivated the creation of a new software to manage and query 3D protein fragments. Fragger is a protein fragment picker that allows protein fragment databases to be created and queried. All fragment lengths are supported and any set of PDB files can be used to create a database. Fragger can efficiently search a fragment database with a query fragment and a distance threshold. Matching fragments are ranked by distance to the query. The query fragment can have structural gaps and the allowed amino acid sequences matching a query can be constrained via a regular expression of one-letter amino acid codes. Fragger also incorporates a tool to compute the backbone RMSD of one versus many fragments in high throughput. Fragger should be useful for protein design, loop grafting and related structural bioinformatics tasks.

GMB: An Efficient Query Processor for Biological Data

Directory of Open Access Journals (Sweden)

Taha Kamal

2011-06-01

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

Sustainability in engineering programs in a Portuguese Public University

Directory of Open Access Journals (Sweden)

Ciliana Regina Colombo

Full Text Available Abstract Rethink the interventions, human practices and their effects on the natural environment, for the preservation of life and biodiversity, threatened by the capitalist model of production, consumption and disposal, becomes each day more indispensable. The role of universities as knowledge building space is fundamental for the insertion of the environmental approach (greening in its various fronts (education, research, extension, and management. Following the line of several types of researches about the subject, this paper aims to identify if and how the issue of sustainability (e.g. through Project-Based Learning use is taught in the various engineering programs of a Portuguese Public University. This study was carried out by a documental research based on the programs´ curricula published in the official website of the university. The engineering programs selected included integrated master, master (second cycle and doctorate (third cycle. In this study, it was identified programs that are more focused on sustainability concepts than others, so the programs were classified in three categories: strongest, medium and weakest focus.

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

Approximate furthest neighbor with application to annulus query

DEFF Research Database (Denmark)

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

2016-01-01

-dimensional Euclidean space. The method builds on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk׳s approximation factor and reducing the running time by a logarithmic factor. We also present......, the query-dependent approach is used for deriving a data structure for the approximate annulus query problem, which is defined as follows: given an input set S and two parameters r>0 and w≥1, construct a data structure that returns for each query point q a point p∈S such that the distance between p and q...

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

Concepts and implementations of natural language query systems

Science.gov (United States)

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

1984-01-01

The currently developed user language interfaces of information systems are generally intended for serious users. These interfaces commonly ignore potentially the largest user group, i.e., casual users. This project discusses the concepts and implementations of a natural query language system which satisfy the nature and information needs of casual users by allowing them to communicate with the system in the form of their native (natural) language. In addition, a framework for the development of such an interface is also introduced for the MADAM (Multics Approach to Data Access and Management) system at the University of Southwestern Louisiana.

Spatial Keyword Query Processing

DEFF Research Database (Denmark)

Chen, Lisi; Jensen, Christian S.; Wu, Dingming

2013-01-01

Geo-textual indices play an important role in spatial keyword query- ing. The existing geo-textual indices have not been compared sys- tematically under the same experimental framework. This makes it difficult to determine which indexing technique best supports specific functionality. We provide...... an all-around survey of 12 state- of-the-art geo-textual indices. We propose a benchmark that en- ables the comparison of the spatial keyword query performance. We also report on the findings obtained when applying the bench- mark to the indices, thus uncovering new insights that may guide index...

RDF-GL: A SPARQL-Based Graphical Query Language for RDF

Science.gov (United States)

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

This chapter presents RDF-GL, a graphical query language (GQL) for RDF. The GQL is based on the textual query language SPARQL and mainly focuses on SPARQL SELECT queries. The advantage of a GQL over textual query languages is that complexity is hidden through the use of graphical symbols. RDF-GL is supported by a Java-based editor, SPARQLinG, which is presented as well. The editor does not only allow for RDF-GL query creation, but also converts RDF-GL queries to SPARQL queries and is able to subsequently execute these. Experiments show that using the GQL in combination with the editor makes RDF querying more accessible for end users.

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

A Multi-Query Optimizer for Monet

NARCIS (Netherlands)

S. Manegold (Stefan); A.J. Pellenkoft (Jan); M.L. Kersten (Martin)

2000-01-01

textabstractDatabase systems allow for concurrent use of several applications (and query interfaces). Each application generates an ``optimal'' plan---a sequence of low-level database operators---for accessing the database. The queries posed by users through the same application can be optimized

A multi-query optimizer for Monet

NARCIS (Netherlands)

S. Manegold (Stefan); A.J. Pellenkoft (Jan); M.L. Kersten (Martin)

2000-01-01

textabstractDatabase systems allow for concurrent use of several applications (and query interfaces). Each application generates an ``optimal'' plan---a sequence of low-level database operators---for accessing the database. The queries posed by users through the same application can be optimized

Software Engineering Education at Carnegie Mellon University: One University; Programs Taught in Two Places

Directory of Open Access Journals (Sweden)

Ray Bareiss

2009-10-01

Full Text Available Teaching Software Engineering to professional master‟s students is a challenging endeavor, and arguably for the past 20 years, Carnegie Mellon University has been quite successful. Although CMU teaches Software Engineering at sites world-wide and uses different pedagogies, the goal of the curriculum -- to produce world-class software engineers -- remains constant. This paper will discuss two of the most mature versions of Carnegie Mellon‟s Software Engineering program -- the main campus program and its "daughter program" at the Silicon Valley Campus. We discuss the programs with respect to the dimensions of curriculum, how students work and learn, how faculty teach, curricular materials, and how students are assessed to provide insight into how Carnegie Mellon continues to keep its programs fresh, to adapt them to local needs, and to meet its goal of excellence after 20 years.

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

Result Diversification Based on Query-Specific Cluster Ranking

NARCIS (Netherlands)

J. He (Jiyin); E. Meij; M. de Rijke (Maarten)

2011-01-01

htmlabstractResult diversification is a retrieval strategy for dealing with ambiguous or multi-faceted queries by providing documents that cover as many facets of the query as possible. We propose a result diversification framework based on query-specific clustering and cluster ranking,

Visual Querying in Chemical Databases using SMARTS Patterns

OpenAIRE

Šípek, Vojtěch

2014-01-01

The purpose of this thesis is to create framework for visual querying in chemical databases which will be implemented as a web application. By using graphical editor, which is a part of client side, the user creates queries which are translated into chemical query language SMARTS. This query is parsed on the application server which is connected to the chemical database. This framework also contains tooling for creating the database and index structure above it. 1

Analysis of Search Engines and Meta Search Engines\\\\\\' Position by University of Isfahan Users Based on Rogers\\\\\\' Diffusion of Innovation Theory

Directory of Open Access Journals (Sweden)

Maryam Akbari

2012-10-01

Full Text Available The present study investigated the analysis of search engines and meta search engines adoption process by University of Isfahan users during 2009-2010 based on the Rogers' diffusion of innovation theory. The main aim of the research was to study the rate of adoption and recognizing the potentials and effective tools in search engines and meta search engines adoption among University of Isfahan users. The research method was descriptive survey study. The cases of the study were all of the post graduate students of the University of Isfahan. 351 students were selected as the sample and categorized by a stratified random sampling method. Questionnaire was used for collecting data. The collected data was analyzed using SPSS 16 in both descriptive and analytic statistic. For descriptive statistic frequency, percentage and mean were used, while for analytic statistic t-test and Kruskal-Wallis non parametric test (H-test were used. The finding of t-test and Kruscal-Wallis indicated that the mean of search engines and meta search engines adoption did not show statistical differences gender, level of education and the faculty. Special search engines adoption process was different in terms of gender but not in terms of the level of education and the faculty. Other results of the research indicated that among general search engines, Google had the most adoption rate. In addition, among the special search engines, Google Scholar and among the meta search engines Mamma had the most adopting rate. Findings also showed that friends played an important role on how students adopted general search engines while professors had important role on how students adopted special search engines and meta search engines. Moreover, results showed that the place where students got the most acquaintance with search engines and meta search engines was in the university. The finding showed that the curve of adoption rate was not normal and it was not also in S-shape. Morover

Annual report of Radiation Laboratory Department of Nuclear Engineering Faculty of Engineering, Kyoto University

International Nuclear Information System (INIS)

1993-07-01

This publication is the collection of the papers presented research activities of Radiation laboratory, Department of Nuclear Engineering, Kyoto University during the 1992 academic/fiscal year (April, 1992 - March, 1993). The 48 of the presented papers are indexed individually. (J.P.N.)

Result diversification based on query-specific cluster ranking

NARCIS (Netherlands)

He, J.; Meij, E.; de Rijke, M.

2011-01-01

Result diversification is a retrieval strategy for dealing with ambiguous or multi-faceted queries by providing documents that cover as many facets of the query as possible. We propose a result diversification framework based on query-specific clustering and cluster ranking, in which diversification

Learning analytics: Dataset for empirical evaluation of entry requirements into engineering undergraduate programs in a Nigerian university.

Science.gov (United States)

Odukoya, Jonathan A; Popoola, Segun I; Atayero, Aderemi A; Omole, David O; Badejo, Joke A; John, Temitope M; Olowo, Olalekan O

2018-04-01

In Nigerian universities, enrolment into any engineering undergraduate program requires that the minimum entry criteria established by the National Universities Commission (NUC) must be satisfied. Candidates seeking admission to study engineering discipline must have reached a predetermined entry age and met the cut-off marks set for Senior School Certificate Examination (SSCE), Unified Tertiary Matriculation Examination (UTME), and the post-UTME screening. However, limited effort has been made to show that these entry requirements eventually guarantee successful academic performance in engineering programs because the data required for such validation are not readily available. In this data article, a comprehensive dataset for empirical evaluation of entry requirements into engineering undergraduate programs in a Nigerian university is presented and carefully analyzed. A total sample of 1445 undergraduates that were admitted between 2005 and 2009 to study Chemical Engineering (CHE), Civil Engineering (CVE), Computer Engineering (CEN), Electrical and Electronics Engineering (EEE), Information and Communication Engineering (ICE), Mechanical Engineering (MEE), and Petroleum Engineering (PET) at Covenant University, Nigeria were randomly selected. Entry age, SSCE aggregate, UTME score, Covenant University Scholastic Aptitude Screening (CUSAS) score, and the Cumulative Grade Point Average (CGPA) of the undergraduates were obtained from the Student Records and Academic Affairs unit. In order to facilitate evidence-based evaluation, the robust dataset is made publicly available in a Microsoft Excel spreadsheet file. On yearly basis, first-order descriptive statistics of the dataset are presented in tables. Box plot representations, frequency distribution plots, and scatter plots of the dataset are provided to enrich its value. Furthermore, correlation and linear regression analyses are performed to understand the relationship between the entry requirements and the

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

Science.gov (United States)

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

2014-01-01

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

Sundanese ancient manuscripts search engine using probability approach

Science.gov (United States)

Suryani, Mira; Hadi, Setiawan; Paulus, Erick; Nurma Yulita, Intan; Supriatna, Asep K.

2017-10-01

Today, Information and Communication Technology (ICT) has become a regular thing for every aspect of live include cultural and heritage aspect. Sundanese ancient manuscripts as Sundanese heritage are in damage condition and also the information that containing on it. So in order to preserve the information in Sundanese ancient manuscripts and make them easier to search, a search engine has been developed. The search engine must has good computing ability. In order to get the best computation in developed search engine, three types of probabilistic approaches: Bayesian Networks Model, Divergence from Randomness with PL2 distribution, and DFR-PL2F as derivative form DFR-PL2 have been compared in this study. The three probabilistic approaches supported by index of documents and three different weighting methods: term occurrence, term frequency, and TF-IDF. The experiment involved 12 Sundanese ancient manuscripts. From 12 manuscripts there are 474 distinct terms. The developed search engine tested by 50 random queries for three types of query. The experiment results showed that for the single query and multiple query, the best searching performance given by the combination of PL2F approach and TF-IDF weighting method. The performance has been evaluated using average time responds with value about 0.08 second and Mean Average Precision (MAP) about 0.33.

Current Status and Issues of Nuclear Engineering Research and Educational Facilities in Universities

International Nuclear Information System (INIS)

2004-01-01

It is important to discuss about nuclear engineering research and educational facilities in universities after new educational foundation. 12 universities investigated issues and a countermeasure of them. The results of a questionnaire survey, issues and countermeasure are shown in this paper. The questionnaire on the future nuclear researches, development of education, project, maintenance of nuclear and radioactive facilities and accelerator, control of uranium in subcritical test facilities, use of new corporation facilities, the fixed number of student, number of graduate, student experiments, themes of experiments and researches, the state of educational facilities are carried out. The results of questionnaire were summarized as followings: the fixed number of student (B/M/D) on nuclear engineering, exercise of reactor, education, themes, educational and research facilities, significance of nuclear engineering education in university and proposal. (S.Y.)

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

Exploiting External Collections for Query Expansion

NARCIS (Netherlands)

Weerkamp, W.; Balog, K.; de Rijke, M.

2012-01-01

A persisting challenge in the field of information retrieval is the vocabulary mismatch between a user’s information need and the relevant documents. One way of addressing this issue is to apply query modeling: to add terms to the original query and reweigh the terms. In social media, where

Sonata: Query-Driven Network Telemetry

KAUST Repository

Gupta, Arpit; Harrison, Rob; Pawar, Ankita; Birkner, Rü diger; Canini, Marco; Feamster, Nick; Rexford, Jennifer; Willinger, Walter

2017-01-01

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.

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.

Noesis: Ontology based Scoped Search Engine and Resource Aggregator for Atmospheric Science

Science.gov (United States)

Ramachandran, R.; Movva, S.; Li, X.; Cherukuri, P.; Graves, S.

2006-12-01

The goal for search engines is to return results that are both accurate and complete. The search engines should find only what you really want and find everything you really want. Search engines (even meta search engines) lack semantics. The basis for search is simply based on string matching between the user's query term and the resource database and the semantics associated with the search string is not captured. For example, if an atmospheric scientist is searching for "pressure" related web resources, most search engines return inaccurate results such as web resources related to blood pressure. In this presentation Noesis, which is a meta-search engine and a resource aggregator that uses domain ontologies to provide scoped search capabilities will be described. Noesis uses domain ontologies to help the user scope the search query to ensure that the search results are both accurate and complete. The domain ontologies guide the user to refine their search query and thereby reduce the user's burden of experimenting with different search strings. Semantics are captured by refining the query terms to cover synonyms, specializations, generalizations and related concepts. Noesis also serves as a resource aggregator. It categorizes the search results from different online resources such as education materials, publications, datasets, web search engines that might be of interest to the user.

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

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.

Experience in nuclear engineering distance education at the University of Tennessee

International Nuclear Information System (INIS)

Dodds, H.L.

2011-01-01

This paper describes the distance education programs in nuclear engineering at The University of Tennessee (UT), which includes several courses that are of interest to the mathematics and computation community such as reactor theory and design, shielding, statistics, health physics, and criticality safety. All of the courses needed for the MS degree in nuclear engineering and several of the courses needed for the PhD degree in nuclear engineering are delivered synchronously (i.e., interactive in real time) via the Internet to students located anywhere by instructors located anywhere. The paper will also describe the historical development of distance education programs at UT as well as the benefits of the programs to students and to the university. The oral presentation associated with this paper will include a short movie that demonstrates the technology used for distance delivery. (author)

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

Science.gov (United States)

Pentoney, Christopher; Harwell, Jeff; Leroy, Gondy

2014-01-01

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

Research in Mobile Database Query Optimization and Processing

Directory of Open Access Journals (Sweden)

Agustinus Borgy Waluyo

2005-01-01

Full Text Available The emergence of mobile computing provides the ability to access information at any time and place. However, as mobile computing environments have inherent factors like power, storage, asymmetric communication cost, and bandwidth limitations, efficient query processing and minimum query response time are definitely of great interest. This survey groups a variety of query optimization and processing mechanisms in mobile databases into two main categories, namely: (i query processing strategy, and (ii caching management strategy. Query processing includes both pull and push operations (broadcast mechanisms. We further classify push operation into on-demand broadcast and periodic broadcast. Push operation (on-demand broadcast relates to designing techniques that enable the server to accommodate multiple requests so that the request can be processed efficiently. Push operation (periodic broadcast corresponds to data dissemination strategies. In this scheme, several techniques to improve the query performance by broadcasting data to a population of mobile users are described. A caching management strategy defines a number of methods for maintaining cached data items in clients' local storage. This strategy considers critical caching issues such as caching granularity, caching coherence strategy and caching replacement policy. Finally, this survey concludes with several open issues relating to mobile query optimization and processing strategy.

University teachers' perspectives on the role of the Laplace transform in engineering education

Science.gov (United States)

Holmberg née González Sampayo, Margarita; Bernhard, Jonte

2017-07-01

The Laplace transform is an important tool in many branches of engineering, for example, electric and control engineering, but is also regarded as a difficult topic for students to master. We have interviewed 22 university teachers from five universities in three countries (Mexico, Spain and Sweden) about their views on relationships among mathematics, physics and technology/application aspects in the process of learning the Laplace transform in engineering education. Strikingly, the teachers held a spectrum of qualitatively differing views, ranging from seeing virtually no connection (e.g. some thought the Laplace transform has no relevance in engineering), through to regarding the aspects as intimately, almost inseparably linked. The lack of awareness of the widely differing views among teachers might lead to a lack of constructive alignment among different courses that is detrimental to the quality of engineering education.

Examining E-Learning Barriers as Perceived by Faculty Members of Engineering Colleges in the Jordanian Universities

Science.gov (United States)

Al-Alawneh, Muhammad K.

2014-01-01

Employing computer's technology that includes e-learning system in the field of Engineering is a vital issue which needs to be discussed. Therefore, this study purposed to examine e-learning barriers as perceived by faculty members of engineering in three major universities in Jordan (Yarmouk University, Jordan University of Science and…

An Adaptive SPARQL Engine with Dynamic Partitioning for Distributed RDF Repositories

KAUST Repository

Ibrahim, Yasser E.

2012-07-01

The tremendous increase in the semantic data is driving the demand for efficient query engines. RDF data being generated at an unprecedented rate introduces a storage, indexing, and querying challenge. Due to the size of the data and the federated nature of the semantic web, it is in many cases impractical to assume a central repository, and more attention is being given to distributed RDF stores. This work is motivated by two major drawbacks of current solutions: 1) pre-processing part is very expensive and takes prohibitively long time for large datasets, and 2) current distributed systems assume that a static partitioning of the data should perform well for all kinds of queries, and do not consider fluctuations in the queryload. In this paper we propose PHD-Store, an in-memory SPARQL engine for distributed RDF repositories. Our system does not assume any particular initial placement of the data and does not require pre-processing before running the first query. It analyzes incoming queries and adjusts data placement dynamically in such a way that communication among repositories is minimized for future queries. To achieve this flexibility, frequent query patterns are detected, and data are redistributed through a Propagating Hash Distribution (PHD) algorithm to ensure optimal placement for frequent query patterns. Our experiments with large RDF graphs verify that PHD-Store scales well and executes complex queries more efficiently than existing systems.

Reformulating XQuery queries using GLAV mapping and complex unification

Directory of Open Access Journals (Sweden)

Saber Benharzallah

2016-01-01

Full Text Available This paper describes an algorithm for reformulation of XQuery queries. The mediation is based on an essential component called mediator. Its main role is to reformulate a user query, written in terms of global schema, into queries written in terms of source schemas. Our algorithm is based on the principle of logical equivalence, simple and complex unification, to obtain a better reformulation. It takes XQuery query, global schema (written in XMLSchema, and mappings GLAV as input parameters and provides resultant query written in terms of source schemas. The results of implementation show the proper functioning of the algorithm.

Preparing University Students to Lead K-12 Engineering Outreach Programmes: A Design Experiment

Science.gov (United States)

Anthony, Anika B.; Greene, Howard; Post, Paul E.; Parkhurst, Andrew; Zhan, Xi

2016-01-01

This paper describes an engineering outreach programme designed to increase the interest of under-represented youth in engineering and to disseminate pre-engineering design challenge materials to K-12 educators and volunteers. Given university students' critical role as facilitators of the outreach programme, researchers conducted a two-year…

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.

Environmental engineering at the University of Strathclyde in Glasgow

NARCIS (Netherlands)

Clarke, J.A.; Hensen, J.L.M.; Johnstone, C.M.; McLean, R.C.

1994-01-01

This paper describes the recently revised curriculum for the Environmental Engineering course at the University of Strathclyde in Glasgow. This is done in relation to course content and scope, design and research projects, the role of experimentation and the deployment of advanced computing in terms

AQBE — QBE Style Queries for Archetyped Data

Science.gov (United States)

Sachdeva, Shelly; Yaginuma, Daigo; Chu, Wanming; Bhalla, Subhash

Large-scale adoption of electronic healthcare applications requires semantic interoperability. The new proposals propose an advanced (multi-level) DBMS architecture for repository services for health records of patients. These also require query interfaces at multiple levels and at the level of semi-skilled users. In this regard, a high-level user interface for querying the new form of standardized Electronic Health Records system has been examined in this study. It proposes a step-by-step graphical query interface to allow semi-skilled users to write queries. Its aim is to decrease user effort and communication ambiguities, and increase user friendliness.

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

ALGORITMA RC4 DALAM PROTEKSI TRANSMISI DAN HASIL QUERY UNTUK ORDBMS POSTGRESQL

Directory of Open Access Journals (Sweden)

Yuri Ariyanto

2009-01-01

Full Text Available In this research will be worked through about how cryptography RC4's algorithm implementation in protection to query result and of query, security by encryption and descryption up to both is in network. Implementation of this research which is build software in client that function access databases that is placed by the side of server. Software that building to have facility for encryption and descryption query result and of query that is sent from client goes to server and. transmission query result and of query can secure its security. Well guaranted transmission security him of query result and of query can be told to succeed if success software can encryption query result and of query which transmission so that in the event of scanning to both, scanning will not understand data content. Conclusion of this research that is woke up software succeed encryption query and result of query which transmission between application of client and of server databases. Abstract in Bahasa Indonesia: Pada penelitian ini dibahas mengenai bagaimana mengimplementasikan algoritma kriptografi RC4 dalam proteksi terhadap query dan hasil query, pengamanan dilakukan dengan cara melakukan enkripsi dan dekripsi selama keduanya berada di dalam jaringan. Pengimplementasian dari penelitian ini yaitu membangun sebuah software yang akan diletakkan di sisi client yang berfungsi mengakses database yang diletakkan di sisi server. Software yang dibangun memiliki fasilitas untuk mengenkripsi dan mendektipsi query dan hasil query yang dikirimkan dari client ke server dan juga sebaliknya. Dengan demikian tramsmisi query dan hasil query dapat terjamin keamanannya.Terjaminnya keamanan transmisi query dan hasil query dapat dikatakan berhasil jika software berhasil mengenkripsi query dan hasil query yang ditransmisikan sehingga apabila terjadi penyadapan terhadap keduanya, penyadap tidak akan mengerti isi data tersebut. Kesimpulan dari penelitian ini yaitu software yang dibangun

Use of university research reactors to teach control engineering

International Nuclear Information System (INIS)

Bernard, J.A.

1991-01-01

University research reactors (URRs) have provided generations of students with the opportunity to receive instruction and do hands-on work in reactor dynamics, neutron scattering, health physics, and neutron activation analysis. Given that many URRs are currently converting to programmable control systems, the opportunity now exists to provide a similar learning experience to those studying systems control engineering. That possibility is examined here with emphasis on the need for the inclusion of experiment in control engineering curricula, the type of activities that could be performed, and safety considerations

Medical engineering at Cardiff University. Part 2: Postgraduate programmes of study.

Science.gov (United States)

Theobald, P; O'Doherty, D M; Holt, C A; Evans, S L; Jones, M D

2009-05-01

The Medical Engineering team within the School of Engineering, Cardiff University, delivers two postgraduate programmes of study. Established over 10 years ago, the part-time MSc programmes in Orthopaedic Engineering and Clinical Engineering offer the opportunity of further study while remaining within full-time employment. Both programmes deliver 120 taught credits over two academic years via a series of residential weekends, with successful completion enabling the student to undertake and then defend a 60-credit research dissertation. Fulfilling a specific role on the career pathway for both student cohorts, the strength of each programme is indicated by the consistent number of applicants.

Relative aggregation operator in database fuzzy querying

Directory of Open Access Journals (Sweden)

Luminita DUMITRIU

2005-12-01

Full Text Available Fuzzy selection criteria querying relational databases include vague terms; they usually refer linguistic values form the attribute linguistic domains, defined as fuzzy sets. Generally, when a vague query is processed, the definitions of vague terms must already exist in a knowledge base. But there are also cases when vague terms must be dynamically defined, when a particular operation is used to aggregate simple criteria in a complex selection. The paper presents a new aggregation operator and the corresponding algorithm to evaluate the fuzzy query.

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

Matching health information seekers' queries to medical terms.

Science.gov (United States)

Soualmia, Lina F; Prieur-Gaston, Elise; Moalla, Zied; Lecroq, Thierry; Darmoni, Stéfan J

2012-01-01

The Internet is a major source of health information but most seekers are not familiar with medical vocabularies. Hence, their searches fail due to bad query formulation. Several methods have been proposed to improve information retrieval: query expansion, syntactic and semantic techniques or knowledge-based methods. However, it would be useful to clean those queries which are misspelled. In this paper, we propose a simple yet efficient method in order to correct misspellings of queries submitted by health information seekers to a medical online search tool. In addition to query normalizations and exact phonetic term matching, we tested two approximate string comparators: the similarity score function of Stoilos and the normalized Levenshtein edit distance. We propose here to combine them to increase the number of matched medical terms in French. We first took a sample of query logs to determine the thresholds and processing times. In the second run, at a greater scale we tested different combinations of query normalizations before or after misspelling correction with the retained thresholds in the first run. According to the total number of suggestions (around 163, the number of the first sample of queries), at a threshold comparator score of 0.3, the normalized Levenshtein edit distance gave the highest F-Measure (88.15%) and at a threshold comparator score of 0.7, the Stoilos function gave the highest F-Measure (84.31%). By combining Levenshtein and Stoilos, the highest F-Measure (80.28%) is obtained with 0.2 and 0.7 thresholds respectively. However, queries are composed by several terms that may be combination of medical terms. The process of query normalization and segmentation is thus required. The highest F-Measure (64.18%) is obtained when this process is realized before spelling-correction. Despite the widely known high performance of the normalized edit distance of Levenshtein, we show in this paper that its combination with the Stoilos algorithm improved

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

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

An ontology-based search engine for protein-protein interactions.

Science.gov (United States)

Park, Byungkyu; Han, Kyungsook

2010-01-18

Keyword matching or ID matching is the most common searching method in a large database of protein-protein interactions. They are purely syntactic methods, and retrieve the records in the database that contain a keyword or ID specified in a query. Such syntactic search methods often retrieve too few search results or no results despite many potential matches present in the database. We have developed a new method for representing protein-protein interactions and the Gene Ontology (GO) using modified Gödel numbers. This representation is hidden from users but enables a search engine using the representation to efficiently search protein-protein interactions in a biologically meaningful way. Given a query protein with optional search conditions expressed in one or more GO terms, the search engine finds all the interaction partners of the query protein by unique prime factorization of the modified Gödel numbers representing the query protein and the search conditions. Representing the biological relations of proteins and their GO annotations by modified Gödel numbers makes a search engine efficiently find all protein-protein interactions by prime factorization of the numbers. Keyword matching or ID matching search methods often miss the interactions involving a protein that has no explicit annotations matching the search condition, but our search engine retrieves such interactions as well if they satisfy the search condition with a more specific term in the ontology.

Jackson State University (JSU)’s Center of Excellence in Science, Technology, Engineering, and Mathematics Education (CESTEME)

Science.gov (United States)

2016-01-08

Actuarial Science Taylor, Triniti Lanier Alcorn State University Animal Science Tchounwou, Hervey Madison Central Jackson State University Computer...for Public Release; Distribution Unlimited Final Report: Jackson State University (JSU)’s Center of Excellence in Science , Technology, Engineering...Final Report: Jackson State University (JSU)’s Center of Excellence in Science , Technology, Engineering, and Mathematics Education (CESTEME) Report

Determinacy in Static Analysis of jQuery

DEFF Research Database (Denmark)

Andreasen, Esben; Møller, Anders

2014-01-01

Static analysis for JavaScript can potentially help programmers find errors early during development. Although much progress has been made on analysis techniques, a major obstacle is the prevalence of libraries, in particular jQuery, which apply programming patterns that have detrimental conseque......Static analysis for JavaScript can potentially help programmers find errors early during development. Although much progress has been made on analysis techniques, a major obstacle is the prevalence of libraries, in particular jQuery, which apply programming patterns that have detrimental...... present a static dataflow analysis for JavaScript that infers and exploits determinacy information on-the-fly, to enable analysis of some of the most complex parts of jQuery. The techniques are implemented in the TAJS analysis tool and evaluated on a collection of small programs that use jQuery. Our...

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.

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

Modeling Large Time Series for Efficient Approximate Query Processing

DEFF Research Database (Denmark)

Perera, Kasun S; Hahmann, Martin; Lehner, Wolfgang

2015-01-01

query statistics derived from experiments and when running the system. Our approach can also reduce communication load by exchanging models instead of data. To allow seamless integration of model-based querying into traditional data warehouses, we introduce a SQL compatible query terminology. Our...

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

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.

Howard University Engineers Success: Interdisciplinary Study Keeps Howard on the Cutting Edge

Science.gov (United States)

Chew, Cassie M.

2004-01-01

According to Engineering Workforce Commission annual reports, in 1999 Howard University graduated 108 students, 92 of whom were African American, in its chemical, civil, electrical, and mechanical engineering programs and computer science programs. After two more years of graduating approximately 100 students across programs, in 2002, according to…

Mechanical Engineering at RWTH Aachen University: Professional Curriculum Development and Teacher Training

Science.gov (United States)

Henning, Klaus; Bornefeld, Gero; Brall, Stefan

2007-01-01

This paper offers a multi-perspective view on engineering education at RWTH Aachen University: curriculum design, examples of newly developed teaching methods for engineering curricula, and teaching competencies and teacher qualification. It is based on the theories of student-centred learning, project learning, social skills, etc., but the paper…

RDF-GL : a SPARQL-based graphical query language for RDF

NARCIS (Netherlands)

Hogenboom, F.P.; Milea, D.V.; Frasincar, F.; Kaymak, U.; Chbeir, R.; Badr, Y.; Abraham, A.; Hassanien, A.-E.

2010-01-01

This chapter presents RDF-GL, a graphical query language (GQL) for RDF. The GQL is based on the textual query language SPARQL and mainly focuses on SPARQL SELECT queries. The advantage of a GQL over textual query languages is that complexity is hidden through the use of graphical symbols. RDF-GL is

The Electrical Engineering Curriculum at the Technical University of Denmark - Options in Microelectronics

DEFF Research Database (Denmark)

Bruun, Erik; Nielsen, Lars Drud

1997-01-01

This paper describes the modular structure of the engineering curriculum at the Technical University of Denmark. The basic requirements for an electrical engineering curriculum are presented and different possibilities for specialization in microelectronics and integrated circuit design...

Generic Competencies in the Education of Engineers: The Case of Engineering Program in a Public University in Mexico

Science.gov (United States)

Serna, Alejandra García; Vega, José Luis Arcos; García, Juan José Sevilla; Ruiz, María Amparo Oliveros

2018-01-01

We present an analysis regarding generic skills on engineering program offered in a public state university in Mexico (UABC). The university implemented a new educational model changing rigid programs to flexible programs based on competencies. The goal is to determine generic skills related to the four pillars of learning: learning to do,…

QCS: a system for querying, clustering and summarizing documents.

Energy Technology Data Exchange (ETDEWEB)

Dunlavy, Daniel M.; Schlesinger, Judith D. (Center for Computing Sciences, Bowie, MD); O' Leary, Dianne P. (University of Maryland, College Park, MD); Conroy, John M. (Center for Computing Sciences, Bowie, MD)

2006-10-01

Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence 'trimming', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of the design

QCS : a system for querying, clustering, and summarizing documents.

Energy Technology Data Exchange (ETDEWEB)

Dunlavy, Daniel M.

2006-08-01

Information retrieval systems consist of many complicated components. Research and development of such systems is often hampered by the difficulty in evaluating how each particular component would behave across multiple systems. We present a novel hybrid information retrieval system--the Query, Cluster, Summarize (QCS) system--which is portable, modular, and permits experimentation with different instantiations of each of the constituent text analysis components. Most importantly, the combination of the three types of components in the QCS design improves retrievals by providing users more focused information organized by topic. We demonstrate the improved performance by a series of experiments using standard test sets from the Document Understanding Conferences (DUC) along with the best known automatic metric for summarization system evaluation, ROUGE. Although the DUC data and evaluations were originally designed to test multidocument summarization, we developed a framework to extend it to the task of evaluation for each of the three components: query, clustering, and summarization. Under this framework, we then demonstrate that the QCS system (end-to-end) achieves performance as good as or better than the best summarization engines. Given a query, QCS retrieves relevant documents, separates the retrieved documents into topic clusters, and creates a single summary for each cluster. In the current implementation, Latent Semantic Indexing is used for retrieval, generalized spherical k-means is used for the document clustering, and a method coupling sentence ''trimming'', and a hidden Markov model, followed by a pivoted QR decomposition, is used to create a single extract summary for each cluster. The user interface is designed to provide access to detailed information in a compact and useful format. Our system demonstrates the feasibility of assembling an effective IR system from existing software libraries, the usefulness of the modularity of

Determination of geographic variance in stroke prevalence using Internet search engine analytics.

Science.gov (United States)

Walcott, Brian P; Nahed, Brian V; Kahle, Kristopher T; Redjal, Navid; Coumans, Jean-Valery

2011-06-01

Previous methods to determine stroke prevalence, such as nationwide surveys, are labor-intensive endeavors. Recent advances in search engine query analytics have led to a new metric for disease surveillance to evaluate symptomatic phenomenon, such as influenza. The authors hypothesized that the use of search engine query data can determine the prevalence of stroke. The Google Insights for Search database was accessed to analyze anonymized search engine query data. The authors' search strategy utilized common search queries used when attempting either to identify the signs and symptoms of a stroke or to perform stroke education. The search logic was as follows: (stroke signs + stroke symptoms + mini stroke--heat) from January 1, 2005, to December 31, 2010. The relative number of searches performed (the interest level) for this search logic was established for all 50 states and the District of Columbia. A Pearson product-moment correlation coefficient was calculated from the statespecific stroke prevalence data previously reported. Web search engine interest level was available for all 50 states and the District of Columbia over the time period for January 1, 2005-December 31, 2010. The interest level was highest in Alabama and Tennessee (100 and 96, respectively) and lowest in California and Virginia (58 and 53, respectively). The Pearson correlation coefficient (r) was calculated to be 0.47 (p = 0.0005, 2-tailed). Search engine query data analysis allows for the determination of relative stroke prevalence. Further investigation will reveal the reliability of this metric to determine temporal pattern analysis and prevalence in this and other symptomatic diseases.

Executing SPARQL Queries over the Web of Linked Data

Science.gov (United States)

Hartig, Olaf; Bizer, Christian; Freytag, Johann-Christoph

The Web of Linked Data forms a single, globally distributed dataspace. Due to the openness of this dataspace, it is not possible to know in advance all data sources that might be relevant for query answering. This openness poses a new challenge that is not addressed by traditional research on federated query processing. In this paper we present an approach to execute SPARQL queries over the Web of Linked Data. The main idea of our approach is to discover data that might be relevant for answering a query during the query execution itself. This discovery is driven by following RDF links between data sources based on URIs in the query and in partial results. The URIs are resolved over the HTTP protocol into RDF data which is continuously added to the queried dataset. This paper describes concepts and algorithms to implement our approach using an iterator-based pipeline. We introduce a formalization of the pipelining approach and show that classical iterators may cause blocking due to the latency of HTTP requests. To avoid blocking, we propose an extension of the iterator paradigm. The evaluation of our approach shows its strengths as well as the still existing challenges.

A Fuzzy Query Mechanism for Human Resource Websites

Science.gov (United States)

Lai, Lien-Fu; Wu, Chao-Chin; Huang, Liang-Tsung; Kuo, Jung-Chih

Users' preferences often contain imprecision and uncertainty that are difficult for traditional human resource websites to deal with. In this paper, we apply the fuzzy logic theory to develop a fuzzy query mechanism for human resource websites. First, a storing mechanism is proposed to store fuzzy data into conventional database management systems without modifying DBMS models. Second, a fuzzy query language is proposed for users to make fuzzy queries on fuzzy databases. User's fuzzy requirement can be expressed by a fuzzy query which consists of a set of fuzzy conditions. Third, each fuzzy condition associates with a fuzzy importance to differentiate between fuzzy conditions according to their degrees of importance. Fourth, the fuzzy weighted average is utilized to aggregate all fuzzy conditions based on their degrees of importance and degrees of matching. Through the mutual compensation of all fuzzy conditions, the ordering of query results can be obtained according to user's preference.

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......, the query is quite time-consuming, since all the points on the trajectory are considered. In this paper, we study how to efficiently evaluate trajectory queries over imprecise location data, by proposing a new concept called the u-bisector. In general, the u-bisector is an extension of bisector to handle...

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

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

A Relational Algebra Query Language for Programming Relational Databases

Science.gov (United States)

McMaster, Kirby; Sambasivam, Samuel; Anderson, Nicole

2011-01-01

In this paper, we describe a Relational Algebra Query Language (RAQL) and Relational Algebra Query (RAQ) software product we have developed that allows database instructors to teach relational algebra through programming. Instead of defining query operations using mathematical notation (the approach commonly taken in database textbooks), students…

Sexual information seeking on web search engines.

Science.gov (United States)

Spink, Amanda; Koricich, Andrew; Jansen, B J; Cole, Charles

2004-02-01

Sexual information seeking is an important element within human information behavior. Seeking sexually related information on the Internet takes many forms and channels, including chat rooms discussions, accessing Websites or searching Web search engines for sexual materials. The study of sexual Web queries provides insight into sexually-related information-seeking behavior, of value to Web users and providers alike. We qualitatively analyzed queries from logs of 1,025,910 Alta Vista and AlltheWeb.com Web user queries from 2001. We compared the differences in sexually-related Web searching between Alta Vista and AlltheWeb.com users. Differences were found in session duration, query outcomes, and search term choices. Implications of the findings for sexual information seeking are discussed.

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

Keyword Query Expansion Paradigm Based on Recommendation and Interpretation in Relational Databases

Directory of Open Access Journals (Sweden)

Yingqi Wang

2017-01-01

Full Text Available Due to the ambiguity and impreciseness of keyword query in relational databases, the research on keyword query expansion has attracted wide attention. Existing query expansion methods expose users’ query intention to a certain extent, but most of them cannot balance the precision and recall. To address this problem, a novel two-step query expansion approach is proposed based on query recommendation and query interpretation. First, a probabilistic recommendation algorithm is put forward by constructing a term similarity matrix and Viterbi model. Second, by using the translation algorithm of triples and construction algorithm of query subgraphs, query keywords are translated to query subgraphs with structural and semantic information. Finally, experimental results on a real-world dataset demonstrate the effectiveness and rationality of the proposed method.

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.

An Object-Oriented Approach of Keyword Querying over Fuzzy XML

Directory of Open Access Journals (Sweden)

Ting Li

2016-09-01

Full Text Available As the fuzzy data management has become one of the main research topics and directions, the question of how to obtain the useful information by means of keyword query from fuzzy XML documents is becoming a subject of an increasing needed investigation. Considering the keyword query methods on crisp XML documents, smallest lowest common ancestor (SLCA semantics is one of the most widely accepted semantics. When users propose the keyword query on fuzzy XML documents with the SLCA semantics, the query results are always incomplate, with low precision, and with no possibilities values returned. Most of keyword query semantics on XML documents only consider query results matching all keywords, yet users may also be interested in the query results matching partial keywords. To overcome these limitations, in this paper, we investigate how to obtain more comprehensive and meaningful results of keyword querying on fuzzy XML documents. We propose a semantics of object-oriented keyword querying on fuzzy XML documents. First, we introduce the concept of "object tree", analyze different types of matching result object trees and find the "minimum result object trees" which contain all keywords and "result object trees" which contain partial keywords. Then an object-oriented keyword query algorithm ROstack is proposed to obtain the root nodes of these matching result object trees, together with their possibilities. At last, experiments are conducted to verify the effectiveness and efficiency of our proposed algorithm.

Centre for nuclear engineering University of Toronto annual report 1984

International Nuclear Information System (INIS)

1984-12-01

The annual report of the Centre for Nuclear Engineering, University of Toronto covers the following subjects: message from the Dean; Chairman's message; origins of the centre; formation of the centre; new nuclear appointments; and activities of the centre, 1984

Search engines that learn from their users

NARCIS (Netherlands)

Schuth, A.G.

2016-01-01

More than half the world’s population uses web search engines, resulting in over half a billion search queries every single day. For many people web search engines are among the first resources they go to when a question arises. Moreover, search engines have for many become the most trusted route to

An Academic Survey of Engineering Student Athletes at a Division I University

Science.gov (United States)

Pierce, Charles E.

2007-01-01

This paper explores the academic success of NCAA Division I collegiate student athletes that enroll in engineering majors. At the University of South Carolina, which is a member of the NCAA Division I Southeastern Conference, nineteen engineering students were on an active athletic roster during the spring semester of 2005. The mean cumulative…

Annual report of Nuclear Engineering Research Laboratory, University of Tokyo in fiscal 1989

International Nuclear Information System (INIS)

1990-01-01

This report summerizes the research and educational activities at the Nuclear Engineering Research Laboratory, Faculty of Engineering, University of Tokyo. The Laboratory holds four main facilities, which are Yayoi reactor, an electron accelerator, fusion blanket research facility, and heavy ion irradiation research facility. And they are open to the researchers both inside and outside the University. The application of the facilities are described. The activities and achievements of the Laboratory staffs, and theses for graduate, master, and doctor degrees are also summerized. (J.P.N.)

Query construction, entropy, and generalization in neural-network models

Science.gov (United States)

Sollich, Peter

1994-05-01

We study query construction algorithms, which aim at improving the generalization ability of systems that learn from examples by choosing optimal, nonredundant training sets. We set up a general probabilistic framework for deriving such algorithms from the requirement of optimizing a suitable objective function; specifically, we consider the objective functions entropy (or information gain) and generalization error. For two learning scenarios, the high-low game and the linear perceptron, we evaluate the generalization performance obtained by applying the corresponding query construction algorithms and compare it to training on random examples. We find qualitative differences between the two scenarios due to the different structure of the underlying rules (nonlinear and ``noninvertible'' versus linear); in particular, for the linear perceptron, random examples lead to the same generalization ability as a sequence of queries in the limit of an infinite number of examples. We also investigate learning algorithms which are ill matched to the learning environment and find that, in this case, minimum entropy queries can in fact yield a lower generalization ability than random examples. Finally, we study the efficiency of single queries and its dependence on the learning history, i.e., on whether the previous training examples were generated randomly or by querying, and the difference between globally and locally optimal query construction.

Implementation of the common phrase index method on the phrase query for information retrieval

Science.gov (United States)

Fatmawati, Triyah; Zaman, Badrus; Werdiningsih, Indah

2017-08-01

As the development of technology, the process of finding information on the news text is easy, because the text of the news is not only distributed in print media, such as newspapers, but also in electronic media that can be accessed using the search engine. In the process of finding relevant documents on the search engine, a phrase often used as a query. The number of words that make up the phrase query and their position obviously affect the relevance of the document produced. As a result, the accuracy of the information obtained will be affected. Based on the outlined problem, the purpose of this research was to analyze the implementation of the common phrase index method on information retrieval. This research will be conducted in English news text and implemented on a prototype to determine the relevance level of the documents produced. The system is built with the stages of pre-processing, indexing, term weighting calculation, and cosine similarity calculation. Then the system will display the document search results in a sequence, based on the cosine similarity. Furthermore, system testing will be conducted using 100 documents and 20 queries. That result is then used for the evaluation stage. First, determine the relevant documents using kappa statistic calculation. Second, determine the system success rate using precision, recall, and F-measure calculation. In this research, the result of kappa statistic calculation was 0.71, so that the relevant documents are eligible for the system evaluation. Then the calculation of precision, recall, and F-measure produces precision of 0.37, recall of 0.50, and F-measure of 0.43. From this result can be said that the success rate of the system to produce relevant documents is low.

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

A semantic perspective on query log analysis

NARCIS (Netherlands)

Hofmann, K.; de Rijke, M.; Huurnink, B.; Meij, E.

2009-01-01

We present our views on the CLEF log file analysis task. We argue for a task definition that focuses on the semantic enrichment of query logs. In addition, we discuss how additional information about the context in which queries are being made could further our understanding of users’ information

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.

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

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

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

Comparative Study on Three Major Internet Search Engines ...

African Journals Online (AJOL)

, Google and ask.com search engines. Experimental method was used with ten reference questions which were used to query each of the search engines . Yahoo obtained the highest results (521,801,043) among the three Web search ...

BioCarian: search engine for exploratory searches in heterogeneous biological databases.

Science.gov (United States)

Zaki, Nazar; Tennakoon, Chandana

2017-10-02

There are a large number of biological databases publicly available for scientists in the web. Also, there are many private databases generated in the course of research projects. These databases are in a wide variety of formats. Web standards have evolved in the recent times and semantic web technologies are now available to interconnect diverse and heterogeneous sources of data. Therefore, integration and querying of biological databases can be facilitated by techniques used in semantic web. Heterogeneous databases can be converted into Resource Description Format (RDF) and queried using SPARQL language. Searching for exact queries in these databases is trivial. However, exploratory searches need customized solutions, especially when multiple databases are involved. This process is cumbersome and time consuming for those without a sufficient background in computer science. In this context, a search engine facilitating exploratory searches of databases would be of great help to the scientific community. We present BioCarian, an efficient and user-friendly search engine for performing exploratory searches on biological databases. The search engine is an interface for SPARQL queries over RDF databases. We note that many of the databases can be converted to tabular form. We first convert the tabular databases to RDF. The search engine provides a graphical interface based on facets to explore the converted databases. The facet interface is more advanced than conventional facets. It allows complex queries to be constructed, and have additional features like ranking of facet values based on several criteria, visually indicating the relevance of a facet value and presenting the most important facet values when a large number of choices are available. For the advanced users, SPARQL queries can be run directly on the databases. Using this feature, users will be able to incorporate federated searches of SPARQL endpoints. We used the search engine to do an exploratory search

Search Engine For Ebook Portal

Directory of Open Access Journals (Sweden)

Prashant Kanade

2017-05-01

Full Text Available The purpose of this paper is to establish the textual analytics involved in developing a search engine for an ebook portal. We have extracted our dataset from Project Gutenberg using a robot harvester. Textual Analytics is used for efficient search retrieval. The entire dataset is represented using Vector Space Model where each document is a vector in the vector space. Further for computational purposes we represent our dataset in the form of a Term Frequency- Inverse Document Frequency tf-idf matrix. The first step involves obtaining the most coherent sequence of words of the search query entered. The entered query is processed using Front End algorithms this includes-Spell Checker Text Segmentation and Language Modeling. Back End processing includes Similarity Modeling Clustering Indexing and Retrieval. The relationship between documents and words is established using cosine similarity measured between the documents and words in Vector Space. Clustering performed is used to suggest books that are similar to the search query entered by the user. Lastly the Lucene Based Elasticsearch engine is used for indexing on the documents. This allows faster retrieval of data. Elasticsearch returns a dictionary and creates a tf-idf matrix. The processed query is compared with the dictionary obtained and tf-idf matrix is used to calculate the score for each match to give most relevant result.

GeoSearcher: Location-Based Ranking of Search Engine Results.

Science.gov (United States)

Watters, Carolyn; Amoudi, Ghada

2003-01-01

Discussion of Web queries with geospatial dimensions focuses on an algorithm that assigns location coordinates dynamically to Web sites based on the URL. Describes a prototype search system that uses the algorithm to re-rank search engine results for queries with a geospatial dimension, thus providing an alternative ranking order for search engine…

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

Examining E-Learning Barriers As Perceived By Faculty 
Members Of Engineering Colleges In The Jordanian Universities

OpenAIRE

Muhammad K. AL-ALAWNEH,

2014-01-01

Employing computer's technology that includes e-learning system in the field of Engineering is a vital issue which needs to be discussed. Therefore, this study purposed to examine e-learning barriers as perceived by faculty members of engineering in three major universities in Jordan (Yarmouk University, Jordan University of Science and Technology, and Al-Balqaa Applied University) in the second semester of 2012. The study's instrument was distributed to collect the data from a sam...

Accelerating SPARQL Queries and Analytics on RDF Data

KAUST Repository

Al-Harbi, Razen

2016-01-01

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

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

Science.gov (United States)

Hoareau, Christian; Satoh, Ichiro

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

77 FR 39996 - Department of Mechanical Engineering, Texas A&M University, Notice of Decision on Application for...

Science.gov (United States)

2012-07-06

... DEPARTMENT OF COMMERCE International Trade Administration Department of Mechanical Engineering, Texas A&M University, Notice of Decision on Application for Duty-Free Entry of Scientific Instruments...: Department of Mechanical Engineering, Texas A&M University, College Station, TX 77843-3123. Instrument: Arc...

Energy-aware SQL query acceleration through FPGA-based dynamic partial reconfiguration

NARCIS (Netherlands)

Becher, Andreas; Bauer, Florian; Ziener, Daniel; Teich, Jürgen

2014-01-01

In this paper, we propose an approach for energy-aware FPGA-based query acceleration for databases on embedded devices. After the analysis of an incoming query, a query-specific hardware accelerator is generated on-the-fly and loaded on the FPGA for subsequent query execution using partial dynamic

Lessons Learned on University Education Programs of Chemical Engineering Principles for Nuclear Plant Operations - 13588

International Nuclear Information System (INIS)

Ryu, Jun-hyung

2013-01-01

University education aims to supply qualified human resources for industries. In complex large scale engineering systems such as nuclear power plants, the importance of qualified human resources cannot be underestimated. The corresponding education program should involve many topics systematically. Recently a nuclear engineering program has been initiated in Dongguk University, South Korea. The current education program focuses on undergraduate level nuclear engineering students. Our main objective is to provide industries fresh engineers with the understanding on the interconnection of local parts and the entire systems of nuclear power plants and the associated systems. From the experience there is a huge opportunity for chemical engineering disciple in the context of giving macroscopic overview on nuclear power plant and waste treatment management by strengthening the analyzing capability of fundamental situations. (authors)

How Do Children Reformulate Their Search Queries?

Science.gov (United States)

Rutter, Sophie; Ford, Nigel; Clough, Paul

2015-01-01

Introduction: This paper investigates techniques used by children in year 4 (age eight to nine) of a UK primary school to reformulate their queries, and how they use information retrieval systems to support query reformulation. Method: An in-depth study analysing the interactions of twelve children carrying out search tasks in a primary school…

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.

Education and research in biomedical engineering of the Budapest University of Technology and Economics.

Science.gov (United States)

Benyó, Z

2006-03-01

Biomedical Engineering is a relatively new interdisciplinary science. This review paper presents the biomedical engineering activity, which is carried out at the Budapest University of Technology and Economics (BUTE) and its partner institutions. In the first parts the main goals and the curriculum of the Biomedical Engineering Education Program is presented. The second part of the paper summarizes the most important biomedical engineering researches most of them carried out in the Biomedical Engineering Laboratory of BUTE.

Bridging Water Resources Policy and Environmental Engineering in the Classroom at Cornell University

Science.gov (United States)

Walter, M. T.; Shaw, S. B.; Seifert, S.; Schwarz, T.

2006-12-01

Current university undergraduate students in environmental sciences and engineering are the next generation of environmental protection practitioners. Recognizing this, Cornell's Biological and Environmental Engineering department has developed a popular class, Watershed Engineering (BEE 473), specifically designed to bridge the too-common gap between water resources policy and state-of-art science and technology. Weekly homework assignments are to design real-life solutions to actual water resources problems, often with the objective of applying storm water policies to local situations. Where appropriate, usually in conjunction with recent amendments to the Federal Clean Water Act, this course introduces water resource protection tools and concepts developed in the Cornell Soil and Water Lab. Here we present several examples of how we build bridges between university classrooms and the complex world of water resources policy.

Path Minima Queries in Dynamic Weighted Trees

DEFF Research Database (Denmark)

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

2011-01-01

In the path minima problem on a tree, each edge is assigned a weight and a query asks for the edge with minimum weight on a path between two nodes. For the dynamic version of the problem, where the edge weights can be updated, we give data structures that achieve optimal query time\\todo{what about...

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.

Teaching Sustainable Entrepreneurship to Engineering Students: The Case of Delft University of Technology

Science.gov (United States)

Bonnet, Hans; Quist, Jaco; Hoogwater, Daan; Spaans, Johan; Wehrmann, Caroline

2006-01-01

Sustainability, enhancement of personal skills, social aspects of technology, management and entrepreneurship are of increasing concern for engineers and therefore for engineering education. In 1996 at Delft University of Technology this led to the introduction of a subject on sustainable entrepreneurship and technology in the course programmes of…

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

Directory of Open Access Journals (Sweden)

Hua Dai

2016-02-01

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

Teaching WWERs at Hacettepe University Nuclear Engineering Department in Turkey

International Nuclear Information System (INIS)

Ergun, S.

2011-01-01

In this study, the challenges faced in the teaching WWER design for the reactor engineering course, which is taught in the Hcettepe University Nuclear Engineering Department are discussed. Since the course is designated taking a western reactor design into account, the computer programs and class projects prepared for the course include models and correlations suitable for these designs. The attempts for modifying the course and developing codes or programs for the course become a challenge especially in finding proper information sources on design in English. From finding proper material properties to exploring the design ideas, teaching WWER designs and using analysis tools for better teaching are very important to modify the reactor engineering course. With the study presented here, the reactor engineering course taught is described, the teaching tools are listed and attempts of modifying the course to teach and analyze WWER designs are explained

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...... their efficient computation. The queries take into account several spatial preferences. and they intuitively return a set of most interesting results for each result returned by the corresponding non-skyline queries. The paper also covers a performance study of the proposed techniques based on real point...

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.

An Adaptive Directed Query Dissemination Scheme for Wireless Sensor Networks

NARCIS (Netherlands)

Chatterjea, Supriyo; De Luigi, Simone; Havinga, Paul J.M.; Sun, M.T.

This paper describes a directed query dissemination scheme, DirQ that routes queries to the appropriate source nodes based on both constant and dynamicvalued attributes such as sensor types and sensor values. Unlike certain other query dissemination schemes, location information is not essential for

SAPLE: Sandia Advanced Personnel Locator Engine.

Energy Technology Data Exchange (ETDEWEB)

Procopio, Michael J.

2010-04-01

We present the Sandia Advanced Personnel Locator Engine (SAPLE) web application, a directory search application for use by Sandia National Laboratories personnel. SAPLE's purpose is to return Sandia personnel 'results' as a function of user search queries, with its mission to make it easier and faster to find people at Sandia. To accomplish this, SAPLE breaks from more traditional directory application approaches by aiming to return the correct set of results while placing minimal constraints on the user's query. Two key features form the core of SAPLE: advanced search query interpretation and inexact string matching. SAPLE's query interpretation permits the user to perform compound queries when typing into a single search field; where able, SAPLE infers the type of field that the user intends to search on based on the value of the search term. SAPLE's inexact string matching feature yields a high-quality ranking of personnel search results even when there are no exact matches to the user's query. This paper explores these two key features, describing in detail the architecture and operation of SAPLE. Finally, an extensive analysis on logged search query data taken from an 11-week sample period is presented.

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 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...... for partial translation of natural language into natural logic, featuring further querying and conceptual path finding in natural logic knowledge bases....

Memory aware query scheduling in a database cluster

NARCIS (Netherlands)

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

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

Building a more diverse biomedical engineering workforce: Biomedical engineering at the university of the district of Columbia, a historically black college & university.

Science.gov (United States)

Thompson, Lara A; Adebayo, A Segun; Nian Zhang; Haghani, Sasan; Dowell, Kathleen; Shetty, Devdas

2016-08-01

Biomedical Engineering (BME) is a new, multidisciplinary, and rapidly growing field, however, the BME Workforce suffers from limited ethnic and gender diversity. Despite the demand and growth of this new field due to its public health importance, only 4 out of the 107 Historically Black Colleges and Universities (HBCUs) nationwide offers a Bachelor's of Science (B.S.) in Bio-Engineering related fields. In order to contribute to a growing BME Workforce, HBCUs need to react and offer more degree-programs relevant to BME. At the University of the District of Columbia (UDC), an HBCU and the District's only public institution for higher learning, we have recently established a new, degree program: Bachelor of Science in Biomedical Engineering (B.S. in BME) full-board approved in Fall 2014, with program activities initiated in Fall 2015. The educational goal of this program is to enhance the quality and diversity of the BME Workforce via student professional development, new and relevant BME courses, and BME scholarly activities (e.g., guest lectures and journal club sessions), ultimately to increase the number of ethnic minorities pursuing careers and degrees in BME. Through our program activities, we are aiming to meet the nation's demand to contribute to a diverse BME workforce, directed towards solving problems in human health. A secondary, but related goal, is to increase the diversity of STEM-related fields. This paper summarizes our initial, but encouraging, BME activity-related findings. However, this study will be longitudinal (on a multiple year time period) to observe the true outcomes of our initiative.

Templates and Queries in Contextual Hypermedia

DEFF Research Database (Denmark)

Anderson, Kenneth Mark; Hansen, Frank Allan; Bouvin, Niels Olof

2006-01-01

discuss a framework, HyConSC, that implements this model and describe how it can be used to build new contextual hypermedia systems. Our framework aids the developer in the iterative development of contextual queries (via a dynamic query browser) and offers support for con-text matching, a key feature...... of contextual hypermedia. We have tested the framework with data and sensors taken from the HyCon contextual hypermedia system and are now migrating HyCon to this new framework....

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-sup...... different kinds of functionality as well as the ideas underlying their definition....

Parallel Index and Query for Large Scale Data Analysis

Energy Technology Data Exchange (ETDEWEB)

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

2011-07-18

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

Status of University of Cincinnati reactor-site nuclear engineering graduate programs

International Nuclear Information System (INIS)

Anno, J.N.; Christenson, J.M.; Eckart, L.E.

1993-01-01

The University of Cincinnati (UC) nuclear engineering program faculty has now had 12 yr of experience in delivering reactor-site educational programs to nuclear power plant technical personnel. Currently, with the sponsorship of the Toledo-Edison Company (TED), we are conducting a multiyear on-site graduate program with more than 30 participants at the Davis-Besse nuclear power plant. The program enables TED employees with the proper academic background to earn a master of science (MS) degree in nuclear engineering (mechanical engineering option). This paper presents a brief history of tile evolution of UC reactor-site educational programs together with a description of the progress of the current program

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

Constraint-based query distribution framework for an integrated global schema

DEFF Research Database (Denmark)

Malik, Ahmad Kamran; Qadir, Muhammad Abdul; Iftikhar, Nadeem

2009-01-01

and replicated data sources. The provided system is all XML-based which poses query in XML form, transforms, and integrates local results in an XML document. Contributions include the use of constraints in our existing global schema which help in source selection and query optimization, and a global query...

Parasol: An Architecture for Cross-Cloud Federated Graph Querying

Energy Technology Data Exchange (ETDEWEB)

Lieberman, Michael; Choudhury, Sutanay; Hughes, Marisa; Patrone, Dennis; Hider, Sandy; Piatko, Christine; Chapman, Matthew; Marple, JP; Silberberg, David

2014-06-22

Large scale data fusion of multiple datasets can often provide in- sights that examining datasets individually cannot. However, when these datasets reside in different data centers and cannot be collocated due to technical, administrative, or policy barriers, a unique set of problems arise that hamper querying and data fusion. To ad- dress these problems, a system and architecture named Parasol is presented that enables federated queries over graph databases residing in multiple clouds. Parasol’s design is flexible and requires only minimal assumptions for participant clouds. Query optimization techniques are also described that are compatible with Parasol’s lightweight architecture. Experiments on a prototype implementation of Parasol indicate its suitability for cross-cloud federated graph queries.

Integration Mining Engineering, Faculty of Engineering, National University of San Juan

International Nuclear Information System (INIS)

Berenguer, T.; Salinas, L.; Cascon, R.

2007-01-01

This work presents proposals for the mud handling derived from mineralogical processes, trying to maintain a balance between the nature and the sustainable development of the region; it comprises of an investigation project that the authors carry out in the National University of San Juan.In this case particular aspects of problematic the environmental one are approached as the contamination of associated the superficial and underground water to the handling of the mineral remainders, specifically muds.To practices and procedures of engineering are described that offer protection against the faults of the deposits so that the remainders and the water of process are outside the hydrological river basins. (author)

Labeling RDF Graphs for Linear Time and Space Querying

Science.gov (United States)

Furche, Tim; Weinzierl, Antonius; Bry, François

Indices and data structures for web querying have mostly considered tree shaped data, reflecting the view of XML documents as tree-shaped. However, for RDF (and when querying ID/IDREF constraints in XML) data is indisputably graph-shaped. In this chapter, we first study existing indexing and labeling schemes for RDF and other graph datawith focus on support for efficient adjacency and reachability queries. For XML, labeling schemes are an important part of the widespread adoption of XML, in particular for mapping XML to existing (relational) database technology. However, the existing indexing and labeling schemes for RDF (and graph data in general) sacrifice one of the most attractive properties of XML labeling schemes, the constant time (and per-node space) test for adjacency (child) and reachability (descendant). In the second part, we introduce the first labeling scheme for RDF data that retains this property and thus achieves linear time and space processing of acyclic RDF queries on a significantly larger class of graphs than previous approaches (which are mostly limited to tree-shaped data). Finally, we show how this labeling scheme can be applied to (acyclic) SPARQL queries to obtain an evaluation algorithm with time and space complexity linear in the number of resources in the queried RDF graph.

Concept-based query language approach to enterprise information systems

Science.gov (United States)

Niemi, Timo; Junkkari, Marko; Järvelin, Kalervo

2014-01-01

In enterprise information systems (EISs) it is necessary to model, integrate and compute very diverse data. In advanced EISs the stored data often are based both on structured (e.g. relational) and semi-structured (e.g. XML) data models. In addition, the ad hoc information needs of end-users may require the manipulation of data-oriented (structural), behavioural and deductive aspects of data. Contemporary languages capable of treating this kind of diversity suit only persons with good programming skills. In this paper we present a concept-oriented query language approach to manipulate this diversity so that the programming skill requirements are considerably reduced. In our query language, the features which need technical knowledge are hidden in application-specific concepts and structures. Therefore, users need not be aware of the underlying technology. Application-specific concepts and structures are represented by the modelling primitives of the extended RDOOM (relational deductive object-oriented modelling) which contains primitives for all crucial real world relationships (is-a relationship, part-of relationship, association), XML documents and views. Our query language also supports intensional and extensional-intensional queries, in addition to conventional extensional queries. In its query formulation, the end-user combines available application-specific concepts and structures through shared variables.

An Introduction of Finite Element Method in the Engineering Teaching at the University of Camaguey.

Science.gov (United States)

Napoles, Elsa; Blanco, Ramon; Jimenez, Rafael; Mc.Pherson, Yoanka

This paper illuminates experiences related to introducing finite element methods (FEM) in mechanical and civil engineering courses at the University of Camaguey in Cuba and provides discussion on using FEM in postgraduate courses for industry engineers. Background information on the introduction of FEM in engineering teaching is focused on…

PlateRunner: A Search Engine to Identify EMR Boilerplates.

Science.gov (United States)

Divita, Guy; Workman, T Elizabeth; Carter, Marjorie E; Redd, Andrew; Samore, Matthew H; Gundlapalli, Adi V

2016-01-01

Medical text contains boilerplated content, an artifact of pull-down forms from EMRs. Boilerplated content is the source of challenges for concept extraction on clinical text. This paper introduces PlateRunner, a search engine on boilerplates from the US Department of Veterans Affairs (VA) EMR. Boilerplates containing concepts should be identified and reviewed to recognize challenging formats, identify high yield document titles, and fine tune section zoning. This search engine has the capability to filter negated and asserted concepts, save and search query results. This tool can save queries, search results, and documents found for later analysis.

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

. 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...... for multiple DTW queries....

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.

The SQL++ Query Language: Configurable, Unifying and Semi-structured

OpenAIRE

Ong, Kian Win; Papakonstantinou, Yannis; Vernoux, Romain

2014-01-01

NoSQL databases support semi-structured data, typically modeled as JSON. They also provide limited (but expanding) query languages. Their idiomatic, non-SQL language constructs, the many variations, and the lack of formal semantics inhibit deep understanding of the query languages, and also impede progress towards clean, powerful, declarative query languages. This paper specifies the syntax and semantics of SQL++, which is applicable to both JSON native stores and SQL databases. The SQL++ sem...

To compare PubMed Clinical Queries and UpToDate in teaching information mastery to clinical residents: a crossover randomized controlled trial.

Science.gov (United States)

Sayyah Ensan, Ladan; Faghankhani, Masoomeh; Javanbakht, Anna; Ahmadi, Seyed-Foad; Baradaran, Hamid Reza

2011-01-01

To compare PubMed Clinical Queries and UpToDate regarding the amount and speed of information retrieval and users' satisfaction. A cross-over randomized trial was conducted in February 2009 in Tehran University of Medical Sciences that included 44 year-one or two residents who participated in an information mastery workshop. A one-hour lecture on the principles of information mastery was organized followed by self learning slide shows before using each database. Subsequently, participants were randomly assigned to answer 2 clinical scenarios using either UpToDate or PubMed Clinical Queries then crossed to use the other database to answer 2 different clinical scenarios. The proportion of relevantly answered clinical scenarios, time to answer retrieval, and users' satisfaction were measured in each database. Based on intention-to-treat analysis, participants retrieved the answer of 67 (76%) questions using UpToDate and 38 (43%) questions using PubMed Clinical Queries (PPubMed Clinical Queries (PPubMed Clinical Queries users (PPubmed Clinical Queries can lead to not only a higher proportion of relevant answer retrieval within a shorter time, but also a higher users' satisfaction. So, addition of tutoring pre-appraised sources such as UpToDate to the information mastery curricula seems to be highly efficient.

Path Index Based Keywords to SPARQL Query Transformation for Semantic Data Federations

Directory of Open Access Journals (Sweden)

Thilini Cooray

2016-06-01

Full Text Available Semantic web is a highly emerging research domain. Enhancing the ability of keyword query processing on Semantic Web data provides a huge support for familiarizing the usefulness of Semantic Web to the general public. Most of the existing approaches focus on just user keyword matching to RDF graphs and output the connecting elements as results. Semantic Web consists of SPARQL query language which can process queries more accurately and efficiently than general keyword matching. There are only about a couple of approaches available for transforming keyword queries to SPARQL. They basically rely on real time graph traversals? for identifying subgraphs which can connect user keywords. Those approaches are either limited to query processing on a single data store or a set of interlinked data sets. They have not focused on query processing on a federation of independent data sets which belongs to the same domain. This research proposes a Path Index based approach eliminating real time graph traversal for transforming keyword queries to SPARQL. We have introduced an ontology alignment based approach for keyword query transforming on a federation of RDF data stored using multiple heterogeneous vocabularies. Evaluation shows that the proposed approach have the ability to generate SPARQL queries which can provide highly relevant results for user keyword queries. The Path Index based query transformation approach has also achieved high efficiency compared to the existing approach.

Contributions of university nuclear engineering departments to the national research agenda

International Nuclear Information System (INIS)

Peddicord, K.L.

1991-01-01

The history and character of university nuclear engineering departments have enabled them to play unique roles in higher education and to make valuable contributions in numerous important research fields. Nuclear engineering programs have several distinguishing and noteworthy characteristics. These characteristics include quality, diversity, and effectiveness. However, the continued viability of these programs is in question, and the importance of these programs may only be recognized after the capability has been lost. To recover this capability may well prove to be an impossibility

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

Science.gov (United States)

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

2007-11-01

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

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.

Efficient external memory structures for range-aggregate queries

DEFF Research Database (Denmark)

Agarwal, P.K.; Yang, J.; Arge, L.

2013-01-01

We present external memory data structures for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in Rd, compute the aggregate of the weights of the points that lie inside a d-dimensional orthogonal query rectangle. The...

Top-k aggregation queries in large-scale distributed systems

OpenAIRE

Michel, Sebastian

2007-01-01

Distributed top-k query processing has recently become an essential functionality in a large number of emerging application classes like Internet traffic monitoring and Peer-to-Peer Web search. This work addresses efficient algorithms for distributed top-k queries in wide-area networks where the index lists for the attribute values (or text terms) of a query are distributed across a number of data peers. More precisely, in this thesis, we make the following distributions: We present the fa...

On a Vision to Educating Students in Sustainability and Design—The James Madison University School of Engineering Approach

Directory of Open Access Journals (Sweden)

Olga Pierrakos

2011-12-01

Full Text Available In order for our future engineers to be able to work toward a sustainable future, they must be versed not only in sustainable engineering but also in engineering design. An engineering education must train our future engineers to think flexibly and to be adaptive, as it is unlikely that their future will have them working in one domain. They must, instead, be versatilists. The School of Engineering at James Madison University has been developed from the ground up to provide this engineering training with an emphasis on engineering design, systems thinking, and sustainability. Neither design nor sustainability are mutually exclusive, and consequently, an education focusing on design and sustainability must integrate these topics, teaching students to follow a sustainable design process. This is the goal of the James Madison University School of Engineering. In this paper, we present our approach to curricular integration of design and sustainability as well as the pedagogical approaches used throughout the curriculum. We do not mean to present the School’s model as an all or nothing approach consisting of dependent elements, but instead as a collection of independent approaches, of which one or more may be appropriate at another university.

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

Science.gov (United States)

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

2015-09-01

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

Query-by-example surgical activity detection.

Science.gov (United States)

Gao, Yixin; Vedula, S Swaroop; Lee, Gyusung I; Lee, Mija R; Khudanpur, Sanjeev; Hager, Gregory D

2016-06-01

Easy acquisition of surgical data opens many opportunities to automate skill evaluation and teaching. Current technology to search tool motion data for surgical activity segments of interest is limited by the need for manual pre-processing, which can be prohibitive at scale. We developed a content-based information retrieval method, query-by-example (QBE), to automatically detect activity segments within surgical data recordings of long duration that match a query. The example segment of interest (query) and the surgical data recording (target trial) are time series of kinematics. Our approach includes an unsupervised feature learning module using a stacked denoising autoencoder (SDAE), two scoring modules based on asymmetric subsequence dynamic time warping (AS-DTW) and template matching, respectively, and a detection module. A distance matrix of the query against the trial is computed using the SDAE features, followed by AS-DTW combined with template scoring, to generate a ranked list of candidate subsequences (substrings). To evaluate the quality of the ranked list against the ground-truth, thresholding conventional DTW distances and bipartite matching are applied. We computed the recall, precision, F1-score, and a Jaccard index-based score on three experimental setups. We evaluated our QBE method using a suture throw maneuver as the query, on two tool motion datasets (JIGSAWS and MISTIC-SL) captured in a training laboratory. We observed a recall of 93, 90 and 87 % and a precision of 93, 91, and 88 % with same surgeon same trial (SSST), same surgeon different trial (SSDT) and different surgeon (DS) experiment setups on JIGSAWS, and a recall of 87, 81 and 75 % and a precision of 72, 61, and 53 % with SSST, SSDT and DS experiment setups on MISTIC-SL, respectively. We developed a novel, content-based information retrieval method to automatically detect multiple instances of an activity within long surgical recordings. Our method demonstrated adequate recall

An Overview of the Literature: Research in P-12 Engineering Education

Science.gov (United States)

Mendoza Díaz, Noemi V.; Cox, Monica F.

2012-01-01

This paper presents an extensive overview of preschool to 12th grade (P-12) engineering education literature published between 2001 and 2011. Searches were conducted through education and engineering library engines and databases as well as queries in established publications in engineering education. More than 50 publications were found,…

Identifying the Barriers upon Development of Virtual Education in Engineering Majors (Case Study: The University of Isfahan)

Science.gov (United States)

Nikoonezhad, Sepideh; Nili, Mohammadreza; Esfahani, Ahmadreza Nasr

2015-01-01

The present study aims at investigating barriers upon development of virtual education in engineering majors at the University of Isfahan. The study has applied a mixed method (qualitative and quantitative) and its population consists all of the department members of the technical and engineering majors at the University of Isfahan including 125…

The New Maritime Engineering Education at the Technical University of Denmark

DEFF Research Database (Denmark)

Jensen, Jørgen Juncher; Andersen, Ingrid Marie Vincent; Nielsen, Ulrik Dam

2014-01-01

maritime engineering education has so far been very successful with the number of students increased by a factor of two and with very good job opportunities in the Danish maritime industry. A spin-off of this change is DTU's participation in a dual MSc degree engineering program: Nordic Master in Maritime......Until 2010, the maritime engineering education at the Technical University of Denmark (DTU) followed the rather classical naval architecture approach with the main focus on marine hydrodynamics and strength of ship structures. The number of students was rather modest and constant. However......, at that time the last major ship yard in Denmark was closing down and ship operation, together with ship design, became the main working area for the students after graduation. It was then decided to broaden the naval architecture education to a maritime engineering education taking marine logistics...

Geometric Representations of Condition Queries on Three-Dimensional Vector Fields

Science.gov (United States)

Henze, Chris

1999-01-01

Condition queries on distributed data ask where particular conditions are satisfied. It is possible to represent condition queries as geometric objects by plotting field data in various spaces derived from the data, and by selecting loci within these derived spaces which signify the desired conditions. Rather simple geometric partitions of derived spaces can represent complex condition queries because much complexity can be encapsulated in the derived space mapping itself A geometric view of condition queries provides a useful conceptual unification, allowing one to intuitively understand many existing vector field feature detection algorithms -- and to design new ones -- as variations on a common theme. A geometric representation of condition queries also provides a simple and coherent basis for computer implementation, reducing a wide variety of existing and potential vector field feature detection techniques to a few simple geometric operations.

Efficient processing of containment queries on nested sets

NARCIS (Netherlands)

Ibrahim, A.; Fletcher, G.H.L.

2013-01-01

We study the problem of computing containment queries on sets which can have both atomic and set-valued objects as elements, i.e., nested sets. Containment is a fundamental query pattern with many basic applications. Our study of nested set containment is motivated by the ubiquity of nested data in

Ontology Based Queries - Investigating a Natural Language Interface

NARCIS (Netherlands)

van der Sluis, Ielka; Hielkema, F.; Mellish, C.; Doherty, G.

2010-01-01

In this paper we look at what may be learned from a comparative study examining non-technical users with a background in social science browsing and querying metadata. Four query tasks were carried out with a natural language interface and with an interface that uses a web paradigm with hyperlinks.

DISPAQ: Distributed Profitable-Area Query from Big Taxi Trip Data.

Science.gov (United States)

Putri, Fadhilah Kurnia; Song, Giltae; Kwon, Joonho; Rao, Praveen

2017-09-25

One of the crucial problems for taxi drivers is to efficiently locate passengers in order to increase profits. The rapid advancement and ubiquitous penetration of Internet of Things (IoT) technology into transportation industries enables us to provide taxi drivers with locations that have more potential passengers (more profitable areas) by analyzing and querying taxi trip data. In this paper, we propose a query processing system, called Distributed Profitable-Area Query ( DISPAQ ) which efficiently identifies profitable areas by exploiting the Apache Software Foundation's Spark framework and a MongoDB database. DISPAQ first maintains a profitable-area query index (PQ-index) by extracting area summaries and route summaries from raw taxi trip data. It then identifies candidate profitable areas by searching the PQ-index during query processing. Then, it exploits a Z-Skyline algorithm, which is an extension of skyline processing with a Z-order space filling curve, to quickly refine the candidate profitable areas. To improve the performance of distributed query processing, we also propose local Z-Skyline optimization, which reduces the number of dominant tests by distributing killer profitable areas to each cluster node. Through extensive evaluation with real datasets, we demonstrate that our DISPAQ system provides a scalable and efficient solution for processing profitable-area queries from huge amounts of big taxi trip data.

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.

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

Directory of Open Access Journals (Sweden)

Yang Liu

2016-07-01

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

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

Reorganization and the present situation of the department of nuclear engineering of the national universities in Japan

International Nuclear Information System (INIS)

Kiyanagi, Yoshiaki; Tanaka, Satoru; Imanishi, Nobutsugu; Takeda, Toshikazu; Kudo, Kazuhiko

2000-01-01

On July 1999, the 36th Conference on Isotopes in Physics and Engineering was held, where a panel discussion titled on 'new development on nuclear energy and radiation education at universities' was carried out. In the discussion, reports from every universities were stated and some opinion exchanges were carried out. Every representatives of faculty mentioned not only on how nuclear energy and radiation education became, but also on general problems on recent engineering education (for example, what education is aimed under maintenance of what cooperation with the other faculties and specialties). Here were introduced on five cases of typical universities in Japan (Hokkaido, Tokyo, Kyoto, Osaka, and Kyushu Universities), where present states and future scopes in the Nuclear Engineering Faculty and its graduate school were described at a standpoint of their educational researches on nuclear energy. (G.K.)

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

Science.gov (United States)

Lu, Zhiyong; Wilbur, W John

2009-10-01

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

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

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

Quality Assessment Survey at the School of Civil Engineering at Aalborg University

DEFF Research Database (Denmark)

Brohus, Henrik

2008-01-01

the study board of civil engineering. The questionnaire was jointly developed for all study boards at Aalborg University. The questionnaire forms an investigation of students' satisfaction and evaluation of the overall structure of the education including self-reported performance assessment. The paper......As part of an improved quality assessment procedure at the School of Civil Engineering at Aalborg University, an online survey has been undertaken among all students. Due to external requirements and a wish for more structured feedback, an online questionnaire was presented to all students under...... discusses the structure of the questionnaire and presents the results. Finally, suggestions for improvements regarding the questionnaire and further quality assessment are included. The response rate was 40%. Overall, the results showed a general satisfaction with the studies although substantial variance...

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...... where an upper bound on k is known a priori and then extends the techniques to the case where this is not so. Based on empirical studies with real-world data, the paper offers insight into the circumstances under which the different proposed techniques can be used with advantage for multiple k nearest...

Research on the Mode of University-Enterprise Cooperation to Promote Engineering Students' Employment

Science.gov (United States)

Hui, Yan; Lihua, Sun

2018-06-01

The employment of university students has become a hot issue of concern to the whole society. Promoting the employment of university students is a top priority for higher education institutions. University-enterprise cooperation is an important trend in the development of modern higher education. It is also an important channel for promoting the employment of university students, especially for engineering students. Through an in-depth analysis of the status quo of employment of university graduates, this paper proposes four modes of university-enterprise cooperation to promote university graduates' employment: The post-employment cooperation model, the professional internship cooperation model, the second classroom expansion cooperation model and the enterprise-oriented recruitment model, and further proposed the countermeasures to strengthen the cooperation between university and enterprise in order to promote the employment of university students.

Parallel main-memory indexing for moving-object query and update workloads

DEFF Research Database (Denmark)

Sidlauskas, Darius; Saltenis, Simonas; Jensen, Christian Søndergaard

2012-01-01

of supporting the location-related query and update workloads generated by very large populations of such moving objects. This paper presents a main-memory indexing technique that aims to support such workloads. The technique, called PGrid, uses a grid structure that is capable of exploiting the parallelism...... offered by modern processors. Unlike earlier proposals that maintain separate structures for updates and queries, PGrid allows both long-running queries and rapid updates to operate on a single data structure and thus offers up-to-date query results. Because PGrid does not rely on creating snapshots...... on the same current data-store state, PGrid outperforms snapshot-based techniques in terms of both query freshness and CPU cycle-wise efficiency....

A Comparison of the mechanical engineering and safety engineering student’s ICT attitudes at the Obuda University

Directory of Open Access Journals (Sweden)

Kiss Gabor

2016-01-01

Full Text Available Communication and technology are critical to education. However, using technology in education is not an easy task as communication barriers emerge. The aim of this research is to analyze the ICT attitudes from different faculties at the Obuda University that is between the mechanical engineering students and safety engineering students from the Donát Bánki Mechanical Safety Engineer Faculty. The students from these two groups will use different ICT tool at work after their graduation; the mechanical engineering students will work mostly with designer ICT tools, the safety engineering students will use security systems. It would be important to know whether instructors, when using ICT, have to follow different teaching methods and approaches in these two different groups or not. We measured the ICT attitude with a tool consisting of 23 items (Likert scaled. We worked with 361 students. The data analysis was performed with SPSS software using descriptive statistics and Mann-Whitney test. The results show both groups having the same positive ICT attitude however with one difference.

VPipe: Virtual Pipelining for Scheduling of DAG Stream Query Plans

Science.gov (United States)

Wang, Song; Gupta, Chetan; Mehta, Abhay

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

Active Learning by Querying Informative and Representative Examples.

Science.gov (United States)

Huang, Sheng-Jun; Jin, Rong; Zhou, Zhi-Hua

2014-10-01

Active learning reduces the labeling cost by iteratively selecting the most valuable data to query their labels. It has attracted a lot of interests given the abundance of unlabeled data and the high cost of labeling. Most active learning approaches select either informative or representative unlabeled instances to query their labels, which could significantly limit their performance. Although several active learning algorithms were proposed to combine the two query selection criteria, they are usually ad hoc in finding unlabeled instances that are both informative and representative. We address this limitation by developing a principled approach, termed QUIRE, based on the min-max view of active learning. The proposed approach provides a systematic way for measuring and combining the informativeness and representativeness of an unlabeled instance. Further, by incorporating the correlation among labels, we extend the QUIRE approach to multi-label learning by actively querying instance-label pairs. Extensive experimental results show that the proposed QUIRE approach outperforms several state-of-the-art active learning approaches in both single-label and multi-label learning.

SPARQLGraph: a web-based platform for graphically querying biological Semantic Web databases.

Science.gov (United States)

Schweiger, Dominik; Trajanoski, Zlatko; Pabinger, Stephan

2014-08-15

Semantic Web has established itself as a framework for using and sharing data across applications and database boundaries. Here, we present a web-based platform for querying biological Semantic Web databases in a graphical way. SPARQLGraph offers an intuitive drag & drop query builder, which converts the visual graph into a query and executes it on a public endpoint. The tool integrates several publicly available Semantic Web databases, including the databases of the just recently released EBI RDF platform. Furthermore, it provides several predefined template queries for answering biological questions. Users can easily create and save new query graphs, which can also be shared with other researchers. This new graphical way of creating queries for biological Semantic Web databases considerably facilitates usability as it removes the requirement of knowing specific query languages and database structures. The system is freely available at http://sparqlgraph.i-med.ac.at.

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

On (dynamic) range minimum queries in external memory

DEFF Research Database (Denmark)

Arge, L.; Fischer, Johannes; Sanders, Peter

2013-01-01

We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first space-optimal solution to the batched static version of the problem. On an instance with N elements and Q queries, our solution takes Θ(sort(N + Q)) = Θ( N+QB log M /B N+QB ) I...

Advanced engineering design program at the University of Illinois for the 1987-1988 academic year

Science.gov (United States)

Sivier, Kenneth R.; Lembeck, Michael F.

1988-01-01

The participation of the University of Illinois at Urbana-Champaign in the NASA/USRA Universities Advanced Engineering Design Program (Space) is reviewed for the 1987 to 88 academic year. The University's design project was the Manned Marsplane and Delivery System. In the spring of 1988 semester, 107 students were enrolled in the Aeronautical and Astronautical Engineering Departments' undergraduate Aerospace Vehicle Design course. These students were divided into an aircraft section (responsible for the Marsplane design), and a spacecraft section (responsible for the Delivery System Design). The design results are presented in Final Design Reports, copies of which are attached. In addition, five students presented a summary of the design results at the Program's Summer Conference.

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.

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

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.

Nuclear science and engineering education at a university research reactor

International Nuclear Information System (INIS)

Loveland, W.

1990-01-01

The research and teaching operations of the Nuclear Chemistry Division of the Dept. of Chemistry and the Dept. of Nuclear Engineering are housed at the Oregon State University Radiation Center. This facility which includes a 1.1 MW TRIGA reactor was used for 53 classes from a number of different academic departments last year. About one-half of these classes used the reactor and ∼25% of the reactor's 45 hour week was devoted to teaching. Descriptions will be given of reactor-oriented instructional programs in nuclear engineering, radiation health and nuclear chemistry. In nuclear chemistry, classes in (a) nuclear chemistry for nuclear engineers, (b) radiotracer methods, (c) elementary and advanced activation analysis, and (d) advanced nuclear instrumentation will be described in detail. The use of the facility to promote general nuclear literacy among college students, high school and grade school students and the general population will also be covered

Influence of an Environmental Studies Course on Attitudes of Undergraduates at an Engineering University

Science.gov (United States)

Kuo, Shih-Yun; Jackson, Nancy L.

2014-01-01

Studies suggest that at engineering universities, where the percentage of males and engineering majors is high, pro-environmental attitudes are likely to be weak and may not change. The 15-item New Ecological Paradigm (NEP) scale was used to measure differences in student attitudes before and after an environmental studies course. Results revealed…

Hybrid rocket engine research program at Ryerson University

Energy Technology Data Exchange (ETDEWEB)

Karpynczyk, J.; Greatrix, D.R. [Ryerson Polytechnic Univ., Toronto, ON (Canada). Dept. of Aerospace Engineering

2007-07-01

Hybrid rocket engines (HREs) are a combination of solid and liquid propellant rocket engine designs. A solid fuel grain is located in the main combustion chamber and nozzle aft, while a stored liquid or gaseous oxidizer source supplies the required oxygen content through a throttle valve, for combustion downstream in the main chamber. HREs have drawn significant interest in certain flight applications, as they can be advantageous in terms of cost, ease and safety in storage, controllability in flight, and availability of propellant constituents. Key factors that will lead to further practical usage of HREs for flight applications are their predictability and reproducibility of operational performance. This paper presented information on studies being conducted at Ryerson University aimed at analyzing and testing the performance of HREs. It discussed and illustrated the conventional HRE and analyzed engine performance considerations such as the fuel regression rate, mass flux about the fuel surface, burning rate, and zero transformation parameter. Other factors relating to HRE performance that were presented included induced forward and aft oxidizer flow swirl effects as a means for augmenting the fuel regression rate, stoichiometric grain length issues, and feed system stability. Last, the paper presented a simplified schematic diagram of a proposed thrust/test stand for HRE test firings. 2 refs., 3 figs.

StreamQRE: Modular Specification and Efficient Evaluation of Quantitative Queries over Streaming Data.

Science.gov (United States)

Mamouras, Konstantinos; Raghothaman, Mukund; Alur, Rajeev; Ives, Zachary G; Khanna, Sanjeev

2017-06-01

Real-time decision making in emerging IoT applications typically relies on computing quantitative summaries of large data streams in an efficient and incremental manner. To simplify the task of programming the desired logic, we propose StreamQRE, which provides natural and high-level constructs for processing streaming data. Our language has a novel integration of linguistic constructs from two distinct programming paradigms: streaming extensions of relational query languages and quantitative extensions of regular expressions. The former allows the programmer to employ relational constructs to partition the input data by keys and to integrate data streams from different sources, while the latter can be used to exploit the logical hierarchy in the input stream for modular specifications. We first present the core language with a small set of combinators, formal semantics, and a decidable type system. We then show how to express a number of common patterns with illustrative examples. Our compilation algorithm translates the high-level query into a streaming algorithm with precise complexity bounds on per-item processing time and total memory footprint. We also show how to integrate approximation algorithms into our framework. We report on an implementation in Java, and evaluate it with respect to existing high-performance engines for processing streaming data. Our experimental evaluation shows that (1) StreamQRE allows more natural and succinct specification of queries compared to existing frameworks, (2) the throughput of our implementation is higher than comparable systems (for example, two-to-four times greater than RxJava), and (3) the approximation algorithms supported by our implementation can lead to substantial memory savings.

External Data Structures for Shortest Path Queries on Planar Digraphs

DEFF Research Database (Denmark)

Arge, Lars; Toma, Laura

2005-01-01

In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N 1 + ε) and S = O(N2/B), our main result is a family of structures that use S space and answer queries in O(N2/ S B) I/Os, thus obtaining...... optimal space-query product O(N2/B). An S space structure can be constructed in O(√S · sort(N)) I/Os, where sort(N) is the number of I/Os needed to sort N elements, B is the disk block size, and N is the size of the graph....

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.

Development of undergraduate nuclear security curriculum at College of Engineering, Universiti Tenaga Nasional

Science.gov (United States)

Hamid, Nasri A.; Mujaini, Madihah; Mohamed, Abdul Aziz

2017-01-01

The Center for Nuclear Energy (CNE), College of Engineering, Universiti Tenaga Nasional (UNITEN) has a great responsibility to undertake educational activities that promote developing human capital in the area of nuclear engineering and technology. Developing human capital in nuclear through education programs is necessary to support the implementation of nuclear power projects in Malaysia in the near future. In addition, the educational program must also meet the nuclear power industry needs and requirements. In developing a certain curriculum, the contents must comply with the university's Outcomes Based Education (OBE) philosophy. One of the important courses in the nuclear curriculum is in the area of nuclear security. Basically the nuclear security course covers the current issues of law, politics, military strategy, and technology with regard to weapons of mass destruction and related topics in international security, and review legal regulations and political relationship that determine the state of nuclear security at the moment. In addition, the course looks into all aspects of the nuclear safeguards, builds basic knowledge and understanding of nuclear non-proliferation, nuclear forensics and nuclear safeguards in general. The course also discusses tools used to combat nuclear proliferation such as treaties, institutions, multilateral arrangements and technology controls. In this paper, we elaborate the development of undergraduate nuclear security course at the College of Engineering, Universiti Tenaga Nasional. Since the course is categorized as mechanical engineering subject, it must be developed in tandem with the program educational objectives (PEO) of the Bachelor of Mechanical Engineering program. The course outcomes (CO) and transferrable skills are also identified. Furthermore, in aligning the CO with program outcomes (PO), the PO elements need to be emphasized through the CO-PO mapping. As such, all assessments and distribution of Bloom Taxonomy

Video Stream Retrieval of Unseen Queries using Semantic Memory

NARCIS (Netherlands)

Cappallo, S.; Mensink, T.; Snoek, C.G.M.; Wilson, R.C.; Hancock, E.R.; Smith, W.A.P.

2016-01-01

Retrieval of live, user-broadcast video streams is an under-addressed and increasingly relevant challenge. The on-line nature of the problem requires temporal evaluation and the unforeseeable scope of potential queries motivates an approach which can accommodate arbitrary search queries. To account

A framework for query optimization to support data mining

NARCIS (Netherlands)

S.R. Choenni (Sunil); A.P.J.M. Siebes (Arno)

1996-01-01

textabstractIn order to extract knowledge from databases, data mining algorithms heavily query the databases. Inefficient processing of these queries will inevitably have its impact on the performance of these algorithms, making them less valuable. In this paper, we describe an optimization

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.

Case-based reasoning support for engineering design

Science.gov (United States)

Lees, Brian; Hamza, Meer; Irgens, Chris

2000-10-01

The potential application of case-based reasoning (CBR) in design support is illustrated through examples drawn from research at the University of Paisley, demonstrating the suitability of CBR for different aspects of design, different problem areas, and different design goals. A quality advisory system has been developed for the early stages of mechanical engineering design, the aim of which is to provide quality advice in a variant design situation. In the domain of software engineering CBR has been applied to advise on which metrics are appropriate fora assessing the quality of the software currently under design. The system integrates CBR with concepts from quality function deployment (QFD) and incorporates a case library holding past software quality histories. CBR has been applied in support of conceptual design: to capture detailed design histories by monitoring designer actions, and thereby support design reuse through the evaluation of designs, through the provision of query, browsing and replay facilities. The resulting system is aimed to support the design of safety critical systems, by assisting in the construction of safety arguments, and cooperative design.

Obstacles of Search Engines Used by Graduate Students at The Faculty of Education, The Islamic University in Gaza

Directory of Open Access Journals (Sweden)

Fayez Kamal Shaladan

2018-03-01

Full Text Available This study aimed to identify obstacles of search engines used by graduate students at the Faculty of Education, the Islamic University in Gaza, and to overcome them. The researchers utilized the analytical descriptive approach to achieve the goal of the study. They used the interview tool and designed a questionnaire to collect data for the study. The sample of the study was (164 male and female postgraduate students enrolled in the College of Education. The study results were as follows: The degree of obstacles to the use of search engines among postgraduate students at the Faculty of Education at the Islamic University in Gaza was high with a percentage of (%71.05.There were no statistically significant differences between the averages of the study sample for the obstacles of the use of the search engines among the postgraduate students in the Faculty of Education, the Islamic University due to the gender and academic variables, the cumulative average. An exception to this was the third theme which was personal constraints which had differences in favor of students whose cumulative rates were less than (%85. The study concluded with these recommendations: The university should subscribe to various search engines revise admission terms and conditions for postgraduate studies whereby English and computer courses can be included. Keywords: Search engines, Students, Postgraduate studies, Islamic University.

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.

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

DEFF Research Database (Denmark)

Lu, Yang; Bui, Bin; Zhao, Jiakui

2008-01-01

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

Two Dimensional Range Minimum Queries and Fibonacci Lattices

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Davoodi, Pooya; Lewenstein, Moshe

2012-01-01

technique—the discrepancy properties of Fibonacci lattices—we give an indexing data structure for 2D-RMQs that uses O(N/c) bits additional space with O(clogc(loglogc)2) query time, for any parameter c, 4 ≤ c ≤ N. Also, when the entries of the input matrix are from {0,1}, we show that the query time can...

Gender in Engineering Studies at Brazilian Technical University

Directory of Open Access Journals (Sweden)

de Lima Sobreira, Josimeire

2008-10-01

Full Text Available The research on a Technological University of Brazil, among students in Engineering, revealed that women occupy no more than 12 % (in general of the places at the Institution. The university study that the girls most prefer is the Engineering of Buildings and the other one, where there are the least number of women, is Mechanics Engineering. The qualitative research with the students, made by interviews, showed that there is a gender discrimination among them. The boys do not consider their schoolmates competents for the exact sciences. The girls have to do a greater effort than the boys to success and to be respected by them. But even so they recognize that will not have the same opportunities of work that the men will. However, gender changes among the students are evidences that women have reached important places at the technological field.La investigación en una Universidad Tecnológica de Brasil entre estudiantes de los cursos de ingeniería ha mostrado que las mujeres no ocupan más que 12 % (en general de las plazas de la Institución. El curso con más estudiantes es el de Ingeniería Civil, mientras el curso con el más pequeño número de mujeres es el de Mecánica. La metodología de la investigación ha sido cualitativa. Las entrevistas con chicas-chicos de los cursos investigados revelaron que hay discriminación entre los estudiantes que no consideran a sus compañeras de curso competentes para los estudios de ciencias exactas. Para que sean respetadas ellas tienen que estudiar mucho más que ellos, pero, aunque logren muy buenas evaluaciones, reconocen que en el mercado laboral tendrán menos oportunidades de trabajo que sus colegas. Entretanto, los cambios de género entre los y las estudiantes evidencian que las mujeres están conquistando espacios importantes.

Can Internet search queries help to predict stock market volatility?

OpenAIRE

Dimpfl, Thomas; Jank, Stephan

2011-01-01

This paper studies the dynamics of stock market volatility and retail investor attention measured by internet search queries. We find a strong co-movement of stock market indices’ realized volatility and the search queries for their names. Furthermore, Granger causality is bi-directional: high searches follow high volatility, and high volatility follows high searches. Using the latter feedback effect to predict volatility we find that search queries contain additional information about market...

A high performance, ad-hoc, fuzzy query processing system for relational databases

Science.gov (United States)

Mansfield, William H., Jr.; Fleischman, Robert M.

1992-01-01

Database queries involving imprecise or fuzzy predicates are currently an evolving area of academic and industrial research. Such queries place severe stress on the indexing and I/O subsystems of conventional database environments since they involve the search of large numbers of records. The Datacycle architecture and research prototype is a database environment that uses filtering technology to perform an efficient, exhaustive search of an entire database. It has recently been modified to include fuzzy predicates in its query processing. The approach obviates the need for complex index structures, provides unlimited query throughput, permits the use of ad-hoc fuzzy membership functions, and provides a deterministic response time largely independent of query complexity and load. This paper describes the Datacycle prototype implementation of fuzzy queries and some recent performance results.

Querying phenotype-genotype relationships on patient datasets using semantic web technology: the example of Cerebrotendinous xanthomatosis.

Science.gov (United States)

Taboada, María; Martínez, Diego; Pilo, Belén; Jiménez-Escrig, Adriano; Robinson, Peter N; Sobrido, María J

2012-07-31

Semantic Web technology can considerably catalyze translational genetics and genomics research in medicine, where the interchange of information between basic research and clinical levels becomes crucial. This exchange involves mapping abstract phenotype descriptions from research resources, such as knowledge databases and catalogs, to unstructured datasets produced through experimental methods and clinical practice. This is especially true for the construction of mutation databases. This paper presents a way of harmonizing abstract phenotype descriptions with patient data from clinical practice, and querying this dataset about relationships between phenotypes and genetic variants, at different levels of abstraction. Due to the current availability of ontological and terminological resources that have already reached some consensus in biomedicine, a reuse-based ontology engineering approach was followed. The proposed approach uses the Ontology Web Language (OWL) to represent the phenotype ontology and the patient model, the Semantic Web Rule Language (SWRL) to bridge the gap between phenotype descriptions and clinical data, and the Semantic Query Web Rule Language (SQWRL) to query relevant phenotype-genotype bidirectional relationships. The work tests the use of semantic web technology in the biomedical research domain named cerebrotendinous xanthomatosis (CTX), using a real dataset and ontologies. A framework to query relevant phenotype-genotype bidirectional relationships is provided. Phenotype descriptions and patient data were harmonized by defining 28 Horn-like rules in terms of the OWL concepts. In total, 24 patterns of SWQRL queries were designed following the initial list of competency questions. As the approach is based on OWL, the semantic of the framework adapts the standard logical model of an open world assumption. This work demonstrates how semantic web technologies can be used to support flexible representation and computational inference mechanisms

On the Suitability of Skyline Queries for Data Exploration

DEFF Research Database (Denmark)

Chester, Sean; Mortensen, Michael Lind; Assent, Ira

2014-01-01

The skyline operator has been studied in database research for multi-criteria decision making. Until now the focus has been on the efficiency or accuracy of single queries. In practice, however, users are increasingly confronted with unknown data collections, where precise query formulation proves...

Intelligent query processing for semantic mediation of information systems

Directory of Open Access Journals (Sweden)

Saber Benharzallah

2011-11-01

Full Text Available We propose an intelligent and an efficient query processing approach for semantic mediation of information systems. We propose also a generic multi agent architecture that supports our approach. Our approach focuses on the exploitation of intelligent agents for query reformulation and the use of a new technology for the semantic representation. The algorithm is self-adapted to the changes of the environment, offers a wide aptitude and solves the various data conflicts in a dynamic way; it also reformulates the query using the schema mediation method for the discovered systems and the context mediation for the other systems.

Relaxing rdf queries based on user and domain preferences

DEFF Research Database (Denmark)

Dolog, Peter; Stueckenschmidt, Heiner; Wache, Holger

2009-01-01

Research in cooperative query answering is triggered by the observation that users are often not able to correctly formulate queries to databases such that they return the intended result. Due to lacking knowledge about the contents and the structure of a database, users will often only be able t...... application in the context of e-learning systems....... 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...

Analysing Twitter and web queries for flu trend prediction.

Science.gov (United States)

Santos, José Carlos; Matos, Sérgio

2014-05-07

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

Research reactor usage at the Idaho National Engineering Laboratory in support of university research and education

International Nuclear Information System (INIS)

Woodall, D.M.; Dolan, T.J.; Stephens, A.G.

1990-01-01

The Idaho National Engineering Laboratory is a US Department of Energy laboratory which has a substantial history of research and development in nuclear reactor technologies. There are a number of available nuclear reactor facilities which have been incorporated into the research and training needs of university nuclear engineering programs. This paper addresses the utilization of the Advanced Reactivity Measurement Facility (ARMF) and the Coupled Fast Reactivity Measurement Facility (CFRMF) for thesis and dissertation research in the PhD program in Nuclear Science and Engineering by the University of Idaho and Idaho State University. Other reactors at the INEL are also being used by various members of the academic community for thesis and dissertation research, as well as for research to advance the state of knowledge in innovative nuclear technologies, with the EBR-II facility playing an essential role in liquid metal breeder reactor research. 3 refs

Blink and it's done: Interactive queries on very large data

OpenAIRE

Agarwal, Sameer; Iyer, Anand P.; Panda, Aurojit; Mozafari, Barzan; Stoica, Ion; Madden, Samuel R.

2012-01-01

In this demonstration, we present BlinkDB, a massively parallel, sampling-based approximate query processing framework for running interactive queries on large volumes of data. The key observation in BlinkDB is that one can make reasonable decisions in the absence of perfect answers. BlinkDB extends the Hive/HDFS stack and can handle the same set of SPJA (selection, projection, join and aggregate) queries as supported by these systems. BlinkDB provides real-time answers along with statistical...

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.

Engineering Ethics at the Catholic University of Lille (France): Research and Teaching in a European Context.

Science.gov (United States)

Didier, Christelle

2000-01-01

Discusses the development of non-technical education and ethics in engineering curricula in Europe and particularly in France. Investigates two projects at the Catholic University of Lille. The first project is an engineering ethics course and the second has to do with writing a European handbook on engineering ethics as a discipline. (Contains 28…

Query-dependent banding (QDB for faster RNA similarity searches.

Directory of Open Access Journals (Sweden)

Eric P Nawrocki

2007-03-01

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

Robust Optimization of Database Queries

Indian Academy of Sciences (India)

JAYANT

2011-07-06

Jul 6, 2011 ... Based on first-order logic. ○ Edgar ... Cost-based Query Optimizer s choice of execution plan ... Determines the values of goods shipped between nations in a time period select ..... Born: 1881 Elected: 1934 Section: Medicine.

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

Using Bitmap Indexing Technology for Combined Numerical and TextQueries

Energy Technology Data Exchange (ETDEWEB)

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

2006-10-16

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

Critical Thinking in the University Curriculum--The Impact on Engineering Education

Science.gov (United States)

Ahern, A.; O'Connor, T.; McRuairc, G.; McNamara, M.; O'Donnell, D.

2012-01-01

Critical thinking is a graduate attribute that many courses, including engineering courses, claim to produce in students. As a graduate attribute it is seen by academics as a particularly desirable outcome of student learning and is said by researchers to be a defining characteristic of university education. However, how critical thinking is…

Dataflow Query Execution in a Parallel Main-Memory Environment

NARCIS (Netherlands)

Wilschut, A.N.; Apers, Peter M.G.

1991-01-01

The performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results are a step in the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among others, synchronization issues are identified

A Quantum Private Query Protocol for Enhancing both User and Database Privacy

Science.gov (United States)

Zhou, Yi-Hua; Bai, Xue-Wei; Li, Lei-Lei; Shi, Wei-Min; Yang, Yu-Guang

2018-01-01

In order to protect the privacy of query user and database, some QKD-based quantum private query (QPQ) protocols were proposed. Unfortunately some of them cannot resist internal attack from database perfectly; some others can ensure better user privacy but require a reduction of database privacy. In this paper, a novel two-way QPQ protocol is proposed to ensure the privacy of both sides of communication. In our protocol, user makes initial quantum states and derives the key bit by comparing initial quantum state and outcome state returned from database by ctrl or shift mode instead of announcing two non-orthogonal qubits as others which may leak part secret information. In this way, not only the privacy of database be ensured but also user privacy is strengthened. Furthermore, our protocol can also realize the security of loss-tolerance, cheat-sensitive, and resisting JM attack etc. Supported by National Natural Science Foundation of China under Grant Nos. U1636106, 61572053, 61472048, 61602019, 61502016; Beijing Natural Science Foundation under Grant Nos. 4152038, 4162005; Basic Research Fund of Beijing University of Technology (No. X4007999201501); The Scientific Research Common Program of Beijing Municipal Commission of Education under Grant No. KM201510005016

DISPAQ: Distributed Profitable-Area Query from Big Taxi Trip Data †

Science.gov (United States)

Putri, Fadhilah Kurnia; Song, Giltae; Rao, Praveen

2017-01-01

One of the crucial problems for taxi drivers is to efficiently locate passengers in order to increase profits. The rapid advancement and ubiquitous penetration of Internet of Things (IoT) technology into transportation industries enables us to provide taxi drivers with locations that have more potential passengers (more profitable areas) by analyzing and querying taxi trip data. In this paper, we propose a query processing system, called Distributed Profitable-Area Query (DISPAQ) which efficiently identifies profitable areas by exploiting the Apache Software Foundation’s Spark framework and a MongoDB database. DISPAQ first maintains a profitable-area query index (PQ-index) by extracting area summaries and route summaries from raw taxi trip data. It then identifies candidate profitable areas by searching the PQ-index during query processing. Then, it exploits a Z-Skyline algorithm, which is an extension of skyline processing with a Z-order space filling curve, to quickly refine the candidate profitable areas. To improve the performance of distributed query processing, we also propose local Z-Skyline optimization, which reduces the number of dominant tests by distributing killer profitable areas to each cluster node. Through extensive evaluation with real datasets, we demonstrate that our DISPAQ system provides a scalable and efficient solution for processing profitable-area queries from huge amounts of big taxi trip data. PMID:28946679

[Projects to accelerate the practical use of innovative medical devices to collaborate with TWIns, Center for Advanced Biomedical Sciences, Waseda University and School of Engineering, The University of Tokyo].

Science.gov (United States)

Niimi, Shingo; Umezu, Mitsuo; Iseki, Hiroshi; Harada, Hiroshi Kasanuki Noboru; Mitsuishi, Mamoru; Kitamori, Takehiko; Tei, Yuichi; Nakaoka, Ryusuke; Haishima, Yuji

2014-01-01

Division of Medical Devices has been conducting the projects to accelerate the practical use of innovative medical devices to collaborate with TWIns, Center for Advanced Biomedical Sciences, Waseda University and School of Engineering, The University of Tokyo. The TWIns has been studying to aim at establishment of preclinical evaluation methods by "Engineering Based Medicine", and established Regulatory Science Institute for Medical Devices. School of Engineering, The University of Tokyo has been studying to aim at establishment of assessment methodology for innovative minimally invasive therapeutic devices, materials, and nanobio diagnostic devices. This report reviews the exchanges of personnel, the implement systems and the research progress of these projects.

A new weighted fuzzy grammar on object oriented database queries

Directory of Open Access Journals (Sweden)

Ali Haroonabadi

2012-08-01

Full Text Available The fuzzy object oriented database model is often used to handle the existing imprecise and complicated objects for many real-world applications. The main focus of this paper is on fuzzy queries and tries to analyze a complicated and complex query to get more meaningful and closer responses. The method permits the user to provide the possibility of allocating the weight to various parts of the query, which makes it easier to follow better goals and return the target objects.

An Educational Program for Newcomers to Enhance their Engineering Motivation and Creativity in Faculty of Engineering at Shizuoka University

Science.gov (United States)

Azuma, Naoto; Fujima, Nobuhisa; Nakamura, Tamotsu; Yamada, Shinkichi; Makizawa, Hisamitsu; Nakamura, Takato

In Faculty of Engineering at Shizuoka University, a new one-year educational program of mechatronics for newcomers will start at April in 2006. This program involves three stages designed to enhance their motivation and creativity in engineering. At the first and second stages, there are three activities; practicing digital circuits, controlling robots with Boe-Bot from Parallax Inc., and making their own microcontroller boards. At the third stage, each student cooperates with his team-mates to make a robot loaded his own board and through the game-type of competition the performance of each team-robot is scored. Through this program, we hope that our students enhance their engineering motivation and creativity.

A few examples go a long way: Constructing query models from elaborate query formulations

NARCIS (Netherlands)

Balog, K.; Weerkamp, W.; de Rijke, M.; Myaeng, S.-H.; Oard, D.W.; Sebastiani, F.; Chua, T.-S.; Leong, M.-K.

2008-01-01

We address a specific enterprise document search scenario, where the information need is expressed in an elaborate manner. In our scenario, information needs are expressed using a short query (of a few keywords) together with examples of key reference pages. Given this setup, we investigate how the

Dataflow Query Execution in a Parallel, Main-memory Environment

NARCIS (Netherlands)

Wilschut, A.N.; Apers, Peter M.G.

In this paper, the performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results of this study are a step into the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among others,

An XML-Enabled Data Mining Query Language XML-DMQL

NARCIS (Netherlands)

Feng, L.; Dillon, T.

2005-01-01

Inspired by the good work of Han et al. (1996) and Elfeky et al. (2001) on the design of data mining query languages for relational and object-oriented databases, in this paper, we develop an expressive XML-enabled data mining query language by extension of XQuery. We first describe some

Study of Query Expansion Techniques and Their Application in the Biomedical Information Retrieval

Directory of Open Access Journals (Sweden)

A. R. Rivas

2014-01-01

retrieval systems. These techniques help to overcome vocabulary mismatch issues by expanding the original query with additional relevant terms and reweighting the terms in the expanded query. In this paper, different text preprocessing and query expansion approaches are combined to improve the documents initially retrieved by a query in a scientific documental database. A corpus belonging to MEDLINE, called Cystic Fibrosis, is used as a knowledge source. Experimental results show that the proposed combinations of techniques greatly enhance the efficiency obtained by traditional queries.

Research-based learning for nuclear engineering education in Gadjah Mada University

International Nuclear Information System (INIS)

Putero, Susetyo Hario; Kusnanto; Harto, Andang Widi

2011-01-01

Nuclear engineering education in Gadjah Mada University has been operated since 1977 in order to prepare Indonesian people facing up nuclear era in Indonesia. Until 1995, most of the alumni work in National Nuclear Energy Board, but recently many of them have been taking advanced study abroad. To improve our quality of education, since the last 3 years Gadjah Mada University has implemented Research-Based Learning (RBL). RBL for nuclear engineering student is conducted by providing challenges to the student related to the critical issues in public acceptance of nuclear power plant (NPP) in Indonesia that is waste management. Students should join in a group to complete the assignment. Within the group, they discuss and produce new idea in order to manage radioactive waste of new generation NPP. So, they are stimulated to think the future based on the state of the art of waste technology. This method could increase student's knowledge and soft skills, simultaneously. Some students also continue to explore and to refine the task as their thesis topic. Therefore, implementation of RBL also succeeds in increasing student's efficiency study. (author)

References and arrow notation instead of join operation in query languages

Directory of Open Access Journals (Sweden)

Alexandr Savinov

2012-10-01

Full Text Available We study properties of the join operation in query languages and describe some of its major drawbacks. We provide strong arguments against using joins as a main construct for retrieving related data elements in general purpose query languages and argue for using references instead. Since conventional references are quite restrictive when applied to data modeling and query languages, we propose to use generalized references as they are defined in the concept-oriented model (COM. These references are used by two new operations, called projection and de-projection, which are denoted by right and left arrows and therefore this access method is referred to as arrow notation. We demonstrate advantages of the arrow notation in comparison to joins and argue that it makes queries simpler, more natural, easier to understand, and the whole query writing process more productive and less error-prone.

Creating the integral engineer : Combining development education, sustainability, entrepreneurship and technology at Delft University of Technology

NARCIS (Netherlands)

Zwarteveen, J.W.; Blom, E.M.; Vastbinder, B.; Brezet, J.C.

2010-01-01

A modern engineer is more than a technical specialist. Training an integral engineer requires education in non-technical skills, including social and ethical aspects. Therefore, Delft University of Technology (DUT) introduced sustainable development and entrepreneurship into its bachelor and master

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

Processing Incomplete Query Specifications in a Context-Dependent Reasoning Framework

Directory of Open Access Journals (Sweden)

Neli P. Zlatareva

2013-04-01

Full Text Available Search is the most prominent web service, which is about to change dramatically with the transition to the Semantic Web. Semantic Web applications are expected to deal with complex conjunctive queries, and not always such queries can be completely and precisely defined. Current Semantic Web reasoners built upon Description Logics have limited processing power in such environments. We discuss some of their limitations, and show how an alternative logical framework utilizing context-dependent rules can be extended to handle incomplete or imprecise query specifications.

A Typed Text Retrieval Query Language for XML Documents.

Science.gov (United States)

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

2002-01-01

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

Nuclear Power Engineering Education Program, University of Illinois

International Nuclear Information System (INIS)

Jones, B.G.

1993-01-01

The DOE/CECo Nuclear Power Engineering Education Program at the University of Illinois in its first year has significantly impacted the quality of the power education which our students receive. It has contributed to: the recently completed upgrade of the console of our Advanced TRIGA reactor which increases the reactor's utility for training, the procurement of new equipment to upgrade and refurbish several of the undergraduate laboratory set-ups, and the procurement of computational workstations in support of the instructional computing laboratory. In addition, smaller amounts of funds were used for the recruitment and retention of top quality graduate students, the support of faculty to visit other institutions to attract top students into the discipline, and to provide funds for faculty to participate in short courses to improve their skills and background in the power area. These items and activities have helped elevate in the student's perspective the role of nuclear power in the discipline. We feel this is having a favorable impact on student career selection and on ensuring the continued supply of well educated nuclear engineering graduates

A Distributed Approach to Continuous Monitoring of Constrained k-Nearest Neighbor Queries in Road Networks

Directory of Open Access Journals (Sweden)

Hyung-Ju Cho

2012-01-01

Full Text Available Given two positive parameters k and r, a constrained k-nearest neighbor (CkNN query returns the k closest objects within a network distance r of the query location in road networks. In terms of the scalability of monitoring these CkNN queries, existing solutions based on central processing at a server suffer from a sudden and sharp rise in server load as well as messaging cost as the number of queries increases. In this paper, we propose a distributed and scalable scheme called DAEMON for the continuous monitoring of CkNN queries in road networks. Our query processing is distributed among clients (query objects and server. Specifically, the server evaluates CkNN queries issued at intersections of road segments, retrieves the objects on the road segments between neighboring intersections, and sends responses to the query objects. Finally, each client makes its own query result using this server response. As a result, our distributed scheme achieves close-to-optimal communication costs and scales well to large numbers of monitoring queries. Exhaustive experimental results demonstrate that our scheme substantially outperforms its competitor in terms of query processing time and messaging cost.

Undergraduate courses in nuclear engineering in Italian universities: Cultural and practical aspects

International Nuclear Information System (INIS)

Guerrini, B.; Lombardi, C.; Naviglio, A.; Oliveri, E.; Panella, B.; Sobrero, E.

1992-01-01

The contents of the undergraduate courses given in Italian nuclear engineering faculties are analyzed, showing the validity of this professional profile also with reference to non-nuclear applications including relevant safety issues and the management of complex projects. The role of Italian universities is stressed, in the defense of knowledge and capability in the nuclear sector, also with reference to the years of the nuclear 'moratoria' decided at the political level after public consultation. The prospects of Italian nuclear engineers are examined, with reference to the European labour market

Computer aided training in nuclear power engineering at the Gdansk Technical University