A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...

Credit scoring analysis is an important activity, especially nowadays after a huge number of defaults has been one of the main causes of the financial crisis. Among the many different tools used to model credit risk, the recent development of rough set models has proved effective. The original development of rough set theory has been widely generalized and combined with other approaches to unce...

Nowadays, decision making using fuzzy logic is a major research area for scientists, researchers and project managers. Construction of membership functions and fuzzy rules from numerical data is very important in various applications of the fuzzy set theory. Therefore, in this paper a model is proposed for development of membership functions and fuzzy rules from numerical data for decision maki...

In this paper the identification of SISO Wiener models in presence of bounded output noise is considered. A three stage procedure based on the inner signal estimation, outlined in a previous contribution, has been proposed. Results and algorithms for the computation of inner-signal bounds through the design of a suitable input sequence have been provided for the case of polynomial without inver...

This paper proposes a new adaptive algorithm for the implementation of the linearly constrained minimum variance (LCMV) beamformer. The proposed algorithm utilizes the setmembership filtering (SMF) framework and the reduced-rank joint iterative optimization (JIO) scheme. We develop a stochastic gradient (SG) based algorithm for the beamformer design. An effective time-varying bound is employed ...

In this thesis, we develop a cryptographic primitive: a solution to the secure set membership problem. The secure set membership problem is the problem of creating a set representation so that it is possible to verify that a string is a member of the set without being able to learn members of the set from the representation. The secure set membership primitive includes a distributed protocol fo...

In this note we address the problems of obtaining guaranteed and as good as possible estimates of system parameters for linear discrete–time systems subject to bounded disturbances. Some existing results relevant for the set–membership parameter identification and outer–bounding are first reviewed. Then, a novel method for characterizing the consistent parameter set based on homothety is offere...