Approximate querying between heterogeneous ontologies based on association matrix

An approximate approach of querying between heterogeneous ontology-basedinformation systems based on an association matrix is proposed. First, the association matrix isdefined to describe relations between concepts in two ontologies. Then, a methodof rewriting queriesbased on the association matrix is presented to solve the ontology heterogeneity problem. Itrewrites the queries in one ontology to approximate queries in another ontology based on thesubsumption relations between concepts. The method also uses vectors to represent queries, and thencomputes the vectors with the association matrix; the disjoint relations between concepts can beconsidered by the results. It can get better approximations than the methods currently in use, whichdonot consider disjoint relations. The method can be processed by machines automatically. It issimple to implement and expected to run quite fast.

Query Through Heterogeneous Ontologies Using Association Matrix

This paper introduces the definition and calculation of the association matrix between ontologies. It uses the association matrix to describe the relations between concepts in different ontologies and uses concept vectors to represent queries; then computes the vectors with the association matrix in order to rewrite queries. This paper proposes a simple method of querying through heterogeneous Ontology using association matrix. This method is based on the correctness of approximate information filtering theory; and it is simple to be implemented and expected to run quite fast. Key words semantic Web - information retrieval - ontology - query - association matrix CLC number TP 391 Foundation item: Supported by the National Natural Science Foundation of China (60373066, 60303024), National Grand Fundamental Research 973 Program of China (2002CB312000) and National Research Foundation for the Doctoral Program of Higher Education of China (20020286004)Biography: KANG Da-zhou (1980-), male, Master candidate, research direction: Semantic Web, knowledge representation on the Web.

Cryptotanshinone attenuates isoprenaline-induced cardiac fibrosis in the mouse associated with upregulation and activation of matrix metalloproteinase-2

Objectives The impairment of matrix metallopro- teinase-2(MMP-2)has been associated with the development of cardiac fibrosis.Although the Chinese herb Salvia miltior-rhiza has been widely used in patients with cardiovascular disorders,the mechanisms involved have not been elucidated. The purpose of the present study was to determine whether the administration of cryptotanshinone,an active ingredient of Salvia miltiorrhiza,could prevent the cardiac fibrosis induced by isoprenaline and to investigate the underlying mechanisms. Methods and Results Male C57BL/6 mice were submitted to receive daily injection of 0.9%saline,3 mg/kg isoprenaline, or isoprenaline plus 20 mg/kg cryptotanshinone by gastric gavage for 2 weeks.Herein,we demonstrate that cryptotanshinone can significantly ameliorate the isoprenaline-induced cardiac fibrosis,which was associated with marked up-regulation and activation of MMP-2 in ventricular myocardium. Additionally,we demonstrate that cryptotanshinone can dose-dependently upregulate and activate MMP-2 in cultured cardiac fibroblast.Moreover,incubation with cryptotanshinone also can prevent isoprenaline-induced downregulation and inactivation of MMP-2 in cultured cardiac fibroblast. Conclusions Taken together,our data suggest that cryptotanshinone may become a novel and potent antifibrotic agent. The present findings might further our understanding of the role of MMP-2 in cardiac fibrosis and antifibrotic mechanisms of cryptotanshinone.

On Factorization of N-Qubit Pure States and Complete Entanglement Analysis of 3-Qubit Pure States Containing Exactly Two Terms and Three Terms

A multi-qubit pure quantum state is called separable when it can be factored as the tensor product of 1-qubit pure quantum states.Factorizing a general multi-qubit pure quantum state into the tensor product of its factors(pure states containing a smaller number of qubits)can be a challenging task,especially for highly entangled states.A new criterion based on the proportionality of the rows of certain associated matrices for the existence of certain factorization and a factorization algorithm that follows from this criterion for systematically extracting all the factors is developed in this paper.3-qubit pure states play a crucial role in quantum computing and quantum information processing.For various applications,the well-known 3-qubit GHZ state which contains two nonzero terms,and the 3-qubit W state which contains three nonzero terms,have been studied extensively.Using the new factorization algorithm developed here we perform a complete analysis vis-à-vis entanglement of 3-qubit states that contain exactly two nonzero terms and exactly three nonzero terms.

The Assodated Matrices of Ap, n, 4p-5 Polyhedra and their Admissible Onerations

In this paper we describe the decomposition problem of a special kind of Ap,n,4p-5 polyhedra by using the associated matrices and their admissible operations.