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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.111-114
• /
• 2010

스타 그래프, 버블정렬 그래프, 팬케익 그래프는 노드 대칭성(node symmetric), 최대 고장 허용도(maximum fault tolerance), 계층적 분할 성질을 갖고, 하이퍼큐브보다 망비용이 개선된 상호 연결망이다. 본 연구에서는 상호연결망으로 널리 알려진 스타 그래프와 그의 변형된 그래프들 사이의 임베딩 방법을 제안하고, 임베딩 비용을 분석한다. 임베딩 결과는 버블정렬 그래프는 스타 그래프에 연장율(dilation) 3, 스타그래프는 팬케익 그래프에 연장율 4로 각각 임베딩 가능하다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.597-600
• /
• 2008

스타(star) 네트워크는 노드 대칭성, 최대 고장 허용도, 계층적 분할 성질을 갖고, 하이퍼큐브보다 망 비용이 개선 된 상호 연결망이다. 본 연구에서는 상호연결망으로 널리 알려진 스타네트워크와 RFM, 버블정렬네트워크 사이의 임베딩 방법을 제안하고, 임베딩의 연장율 비용을 분석한다. 연구 결과로 버블정렬(Bubblesort) 그래프 $B_N$을 RFM 그래프 $R_N$에 연장비율 2, 버블정렬(Bubblesort) 그래프 $B_N$을 스타그래프 $S_N$에 연장율 3에 임베딩 할 수 있다.

• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.498-503
• /
• 2017

SIMD (Single Instruction Multiple Data) is a representative parallelization architecture that processes multiple data loaded in a SIMD register with a single instruction. Quicksort is a sorting algorithm that picks an element as a pivot from the array and reorders the array such that all elements having the values less than the pivot value are located in the left side on the pivot as well as all elements having the value greater than the pivot value are located in the right side on the pivot and then the algorithm performs the same task on both sublist recursively. In this paper, we propose an efficient Quicksort algorithm applying the SIMD instructions which minimally invokes conditional branches to avoid the performance degradation incurred by branch misprediction in a pipeline architecture. In addition, we improve the performance of the Quicksort algorithm by fetching data into a SIMD register as a byte unit to apply VBP (Vertical Bit Parallel) and the early pruning technique.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.5
• /
• pp.91-102
• /
• 2010

Star graph is a well-known interconnection network to further improve the network cost of Hypercube and has good properties such as node symmetry, maximal fault tolerance and strongly hierarchical property. In this study, we will suggest embedding scheme among star graph and pancake graph, bubblesort graph, which are variations of star graph. We will show that bubblesort graph can be embedded into pancake and star graph with dilation 3, expansion 1, respectively and pancake graph can be embedded into bubblesort graph with dilation cost O($n^2$). Additionally, we will show that star graph can be embedded into pancake graph with dilation 4, expansion 1. Also, with dilation cost O(n) we will prove that star graph can be embedded into bubblesort graph and pancake graph can be embedded into star graph.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.608-616
• /
• 2016

The Smith-Watrman (SW) algorithm is a local alignment algorithm which is one of important operations in DNA sequence analysis. The SW algorithm finds the optimal local alignment with respect to the scoring system being used, but it has a problem to demand long execution time. To solve the problem of SW, some methods to perform SW in distributed and parallel manner have been proposed. The ADAM which is a distributed and parallel processing framework for DNA sequence has parallel SW. However, the parallel SW of the ADAM does not consider that the SW is a dynamic programming method, so the parallel SW of the ADAM has the limit of its performance. In this paper, we propose a method to enhance the parallel SW of ADAM. The proposed parallel SW (PSW) is performed in two phases. In the first phase, the PSW splits a DNA sequence into the number of partitions and assigns them to multiple nodes. Then, the original Smith-Waterman algorithm is performed in parallel at each node. In the second phase, the PSW estimates the portion of data sequence that should be recalculated, and the recalculation is performed on the portions in parallel at each node. In the experiment, we compare the proposed PSW to the parallel SW of the ADAM to show the superiority of the PSW.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.3
• /
• pp.107-111
• /
• 2005

With the increasing use of multimedia technologies, image compression requires higher performance as well as new functionality in the informationized society. Specially, in the specific area of still image encoding in embedded system, a new standard, JPEG2000 that improve various problem of JPEG was developed. This paper proposed a method that reduce quantity of data delivered in EBCOT(Embedded Block Coding with Optimized Truncation) process using SPIHT(Set Partitioning in Hierarchical Trees) Algorithm to optimize selection of threshold from feature of wavelet transform coefficients and to remove sign bit in LL area for the increment of compression efficiency on JPEG2000. The experimental results showed the proposed algorithm achieves more improved bit rate in embedded system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2014.02a
• /
• pp.231.1-231.1
• /
• 2014

열 플라즈마(thermal plasma) 는 저온 플라즈마(cold plasma)와 달리 이온과 전자와 중성입자들이 충분한 에너지 교환으로 인해 열평형 상태를 가진다. 열 플라즈마를 생성 시킬 때 전극 사이에서 아크방전을 시켜 제트 형태로 플라즈마를 발생시키는 것을 플라즈마 토치(plasma torch)라고 한다. 이러한 플라즈마 토치는 화학 원소 분해, 강판 절단, 유해 기체 분해 등으로 널리 사용되고 있다. 본 연구에서는 플라즈마 토치를 수치적으로 해석하여 플라즈마의 특성을 알아보았다. 수치해석적 접근방법으로 열 플라즈마는 LTE (local thermodynamic equilibrium)을 가정하였으며 one-fluid 이론을 적용하였다. 이때 사용된 코드는 DCPTUN으로서 $C^{+}^{+}$로 작성된 열플라즈마 유동의 특성해석 코드인 동시에 SIMPLE 알고리즘을 이용한 유체 코드이다. 시뮬레이션은 2차원 축대칭이며 정렬격자계 및 비정렬격자계 모두에서 사용이 가능하도록 되어있다. 또한 맥스웰 방정식을 통해 electromagnetic field를 풀도록 하여 RF 시뮬레이션이 가능하도록 하였다. 이와 같은 열 플라즈마 시뮬레이션을 통해서 플라즈마 토치의 특성을 알아보았다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.1
• /
• pp.102-107
• /
• 2000

In general text compression techniques cannot be used directly in image compression because the model of text and image are different Recently, a new class of text compression, namely, block-sorting algorithm which involves Burrows and Wheeler transformation(BWT) gives excellent results in text compression. However, if we apply it directly into image compression, the result is poor. So, we propose simple method in order to improve the lossless compression performance of image. The proposed method can be divided into three steps. It is decomposed into ten subbands with the help of symmetric short kernel filter. The resulting subbands are block-sorted according to the method by BWT, and the redundancy is removed with the help of an adaptive arithmetic coder. Experimental results show that the proposed method is better than lossless JPEG and LZ-based compression method(PKZIP).