• 한국산림과학회지
• /
• 제98권5호
• /
• pp.584-592
• /
• 2009

The objective of this study was to examine the impact of pruning intensity on the vigor and cambial growth of the treated trees, and on the closure of pruning wounds for one year after pruning treatment. Two tree species, Pinus strobus and Acer palmatum, planted broadly in the urban forest of Korea were selected for the experiment. Intensity of pruning, which was estimated by proportion of removed branches, was categorized into five levels with about 10% intervals from lowest 8% up to 46%. Following parameters were examined; cambial electrical resistance (CER) and the cambial growth of trunk at 30 cm above the ground for the years before and after pruning, the cambial growth of stem at 1.5 cm above the branch bark ridge (BBR) of the pruned branch, and closure of pruning wound for one year after pruning. Tree vigor inferred from CER had a tendency to be weakened as pruning intensity increased in P. strobus, while that of A. palmatum was not affected. The trunk growth decreased significantly when the pruning intensity was higher than 30% in both species. The closure of individual pruning wound was related more to the cambial growth of stem at 1.5 cm above BBR than to the pruning intensity. Comparing the closure rate of pruning wound for one year, P. strobus with 72.1% was faster than A. palmatum with 39.3%, which corresponded with the rate of cambial growth of the two species.

• Asia pacific journal of information systems
• /
• 제3권1호
• /
• pp.155-189
• /
• 1993

Empirical studies have shown that the performance of decision tree induction usually improves when the trees are pruned. Whether these results hold in general and to what extent pruning improves the accuracy of a concept have not been investigated theoretically. This paper provides a theoretical study of pruning. We focus on a particular type of pruning and determine a bound on the error due to pruning. This is combined with PAC (Probably Approximately Correct) Learning theory to determine a sample size sufficient to guarantee a probabilistic bound on the concept error. We also discuss additional pruning rules and give an analysis for the pruning error.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2022년도 봄 학술논문 발표대회
• /
• pp.210-211
• /
• 2022

Pruning is the most important work for the growth and aesthetics of street trees. It is also the most actively conducted maintenance work. However, the specifications, application methods, and cost criteria for pruning have not been systematically established. This has recently caused a lot of confusion in the practice of street tree pruning, such as indiscriminate pruning and lack of construction costs. Therefore, this study clarified the contents of work according to the form of pruning. It added 'aesthetic pruning,' which takes into account design. In addition, It revised equipment not in conformity with the law and excluded personnel necessary for on-site traffic control so that they could be reflected separately. As a result, this study is expected to contribute a lot to securing appropriate construction costs for maintaining street trees.

• Journal of Forest and Environmental Science
• /
• 제24권1호
• /
• pp.47-51
• /
• 2008

가지치기 작업은 보통 묘목의 식재 후 수고가 6 m 전후일 때 1차 작업을 실시하고 수고 12~13 m 전후일 때 2차 작업을 실시한다. 옹이가 없고 통직한 목재를 생산하기 위해서는 도구나 기계에 의하여 가지치기 작업이 필요하다. 가지치기 작업방법에는 자동지타기를 이용하거나 동력 고지톱을 이용하는 등 여러 가지 방법이 있지만 본 연구에서는 가지치기 작업에 일반적으로 가장 많이 활용하고 있는 인력고지톱에 의한 가지치기작업을 조사하였다. 조사수종은 강원도 지역을 중심으로 분포하고 있는 소나무, 잣나무, 리기다소나무를 대상으로 하였다. 조사대상 수고는 10~16 m 내외로서 가지치기 후 지하고의 높이는 6.2~6.7 m 내외로서 인력고지톱에 의한 가지치기 작업능률은 4~6 m의 작업높이의 경우 1본당 소나무 3.46분, 잣나무 5.06분, 리기다소나무 4.44분이 소요되었고, 1일 작업능률은 소나무 104본, 잣나무 64본, 리기다소나무 81본으로 나타났다.

• ETRI Journal
• /
• 제36권4호
• /
• pp.564-571
• /
• 2014

Sphere decoding (SD) for multiple-input and multiple-output systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method - namely, probabilistic tree pruning SD.

• 한국환경농학회지
• /
• 제41권3호
• /
• pp.199-205
• /
• 2022

