• Journal of Forest and Environmental Science
• /
• v.10 no.1
• /
• pp.8-24
• /
• 1994

Because of the underground existence of roots, a few studies have been reported on root system. The developmental information of roots should be understood for the studies of specific tree traits and the influence of such traits on the soil surface fixation. In order to clarify the specific character of pine forest in Kangwon Province, the investigation on the form and distribution of root system of pine trees were carried out for 5 trees in the Campus Forest, Kangwon National Univ.. Root form was very well in flat root. As soil depth was approximatly 50cm, fine roots were very sparsly distributed(+), roots of 0.2cm in diameter were most common and roots > 0.2cm were very rare, also thickness thined. 60~70% all the roots were developed at the depth of 0~30cm, where big roots were below 0.9cm in diameter and fine roots were higly sparse(+).

• Journal of Korean Society of Forest Science
• /
• v.108 no.2
• /
• pp.269-275
• /
• 2019

The aim of our study was to compare the wound responses and fine root development after root cutting and wound dressing among different tree species. The roots (2~4 cm in diameter) of mature Pinus densiflora, Prunus serrulata var. spontanea, and Zelkova serrata grown in Sangju, South Korea, were cut every 6 months from May 2014 to November 2016. The cut roots were subjected to pastes of vaseline and organic fertilizer. Six months after cutting, fine root development in the cut roots was examined. There was a significant increase in the fine root development in P. serrulata and Z. serrata; however, the development was rarely observed in P. densiflora. Zelkova serrata showed the highest fine root development among the three species in both the control and organic paste treatment groups. No significant differences in fine root development were observed in P. serrulata among the treatments. These results indicate that different tree species exhibit different responses to wound dressing after root cutting, which suggests that specific treatments must be applied to specific tree species.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.133-140
• /
• 2008

This paper proposes an effective k-D tree traversal algorithm for ray tracing on a GPU. The previous k-D tree traverse algorithm based on GPU uses bottom-up searching from a leaf to the root after failing to find the ray intersected primitive in the leaf node. During the bottom-up search the algorithm decides the current node is visited or not from the parent node. In such a way, we need to visit the parent node which was already visited and the duplicated bounding box intersection tests. The new k-D tree traverse algorithm reduces the brother and parent duplicated visit by using an efficient method which decides whether the brother node is already visited or not during the bottom-up search. Also the algorithm take place bounding box intersection tests only for the nodes which is not yet done. As a result our experiment shows the new algorithm is about 30% faster than the previous.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.421-429
• /
• 2006

In this paper, we suggest a new capability aware spanning tree(CAST) algorithm for Ethernet bridged network which consists of both legacy Ethernet bridges and synchronous Ethernet ones. The legacy spanning tree algorithm specified in IEEE 802.1D standard select root bridge and construct tree based on each bridge's identifier without consideration of each bridge's capability. Thus we note that if the legacy STP may assign a synchronous bridge as a root bridge, the bridge may become a bottleneck for asynchronous trafficbecause of bandwidth limitation for asynchronous traffic. In this paper, the CAST algorithm constructsmultiple spanning tree by using of bridge capability and makes different transmission path for each traffics, can removes this kind of defect. From the simulation results, we can see that the proposed CAST algorithm has better end-to-end delay performance than legacy spanning tree algorithm in high traffic load and multiple hops environment.

• Journal of Korean Society of Rural Planning
• /
• v.17 no.2
• /
• pp.33-41
• /
• 2011

To evaluate the value of a preserved tree as rural landscape resource, the growth environment and health condition was investigated, and the image evaluation was implemented on land~ape architectural major undergraduate students for zelkova trees in Yesan-gun. The image evaluation results of zelkova trees were as followings; 1) Typical image of preserved tree examined by Semantic Differential Scale were 'Old', 'Big', and 'Good'. 2) The 'big' image of zelkova tree and the height of tree, the width of tree crown, the breast girth of tree, the root girth of tree, the external formation of tree, and the health of tree bark is mutually related. Especially, the correlation between the 'big' and the external formation and the width of tree crown is high. 3) Typical image of preserved tree examined by Likert Scale were 'Natural', 'Green', 'Peaceful', and 'Rural'. 4) The preservation necessity for preserved tree was highly related with the state of ground, and the management necessity for preserved tree was highly related with contamination level and the state of ground. The appropriate management plan for preserved tree are proposed to improve the quality of rural landscape(basis of these results).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.15-23
• /
• 2021

