Fundamenta Informaticae - Volume 141, issue 1

Authors: Cattaneo, Gianpiero | Chiaselotti, Giampiero | Gentile, Tommaso | Oliverio, Paolo A.

Article Type: Research Article

Abstract: Signed partitions are used in order to describe a new discrete dynamical model whose configurations have fixed sum and whose evolution rules act in balancing from left and right on the configurations of the system. The resulting model can be considered as an extension to the case of signed partitions of the discrete dynamical system introduced by Brylawski in his classical paper concerning the dominance order of integer partitions. We provide a possible interpretation of our model as a simplified description of p – n junction between two semiconductors. We also show as our model can be embedded …in a specific Brylawski dynamical system by means of the introduction of a new evolution rule. Show more

Keywords: Discrete Dynamical Systems, Integer Partitions, Lattices, Evolution Rules

DOI: 10.3233/FI-2015-1261

Citation: Fundamenta Informaticae, vol. 141, no. 1, pp. 1-36, 2015

Authors: Kumar, Arun | Banerjee, Mohua

Article Type: Research Article

Abstract: A pair of approximation operators, based on the notion of granules in generalized approximation spaces, was studied in an earlier work by the authors. In this article, we investigate algebraic structures formed by the definable sets and also by the rough sets determined by this pair of approximation operators. The definable sets are open sets of an Alexandrov topological space, and form a completely distributive lattice in which the set of completely join irreducible elements is join dense. The collection of rough sets also forms a similar structure. Representation results for such classes of completely distributive lattices as well as …Heyting algebras in terms of definable and rough sets are obtained. Further, two unary operators on rough sets are considered, making the latter constitute a structure that is named a ‘rough lattice’. Representation results for rough lattices are proved. Show more

Keywords: Granules, Approximation operators, Definable sets, Rough Sets, Completely distributive lattices, Heyting algebras

DOI: 10.3233/FI-2015-1262

Citation: Fundamenta Informaticae, vol. 141, no. 1, pp. 37-55, 2015

Authors: Kuziak, Dorota | Yero, Ismael G. | Rodríguez-Velázquez, Juan A.

Article Type: Research Article

Abstract: A vertex w of a connected graph G strongly resolves two vertices u , v ∈ V (G ), if there exists some shortest u – w path containing v or some shortest v – w path containing u . A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S . The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G . …In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the strong metric dimension, clique number or twins-free clique number of its factor graphs. Show more

Keywords: Strong metric dimension, strong metric basis, strong metric generator, Cartesian sum graphs

DOI: 10.3233/FI-2015-1263

Citation: Fundamenta Informaticae, vol. 141, no. 1, pp. 57-69, 2015

Authors: Peng, Xindong | Yang, Yong

Article Type: Research Article

Abstract: The soft set theory can be used as a newly mathematical tool to handle uncertainty. However, the classical soft sets are not appropriate to deal with imprecise and fuzzy parameters. In this paper, we propose the interval-valued hesitant fuzzy soft sets which are a combination of the interval-valued hesitant fuzzy sets and soft sets. Then, the complement, AND, OR, union, intersection, restricted union, extended intersection, difference, average, and geometric operations are defined on the interval-valued hesitant fuzzy soft sets, and some basic properties are also discussed in detail. Finally, by means of TOPSIS (Technique for Order Preference by Similarity to …Ideal Solution) and the maximizing deviation method, an algorithm is presented, and a comprehensive sensitivity analysis is employed, and the effectiveness is proved by a numerical example. Show more

Keywords: Interval-valued hesitant fuzzy soft sets, interval-valued hesitant fuzzy sets, TOPSIS, maximizing deviation

DOI: 10.3233/FI-2015-1264

Citation: Fundamenta Informaticae, vol. 141, no. 1, pp. 71-93, 2015

Authors: Shao, Zuhua | Gao, Yipeng

Article Type: Research Article

Abstract: This paper proposes the first optimistic protocol to accomplish the fair exchange of standard Schnorr signatures in the chosen-key model, in which each participant is allowed to choose his Schnorr key pair freely without showing his knowledge of the private key. Besides solving the authentication problem of public keys, the protocol relaxes excessive trust on the adjudicator since the adjudicator needs to be trusted only by the signer. The protocol is secure against three types of inside adversaries under the DL assumption in the random oracle model. It suits much more the actual circumstances of the Internet.

Keywords: Fair exchange protocol, Schnorr signatures, Certificate-based, Chosen-key model

DOI: 10.3233/FI-2015-1265

Citation: Fundamenta Informaticae, vol. 141, no. 1, pp. 95-114, 2015