نتایج جستجو برای: half silking

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

Journal: :Field Crops Research 2021

Abstract Belowground and aboveground interactions are important in increasing yield nutrient-use efficiency intercropping. However, how the P-use respond to shoot-root intercropping remains unknown. Maize mono- was grown under field conditions (regosol soil, initial Olsen-P 12.6?mg?kg?1) with P supply of 0 35?kg ha yr-1 (P0 P35, respectively) for 3 years. Compared monocropping, significantly in...

Journal: :European Journal of Combinatorics 1997

1992
BJJ Abdullah KH Ng

P ulmonologists have generally taken a nihilistic view of chemotherapy for the treatment of advanced lung cancer. In a study of beliefs among pulmonologists in the therapeutic treatment of lung cancer, Schroen and colleagues found that only one third of those surveyed believed that chemotherapy conferred a survival benefit for patients with stage IV non-small cell lung cancer and 35% said they ...

2003
Edmund K. Burke Steven M. Gustafson Graham Kendall

Tree initialisation techniques for genetic programming (GP) are examined in [4,3], highlighting a bias in the standard implementation of the initialisation method Ramped Half-n-Half (RHH) [1]. GP trees typically evolve to random shapes, even when populations were initially full or minimal trees [2]. In canonical GP, unbalanced and sparse trees increase the probability that bigger subtrees are s...

Journal: :Electr. J. Comb. 2011
Eric Nordenstam Benjamin Young

We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an “arctic parabola” theorem for the Half-Hexagons as a corollary of the Arctic ...

Journal: :Eur. J. Comb. 1997
Jerrold R. Griggs Jianxin Ouyang

We consider the minimum number of zeroes in a 2m 2n (0; 1)-matrix M that contains no m n submatrix of ones. We show that this number, denoted by f(m; n), is at least 2n + m + 1 for m n. We determine exactly when this bound is sharp and determine the extremal matrices in these cases. For any m, the bound is sharp for n = m and for all but nitely many n > m. A general upper bound due to Gentry, f...

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

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