Fundamenta Informaticae - Volume 135, issue 3

Authors: Ghasemi, Mohsen

Article Type: Research Article

Abstract: A finite graph is one-regular if its automorphism group acts regularly on the set of its arcs. In the present paper, tetravalent one-regular graphs of order 7p2 , where p is a prime, are classified using computer algebra tools.

Keywords: s-transitive graphs, symmetric graphs, Cayley graphs, magma, combinatorial algorithms

DOI: 10.3233/FI-2014-1119

Citation: Fundamenta Informaticae, vol. 135, no. 3, pp. 211-228, 2014

Authors: Kostanyan, Armen | Khnkoyan, Paruyr

Article Type: Research Article

Abstract: Computations in Boolean algebra extended by adding an undefined element are investigated in the present paper. These computations (also known as approximative computations) are based on Lukasiewicz three-valued logic and are widely used in those applications where it is necessary to perform logical operations under uncertainty. The approximative computations are carried out as follows: if all instantiations of undefined operands produce the same result then this ascertained result is taken as final; otherwise, the final result is defined to be unknown. The key question in theory of approximative computations is whether a given Boolean formula is closed in the sense …that the stepwise approximative computations in compliance with a given formula produce a result as accurate as possible. This question is investigated for the classes of disjunctive and algebraic normal forms. Show more

Keywords: Lukasiewicz three-valued logic, Boolean algebra, approximative computations

DOI: 10.3233/FI-2014-1120

Citation: Fundamenta Informaticae, vol. 135, no. 3, pp. 229-241, 2014

Authors: Niu, Pan-pan | Wang, Xiang-yang | Yang, Hong-ying | Wang, Pei | Wang, Ai-long

Article Type: Research Article

Abstract: Geometric distortions that cause displacement between embedding and detection are usually difficult for watermark to survive. It is a challenging work to design a robust image watermarking scheme against geometric distortions, especially for local geometric distortions. Based on probability density and complex angular radial transform theory, a new image watermarking algorithm robust to geometric distortions is proposed in this paper. We firstly extract the steady image feature points by using new image feature point detector, which is based on the probability density. Then we build the affine invariant local feature regions based on probability density auto-correlation matrix. And finally, we …present a new image watermarking algorithm robust to geometric distortions, in which the digital watermark is embedded into the local complex angular radial transform (CART) coefficients. Experiments results show that the proposed image watermarking is not only invisible and robust against common image processing operations, but also robust against the geometric distortions. Show more

Keywords: Image watermarking, geometric distortions, probability density, complex angular radial transform

DOI: 10.3233/FI-2014-1121

Citation: Fundamenta Informaticae, vol. 135, no. 3, pp. 243-268, 2014

Authors: Pan, Haiyu | Zhang, Min | Wu, Hengyang | Chen, Yixiang

Article Type: Research Article

Abstract: To model and analyze systems with multi-valued information, in this paper, we present an extension of Kripke structures in the framework of complete residuted lattices, which we will refer to as lattice-valued Kripke structures (LKSs). We then show how the traditional trace containment and equivalence relations, can be lifted to the lattice-valued setting, and we introduce two families of lattice-valued versions of the relations. Further, we explore some interesting properties of these relations. Finally, we provide logical characterizations of our relations by a natural extension of linear temporal logic.

Keywords: Kripke Structure, Trace Semantics, Linear Temporal Logic, Residuated Lattice, Heyting Algebra

DOI: 10.3233/FI-2014-1122

Citation: Fundamenta Informaticae, vol. 135, no. 3, pp. 269-293, 2014

Authors: Surynek, Pavel | Surynková, Petra | Chromý, Miloš

Article Type: Research Article

Abstract: This paper proposes a framework for analyzing algorithms for inductive processing of bi-connected graphs. The BIBOX algorithm for solving cooperative path-finding problems over bi-connected graphs is submitted for the suggested analysis. The algorithm proceeds according to a decomposition of a given bi-connected graph into handles. After finishing a handle, the handle is ruled out of consideration and the processing task is reduced to a task of the same type on a smaller graph. The handle decomposition for which the BIBOX algorithm performs best is theoretically identified. The conducted experimental evaluation confirms that the suggested theoretical analysis well corresponds to the …real situation. Show more

Keywords: BIBOX algorithm, bi-connected graphs, cooperative path-finding, complexity

DOI: 10.3233/FI-2014-1123

Citation: Fundamenta Informaticae, vol. 135, no. 3, pp. 295-308, 2014

Authors: Wang, Xiang-Yang | Li, Yong-Wei | Niu, Pan-Pan | Yang, Hong-Ying | Li, Dong-Ming

Article Type: Research Article

Abstract: One of the challenges in the development of a content-based image indexing and retrieval application is to achieve an efficient and robust indexing scheme. Color is a fundamental image feature used in content-based image retrieval (CBIR) systems. This paper proposes a robust and effective image retrieval scheme, which is based on the weighed color histogram of visual attention points. Firstly, the fully affine invariant visual attention points are extracted from the origin color image by using the Affine-SIFT (scale-invariant feature transform) detector. Secondly, according to the color complexity measure (CCM) theory, the visual weight values for the significant visual attention …points are calculated to reflect the image local variation. Then, the weighed color histogram of visual attention points is constructed. Finally, the similarity between color images is computed by using the weighed color histogram of visual attention points. Experimental results show that the proposed image retrieval is not only more accurate and efficient in retrieving the user-interested images, but also yields higher retrieval accuracy than some state-of-the-art image retrieval schemes for various test DBs. Show more

Keywords: Image retrieval, visual attention points, Affine-SIFT, weighed color histogram

DOI: 10.3233/FI-2014-1124

Citation: Fundamenta Informaticae, vol. 135, no. 3, pp. 309-329, 2014

Authors: Zhu, Ping | Xie, Huiyang | Wen, Qiaoyan

Article Type: Research Article

Abstract: In recent years, homomorphisms have been exploited to compare the structures and properties of two generalized information systems. Some of these homomorphisms are based on consistent functions, which are a class of special mappings between universal sets. The purpose of this paper is to unify and extend the consistent functions in the literature into the framework of neighborhood systems. After introducing the notion of consistent functions with respect to neighborhood systems, we explore some important properties of the extended consistent functions such as preserving the inverse images and the intersections of neighborhoods. Our results provide a sound basis for further …investigating neighborhood systems via homomorphisms. Show more

Keywords: Consistent function, rough set, granular computing, neighborhood system, homomorphism

DOI: 10.3233/FI-2014-1125

Citation: Fundamenta Informaticae, vol. 135, no. 3, pp. 331-340, 2014