نتایج جستجو برای: called the v
تعداد نتایج: 16105411 فیلتر نتایج به سال:
هدف تحقیق حاضر بررسی تاثیر نشانه های فرا گفتمان متنی بر فهم متون انگلیسی به وسیله ی زبان اموزان فارسی زبان است.این تحقیق علاوه بر این کوشیده است تا میزان اگاهی این زبان اموزان و نحوه ی تعامل انان را با متون خوانده شده در زبان انگلیسی به وسیله ی پرسش نامه ی تهیه شده بررسی کند.بر اساس محتوای یک متن انگلیسی یازده سوال درست /غلط طرح گردید و یک مرتبه با ان متن و یک مرتبه با نسخه ای که نشانه ها...
Theorem 1.1 (Hrushovski’s Theorem 3.5). Let G be a definable group, X a definable subset, and G̃ be the ∨-definable group generated by X. Suppose all this data is defined over a model M . Suppose μ is an M-invariant translation-invariant ideal on subsets of G̃. Let q be a wide type over M , contained in G̃. Identify q with its ∧-definable set of realizations. Suppose (F) there exist two realizatio...
during the third/ninth century, several commentators on euclid’s elements composed blocks of propositions (called ziyadat) in which they expanded specific concepts or techniques beyond the basic discussions of euclid. among the earliest of these ziy?d?t were three propositions created by al-‘abbas b. sa‘?d al-jawhar? in an attempt to demonstrate the validity of euclid’s definitions v, 5 and v, ...
in this paper we defined the vertex removable cycle in respect of the following, if $f$ is a class of graphs(digraphs) satisfying certain property, $g in f $, the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $. the vertex removable cycles of eulerian graphs are studied. we also characterize the edge removable cycles of regular graphs(digraphs).
A mapping $f:V^n longrightarrow W$, where $V$ is a commutative semigroup, $W$ is a linear space and $n$ is a positive integer, is called multi-additive if it is additive in each variable. In this paper we prove the Hyers-Ulam stability of multi-additive mappings in 2-Banach spaces. The corollaries from our main results correct some outcomes from [W.-G. Park, Approximate additive mappings i...
an injective map f : e(g) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph g(p, q) if the induced vertex function f*: v (g) → z − {0} defined by f*(v) = (sigma e∈ev) f (e) is one-one, where ev denotes the set of edges in g that are incident with a vetex v and f*(v (g)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} u {k(p+1)/2} accordin...
let $g=(v,e)$ be a connected simple graph. a labeling $f:v to z_2$ induces two edge labelings $f^+, f^*: e to z_2$ defined by $f^+(xy) = f(x)+f(y)$ and $f^*(xy) = f(x)f(y)$ for each $xy in e$. for $i in z_2$, let $v_f(i) = |f^{-1}(i)|$, $e_{f^+}(i) = |(f^{+})^{-1}(i)|$ and $e_{f^*}(i) = |(f^*)^{-1}(i)|$. a labeling $f$ is called friendly if $|v_f(1)-v_f(0)| le 1$. for a friendly labeling $f$ of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید