• KEPCO Journal on Electric Power and Energy
• /
• v.8 no.2
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2018.05a
• /
• pp.106-106
• /
• 2018

Ecosystem service valuation is a crucial step for the sustainable management of watershed. In the context of various ecosystem services provided by watershed, this study, particularly deals with water yield computation in Bagmati Basin of Nepal. The water availability per population in Bagmati Basin is lowest compared to other basins in Nepal. Also, the rate of urbanization is rapidly growing over a decade. In this regard, the objectives of this study are 1) to compute the total water yield of the basin along with computation on a sub-watershed scale, and 2) Study the impacts of land use change on water yield based on CLUE-S model. For the study, Integrated Valuation of Environmental Services and Tradeoffs (InVEST), a popular model for ecosystem service assessment based on Budyko hydrological method is used to compute water yield. As well, CLUE-S model is used to study land use change, which is further related to study variation on water yield. The sub-watershed wise outcome of the study is expected to provide the guidelines for the effective and economic management of a watershed on a regional scale.

• Proceedings of the KIEE Conference
• /
• 1997.07a
• /
• pp.12-14
• /
• 1997

The analysis of eigenvalue and eigenvector is a crucial procedure for many electromagnetic computation problems. However, eigenpair computation is timing-consuming task. Thus, its parallelization is required for designing large-scale and precision three-dimensional electromagnetic machines. In this paper, the Davidson method is parallelized on a cluster of workstations. Performance of the parallelization scheme is reported. This scheme is applied to a ridged waveguide design problem.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.2
• /
• pp.67-75
• /
• 2001

This paper presents a fast and effective methodology for service restoration in large-scale distribution systems. The service restoration problem is formulated as a constrained optimization problem and requires the fast computation time and superior solution because the more unfaulted out-of-service area should be restored as soon as possible. The proposed methodology is designed to consider the fast computation time and priority service restoration by dijkstra algorithm and fuzzy theory in large-scale distribution systems. Simulation results demonstrate the validity and effectiveness of the proposed on a 26-bus and 140-bus system.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.8 no.2
• /
• pp.43-50
• /
• 2002

By reason of development of anesthesia, advent of new surgical operation type and change of hygiene criterion and economical index is increasing recently request about alteration of existing unit or new surgical operation-unit type. The purpose of this study is to provide of architectural planning program for the type decision and the scale computation of operating-unit in healthcare facilities. As a result of this study, presented program of six type according to surgical operation process including space and time side.

• Computers and Concrete
• /
• v.7 no.4
• /
• pp.303-315
• /
• 2010

In this paper, we present a new finite Timoshenko beam element with a model for ultimate load computation of reinforced concrete frames. The proposed model combines the descriptions of the diffuse plastic failure in the beam-column followed by the creation of plastic hinges due to the failure or collapse of the concrete and or the re-bars. A modified multi-scale analysis is performed in order to identify the parameters for stress-resultant-based macro model, which is used to described the behavior of the Timoshenko beam element. The micro-scale is described by using the multi-fiber elements with embedded strain discontinuities in mode 1, which would typically be triggered by bending failure mode. A special attention is paid to the influence of the axial force on the bending moment - rotation response, especially for the columns behavior computation.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.161-197
• /
• 2020

Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.1
• /
• pp.26-32
• /
• 2011

This paper proposes a new method to process panoramic image stitching using SURF(Speeded Up Robust Features). Panoramic image stitching is considered a problem of the correspondence matching. In computer vision, it is difficult to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. However, SURF algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform). In this work, we also describe an efficient approach to decreasing computation time through the homography estimation using RANSAC(random sample consensus). RANSAC is a robust estimation procedure that uses a minimal set of randomly sampled correspondences to estimate image transformation parameters. Experimental results show that our method is robust to rotation, zoom, Gaussian noise and illumination change of the input images and computation time is greatly reduced.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.79.1-79.1
• /
• 2019

We present an algorithm for the fast computation of the general N-point spatial correlation functions of any discrete point set embedded within an Euclidean space of ${\mathbb{R}}n$. Utilizing the concepts of kd-trees and graph databases, we describe how to count all possible N-tuples in binned configurations within a given length scale, e.g. all pairs of points or all triplets of points with side lengths < rmax. Through benchmarking we show the computational advantage of our new graph-based algorithm over more traditional methods. We show that all 3-point configurations up to and beyond the Baryon Acoustic Oscillation scale (~200 Mpc in physical units) can be performed on current Sloan Digital Sky Survey (SDSS) data in reasonable time. Finally we present the first measurements of the 4-point correlation function of ~0.5 million SDSS galaxies over the redshift range 0.43< z <0.7. We present the publicly available code GRAMSCI (GRAph Made Statistics for Cosmological Information; bitbucket.org/csabiu/gramsci), under a GNU General Public License.

• Computational Structural Engineering
• /
• v.22 no.6
• /
• pp.92-97
• /
• 2009