نتایج جستجو برای: perfect group

تعداد نتایج: 1021937  

This study investigated the impact of oral pushed output on the learning and retention of English perfect tenses. During the study, a pre-test was administered to 22 freshmen majoring in English translation. The participants were randomly assigned to two groups. Then, for six sessions both groups received explicit instructions on English perfect tenses. Every session, the experimental group rec...

Journal: :Physical review 2023

The method of nonlinear realizations is a convenient tool for building dynamical Lie group, which relies solely upon structure relations the corresponding algebra. goal this work to discuss advantages and limitations method, here applied construct perfect fluid equations with conformal symmetry. Four cases are studied in detail, include Schr\"odinger $\ensuremath{\ell}$-conformal Galilei Lifshi...

Journal: :Australasian J. Combinatorics 2007
Jeffrey H. Dinitz Alan C. H. Ling Douglas R. Stinson

2005
Judith Carney

This article examines the geographical corridors for the establishment of rice in seventeenth-century Dutch Guiana. One corridor of introduction is associated with the expulsion of Dutch planters from Brazil in 1644, whose slaves reestablished longstanding subsistence preferences with their exodus to the colony. Another corridor links its introduction to the African Gold Coast, where rice devel...

Journal: :Des. Codes Cryptography 2013
Marjan Bazrafshan Tran van Trung

An (N ;n,m, {w1, . . . , wt})-separating hash family is a set H of N functions h : X −→ Y with |X| = n, |Y | = m, t ≥ 2 having the following property. For any pairwise disjoint subsets C1, . . . , Ct ⊆ X with |Ci| = wi, i = 1, . . . , t, there exists at least one function h ∈ H such that h(C1), h(C2), . . . , h(Ct) are pairwise disjoint. Separating hash families generalize many known combinator...

Journal: :Math. Meth. of OR 2002
Annegret Wagler

Journal: :CoRR 2014
V. Ch. Venkaiah K. Ramanjaneyulu Neelima Jampala J. Rajendra Prasad

Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F) over all (near-) one-factorizations F of G. Wagner showed that for odd n, c(Kn) ≥ n∗φ(n) 2 and for m and n which are odd and co-prime to each other, c(Kmn) ≥ 2 ∗ c(Km) ∗ c(Kn). In this note, we establish that both these results are equivalent in the sense that they both give rise to the same lower bound.

Journal: :Discrete Mathematics 1997
Jean-Luc Fouquet Frédéric Maire Irena Rusu Henri Thuillier

V. Chv atal proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most + ! 1 which meets every !-clique and every -stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as strong as Berge's Strong Perfect Graph Conjecture for a very large class of graphs, although ...

2015
Treb Allen Camilo Dominguez Snaebjorn Gunnsteinsson Rachel Heath Naomi Lamoreaux Steve Meardon Melinda Miller

This paper examines how the fertility of enslaved women was affected by the promise of freedom. Exploiting geographic variation in the effect of the Fugitive Slave Law of 1850, I demonstrate a negative correlation between fertility and the distance to freedom. This negative correlation is stronger on larger plantations but weaker when the slaveholder is a woman. A similar correlation is not pre...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید