• Journal of People, Plants, and Environment
• /
• v.23 no.3
• /
• pp.347-362
• /
• 2020

Background and objective: It is difficult to conclusively determine the exact cause of tree defects since multiple causes are involved such as climate change, plantation, tree quality and planting time, construction, planting base, drainage, sunshine conditions, maintenance, and microclimate. The data related to landscaping construction defects are scattered or fragmented by companies and years, but not managed systematically by the defect information management system. Most of the earlier studies associated with tree defects in apartment complexes suggested defect rates after examining tree defects in the completed construction site and proposed fragmentary and subjective conclusions about the causes of defects observed in trees with high defect rates. It is proposed to continue to conduct studies on the establishment and analysis of systematic databases to identify the exact causes of tree defects and measures to improve, and the need to accumulate systematic data in the construction process where many defects arises. This study was conducted to reduce the defects of trees planted in apartment complexes. Methods: Main factors related to tree defects were subdivided based on the results of literature review and a defect investigation at the completion site, and tree history management items were selected and subdivided during the construction stage. Results: The criteria for the preparation of subdivided items were obtained, and the tree history management checklist was written for the site under actual construction and a systematic database was established. Items that are categorized based to the causes of defects include the location of nurseries, date, tree quality, site conditions, planting techniques, microclimates, and maintenance. Conclusion: This study suggested tree history management items based on the tree defects that can be identified at the construction stage and applied them to the selected study site, which differentiates this study from earlier studies. It will be necessary to conduct a comprehensive and objective time series analysis on tree defects that occur over time by continuously monitoring and collecting data after construction.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.333-338
• /
• 2001

Fault tree is a widely used methodology for analyzing product reliability. The fault trees are usually constructed using the experiences of expert reliability engineers in top-down approaches and have different structures according to each expert's subjectivity. In this work it is tried to find a general method for the fault tree construction based on the function tree that is the result of product function deployment. Based on the function tree, the method has the advantage of resulting an objective fault tree since the faults are defined as the opposite concept of functions. The fault tree construction of this work consists of the following steps: 1) definition of product primary function with the viewpoints of product operation and configuration, 2) construction of functional relation chart using a grouping algorithm, 3) abstraction of functional block diagram according to operation sequences and configuration of a product, 4) construction of function tree for each viewpoint, and 5) construction of fault tree by matching the function tree and simplification of the result.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.2
• /
• pp.57-68
• /
• 2004

We present a new parallel algorithm for extending the domain of a UOWHF. Our algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result [8], we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its prallelizability performance is less efficient than complete tree based constructions. However if l is getting larger then the parallelizability of the construction is also getting near to that of complete tree based constructions.tructions.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.155-164
• /
• 2016

For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.82-102
• /
• 2008

Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.257-263
• /
• 2001

In the analysis of product reliability, the fault tree is widely used since it shows the interrelations of the faults that lead to the product fault. A top-down approach based on experts’ experience is commonly used in the fault tree construction and the trees often take different forms depending on the intent of the analyst. In this work it is studied how to construct fault trees with the utilization of function trees obtained from analyzing the functions and sub-functions of products in order to suggest a generic way of fault tree construction. The function tree of a product is obtained by analyzing basic functions comprising the product main function in a bottom-up approach so that it enables to construct an objective fault tree. The fault tree for a scroll compressor is shown as an example.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.455-470
• /
• 2007

In phylogenetic tree construction the neighbor-joining algorithm is the most well known method which constructs a trivalent tree from a pairwise distance data measured by DNA sequences. The core part of the algorithm is its cherry picking criterion based on the tree structure of each quartet. We give a generalized version of the criterion based on the exact box model of quartets, known as the tight span of a metric. We also show by experiment why neighbor-joining and the quartet consistency count method give similar performance.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.91-99
• /
• 2006

The incremental parsing technique plays an important role in language-based environment which allows the incremental construction of a program. It improves the performance of a system by reanalyzing only the changed part of a program. The conventional incremental parsing uses the stack data structure in order to store the parsing information. In this paper, we suggest a threaded tree construction algorithm which parse by adding the threaded node address instead of using a stack data structure. We also suggest an incremental threaded tree construction which has incremental parsing process of five steps using the constructed threaded tree.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2007.04a
• /
• pp.101-104
• /
• 2007

As the proportion of underground construction increases, the impact of inappropriate selection of a underground construction method for a construction size increases. The purpose of this study is to develop an objective way of selecting an excavation method. There have been several attempts to achieve the same goal using various data mining methods such as the artificial neural network, the support vector machine, and the case-based reasoning. However, they focused only on the selection of a retaining wall construction method out of six types of retaining walls. When we categorized an underground construction work into four groups and added more number of independent variables (i.e., more number of construction methods), the predictability decreased. As an alternative, we developed a decision tree by analyzing 25 earthwork cases with detailed information. We implemented the developed decision tree as a computer-supported program called Dr. underground and are still in the process of validating and revising the decision tree. This study is still in a preliminary stage and will be improved by collecting and analyzing more cases.

• Korean Journal of Construction Engineering and Management
• /
• v.22 no.6
• /
• pp.76-86
• /
• 2021

Construction projects have high potentials of claims and disputes due to inherent risks where a variety of stakeholders are involved. Since disputes could cause losses in terms of cost and time, it is a critical issue for contractors to forecast and pro-actively manage disputes in advance in order to secure project efficiency and higher profits. The objective of the study is to develop a decision tree-based predictive analytics model for forecasting dispute types and their probabilities according to construction project conditions. It can be a useful tool to forecast potential disputes and thus provide opportunities for proactive management.