Query Technologies and Applications for Program Comprehension

Industrial software systems are large and complex, both in terms of the software entities and their relationships. Consequently, understanding how a software system works requires the ability to pose queries over the design-level entities of the system. Traditionally, this task has been supported by simple tools (e.g., grep) combined with the programmer's intuition and experience. Recently, however, specialized code query technologies have matured to the point where they can be used in industrial situations, providing more intelligent, timely, and efficient responses to developer queries. This working session aims to explore the state of the art in code query technologies, and discover new ways in which these technologies may be useful in program comprehension. The session brings together researchers and practitioners. We survey existing techniques and applications, trying to understand the strengths and weaknesses of the various approaches, and sketch out new frontiers that hold promise.

A day in the life of PubMed: analysis of a typical day's query log.

OBJECTIVE: To characterize PubMed usage over a typical day and compare it to previous studies of user behavior on Web search engines. DESIGN: We performed a lexical and semantic analysis of 2,689,166 queries issued on PubMed over 24 consecutive hours on a typical day. MEASUREMENTS: We measured the number of queries, number of distinct users, queries per user, terms per query, common terms, Boolean operator use, common phrases, result set size, MeSH categories, used semantic measurements to group queries into sessions, and studied the addition and removal of terms from consecutive queries to gauge search strategies. RESULTS: The size of the result sets from a sample of queries showed a bimodal distribution, with peaks at approximately 3 and 100 results, suggesting that a large group of queries was tightly focused and another was broad. Like Web search engine sessions, most PubMed sessions consisted of a single query. However, PubMed queries contained more terms. CONCLUSION: PubMed's usage profile should be considered when educating users, building user interfaces, and developing future biomedical information retrieval systems.

Hyalotekite, (Ba,Pb,K)(4)(Ca,Y)(2)Si-8(B,Be)(2)(Si,B)(2)O28F, a Tectosilicate Related to Scapolite: New Structure Refinement, Phase Transitions and a Short-Range Ordered 3B Superstructure

Hyalotekite, a framework silicate of composition (Ba,Pb,K)(4)(Ca,Y)(2)Si-8(B,Be)(2) (Si,B)(2)O28F, is found in relatively high-temperature(greater than or equal to 500 degrees C) Mn skarns at Langban, Sweden, and peralkaline pegmatites at Dara-i-Pioz, Tajikistan. A new paragenesis at Dara-i-Pioz is pegmatite consisting of the Ba borosilicates leucosphenite and tienshanite, as well as caesium kupletskite, aegirine, pyrochlore, microcline and quartz. Hyalotekite has been partially replaced by barylite and danburite. This hyalotekite contains 1.29-1.78 wt.% Y2O3, equivalent to 0.172-0.238 Y pfu or 8-11% Y on the Ca site; its Pb/(Pb+Ba) ratio ranges 0.36-0.44. Electron microprobe F contents of Langban and Dara-i-Pioz hyalotekite range 1.04-1.45 wt.%, consistent with full occupancy of the F site. A new refinement of the structure factor data used in the original structural determination of a Langban hyalotekite resulted in a structural formula, (Pb1.96Ba1.86K0.18)Ca-2(B1.76Be0.24)(Si1.56B0.44)Si8O28F, consistent with chemical data and all cations with positive-definite thermal parameters, although with a slight excess of positive charge (+57.14 as opposed to the ideal +57.00). An unusual feature of the hyalotekite framework is that 4 of 28 oxygens are non-bridging; by merging these 4 oxygens into two, the framework topology of scapolite is obtained. The triclinic symmetry of hyalotekite observed at room temperature is obtained from a hypothetical tetragonal parent structure via a sequence of displacive phase transitions. Some of these transitions are associated with cation ordering, either Pb-Ba ordering in the large cation sites, or B-Be and Si-B ordering on tetrahedral sites. Others are largely displacive but affect the coordination of the large cations (Pb, Ba, K, Ca). High-resolution electron microscopy suggests that the undulatory extinction characteristic of hyalotekite is due to a fine mosaic microstructure. This suggests that at least one of these transitions occurs in nature during cooling, and that it is first order with a large volume change. A diffuse superstructure observed by electron diffraction implies the existence of a further stage of short-range cation ordering which probably involves both (Pb,K)-Ba and (BeSi,BB)-BSi.

