نتایج جستجو برای: حسگر a d v
تعداد نتایج: 13611167 فیلتر نتایج به سال:
background: vitamin d has a wide range of physiological functions in skeletal and nonskeletal tissues which may play a role in many diseases. the aim of this study was to evaluate the recent evidence regarding the effects of vitamin d on several health outcomes in women including breast cancer, ovarian and endometrial cancers, hypertension, and osteoporosis. materials and methods: we searched ...
فرض کنیم a، b، c و d چهار عدد صحیح مثبت باشد و "k" _"a" ، "k" _"b" ، "k" _"c" و "k" _"d" گراف های کامل به ترتیب با a، b، c و d راس باشند اگر هر راس "k" _"a" و "k" _"c" را با هر راس از "k" _"b" و "k" _"d" مجاور کنیم گرافی شبیه به گراف شکل مقابل می شود. که آن را با نماد "r" _"a,b,c,d " نمایش می دهیم.
in this work, a new extractant was prepared by immobilizing ligand 2-(5-bromo-2-pyridylazo)-5-diethylaminophenol, (5-br-padap), on the activated carbon and applied to extraction of pb(ii) prior to determination by flame atomic absorption spectrometry. it was confirmed by ft- ir analysis. the metal ion was retained on the 0.05 g of the sorbent in the ph range 6-8, and then eluted with 5 ml of 0....
let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...
let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...
فرض کنید g گرافی ساده و همبند، و s={s_1,…s_k} زیرمجموعه ای ازv(g) باشد. برای هر رأس v از g کد متریک v نسبت به s عبارت است از بردار-kتایی r(v?s)?(d(v,s_1 ),…,d(v,s_k ) ). که در آن d(v,s_i )فاصله ی بین دو رأس v و s_i در گراف g است. اگر کدهای متریک رأس های متمایز g نسبت به s از هم متمایز باشند، s یک مجموعه کاشف برای gنامیده می شود. در بین مجموعه های کاشف، مجموعه های ب...
The Narumi-Katayama index was the first topological index defined by the product of some graph theoretical quantities. Let $G$ be a simple graph with vertex set $V = {v_1,ldots, v_n }$ and $d(v)$ be the degree of vertex $v$ in the graph $G$. The Narumi-Katayama index is defined as $NK(G) = prod_{vin V}d(v)$. In this paper, the Narumi-Katayama index is generalized using a $n$-ve...
V(D)J recombination is of fundamental importance to the generation of diverse antigen receptor repertoires. We review our current understanding of the V(D)J recombination reaction and how it is regulated during lymphocyte development. We also discuss how defects in the mechanism or regulation of V(D)J recombination can lead to human disease.
Lucas et al. report the visualization of V(D)J recombination of the immunoglobulin heavy-chain gene (Igh) in living pro-B cells. Despite the huge distances separating V coding sequences from D-J sequences (~2 Mb), the authors document an astonishingly rapid rate of remote associations. The key to speed is contraction of the Igh chromosomal domain. These findings provide a foundation for underst...
u n d o u b t e d l y, i n t h e l a s t d e c a d e s, t h e a s s e t p r i c i n g m o d e l i so n e o f m o s t i m p o r t a n t a n d, a t t h e s a m e t i m e, a t t r a c t i v e, f i n a n c e a r e a s. c a p m h a s b e e n t h e d o m i n a n t m o d e l i n t h i s s e c t i o n f o r m o r e t h a n 40 y e a r s. o n e r e a s o n i s i t s s t r o n g b a s e, w h i c h h a s b...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید