The objective of our study was to determine the effects of four types of fertilisers enrichments （manure potassic （K）, phosphatic （P）, phosphatic and potassic （PK） and nitrogenized, phosphated and potassic （NP...The objective of our study was to determine the effects of four types of fertilisers enrichments （manure potassic （K）, phosphatic （P）, phosphatic and potassic （PK） and nitrogenized, phosphated and potassic （NPK）） on chemical composition and dry matter in cassava （Manihot esculenta） organs （clone 1171） during harvest period. The pots experiment was laid out in randomised complete bloc design with five treatments and four replications. Water, nitrogen, potassium, phosphorus, sodium, total proteins and total lipids contents of the leaves, shoots and tubers were determined. After 9 months growing period, results showed that fertilizer types enriched with K, PK and NPK significantly increased the organic compounds contents of the leaves （P〈0.05）. Furthermore, fertilizers with high phosphorus content significantly increased the lipid contents of the leaves （25%）. Fertilizers enriched with NPK positively influenced the biomass partitioning in Manihot esculenta. Application of fertilizers enriched with NPK led to higher levels of total proteins in the leaves and tubers （70 mg g DM^-1 and 30 mg g DM^-1 respectively） compared to control （17 mg g DM^-1 and 9 mg g DM^-1 respectively）. These results help to demonstrate the value of these fertilizers enrichment to improve the chemical composition and dry matter partitioning of cassava.展开更多
Let G be a weighted hypergraph with edges of size i for i = 1, 2. Let wi denote the total weight of edges of size i and α be the maximum weight of an edge of size 1. We study the following partitioning problem of Bol...Let G be a weighted hypergraph with edges of size i for i = 1, 2. Let wi denote the total weight of edges of size i and α be the maximum weight of an edge of size 1. We study the following partitioning problem of Bollob′as and Scott： Does there exist a bipartition such that each class meets edges of total weight at least （w_1-α）/2＋（2w_2）/3？ We provide an optimal bound for balanced bipartition of weighted hypergraphs, partially establishing this conjecture. For dense graphs, we also give a result for partitions into more than two classes.In particular, it is shown that any graph G with m edges has a partition V_1,..., V_k such that each vertex set meets at least（1-（1-1/k）~2）m ＋ o（m） edges, which answers a related question of Bollobás and Scott.展开更多
文摘The objective of our study was to determine the effects of four types of fertilisers enrichments （manure potassic （K）, phosphatic （P）, phosphatic and potassic （PK） and nitrogenized, phosphated and potassic （NPK）） on chemical composition and dry matter in cassava （Manihot esculenta） organs （clone 1171） during harvest period. The pots experiment was laid out in randomised complete bloc design with five treatments and four replications. Water, nitrogen, potassium, phosphorus, sodium, total proteins and total lipids contents of the leaves, shoots and tubers were determined. After 9 months growing period, results showed that fertilizer types enriched with K, PK and NPK significantly increased the organic compounds contents of the leaves （P〈0.05）. Furthermore, fertilizers with high phosphorus content significantly increased the lipid contents of the leaves （25%）. Fertilizers enriched with NPK positively influenced the biomass partitioning in Manihot esculenta. Application of fertilizers enriched with NPK led to higher levels of total proteins in the leaves and tubers （70 mg g DM^-1 and 30 mg g DM^-1 respectively） compared to control （17 mg g DM^-1 and 9 mg g DM^-1 respectively）. These results help to demonstrate the value of these fertilizers enrichment to improve the chemical composition and dry matter partitioning of cassava.
基金National Natural Science Foundation of China (Grant Nos. 11371355 and 11471193)
文摘Let G be a weighted hypergraph with edges of size i for i = 1, 2. Let wi denote the total weight of edges of size i and α be the maximum weight of an edge of size 1. We study the following partitioning problem of Bollob′as and Scott： Does there exist a bipartition such that each class meets edges of total weight at least （w_1-α）/2＋（2w_2）/3？ We provide an optimal bound for balanced bipartition of weighted hypergraphs, partially establishing this conjecture. For dense graphs, we also give a result for partitions into more than two classes.In particular, it is shown that any graph G with m edges has a partition V_1,..., V_k such that each vertex set meets at least（1-（1-1/k）~2）m ＋ o（m） edges, which answers a related question of Bollobás and Scott.