Refinement of tourniquet-induced peripheral ischemia/reperfusion injury in rats: comparison of 2 h vs 24 h reperfusion.

Prolonged ischemia of skeletal muscle tissue, followed by reperfusion, leads to ischemia/reperfusion injury (IRI), which is a feared local and systemic inflammatory reaction. With respect to the 3Rs, we wanted to determine which parameters for assessment of IRI require a reperfusion time of 24 h and for which 2 h of reperfusion are sufficient. Rats were subjected to 3 h of hind limb ischemia and 2 h or 24 h of reperfusion. Human plasma derived C1 inhibitor was used as a drug to prevent reperfusion injury. For 2 h of reperfusion the rats stayed under anesthesia throughout (severity grade 1), whereas for 24 h they were awake under analgesia during reperfusion (grade 2). The femoral artery was clamped and a tourniquet was placed, under maintenance of venous return. C1 esterase inhibitor was systemically administered 5 min before the induction of ischemia. No differences in local muscle edema formation and depositions of immunoglobulin G and immunoglobulin M were observed between 2 h and 24 h (P > 0.05), whereas lung edema was only observed after 24 h. Muscle viability was significantly lower after 24 h vs 2 h reperfusion (P < 0.05). Increased plasma creatine kinase (CK)-MM and platelet-derived growth factor (PDGF)-bb could be detected after 2 h, but not after 24 h of reperfusion. By contrast, depositions of C3b/c and fibrin in muscle were only detected after 24 h (P < 0.001). In conclusion, for a first screening of drug candidates to reduce IRI, 2 h reperfusions are sufficient, and these reduce the severity of the animal experiment. Twenty-four-hour reperfusions are only needed for in-depth analysis of the mechanisms of IRI, including lung damage.

Refinement of experimental design and conduct in laboratory animal research.

The scientific literature of laboratory animal research is replete with papers reporting poor reproducibility of results as well as failure to translate results to clinical trials in humans. This may stem in part from poor experimental design and conduct of animal experiments. Despite widespread recognition of these problems and implementation of guidelines to attenuate them, a review of the literature suggests that experimental design and conduct of laboratory animal research are still in need of refinement. This paper will review and discuss possible sources of biases, highlight advantages and limitations of strategies proposed to alleviate them, and provide a conceptual framework for improving the reproducibility of laboratory animal research.

Self-adaptive grids for noise mapping refinement

Noise maps are usually represented as contour or isolines maps describing the sound levels in a region. Using this kind of representation the user can easily find the noise level assigned to every location in the map. But the acoustic calculations behind the map are not performed for every single location on it; they are only performed in a grid of receivers. The results in this calculation grid are interpolated to draw the isolines or contours. Therefore, the resolution of the calculation grid and the way it was created (rectangular, triangulated, random…) have an effect on the resulting map. In this paper we describe a smart iterative procedure to optimize the quality of the map at a really low additional computational cost, using self-adaptive grids for the acoustic calculations. These self-adaptive grids add new receivers to the sampling grid in those locations where they are expected to be more useful, so that the performance at the output of the interpolator is enhanced. Self-adaptive sampling grids can be used for minimizing the overall error of the map (improving its quality), or for reducing calculation times, and can be also applied selectively to target areas or contour lines. This can be done by the user customizing the maximum number of iterations, the number of new receivers for each iteration, the target isolines, the target quality…

Analyzing Query Success and User Context

