In a three year study, IOOderate and severe root pruning just before planting was compared to no root pruning, on two size classes of seedlings (smaller and larger than average). Seedlings were bar planted in holes the full depth of the planting bar blade. For the smaller seedlings, survival was 1.0 percentage point higher for moderate pruning and 5.6 points lower for severe pruning compared to...

the high quality and quantity seed production in old saxual shrubs are essential for regeneration and sustainable development of saxual forests in desert areas. the objective of this study was to determine the effects of different pruning height on saxual seed production. the study was carried out in an obviously wilted saxual forest located in ashkezar desert in yazd in 1994. the experiment wa...

In this paper, games with chance nodes are analysed. The evaluation of these game trees uses the expectiminimax algorithm. We present pruning techniques involving random effects. The gamma-pruning aims at increasing the efficiency of expectiminimax (analogously to alpha-beta pruning and the classical minimax). Some interesting properties of these games are shown: for instance, a game without dr...

|Neural network pruning methods on the level of individual network parameters (e.g. connection weights) can improve generalization, as is shown in this empirical study. However, an open problem in the pruning methods known today (OBD, OBS, autoprune, epsiprune) is the selection of the number of parameters to be removed in each pruning step (pruning strength). This work presents a pruning method...

Pruning is an unavoidable necessity of virtually all arboreal fruit crops. In the tropics and subtropics, pruning of mango (Mangifera indica L.) is particularly important due to its tendency for frequent flushes, especially in humid tropics. Commercial orchards must maintain control of both tree size and orchard productivity in order to remain productive. Tip, formation, and severe pruning can ...

|Neural network pruning methods on the level of individual network parameters (e.g. connection weights) can improve generalization, as is shown in this empirical study. However, an open problem in the pruning methods known today (OBD, OBS, autoprune, epsiprune) is the selection of the number of parameters to be removed in each pruning step (pruning strength). This work presents a pruning method...

during spring and summer of 2010 and 2012, several surveys were conducted in different vineyards in kohgiluyeh & boyer-ahmad (southwestern iran) and kerman (southeastern iran) provinces, with the aim of isolating and identifying fungi associated with grapevine decline diseases. the samples collected comprised diseased grapevines showing yellowing, defoliation, reduced growth, wilting, intervein...

In this paper, we propose the grouped scheme, which can be specially applied to compute the pruning fast Fourier transform (pruning FFT) with power-of-two partial transformation length. The group-based pruning FFT algorithm applies the scheme of the grouped frequency indices to accelerate computations of selected discrete Fourier transform (DFT) outputs. The proposed pruning FFT algorithm has f...

We describe an experimental study of pruning methods for decision tree classi ers when the goal is minimizing loss rather than error. In addition to two common methods for error minimization, CART's cost-complexity pruning and C4.5's error-based pruning, we study the extension of cost-complexity pruning to loss and one pruning variant based on the Laplace correction. We perform an empirical com...

The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the other hand, the pruning algorithms based on posterior calculations such as BIC (MDL) and MEP are faster, but they sometimes produce too big or small trees to yield poor generalization errors. In this paper, we propose a...