• 한국조경학회지
• /
• 제30권4호
• /
• pp.92-104
• /
• 2002

This study investigates, analyzes, and summarizes Dansplantation techniques and methods through practical methodology centering on fieldwork in order to present effective planting methods for large trees that have important significance. The conclusions are as follows : 1. The transplantation process of a large tree generally consists of the stages of digging up a tree, manufacturing a carrier frame, loading the tee on a vehicle, transporting, transplanting the tree, installing a strut and maintaining and managing the new transplant. In addition, planting a tree on a mounted place includes the primary procedures of trimming out the root, and preparing for transplanting the tree on a mounted place, as well as the secondary work of trimming out the root, transplanting a tree on a mounted place, maintenance and management. 2. In order to decide on a transplantation method for a large-sized tree, a structure calculation has to be performed first. That is, one must calculate the weight of the tree and the allowable stress of the strut (H-beam, etc.) fhst and then decide on the upper method through computer modeling based upon this structural calculation. 3. As a result of the analysis of a transplanted tree using the life soil method, it was confirmed that large quantities of feeder roots had developed around the root within a short time after the transplantation. The life soil method has proven to be very effective for transplantation of large-sized trees. 4. As for the production method of an H-beam strut frame, it was found that the manufacturing process and disassembly process were simple and proper; therefore, the H-beam frame is an appropriate structure to be used in the transplantation of large trees. 5. The concavo-convex method, which consists of filling the life soil in the concavo-convex area around the root, was found to be a method that promotes the growth of feeder roots within a short period of time and saves the supply of water at the same time.

• International Journal of Internet, Broadcasting and Communication
• /
• 제14권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.

• 한국컴퓨터정보학회논문지
• /
• 제22권8호
• /
• pp.73-83
• /
• 2017

In this paper, we discuss the differences between an ordinary B-tree and B-tree implemented by NTFS. There are lots of distinctions between the two B-tree, if not understand the distinctions fully, it is difficult to utilize and analyze artifacts of NTFS. Not much, actually, is known about the implementation of NTFS, especially B-tree index for directory management. Several items of B-tree features are performed that includes a node size, minimum number of children, root node without children, type of key, key sorting, type of pointer to child node, expansion and reduction of node, return of node. Furthermore, it is emphasized the fact that NTFS use B-tree structure not B+structure clearly.

• 한국컴퓨터정보학회논문지
• /
• 제19권7호
• /
• pp.131-140
• /
• 2014

본 논문에서는 최소신장트리를 구하는 크루스칼 알고리즘의 효율적인 구현 방법을 제시한다. 제시하는 방법은 union-find 자료구조를 이용하며, 노드 집합을 나타내는 각 트리의 깊이를 줄이기 위해 union 연산시 루트까지의 경로에 있는 노드들의 위치를 최종 루트의 자식노드로 직접 이동하여 깊이를 줄이도록 하는 방법이다. 이 방법은 루트까지의 경로를 축소하고 노드의 레벨을 축소시킴으로써 트리의 깊이도 줄일 수 있다. 트리의 깊이가 줄어든다면 노드가 속하는 트리의 루트를 찾는 시간을 줄일 수 있게 되어 효율적인 방법이라 할 수 있다. 본 장에서 제안하는 방법을 그래프로 평가해보고 분석해 본 결과, 기존의 union() 방법이나 경로축소방법인 union2() 보다 트리의 깊이를 작게 유지함을 알 수 있다.

• 한국산림과학회지
• /
• 제90권3호
• /
• pp.338-345
• /
• 2001

본 연구는 독일가문비나무의 지하부인 뿌리구조와 지상부인 수관과의 상호관계를 밝혀, 어렵게 뿌리를 굴취하거나 침엽 생체량을 측정하지 않고도 수고와 흉고직경에 의한 상대적인 뿌리와 침엽 생체량 추정을 위한 회귀식을 구하기 위하여 실시하였다. 독일 중부 Harz 지방의 Barbis 임분에서 30~40년생의 우세목 5본과 준우세목 3본을 선발한 후 조사목의 지상부에 대하여 수고, 흉고직경, 지하고, 침엽량, 가지량, 횡단면, 변재면 등을 조사하였다. 그리고 5본에 대해서는 지하부의 뿌리길이, 뿌리수, 뿌리무게, 뿌리횡단면 등을 수평과 수직뿌리로 구분하여 조사하였다. 조사된 염분에서 독일가문비나무의 지상부(수고, 흉고직경, 침엽량, 가지량 등)와 지하부(뿌리길이, 무게, 수, 횡단면 등) 생체량 사이에는 서로 밀접한 상관을 나타내었다. 측정이 용이한 흉고직경에 대한 지하부 뿌리생체량은 Y = 3.56X - 45.94의 관계식으로 결정계수가 0.96으로 매우 높은 상관관계를 나타내었다. 가지량, 침엽량과 수고에 있어서도 지하부 생체량과 높은 상관관계를 나타내었다. 본 연구에서 얻어진 회귀식은 30~40년생 독일 가문비나무 임분에서 흉고직경을 이용하여 지하부의 상대적인 뿌리 생체량을 추정하는데 유용하게 이용될 수 있을 것이다.

