• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.205-206
• /
• 2011

In this paper, algorithm for fault classification and detection of generator dropping using wavelet singular value decomposition (WSVD) is proposed. Busan area upper 345kV is modeled and generator dropping is simulated in EMTP-RV. Characteristic of generator dropping is analyzed and this algorithm is deducted by calculating WSVD in MATLAB.

• East Asian mathematical journal
• /
• v.40 no.1
• /
• pp.109-118
• /
• 2024

This paper proposes a numerical method based on domain decomposition to find approximate solutions for one-dimensional convection-diffusion equations with Neumann boundary conditions. First, the equations are transformed into convection-diffusion equations with Dirichlet conditions. Second, the author introduces the Prediction/Correction Domain Decomposition (PCDD) method and estimates errors for the interface prediction scheme, interior scheme, and correction scheme using known error estimations. Finally, the author compares the PCDD algorithm with the fully explicit scheme (FES) and the fully implicit scheme (FIS) using three examples. In comparison to FES and FIS, the proposed PCDD algorithm demonstrates good results.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.2
• /
• pp.125-134
• /
• 1994

This paper proposes a new top-down technology mapping algorithm for minimizing the chip area and the path delay time of lookup table-based field programmable gate array(FPGA). First, we present the decomposition and factoring algorithm using common subexpre ssion which minimizes the number of basic logic blocks and levels instead of the number of literals. Secondly, we propose a cube packing algorithm considering the decomposition of gates which exceed m-input lookup table. Previous approaches perform the cube packing and the gate decomposition independently, and it causes to increase the number of basic logic blocks. Lastly, the efficiency.

• The Pure and Applied Mathematics
• /
• v.13 no.4 s.34
• /
• pp.281-294
• /
• 2006

Many partial differential equations defined on a rectangular domain can be solved numerically by using a domain decomposition method. The most commonly used decompositions are the domain being decomposed in stripwise and rectangular way. Theories for non-overlapping domain decomposition(in which two adjacent subdomains share an interface) were often focused on the stripwise decomposition and claimed that extensions could be made to the rectangular decomposition without further discussions. In this paper we focus on the comparisons of the two ways of decompositions. We consider the unconditionally stable scheme, the MIP algorithm, for solving parabolic partial differential equations. The SOR iterative method is used in the MIP algorithm. Even though the theories are the same but the performances are different. We found out that the stripwise decomposition has better performance.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.121-135
• /
• 1999

This paper studies the problem of inverting minimal path sets to obtain minimal cut sets for complex system. We describe efficiency of inversion algorithm by the use of boolean algebra and we develop inclusion-exclusion algorithm and pivotal decomposition algorithm for reliability calculation of complex system. Several examples are illustrated and the computation speeds between the two algorithms are undertaken.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1346-1353
• /
• 2001

This paper presents an algorithm for the design of 2 dimension separable denominator digital filter(SDDF). The proposed algorithm is based on the reduced dimensional decomposition not only 2 dimension SDDF's but also of given 2 dimension specification. The frequency domain design of 2 dimension separable denominator digital filters based on the reduced dimensional decomposition can be realized when the given 2 dimension frequency specification are optimally decomposed into a pair of 1 dimension digital filter specification via singular value decomposition. the algorithm is computationally efficient and numerically stable. In case of the low pass filter, the approximation error of the proposed design algorithm is $e_{m}$=5.17, $e_{r1}$ =8.78, $e_{r2}$=7.34, while in case of band pass filter, the approximation error is $e_{m}$=13.00, $e_{r1}$=62.76, $e_{r2}$=62.7676.7676

• Nuclear Engineering and Technology
• /
• v.52 no.11
• /
• pp.2667-2677
• /
• 2020

A domain decomposition (DD) scheme for GPU-based Monte Carlo (MC) calculation which is essential for whole-core depletion is introduced within the framework of the modified history-based tracking algorithm. Since GPU-offloaded MC calculations suffer from limited memory capacity, employing DDMC is inevitable for the simulation of depleted cores which require large storage to save hundreds of newly generated isotopes. First, an automated domain decomposition algorithm named wheel clustering is devised such that each subdomain contains nearly the same number of fuel assemblies. Second, an innerouter iteration algorithm allowing overlapped computation and communication is introduced which enables boundary neutron transactions during the tracking of interior neutrons. Third, a bank update scheme which is to include the boundary sources in a way to be adequate to the peculiar data structures of the GPU-based neutron tracking algorithm is presented. The verification and demonstration of the DDMC method are done for 3D full-core problems: APR1400 fresh core and a mock-up depleted core. It is confirmed that the DDMC method performs comparably with the standard MC method, and that the domain decomposition scheme is essential to carry out full 3D MC depletion calculations with limited GPU memory capacities.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• Journal of Information Processing Systems
• /
• v.17 no.6
• /
• pp.1170-1178
• /
• 2021

This paper proposed a versatile algorithm based on a dual-tree complex wavelet transform for intensifying the visual aspect of medical images. First, the decomposition of the input image into a high sub-band and low-sub-band image is done. Further, to improve the resolution of the resulting image, the high sub-band image is interpolated using Lanczos interpolation. Also, contrast enhancement is performed by singular value decomposition (SVD). Finally, the image reconstruction is achieved by using an inverse wavelet transform. Then, the Gaussian filter will improve the visual quality of the image. We have collected images from the hospital and the internet for quantitative and qualitative analysis. These images act as a reference image for comparing the effectiveness of the proposed algorithm with the existing state-of-the-art. We have divided the proposed algorithm into several stages: preprocessing, contrast enhancement, resolution enhancement, and visual quality enhancement. Both analyses show the proposed algorithm's effectiveness compared to existing methods.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.244-245
• /
• 2011

In this paper, the algorithm for detecting load shedding based on Wavelet Singular Value Decomposition(WSVD) is proposed. WSVD is method of signal processing which combine Wavelet Transform(WT) and Singular Value Decomposition(SVD) to analyze transients in power system. 345kV Busan transmission system is modeled by EMTP-RV and simulations according to successive change of load capability are conducted. This paper analyzes characteristics of WSVD by using simulation results and proposes algorithm for detecting load shedding.