BACKGROUND: The freezing injury by pruning can be reduced by suspending pruning work when severe cold weather (-23 to -49℃) is forecast. Minimum air temperature of the study area, Gunwi region at February 3, 2012 was -21.9℃, and the subzero temperature continued until April 8, 2012. This study was conducted in two years to investigate the effect of delaying winter pruning until full bloom on shoot growth and fruit quality of 'Fuji'/M.9 apple trees. METHODS AND RESULTS: The time of pruning were March 26 for dormant, April 3 for bud break, and May 2 for full bloom. The winter pruning at full bloom significantly reduced fruit weight for two years compared with the control (winter pruning at dormant), and shoot growth was reduced only in the following year. There was no significant effect of delaying winter pruning at bud break on soluble solid content, fruit red color, return bloom, and pruning weight for two years compared with the control. CONCLUSION(S): These results indicated the delaying winter pruning at bud break of 'Fuji'/M.9 apple tree did not offer any disadvantage over comparable dormant pruning, since the fruit quality was not affected. The delayed pruning at full bloom resulted in decreased fruit weight, though shoot growth, fruit quality, and return bloom were not affected by the delayed pruning. So, the delayed pruning should be considered carefully only for the fruit tree orchards in diseases.

• 한국환경농학회지
• /
• 제41권4호
• /
• pp.328-334
• /
• 2022

BACKGROUND: The low temperature at flowering period break the balance between vegetative and reproductive growth of apple tree. Summer pruning has been used to control vegetative growth. So, this study was conducted to investigate the effect of summer pruning time on shoot growth and fruit quality of 'Fuji'/M.9 apple trees damaged by the low temperature at flowering period. METHODS AND RESULTS: The following treatments were applied to tree : a) control (no summer pruning), b) pruned 26 June, c) pruned 30 July, d) pruned 28 August, and e) pruned 26 September. The summer pruning significantly increased light penetration and fruit red color by reducing the total shoot growth compared with control. And the summer pruning control the outbreak of apple valsa canker. But the summer pruning at the end of June increased regrowth of shoot and pruning weight compared with the summer pruning at the end of August. The summer pruning at 30 July had the highest fruit weight, but return bloom was the highest in the summer pruning at 28 August. CONCLUSION(S): These results indicated the optimum summer pruning time of 'Fuji'/M.9 apple trees damaged by the low temperature at flowering period were the end of August.

• 한국통신학회논문지
• /
• 제39A권12호
• /
• pp.756-763
• /
• 2014

본 논문에서는 트리검색 기반의 GTMP (matching pursuit with greedy tree search)이라는 새로운 희소신호 복원기법을 제안한다. 트리검색은 비용함수 (cost function)를 최소화함으로써 희소신호 복원 성능을 향상시키기 위해 적용하였다. 또한 각 노드마다 트리제거 (tree pruning)기법을 이용하여 효율적인 알고리듬을 개발하였다. 본 논문에서는 알고리듬의 성능분석을 통해 희소신호에서 영(0)이 아닌 값의 위치를 정확히 찾아내는 조건을 도출하였다. 그리고 실험을 통해 GTMP가 기존의 희소신호 복원기법에 비해 성능이 향상되었음을 보였다.

• 한국멀티미디어학회논문지
• /
• 제20권4호
• /
• pp.696-703
• /
• 2017

In this paper, we show how to design based on solving Sudoku problem that is one of the NP-complete problems like Go. We show how to use greedy method which can minimize depth based on tree expansion and how to apply heuristic algorithm for pruning unnecessary branches. As a result of measuring the performance of the proposed method for solving of Sudoku problems, this method can reduce the number of function call required for solving compared with the method of heuristic algorithm or recursive method, also this method is able to reduce the 46~64 depth rather than simply expanding the tree and is able to pruning unnecessary branches. Therefore, we could see that it can reduce the number of leaf nodes required for the calculation to 6 to 34.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2015년도 추계학술대회
• /
• pp.51-53
• /
• 2015

In this paper, we propose an efficient sparse signal recovery algorithm referred to as the matching pursuit with a tree pruning (TMP). Two key ingredients of TMP are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In our analysis, we show that the sparse signal is accurately reconstructed when the sensing matrix satisfies the restricted isometry property. In our simulations, we confirm that TMP is effective in recovering sparse signals and outperforms conventional sparse recovery algorithms.