نتایج جستجو برای: l 02316and w 01176
تعداد نتایج: 779489 فیلتر نتایج به سال:
هدف از این پایان نامه بررسی وجود جوابهای هموکلینیکی برای سیستم نا خود گردان مرتبه دوم?q ?+aq ?-l(t)q+w?_q (t,q)=0 می باشد به طوری که a یک ماتریس ثابت نامتقارن، l ?(r,r^n) ماتریس معین مثبت و متقارن برای همه t?r، w(t,q)=a(t)v(q) که در آن a:r?r تابعی پیوسته وv?c^1 (r^n,r) است. در پایان با استفاده از دو محک وجودی، وجود حداقل یک جواب هموکلینیکی غیر بدیهی تضمین می کنیم.
Background and Objectives: Nowadays corn flakes are the most common form of breakfast cereals however, their vitamins are declined during the baking process. In this research, production of fortified corn flakes by Lactobacillus plantarum and L. reuteri, as well as incorporation of oat and malt fiber as prebiotics have been studied. Materials and Methods: Plackett-Burman statistical design was...
background and objectives: nowadays corn flakes are the most common form of breakfast cereals however, their vitamins are declined during the baking process. in this research, production of fortified corn flakes by lactobacillus plantarum and l. reuteri, as well as incorporation of oat and malt fiber as prebiotics have been studied. materials and methods: plackett-burman statistical design was ...
We present some characterizations for the wrapped butterfly, a class of useful network models in parallel processing. Our characterizations are parallel to the characterization of Bermond et al. for the (ordinary) butterfly. But our approach seems more natural and provides some more insight. In the course of our study, we also give a slight improvement of a result of Beineke et al. which charac...
Let G be a graph and F ⊆ V (G). Then F is called an induced forest of G if 〈G〉 contains no cycle. The forest number, f(G), of G is defined by f(G) := max{|F | : F is an induced forest of G}. It was proved by the second author in [6] that if G is an r-regular graph of order n, then f(G) ≤ b nr−2 2(r−1)c. It was also proved that the bound is sharp by constructing an r-regular graph H of order n w...
D 7 ] \ N > F D " % > > F > = F F F F = K ^ W C C & > > > _ ' 7 ( $ @ ^ @ ^ < Y > = > > > = F > F ] \ \ ] ] F > > F a @ + > > F 7 / c Z = > = F F F 2 U > F < & 5 & F > F < 1 > > < < = = ; 7 ] \ \ \ N > F D Z & > > F F h > F = & ^ W W W W W + I [ 1 # f C f C @ $ @ @ # 1 + ^ M M 1 I F > F \ ] ] \ ] c = = k 0 J T < F = : 7 D 3 / Z P 9 D = d @ g M [ 1 [ = > F F F F > > = > F F h Q \ \ \ ] 7 > F ( c...
The stability number of a graph G, denoted by α(G), is the cardinality of a stable set of maximum size in G. If α(G − e) > α(G), then e is an α-critical edge, and if μ(G − e) < μ(G), then e is a μ-critical edge, where μ(G) is the cardinality of a maximum matching in G. G is a König-Egerváry graph if its order equals α(G) + μ(G). Beineke, Harary and Plummer have shown that the set of α-critical ...
They are top predators in coastal ecosystems, but today, are exposed to environmental pollutants and fisheries pressures (Jefferson and Curry, 1994; Beineke et al., 2005; Jepson et al., 2005). Especially, population reduction due to incidental catch has been a growing serious problem in a part of the North Atlantic (Woodley and Read, 1991; Trippel et al., 1996). It is important to understand th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید