let $r$ be an associative ring with identity and $z^*(r)$ be its set of non-zero zero divisors.  the zero-divisor graph of $r$, denoted by $gamma(r)$, is the graph whose vertices are the non-zero  zero-divisors of  $r$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$.  in this paper, we bring some results about undirected zero-divisor graph of a monoid ring ov...

‎motivated by a celebrated theorem of schur‎, ‎we show that if~$gamma$ is a normal subgroup of the full automorphism group $aut(g)$ of a group $g$ such that $inn(g)$ is contained in $gamma$ and $aut(g)/gamma$ has no uncountable abelian subgroups of prime exponent‎, ‎then $[g,gamma]$ is finite‎, ‎provided that the subgroup consisting of all elements of $g$ fixed by $gamma$ has finite index‎. ‎so...

Let $Gamma$ be a group, $Gamma'$ a subgroup of $Gamma$ with finite index and $M$ be a $Gamma$-module. We show that $M$ is cotorsion if and only if it is cotorsion as a $Gamma'$-module. Using this result, we prove that the global cotorsion dimensions of rings $ZGamma$ and $ZGamma'$ are equal.

Positive, continuous, and right-skewed data are fit by a mixture of gamma inverse distributions. For 16 hierarchical models distributions, there only 8 them that have conjugate priors. We first discuss some common typical problems for the eight do not Then, we calculate Bayesian posterior densities marginal After that, relations among analytical densities. Furthermore, find random variables bet...

Introduction:Low-pass filters eliminate noise, and accordingly improve the quality of filtered back-projection (FBP) in the reconstruction of single photon emission computed tomography (SPECT) images. This study aimed at selection of an optimum low-pass filter for FBP reconstruction of SPECT images of small structures. Material and Methods:Sp...

max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the para...

Field-Programmable Gate Arrays (FPGAs) are flexible and reusable circuits that can be easily reconfigured by the designer. One of the steps involved in the logic design with FPGA circuits is placement. In this step, the logic functions are assigned to specific cells of the circuit. In this paper we present a placement algorithm for FPGA circuits. In traditional min-cut based placement algorithm...

BACKGROUND Currently, T-cell based gamma interferon (IFNγ) release assays (IGRAs) are acknowledged as the best methods available for the screening of latent tuberculosis infection (LTBI) and also as aid for the diagnosis of active tuberculosis (TB). To our information, the performance of these diagnostic tests has not been evaluated in Ethiopia. Therefore, the intent of this study was to evalua...

The well-known Max Cut problem asks for the largest bipartite subgraph of a graph G. This problem has been the subject of extensive research, both from the algorithmic perspective in computer science and the extremal perspective in combinatorics. Let n be the number of vertices and e be the number edges of G and let b(G) denote the size of the largest bipartite subgraph of G. The extremal part ...

We analyze the addition of a simple local improvement step to various known ran-domized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently known for the Max Cut problem on general graphs GW95]. We consider a semideenite relaxation of the Max Cut problem, round it using the random hyperplane rounding technique of ((GW95]), and then add a local improvement step....