In this study a new approach to rank exponential fuzzy numbers using  -cuts is established. The metric distance of the interval numbers is extended to exponential fuzzy numbers. By using the ranking of exponential fuzzy numbers and using  -cuts the critical path of a project network is solved and illustrated by numerical examples. Keywords: Exponential Fuzzy Numbers,  -cuts, Metric Dista...

In this paper we propose a new distance function (rank distance) designed to reflect stylistic similarity between texts. To assess the ability of this distance measure to capture stylistic similarity between texts, we tested it in two different machine learning settings: clustering and binary classification.

In this paper we propose two methods to produce block codes of prescribed rank or distance. Following [4, 5] we work with skew polynomial rings of automorphism type and the codes we investigate are ideals in quotients of this ring. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section. 1 Galois theory of di...

Rank metric codes can either be used as such for error correction in data storage equipments, or be lifted into constant-dimension codes (CDCs) and thus be used for error correction in random network coding. This paper investigates the decoder error probability (DEP) of rank metric codes and CDCs. We first study the DEP of rank metric codes using a bounded rank distance decoder. We derive asymp...

In the companion paper [Linear rank-width of distance-hereditary graphs I. A polynomialtime algorithm, Algorithmica 78(1):342–377, 2017], we presented a characterization of the linear rank-width of distance-hereditary graphs, from which we derived an algorithm to compute it in polynomial time. In this paper, we investigate structural properties of distance-hereditary graphs based on this charac...

We present a characterization of the linear rank-width of distancehereditary graphs. Using the characterization, we show that the linear rankwidth of every n-vertex distance-hereditary graph can be computed in time O(n · log(n)), and a linear layout witnessing the linear rank-width can be computed with the same time complexity. For our characterization, we combine modifications of canonical spl...

Y. Huang acknowledges partial support from a UCF Graduate College Presidential Fellowship and National Science Foundation (NS F) grant No. 1200566. C. Li acknowledges partial support from NSF grants No. 0806931 and No. 0963146. M. Georgiopoulos acknowledges partial support from NSF grants No. 1161228 and No. 0525429. G. G. Anagnostopoulos acknowledges partial support from NSF grant No. 1263011....