نتایج جستجو برای: growing degree days
تعداد نتایج: 824514 فیلتر نتایج به سال:
The two main schemes for coding triangle mesh connectivity traverse a mesh with similar region-growing operations. Rossignac’s Edgebreaker uses triangle labels to encode the traversal whereas the coder of Touma and Gotsman uses vertex degrees. Although both schemes are guided by the same spiraling spanning tree, they process triangles in a different order, making it difficult to understand thei...
in order to determine the critical period of weed control (cpwc) in corn (zea mays l.), an experiment was carried out in a randomized complete blocks design with 14 treatments and three replications during 2013 growing season in the nahavand climatic conditions. two series of the treatments including weed-free and weed-infested were applied in the regular time distances of 10, 20, 30, 40, 50 an...
We consider growing random networks {Gn}n≥1 where, at each time, a new vertex attaches itself to collection of existing vertices via fixed number m≥1 edges, with probability proportional function f (called attachment function) their degree. It was shown in [BB21] that such network models exhibit two distinct regimes: (i) the persistent regime, corresponding ∑i=1∞f(i)−2<∞, where top K maximal de...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید