Evidence-based healthcare integrates the best research evidence with clinical expertise in order to make decisions based on the best practices available. In this context, the task of collecting all the relevant information, a recall oriented task, in order to take the right decision within a reasonable time frame has become an important issue. In this paper, we investigate the problem of building an effective Consumer Health Search (CHS) systems that use query variations to achieve high recall and fulfill the information needs of health consumers. In particular, we study an intent-aware gain metric used to estimate the amount of missing information and make a prediction about the achievable recall for each query reformulation during a search session. We evaluate and propose alternative formulations of this metric using standard test collections of the CLEF 2018 eHealth Evaluation Lab CHS.

The world of query-response systems heavily depends on the cloud storage solutions, distributed data transfers and locality of users etc. When data stores and users are distributed geographically, it is essential to organize distributed data cache points at ideal locations to minimize data transfers. This leads to the question, what data to cache in which location. To answer this, we are developing an adaptive distributed data caching framework that can identify suitable data chunks to cache and move across a network of community cache locations. This paper details the first step of the process: the sub-query fragmentation technique to fragment data into portable objects. Evaluation suggests that sub-query fragments enable distributed learning methods to understand query patterns and association between sub-queries. The sub-query objects can be modelled easily as input dataset to implement machine learning models to assist cache maintenance.

The PACS (Picture Archiving and Communication System) market is heterogenous with dozens of PACS providers having deployed installations in healthcare facilities. The DICOM query and retrieve interfaces provided by PACS have multiple variations, related to the implemented SOP (Service Object Pair) Class UID (Unique Identifier), transfer syntaxes, extended negotiations, matching attributes and matching types. These variations make any integration of a new DICOM consumer with a PACS complex and time consuming. As there is no collective information describing the various PACS query and retrieve capabilities, application developers and healthcare facilities lack a method to evaluate the PACS capabilities and classify its functionalities. GE designed a method to evaluate the PACS capabilities in terms of query retrieve functionalities. Our aim is to analyze several PACS in test and production environments, using our method to provide the DICOM object consumers a macroscopic knowledge of query/retrieve capabilities of PACS functionalities and its different variations. Our evaluation can also be used by PACS and VNA (Vendor Neutral Archive) developers to evaluate their query/retrieve capabilities, for quality improvement purpose.

Recent years have seen the growing adoption of non-relational data models for representing diverse, incomplete data. Among these, the RDF graph-based data model has seen ever-broadening adoption, particularly on the Web. This adoption has prompted the standardization of the SPARQL query language for RDF, as well as the development of a variety of local and distributed engines for processing queries over RDF graphs. These engines implement a diverse range of specialized techniques for storage, indexing, and query processing. A number of benchmarks, based on both synthetic and real-world data, have also emerged to allow for contrasting the performance of different query engines, often at large scale. This survey paper draws together these developments, providing a comprehensive review of the techniques, engines and benchmarks for querying RDF knowledge graphs.

Service robots operating in indoor environments should recognize dynamic changes from sensors, such as RGB-D camera, and recall the past context. Therefore, we propose a context query-processing framework, comprising spatio-temporal robotic context query language (ST-RCQL) and spatio-temporal robotic context query-processing system (ST-RCQP), for service robots. We designed them based on the spatio-temporal context ontology. ST-RCQL can query not only the current context knowledge but also the past. In addition, ST-RCQL includes a variety of time operators and time constants, and thus queries can be written very efficiently. The ST-RCQP is a query-processing system equipped with a perception handler, working memory, and backward reasoner for real-time query-processing. Moreover, ST-RCQP accelerates query-processing speed by building a spatio-temporal index in the working memory, where percepts are stored. Through various qualitative and quantitative experiments, we demonstrate the high efficiency and performance of the proposed context query-processing framework.