Most of the open-source decision tree algorithms are based on three splitting criteria (Entropy, Gini Index, and Gain Ratio). Therefore, the advantages and disadvantages of these three popular algorithms need to be studied more thoroughly. Comparisons of the three algorithms were mainly performed with respect to the predictive performance. In this work, we conducted a comparative experiment on the splitting criteria of three decision trees, focusing on their interpretability. Depth, homogeneity, coverage, lift, and stability were used as indicators for measuring interpretability. To measure the stability of decision trees, we present a measure of the stability of the root node and the stability of the dominating rules based on a measure of the similarity of trees. Based on 10 data collected from UCI and Kaggle, we compare the interpretability of DT (Decision Tree) algorithms based on three splitting criteria. The results show that the GR (Gain Ratio) branch-based DT algorithm performs well in terms of lift and homogeneity, while the GINI (Gini Index) and ENT (Entropy) branch-based DT algorithms performs well in terms of coverage. With respect to stability, considering both the similarity of the dominating rule or the similarity of the root node, the DT algorithm according to the ENT splitting criterion shows the best results.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.427-432
• /
• 1998

When an undirected tree T and a vertex ${\gamma}$ in the tree are given the problem to transform T into a rooted tree with ${\gamma}$ as its root is considered. Using Euler tour and prefix sum an optimal algorithm has been developed [2,3]. We will present another parallel algorithm which is optimal also on EREW PRAM. Our approach resuces the given tree step by step by pruning and pointer jumping. That is the tree structure is retained during algorithm processing such that than other tree computations can be carried out in parallel.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.115-123
• /
• 2004

A recursive tree is constructed by starting with a root node and repeatedly adjoining new nodes to one node of the tree already constructed. Such a tree can represent, for example, the heirarchy of a workforce of a company that grows via recruiting. At times of economic depression, the company may decide to layoff participants, and in some cases it is a fair policy to relieve the last senior worker (most recent entry in the tree). If we remove an edge from such a tree then it falls into two subtrees one of which contains the most recent entry. If we continue to remove edges from the successively smaller subtrees that contain the most recent entry, we eventually isolate the most recent entry. We consider how many randomly selected edges must be removed in average before isolating the most recent entry by this procedure.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.8-16
• /
• 2022

In this paper, we propose a method of reconstructing the file system to obtain digital forensics information from the APFS file system when meta information that can know the structure of the file system is deleted due to partial damage to the disk. This method is to reconstruct the tree structure of the file system by only retrieving the B-tree node where file/directory information is stored. This method is not a method of constructing nodes based on structural information such as Container Superblock (NXSB) and Volume Checkpoint Superblock (APSB), and B-tree root and leaf node information. The entire disk cluster is traversed to find scattered B-tree leaf nodes and to gather all the information in the file system to build information. It is a method of reconstructing a tree structure of a file/directory based on refined essential data by removing duplicate data. We demonstrate that the proposed method is valid through the results of applying the proposed method by generating numbers of user files and directories.

• The Plant Pathology Journal
• /
• v.38 no.5
• /
• pp.513-521
• /
• 2022

Our study was carried out to determine the control efficacy of sodium hypochlorite (NaOCl) for violet root rot caused by Helicobasidium mompa in apple. The experiment was conducted in the farm located at Chungbuk province in South Korea from 2014 to 2016. When infected apple trees were treated at least two or three times with 31.25 and 62.5 ml/l available chlorine content in NaOCl, it greatly increased the rooting of rootstock, and restored the tree crown density by 44.4-60.5%. In addition, the number of commercial fruit setting was increased by 54.3-64.5%, and the total starch content in shoots was significantly higher than other non-treated apple trees. However, the untreated disease control and thiophanate-methyl WP treated trees showed the symptom of dieback. Therefore, our results indicate that the drenching treatment of NaOCl with 31.25-62.5 ml/l available chlorine content more than two times from late fall to early spring could effectively control the violet root rot and recover tree vigor up to 60%.