نتایج جستجو برای: p i v
تعداد نتایج: 2358360 فیلتر نتایج به سال:
We consider the system ⎧ ⎪ ⎨ ⎪ ⎩ −Δ p u = λf (v) in Ω −Δ q v = μg(u) in Ω u = v = 0 on ∂Ω (I) where Δ p u = div(|∇u| p−2 ∇u), Δ q v = div(|∇v| q−2 ∇v), p, q > 1, Ω is the open unit ball in R N , N ≥ 2 and ∂Ω is its boundary. We establish upper and lower estimates for possible positive solutions of system(I).
PAGE I . I n t r o d u c t i o n 3 2 8 I I . D e s c r i p t i o n o f t h e w e i g h t r h y t h m . . . . . . 3 2 9 I I I . R e l a t i o n t o a c t i v i t y . . . . . . . 3 3 1 I V . R e l a t i o n t o e n v i r o n m e n t a l v a r i a t i o n s 3 3 2 V . R e l a t i o n t o u p t a k e o f f o o d a n d w a t e r . . . . . 3 3 4 V I . B e h a v i o u r o f s n a i l s i n h u m i d a ...
In 1911 W. Blaschke and J. Grnwald described the group ~ of proper motions of the euclidean plane d' in the following way: Let (P, fg)be the real three-dimensional projective space, let ~ C P be an isomorphic image of g, and let U ~ f# such that ~ tA U is the projective closure of in P. Then there is a bijection x : ~ ~ P ' := P \ U called the kinematic mapping and an injective mapping ~ × ~ ~ ...
Given an ideal I on ω let a(I) (ā(I)) be minimum of the cardinalities of in nite (uncountable) maximal I-almost disjoint subsets of [ω]. We show that a(Ih) > ω if Ih is a summable ideal; but a(Z~ μ) = ω for any tall density ideal Z~ μ including the density zero ideal Z. On the other hand, you have b ≤ ā(I) for any analytic P -ideal I, and ā(Z~ μ) ≤ a for each density ideal Z~ μ. For each ideal ...
A mode l based compute r v i s i o n sys tem has been d e v e l o p e d w h i c h can d e t e r m i n e t h e p o s i t i o n and o r i e n t a t i o n o f s e v e r a l p a r t s i n t h e same s c e n e . The p a r t s can b e o f t h e same t y p e o r o f d i f f e r e n t t y p e s . F u r t h e r m o r e , t h e sys tem can work w i t h v i s u a l l y n o i s y scenes and some o c c l u ...
در این پایان نامه فضاهای دنباله ای ,z(u, v; p) (u, v; p) و (p) نتیجه گرفته شده به وسیله میانگین وزن دار و فضای دنباله ای تفاضلی که ترکیب میانگین وزن دار تعمیم یافته و عملگر تفاضلی می باشد را تعریف می کنیم و اطلاعاتی راجع به ساختار توپولوژیکی این فضاها مانند کامل بودن و خاصیت ad به دست می آوریم. همچنین ثابت می کنیم که برای فضاهای (u, v; p) و ( ( p به طور خطی آیزومورفیک هستند. دوگان های ?, ? و ? ...
synthesis and biological evaluation of new 1, 4-dihydropyridines as antihypertensives agents in rats
new analogues of nifedipine, as a known calcium channel blocker, were synthesized by replacing the orthonitrophenyl group on position 4 with 1-(4-nitrobenzyl)-5-imidazolyl or 2-methylthio-1-(4-nitrobenzyl)-5-imidazolyl substituent. effects of the new synthesized compounds on blood pressure were studied at 15, 30 and 60 min after administration by indirect tail-cuff method and compared with nife...
the aim of this study was to investigate the hemagglutination properties of caprine herpesvirus-1(cphv-1) and their application for cphv-1 antigen detection and evaluation of the dynamics of postinfectious/vaccine antibody production. cphv-1 hemagglutination activity was proved only with mouseerythrocytes, pbs and saline solutions at 4°c and 22°c. in vaccinated animals, goats and bucks withresp...
Definition 1 Ontology : An ontology O is a quintuple, O = (C ,P , I ,V ,A) where C ,P , I ,V , and A are the sets of classes, properties, individuals, property values and other axioms (such as constraints) respectively. These sets are defined as follows. C = {c | c is a unary predicate} P = {p | p is a binary predicate} I = {c(i) | c ∈ C ∧ i is a ground term} V = {p(x , y) | p ∈ P ∧ x and y are...
let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید