Dissecting query performance in logical data models: Parsimony vs. greater ontological clarity

Even when data repositories exhibit near perfect data quality, users may formulate queries that do not correspond to the information requested. Users’ poor information retrieval performance may arise from either problems understanding of the data models that represent the real world systems, or their query skills. This research focuses on users’ understanding of the data structures, i.e., their ability to map the information request and the data model. The Bunge-Wand-Weber ontology was used to formulate three sets of hypotheses. Two laboratory experiments (one using a small data model and one using a larger data model) tested the effect of ontological clarity on users’ performance when undertaking component, record, and aggregate level tasks. The results indicate for the hypotheses associated with different representations but equivalent semantics that parsimonious data model participants performed better for component level tasks but that ontologically clearer data model participants performed better for record and aggregate level tasks.

Exploring composite acoustic features for efficient music similarity query

Music similarity query based on acoustic content is becoming important with the ever-increasing growth of the music information from emerging applications such as digital libraries and WWW. However, relative techniques are still in their infancy and much less than satisfactory. In this paper, we present a novel index structure, called Composite Feature tree, CF-tree, to facilitate efficient content-based music search adopting multiple musical features. Before constructing the tree structure, we use PCA to transform the extracted features into a new space sorted by the importance of acoustic features. The CF-tree is a balanced multi-way tree structure where each level represents the data space at different dimensionalities. The PCA transformed data and reduced dimensions in the upper levels can alleviate suffering from dimensionality curse. To accurately mimic human perception, an extension, named CF+-tree, is proposed, which further applies multivariable regression to determine the weight of each individual feature. We conduct extensive experiments to evaluate the proposed structures against state-of-art techniques. The experimental results demonstrate superiority of our technique.

Finding relevant search engine results:a minimax linear programming approach

For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach.

Compositional semantics of dataflow networks with query-driven communication of exact values

We develop and study the concept of dataflow process networks as used for exampleby Kahn to suit exact computation over data types related to real numbers, such as continuous functions and geometrical solids. Furthermore, we consider communicating these exact objectsamong processes using protocols of a query-answer nature as introduced in our earlier work. This enables processes to provide valid approximations with certain accuracy and focusing on certainlocality as demanded by the receiving processes through queries. We define domain-theoretical denotational semantics of our networks in two ways: (1) directly, i. e. by viewing the whole network as a composite process and applying the process semantics introduced in our earlier work; and (2) compositionally, i. e. by a fixed-point construction similarto that used by Kahn from the denotational semantics of individual processes in the network. The direct semantics closely corresponds to the operational semantics of the network (i. e. it iscorrect) but very difficult to study for concrete networks. The compositional semantics enablescompositional analysis of concrete networks, assuming it is correct. We prove that the compositional semantics is a safe approximation of the direct semantics. Wealso provide a method that can be used in many cases to establish that the two semantics fully coincide, i. e. safety is not achieved through inactivity or meaningless answers. The results are extended to cover recursively-defined infinite networks as well as nested finitenetworks. A robust prototype implementation of our model is available.

Optimizing search engines results using linear programming

When a query is passed to multiple search engines, each search engine returns a ranked list of documents. Researchers have demonstrated that combining results, in the form of a "metasearch engine", produces a significant improvement in coverage and search effectiveness. This paper proposes a linear programming mathematical model for optimizing the ranked list result of a given group of Web search engines for an issued query. An application with a numerical illustration shows the advantages of the proposed method. © 2011 Elsevier Ltd. All rights reserved.

Cross ontology query answering on the semantic web:an initial evaluation

PowerAqua is a Question Answering system, which takes as input a natural language query and is able to return answers drawn from relevant semantic resources found anywhere on the Semantic Web. In this paper we provide two novel contributions: First, we detail a new component of the system, the Triple Similarity Service, which is able to match queries effectively to triples found in different ontologies on the Semantic Web. Second, we provide a first evaluation of the system, which in addition to providing data about PowerAqua's competence, also gives us important insights into the issues related to using the Semantic Web as the target answer set in Question Answering. In particular, we show that, despite the problems related to the noisy and incomplete conceptualizations, which can be found on the Semantic Web, good results can already be obtained.

Internet search:subdivision-based interactive query expansion and the soft semantic web

The expansion of the Internet has made the task of searching a crucial one. Internet users, however, have to make a great effort in order to formulate a search query that returns the required results. Many methods have been devised to assist in this task by helping the users modify their query to give better results. In this paper we propose an interactive method for query expansion. It is based on the observation that documents are often found to contain terms with high information content, which can summarise their subject matter. We present experimental results, which demonstrate that our approach significantly shortens the time required in order to accomplish a certain task by performing web searches.

Using a Query Expansion Technique to Improve Document Retrieval

Query expansion (QE) is a potentially useful technique to help searchers formulate improved query statements, and ultimately retrieve better search results. The objective of our query expansion technique is to find a suitable additional term. Two query expansion methods are applied in sequence to reformulate the query. Experiments on test collections show that the retrieval effectiveness is considerably higher when the query expansion technique is applied.

Select, Link and Rank: Diversified Query Expansion and Entity Ranking using Wikipedia

A search query, being a very concise grounding of user intent, could potentially have many possible interpretations. Search engines hedge their bets by diversifying top results to cover multiple such possibilities so that the user is likely to be satisfied, whatever be her intended interpretation. Diversified Query Expansion is the problem of diversifying query expansion suggestions, so that the user can specialize the query to better suit her intent, even before perusing search results. We propose a method, Select-Link-Rank, that exploits semantic information from Wikipedia to generate diversified query expansions. SLR does collective processing of terms and Wikipedia entities in an integrated framework, simultaneously diversifying query expansions and entity recommendations. SLR starts with selecting informative terms from search results of the initial query, links them to Wikipedia entities, performs a diversity-conscious entity scoring and transfers such scoring to the term space to arrive at query expansion suggestions. Through an extensive empirical analysis and user study, we show that our method outperforms the state-of-the-art diversified query expansion and diversified entity recommendation techniques.

Homomorphic encryption and database query privacy

Homomorphic encryption is a particular type of encryption method that enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing its content. In the first part of this thesis, we discuss how database search queries can be made secure using a homomorphic encryption scheme based on the ideas of Gahi et al. Gahi’s method is based on the integer-based fully homomorphic encryption scheme proposed by Dijk et al. We propose a new database search scheme called the Homomorphic Query Processing Scheme, which can be used with the ring-based fully homomorphic encryption scheme proposed by Braserski. In the second part of this thesis, we discuss the cybersecurity of the smart electric grid. Specifically, we use the Homomorphic Query Processing scheme to construct a keyword search technique in the smart grid. Our work is based on the Public Key Encryption with Keyword Search (PEKS) method introduced by Boneh et al. and a Multi-Key Homomorphic Encryption scheme proposed by L´opez-Alt et al. A summary of the results of this thesis (specifically the Homomorphic Query Processing Scheme) is published at the 14th Canadian Workshop on Information Theory (CWIT).

Searching for return: How Google search engine query data can beat the market

Throughout the last years technologic improvements have enabled internet users to analyze and retrieve data regarding Internet searches. In several fields of study this data has been used. Some authors have been using search engine query data to forecast economic variables, to detect influenza areas or to demonstrate that it is possible to capture some patterns in stock markets indexes. In this paper one investment strategy is presented using Google Trends’ weekly query data from major global stock market indexes’ constituents. The results suggest that it is indeed possible to achieve higher Info Sharpe ratios, especially for the major European stock market indexes in comparison to those provided by a buy-and-hold strategy for the period considered.

Query routing in cooperative semi-structured peer-to-peer information retrieval networks

Conventional web search engines are centralised in that a single entity crawls and indexes the documents selected for future retrieval, and the relevance models used to determine which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to rely entirely on a single entity, Peer-to-Peer (P2P) Information Retrieval (IR) has been proposed as a solution, as it distributes the functional components of a web search engine – from crawling and indexing documents, to query processing – across the network of users (or, peers) who use the search engine. This strategy for constructing an IR system poses several efficiency and effectiveness challenges which have been identified in past work. Accordingly, this thesis makes several contributions towards advancing the state of the art in P2P-IR effectiveness by improving the query processing and relevance scoring aspects of a P2P web search. Federated search systems are a form of distributed information retrieval model that route the user’s information need, formulated as a query, to distributed resources and merge the retrieved result lists into a final list. P2P-IR networks are one form of federated search in routing queries and merging result among participating peers. The query is propagated through disseminated nodes to hit the peers that are most likely to contain relevant documents, then the retrieved result lists are merged at different points along the path from the relevant peers to the query initializer (or namely, customer). However, query routing in P2P-IR networks is considered as one of the major challenges and critical part in P2P-IR networks; as the relevant peers might be lost in low-quality peer selection while executing the query routing, and inevitably lead to less effective retrieval results. This motivates this thesis to study and propose query routing techniques to improve retrieval quality in such networks. Cluster-based semi-structured P2P-IR networks exploit the cluster hypothesis to organise the peers into similar semantic clusters where each such semantic cluster is managed by super-peers. In this thesis, I construct three semi-structured P2P-IR models and examine their retrieval effectiveness. I also leverage the cluster centroids at the super-peer level as content representations gathered from cooperative peers to propose a query routing approach called Inverted PeerCluster Index (IPI) that simulates the conventional inverted index of the centralised corpus to organise the statistics of peers’ terms. The results show a competitive retrieval quality in comparison to baseline approaches. Furthermore, I study the applicability of using the conventional Information Retrieval models as peer selection approaches where each peer can be considered as a big document of documents. The experimental evaluation shows comparative and significant results and explains that document retrieval methods are very effective for peer selection that brings back the analogy between documents and peers. Additionally, Learning to Rank (LtR) algorithms are exploited to build a learned classifier for peer ranking at the super-peer level. The experiments show significant results with state-of-the-art resource selection methods and competitive results to corresponding classification-based approaches. Finally, I propose reputation-based query routing approaches that exploit the idea of providing feedback on a specific item in the social community networks and manage it for future decision-making. The system monitors users’ behaviours when they click or download documents from the final ranked list as implicit feedback and mines the given information to build a reputation-based data structure. The data structure is used to score peers and then rank them for query routing. I conduct a set of experiments to cover various scenarios including noisy feedback information (i.e, providing positive feedback on non-relevant documents) to examine the robustness of reputation-based approaches. The empirical evaluation shows significant results in almost all measurement metrics with approximate improvement more than 56% compared to baseline approaches. Thus, based on the results, if one were to choose one technique, reputation-based approaches are clearly the natural choices which also can be deployed on any P2P network.

The Burden Of Eclampsia: Results From A Multicenter Study On Surveillance Of Severe Maternal Morbidity In Brazil.

Maternal mortality (MM) is a core indicator of disparities in women's rights. The study of Near Miss cases is strategic to identifying the breakdowns in obstetrical care. In absolute numbers, both MM and occurrence of eclampsia are rare events. We aim to assess the obstetric care indicators and main predictors for severe maternal outcome from eclampsia (SMO: maternal death plus maternal near miss). Secondary analysis of a multicenter, cross-sectional study, including 27 centers from all geographic regions of Brazil, from 2009 to 2010. 426 cases of eclampsia were identified and classified according to the outcomes: SMO and non-SMO. We classified facilities as coming from low- and high-income regions and calculated the WHO's obstetric health indicators. SPSS and Stata softwares were used to calculate the prevalence ratios (PR) and respective 95% confidence interval (CI) to assess maternal characteristics, clinical and obstetrical history, and access to health services as predictors for SMO, subsequently correlating them with the corresponding perinatal outcomes, also applying multiple regression analysis (adjusted for cluster effect). Prevalence of and mortality indexes for eclampsia in higher and lower income regions were 0.2%/0.8% and 8.1%/22%, respectively. Difficulties in access to health care showed that ICU admission (adjPR 3.61; 95% CI 1.77-7.35) and inadequate monitoring (adjPR 2.31; 95% CI 1.48-3.59) were associated with SMO. Morbidity and mortality associated with eclampsia were high in Brazil, especially in lower income regions. Promoting quality maternal health care and improving the availability of obstetric emergency care are essential actions to relieve the burden of eclampsia.

