• Journal of Korean Society of Forest Science
• /
• v.108 no.3
• /
• pp.372-381
• /
• 2019

This study was conducted to find proof for the hypothesis that the God tree of Chosun has been misrepresented in Chosun-Gersu-Nosu-Myungmokji (CGNM). The following results were obtained. First, it was established that 64 species and 3170 trees were recorded in CGNM. An old, big tree is classified as a God tree if linked to it there are testimonies and legends about divine elements, and it is classified as a Noble tree if linked to it there are testimonies and legends of historical elements. In total, 2632 trees of eight species were analyzed, from the Zelkova serrata, which has the greatest number of trees, to the eighth most frequent, Abies holophylla. The means of diameter at breast height (DBH), height, and age of the God and the Noble trees were calculated for each of the eight species. In seven out of eight species, the DBH and age of the Noble tree were more than those of the God tree. In addition, the height of the Noble tree was more than that of the God tree in six out of eight species. The fact that the God tree is smaller than the Noble tree, contrary to the common expectation that the Noble tree is a small size tree, was confirmed. This hypothesis was proved by the data gathered. Second, the Japanese Government-General of Korea has pursued a policy to defeat the village ritual based on the God tree being linked with superstition. For such a policy, the God tree should be small and unattractive, and it would have been good for the tree to be superstitious. The CGNM was created as explanatory material or evidence for distorting the sacredness of the God tree of Chosun. Third, CGNM compiled a chronological order of DBH data to make it easy to explain the fabricated facts that the God tree of Chosun is smaller and dwarfed compared to the Noble tree.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.4
• /
• pp.981-987
• /
• 2017

Proliferation of cloud computing services brings about reduction of the maintenance and management costs by allowing data to be outsourced to a dedicated third-party remote storage. At the same time, the majority of storage service providers have adopted a data deduplication technique for efficient utilization of storage resources. When a hash tree is employed for duplicate identification as part of deduplication process, size information of the attested data and partial information about the tree can be deduced from eavesdropping. To mitigate such side channels, in this paper, a new duplicate identification method is presented by exploiting a multi-set hash function.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.1-4
• /
• 2009

In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

• Journal of Environmental Science International
• /
• v.31 no.7
• /
• pp.579-592
• /
• 2022

Much controversy has been generated over whether the ecological restoration project in Korea is faithful to the basic approach of ecological restoration compared to projects aimed at creating parks or green spaces. This study was aimed at understanding the level of awareness of practitioners in the planting design method, which is recognized as relatively important in landscape architecture and ecological restoration. The proficiency of practitioners in planting design techniques for ecological restoration projects was investigated and analyzed in seven areas: overall planting design awareness, plant species selection method, planting tree sizes, planting density, use of native species, vegetation climatic zone, soil environment, and weed control. There was no statistically significant difference between the group who thought they were experts in the field of ecological restoration and the group who thought they were experts in the field of parks and green spaces. Moreover, there was no statistically significant difference between the degree of work performance, that is, the group whose main industry was ecological restoration, the group that performed relatively more ecological restoration work, and the group that rarely performed it. Therefore, to apply desirable ecological restoration techniques in the future and to clearly differentiate between the approach in the field of parks and green spaces, the appropriate tree size or planting density selected in the ecological restoration planting design stage must be chosen. To this end, the awareness of expert groups must be improved and related laws, systems, and guidelines must be revised.

• Journal of Forest and Environmental Science
• /
• v.38 no.4
• /
• pp.275-283
• /
• 2022

A study was designed to investigate the pattern of sexual dimorphism in a plantation of Garcinia kola. Twenty trees were randomly selected for the study and have been observed to flower regularly. A total of 100 inflorescence were randomly collected from the crown of each tree and 500 flowers randomly assessed within the period of four (4) flowering seasons. Floral sex assessment was done visually and with a hand magnifying lens; floral morphometric measurements (i.e. pedicel and perianth length and breadth), inflorescence length, and breadth) was taken using a veneer caliper; number of flowers per inflorescence and inflorescence per twig was counted; while, data analysis was conducted on excel using analysis of variance and pairwise t-test comparison. Four floral sexes were identified in the G. kola plantation studied which were unisexual male flowers, unisexual female flowers, cosexual unisexual male flowers, and cosexual hermaphrodite flowers. Three tree sexes were identified viz: inconstant male, invariant female, and cosexual trees. The plantation was significantly sexually dimorphic in floral sex and phenotypic traits (i.e. pedicel and perianth size), and as well as sexually dimorphic in tree sex and reproductive phenotypic traits (i.e. inflorescence size, number of inflorescences per twig, and number of flower bud per inflorescence). The sexual system of the plantation was therefore trioecious with features suggestive of evolving dioecy through the gynodioecious pathway.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.44-49
• /
• 2009

