نتایج جستجو برای: pullback cat1 polygroup
تعداد نتایج: 1179 فیلتر نتایج به سال:
The existence of a random attractor in H1(R3)×L2(R3) is proved for the damped semilinear stochastic wave equation defined on the entire space R 3. The nonlinearity is allowed to have a cubic growth rate which is referred to as the critical exponent. The uniform pullback estimates on the tails of solutions for large space variables are established. The pullback asymptotic compactness of the rand...
In this work we obtain theoretical results on continuity of selected pullback attractors for a generalized process and consider the when system is asymptotically autonomous. As an example, apply theory nonautonomous problem with reaction diffusion equations dynamical boundary conditions, after that, some additional hypotheses family problems converging to autonomous limit show convergence their...
Excess Leu reduces the availability of Ile and Val in pigs likely by reducing absorption of the latter amino acids (AA). Twenty-four crossbred pigs were used to evaluate the effect of excess Leu alone or with surplus Ile and Val on the expression of cationic (b(0),(+)AT and CAT1) and neutral (B(0)AT1) AA transporters in the small intestine, liver, and skeletal muscle. Dietary treatments include...
Let X be a projective manifold, ρ : X̃ → X its universal covering and ρ∗ : V ect(X) → V ect(X̃) the pullback map for isomorphism classes of vector bundles. This article makes the connection between the properties of the pullback map ρ∗ and the properties of the function theory on X̃. Our approach motivates a weakened version of the Shafarevich conjecture: the universal covering X̃ of a projective m...
and Applied Analysis 3 The content of the paper is as follows. In Section 2, for the convenience of the reader, we recall some concepts and results on function spaces and pullback attractors which we will use. In Section 3, we prove the existence of pullback attractors in the spaces S0 Ω and L2p−2 Ω by using the asymptotic a priori estimate method. In Section 4, under additional assumptions of ...
This paper studies a fuzzy graph rewriting with single pushout approach from a viewpoint of fuzzy relational calculus. Two possible kinds of matchings for fuzzy graph rewritings are given, namely, a rigorous matching which just generalizes matchings for crisp (or ordinary) graph rewritings, and an "-matching which represents rather ambiguous or fuzzy one. Finally the pullback structure of fuzzy...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید