• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.6
• /
• pp.771-780
• /
• 2016

Detecting a set of longest paths is one of the crucial steps in static timing analysis and optimization. Recently, the process variation during manufacturing affects performance of the circuit design due to nanometer feature size. Measuring the performance of a circuit prior to its fabrication requires a considerable amount of computation time because it requires multi-corner and multi-mode analysis with process variations. An efficient algorithm of detecting the K-most critical paths in multi-corner multi-mode static timing analysis (MCMM STA) is proposed in this paper. The ISCAS'85 benchmark suite using a 32 nm technology is applied to verify the proposed method. The proposed K-most critical paths detection method reduces about 25% of computation time on average.

• Proceedings of the KIEE Conference
• /
• 1996.07c
• /
• pp.1753-1755
• /
• 1996

This paper presents an analysis of the 3D microwave oven considering its forming. The results were compared with experimental data. Finite Element Method(FEM) using edge clement is employed for the analysis. For solving the large sparse system matrix equation was solved using the parallelized QMR method. Analysis of the 3d cavity has troublesome difficulties such as spurious solutions, too many memory and long computation time. We overcome this difficulties by using edge clement for spurious solutions and the parallelized QMR method by the aid of Paralle Virtual Machine(PVM) for the memory and computation time.

• Journal of Mechanical Science and Technology
• /
• v.18 no.12
• /
• pp.2236-2249
• /
• 2004

The analysis for the three-dimensional fluid flow past tube banks arranged in equilateral-triangular form at Re$\_$max/=4,000 is carried out using a large eddy simulation technique. The governing equations for the mass and momentum conservation are discretized using the finite volume method. Parallel computational techniques using MPI (Message Passing Interface) are implemented in the present computer code. The computation time decreases linearly proportional to the number of used CPUs in the present parallel computation. We obtained the time-averaged streamwise and cross-streamwise velocities and turbulent intensities. The present numerical results are compared with the PIV experimental data and agree generally well with the experimental data.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.1E
• /
• pp.20-26
• /
• 1999

Although the radiation impedance of a transducer with a regular square surface has been studied by many researchers, the formulas are still very complicated, which results in long computation time and low accuracy. In this paper, we propose a new algorithm for the calculation of acoustic radiation impedance in which the regular square vibrating surface of a transducer is divided into small elements and duplicate calculations are eliminated in the process of calculating mutual effects of the elements. Using this algorithm, shorter computation time and higher accuracy of results can be obtained. As a demonstration, the self and the mutual radiation impedance of transducers with a regular square surface are calculated and the accuracy of the results is evaluated.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.57-73
• /
• 1985

Group scheduling problem in a multi-stage manufacturing system is reviewed and two heuristic procedures for minimizing the makespan are developed by employing the methods of flow shop sequencing heuristics with a slight modification. The comparisons among the five heuristics, three previously reported heuristics and two heuristics suggested by this study, are made on different problem sizes. The computational results indicate that NEH-GS method gives better group schedules than the other heuristics tested, but its computation time increases rapidly as the problem size increases. On the other hand, CDS-GS method provides relatively good group schedules with less computation time compared with NEH-GS method.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.629-637
• /
• 2000

The content-based information retrieval for a multimedia database uses feature information extracted from the compressed videos. This paper presents an effective method to detect scene changes from compressed videos. Scene changes are detected with DC values of DCT coefficients in MPEG-1 encoded video sequences. Instead of decoding full frames. partial macroblocks of each frame, horizontal and vertical macroblocks, are decoded to detect scene changes. This method detects abrupt scene changes by decoding minimal number of blocks and saves a lot of computation time. The performance of the proposed algorithm is analyzed based on the precision and the recall. The experimental results show the effectiveness in computation time and detection rate to detect scene changes of various MPEG-1 video streams.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.121-125
• /
• 2015

In recent years, research on collaborative filtering-based recommendation systems emphasized the accuracy of rating predictions, and this has led to an increase in computation time. As a result, such systems have divergeded from the original purpose of making quick recommendations. In this paper, we propose a recommendation algorithm that uses a Preference Difference Metric to reduce the computation time and to maintain adequate performance. The system recommends items according to their preference classification.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.135-138
• /
• 1990

For transient stability analysis of a power system, the new method using transition matrix is introduced in this paper. At the present the, Runge-Kutta, Modified-Euler and Trapezoidal methods have been very popular in most stability programs, Modified-Euler and Trapezoidal methods are inferior in accuracy and Runge-Kutta method has problems in computation time. The proposed algorithm requires transition matrix and its integrated values with derivatives of nonlinear parts in nonlinear differential equations for stability analysis. The method presented in this paper is between Modified-Euler and Runge-Kutta methods from the view point of computation time and is superior to the other methods in accuracy.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.59-66
• /
• 2004

Symmetry region searching can extract face region without a prior information in an image by using symmetric. However, this method requires a plenty of the computation time because the mask size to process symmetry region searching must be larger than the size of object such as eye, nose and mouth in face. in this paper, it proposed symmetric by using symmetry region searching and Wavelet Transform to reduce computation time of symmetry region searching, and It was applied to this method in an original image. To extract exact face region, we also experimented face region searching by using domain division in extraction region.