• 조경수
• /
• 제46권9_10호
• /
• pp.22-25
• /
• 1998

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1993년도 추계학술대회발표논문집; 서강대학교, 서울; 25 Sep. 1993
• /
• 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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• 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.

• 품질경영학회지
• /
• 제30권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
• /
• 제12권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.

• 한국통신학회논문지
• /
• 제32권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.

• 한국환경복원기술학회지
• /
• 제6권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.

• 대한공간정보학회지
• /
• 제5권2호
• /
• pp.45-54
• /
• 1997

도시녹지공간의 수목은 체계적이고, 신속한 관리를 함으로써 인간에게 더 많은 혜택을 부여한다. 현재 도시 녹지공간에 있어서의 수목관리의 방법론적인 방안을 고려해 볼 때 수목관리의 유지관리를 위한 자료의 수집과 처리, 첨단 System을 활용한 관리체계가 극히 미흡한 실정이다. 이를 위해서는 먼저 녹지자원 관리를 위한 효율적이고 체계적인 자료의 수집 및 처리와 합리적인 분석과정이 필요하며 그 다음으로 이러한 자료를 토대로 하여 적절한 도시녹지공간에 있어서의 수목관리를 효율적으로 처리할 수 있는 시스템과 그 활용이 필요하다. 이러한 시스템으로 본 연구에서는 최근 여러 분야에서 이용되고 있는 GIS을 이용하여 도시녹지관리모델을 제시하고 이를 통하여 그 효율성을 극대화하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• 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
• /
• 제13권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.