5 research outputs found

    Impact of soil compaction heterogeneity and moisture on maize (Zea mays L.) root and shoot development

    No full text
    International audienceSoil compaction heterogeneity and water content are supposed to be decisive factors influencing plant growth. Our experiment focused on simulation of two soil moisture levels (0.16 and 0.19 g/g) plus two levels of clod proportion (30 and 60% volume) and their effects on root and leaf variables of maize (Zea mays L.). We studied number of primary and lateral roots as well as primary root length at the particular soil depths. Statistical tests showed that the decrease rate of the number of roots versus depth was significantly affected by the two studied factors (P < 0.01). Soil moisture and clod occurrence, interactively, affected leaf biomass (P = 0.02). Presence of clods modified root morphological features. Particularly, the diameter of primary roots in the clods was significantly higher than of those grown in fine soil (P < 0.01). For primary roots, which penetrated clods, branching density decreased considerably for the root segments located just after the clods (P = 0.01). Regarding their avoidance to clods and tortuosity, large differences were found between primary roots grown in the contrasting soil environment

    Parallel algorithms for finding a suboptimal fundamental-cycle set in a graph

    No full text
    An NP-complete problem of finding a fundamental-cycle set of a graph G with minimum total length is considered. Two parallel algorithms of O(n/p + n log n log p) and O(m + n/p + n log(n/p) + n log p) costs to find a suboptimal solution to this problem are presented (p is a number of processors, n is a number of vertices, and m is a number of edges of G). The algorithms partition an edge and vertex set of G among processors, respectively, and use a new heuristic method to solve the problem. A message-based tree-connected MIMD computer is assumed as a model of parallel computations. The algorithms were implemented for a binary tree of 15 transputers, and the experiments were conducted on a wide range of random graphs. The results show that the vertex set partition algorithm with inferior theoretical cost gives better speedups and finds the fundamental-cycle sets of shorter total lenghts as compared to the edge set partition algorithm
    corecore