A water deficit during stage III of fruit growth was established with the aim of determining if it is possible to achieve an improvement in tree water status by summer pruning and fruit thinning. The experiment was set up as a randomized block split-plot design across trials (irrigation) where pruning was assigned to the main plot and fruit thinning to the sub-plots. The irrigation treatments w...

In this paper, a generalized output pruning algorithm for matrixvector multiplication is proposed first. Then the application of the proposed pruning algorithm to compute pruning Discrete Cosine Transform (DCT) is addressed. It is shown that, for a given decomposition of the matrix of the transform kernel and the pruning pattern, the unnecessary operations for computing an output pruning DCT ca...

The Prism family of algorithms induces modular classification rules in contrast to the Top Down Induction of Decision Trees (TDIDT) approach which induces classification rules in the intermediate form of a tree structure. Both approaches achieve a comparable classification accuracy. However in some cases Prism outperforms TDIDT. For both approaches pre-pruning facilities have been developed in ...

– A three-layered neural network that optimally self-adjusts the number of hidden layer units is proposed. The network combines two techniques : 1) Unit fusion which enables an efficient pruning of the redundant units. 2) Linear transformations applied to the chosen hidden layer unit pair output and a modified back-propagation training rule for gradual fusion to reduce pruning shocks. The netwo...

We describe a new method for pruning in dynamic models based on running an adaptive filtering algorithm online during decoding to predict aspects of the scores in the near future. These predictions are used to make well-informed pruning decisions during model expansion. We apply this idea to the case of dynamic graphical models and test it on a speech recognition database derived from Switchboa...

Max (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow pruning, can be applied to a max search tree. We extend this work by calculating the exact bounds needed to use this pruning technique. In addition, we show that branch-and-bound pruning, using a monotonic heuristic, has the ...

Abstrak. Penelitian ini dilaksanakan di Kebun Percobaan dan Laboratorium Fisiologi Tumbuhan Fakultas Pertanian, Universitas Syiah Kuala. berlangsung dari bulan Oktober hingga Desember 2021 menggunakan Rancangan Acak Kelompok pola faktorial. Faktor pertama yaitu waktu pemangkasan pucuk mentimun tanpa pucuk, 2 minggu setelah tanam, 3 tanam. kedua konsentrasi pupuk organik cair 0, 2, 4 6 ml L-1 ai...