• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.327-338
• /
• 2010

Complete Subtree scheme(CS) is a well known broadcast encryption scheme to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message overhead in transmitting key material. We propose a Merged Complete Subtree scheme(MCS) to reduce the communication overhead. It is more practical to make broadcast encryption schemes in network environments with limited bandwidth resources. We define all possible subset unions for ever two subsets of CS as new subsets having own key. The modification causes more storage overhead. Nevertheless, it is possible to make the size of a header, including key materials, half using subset unions of MCS, because the size of a header depends on the number of used subsets. Our evaluation therefore shows that the proposed scheme significantly improves the communication overhead of CS, reducing by half the rekey communication cost. The proposed scheme has the advantage of rekey communication cost when the number of revoked users is significant percentage of the number of potential users. The proposed scheme is fully collusion resistant.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.6
• /
• pp.235-242
• /
• 2021

In this work, we develop a Korean dependency parser based on a stack-pointer network that consists of a pointer network and an internal stack. The parser has an encoder and decoder and builds a dependency tree for an input sentence in a depth-first manner. The encoder of the parser encodes an input sentence, and the decoder selects a child for the word at the top of the stack at each step. Since the parser has the internal stack where a search path is stored, the parser can utilize information of previously derived subtrees when selecting a child node. Previous studies used only a grandparent and the most recently visited sibling without considering a subtree structure. In this paper, we introduce graph attention networks that can represent a previously derived subtree. Then we modify our parser based on the stack-pointer network to utilize subtree information produced by the graph attention networks. After training the dependency parser using Sejong and Everyone's corpus, we evaluate the parser's performance. Experimental results show that the proposed parser achieves better performance than the previous approaches at sentence-level accuracies when adopting 2-depth graph attention networks.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.877-895
• /
• 2010

The state-of-the-art techniques of storing XML data, modeled as an XML tree, are node-based in the sense that they are centered around XML node labeling and the storage unit is an XML node. In this paper, we propose a generalization of such techniques so that the storage unit is an XML subtree that consists of one or more nodes. Despite several advantages with such generalization, a major problem would be inefficiency in XPath processing where the stored subtrees are to be parsed on the fly in order for the nodes inside them to be accessed. We solve this problem, proposing a technique whereby no parsing of the subtrees involved in XPath processing is needed at all unless they contain the nodes of the final query result. We prove that the correctness of XPath processing is guaranteed with our technique. Through implementation and experiments, we also show that the overhead of our technique is acceptable.

• Korean Journal of Environmental Biology
• /
• v.18 no.1
• /
• pp.69-75
• /
• 2000

The vegetation structure and soil characteristics in Koelreuteria paniculata communities of Taean-Gun and Anmyondo were studied. The Koelreuteria paniculata community in Anmyondo had two vegetation layers, lower-tree and herb layers, but the Koelreuteria paniculata community in Anmyondo had three vegetation layers, subtree, shrub, and herb layers. Also the Koelreuteria paniculata was only the species of subtree layers in the Koelreuteria paniculata community of Anmyondo, but the subtree layer in the Koelreuteria paniculata community of Taean-Gun consisted of Pinus thunbergii, Cornus walteri, Celtis jessoensis, Celtis sinensis, and Evodia danielii. The soil organic matter, total N, available P, CEC, and exchangeable K, Ca, Mg, and Na concentrations were greater in the two Koelreuteria paniculata community than in the adjacent forest. The range of soil pH in the two Koelreuteria paniculata communities were 6.3-7.0, but those in adjacent forests were 4.7-5.5. [Dierssen scale, Vegetation classification, Forest soil] .

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.6 no.3
• /
• pp.196-203
• /
• 2004

The study of site characteristics and vegetation structure was carried out to provide basic data for conservation and reasonable management of Korean endemic Corylopsis coreana communities in Jukgok and Ogok-myeon in Gokseong, Jeonnam Province. In C. coreana communities, average soil pH was 5.05, and the content of organic matter, total N and available P was 5.22%, 0.24% and 3.25ppm, respectively. According to the importance value of each layer, Pinus densiflora, uercus variabilis of Jukgok and uercus mongolica, serrata, and Pinus densiflora of Ogok area in the tree layer were high. In the subtree and shrub layer at two study sites, C. coreana has the highest importance value. In subtree layer at the two study sites, species diversity, evenness and dominance ranged from 0.567 to 0.779, 0.401 to 0.509 and 0.491 to 0.509, respectively. The distribution patterns by Morisita's index showed that C. coreana in two study sites was randomly distributed in the subtree and shrub layers.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.33-41
• /
• 2021

This paper proposes heuristic greedy algorithm that can be find the solution within polynomial time with solution finding rule for the capacitated minimum spanning tree(CMST) problem, known as NP-hard. The CMST problem can be solved by computer-aided meta-heuristic because of the Esau-Williams heuristic polynomial time algorithm has a poor performance. Nevertheless the meta-heuristic methods has a limit performance that can't find optimal solution. This paper suggests visual by handed solution-finding rule for CMST. The proposed algorithm firstly construct MST, and initial feasible solution of CMST from MST, then optimizes the CMST with the subtree gates more adjacent to root node. As a result of total 30 cases of OR-LIB 10 data, Q=3,5,10, the proposed algorithm gets the best performance.