Quantum cryptography is the field of cryptography that explores the quantum properties of matter. Its aim is to develop primitives beyond the reach of classical cryptography or to improve on existing classical implementations. Although much of the work in this field has been dedicated to quantum key distribution (QKD), some important steps were made towards the study and development of quantum oblivious transfer (QOT). It is possible to draw a comparison between the application structure of both QKD and QOT primitives. Just as QKD protocols allow quantum-safe communication, QOT protocols allow quantum-safe computation. However, the conditions under which QOT is actually quantum-safe have been subject to a great amount of scrutiny and study. In this review article, we survey the work developed around the concept of oblivious transfer in the area of theoretical quantum cryptography, with an emphasis on some proposed protocols and their security requirements. We review the impossibility results that daunt this primitive and discuss several quantum security models under which it is possible to prove QOT security.

In this paper, a new approach to retrieve semantic images based on shape and geometric features of image in conjunction with multi-class support vector machine is proposed. Zernike moment as shape feature is to verify the invariance of objects for silhouette image. In addition, a set of geometrical features is to explore the objects shape using two features of rectangularity and circularity. Then the extracted features are normalized and employed for multi-class support vector machine either for learning or retrieving processes. The retrieving process relies on three main tasks which namely Query Engine, Matching Module and Ontology Manger, respectively. Query Engine is to build the input text or image query using SPARQL language. The matching module extracts the shape and geometric features of image’s objects and employ them to Ontology Manger which in turn inserts them in ontology knowledge base. Benchmark mammals have been conducted to empirically conclude the outcome of proposed approach. Our experiment on text and image retrieval yields efficient results to problematic phenomena than previously reported.

Resource Description Framework(RDF) is a data representation format of the Semantic Web, and its data volume is growing rapidly. Cloud-based systems provide a rich platform for managing RDF data. However, the distributed environment has performance challenges when it is processing with RDF queries that contain multiple join operations, such as network reshuffle, memory overhead. To get over these challenges, this paper proposed a spark-based RDF query architecture, which is based on Semantic Connection Set (SCS). First of all, this spark-based query architecture adopts the mechanism of re-partitioning class data based on vertical partitioning, which can reduce memory overhead and fast index data. Secondly, a method for generating query plans based on semantic connection sets is proposed in this paper. In addition, statistics and broadcast variable optimization strategies are used to reduce shuffling and data communication costs. The experiment of this paper is based on the latest SPARQLGX on the spark platform RDF system, two synthetic benchmarks are used to evaluate the query. The experiment result illustrates that the proposed approach in this paper is more efficient in data search than SPARQLGX.

Automatic Voice Query Service can extremely reduce the artificial cost, which could improve the response efficiency for users. The automatic speech recognition (ASR) is one of the important component in AVQS. However, many dialect areas in China make the AVQS have to response the multi-accented Mandarin users by single acoustic model in ASR. This problem severely limits the accuracy of ASR for multi-accented speech in the AVQS. In this paper, a new framework for AVQS is proposed to improve the accuracy of response. Firstly, the fusion feature including iVector and filterbank acoustic features is used to train the Transformer-CTC model. Secondly, the transformer-CTC model is used to construct the end-to-end ASR. Finally, key words matching algorithm for AVQS based on fuzzy mathematic theory is proposed to further improve the accuracy of response. The results show that the final accuracy in our proposed framework for AVQS arrives at 91.5%. The proposed framework for AVQS can satisfy the service requirement of different areas in mainland of China. This research has a great significance for exploring the application value of artificial intelligence in the real scene.

This paper extends our seminal paper on KnoBAB for efficient Conformance Checking computations performed on top of a customised relational model. After defining our proposed temporal algebra for temporal queries (xtLTLf ), we show that this can express existing temporal languages over finite and non-empty traces such as LTLf . This paper also proposes a parallelisation strategy for such queries thus reducing conformance checking into an embarrassingly parallel problem leading to super-linear speed up. This paper also presents how a single xtLTLf operator (or even entire sub-expressions) might be efficiently implemented via different algorithms thus paving the way to future algorithmic improvements. Finally, our benchmarks remark that our proposed implementation of xtLTLf (KnoBAB) outperforms state-of-the-art conformance checking software running on LTLf logic, be it data or dateless.