Delays In Receiving Obstetric Care And Poor Maternal Outcomes: Results From A National Multicentre Cross-sectional Study.

The vast majority of maternal deaths in low-and middle-income countries are preventable. Delay in obtaining access to appropriate health care is a fairly common problem which can be improved. The objective of this study was to explore the association between delay in providing obstetric health care and severe maternal morbidity/death. This was a multicentre cross-sectional study, involving 27 referral obstetric facilities in all Brazilian regions between 2009 and 2010. All women admitted to the hospital with a pregnancy-related cause were screened, searching for potentially life-threatening conditions (PLTC), maternal death (MD) and maternal near-miss (MNM) cases, according to the WHO criteria. Data on delays were collected by medical chart review and interview with the medical staff. The prevalence of the three different types of delays was estimated according to the level of care and outcome of the complication. For factors associated with any delay, the PR and 95%CI controlled for cluster design were estimated. A total of 82,144 live births were screened, with 9,555 PLTC, MNM or MD cases prospectively identified. Overall, any type of delay was observed in 53.8% of cases; delay related to user factors was observed in 10.2%, 34.6% of delays were related to health service accessibility and 25.7% were related to quality of medical care. The occurrence of any delay was associated with increasing severity of maternal outcome: 52% in PLTC, 68.4% in MNM and 84.1% in MD. Although this was not a population-based study and the results could not be generalized, there was a very clear and significant association between frequency of delay and severity of outcome, suggesting that timely and proper management are related to survival.

[why Does The Prevalence Of Cytopathological Results Of Cervical Cancer Screening Can Vary Significantly Between Two Regions Of Brazil?].

To analyze the prevalence of cervical cytopathological results for the screening of cervical cancer with regard to women's age and time since the last examination in Maceió and Rio de Janeiro, Brazil, among those assisted by the Brazilian Unified Health System. Cervical cytopathological results available in the Information System of Cervical Cancer Screening for the year 2011 were analyzed, corresponding to 206,550 for Rio de Janeiro and 45,243 for Maceió. In Rio de Janeiro, examination at one and two year intervals predominated, while in Maceió examination at one and three year intervals had a higher predominance. Women who underwent cervical smear screening in Maceió were older than those in Rio de Janeiro. The prevalence of invasive squamous cell carcinoma was similar for the two cities, but all the other results presented a higher prevalence in Rio de Janeiro: ASCUS (PR=5.32; 95%CI 4.66-6.07); ASCH (PR=4.27; 95%CI 3.15-5.78); atypical glandular cells (PR=10.02; 95%CI 5.66-17.76); low-grade squamous intraepithelial lesions (PR=6.10; 95%CI 5.27-7.07); high-grade squamous intraepithelial lesions (PR=8.90; 95%CI 6.50-12.18) and adenocarcinoma (PR=3.00; 95%CI 1.21-7.44). The rate of unsatisfactory cervical samples was two times higher in Maceió and that of rejected samples for analysis was five times higher in Maceió when compared to Rio de Janeiro. The prevalence rates of altered cervical cytopathological results was significantly higher in Rio de Janeiro than in Maceió. There is no objective information that may justify this difference. One hypothesis is that there may be a difference in the diagnostic performance of the cervical cancer screening, which could be related to the quality of the Pap smear. Thus, these findings suggest that it would be necessary to perform this evaluation at national level, with emphasis on the performance of cervical cancer screening in order to improve the effectiveness of cervical cancer control.