The mutation method assesses test quality by examining the ability of a test set to distinguish syntactic deviations representing specific types of faults from the program under test. This paper describes an empirical study performed to evaluate the effectiveness of object-oriented (OO) test strategies using the mutation method. The test sets for the experimental system are generated according ...

Ž . In this article we compare two contrasting methods, active set method ASM and genetic algorithms, for learning the weights in aggregation operators, such as weighted mean Ž . Ž . WM , ordered weighted average OWA , and weighted ordered weighted average Ž . WOWA . We give the formal definitions for each of the aggregation operators, explain the two learning methods, give results of processin...

In almost every work on fuzzy sets, the existence of membership functions taking part in the considered model is assumed and it is not studied in depth whether or not such functions exist. On the other hand, generally the relationship between a certain studied characteristic and its referential set is not problematic since it is usually a matter of direct measurement. However, in a great variet...

Let H and G be graph classes. We say that H has the Erd”os–Pósa property for G if for any graph G∈G, the minimum vertex covering of all H-subgraphs of G is bounded by a function f of the maximum packing of H-subgraphs in G (by H-subgraph of G we mean any subgraph of G that belongs to H). Robertson and Seymour [J Combin Theory Ser B 41 (1986), 92–114] proved that if H is the class of all graphs ...

Recent developments of sensors and computers have raised the problem of handling huge amounts of complex data that users try to synthesize for decision making. Aggregation operators, such as those appearing in fuzzy sets theory, are useful tools for this synthesis but in their present formulation, these operators only deal with a finite set of arguments. In this paper, we introduce G3 , an exte...

A Roman dominating function (RDF) on a digraph $D$ is a function $f: V(D)rightarrow {0,1,2}$ satisfying the condition that every vertex $v$ with $f(v)=0$ has an in-neighbor $u$ with $f(u)=2$. The weight of an RDF $f$ is the value $sum_{vin V(D)}f(v)$. The Roman domination number of a digraph $D$ is the minimum weight of an RDF on $D$. A set ${f_1,f_2,dots,f_d}$ of Roman dominating functions on ...

The Wiener index of a graph Gis defined as W(G) =1/2[Sum(d(i,j)] over all pair of elements of V(G), where V (G) is the set of vertices of G and d(i, j) is the distance between vertices i and j. In this paper, we give an algorithm by GAP program that can be compute the Wiener index for any graph also we compute the Wiener index of HAC5C7[p, q] and HAC5C6C7[p, q] nanotubes by this program.

for a simple digraph $g$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $g$, respectively. let$d^+(g)=diag(d_1^+,d_2^+,ldots,d_n^+)$ and$d^-(g)=diag(d_1^-,d_2^-,ldots,d_n^-)$. in this paper we introduce$widetilde{sl}(g)=widetilde{d}(g)-s(g)$ to be a new kind of skewlaplacian matrix of $g$, where $widetilde{d}(g...

this paper is concerned with the best proximity pair problem in hilbert spaces. given two subsets $a$ and $b$ of a hilbert space $h$ and the set-valued maps $f:a o 2^ b$ and $g:a_0 o 2^{a_0}$, where $a_0={xin a: |x-y|=d(a,b)~~~mbox{for some}~~~ yin b}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in a$ such that $$d(g(x_0),f(x_0))=d(a,b).$$