In this paper, we will investigate the possible role of fuzzy set theory (FST), and more generally the ensemble of technologies and theoretical approaches known as soft computing, as a methodological bridge between hard sciences and humanities. We will try, building on previous works, to investigate the “family links” between these disciplines and show how FST may be of help in promoting a conn...

In this work, we introduce $H^*$-condition on the set of submodules of a module. Let $M$ be a module. We say $M$ satisfies $H^*$ provided that for every submodule $N$ of $M$, there is a direct summand$D$ of $M$ such that $(N+D)/N$ and $(N+D)/D$ are cosingular. We show that over a right perfect right $GV$-ring,a homomorphic image of a $H^*$ duo module satisfies $H^*$.

During the last few years, many database researchers have aimed their efforts at extending the object-oriented model for dealing with different kinds of imperfect information. Some of these scholars have used the Fuzzy Set Theory to deal with imperfection because it has proved to be useful in problems where imprecision and uncertainty play important roles. This article describes an architecture...

A kernelization algorithm for the 3-Hitting-Set problem is presented along with a general kernelization for d-Hitting-Set problems. For 3-Hitting-Set, a quadratic kernel is obtained by exploring properties of yes instances and employing what is known as crown reduction. Any 3-Hitting-Set instance is reduced into an equivalent instance that contains at most 5k + k elements (or vertices). This ke...

We give a new proof of the four-color theorem by exhibiting an unavoidable set of 2822 D-reducible configurations. The existence of such a set had been conjectured by several researchers including Stromquist [18], Appel and Haken [2] and Robertson, Sanders, Seymour and Thomas [15].

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

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).$$

Let $G$ be a finite group and $pi_{e}(G)$ be the set of orders of all elements in $G$. The set $pi_{e}(G)$ determines the prime graph (or Grunberg-Kegel graph) $Gamma(G)$ whose vertex set is $pi(G)$, the set of primes dividing the order of $G$, and two vertices $p$ and $q$ are adjacent if and only if $pqinpi_{e}(G)$. The degree $deg(p)$ of a vertex $pin pi(G)$, is the number of edges incident...