• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.81-86
• /
• 2015

This paper suggests heuristic algorithm with linear time complexity to decide the normal and optimal point at minimum loss/maximum profit maximum shortest scheduling problem with additional loss cost and bonus profit cost. This algorithm computes only the earliest ending time for each node. Therefore, this algorithm can be get the critical path and project duration within O(n) time complexity and reduces the five steps of critical path method to one step. The proposed algorithm can be show the result more visually than linear programming and critical path method. For real experimental data, the proposed algorithm obtains the same solution as linear programming more quickly.

• Steel and Composite Structures
• /
• v.12 no.6
• /
• pp.505-522
• /
• 2012

An artificial bee colony (ABC) algorithm is developed for the optimum design of geometrically non-linear steel frames. The ABC is a new swarm intelligence method which simulates the intelligent foraging behaviour of honeybee swarm for solving the optimization problems. Minimum weight design of steel frames is aimed under the strength, displacement and size constraints. The geometric non-linearity of the frame members is taken into account in the optimum design algorithm. The performance of the ABC algorithm is tested on three steel frames taken from literature. The results obtained from the design examples demonstrate that the ABC algorithm could find better designs than other meta-heuristic optimization algorithms in shorter time.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.25 no.6
• /
• pp.433-441
• /
• 2020

This study proposes a constant power tracking algorithm to compensate for the intermittent characteristics of Photovoltaic connected to a DC micro grid. A PV-ESS integrated module in which distributed ESS is additionally connected is utilized for the proposed algorithm. PV performs P&O MPPT control at all times. To supplement the intermittent characteristics of PV, the proposed constant power tracking algorithm maintains constant power by operating the distributed ESS of the PV-ESS integrated module in accordance with the output state of the PV. By performing PSIM simulation and an experiment, this study verifies the performance of the integrated module of PV-ESS for DC micro grids applying the constant power tracking algorithm.

• Nuclear Engineering and Technology
• /
• v.44 no.3
• /
• pp.273-282
• /
• 2012

A new effective methodology for optimizing the enrichment of low-enriched zones as well as gadolinia fuel ($UO_2/Gd_2O_3$) rod designs in PLUS7 fuel assemblies was developed to minimize the maximum peak power in the core and to maximize the cycle lifetime. An automated link code was developed to integrate the genetic algorithm (GA) and the core design code package of ALPHA/PHOENIX-P/ANC and to generate and evaluate the candidates to be optimized efficiently through the integrated code package. This study introduces an optimization technique for the optimization of gadolinia fuel rod designs in order to effectively reduce the peak powers for a few hot assemblies simultaneously during the cycle. Coupled with the gadolinia optimization, the optimum enrichments were determined using the same automated code package. Applying this technique to the reference core of Ulchin Unit 4 Cycle 11, the gadolinia fuel rods in each hot assembly were optimized to different numbers and positions from their original designs, and the maximum peak power was decreased by 2.5%, while the independent optimization technique showed a decrease of 1.6% for the same fuel assembly. The lower enrichments at the fuel rods adjacent to the corner gap (CG), guide tube (GT), and instrumentation tube (IT) were optimized from the current 4.1, 4.1, 4.1 w/o to 4.65, 4.2, 4.2 w/o. The increase in the cycle lifetime achieved through this methodology was 5 effective full-power days (EFPD) on an ideal equilibrium cycle basis while keeping the peak power as low as 2.3% compared with the original design.

• Journal of KIISE
• /
• v.44 no.5
• /
• pp.469-475
• /
• 2017

The emerging NVMe-based multi-queue SSDs provides a high bandwidth by parallel I/O, i.e., each core performs I/O through its dedicated queue in parallel with other cores. To provide a bandwidth share for each application with I/O, a fair-share scheduler that provides a bandwidth share to each core is required. In this study, we proposed a multi-core scalable fair-queuing algorithm for multi-queue SSDs. The algorithm adopts randomization to minimize the inter-core synchronization overheads and provides a weight-proportional bandwidth share to each core. The results of our experiments indicated that the proposed algorithm gives accurate bandwidth partitioning and outperforms the existing FlashFQ scheduler, regardless of the number of cores for a Linux kernel with block-mq.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.6
• /
• pp.735-745
• /
• 1998

The method of moments has been widely used in the analysis of TM scattering problems. Recently, significant advances in the development of fast and efficient techniques for solving large problems have been reported. In such methods, iterative matrix solvers are preferred by virtue of their speed and low memory requirements. But for near resonant and strong multiple scattering problems, e.g., involving an aircraft engine inlet, a large number of iterations is required for convergence. In this paper, an efficient approximate inverse based preconditioner is used to reduce this number of iterations. By using the matrix partitioning method, the computational is used to reduce this number of iterations. By using the matrix partitioning method, the computational cost for obtaining the approximate inverse is reduced to O(N). We apply this preconditioner to an O(NlogN) algorithm, the multilevel fast multipole algorithm, for the aircraft engine inlet problem. The numerical results show the efficiency of this preconditioner.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6B
• /
• pp.405-413
• /
• 2012

WFQ(Weighted Fair Queuing) is the most popular fair queuing algorithm to guarantee the Quality-of-Service(QoS), but it has the inherent drawback of a poor resource utilization, particularly under the low rate traffic requiring a tight delay bound. It was recently identified that the poor utilization is mainly due to non-optimized latency of a traffic flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. The LOFQ algorithm, however, renews their optimal latencies for all flows whenever a new flow arrives, which results in the high implementation complexity of O($N^2$).This paper is to reduce thecomplexity to O(1). The proposed method is first to derive the optimal latency index function from the statistical QoS characteristics of the offered load, and then to simply calculate the optimal latency index of the arriving flow using the function.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.634-641
• /
• 2006

Flash memory has many advantages like non-volatility and fast I/O speed, but it has also disadvantages such as not-in-place-update data and asymmetric read/write/erase speed. For the performance of flash memory storage, it is essential for the buffer replacement algorithms to reduce the number of write operations that also affects the number of erase operations. A new buffer replacement algorithm is proposed in this paper, that delays the writes of not-cold-dirty pages in the buffer cache of flash storage. We show that this algorithm effectively decreases the number of write operations and erase operations without much degradation of hit ratio. As a result overall performance of flash I/O speed is improved.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.5
• /
• pp.3132-3138
• /
• 2014

In many communication systems, intersymbol interference, DC and impulsive noise are hard-to-solve problems. For the purpose of cancelling such interferences, the concept of lagged cross-correlation of probability has been used for blind equalization. However, this algorithm has a large burden of computation. In this paper, a recursive method of the algorithm based on the lagged probability correlation is proposed. The summation operation in the calculation of gradient of the cost is transformed into a recursive gradient calculation. The recursive method shows to reduce the high computational complexity of the algorithm from O(NM) to O(M) for M symbols and N block data having advantages in implementation while keeping the robustness against those interferences. From the results of the simulation, the proposed method yields the same learning performance with reduced computation complexity.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.605-614
• /
• 2005

We show that an Artinian O-sequence $h_0,h_1,{\cdots},h_{d-1},h_d\;=\;h_{d-1},h_{d+l}\;>\;h_d$ of codimension 3 is not level when $h_{d-1}\;=\;h_d\;=\;d + i\;and\;h{d+1}\;=\;d+(i+1)\;for\;i\;=\;1,\;2,\;and\;3$, which is a partial answer to the question in [9]. We also introduce an algorithm for finding noncancelable Betti numbers of minimal free resolutions of all possible Artinian O-sequences based on the theorem of Froberg and Laksov in [2].