Wyniki wyszukiwania - BazTech

1

Rough Set Theory and Digraphs

Chiaselotti G., Ciucci D., Gentile T., Infusino F.

Fundamenta Informaticae

|

2017

|

Vol. 153, nr 4

291--325

EN

In this paper we apply rough set theory to information tables induced from finite directed graphs without loops and multiples arcs (digraphs). Specifically, we use the adjacency matrix of a digraph as a particular type of information table. In this way, we are able to explore on digraphs the notions of indiscernibility partitions, lower and upper approximations, generalized core, reducts and discernibility matrix. All these ideas will be exemplified on standard digraph families as well on examples from social networks and patterns of flight routes between airports.

2

Generalizations of Rough Set Tools Inspired by Graph Theory

Chiaselotti G., Ciucci D., Gentile T., Infusino F.

Fundamenta Informaticae

|

2016

|

Vol. 148, nr 1/2

207--227

EN

We introduce and study new generalizations of some rough set tools. Namely, the extended core, the generalized discernibility function, the discernibility space and the maximum partitioner. All these concepts where firstly introduced during the application of rough set theory to graphs, here we show that they have an interesting and useful interpretation also in the general setting. Indeed, among other results, we prove that reducts can be computed in incremental polynomial time, we give some conditions in order that a partition coincides with an indiscernibility partition of a given information table and we give the conditions such that a discernibility matrix corresponds to an information table.

3

The Lattice Structure of Equally Extended Signed Partitions : A generalization of the Brylawski approach to integer partitions with a p-n junction between two semiconductors model

Cattaneo G., Chiaselotti G., Gentile T., Oliverio P. A.

Fundamenta Informaticae

|

2015

|

Vol. 141, nr 1

1--36

EN

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.