• Journal of Climate Change Research
• /
• v.9 no.3
• /
• pp.293-302
• /
• 2018

This study was carried out to provide basic information on efficient preservation and management of an Abies koreana forest through analyzing the ecological characteristics by slope in Seseok, Mt. Jirisan. Soil moisture content at southern and northern slopes was 29.9% and 21.7%, respectively, and there was no significant difference among soil properties between southern and northern slopes. The importance value of A. koreana in the southern and northern slopes was high for tree and subtree layers, respectively. It is noteworthy that many seedling and saplings of A. koreana were present on the southern slope. The species diversity was 0.413 for the tree layer, 0.632 for the subtree layer, and 0.609 for the shrub layer on the southern slope and 0.396 for the tree layer, 0.783 for the subtree layer, and 1.215 for the shrub layer on the northern slope. Evenness and dominance ranged from 0.371 to 0.609 and 0.629 to 0.391 on the southern slope and from 0.380 to 0.968 and 0.620 to 0.032 on the northern slope, respectively. The mortality of A. koreana was 9.6% on the southern slope and 24.4% on the northern slope, a distinct difference between the slopes. The mortality type at two slopes was the highest proportion of standing dead. Annual mean tree ring growth of A. koreana on the southern slope (1.76 mm/yr) was higher than that on the northern slope (1.64 mm/yr).

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.65-78
• /
• 2009

The most commonly adopted approach to find valuable information from tree data is to extract frequently occurring subtree patterns from them. Because mining frequent tree patterns has a wide range of applications such as xml mining, web usage mining, bioinformatics, and network multicast routing, many algorithms have been recently proposed to find the patterns. However, existing tree mining algorithms suffer from several serious pitfalls in finding frequent tree patterns from massive tree datasets. Some of the major problems are due to (1) modeling data as hierarchical tree structure, (2) the computationally high cost of the candidate maintenance, (3) the repetitious input dataset scans, and (4) the high memory dependency. These problems stem from that most of these algorithms are based on the well-known apriori algorithm and have used anti-monotone property for candidate generation and frequency counting in their algorithms. To solve the problems, we base a pattern-growth approach rather than the apriori approach, and choose to extract maximal frequent subtree patterns instead of frequent subtree patterns. The proposed method not only gets rid of the process for infrequent subtrees pruning, but also totally eliminates the problem of generating candidate subtrees. Hence, it significantly improves the whole mining process.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.15 no.2
• /
• pp.77-84
• /
• 2012

This study suggested the planting model of Zelkova serrata communities in the areas with the warmth index of both 80~100 and $100{\sim}120^{\circ}C{\cdot}month$. Warmth index was calculated with 449 weather points using inverse distance weighted interpolation method. The planting species were selected by correlation analysis between Z. serrata and each species of four or more frequency among the 36 relev$\acute{e}$ surveyed for this study. The result of this study is summarized as follows : Warmth index of Z. serrata communities was among $74{\sim}118^{\circ}C{\cdot}month$. Results of the correlation analysis between Z. serrata and each species observed that the Z. serrata belongs to the tree layer with warmth index of 80~100 and $100{\sim}120^{\circ}C{\cdot}month$. On the other hand, the species of Carpinus laxiflora, Quercus serrata, Prunus sargentii and Platycarya strobilacea appeared only in the tree layer with warmth index of $80{\sim}100^{\circ}C{\cdot}month$. Z. serrata and Styrax japonica appeared in the subtree layer with the warmth index of 80~100 and $100{\sim}120^{\circ}C{\cdot}month$, while Acer pseudosieboldianum, Lindera erythrocarpa, Acer mono, Quercus serrata, etc. appeared in the subtree layer with the warmth index of $80{\sim}100^{\circ}C{\cdot}month$. Z. serrata, Ligustrum obtusifolium, Lindera obtusiloba, Callicarpa japonica and Zanthoxylum schinifolium all appeared in the shrub layer with the warmth index of 80~100 and $100{\sim}120^{\circ}C{\cdot}month$. Lindera erythrocarpa, Orixa japonica, Staphylea bumalda, Akebia quinata and Sorbus alnifolia appeared in the shrub layer with the warmth index of $80{\sim}100^{\circ}C{\cdot}month$ and Styrax japonica and Stephanandra incisa appeared in the shrub layer with the warmth index of $100{\sim}120^{\circ}C{\cdot}month$, The numbers of each species planted in a $100m^2$ area of the Z. serrata community were suggested as follows : five in tree layer, five in subtree layer and nine in shrub layer. The average area of canopy are suggested to be about $86m^2$ for tree layer, $34m^2$ for subtree layer and $34m^2$ for shrub layer.