نتایج جستجو برای: cover plants
تعداد نتایج: 304850 فیلتر نتایج به سال:
There are some plants can replaced grass among cover plants. Cover plants are obvious solution of problem in these places that the most important plant is Frankinia and Lisimakia etc. The aim of this study is to use organic wastes, biological fertilizers and moisture super absorbents in the growth media of Frankinia to increase water holding capacity, delay in permane...
The study of allelopathy has a long history, and its application to agricultural production has long been anticipated. Recently, researchers have found allelopathic plants that are now used as cover crops, and allelochemicals which may lead to new herbicides. This paper reviews three studies introduced in this symposium, and discusses the possible application of allelopathy to agriculture.
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable solution for the grand coalition. We study the computation of the nucleolus of a number of cooperative games, including fractional matching games and fractional edge cover games on general weighted graphs, as well as verte...
The role of competition for light among plants has long been recognised at local scales, but its importance for plant species distributions at larger spatial scales has generally been ignored. Tree cover modifies the local abiotic conditions below the canopy, notably by reducing light availability, and thus, also the performance of species that are not adapted to low-light conditions. However, ...
We tested the hypothesis that mangroves provide better coastal protection than salt marsh vegetation using 10 1,008-m2 plots in which we manipulated mangrove cover from 0 to 100%. Hurricane Harvey passed over 2017. Data erosion stakes indicated up 26 cm of vertical and 970 horizontal 70 months plot with 0% cover, but relatively little other plots. The hurricane did not increase erosion, decreas...
Motivated by the need for succinct representations of all “small” transversals (or hitting sets) of a hypergraph of fixed rank, we study the complexity of computing such a representation. Next, the existence of a minimal hitting set of at least a given size arises as a subproblem. We give one algorithm for hypergraphs of any fixed rank, and we largely improve an earlier algorithm (by H. Fernau,...
Article history: Received 21 October 2013 Received in revised form 30 September 2014 Accepted 21 October 2014 Available online 28 October 2014 Communicated by G. Ausiello
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید