• The Journal of Korean Association of Computer Education
• /
• v.16 no.2
• /
• pp.9-18
• /
• 2013

In secondary education, learning a computer science subject has the purpose to improve creative problem solving ability of students by learning computational thinking and principles. In particular, learning algorithm has been emphasized for this purpose. There are studies that learning algorithm has the effect of creative problem solving based on the leading studies that learning algorithm has the effect of problem solving. However, relatively the importance of the learning algorithm can weaken, because these studies depend on creative problem solving model or special contents for creativity. So this study proves that learning algorithm has the effect of creative problem solving in the view that common problem solving and creative problem solving have the same process. For this, analogical reasoning was selected among common thinking skills and divide-and-conquer algorithm was selected among abstractive principles for analogical reasoning in sorting algorithm. The frequency which solves the search problem by using the binary search algorithm was higher than the control group learning only sequence of sorting algorithm about the experimental group learning divide-and-conquer algorithm. This result means that learning algorithm including abstractive principle like divide-and-conquer has the effect of creative problem solving by analogical reasoning.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose a new register file architecture called the Register File Extension for Multi-words or Long-word Operation (RFEMLO) to accelerate both symmetric and asymmetric cryptographic algorithms. Based on the idea that most of cryptographic algorithms heavily use multi-words or long-word operations, RFEMLO allows multiple contiguous registers to be specified as a single operand. Thus, a single instruction can specify a SIMD-style multi-word operation or a long-word operation. RFEMLO can be applied to general purpose processors by adding instruction set for multi-words or long-word operands and functional units for additional instruction set. To evaluate the performance of RFEMLO, we use Simplescalar/ARM 3.0 (with gcc 2.95.2) and run detailed simulations on various symmetric and asymmetric cryptographic algorithms. By applying RFEMLO, we could get maximum 62% and 70% reductions in the total instruction count of symmetric and asymmetric cryptographic algorithms respectively. Also, performance results show that a speedup of 1.4 to 2.6 can be obtained in symmetric cryptographic algorithms and a speedup of 2.5 to 3.3 can be obtained for asymmetric cryptographic algorithms when we apply RFEMLO to a processor with an in-order pipeline. We also found that RFEMLO can effectively improve the performance of these cryptographic algorithms with much less cost compared to issue-width increase available in Superscalar implementations. Moreover, the RFEMLO can also be applied to Superscalar processor, leading to additional 83% and 138% performance gain in symmetric and asymmetric cryptographic algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.61-69
• /
• 2007

This paper proposes new preprocessing algorithm to extract minutiae in the process of fingerprint recognition. Fingerprint images quality enhancement is a topic phase to ensure good performance in a topic phase to ensure good performance in a Automatic Fingerprint Identification System(AFIS) based on minutiae matching. This paper proposes an algorithm to improve fingerprint image preprocessing to extract minutiae accurately based on directional filter. We improved the suitability of low quality fingerprint images to better suit fingerprint recognition by using valid ridge vector and ridge probability of fingerprint images. With the proposed fingerprint improvement algorithm, noise is removed and presumed ridges are more clearly ascertained. The algorithm is based on five step: computation of effective ridge vector, computation of ridge probability, noise reduction, ridge emphasis, and orientation compensation and frequency estimation. The performance of the proposed approach has been evaluated on two set of images: the first one is self collected using a capacitive semiconductor sensor and second one is DB3 database from Fingerprint Verification Competition (FVC).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.753-761
• /
• 2010

In this paper, we propose a novel tag collection algorithm to improve tag collection performance in active RFID systems. In the proposed algorithm, the reader detects the occurrence of empty slots and collided slots through the identified slot scan process and reduces the time wasted by empty slots and collided slots, resulting in improvement of tag collection performance. To evaluate the performance improvement by the proposed tag collection algorithm via the experiments in a real-world environment, we implemented an active RFID reader and tags. The experimental results with the reader and 60 tags showed that the proposed algorithm could reduce the average tag collection time by 21.7% and improve the average identification throughput by 28.3%, compared with the standard tag collection algorithm in ISO/IEC 18000-7. In addition, the proposed algorithm reduced the average battery consumption on tags by 22.7% in the battery consumption experiment with 20 tags.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.129-137
• /
• 2012

The queen-bee genetic algorithm that we made by mimicking of the reproduction of queen-bee has considerably improved the performances of genetic algorithm. However, since we used only one queen-bee in the queen-bee genetic algorithm, a problem that individuals of genetic algorithm were driven to one place where the queen-bee existed occurred. This made the performances of the queen-bee genetic algorithm degrade. In order to solve this problem, we introduce a multiple queen-bee evolution method by employing another queen-bee whose fitness is the most significantly increased than its parents as well as the original queen-bee that is the best individual in a generation. This multiple queen-bee evolution makes the probability of falling into local optimum areas decrease and allows the individuals to easily get out of the local optimum areas even if the individuals fall into a local optimum area. This results in increasing the performances of the genetic algorithm. Experimental results with four function optimization problems showed that the performances of the proposed method were better than those of the existing method in the most cases.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.5
• /
• pp.299-307
• /
• 2022

Harmony Search (HS) is a relatively recently developed meta-heuristic optimization algorithm, and various studies have been conducted on it. HS is based on the musician's improvisational performance, and the objective variables play the role of the instrument. However, each instrument is given only a sound range, and there is no concept of a scale that can be said to be the basis of music. In this study, the performance of the algorithm is improved by introducing a scale to the existing HS and quantizing the bandwidth. The introduced scale was applied to HM initialization instead of the existing method that was randomly initialized in the sound band. The quantization step can be set arbitrarily, and through this, a relatively large bandwidth is used at the beginning of the algorithm to improve the exploration of the algorithm, and a small bandwidth is used to improve the exploitation in the second half. Through the introduction of scale and bandwidth quantization, it was possible to reduce the algorithm performance deviation due to the initial value and improve the algorithm convergence speed and success rate compared to the existing HS. The results of this study were confirmed by comparing examples of optimization values for various functions with the conventional method. Specific comparative values were described in the simulation.

• Proceedings of the KIPE Conference
• /
• 2013.11a
• /
• pp.220-221
• /
• 2013

본 논문은 OCV 추정기법을 이용한 전류적산법의 SOC Reset 알고리즘을 제안한다. 제안한 알고리즘은 배터리 상황에 따라 OCV 추정을 위한 휴지시간을 달리 설정한다. 이에 따라 짧은 휴지 시에도 SOC Reset Point를 늘려 전류적산법의 오차를 Reset함으로써 SOC 추정 능력을 향상한다. Li-ion 27 Ah/99.9 Wh 배터리의 충 방전 실험을 통해서 OCV 판별 시간을 도출하여 알고리즘을 구현한다. 전기자동차의 주행 패턴을 모사하여 기존의 전류적산법과 비교 실험을 통해 제안한 알고리즘을 검증한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.5
• /
• pp.1027-1032
• /
• 2012

Importance of security is emphasized along with development of local area network such as NFC, Bluetooth, WiFi etc., but research that is worth watching eagerly up to now is not gone. This paper proposed SSEN algorithm for security elevation of approximation communication network. Proposed SSEN algorithm is algorithm that special cryptographic function creates own key without necessity. Also, SSEN achieving certification function additionally, did so that can have more than performance about the processing speed and mistake of service voluntarily.

• Journal of KIISE:Software and Applications
• /
• v.26 no.3
• /
• pp.343-352
• /
• 1999

본 논문에서는 대용량 데이터베이스에서 효율적인 연관 규칙 탐사에 대한 알고리즘을 제안하였다. 제안하는 알고리즘은 복합 해쉬 트리를 사용하여 해쉬 트리 탐색 비용과 데이터베이스 스캔 비용을 동시에 줄임으로서 성능을 향상시켰다. 복합 해쉬 트리는 같은 크기의 항목집합들 대신에 크기가 다른 여러 항목집합을 하나의 해쉬 트리로 구성한다. 복합 해쉬 트리의 유용성을 보이기 위하여 제안한 알고리즘은 잘 알려져 있는 Apriori, DHP 방밥과 수행 시간 측면에서 성능 비교를 하였다. 그 결과 대부분의 최소 지지도에서제안한 알고리즘이 Apriori, DHP 방법보다 우수하게 나타났으며, 최소 지지도가 0.5% 이하인 경우 DHP 방법에 비하여 약 30%의 이득 향상이 있었다.

• Korean Journal of Optics and Photonics
• /
• v.29 no.2
• /
• pp.53-57
• /
• 2018

In this paper, we mainly introduce some quantum computational algorithms that have exponential speedups over the best known classical algorithms, and summarize recent research achievements in quantum algorithms that can affect existing cryptosystems. Finally, we suggest a research direction that can improve these results more progressively.