Search

Your search keyword '"Zhang, Guo‐qiang"' showing total 55 results
Start Over Author "Zhang, Guo‐qiang" Publication Type Books
55 results on '"Zhang, Guo‐qiang"'

4. Conclusion

Author

Zhang, Guo-Qiang, primary, Abeysinghe, Rashmie, additional, and Cui, Licong, additional

Published
2022
Full Text
View/download PDF

7. Introduction

Author

Zhang, Guo-Qiang, primary, Abeysinghe, Rashmie, additional, and Cui, Licong, additional

Published
2022
Full Text
View/download PDF

49. Using SPARQL to Test for Lattices: Application to Quality Assurance in Biomedical Ontologies.

Author

Zhang, Guo-Qiang and Bodenreider, Olivier

Abstract

We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is quality assurance in biomedical ontologies, one desirable property of which is conformance to lattice structures. At the core of our pipeline is the algorithm called NuMi, for detecting the Number of Minimal upper bounds of any pair of elements in a given finite partial order. Our technical contribution is the coding of NuMi completely in SPARQL. To show its scalability, we applied NuMi to the entirety of SNOMED CT, the largest clinical ontology (over 300,000 conepts). Our experimental results have been groundbreaking: for the first time, all non-lattice pairs in SNOMED CT have been identified exhaustively from 34 million candidate pairs using over 2.5 billion queries issued to Virtuoso. The percentage of non-lattice pairs ranges from 0 to 1.66 among the 19 SNOMED CT hierarchies. These non-lattice pairs represent target areas for focused curation by domain experts. RDF, SPARQL and related tooling provide an efficient platform for implementing lattice algorithms on large data structures. [ABSTRACT FROM AUTHOR]

Published
2010
Full Text
View/download PDF

50. Weakly Distributive Domains.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Rangan, C. Pandu, Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Della Rocca, Simona Ronchi, Jiang, Ying, and Zhang, Guo-Qiang

Abstract

In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This accomplishes the first of a possible, two-step process in solving the problem raised in [1,2]: whether the category of stable bifinite domains of Amadio-Droste-Göbel [1,6] is the largest cartesian closed full sub-category within the category of ω-algebraic meet-cpos with stable functions. This paper presents results on the second step, which is to show that for any ω-algebraic meet-cpo D satisfying axioms ${\sf M}$ and ${\sf I}$ to be contained in a cartesian closed full sub-category using ω-algebraic meet-cpos with stable functions, it must not violate ${\sf MI}^{\infty}\;$. We introduce a new class of domains called weakly distributive domains and show that for these domains to be in a cartesian closed category using ω-algebraic meet-cpos, property ${\sf MI}^{\infty}\;$ must not be violated. We further demonstrate that principally distributive domains (those for which each principle ideal is distributive) form a proper subclass of weakly distributive domains, and Birkhoff's M3 and N5 [5] are weakly distributive (but non-distributive). We introduce also the notion of meet-generators in constructing stable functions and show that if an ω-algebraic meet-cpo D contains an infinite number of meet-generators, then [D →D] fails ${\sf I}$. However, the original problem of Amadio and Curien remains open. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results