114,983 research outputs found

    Long-Term Evaluation of the Influence of Mechanical Pruning on Olive Growing

    Get PDF
    In Portugal, olive (Olea europaea L.) groves with the traditional tree density of around 100 trees ha -1, necessitate increasing pruning costs every year. As a result farmers tend to lengthen pruning intervals. With the purpose of studying a mechanised alternative to the expensive, labor-intensive manual pruning practice, the authors established in 1997 field trials with the following three treatments: i) manual pruning with a chain saw; ii) mechanical pruning, performed by a tractor mounted cutting bar provided with 6 circular disc-saws; and iii) mechanical pruning, as in the mechanical pruning treatment, followed by a manual pruning complement. The effect of the above treatments on olive production and on harvesting efficiency was evaluated every year for 8 yr. The harvesting was performed by a trunk shaker, and the remaining non-detached fruits were collected manually. The pruning rate of mechanical pruning (487 trees hour-1man-1) was substantially higher than the values of manual pruning and mechanical+manual pruning, which were the same (20 trees hour-1man-1). Over the 8-yr period, mechanical pruning had an average yield of 36,4 kg tree-1 year-1 which was significantly higher than the 30,1 kg tree-1 year-1 of manual pruning and no significantly different from the 34,1 kg tree-1 year-1 of mechanical+manual pruning. The shaker efficiency was significantly influenced by the year, ranging from 72% to 96%; no significant differences were found between treatments in terms of harvesting efficiency. These tests indicate that after mechanized pruning (horizontal cut at the uppermost part of the canopy) trees can be kept for at least 8 years without any significant loss in olive yield per tree and no effect in harvesting efficiency, therefore reducing costs. Selective manual complement to the mechanized pruning, performed in the same year, does not provide any further advantages in olive yield nor in shaker performance and consequently increasing production costs

    Tree-Independent Dual-Tree Algorithms

    Full text link
    Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split: the tree, the traversal, the point-to-point base case, and the pruning rule. We provide a meta-algorithm which allows development of dual-tree algorithms in a tree-independent manner and easy extension to entirely new types of trees. Representations are provided for five common algorithms; for k-nearest neighbor search, this leads to a novel, tighter pruning bound. The meta-algorithm also allows straightforward extensions to massively parallel settings.Comment: accepted in ICML 201

    Connected operators based on region-tree pruning strategies

    Get PDF
    This paper discusses region-based representations useful to create connected operators. The filtering approach involves three steps: 1) a region tree representation of the input image is constructed; 2) the simplification is obtained by pruning the tree; and 3) and output image is constructed from the pruned tree. The paper focuses in particular on the pruning strategies that can be used depending of the increasing of the simplification criteria.Peer ReviewedPostprint (published version

    Optimum graph cuts for pruning binary partition trees of polarimetric SAR images

    Get PDF
    This paper investigates several optimum graph-cut techniques for pruning binary partition trees (BPTs) and their usefulness for the low-level processing of polarimetric synthetic aperture radar (PolSAR) images. BPTs group pixels to form homogeneous regions, which are hierarchically structured by inclusion in a binary tree. They provide multiple resolutions of description and easy access to subsets of regions. Once constructed, BPTs can be used for a large number of applications. Many of these applications consist in populating the tree with a specific feature and in applying a graph cut called pruning to extract a partition of the space. In this paper, different pruning examples involving the optimization of a global criterion are discussed and analyzed in the context of PolSAR images for segmentation. Through the objective evaluation of the resulting partitions by means of precision-and-recall-for-boundaries curves, the best pruning technique is identified, and the influence of the tree construction on the performances is assessed.Peer ReviewedPostprint (author's final draft

    Stock Picking via Nonsymmetrically Pruned Binary Decision Trees

    Get PDF
    Stock picking is the field of financial analysis that is of particular interest for many professional investors and researchers. In this study stock picking is implemented via binary classification trees. Optimal tree size is believed to be the crucial factor in forecasting performance of the trees. While there exists a standard method of tree pruning, which is based on the cost-complexity tradeoff and used in the majority of studies employing binary decision trees, this paper introduces a novel methodology of nonsymmetric tree pruning called Best Node Strategy (BNS). An important property of BNS is proven that provides an easy way to implement the search of the optimal tree size in practice. BNS is compared with the traditional pruning approach by composing two recursive portfolios out of XETRA DAX stocks. Performance forecasts for each of the stocks are provided by constructed decision trees. It is shown that BNS clearly outperforms the traditional approach according to the backtesting results and the Diebold-Mariano test for statistical significance of the performance difference between two forecasting methods.decision tree, stock picking, pruning, earnings forecasting, data mining

    A construction of a β\beta-coalescent via the pruning of Binary Trees

    Full text link
    Considering a random binary tree with nn labelled leaves, we use a pruning procedure on this tree in order to construct a β(3/2,1/2)\beta(3/2,1/2)-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous's continuum random tree, to construct a continuous state space process that has the same structure as the β\beta-coalescent process up to some time change. These two constructions unable us to obtain results on the coalescent process such as the asymptotics on the number of coalescent events or the law of the blocks involved in the last coalescent event

    Tree growth and management in Ugandan agroforestry systems: effects of root pruning on tree growth and crop yield

    Get PDF
    Tree root pruning is a potential tool for managing below-ground competition when trees and crops are grown together in agroforestry systems. This study investigates its effects on growth and root distribution of Alnus acuminata (HB & K), Casuarina equisetifolia (L), Grevillea robusta (A. Cunn. ex R. Br), Maesopsis eminii (Engl.), and Markhamia lutea (Benth.) K. Schum. and on yield of adjacent crops in sub-humid Uganda. The trees were 3 years old at the commencement of the study, and most species were competing strongly with crops. Tree roots were pruned 41 months after planting by cutting and back-filling a trench to a depth of 0.3 m, at a distance of 0.3 m from the trees, on one side of the tree row. The trench was re-opened and roots re-cut at 50 and 62 months after planting. Effects on tree growth and root distribution were assessed over a 3 year period, and crop yield after the third root pruning at 62 months is reported here. Overall, root pruning had only a slight effect on tree growth: height growth was unaffected and diameter growth was reduced by only 4 %. A substantial amount of root re-growth was observed by 11 months after pruning. Tree species varied in the number and distribution of their roots, and Casuarina and Markhamia had considerably more roots per unit of trunk volume than the other tree species, especially in the surface soil layers. Casuarina and Maesopsis were the most competitive tree species with crops and Grevillea and Markhamia the least. Crop yield data provides strong evidence of the redistribution of root activity following root pruning, so that competition increased on the unpruned side of tree rows. Thus, one-sided root pruning will only be of use to farmers in a few circumstances. Key words: Alnus acuminata, Casuarina equisetifolia, Grevillea robusta, Maesopsis eminii, Markhamia lutea, root distribution, root functio
    corecore