A graph G is called randomly H − decomposable if every maximal H − packing in G uses all edges in G. G is called H − equipackable if every maximal H − packing in G is also a maximum H − packing in G. M2 − decomposable graphs, randomly M2 − decomposable graphs and M2 − equipackable graphs have been characterized. The definitions could be generalized to multigraphs. And M2 − decomposable multigra...

Integral inequalities play critical roles in measure theory and probability theory. Given recent profound discoveries in the field of fuzzy set theory, fuzzy inequality has become a hot research topic in recent years. For classical Sandor type inequality, this paper intends to extend the Sugeno integral. Based on the (s,m)-convex function in the second sense, a new Sandor type inequality is pro...

In this paper, we present a revised similarity measure based onChen-and-Chen's similarity measure for fuzzy risk analysis. The revisedsimilarity measure uses the corrected formulae to calculate the centre ofgravity points, therefore it is more  effective than the Chen-and-Chen'smethod. The revised similarity measure can overcome the drawbacks of theexisting methods. We have also proposed a new ...

This paper studies by means of reciprocal fuzzy binary relations the aggregation of preferences when individuals show their preferences gradually. We have characterized neutral aggregation rules through functions from powers of the unit interval in the unit interval. Furthermore, we have determined the neutral aggregation rules that are decomposable and anonymous. In this class of rules, the co...

Keywords: Fuzzy measure Sugeno integral Choquet integral Stolarsky's inequality a b s t r a c t Recently Flores-Franulič, Román-Flores and Chalco-Cano proved the Stolarsky type inequality for Sugeno integral with respect to the Lebesgue measure k. The present paper is devoted to generalize this result by relaxing some of its requirements. Moreover, Stolar-sky inequality for Choquet integral is ...

Let n, r be integers with 0 ≤ r ≤ n− 1. An n×n matrix A is called r-partly decomposable if it contains a k×l zero submatrix with k+l = n−r+1. A matrix which is not r-partly decomposable is called r-indecomposable (shortly, r-inde). Let Eij be the n × n matrix with a 1 in the (i, j) position and 0’s elsewhere. If A is r-indecomposable and, for each aij 6= 0, the matrix ∗Research supported by Nat...

Describing and modeling a complex system is very hard and time consuming, so, we propose to use a linguistic approach introduced by Zadeh. By taking a linguistic approach we can use linguistic variables and approximate rules to characterize approximately phenomenons which are too complex or too ill-defined to be done in numerical terms. Starting from the results obtained in our previous works, ...

In the last few years, the coevolutionary paradigm has shown an increasing interest thanks to its high ability to manage huge search spaces. Particularly, the cooperative interaction scheme is recommendable when the problem solution may be decomposable in subcomponents and there are strong interdependencies among them. The paper introduces a novel application of these algorithms to the learning...

In this paper, we introduce the 1− K robotic-cell scheduling problem, whose solution can be reduced to solving a TSP on specially structured permuted Monge matrices, we call b-decomposable matrices. We also review a number of other scheduling problems which all reduce to solving TSP-s on permuted Monge matrices. We present the important insight that the TSP on b-decomposable matrices can be sol...