نتایج جستجو برای: g x e interaction
تعداد نتایج: 2398407 فیلتر نتایج به سال:
The main purpose of this paper is to establish some new results onthe superstability and stability via a fixed point approach forthe Pexiderized exponential equation, i.e.,$$|f(x+y)-g(x)h(y)|leq psi(x,y),$$where $f$, $g$ and $h$ are three functions from an arbitrarycommutative semigroup $S$ to an arbitrary unitary complex Banachalgebra and also $psi: S^{2}rightarrow [0,infty)$ is afunction. Fur...
The amino acid sequence of the light chain of bovine protein C was determined by sequenator analysis of the carboxymethylated light chain and fragments obtained by cyanogen bromide treatment, tryptic digestion after blocking of lysine residues, and cleavage with 2-(2-nitrophenylsulfenyl)-3-methyl-3-bromoindolenine (BNPS-skatole). The sequence was (in the standard one-letter code) A-N-S-F-L-X-X-...
BACKGROUND Genetic risks for depression may be expressed through greater exposure towards environmental stressors (gene-environment correlation, rGE) and increased susceptibility to these stressors (gene-environment interaction, G x E). While these effects are often studied independently, evidence supports their co-occurrence on depression. METHODS Adolescent twin and sibling data was used to...
Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G), without loops and multiple edges. For counting qoc strips in G, Omega polynomial was introduced by Diudea and was defined as Ω(G,x ) = ( , ). , c c m G c x where m(G,c) be the number of qoc strips of length c in the graph G. Following Omega polynomial, the Sadhana polynomial was defined by Ashrafi et al ...
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
فرض کنید $ d $ درجه ی یک کاراکتر تحویل ناپذیر از گروه متناهی $ g $ باشد، می دانیم که $ d mid vert g vert $ و همچنین $ d^{2} leq vert g vert $. به ازای $ e eq o $، داریم: $ vert g vert = d (d + e) $. واضح است که اگر $ e = o $، $ g $ گروه بدیهی خواهد بود به طور مشابه به ازای $ e = 1 $ که کلاسبندی توسط بئرکویش در قضیه $ 7 $ از $ [1] $ کامل شده بود نشان داد که $ e = ...
Let \((X,\mathscr {B}, \mu ,T,d)\) be a measure-preserving dynamical system with exponentially mixing property, and let \(\mu \) an Ahlfors s-regular probability measure. The covering problem concerns the set E(x) of points which are covered by orbits \(x\in X\) infinitely many times. We prove that Hausdorff dimension intersection any regular fractal G \(\dim _\mathrm{H}G>s-\alpha equals _\math...
The objectives of this study were to analyze genotype by environment (GE) interactions on the seed yield of 19 safflower genotypes by the additive main effects and multiplicative interactions (AMMI) model and to evaluate genotype (G), environment (E) and GE interactions using statistics parameter i.e. AMMI stability value (ASV) and ecovalence (W2i). The trials were conducted at three locations:...
% .3 +4 % . .+ %/ 01" ,-" ( )*+ -" )*+ #$ >4 % (! .5+ .3 6 7 !# 87 9: 8; 8<" .= c % " -7?" @ a!" b 6 6!! ," #% b !" (i 1) .3 (! .5+ 9d" e!f 9= ." g)*+ #$ &/"< p c #$ m5n" b c >o1 . k b#0 l &t gv5n" #$ % 50 &t % 50 g&t % 100) #$ m5n" e + w" x5 y4 z7[ "% . (#$ % 100 g" @ #$ n % 4 2 31" cropwat " ] . % " % . 6 k a17 % #+ 8$ g; e!f 9= a % m5n" b / &" `. !ib ....
best approximation results provide an approximate solution to the fixed point equation $tx=x$, when the non-self mapping $t$ has no fixed point. in particular, a well-known best approximation theorem, due to fan cite{5}, asserts that if $k$ is a nonempty compact convex subset of a hausdorff locally convex topological vector space $e$ and $t:krightarrow e$ is a continuous mapping, then there exi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید