• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.11
• /
• pp.421-429
• /
• 1985

With the rapid increase of contingency cases due to complication of power system, the reduction of computation time in contingency analysis has become more significant than ever before. This paper deals with the development of a fast contingency analysis algorithm by using a matrix decomposition method. The proposed matrix decomposition method of contingency analysis yields an accurate solution by using the original triangular factor table. An outstanding feature of this method is of no need of factor table modification for network changes due to contingency outages. The proposed method is also applicable to multiple contingency analysis withremarkable reduction of computation time. The algorithm has been tested for a number of single and multiple contigencies in 17-bus and 50-bus systems. The numerical results show its applicability to practical power systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.692-704
• /
• 2005

With the improvement of computer hardware, GPUs(Graphics Processor Units) have tremendous memory bandwidth and computation power. This leads GPUs to use in general purpose computation. Especially, GPU implementation of compute-intensive physics based simulations is actively studied. In the solution of differential equations which are base of physics simulations, tridiagonal matrix systems occur repeatedly by finite-difference approximation. From the point of view of physics based simulations, fast solution of tridiagonal matrix system is important research field. We propose a fast GPU implementation for the solution of tridiagonal matrix systems. In this paper, we implement the cyclic reduction(also known as odd-even reduction) algorithm which is a popular choice for vector processors. We obtained a considerable performance improvement for solving tridiagonal matrix systems over Thomas method and conjugate gradient method. Thomas method is well known as a method for solving tridiagonal matrix systems on CPU and conjugate gradient method has shown good results on GPU. We experimented our proposed method by applying it to heat conduction, advection-diffusion, and shallow water simulations. The results of these simulations have shown a remarkable performance of over 35 frame-per-second on the 1024x1024 grid.

• Journal of the Korean Society of Radiology
• /
• v.13 no.4
• /
• pp.623-628
• /
• 2019

The aim of this study was to design fast non local means (FNLM) noise reduction algorithm and to confirm its application feasibility in light microscopic image. For that aim, we acquired mouse first molar image and compared between previous widely used noise reduction algorithm and our proposed FNLM algorithm in acquired light microscopic image. Contrast to noise ratio, coefficient of variation, and no reference-based evaluation parameter such as natural image quality evaluator (NIQE) and blind/referenceless image spatial quality evaluator (BRISQUE) were used in this study. According to the result, our proposed FNLM noise reduction algorithm can achieve excellent result in all evaluation parameters. In particular, it was confirmed that the NIQE and BRISQUE evaluation parameters for analyzing the overall morphologcal image of the tooth were 1.14 and 1.12 times better than the original image, respectively. In conclusion, we demonstrated the usefulness and feasibility of FNLM noise reduction algorithm in light microscopic image of small animal tooth.

• Nuclear Engineering and Technology
• /
• v.39 no.3
• /
• pp.193-206
• /
• 2007

The Korea Atomic Energy Research Institute has developed an advanced fast reactor concept, KALIMER-600, which satisfies the Generation IV reactor design goals of sustainability, economics, safety, and proliferation resistance. The concept enables an efficient utilization of uranium resources and a reduction of the radioactive waste. The core design has been developed with a strong emphasis on proliferation resistance by adopting a single enrichment fuel without blanket assemblies. In addition, a passive residual heat removal system, shortened intermediate heat-transport system piping and seismic isolation have been realized in the reactor system design as enhancements to its safety and economics. The inherent safety characteristics of the KALIMER-600 design have been confirmed by a safety analysis of its bounding events. Research on important thermal-hydraulic phenomena and sensing technologies were performed to support the design study. The integrity of the reactor head against creep fatigue was confirmed using a CFD method, and a model for density-wave instability in a helical-coiled steam generator was developed. Gas entrainment on an agitating pool surface was investigated and an experimental correlation on a critical entrainment condition was obtained. An experimental study on sodium-water reactions was also performed to validate the developed SELPSTA code, which predicts the data accurately. An acoustic leak detection method utilizing a neural network and signal processing units were developed and applied successfully for the detection of a signal up to a noise level of -20 dB. Waveguide sensor visualization technology is being developed to inspect the reactor internals and fuel subassemblies. These research and developmental efforts contribute significantly to enhance the safety, economics, and efficiency of the KALIMER-600 design concept.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.60-66
• /
• 1987

In this paper a fast matching method using subtemplate and search and down technique to reduce very heavy computational load of the conventional matching method, is presented The proposed method is spplied to an automatic target tracker in order to track one moving object in comparatively simple backgoriund. Experimental results show that istperformanced is not so degraded in spite of high computational reduction as that of the conventional matching method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.63-71
• /
• 1988

In this paper, a fast matching method using hierarchical neighborhood search and subtemplate to reduce very heavy computational load of the conventional matching method, is presented. Some parameters of the proposed method are chosen so that an automatic target tracker to which it is applied can track one moving object well in comparatively simple background. Experimental results show that its performance is not so degraded in spite of high computational reduction over that of the matching method using 3-step search.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.57-60
• /
• 1996

It is critical that all companies improve productivity in order to maintain their international competitiveness. The productivity can be explained as a measurement of effectiveness that is calculated by "the ratio of what is produced to what is required to produce it". The goal of this paper is to enhance productivity for a small fast food company mainly through work analysis. This work analysis will help the company to downsize by improving efficiency via motion analysis and by reduction of losses via facility improvement.provement.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.672-679
• /
• 2021

We propose a high-speed layer-based algorithm for synthesizing computer-generated holograms (CGHs), featuring sparsity-based image segmentation and computational parallelism. The sparsity-based image segmentation of layer-based three-dimensional scenes leads to considerable improvement in the efficiency of CGH computation. The efficiency enhancement of the proposed algorithm is ascribed to the field localization of the fast Fourier transform (FFT), and the consequent reduction of FFT computational complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.231-238
• /
• 2004

This paper presents the high speed noise reduction processing system using the modified discrete fourier transform(MDFT) on the frequency domain. The proposed filter uses the linear prediction coefficients of the adaptive line enhance(ALE) method based on the Sign algorithm The signals with a random noise tracking performance are examined through computer simulations. It is confirmed that the fast adaptive digital filter is realized by the high speed adaptive noise reduction(HANR) algorithm with rapid convergence on the frequency domain(FD).

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.4
• /
• pp.57-66
• /
• 2004

This paper proposes the design of a 2,048-bit RSA based on RNS(residue number systems) Montgomery modular multiplier As the systems that RNS processes a fast parallel modular multiplication for a large word partitioned into small words, we introduce Montgomery reduction method(MRM)［1］based on Wallace tree modular multiplier and 33 RNS bases with 64-bit size for RNS Montgomery modular multiplication in this paper. Also, for fast RNS modular multiplication, a modified method based on Chinese remainder theorem(CRT)［2］ is presented. We have verified 2,048-bit RSA based on RNS using Samsung 0.35${\mu}{\textrm}{m}$ technology and the 2,048-bit RSA is performed in 2.54㎳ at 100MHz.