13400473
Isometric path numbers of graphs
An isometric path between two vertices in a graph G is a shortest path joining them. The isometric path number of G, denoted by ip(G), is the minimum number of isometric paths needed to cover all vertices of G. In this paper, we determine exact values of isometric path numbers of complete r-partite graphs and Cartesian products of 2 or 3 complete graphs.
911431
Isometric-path numbers of block graphs
An isometric path between two vertices in a graph G is a shortest path joining them. The isometric-path number of G, denoted by ip(G), is the minimum number of isometric paths required to cover all vertices of G. In this paper, we determine exact values of isometric-path numbers of block graphs. We also give a linear-time algorithm for finding the corresponding paths.
33206794
Multipurpose image watermarking in DCT domain using subsampling
In this paper, a DCT-based multipurpose image watermarking algorithm is proposed. Through adopting dither modulation in subimages gained by subsampling, two independent robust watermarks can be embedded in the original image. Experimental results demonstrate the effectiveness of the proposed algorithm.
1422959
Reasoning Support for OWL-E
Syntax DL Syntax Semantics domain(u1, . . . , un) (u1, . . . , un) u D 1 × . . .× un
40837902
VQ image coding using sub-vector techniques
A fast codeword search algorithm for vector quantization is presented. Three inequalities based on the characteristics of sums and variances of a vector and its two sub-vectors are introduced to reject a larger number of codewords. Simulation results demonstrate the effectiveness of the proposed algorithm.
13419311
Metamodeling Architecture of Web Ontology Languages
Recent research has shown that RDF Schema, as a schema layer Semantic Web language, has a non-standard metamodeling architecture. As a result, it is difficult to understand and lacks clear semantics. This paper proposes a fixed layer metamodeling architecture for RDF Schema (RDFS(FA)) and demonstrates how the problems of RDF Schema can be solved under RDFS(FA). Based on this metamodeling architecture, a clear model-theoretic semantics of RDFS(FA) is given. Interestingly, RDFS(FA) also benefits DAML+OIL by offering a firm semantic basis and by solving the "layer mistake" problem.
64651174
Optimization of HMM by the Tabu Search Algorithm