• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.34-43
• /
• 2012

Determining the similarity between two strings can be applied various area such as information retrieval, spell checker and spam filtering. Similarity calculation between Korean strings based on dynamic programming methods firstly requires a definition of the similarity between phonemes. However, existing methods have a limitation that they use manually set similarity scores. In this paper, we propose a method to automatically calculate inter-phoneme similarity from a given set of variant words using a PAM-like probabilistic model. Our proposed method first finds the pairs of similar words from a given word set, and derives derivation rules from text alignment results among the similar word pairs. Then, similarity scores are calculated from the frequencies of variations between different phonemes. As an experimental result, we show an improvement of 10.1%~14.1% and 8.1%~11.8% in terms of sensitivity compared with the simple match-mismatch scoring scheme and the manually set inter-phoneme similarity scheme, respectively, with a specificity of 77.2%~80.4%.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.597-604
• /
• 2007

Stream data is a continuous flow of information that mostly arrives as the form of an infinite rapid stream. Recently researchers show a great deal of interests in analyzing such data to obtain value added information. Here, we propose an efficient cube computation algorithm for multidimensional analysis of stream data. The fact that stream data arrives in an unsorted fashion and aggregation results can only be obtained after the last data item has been read. cube computation requires a tremendous amount of memory. In order to resolve such difficulties, we compute user selected aggregation fables only, and use a combination of an way and AVL trees as a temporary storage for aggregation tables. The proposed cube computation algorithm works even when main memory is not large enough to store all the aggregation tables during the computation. We showed that the proposed algorithm is practically fast enough by theoretical analysis and performance evaluation.

• Journal of The Korean Association of Information Education
• /
• v.22 no.2
• /
• pp.223-230
• /
• 2018

Software education will be implemented in elementary, middle and high schools from the 2018 school year. One of the core contents of software education is algorithm education. As with other subjects, algorithmic education can also be seen as the success of students' initiative. And students' initiative learning can lead to increasing students' interest and commitment. In this paper, I propose the concept of software battle by applying sports games to algorithm education. The software battle defined that the programmed objects play to solve a given problem without human intervention in the virtual world. This can be applied to various topics. In this paper, I tried to apply it to sorting numbers which is a representative subject of algorithm education. The results of applying the algorithm education to the software battles showed a positive response, although the students felt the unfamiliar side. This indicates that the software battle can be used as one of the various education methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.2
• /
• pp.224-229
• /
• 2005

Generally, genetic algorithm (GA) has too much time and space complexity when it is running in the typical processor. Therefore, we are forced to use the high-performance and expensive processor by this reason. It also works as a barrier to implement real device, such a small mobile robot, which is required only simple rules. To solve this problem, this paper presents and proposes enhanced processor-architecture for the faster GA processing. A typical processor architecture can be enhanced and specialized by two approaches: one is a sorting network, the other is a residue number system (RNS). A sorting network can improve the time complexity of which needs to compare the populations' fitness. An RNS can reduce the magnitude of the largest bit that dictates the speed of arithmetic operation. Consequently, it can make the total logic size smaller and innovate arithmetic operation speed faster.

• Journal of the Korea Convergence Society
• /
• v.9 no.10
• /
• pp.45-53
• /
• 2018

Recently, studies about bilingual word embedding have been gaining much attention. However, bilingual word embedding with Korean is not actively pursued due to the difficulty in obtaining a sizable, high quality corpus. Local embeddings that can be applied to specific domains are relatively rare. Additionally, multi-word vocabulary is problematic due to the lack of one-to-one word-level correspondence in translation pairs. In this paper, we crawl 868,163 paragraphs from a Korean-English law corpus and propose three mapping strategies for word embedding. These strategies address the aforementioned issues including multi-word translation and improve translation pair quality on paragraph-aligned data. We demonstrate a twofold increase in translation pair quality compared to the global bilingual word embedding baseline.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.199-206
• /
• 2006

Sequential pattern mining is an important data mining task with broad applications. However, conventional methods may meet inherent difficulties in mining databases with long sequences and noise. They may generate a huge number of short and trivial patterns but fail to find interesting patterns shared by many sequences. In this paper, to overcome these problems, we propose the theme of approximate sequential pattern mining roughly defined as identifying patterns approximately shared by many sequences. The proposed method works in two steps: one is to cluster target sequences by their similarities and the other is to find consensus patterns that ire similar to the sequences in each cluster directly through multiple alignment. For this purpose, a novel structure called weighted sequence is presented to compress the alignment result, and the longest consensus pattern that represents each cluster is generated from its weighted sequence. Finally, the effectiveness of the proposed method is verified by a set of experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.841-849
• /
• 2012

This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.173-179
• /
• 2008

This paper proposes an efficient 1:N matching scheme for fingerprint identification. Usually, in the minutiae-based matching scheme, fingerprint matching score could be calculated by analyzing geometrical similarity between minutiae from two fingerprints. To calculate the geometrical similarity between them, it is necessary to fingerprint align a fingerprint data with the other one. The final matching score is obtained by bidirectional matching in the common fingerprint matching scheme, because the similarity between two fingerprints varies with the result of alignments. The reliability of matching score by the bidirectional matching is better than by the unidirectional matching, but it takes two times comparing with unidirectional matching. To solve the problem, this paper proposes an efficient 1:N fingerprint matching scheme based on the distribution of bidirectional matching scores for the large fingerprints database. The experimental result shows the usefulness of the proposed scheme.

• Journal of the Microelectronics and Packaging Society
• /
• v.19 no.2
• /
• pp.47-53
• /
• 2012

Recently, by the increasing of data transmission rates, PCB is required high-speed data transmission rates and thin packaging. So optical PCB which is the combination of electrical layer and optical layer can be one of the solution to overcome the limitations of conventional electrical PCB. The most important factor in the implementation of optical PCB is optical interconnection. So the research on high-efficiency and passive alignment has been active. In this paper, we suggest built-in lens pluggable waveguide and we simulate its coupling efficiency and structural stability. Optical simulation results show that the proposed structure has higher efficiency than no lens structure about 1.86 times in transmitter and about 1.42 times in receiver. In structure simulation, inner lens has no damage in desorption process. Therefore, we shown that the proposed structure has a high coupling efficiency and structural stability.

• Journal of Korea Multimedia Society
• /
• v.9 no.5
• /
• pp.624-634
• /
• 2006

This paper presents a new watermarking scheme that is robust against geometrical attacks such as translation and rotation. The proposed method is based on the conventional PSADT(Polar Coordinates Shape Adaptive Discrete Transform) method which is an robust watermarking scheme for an arbitrarily-shaped image such as character images. The PSADT method shows perfect robustness against geometrical attack if there is no change in the shape of the image object. However, it cannot be utilized to watermark general rectangular images because of the missing alignment between the watermarked signals in the embedding and extracting side. To overcome this problem we propose a new watermarking scheme that aligns the watermark signal using the image inherent feature, especially corner. Namely the proposed method decides a consistent target region whose shape and position isn't changed by any malicious attack and then embeds the watermark in it using the PSADT method. Experimental results show the robustness of the proposed method against geometrical attacks as well as image compression.