نتایج جستجو برای: gama prime
تعداد نتایج: 44689 فیلتر نتایج به سال:
Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an ...
Bu çalışmada, True Basic programlama dilini kullanarak gama spektrumunu analiz eden bir bilgisayar programı yazılmıştır. Program ana program ve bu programa bağlı alt programlar şeklindedir. İnteraktif olarak çalışan programın başında yardım sayfası vardır. Programı test etmek için, Malatya civarından alınan toprak örnek HPGe detektörü kullanılarak sayım sisteminde sayıldı. Sayım sistemi 133Ba 1...
Let R be a commutative ring with identity and M be a unitary R-module. Let : S(M) −! S(M) [ {;} be a function, where S(M) is the set of submodules ofM. Suppose n 2 is a positive integer. A proper submodule P of M is called(n − 1, n) − -prime, if whenever a1, . . . , an−1 2 R and x 2 M and a1 . . . an−1x 2P(P), then there exists i 2 {1, . . . , n − 1} such that a1 . . . ai−1ai+1 . . . an−1x 2 P...
The rings considered in this article are commutative with identity $1neq 0$. By a proper ideal of a ring $R$, we mean an ideal $I$ of $R$ such that $Ineq R$. We say that a proper ideal $I$ of a ring $R$ is a maximal non-prime ideal if $I$ is not a prime ideal of $R$ but any proper ideal $A$ of $R$ with $ Isubseteq A$ and $Ineq A$ is a prime ideal. That is, among all the proper ideals of $R$,...
let $g $ be a finite group and let $gamma(g)$ be the prime graph of g. assume $2 < q = p^{alpha} < 100$. we determine finite groups g such that $gamma(g) = gamma(u_3(q))$ and prove that if $q neq 3, 5, 9, 17$, then $u_3(q)$ is quasirecognizable by prime graph, i.e. if $g$ is a finite group with the same prime graph as the finite simple group $u_3(q)$, then $g$ has a un...
let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
Induction of growth inhibition in human colorectal carcinoma cell lines by interleukin (IL)-4 and IL-13 was associated with the neophosphorylation of a 170 kDa cellular protein, identified as insulin receptor substrate-1 (IRS-1) by immunoprecipitation. Tyrosine phosphorylation of IRS-I was also induced by insulin and insulin-like growth factor I. Sublines of colorectal carcinoma cells unrespons...
OBJECTIVE To experimentally compare two classic techniques described for manual suture of the bronchial stump. METHODS We used organs of pigs, with isolated trachea and lungs, preserved by refrigeration. We dissected 30 bronchi, which were divided into three groups of ten bronchi each, of 3mm, 5mm, and 7mm, respectively. In each, we performed the suture with simple, separated, extramucosal st...
In this work we study speed-ups and time–space trade-offs for solving the shortest vector problem (SVP) on Euclidean lattices based on tuple lattice sieving. Our results extend and improve upon previous work of Bai–Laarhoven– Stehlé [ANTS’16] and Herold–Kirshanova [PKC’17], with better complexities for arbitrary tuple sizes and offering tunable time–memory tradeoffs. The trade-offs we obtain st...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید