• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.117-129
• /
• 2003

In this paper, we propose advanced parallel join algorithm to efficiently process join operation on hypercube systems. This algorithm uses a broadcasting method in processing relation R which is compatible with hypercube structure. Hence, we can present optimized parallel join algorithm for that hypercube structure. The proposed algorithm has a complete solution of two essential problems - load balancing problem and data skew problem - in parallelization of join operation. In order to solve these problems, we made good use of the characteristics of clustering effect in the algorithm. As a result of this, performance is improved on the whole system than existing algorithms. Moreover. new algorithm has an advantage that can implement non-equijoin operation easily which is difficult to be implemented in hash based algorithm. Finally, according to the cost model analysis. this algorithm showed better performance than existing parallel join algorithms.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.4
• /
• pp.466-473
• /
• 2011

This paper proposes a protection algorithm for a wind turbine generator (WTG) in a large wind farm. To minimize the outage section, a protection relay for a WTG should operate instantaneously for an internal fault or a connected feeder fault, whereas the relay should not operate for an internal fault of another WTG connected to the same feeder or an adjacent feeder fault. In addition, the relay should operate with a delay for an inter-tie fault or a grid fault. An internal fault of another WTG connected to the same feeder or an adjacent feeder fault, where the relay should not operate, is determined based on the magnitude of the positive sequence current. To differentiate an internal fault or a connected feeder fault from an inter-tie fault or a grid fault, the phase angle of the negative sequence current is used to distinguish a fault type. The magnitude of the positive sequence current is then used to decide either instantaneous operation or delayed operation. The performance of the proposed algorithm is verified under various fault conditions with EMTP-RV generated data. The results indicate that the algorithm can successfully distinguish instantaneous operation, delayed operation, or non-operation depending on fault positions and types.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.4
• /
• pp.262-275
• /
• 2012

This paper develops a multistage scheduling algorithm for the module operation of the LCD(Liquid Crystal Display) production systems and tests the efficiency of the proposed algorithm. The module operation is a multistage form composed of multiple sub operations of processes, and each stage is consists of multiple lines with the same kinds of machines. This paper presents a mathematical modeling reflecting the constraints of the LCD module operation and develops a multistage scheduling algorithm based on tabu search metaheuristic approach. For this purpose, an production order is assigned to a line of the sub operations and a sequence of the assigned order is rearranged to draw an efficient schedule. Simulation experiments test performance measures and show the efficiency of the proposed algorithm.

• Proceedings of the KIPE Conference
• /
• 2016.07a
• /
• pp.479-480
• /
• 2016

This paper introduces a master and slave control algorithm for parallel operation of UPS system. If each module of UPS system control the output voltage and filter inductor current in parallel operation, it occur unbalanced output power each module. To operate UPS system parallel, it need a algorithm that control output power of modules. A master and slave control algorithm is helpful to balance output power of modules by controlling output current. The effect of a master and slave control algorithm is proved by simulations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.7
• /
• pp.1287-1293
• /
• 2009

This paper presents an application of Harmony Search (HM) meta-heuristic optimization algorithm for optimal operation of microgrid system. The microgrid system considered in this paper consists of a wind turbine, a diesel generator, and a fuel cell. An one day load profile which divided 20 minute data and wind resource for wind turbine generator were used for the study. In optimization, the HS algorithm is used for solving the problem of microgrid system operation which a various generation resources are available to meet the customer load demand with minimum operating cost. The application of HS algorithm to optimal operation of microgrid proves its effectiveness to determine optimally the generating resources without any differences of load mismatch and having its nature of fast convergency time as compared to other optimization method.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.633-635
• /
• 2003

Electricity industries throughout the world are undergoing unprecedented changes. As a result, these changes lead to the separation of traditional integrated utilities and the introduction of competition in order that increase efficiency in electricity industry. Direct load control (DLC) system in competitive electricity market has a hierarchical interactive operation system, therefore, its control logic is also applied by bilateral interactive method that interchanges information related to interruptible load between operation hierarchies. Consequently, load curtailment allocation algorithm appropriate for new DLC system is required, and based on interchanged information, this algorithm should be implemented by most efficient way for each operation hierarchy. In this paper, we develop the load curtailment allocation algorithm in an emergency for new DLC system. Especially, the optimal algorithm for load aggregator (LA) that participates in competitive electricity market as a main operator for load management is developed.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.5
• /
• pp.34-40
• /
• 2015

This paper presents an application of Differential Search (DS) meta-heuristic optimization algorithm for optimal operation of micro grid system. DS algorithm has the benefit of high convergence rate and precision compared to other optimization methods. The micro grid system consists of a wind turbine, a diesel generator, and a fuel cell. The simulation is applied to micro grid system only. The wind turbine generator is modeled by considering the characteristics of variable output. One day load data which is divided every 20 minute and wind resource for wind turbine generator are used for the study. The method using the proposed DS algorithm is easy to implement, and the results of the convergence performance are better than other optimization algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.485-499
• /
• 2021

Although non-binary low-density parity-check (NB-LDPC) codes have better error-correction capability than that of binary LDPC codes, their decoding complexity is significantly higher. Therefore, it is crucial to reduce the decoding complexity of NB-LDPC while maintaining their error-correction capability to adopt them for various applications. The extended min-sum (EMS) algorithm is widely used for decoding NB-LDPC codes, and it reduces the complexity of check node (CN) operations via message truncation. Herein, we propose a low-cost CN processing method to reduce the complexity of CN operations, which take most of the decoding time. Unlike existing studies on low complexity CN operations, the proposed method employs quick selection algorithm, thereby reducing the hardware complexity and CN operation time. The experimental results show that the proposed selection-based CN operation is more than three times faster and achieves better error-correction performance than the conventional EMS algorithm.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.192-196
• /
• 2024

The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.

• Journal of KIISE:Software and Applications
• /
• v.37 no.9
• /
• pp.694-705
• /
• 2010

The mutation operation is the main operation in the evolutionary programming which has been widely used for the optimization of real valued function. In general, the mutation operation utilizes both a probability distribution and its parameter to change values of variables, and the parameter itself is subject to its own mutation operation which requires other parameters. However, since the optimal values of the parameters entirely depend on a given problem, it is rather hard to find an optimal combination of values of parameters when there are many parameters in a problem. To solve this shortcoming at least partly, if not entirely, in this paper, we propose a new mutation operation in which the parameter for the variable mutation is theoretically estimated from the self-adaptive perspective. Since the proposed algorithm estimates the scale parameter of the Cauchy probability distribution for the mutation operation, it has an advantage in that it does not require another mutation operation for the scale parameter. The proposed algorithm was tested against the benchmarking problems. It turned out that, although the relative superiority of the proposed algorithm from the optimal value perspective depended on benchmarking problems, the proposed algorithm outperformed for all benchmarking problems from the perspective of the computational time.