Searcharxiv⌕ Search

arXiv subjects

Zhiyong Feng

Publications and source records attributed to Zhiyong Feng.

188 records · Page 11Linked to original sources

PIWD: A Plugin-based Framework for Well-Designed SPARQL

In the real world datasets (e.g.,DBpedia query log), queries built on well-designed patterns containing only AND and OPT operators (for short, WDAO-patterns) account for a large proportion among all SPARQL queries. In this paper, we present a plugin-based framework for all SELECT queries built on WDAO-patterns, named PIWD. The framework is based on a parse tree called \emph{well-designed AND-OPT tree} (for short, WDAO-tree) whose leaves are basic graph patterns (BGP) and inner nodes are the OPT operators. We prove that for any WDAO-pattern, its parse tree can be equivalently transformed into a WDAO-tree. Based on the proposed framework, we can employ any query engine to evaluate BGP for evaluating queries built on WDAO-patterns in a convenient way. Theoretically, we can reduce the query evaluation of WDAO-patterns to subgraph homomorphism as well as BGP since the query evaluation of BGP is equivalent to subgraph homomorphism. Finally, our preliminary experiments on gStore and RDF-3X show that PIWD can answer all queries built on WDAO-patterns effectively and efficiently.

cs.DB↗

RORS: Enhanced Rule-based OWL Reasoning on Spark

The rule-based OWL reasoning is to compute the deductive closure of an ontology by applying RDF/RDFS and OWL entailment rules. The performance of the rule-based OWL reasoning is often sensitive to the rule execution order. In this paper, we present an approach to enhancing the performance of the rule-based OWL reasoning on Spark based on a locally optimal executable strategy. Firstly, we divide all rules (27 in total) into four main classes, namely, SPO rules (5 rules), type rules (7 rules), sameAs rules (7 rules), and schema rules (8 rules) since, as we investigated, those triples corresponding to the first three classes of rules are overwhelming (e.g., over 99% in the LUBM dataset) in our practical world. Secondly, based on the interdependence among those entailment rules in each class, we pick out an optimal rule executable order of each class and then combine them into a new rule execution order of all rules. Finally, we implement the new rule execution order on Spark in a prototype called RORS. The experimental results show that the running time of RORS is improved by about 30% as compared to Kim & Park's algorithm (2015) using the LUBM200 (27.6 million triples).

cs.DB↗

On the Statistical Analysis of Practical SPARQL Queries

In this paper, we analyze some basic features of SPARQL queries coming from our practical world in a statistical way. These features include three statistic features such as the occurrence frequency of triple patterns, fragments, well-designed patterns and four semantic features such as monotonicity, non-monotonicity, weak monotonicity (old solutions are still served as parts of new solutions when some new triples are added) and satisfiability. All these features contribute to characterize SPARQL queries in different dimensions. We hope that this statistical analysis would provide some useful observation for researchers and engineers who are interested in what practical SPARQL queries look like, so that they could develop some practical heuristics for processing SPARQL queries and build SPARQL query processing engines and benchmarks. Besides, they can narrow the scope of their problems by avoiding those cases that do possibly not happen in our practical world.

cs.DB↗

Efficient Approximation of Well-Designed SPARQL Queries

Query response time often influences user experience in the real world. However, it possibly takes more time to answer a query with its all exact solutions, especially when it contains the OPT operations since the OPT operation is the least conventional operator in SPARQL. So it becomes essential to make a trade-off between the query response time and the accuracy of their solutions. In this paper, based on the depth of the OPT operation occurring in a query, we propose an approach to obtain its all approximate queries with less depth of the OPT operation. This paper mainly discusses those queries with well-designed patterns since the OPT operation in a well-designed pattern is really "optional". Firstly, we transform a well-designed pattern in OPT normal form into a well-designed tree, whose inner nodes are labeled by OPT operation and leaf nodes are labeled by patterns containing other operations such as the AND operation and the FILTER operation. Secondly, based on this well-designed tree, we remove "optional" well-designed subtrees with less depth of the OPT operation and then obtain approximate queries with different depths of the OPT operation. Finally, we evaluate the approximate query efficiency with the degree of approximation.

cs.DB↗

B-spline Shape from Motion & Shading: An Automatic Free-form Surface Modeling for Face Reconstruction

Recently, many methods have been proposed for face reconstruction from multiple images, most of which involve fundamental principles of Shape from Shading and Structure from motion. However, a majority of the methods just generate discrete surface model of face. In this paper, B-spline Shape from Motion and Shading (BsSfMS) is proposed to reconstruct continuous B-spline surface for multi-view face images, according to an assumption that shading and motion information in the images contain 1st- and 0th-order derivative of B-spline face respectively. Face surface is expressed as a B-spline surface that can be reconstructed by optimizing B-spline control points. Therefore, normals and 3D feature points computed from shading and motion of images respectively are used as the 1st- and 0th- order derivative information, to be jointly applied in optimizing the B-spline face. Additionally, an IMLS (iterative multi-least-square) algorithm is proposed to handle the difficult control point optimization. Furthermore, synthetic samples and LFW dataset are introduced and conducted to verify the proposed approach, and the experimental results demonstrate the effectiveness with different poses, illuminations, expressions etc., even with wild images.

cs.CV↗

A Well-Founded Semantics for FOL-Programs

An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with description logics. In this paper, we define a well-founded semantics for FOL-programs based on a new notion of unfounded sets on consistent as well as inconsistent sets of literals, and study some of its properties. The semantics is defined for all FOL-programs, including those where it is necessary to represent inconsistencies explicitly. The semantics supports a form of combined reasoning by rules under closed world as well as open world assumptions, and it is a generalization of the standard well-founded semantics for normal logic programs. We also show that the well-founded semantics defined here approximates the well-supported answer set semantics for normal DL programs.

cs.PL↗

On the Construction of Radio Environment Maps for Cognitive Radio Networks

The Radio Environment Map (REM) provides an effective approach to Dynamic Spectrum Access (DSA) in Cognitive Radio Networks (CRNs). Previous results on REM construction show that there exists a tradeoff between the number of measurements (sensors) and REM accuracy. In this paper, we analyze this tradeoff and determine that the REM error is a decreasing and convex function of the number of measurements (sensors). The concept of geographic entropy is introduced to quantify this relationship. And the influence of sensor deployment on REM accuracy is examined using information theory techniques. The results obtained in this paper are applicable not only for the REM, but also for wireless sensor network deployment.

cs.NI↗

Convergence of quantum random walks with decoherence

In this paper, we study the discrete-time quantum random walks on a line subject to decoherence. The convergence of the rescaled position probability distribution $p(x,t)$ depends mainly on the spectrum of the superoperator $\mathcal{L}_{kk}$. We show that if 1 is an eigenvalue of the superoperator with multiplicity one and there is no other eigenvalue whose modulus equals to 1, then $\hat {P}(\fracν {\sqrt t},t)$ converges to a convex combination of normal distributions. In terms of position space, the rescaled probability mass function $p_t (x, t) \equiv p(\sqrt t x, t)$, $ x \in Z/\sqrt t$, converges in distribution to a continuous convex combination of normal distributions. We give an necessary and sufficient condition for a U(2) decoherent quantum walk that satisfies the eigenvalue conditions. We also give a complete description of the behavior of quantum walks whose eigenvalues do not satisfy these assumptions. Specific examples such as the Hadamard walk, walks under real and complex rotations are illustrated. For the O(2) quantum random walks, an explicit formula is provided for the scaling limit of $p(x,t)$ and their moments. We also obtain exact critical exponents for their moments at the critical point and show universality classes with respect to these critical exponents.

math.PR↗