• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.6
• /
• pp.322-329
• /
• 2000

BIST(Built-in Self Test) has been considered as the most promising DFT(design-for-test) scheme for the present and future test strategy. The most serious problem in applying BIST(Built-in Self Test) into a large circuit is the excessive increase in test time. This paper is focused on this problem. We proposed a new BIST construction scheme which uses a parallel divide-and-conquer method. The circuit division is performed with respect to some internal nodes called test points. The test points are selected by considering the nodal connectivity of the circuit rather than the testability of each node. The test patterns are generated by only one linear feedback shift register(LFSR) and they are shared by all the divided circuits. Thus, the test for each divided circuit is performed in parallel. Test responses are collected from the test point as well as the primary outputs. Even though the divide-and-conquer scheme is used and test patterns are generated in one LFSR, the proposed scheme does not lose its pseudo-exhaustive property. We proposed a selection procedure to find the test points and it was implemented with C/C++ language. Several example circuits were applied to this procedure and the results showed that test time was reduced upto 1/2151 but the increase in the hardware overhead or the delay increase was not much high. Because the proposed scheme showed a tendency that the increasing rates in hardware overhead and delay overhead were less than that in test time reduction as the size of circuit increases, it is expected to be used efficiently for large circuits as VLSI and ULSI.

• 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 Institute of Control, Robotics and Systems
• /
• v.8 no.8
• /
• pp.625-632
• /
• 2002

We propose an outsole measurement/inspection system to improve the quality of the shoe product. It uses the Divide-and-Conquer technique to measure the length of shoes'outsole. First, it detects edge positions of outsole's toe and heel from each image frame using an unique scale block we defined and calculates the outsole's length as the distance of two edge positions. Then it compensates the total length of outsole using the side image of outsole. Next, it classifies the outsole as inferior goods if the measurement error is bigger than 5.8mm. As a result of testing with the various kinds of outsoles, it was shown that the 95% accuracy was acquired within 1mm allowable error range. In conclusion, the proposed inspection system is effective and useful in the measurement/inspection process of shoe product and any material object as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.5
• /
• pp.374-383
• /
• 1990

For a visual inspectio system to be viable, it must in general achieve the same or lower costs as those incurred by manual methods, it must have a reasonable inspection rate, and it must be reliable and maintainable : for the visual inspection system, inspection at high speed, flexibility for variety of products, and low cost are needed. In order to solve these problems, we propose the visual inspection algorithm by divide-and-conquer technique using the pyramid data structure and the development of simplified pattern matching method. By this method we can reduce the number of data required to compare with patterns and make the inspection time short.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.793-800
• /
• 2001

This paper deals with a new design methodology for a switching-type fuzzy-model-based controller in continuous and discrete-time system. Takagi-Sugeno (TS) fuzzy model is employed to design the switching-type fuzzy-model-based controller. A switching-type fuzzy-model-based controller is constructed based on the spirit of “divide and conquer”. The global system which has several rules in divided into several subsystems and then, a solution is found at each subsystem. The global solution is determined by a conjunction of the solutions of each subsystem. The design conditions are formulated in terns of linear matrix inequalities (LMIs), which guarantee the stabilization of a given TS fuzzy system. Simulation examples are included for ensuring the proposed control method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.272-277
• /
• 2008

Symmerge is a stable minimum storage merging algorithm that needs $O(m{\log}{\frac{n}{m}})$ element comparisons, where in and n are the sizes of the input sequences with $m{\leq}n$. Hence, according to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The Symmerge algorithm is based on the standard recursive technique of "divide and conquer". The objective of this paper is to consider the relationship between m and n for the degenerated case where the recursion depth reaches m-1.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.596-605
• /
• 1997

The synamic systrm emplohing the self-squared function, , $f(Z)=z^2+c$, provides the Mandelbrot set which classifies constants c using the divergence of the sequence starting from the origin.To speed-up the generation of Mandelbrot set images, two approaches , called as the divide-and-conquer technique and the triangular boundary tracing technique, have been developed.However , the divede-and-conquer technique genrates sequences of some pixels that so not affect graphical representations of the Mandelbrot set.The triangular boundary tracing tech-mique does noot represent some 8-connected components of the Mandelbrost set.In this paper, we prorose a new ;method which solves the 8-connectivity problem of triangular boundary tracing technique.This algorithm considers the divergence for only pixels which are essential to the graphical repressentation of the Mandelbrot set.It also foves good representations for 8-connected components like hairly structures.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.464-474
• /
• 2000

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, fast Fourier Transform(FFT), and distributed table lookup.We present an efficient all-to-all personalized communication algorithm for a 2D torus inwormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approach toreduce the number of start-up latency significantly, which is a good metric for network performancein wormhole networks. First, we divide the whole network into 2x2 basic cells, After speciallydesignated nodes called master nodes have collected messages to transmit to the rest of the basic cell,only master nodes perform complete exchange with reduced network size, N/2 x N/2. When finishedwith this complete exchange in master nodes, these nodes distribute messages to the rest of the masternode, which results in the desired complete exchange communication. After we present our algorithms,we analyze time complexities and compare our algorithms with several previous algorithms. And weshow that our algorithm is efficient by a factor of 2 in the required start-up time which means thatour algorithm is suitable for wormhole-routed networks.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.9
• /
• pp.377-384
• /
• 2017

The performance improvement of a single core processor has reached its limit since the circuit density cannot be increased any longer due to overheating. Therefore, the multicore and manycore architectures have emerged as viable approaches and parallel programming becomes more important. Haskell, a purely functional language, is getting popular in this situation since it naturally supports parallel programming owing to its beneficial features including the implicit parallelism in evaluating expressions and the monadic tools supporting parallel constructs. However, the performance of Haskell parallel programs is strongly influenced by the performance of the run-time system including the garbage collector. Though a memory profiling tool namely GC-tune has been suggested, we need a more systematic way to use this tool. Since GC-tune finds the optimal memory size by executing the target program with all the different possible GC options, the GC-tuning time takes too long. This paper suggests a basic divide-and-conquer method to reduce the number of GC-tune executions by reducing the search area by one-quarter for every searching step. Applying this method to two parallel programs, a maximally independent set and a K-means programs, the memory tuning time is reduced by 7.78 times with accuracy 98% on average.

• Annual Conference on Human and Language Technology
• /
• 1998.10c
• /
• pp.329-334
• /
• 1998

자연언어 처리 시스템은 시제품 개발이 비교적 용이한 반면에 이를 실용적인 시스템으로 발전 시키는데 많은 어려움이 있다. 본 논문에서는 형태소 분석기와 구문분석기, 기계번역 시스템 등을 개발할 때 발생하는 문제점과 방법론을 고찰하고, 실용적인 시스템을 개발하기 위한 효율적인 방법으로 2-step 패러다임과 이를 실현하는 방안으로 기능별 모듈화에 의한 divide and conquer 기법, 단순화 기법, 예외처리 기법 등을 활용하는 방법을 제안한다.