• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.401-406
• /
• 2000

Fault tree analysis (FTA) is a widely used methodology for reliability analysis. The method is useful in that it suggests a very comprehensive way of describing the hierarchical relations of causes of faults and the corresponding results. However it is difficult to get appropriate fault trees for given products or systems without very profound knowledge and experience. This work aims to develop a methodology of fault tree construction using the results of function deployment for machine parts, which provides an objective way of preparing fault trees. The failure modes are defined to each function network generated by the function deployment method and the fault tree with respect to each viewpoint is constructed by arranging the failure modes. The fault tree is finally obtained by synthesizing the fault trees with respect to each viewpoint. The example of fault tree construction is also shown.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.29 no.2
• /
• pp.68-76
• /
• 2001

The purpose of this study is to computerize street tree management using a CAD program in order to manage the drawing record of street trees systematically and concurrently. The configuration of this program is composed of Reference Data, Data Inquiry, and Cost Assessment. The Reference Data includes characteristics of trees, monthly managements records, damage by blight and insects and usage of pesticides. The Data Inquiry includes an individual search of the tree index, simple searches and multiple searches. The Cost Assessment includes two main components, the data input with labor cost, manure ocst and pesticide cost and the assesment of management cost for prevention of blight and insects, pruning and fertilization. The results of this study are as follows: 1) When there are practices such as transplanting and removing of street trees it is immediately updated with the various situation. By creating an in progress a tree management system, up to the date information can be given to the manager for decision making. 2) To identify individual tree at the site or in drawing, the street name and numbers were used instead of coordinates. Tree tags are attached to the street trees individually. It can make DB management simple and easy. 3) By doing simple or multiple search with constructed DB, data can be provided quickly. 4) The result of this type of search are useful in the assessment of management cost very useful in regards to items such as the pruning, pesticides scattering and fertilization. 5) By using the AutoCAD software and existing PC without purchasing new equipment, the cost of system implementation can be minimized.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.21 no.1
• /
• pp.133-143
• /
• 2018

In spite of the growing importance of landscaping trees, the rate of flawed and withered trees damaged by pest, disease, drought or frost is increasing. In order to evaluate the performance of the Tree Protective Pad, which are developed to reduce the failure ratio in landscape planting, the tree protective pad for 'digging', 'pest controlling', and 'insulating' are tested based on the five functional criteria; moisturizing effect, wither preventive effect, pest and disease control, thermal effect, tensile strength, and environmental performance. The result of this study is as follows. The moisturizing effect of the tree protective pad for digging is found to be outstanding. According to the result of testing the pad on trees, in particular, it is better than jute tape in wither preventive effect, which means it is expected to prevent flaw and wilt from planting during the improper seasons like summertime. The experiment of installing the protective tree pad for pest controlling to the trunk of Quercus mongolica shows that preventive effect of the pad from diseases and insects is superior, and it also has economical effect by reducing the use of agricultural chemicals. The comparative test of the pad for insulating and jute tape proves that the temperature of the pad is about $2^{\circ}C$ higher than outside. The rate of tensile strength and biodegradation of the pad exceeds the optimal level, so it is revealed that the pad may be the work efficient and environment-friendly product. Likewise, by timely irrigating trees, the tree protective pad economically prevents trees from pest, disease,drought or frost, which may be caused by improper seasonal or delayed planting. As a means of reducing the flaw and facilitating the growth of trees, the exceptional performance of the pad is expected to effectively used in landscape planting and management.

• 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.

• The Korean Journal of Quaternary Research
• /
• v.21 no.1
• /
• pp.15-26
• /
• 2007

A wide tree-ring data network from Western Himalayan region as well as from Central and Peninsular India have been established by the Indian Institute of Tropical Meteorology (IITM), Pune, India. This includes several ring width and density chronologies of Himalayan conifers (Pinus, Picea, Cedrus, Abies)covering entire area of Western Himalaya and teak (Tectona grandis L.F.) from central and peninsular India. Many of these chronologies go back to $15^{th}$ century. Tree-ring based reconstructed pre-monsoon (March-April-May) summer climate of Western Himalaya do not show any significant increasing or decreasing trend since past several centuries. High altitude tree-ring chronologies near tree line-glacier boundary are sensitive to the winter temperature. Unprecedented higher growth in recent decades is closely associated with the warming trend over the Himalayan region. Dendroclimatic analysis of teak (Tectona grandis) from Central and Peninsular India show significant relationship with pre-monsoon and monsoon climate. Moisture index over the region indicates strong association with tree-ring variations rather than the direct influence of rainfall. It is evident that, two to three consecutive good monsoon years are capable of maintaining normal or above normal tree growth, even though the following year is low precipitation year.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.365-371
• /
• 2015

CB tree represents the binary trie by a compact binary sequence. However, retrieval time grows fast since the more keys stored in the trie, longer the binary sequences are. In addition it is inefficient for frequent key insertion/deletion. HCB tree is a hierarchical CB tree consisting of small binary tries. However it can not avoid shift operations and have to scan an additional table to refer child or parent trie. In order to improve retrieval performance and avoid shift operations when keys are inserted or deleted, we in this paper represent each separated trie by a full binary trie and then assign the unique identifier to it. Finally the theoretical evaluations show that both the proposed approach and HCB tree provides better than CB tree for key retrieval. The proposed approach shows the highest performance in case of key insertion/deletion and moreover requires only 71%~89% of storage as compared with CB tree.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.749-754
• /
• 2014

In this paper, we suggest tree-structure-aware GP (Genetic Programming) operators that heed tree distributions in structure space and their possible structural difficulties. The main idea of the proposed GP operators is to place the generated offspring of crossover and/or mutation in a specified region of tree structure space insofar as possible by biasing the tree structures of the altered subtrees, taking into account the observation that most solutions are found in that region. To demonstrate the effectiveness of the proposed approach, experiments on the binomial-3 regression, multiplexor and even parity problems are performed. The results show that the results using the proposed tree-structure-aware operators are superior to the results of standard GP for all three test problems in both success rate and number of evaluations.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.27 no.4
• /
• pp.143-150
• /
• 1999

The purpose of this research is to find som ways to model tree forms more efficiently in reference with surveying structural data and handling parameters in plant Editor of AccuRender, the AutoCAD-based rendering software adopting the procedural plant modeling technique. In case of modelling a new tree, because it is efficient to modify an existing tree data as a template, we attempted to classify 81 species' data from existing plant library including conifers and deciduous tree. According to the qualitative characteristics and quantitative parameters of geometrical and branching structure, 8 types of tree form were classified with factor and cluster analysis. Some critical aspects found in the distributions of standardized scores of parameters in each type were discussed for explaining the tree forms intuitively. For adaptability of the resulted classification and typical parameters, 10 species of tree were measured and modelled, and proved to be very similar to the real structures of tree forms. CG or CAD-based plant modelling technique would be recommended not only as a presentation tool but for planting design, landscape simulation and assessment.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.65-75
• /
• 2005

Moving-objects databases should efficiently support database queries that refer to the trajectories and positions of continuously moving objects. To improve the performance of these queries. an efficient indexing scheme for continuously moving objects is required. To my knowledge, range queries on current positions cannot be handled by the 3D R-tree and the TB-tree. In order to handle range queries on current and past positions. I modified the original 3D R-tree to keep the now tags. Most of spatio-temporal index structures suffer from the fact that they cannot efficiently process range queries past positions of moving objects. To address this issue. we propose an access method, called the Tagged Adaptive 3DR-tree (or just TA3DR-tree), which is based on the original 3D R-tree method. The results of our extensive experiments show that the Tagged Adaptive 3DR-tree outperforms the original 3D R-tree and the TB-tree typically by a big margin.

• Communications for Statistical Applications and Methods
• /
• v.18 no.6
• /
• pp.809-816
• /
• 2011

A tree-indexed autoregressive(AR) process is a time series defined on a tree which is generated by a branching process and/or a deterministic splitting mechanism. This short article is concerned with conditional heteroscedastic structure of the tree-indexed AR models. It has been usual in the literature to analyze conditional mean structure (rather than conditional variance) of tree-indexed AR models. This article pursues to identify quadratic conditional heteroscedasticity inherent in various tree-indexed AR models in a unified way, and thus providing some perspectives to the future works in this area. The identical conditional variance of sisters sharing the same mother will be referred to as the branching heteroscedasticity(BH, for short). A quasilikelihood but preliminary estimation of the quadratic BH is discussed and relevant limit distributions are derived.