Entity

Time filter

Source Type


Yang S.,Guangxi University for Nationalities | Yang S.,Chinese Academy of Sciences | Wu J.,Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis | He A.,Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis
Applied Mechanics and Materials | Year: 2013

It is a challenge to transform legacy XML-based data into ontology for applications of the semantic web, such as semantic-based integrations, intelligent web searching, and internet based knowledge reasoning. We propose a new technique to transform XML data into ontology data automatically by modeling XML documents semantically. Firstly, we provide the XML a semantically interpretation by developing a graph-based formal language, w-graph. Then, the result of the interpretation can be automatically mapped into OWL web ontology language with semantics preserved. The proof of semantics preserved also been considered, and automatic mapping tool has been developed. © (2013) Trans Tech Publications, Switzerland. Source


Yang H.,Chinese Academy of Sciences | Wu J.,Guangxi University for Nationalities | Wu J.,Beijing Jiaotong University | Wu J.,Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis | Zhang Z.,Chinese Academy of Sciences
International Journal of Advancements in Computing Technology | Year: 2012

In terms of completed trace equivalence of labeled transition systems, it is inefficient to eliminate states. This paper proposed the approximate completed trace equivalence of inhomogeneous linear transition systems. In order to extend the system actions, inhomogeneous linear polynomial programs are applied to describe system actions. Then the completed trace equivalence of inhomogeneous linear transition systems is established. Subsequently, it proposed the theory and algorithm of approximate completed trace equivalence of inhomogeneous linear transition systems. Under certain conditions, the approximate completed trace equivalence can eliminate states efficiently. Finally, above view is verified by a simple spreading model of E-mail viruses. Source


Liu X.,Guangxi University for Nationalities | Liu X.,Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis | Zhu G.,Guangxi University for Nationalities | Zhou G.,Guangxi University for Nationalities | Yu Y.,Monash University
Mathematical Problems in Engineering | Year: 2012

We investigate the determinantal representation by exploiting the limiting expression for the generalized inverse A T,S (2). We show the equivalent relationship between the existence and limiting expression of A T,S (2) and some limiting processes of matrices and deduce the new determinantal representations of A T,S (2), based on some analog of the classical adjoint matrix. Using the analog of the classical adjoint matrix, we present Cramer rules for the restricted matrix equation AXB = D,R(X)⊂T,N(X)⊃S̃. © 2012 Xiaoji Liu et al. Source


Liao Y.-M.,Guangxi University for Nationalities | Zhou P.,Guangxi University for Nationalities | Zhou P.,Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis | Qin X.-C.,Guangxi University for Nationalities | He Y.-H.,Guangxi University for Nationalities
Quantum Information Processing | Year: 2014

In this paper, we present a possible improvement of the successful probability of joint remote state preparation via cluster states following some ideals from probabilistic joint remote state preparation (Wang et al. in Opt Commun, 284:5835, 2011). The success probability can be improved from 1/4 to 1 via the same quantum entangled channel by adding some classical information and performing some unitary operations. Moreover, we also discussed the scheme for joint remote preparation via cluster-type states. Compared with other schemes, our schemes have the advantage of having high successful probability for joint preparation of an arbitrary two-qubit state via cluster states and cluster-type states. © 2013 Springer Science+Business Media New York. Source


Li Z.,Guangxi University for Nationalities | Li Z.,Guangxi Key Laboratory of Hybrid Computational and IC Design Analysis | Xie N.,Guangxi University for Nationalities | Wen G.,Guangxi University for Nationalities
Applied Soft Computing Journal | Year: 2015

Soft set theory is a new mathematical tool to deal with uncertain information. This paper studies soft coverings and their parameter reductions. Firstly, we define a soft set on the power set of an initial universe and discuss its properties. Secondly, we introduce soft coverings and obtain the lattice structure of soft sets induced by them. Thirdly, we investigate parameter reductions of a soft covering by means of attribute reductions in a covering information system and present their algorithm. Finally, we give an application to show the usefulness of parameter reductions of a soft covering. © 2015 Elsevier B.V. All rights reserved. Source

Discover hidden collaborations