نتایج جستجو برای: od characterization
تعداد نتایج: 384443 فیلتر نتایج به سال:
Endoglin, a type I membrane glycoprotein expressed as a disulfide-linked homodimer on human vascular endothelial cells, is a component of the transforming growth factor (TGF)-β receptor complex and is implicated in a dominant vascular dysplasia known as hereditary hemorrhagic telangiectasia as well as in preeclampsia. It interacts with the type I TGF-β signaling receptor activin receptor-like k...
به گروه متناهی g یک گراف ساده به گراف اول وابسته می شود که آن را با ?(g) یا gk(g) نشان می دهیم. در این گراف مجموعه رئوس عبارت است از ?(g) یعنی مجموعه اعداد اول شمارنده |g| و دو راس مانند p و q به هم وصلند هرگاه گروه g عضوی از مرتبه pq داشته باشد در این حالت می نویسیم p~q . فرض می کنیم |g|=p_1^(n_1 ) p_2^(n_2 )…p_k^(n_k ) که در آن p_1< p_2<?<p_k اعداد اول و k یک عدد صحیح مثبت است. در این صورت...
On the basis of the systematic study on temperature dependence of photoluminescence (PL) properties along with relaxation dynamics we revise a long-accepted mechanism for enhancing absolute PL quantum yields (QYs) of freestanding silicon nanocrystals (ncSi). A hydrogen-terminated ncSi (ncSi:H) of 2.1 nm was prepared by thermal disproportination of (HSiO1.5)n, followed by hydrofluoric etching. R...
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...
It is true in the Solovay model that every countable ordinal-definable set of sets of reals contains only ordinal-definable elements.
let $g$ be a finite group and $pi(g)$ be the set of all the prime divisors of $|g|$. the prime graph of $g$ is a simple graph $gamma(g)$ whose vertex set is $pi(g)$ and two distinct vertices $p$ and $q$ are joined by an edge if and only if $g$ has an element of order $pq$, and in this case we will write $psim q$. the degree of $p$ is the number of vertices adjacent to $p$ and is ...
در این پایان نامه اثبات می کنیم تمام گروههای ساده ای که مرتبه آنها دقیقا توسط چهار عدد اول عاد می شود، بجز گروه ساده a_10 ،توسط مرتبه و الگوی درجه آنها سرشت پذیرند.و این نوع سرشت پذیری را od-سرشت پذیری می نامیم. بعلاوه od-سرشت پذیری گروه ساده (u-3(5 و گروههای وابسته به آن را مد نظر قرار می دهیم و اثبات میکنیم (u-3(5 و 2.(u-3(5 سرشت پذیر هستند در حالی که 3.( u-3(5سه مرتبه od-سرشت پذیر میباشد و د...
Some new amicable orthogonal designs of order 8 are found as part of a complete search of the equivalence classes for orthogonal designs OD(8; 1, 1, 1, 1), OD(8; 1, 1, 1, 4), OD(8; 1, 1, 2, 2), OD(8; 1, 1, 1, 2), OD (8; 1, 1, 2, 4), OD(8; 1, 1, 1, 3), OD(8; 1, 1, 2, 3), OD(8; 1, 1, 1, 5) and OD(8; 1, 1, 3, 3). 2000 Mathematics subject classification (Amer. Math. Soc.): 05B30, 15A36.
Fear of crime as a concept has been present in criminological literature for quite some time. Numerous researches have been undertaken in order to explain this phenomenon, but still, it remains unclear what exactly represents this concept. Because of this, the expert working in the Þ eld of crime prevention have been having difÞ culties in creating successful preventive programs of fear of crim...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید