• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.142-144
• /
• 2004

웹 문서 검색은 인터넷을 통해 정보를 얻는 가장 손쉬운 방법이지만, 사용자의 질의 의도를 충분히 반영하지 못한다는 단점을 가지고 있기도 하다. 이 논문에서는 사용자 의도를 문서 분류라는 방법을 통해 질의로부터 얻어내고 문서 검색결과와 문서 분류에 의한 결과를 적절한 방법으로 합성하여 사용자에게 결과로서 제시하는 시스템을 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.25-27
• /
• 2002

고정 격자 방식의 공간 색인 방법은 간단한 구조와 단순한 색인 과정, 구현의 용이성이라는 장점이 있으나 데이터의 분포에 영향을 많이 받아 밀집된 데이터를 처리하기에는 적합하지 못한 특성이 있다. 이에 본 논문에서는 고정 격자 색인 방법에 합병 정책을 적용하여 고정 격자 색인 방법의 성능을 향상시키는 방법을 제안한다. 본 논문의 방법에 따르면 공간 효율성이 매우 증가하고 다른 공간 색인 방법에 비해 색인 과정이 단순해지며, 공간 색인의 성능이 다른 색인 방법에 비해 증가되는 장점을 가지고 있다.

• Journal of Ginseng Research
• /
• v.19 no.1
• /
• pp.73-76
• /
• 1995

Newly sprouted American ginseng (Panax quinquefolium L.) seedlings were transplanted to forest pots with mycorrhizae-infested soil and grown in screenhouse for 2 years. Growth patterns, mortality rate and fresh root weight were investigated. Plants in VAM soil had lower mortality rales than control. In soils infested with two species of mycorrhizal fungi (Glomu deseyicola, frappe, Bloss and Merge and G. intraradices, Schenck and Smith), 28-35% of plants produced 3-prongs in the second season and significantly increased fresh root weight by 41 to 43%.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.488-498
• /
• 2007

This paper presents a novel approach for representing the spatio-temporal topology of the camera network with overlapping and non-overlapping fields of view (FOVs) in Ubiquitous Smart Space (USS). The topology is determined by tracking moving objects and establishing object correspondence across multiple cameras. To track people successfully in multiple camera views, we used the Merge-Split (MS) approach for object occlusion in a single camera and the grid-based approach for extracting the accurate object feature. In addition, we considered the appearance of people and the transition time between entry and exit zones for tracking objects across blind regions of multiple cameras with non-overlapping FOVs. The main contribution of this paper is to estimate transition times between various entry and exit zones, and to graphically represent the camera topology as an undirected weighted graph using the transition probabilities.

• Journal of KIISE:Software and Applications
• /
• v.27 no.6
• /
• pp.632-641
• /
• 2000

Conventional character extraction methods extract character regions using methods such as color reduction, region split and merge and texture analysis from the whole image. Because these methods use many heuristic variables and thresholding values derived from a priori knowledge, it is difficult to generalize them algorithmically. In this paper, we propose a method that can extract character regions using a topographical feature extraction method and a point-line-region extension method. The proposed method can also solve the problems of conventional methods by reducing heuristic variables and generalizing thresholding values. We see that character regions can be extracted by generalized variables and thresolding values without using a priori knowledge of character region. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is over 98%.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.1
• /
• pp.45-52
• /
• 2020

This paper proposes a solution for storage and retrieval problems for Resource Description Framework (RDF) data utilizing a key-value Solid State Device (SSD), considering storage, retrieval performance, and security. We propose a two-step compression algorithm to separate logical relationship and true values from RDF data-sets using the key-value SSD. This improves not only compression and storage efficiency but also storage security. We also propose a hybrid retrieval structure based on R∗-tree to enhance retrieval efficiency and implement a sort-merge join algorithm, and discuss factors affecting R∗-tree retrieval efficiency. Finally, we show the proposed approach is superior to current compression, storage, and retrieval approaches, obtaining target results faster while requiring less space, and competitive in terms of versatility, flexibility and security.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2169-2177
• /
• 2015

This paper proposes a new pattern matching module to overcome the increased runtime of previous algorithm using RAM, which was designed to overcome cost limitation of hash-based algorithm using CAM (Content Addressable Memory). By adopting Merge FSM algorithm to reduce the number of state, the proposed module contains state block and entry block to use in RAM. In the proposed module, one input string is compared with multiple entry strings simultaneously using entry block. The effectiveness of the proposed pattern matching unit is verified by executing Snort 2.9 rule set. Experimental results show that the number of memory reads has decreased by 15.8%, throughput has increased by 47.1%, while memory usage has increased by 2.6%, when compared to previous methods.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• Journal of Advanced Navigation Technology
• /
• v.21 no.1
• /
• pp.119-125
• /
• 2017

In this paper, we propose a method that merges and splits players in the MeanShift tracking framework. The MeanShift tracking moves the center of tracking window to the maximum probability location given the target probability distribution. This tracking method has been widely used for real-time tracking problems because of its fast processing speed. However, it hardly handles occlusions in multiple object tracking systems. Occlusions can be usually solved by applying data association methods. In this paper, we propose a method that can be applied before data association methods. The proposed method automatically merges and splits the overlapped players by adjusting the each player's tracking map. We have compared the tracking performance of the MeanSfhit tracking algorithm and the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.2
• /
• pp.55-64
• /
• 2000

In this paper, we propose an efficient datapath placement algorithm to minimize track density. Here, we consider each datapath element as a cluster, and merge the most strongly connected two clusters to a new cluster until only one cluster remains. As nodes in the two clusters to be merged are already linearly ordered respectively, we can merge two clusters with connecting them. The proposed algorithm produces circular linear ordering by connecting starting point and end point of the final cluster, and n different linear ordering by cutting between two contiguous elements of the circular linear ordering. Among the n different linear ordering, the linear ordering to minimize track density is final solution. In this paper, we show and utilize that if two clusters are strongly connected in a graph, the inner product of the corresponding vectors mapped in d-dimensional space using spectral method is maximum. Compared with previous datapath placement algorithm GA/S $A^{［2］}$, the proposed algorithm gives similar results with much less computation time.