نتایج جستجو برای: or at most
تعداد نتایج: 6345473 فیلتر نتایج به سال:
abstract chickpea is weak in competition of weeds that damages to it at between 40 t0 60 percent. kermanshah province is one of the most important region for chickpea fields in iran. for these reosons, weed management is necessary in this crop. in order to evaluate of herbicides and stubble control on broad leave weeds control in chickpea. experiment was conducted in agricultural research stat...
It is known that AND-EXOR two-level networks obtained by AND-EXOR expressions with positive literals are easily testable. They are based on the single-rail-input logic, and require (n + 4) tests to detect their single stuck-at faults, where n is the number of the input variables. We present three-level networks obtained from single-rail-input OR-ANDEXOR expressions and propose a more easily tes...
abstract this study examines the effect of teaching lexical inferencing strategies on developing reading comprehension skill of iranian advanced efl learners. participants were female students of meraj and shokouh institudes of garmsar a quasi-experimental design using two intact advanced classes of efl students at meraj and shokouh institutes. as the first step, a general toefl proficiency te...
abstract the present study is concerned with the syntactic deviation in hafezs poetry. poems are known to be accompanied with various linguistic deviations. these deviations may be phonological, morphological and/or syntactic. the relatively high frequency of the cases of the syntactic deviation in hafezs poems makes this rhetorical feature as a main characteristic of his poetry. this thesis, ...
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
one very decisive factor in students’ academic destiny is the result they get at final term examinations. because of its importance, both students and teachers are curiously anxious about them. as normally it is the case, these final term tests are prepared hurriedly in short time by teachers which result in students’ dissatisfaction, complaining on how the test was different from their expecta...
today, scouring is one of the important topics in the river and coastal engineering so that the most destruction in the bridges is occurred due to this phenomenon. whereas the bridges are assumed as the most important connecting structures in the communications roads in the country and their importance is doubled while floodwater, thus exact design and maintenance thereof is very crucial. f...
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
We prove that on a punctured oriented surface with Euler characteristic χ < 0, the maximal cardinality of a set of essential simple arcs that are pairwise nonhomotopic and intersecting at most once is 2|χ|(|χ|+1). This gives a cubic estimate in |χ| for a set of curves pairwise intersecting at most once on a closed surface. We also give polynomial estimates in |χ| for sets of arcs and curves pai...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید