Information technology (IT) outsourcing has been recognized as a new methodology in many organizations. Yet making an appropriate decision with regard to selection and use of these methodologies may impose uncertainties and risks. Estimating the occurrence probability of risks and their impacts organizations goals may reduce their threats. In this study, an extended analytical hierarchical proc...

the reciprocal degree distance (rdd)‎, ‎defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances‎, ‎that is‎, ‎$rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u)‎ + ‎d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index‎, ‎just as the degree distance is a weight version of the wiener index‎. ‎in this paper‎, ‎we present exact formu...

1. According to the preference-performance hypothesis, female insects select resources that maximize offspring performance. To achieve high fitness, leaf miner females should then adjust their oviposition behaviour in response to leaf attributes signalling high host quality. 2. Here we investigate resource selection in Tischeria ekebladella, a leaf-mining moth of the pedunculate oak (Quercus ro...

K nearest neighbor algorithm is one of the most frequently used techniques in data mining for its integrity and performance. Though the KNN algorithm is highly effective in many cases, it has some essential deficiencies, which affects the classification accuracy of the algorithm. First, the effectiveness of the algorithm is affected by redundant and irrelevant features. Furthermore, this algori...

the reverse degree distance of a connected graph $g$ is defined in discrete mathematical chemistry as [ r (g)=2(n-1)md-sum_{uin v(g)}d_g(u)d_g(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $g$, respectively, $d_g(u)$ is the degree of vertex $u$, $d_g(u)$ is the sum of distance between vertex $u$ and all other vertices of $g$, and $v(g)$ is the ...

in this paper, we determine the degree distance of the complement of arbitrary mycielskian graphs. it is well known that almost all graphs have diameter two. we determine this graphical invariant for the mycielskian of graphs with diameter two.

Kano’s model of satisfaction leads to a typology of product attributes to distinguish between those contributing solely to consumer satisfaction, those contributing only to consumer dissatisfaction and those which contribute to both satisfaction and dissatisfaction. In line with this model, we propose a new preference mapping (PrefMap) methodology called adaptive preference target (APT). To exp...

The aim of this work is to integrate the ideas of flexibility and uncertainty into Allen’s interval-based temporal logic [1], defining a new formalism (IA) which extends classical Interval Algebra (IA). We refer to Dubois, Fargier & Prade approach to Fuzzy Constraint Satisfaction Problem (FCSP ) [3], in which constraints are satisfied to a degree; this framework is based on Fuzzy Sets and Possi...