• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.214-216
• /
• 2002

본 논문에서는 many-to-many IP 멀티캐스팅을 위한 효율적인 Backbone Core Tree(BCT)생성 알고리즘에 대하여 제안한다. 본 논문의 제안기법은 Core Based Tree(CBT)에 기반을 두고 있다. CBT는 공유 트리를 이용하여 멀티캐스트 자료를 전달하기 때문에 Source Based Tree에 비하여 각 라우터가 유지해야 하는 상태 정보의 양에 적고 적용하기 간단하지만, Core 라우터 선택의 어려움과 트래픽이 Core로 집중되는 문제점을 가지고 있다. 이에 대한 보완책으로 Backbone Core Tree기법이 제안되었는데, 본 논문에서는 주어진 네트워크 위상 그래프에서 최소신장 트리를 만들고, 센트로이드를 이용하여 효율적인 BCT를 생성하는 알고리즘을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.171-173
• /
• 1999

공간 데이터베이스에서 사용되는 데이터는 그 양이 방대하고 복잡하여 이를 효율적으로 저장, 관리하는 색인이 필요하다. 여러 공간 색인 방법들 중에서 R-tree는 삽입과 삭제가 빈번히 발생하는 동적인 환경에서 효율적인 질의 성능을 보이는 것으로 알려져 있다. R-tree는 삽입되는 데이터의 순서에 따라 트리의 구조가 달라질 수 있는데, 주어진 데이터가 수정이 자주 발생하지 않는다며 데이터 입력 순서를 결정하여 질의 성능이 가장 좋은 트리를 구성할 수 있다. 본 논문에서는 데이터가 자주 수정되지 않는 환경에서 노드간의 중첩을 가장 최소화 할 수 있는 데이터 입력 순서를 결정하기 위해 클러스터링을 이용한 새로운 방법인 CSR-tree를 제안하고자 한다. CSR-tree는 일반 R-tree와 hilbert packed R-tree 방법보다 향상된 질의 성능을 보인다.

• The Korean Journal of Ecology
• /
• v.22 no.2
• /
• pp.65-68
• /
• 1999

In December-January of 1996-1997 and 1997-1998, information was gathered about vertical distribution of foraging sites of tits in 34 flocks in coniferous and deciduous forests. There was a significant effect of forest type on the distribution of foraging sites of each species. Habitat was classified into 5 height layers vertically: ground, bushes (usually＜1.5 m, up to 3 m), tree layer 1 (up to 1/3 of tree height), tree layer 2 (1/3-2/3 tree height). and tree layer 3 (＞2/3 tree height). There were differences among species: great tit (Parus major) foraged mostly on the ground, coal tit (P. ater) and long-tailed tit (Acrocephalus caudatus) - on the highest tree layer, marsh tit (P. palustris) was often seen on bushes, and varied tit (P. varius) - in tree layer 2. Smaller species used upper and outer parts of trees. suggesting that, like in most other similar studies. larger dominant species prevented smaller species from using inner parts of trees.

• Textile Coloration and Finishing
• /
• v.22 no.4
• /
• pp.306-313
• /
• 2010

To achieve color diversification of natural dyeing, color mixture dyeing with Indigo and Japanese pagoda tree is applied to wool and silk fabrics. After dyeing with Japanese pagoda tree extract solution of 5~25%(o.w.f.), the indigo dyeing was carried out up to four times. Alternatively after repeat dyeing with indigo one to seven times, the dyeing with Japanese pagoda tree extract solution was applied in 5 steps(5~25%). In color mixture dyeing, the dye uptake of wool fabrics appears higher than that of silk. The sequence of Japanese pagoda tree extract dyeing after Indigo dyeing was generally higher dye uptake compared with that of Indigo dyeing after Japanese pagoda tree extract dyeing. For wool and silk fabric, the pre-dyeing with Japanese pagoda tree solution was more effective for color diversification but the pre-dyeing with Indigo was more effective for the exhibition of intermediate color shade.

• Journal of the Korean Society of Safety
• /
• v.30 no.3
• /
• pp.100-106
• /
• 2015

A module or independent subtree is a part of a fault tree whose child gates or basic events are not repeated in the remaining part of the fault tree. Modules are necessarily employed in order to reduce the computational costs of fault tree quantification. This quantification generates fault tree solutions such as minimal cut sets, minimal path sets, or binary decision diagrams (BDDs), and then, calculates top event probability and importance measures. This paper presents a new linear time algorithm to detect modules of large fault trees. It is shown through benchmark tests that the new method proposed in this study can very quickly detect the modules of a huge fault tree. It is recommended that this method be implemented into fault tree solvers for efficient probabilistic safety assessment (PSA) of nuclear power plants.

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

• MALSORI
• /
• no.45
• /
• pp.117-126
• /
• 2003

Decision tree-based state tying has been proposed in recent years as the most popular approach for clustering the states of context-dependent hidden Markov model-based speech recognition. The aims of state tying is to reduce the number of free parameters and predict state probability distributions of unseen models. But, when doing state tying, the size of a decision tree is very important for word independent recognition. In this paper, we try to construct optimized decision tree based on the average of feature vectors in state pool and the number of seen modes. We observed that the proposed optimal decision tree is effective in predicting the state probability distribution of unseen models.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.41-44
• /
• 2008

In this paper, major species of tree were discriminated in compartment by using LiDAR data and optic imagery. This is an important work in forest field. A current digital stock map has created the aerial photo and collecting survey data. Unlike high resolution imagery, LiDAR data is not influenced by topographic effects since it is an active sensory system. LiDAR system can measure three dimension information of individual tree. And the main methods of this study were to extract reliable the individual tree and analysis techniques to facilitate the used LiDAR data for calculating tree crown 2D parameter. We should estimate the forest inventory for calculating parameter. 2D parameter has need of area, perimeter, diameter, height, crown shape, etc. Eventually, major species of tree were determined the tree parameters, compared a digital stock map.

• Journal of the Korean Society of Safety
• /
• v.15 no.1
• /
• pp.100-105
• /
• 2000

Correlation between propagation of bush-type electrical tree and internal partial discharges(PD) was discussed. We used specimens with needle-plane electrode system made of LDPE(Low Density Polyethylene), observed inception and propagation of electrical tree by optical microscope interfaced with computer and investigated characteristics of phase resolved PD pulses accompanying with propagation of electrical tree. Electrical tree generally growed bush-type tree. PD data detected and analyzed were average discharge current and statistical operator of q-n, $\psi$- $q_{avg}$, $\psi$-n, ${\psi}-q_{max}$ distribution. Parameters used were skewness, kurtosis, average discharge phase, cross-correlation factor, asymmetry and etc. In generally, average discharge current had good linear relationship with propagation of bush type electrical tree on this experiment. Peak discharge magnitude and repetition rate were increased, but they had not good linear relationship.p.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.358-364
• /
• 2007

This paper suggests MPLS restoration method that use an aggregation tree. For the restoration of the MPLS network, this paper presents a scheme that reconstruct multiple path through aggregation tree that grow from many node to a target node. Contrary to a multicast tree where a message that send at one node is passed to a group of node, an aggregation tree is a tree that data is passed from many node to one destination node. Through an experiment we confirmed that the restoration scheme that uses aggregation tree shows taster speed comparing with the existing other restoration scheme.