The recent advancements of the Semantic Web and Linked Data have changed the working of the traditional web. There is significant adoption of the Resource Description Framework (RDF) format for saving of web-based data. This massive adoption has paved the way for the development of various centralized and distributed RDF processing engines. These engines employ various mechanisms to implement critical components of the query processing engines such as data storage, indexing, language support, and query execution. All these components govern how queries are executed and can have a substantial effect on the query runtime. For example, the storage of RDF data in various ways significantly affects the data storage space required and the query runtime performance. The type of indexing approach used in RDF engines is critical for fast data lookup. The type of the underlying querying language (e.g., SPARQL or SQL) used for query execution is a crucial optimization component of the RDF storage solutions. Finally, query execution involving different join orders significantly affects the query response time. This paper provides a comprehensive review of centralized and distributed RDF engines in terms of storage, indexing, language support, and query execution.

The enormous growth in the penetration of electric vehicles (EVs), has laid the path to advancements in the charging infrastructure. Connectivity between charging stations is an essential prerequisite for future EV adoption to alleviate users’ “range anxiety”. The existing charging stations fail to adopt power provision allocation and scheduling management. To improve the existing charging infrastructure data based on real-time information and availability of reserves at charging stations could be uploaded to the users to help them locate the nearest charging station for an EV. This research article focuses on an a interactive user application developed through SQL and PHP platform to allocate the charging slots based on estimated battery parameters, which uses data communication with charging stations to receive the slot availability information. The proposed server-based real-time forecast charging infrastructure avoids waiting times and its scheduling management efficiently prevents the EV from halting on road due to battery drain out. The proposed model is implemented using a low-cost microcontroller and the system etiquette tested.

To ensure the security of spatial-temporal Top-k query in two-tiered wireless sensor networks, many schemes have been proposed in the literature in the past decade. However, most of them only consider the scenario where sensor nodes are static, and cannot achieve the security goal for spatial-temporal Top-k query in mobile sensor networks, because the mobility of the sensor nodes will affect the spatial-temporal relationships of the sensory data items generated by the sensor nodes. Although we have proposed some schemes for two-tiered mobile wireless sensor networks (TMWSNs) in our previous work, there is still large room to improve their performances. In this paper, we proposed a novel scheme named STQ-TMWSN for secure fine-grained spatial-temporal Top-k query in TMWSNs based on the virtual-grid construction and the size-order encryption binding. Theoretic analysis shows that STQ-TMWSN can achieve low computation complexity and high security performance. Simulation results indicate that STQ-TMWSN brings much lower communication cost than the state-of-the-art schemes on securing Top-k query in TMWSNs.

We introduce the Concept-Model-Graph-View Cycle (CMGVC). The CMGVC facilitates coherent architecture analysis, reasoning, insight, and decision-making based on conceptual models that are transformed into a generic, robust graph data structure (GDS). The GDS is then transformed into multiple views of the model, which inform stakeholders in various ways. This GDS-based approach decouples the view from the model and constitutes a powerful enhancement of model-based systems engineering (MBSE). The CMGVC applies the rigorous foundations of Category Theory, a mathematical framework of representations and transformations. We show that modeling languages are categories, drawing an analogy to programming languages. The CMGVC architecture is superior to direct transformations and language-coupled common representations. We demonstrate the CMGVC to transform a conceptual system architecture model built with the Object Process Modeling Language (OPM) into dual graphs and a stakeholder-informing matrix that stimulates system architecture insight.

Let $f\left(1\right)=1$ , and let $f(n+1)=2^{2^{f\left(n\right)}}$ for every positive integer n. We consider the following hypothesis: if a system S ⊆ {x_i · x_j = x_k : i, j, k ∈ {1, . . . , n}} ∪ {x_i + 1 = x_k : i, k ∈{1, . . . , n}} has only finitely many solutions in non-negative integers x₁, . . . , x_n, then each such solution (x₁, . . . , x_n) satisfies x₁, . . . , x_n ≤ f (2n). We prove: (1) the hypothesisimplies that there exists an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the heights of integer (non-negative integer, positive integer, rational) solutions, if the solution set is finite; (2) the hypothesis implies that there exists an algorithm for listing the Diophantine equations with infinitely many solutions in non-negative integers; (3) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many rational solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has a rational solution; (4) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many integer solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has an integer solution; (5) the hypothesis implies that if a set $\mathfrak{M}$ ⊆ has a finite-fold Diophantine representation, then $\mathfrak{M}$ is computable.