Abstract In this paper, we extend Open-set Semantic Segmentation (OSS) into a new image segmentation task called Generalized (GOSS). Previously, with well-known OSS, the intelligent agents only detect unknown regions without further processing, limiting their perception capacity of environment. It stands to reason that analysis detected pixels would be beneficial for agents’ decision-making. Th...

How can we accurately identify new memory workloads while classifying known workloads? Verifying DRAM (Dynamic Random Access Memory) using various is an important task to guarantee the quality of DRAM. A crucial component in process open-set recognition which aims detect not seen training phase. Despite its importance, however, existing methods are unsatisfactory terms accuracy since they fail ...

The aim of this paper is to introduce and study the notions of fuzzy upper $e$-limit set, fuzzy lower $e$-limit set and fuzzy $e$-continuously convergent functions. Properties and basic relationships among fuzzy upper $e$-limit set, fuzzy lower $e$- limit set and fuzzy $e$-continuity are investigated via fuzzy $e$-open sets.

OBJECTIVE The aim of this study was to evaluate the relative socioeconomic costs of benign cranial base tumors treated with open surgery and gamma knife radiosurgery. METHODS In a retrospective study, we studied 174 patients with benign cranial base tumors, less than 3 cm in diameter (or volume less than 30 ml), admitted in the past 5 years. Group A (n = 94) underwent open surgery for removal...

Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...

let r be a fnite commutative ring and n(r) be the set of non unit elements of r. the non unit graph of r, denoted by gamma(r), is the graph obtained by setting all the elements of n(r) to be the vertices and defning distinct vertices x and y to be adjacent if and only if x - yin n(r). in this paper, the basic properties of gamma(r) are investigated and some characterization results regarding co...

The prime graph $Gamma(G)$ of a group $G$ is a graph with vertex set $pi(G)$, the set of primes dividing the order of $G$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $G$ of order $pq$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$. For $pinpi(G)$, set $deg(p):=|{q inpi(G)| psim q}|$, which is called the degree of $p$. We also set $D(G):...