• Journal of Korean Society of Forest Science
• /
• v.104 no.4
• /
• pp.527-535
• /
• 2015

With results from previous Korean studies on forest thinning, we conducted a meta-analysis on the effect of thinning on diameter at breast height (DBH) growth and carbon (C) stocks (tree, litter layer, coarse woody debris (CWD), and soils) in Korean forests. Thinning increased the DBH growth and the C stocks in soils by 39.2% and 12.8%, respectively, while it decreased the C stocks in tree by 30.9%. In contrast, thinning had no significant effect on the C stocks in litter layer and CWD. The DBH growth and the C stocks in tree showed significant correlations with thinning intensity and recovery time. The C stocks in litter layer correlated with recovery time while those in CWD and soils did not show significant correlation neither with thinning intensity nor with recovery time. Regression models of the DBH growth and the C stocks in tree were developed to quantify the effect of thinning intensity and recovery time. An integration of the regression model of the tree C stock into forest carbon models is expected to be essential to quantify the effect of thinning on the C stocks in litter layer, CWD, and soils. We also suggested expansion of study species, long-term and frequent monitoring, and investigation on understory vegetation in order to elucidate changes in Korean forests following thinning practices.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.128-130
• /
• 2000

B+-Tree는 데이트베이스 관리 시스템에서 대용량의 데이터를 관리하기 위해 가장 널리 사용되는 인덱스이다. 그런 기존의 B+-Tree는 데이터베이스의 초기 구성 및 재구성시 많은 비용이 들고, 또한 삭제 연산의 빈번한 발생시 색인 구조 변경연산의 발생빈도가 높아져 동시성이 떨어진다는 단점이 있다. 이러한 문제점을 해결하기 위해서 기존 대부분의 데이터베이스 관리시스템에서는 일괄구성과 지연삭제를 이용하고 있으나, 동시성 및 회복에 대한 처리가 미흡하여 실제 시스템에 적용하기에는 문제가 있다. 따라서 본 논문에서는 일괄구성과 지연삭제 방법을 적용한 B+-Tree에서의 동시성 및 회복기법을 제안한다. 제안된 기법은 일괄구성 시에 잠금의 부하와 연속적인 철회(Cascade Rollback)가 없고, 또한 지연 삭제기법을 확장함으로써 빈 페이지 리스트 관리에 대한 부하가 없으며, 삭제 연산에 대한 회복 시 논리적 복귀(Logical Undo)가 빨라지고 구현이 간단해진다는 장점이 있다.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.5
• /
• pp.243-248
• /
• 2013

Reliability evaluation is important task in embedded system. It can avoid potential failures and manage the vulnerable components of embedded system effectively. Dynamic fault tree analysis is one of the reliability evaluation methods. It can represent dynamic characteristics of a system such as fault & error recovery, sequence-dependent failures. In this paper, the steering system, which is embedded system in vehicles, is represented using dynamic fault tree. We evaluate the steering system using approximation algorithm based on Simpson's rule. A set of simulation results shows that proposed method overcomes the low accuracy of classic approximation method without requiring no excessive calculation time of the Markov chain method.

• ETRI Journal
• /
• v.27 no.1
• /
• pp.1-12
• /
• 2005

We propose a heuristic buffer management scheme that uses both positive and negative acknowledgments to provide scalability and reliability. Under our scheme, most receiver nodes only send negative acknowledgments to their repair nodes to request packet retransmissions while some representative nodes also send positive acknowledgments to indicate which packets can be discarded from the repair node's buffer. Our scheme provides scalability because it significantly reduces the number of feedbacks sent by the receiver nodes. In addition, it provides fast recovery of transmission errors since the packets requested from the receiver nodes are almost always available in their buffers. Our scheme also reduces the number of additional retransmissions from the original sender node or upstream repair nodes. These features satisfy the original goal of treebased protocols since most packet retransmissions are performed within a local group.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.18-29
• /
• 2016

In this paper, we discuss the issues of providing protection for point-to-multipoint connections in both Ethernet and MPLS-TP-based packet transport networks. We introduce two types of per-leaf protection-linear and ring. Neither of the two types requires that modifications to existing standards be made. Their performances can be improved by a collective signal fail mechanism proposed in this paper. In addition, two schemes - tree protection and hybrid protection - are newly proposed to reduce the service recovery time when a single failure leads to multiple signal fail events, which in turn places a significant amount of processing burden upon a root node. The behavior of the tree protection protocol is designed with minimal modifications to existing standards. The hybrid protection scheme is devised to maximize the benefits of per-leaf protection and tree protection. To observe how well each scheme achieves an efficient traffic recovery, we evaluate their performances using a test bed as well as computer simulation based on the formulae found in this paper.

• Korean Journal of Environment and Ecology
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2002

This study was carried out to examine the tree-ring growth characteristics of Pinus thunbergii Parl. after replanting on the reclaimed land from the sea in Kwangyang bay, The factors, mostly affecting the growths of Pinus thunbergii Parl. , were the replanting stress and drought. The growth reduction due to replanting occurred in the replanting year and following year, but that due to drought after 2-3 years of replanting. The growth recovery after replanting differed with soil condition. The sites showing fast recovery were the covered ground of improve soil, the ground of medium mounding, the top and the slope ground of big mounding sites. The filled ground of improve soil and the lower ground of big mounding sites showed retarded growths. The mean sensitivity(year-to-year variation) and the coefficient of variation(tree-to-tree variation in a certain year) in tree rings of Pinus thunbergii Parl. were higher in the poor soil sites than in the favourable soil ones. The physical characteristics of the soil, especially soil hardness, were the most crucial. The mean sensitivity and the coefficient of variation were also low in the salty soil environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.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.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.14 no.2
• /
• pp.1-10
• /
• 2011

Six pine trees (Pinus densiflora S. et Z.) at the Euilimji Lake Park in Jecheon were collected to investigate tree ages, growth decline pattern and the years of death. Tree-ring measurement was carried out using the Lintab with a resolution of 0.01mm. Tree age were 80-176 years. Cross-dating between the tree-ring series of each tree and the local chronology from Worak Mountain resulted that four and two trees died in 1998 and 1999, respectively. Three dead trees had only formed earlywood in the outermost tree ring and the others had incomplete latewood. Therefore, it was proven that the former trees died between spring and early summer, whereas the later ones died during late summer and/or autumn. The simultaneous deaths of trees suggest the insect damage and/or drought may be the crucial reason of the death, but frequent reaction woods, which were formed by leaning stem, and scars formed by physical damage may also contribute to the death.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.792-802
• /
• 2006

In this paper, we propose an energy-efficient proactive data dissemination protocol with relatively low delay to cope well with highly mobile sink environments in sensor networks. In order for a dissemination tree to continuously pursue a dynamic sink, we exploit two novel algorithms: forward sink advertisement and distributed fast recovery. In our protocol, the tree is shared with the other slave sinks so that we call it Dynamic Shared Tree (DST) protocol. DST can conserve considerable amount of energy despite maintaining robust connection from all sources to sinks, since tree maintenance of DST is accomplished by just distributed local exchanges. In addition, since the DST is a kindof sink-oriented tree, each source on the DST disseminates data with lower delay along the tree and it also facilitates in-network processing. Through simulations, it is shown that the presented DST is considerably energy-efficient, robust protocol with low delay compared to Directed Diffusion, TTDD, and SEAD, in highly mobile sink environment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.4
• /
• pp.77-89
• /
• 2001

Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.