Abstract. In this paper, the researchers proposed a modified new weighted area method to rank fuzzy numbers using the area of trapezium. We also use some comparative examples to illustrate the advantage of the proposed method with the existing metric index ranking methods. If the comparison for negative numbers is not possible, we are using the comparison based on spread and weight. The process...

Positively weighted graphs have a natural intrinsic metric. We consider finite, positively weighted graphs with a positive lower bound for their minimal weights and show that any two such graphs, which are close enough with respect to the Gromov-Hausdorff metric, are equivalent as graphs.

In this project the image segmentation using Fuzzy Cmeans algorithm and kernel metric. In FCM algorithm by introducing a trade-off weighted fuzzy factor and kernel metric. This factor depends on the space distance of all neighboring pixels and their gray-level difference simultaneously. So we propose generalised rough set FCM algorithm in order to further enhance its robustness to noise and out...

This document presents software product metrics we usually use to build software defect prediction models. 1 Software product metrics This document presents software product metrics we usually use to build software defect prediction models, especially those built by Madeyski and Jureczko [6, 5, 4]. • The metrics suite suggested by Chidamber and Kemerer [2]: Weighted Methods per Class (WMC). The...

In the stochastic online scheduling environment, jobs with unknown release times and weights arrive over time. Upon arrival, the information on the weight of the job is revealed but the processing requirement remains unknown until the job is finished. With the objective of minimizing the total weighted completion time, various asymptotically optimal algorithms have been proposed for the online ...

A measure is derived to quantify directed information transfer between pairs of vertices in a weighted network, over paths of a specified maximal length. Our approach employs a general, probabilistic model of network traffic, from which the informational distance between dynamics on two weighted networks can be naturally expressed as a Jensen Shannon divergence. Our network transfer entropy mea...