نتایج جستجو برای: مدل let 1

تعداد نتایج: 2888421  

‎Let $f:Arightarrow B$ and $g:A rightarrow C$ be two ring homomorphisms and let $J$ and $J^{'}$ be two ideals of $B$ and $C$‎, ‎respectively‎, ‎such that $f^{-1}(J)=g^{-1}(J^{'})$‎. ‎The bi-amalgamation of $A$ with $(B,C)$ along $(J,J^{'})$ with respect of $(f,g)$ is the subring of $Btimes C$ given by‎ ‎$Abowtie^{f,g}(J,J^{'})={(f(a)+j,g(a)+j^{'})‎/ ‎a in A‎, ‎(j,j^{'}) in Jtimes J^{'}}.$‎ ‎In ...

Let $G$ be a $p$-group of nilpotency class $k$ with finite exponent $exp(G)$ and let $m=lfloorlog_pk floor$. We show that $exp(M^{(c)}(G))$ divides $exp(G)p^{m(k-1)}$, for all $cgeq1$, where $M^{(c)}(G)$ denotes the c-nilpotent multiplier of $G$. This implies that $exp( M(G))$ divides $exp(G)$, for all finite $p$-groups of class at most $p-1$. Moreover, we show that our result is an improvement...

Journal: :Annals of oncology : official journal of the European Society for Medical Oncology 2011
A Ruzzo E Canestrari N Galluccio D Santini B Vincenzi G Tonini M Magnani F Graziano

Role of KRAS let-7 LCS6 SNP in metastatic colorectal cancer patients We read with interest the study by Zhang et al. [1] on the association between the LCS6 T/G variant (rs61764370) and

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

2003

3.2 Likelihood equations and errors-in-variables regression; Solari's example.. Here is a case, noted by Solari (1969), where the likelihood equations (3.1.1) have solutions, none of which are maximum likelihood estimates. be observed points in the plane. Suppose we want to do a form of " errors in variables " regression, in other words to fit the data by a straight line, assuming normal errors...

1995
S. Moran

The asynchronous computability theorem for t-resilient tasks. A simple constructive computability theorem for wait-free computation. a spanning tree of G, starting (and ending) at a leaf, and then omitting the last two edges of the tour). Let V be an arbitrary set of n-dimensional vectors such that the adjacency graph G(V) is connected. We now complete the proof of Theorem 2.1 by presenting a w...

2016
Ying Li Qian Xu Jingwei Liu Caiyun He Quan Yuan Chengzhong Xing Yuan Yuan

The relationship between the pri-let-7a-1 rs10739971 polymorphism and gastric cancer (GC) risk has been reported. However, the role of this polymorphism in the prognosis of GC remains largely elusive. Sequenom MassARRAY platform method and the polymerase chain reaction (PCR)-restriction fragment length polymorphism were used to investigate pri-let-7a-1 rs10739971 G→A in 334 GC patients. Real-ti...

Journal: :Canadian Journal of Neurological Sciences / Journal Canadien des Sciences Neurologiques 2015

Journal: :British Dental Journal 2011

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید