• Landscaping Tree
• /
• v.46 no.9_10
• /
• pp.22-25
• /
• 1998

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.24-30
• /
• 1993

When modeling a complex system we use an event tree to analyze propagation of failure. An event tree cannot represent the statistical interrelationships among parameters, but it can be represented as a statistically identical influence diagram so that parameter updating can be easily performed. After updating parameters we can calculate posterior distribution of the failure rate for each path. But exact distribution requires considerably complex numerical integration. We propose an approximation method to calculate the posterior and derive the predictive distribution of the time to next failure. Finally we introduce the system which implements our methodology.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.430-434
• /
• 2008

The group Steiner tree problem is a generalization of the Steiner tree problem that is defined as follows. Given a weighted graph with a family of subsets of nodes, called groups, the problem is to find a minimum weighted tree that contains at least one node in each group. We present some existing and some new formulations for the problem and compare the relaxations of such formulations.

• Journal of Korean Society for Quality Management
• /
• v.30 no.1
• /
• pp.152-161
• /
• 2002

The analysis of large data sets with hundreds of thousands observations and thousands of independent variables is a formidable computational task. A less parametric method, capable of identifying important independent variables and their interactions, is a tree structured approach to regression and classification. It gives a graphical and often illuminating way of looking at data in classification and regression problems. In this paper, we have reviewed and summarized tile methodology used to construct a tree, multiple trees and the sequential strategy for identifying active compounds in large chemical databases.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.63-69
• /
• 2006

To generate a multicast routing tree guaranteeing the quality of service (QoS), we consider the hop constrained Steiner tree problem and propose a new mathematical formulation for it, which contains fewer constraints than a known formulation. An efficient procedure is also proposed to solve the problem. Preliminary tests show that the procedure reduces the computing time significantly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.1004-1014
• /
• 2007

In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.6 no.6
• /
• pp.86-95
• /
• 2003

The object of this paper is to correct check the tree situation and quantity around highway. Also, those data utilize in order to establish plan about how to the long and short term landscape construction and maintain program. The result of this study can be summarized as follows; 1. Tree decrease rates for 8 branch offices were Jongbu(5.62%), Gangwon(4.32%), Chungcheong (3.35%), Honam(5.62%), Gyeongbuk(3.06%), Gyeongnam(5.60%), Seorak training center(0.31%), Headquarter(1.54%). Also decrease causes were traffic accidents(1.8%), air po11ution(4.7%), humid damage(0.9%), insect and disease(1.2%), wind and rainfall(3.4%), dry damage(3.5%), cold damage (1.0%), fire(3.1%), damage of the man and anima1(4.1%), remove bad tree(13.1%), bad rooting(9.5%) and etc.(53.7%). 2. Improve methods of tree death problems were regulation management(ferti1ize, irrigation and pesticide work), improvement of draining system, Pull out the weeds, Plant native plants, utilize organic matter fertilize and plant environment trees.

• Journal of Korean Society for Geospatial Information Science
• /
• v.5 no.2 s.10
• /
• pp.45-54
• /
• 1997

A mathodology to manage effectively urban open space using GIS(Geographic Information System) was developed to explore the methology of efficient urban open space management focusing on landscaped trees. Cartographic modeling technique was used for practical use of GIS as a case study of the Childeren's park in Kwangju city. First, spatial and attribute information for efficient landscaped tree management was acqired through the development of a tree management cartographic model. Second the information of location and the attribute of individual trees can be applied as a means of decision making in tree management. Thira optimal path of tree management and priority of management in work process of the selected urban open space could be determined according to the objective of park management.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.157-159
• /
• 2007

The conventional hard disk has been the dominant database storage system for over 25 years. Recently, hybrid systems which incorporate the advantages of flash memory into the conventional hard disks are considered to be the next dominant storage systems to support databases for desktops and server computers. Their features are satisfying the requirements like enhanced data I/O, energy consumption and reduced boot time, and they are sufficient to hybrid storage systems as major database storages. However, we need to improve traditional index node management schemes based on B-Tree due to the relatively slow characteristics of hard disk operations, as compared to flash memory. In order to achieve this goal, we propose a new index node management scheme called FNC-Tree. FNC-Tree-based index node management enhanced search and update performance by caching data objects in unused free area of flash leaf nodes to reduce slow hard disk I/Os in index access processes.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.385-392
• /
• 2011

A loop can take place in the process of managing tree topology for mobility management of mobile nodes in infrastructure-based mobile ad hoc networks. The formation of a loop degrades an effective bandwidth of the wireless network by passing an identical message repeatedly within the same loop. Therefore, the loop should be resolved to revert the system back to the normal state. In this paper, we propose a simple and novel mechanism that detects and resolves a loop quickly by tracking the depth of trees. The mobility management approach that employs the loop resolution method is evaluated comparatively with the original tree-based one and the hybrid one. It is shown that the proposed approach far outperforms the other approaches, and it is robust against the rapid changes in network topology.