Syed Muhammad Husnine

Robot selection by using generalized interval-valued fuzzy numbers with TOPSIS

Abstract The aim of this paper is to propose a method to aggregate the opinion of several decision makers on different criteria, regarding a set of alternatives, where the judgment of the decision makers are represented by generalized interval-valued trapezoidal fuzzy numbers. A generalized interval valued trapezoidal fuzzy number based technique for order preference by similarity to ideal solution is proposed that can reflect subjective judgment and objective information in real life. The weights of criteria and performance rating values of criteria are linguistic variables expressed as generalized interval-valued trapezoidal fuzzy numbers. Finally, an illustrative example is provided to elaborate the proposed method for the selection of a suitable robot according to our requirements.

Generating bracelets with fixed content

We present an algorithm to generate bracelets with fixed content. An analysis shows that the algorithm runs in constant amortized time. The algorithm can be applied to efficiently list all non-isomorphic unicyclic graphs with n vertices.

Multicriteria Group Decision Making by Using Trapezoidal Valued Hesitant Fuzzy Sets

The concept of trapezoidal valued hesitant fuzzy set is introduced. Notion for distance between any two trapezoidal valued hesitant fuzzy elements is given. Using this proposed distance measure, we extend the technique for order preference by similarity to ideal solution for trapezoidal valued hesitant fuzzy sets. An example is constructed to show usefulness of this extension for multicriteria group decision making, where the opinions about the criteria values are expressed as trapezoidal valued hesitant fuzzy set.

Generating fixed density bracelets of arbitrary base

Bracelets are lexicographically minimal k-ary strings symmetric under rotation and reversal. In this paper, we present an algorithm for lexicographic listing of bracelets with fixed density. Our algorithm works for arbitrarily large alphabet size and each successive bracelet is generated in constant amortized time.

Fuzzy Transitivity and Monotonicity of Cardinality-based Similarity Measures

The interrelationship of notions is presented in fuzzy transitivity and monotonicity of fuzzy similarity measures. It is observed that the axiom of fuzzy transitivity may replace that of monotonicity in the definition of fuzzy similarity measures.

Linear-time algorithm for generating c-isolated bicliques

ABSTRACT Bicliques are widely used to solve various real-world problems encountered in bio-informatics, data mining and networks. We consider c-isolated bicliques, a variation of bicliques. The c-isolated bicliques can model communities in social and biological networks. We propose an efficient algorithm to generate all c-isolated maximal bicliques in a given bipartite graph. Our algorithm exploits underlying properties of an isolated biclique to trim the input graph. Furthermore, the algorithm deploys the vertex cover enumeration algorithm based on fixed parameter tractability and lists all maximal c-isolated bicliques in linear time (in terms of graph size), for constant c.

On fast enumeration of pseudo bicliques

Pseudo bicliques relax the rigid connectivity requirement of bicliques to effectively deal with missing data. In this paper, we propose an algorithm based on reverse search to generate all pseudo bicliques in a given graph. We introduce various enhancements to our algorithm based on the structure of pseudo bicliques and underlying bipartite graph. We perform composite analysis using theoretical bounds and computational experiments, to show that these improvements significantly reduce the running time of our algorithm. Our algorithm is optimal in the sense that it takes average linear time to generate each pseudo biclique.