This paper describes the participation of DAEDALUS at the LogCLEF lab in CLEF 2011. This year, the objectives of our participation are twofold. The first topic is to analyze if there is any measurable effect on the success of the search queries if the native language and the interface language chosen by the user are different. The idea is to determine if this difference may condition the way in which the user interacts with the search application. The second topic is to analyze the user context and his/her interaction with the system in the case of successful queries, to discover out any relation among the user native language, the language of the resource involved and the interaction strategy adopted by the user to find out such resource. Only 6.89% of queries are successful out of the 628,607 queries in the 320,001 sessions with at least one search query in the log. The main conclusion that can be drawn is that, in general for all languages, whether the native language matches the interface language or not does not seem to affect the success rate of the search queries. On the other hand, the analysis of the strategy adopted by users when looking for a particular resource shows that people tend to use the simple search tool, frequently first running short queries build up of just one specific term and then browsing through the results to locate the expected resource

Ecient Inference-aware RDB2RDF Query Rewriting

RDB2RDF systems generate RDF from relational databases, operating in two dierent manners: materializing the database content into RDF or acting as virtual RDF datastores that transform SPARQL queries into SQL. In the former, inferences on the RDF data (taking into account the ontologies that they are related to) are normally done by the RDF triple store where the RDF data is materialised and hence the results of the query answering process depend on the store. In the latter, existing RDB2RDF systems do not normally perform such inferences at query time. This paper shows how the algorithm used in the REQUIEM system, focused on handling run-time inferences for query answering, can be adapted to handle such inferences for query answering in combination with RDB2RDF systems.

Ecient Inference-aware RDB2RDF Query Rewriting

RDB2RDF systems generate RDF from relational databases, operating in two di�erent manners: materializing the database content into RDF or acting as virtual RDF datastores that transform SPARQL queries into SQL. In the former, inferences on the RDF data (taking into account the ontologies that they are related to) are normally done by the RDF triple store where the RDF data is materialised and hence the results of the query answering process depend on the store. In the latter, existing RDB2RDF systems do not normally perform such inferences at query time. This paper shows how the algorithm used in the REQUIEM system, focused on handling run-time inferences for query answering, can be adapted to handle such inferences for query answering in combination with RDB2RDF systems.

Enabling query technologies for the semantic sensor web

Sensor networks are increasingly being deployed in the environment for many different purposes. The observations that they produce are made available with heterogeneous schemas, vocabularies and data formats, making it difficult to share and reuse this data, for other purposes than those for which they were originally set up. The authors propose an ontology-based approach for providing data access and query capabilities to streaming data sources, allowing users to express their needs at a conceptual level, independent of implementation and language-specific details. In this article, the authors describe the theoretical foundations and technologies that enable exposing semantically enriched sensor metadata, and querying sensor observations through SPARQL extensions, using query rewriting and data translation techniques according to mapping languages, and managing both pull and push delivery modes.

Benchmarking federated SPARQL query engines: Are existing testbeds enough?

Testbeds proposed so far to evaluate, compare, and eventually improve SPARQL query federation systems have still some limitations. Some variables and con�gurations that may have an impact on the behavior of these systems (e.g., network latency, data partitioning and query properties) are not su�ciently de�ned; this a�ects the results and repeatability of independent evaluation studies, and hence the insights that can be obtained from them. In this paper we evaluate FedBench, the most comprehensive testbed up to now, and empirically probe the need of considering additional dimensions and variables. The evaluation has been conducted on three SPARQL query federation systems, and the analysis of these results has allowed to uncover properties of these systems that would normally be hidden with the original testbeds.

Towards a systematic benchmarking of ontology-based query rewriting systems

Query rewriting is one of the fundamental steps in ontologybased data access (OBDA) approaches. It takes as inputs an ontology and a query written according to that ontology, and produces as an output a set of queries that should be evaluated to account for the inferences that should be considered for that query and ontology. Different query rewriting systems give support to different ontology languages with varying expressiveness, and the rewritten queries obtained as an output do also vary in expressiveness. This heterogeneity has traditionally made it difficult to compare different approaches, and the area lacks in general commonly agreed benchmarks that could be used not only for such comparisons but also for improving OBDA support. In this paper we compile data, dimensions and measurements that have been used to evaluate some of the most recent systems, we analyse and characterise these assets, and provide a unified set of them that could be used as a starting point towards a more systematic benchmarking process for such systems. Finally, we apply this initial benchmark with some of the most relevant OBDA approaches in the state of the art.