In recent years, with the development of portable terminals, various searching services on large data have been provided in portable terminals. In order to search large data, most applications for information retrieval use indexes such as B-trees or R-trees. However, only a small portion of the data set is accessed by users, and the access frequencies of each data are not uniform. The existing indexes such as B-trees or R-trees do not consider the properties of the skewed access patterns. And a cache stores the frequently accessed data for fast access in memory. But the size of memory used in the cache is restricted. In this paper, we propose a new index based on disk, called J-tree, which considers user's search patterns. The proposed index is a balanced tree which guarantees uniform searching time on all data. It also supports fast searching time on the frequently accessed data. Our experiments show the effectiveness of our proposed index under various settings.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.9
• /
• pp.82-87
• /
• 2008

Faster, safer and cheaper mailing of the postal matter is essential for surviving in the competitive market of home-delivery service. In the past, the domestic delivery business has been nu by only a few number of companies. But more and more number of companies including medium size ones are participating in the business, and the competition is getting severe. This paper proposes a method to select the optimal location of mail distribution centers that minimally connect the local mail centers of some major cities in Korea using the Steiner Tree theory, which is about connecting a finite number of points with a minimal length of paths and has been used in the distribution system optimization and optimal routing of the transmission lines of the electric power system. By using Steiner Tree theory in finding the best location of the postal delivery hub, we may expect the reduction of transportation cost and the increase of profit, resulting in acquiring the superior position in the competitive delivery business. It is expected that we may use the Steiner Tree theory in finding the best location of the electric power substation for the nott higher EHV(extreme high voltage) transmission network.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.817-828
• /
• 2005

The main research problems in a mining frequent itemsets are reducing memory usage and processing time of the mining process, and most of the previous algorithms for finding frequent itemsets are based on an Apriori-property, and they are multi-scan algorithms. Moreover, their processing time are greatly increased as the length of a maximal frequent itemset. To overcome this drawback, another approaches had been actively proposed in previous researches to reduce the processing time. However, they are not efficient on a sparse .data set This paper proposed an efficient mining algorithm for finding frequent itemsets. A novel tree structure, called an $L_2$-tree, was proposed int, and an efficient mining algorithm of frequent itemsets using $L_2$-tree, called an $L_2$-traverse algorithm was also proposed. An $L_2$-tree is constructed from $L_2$, i.e., a set of frequent itemsets of size 2, and an $L_2$-traverse algorithm can find its mining result in a short time by traversing the $L_2$-tree once. To reduce the processing more, this paper also proposed an optimized algorithm $C_3$-traverse, which removes previously an itemset in $L_2$ not to be a frequent itemsets of size 3. Through various experiments, it was verified that the proposed algorithms were efficient in a sparse data set.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.546-553
• /
• 2007

As ontologies are used widely, interest for semantic similarity search is also increasing. In this paper, we suggest a query evaluation scheme for k-nearest neighbor query, which retrieves k most similar objects to the query object. We use the best match method to calculate the semantic similarity between objects and use the signature tree to index annotation information of objects in database. The signature tree is usually used for the set similarity search. When we use the signature tree in similarity search, we are required to predict the upper-bound of similarity for a node; the highest similarity value which can be found when we traverse into the node. So we suggest a prediction function for the best match similarity function and prove the correctness of the prediction. And we modify the original signature tree structure for same signatures not to be stored redundantly. This improved structure of signature tree not only reduces the size of signature tree but also increases the efficiency of query evaluation. We use the Gene Ontology(GO) for our experiments, which provides large ontologies and large amount of annotation data. Using GO, we show that proposed method improves query efficiency and present several experimental results varying the page size and using several node-splitting methods.