• 전기학회논문지
• /
• 제67권2호
• /
• pp.285-292
• /
• 2018

In this paper, we propose a distributed search of a cluster robot using tree structure in an unknown environment. In the proposed method, the cluster robot divides the unknown environment into 4 regions by using the LRF (Laser Range Finder) sensor information and divides the maximum detection distance into 4 regions, and detects feature points of the obstacle. Also, we define the detected feature points as Voronoi Generators of the Voronoi Diagram and apply the Voronoi diagram. The Voronoi Space, the Voronoi Partition, and the Voronoi Vertex, components of Voronoi, are created. The generated Voronoi partition is the path of the robot. Voronoi vertices are defined as each node and consist of the proposed tree structure. The root of the tree is the starting point, and the node with the least significant bit and no children is the target point. Finally, we demonstrate the superiority of the proposed method through several simulations.

• The Journal of the Acoustical Society of Korea
• /
• 제14권2E호
• /
• pp.43-49
• /
• 1995

인공지능(AI)의 한기법인 Space Search 기법을 이용하여 회로의 단선 결함의 유무 및 결함위치를 찾아내는 방법을 제시하였다. 보통 회로의 결함은 단선 및 단락의 구조적 결함으로 나뉘어진다. 두가지 결함 모두 회로의 기능에 중대한 이상을 초래한다. 그중 단선에 의한 회로의 결함에 대하여 다루었다. 우선 회로를 net와 net의 연결 path에 따라 tree 구조로 변환하였다. 서로 독립된 net들은 서로 다른 tree의 node를 이루며 각각의 tree는 적기적으로 연결됨이 없다. 각 tree의 최상단부의 root node에 test vector를 입력하고 최하단부의 leaf node에서 vector를 관찰하여 입력된 test vector와 비교한다. 그 비교 결과 동일 유무에 따라 결함의 유무를 판정한다. 결함이 있다고 판정된 leaf node는 depth search 방법에 의하여 root node쪽으로 test vector를 관찰하여, 전기적 신호에 의하여 회로의 서놔 단선된 위치를 찾아내도록 하는 방법을 제시하였다.

• 한국컴퓨터정보학회논문지
• /
• 제22권12호
• /
• pp.69-77
• /
• 2017

This paper represents a novel framework for multi-scale image fusion. Multi-scale Kalman Smoothing (MKS) algorithm with quad-tree structure can provide a powerful multi-resolution image fusion scheme by employing Markov property. In general, such approach provides outstanding image fusion performance in terms of accuracy and efficiency, however, quad-tree based method is often limited to be applied in certain applications due to its stair-like covariance structure, resulting in unrealistic blocky artifacts at the fusion result where finest scale data are void or missed. To mitigate this structural artifact, in this paper, a new scheme of multi-scale fusion framework is proposed. By employing Super Resolution (SR) technique on MKS algorithm, fine resolved measurement is generated and blended through the tree structure such that missed detail information at data missing region in fine scale image is properly inferred and the blocky artifact can be successfully suppressed at fusion result. Simulation results show that the proposed method provides significantly improved fusion results in the senses of both Root Mean Square Error (RMSE) performance and visual improvement over conventional MKS algorithm.

• Journal of applied mathematics & informatics
• /
• 제5권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권5호
• /
• pp.1303-1315
• /
• 2012

In the draft of the IEEE 802.11s standard, a tree topology is established by the proactive tree-building mode of the Hybrid Wireless Mesh Protocol (HWMP). It is used for cases in which the root station (e.g., gateway) is an end point of the majority of the data connections. In the tree topology, the root or central stations (e.g., parent stations) are connected to the other stations (e.g., leaves) that are one level lower than the central station. Such mesh stations are likely to suffer heavily from contention in bottleneck links when the network has a high traffic load. Moreover, the dependence of the network on such stations is a point of vulnerability. A failure of the central station (e.g., a crash or simply going into sleep mode to save energy) can cripple the whole network in the tree topology. This causes performance degradation for end-to-end transmissions. In a connected mesh topology where the stations having two or more radio links between them are connected in such a way that if a failure subsists in any of the links, the other link could provide the redundancy to the network. We propose a scheme to utilize this characteristic by organizing the network into concentric tiers around the root mesh station. The tier structure facilitates path recovery and congestion control. The resulting mode is referred to as Tier-based Proactive Path Selection Mode (TPPSM). The performance of TPPSM is compared with the proactive tree mode of HWMP. Simulation results show that TPPSM has better performance.