• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.243-250
• /
• 2014

In this paper, I devise a balance-swap optimization (BSO) algorithm to solve economic load dispatch with a quadratic fuel cost function. This algorithm firstly sets initial values to $P_i{\leftarrow}P_i^{max}$, (${\Sigma}P_i^{max}$ > $P_d$) and subsequently entails two major processes: a balance process whereby a generator's power i of $_{max}\{F(P_i)-F(P_i-{\alpha})\}$, ${\alpha}=_{min}(P_i-P_i^{min})$ is balanced by $P_i{\leftarrow}P_i-{\alpha}$ until ${\Sigma}P_i=P_d$; and a swap process whereby $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_i+{{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}$ = 1.0, 0.1, 0.1, 0.01, 0.001 is set at $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$. When applied to 15, 20, and 38-generators benchmark data, this simple algorithm has proven to consistently yield the best possible results. Moreover, this algorithm has dramatically reduced the costs for a centralized operation of 73-generators - a sum of the three benchmark cases - which could otherwise have been impossible for independent operations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.9
• /
• pp.3900-3914
• /
• 2012

This study examined the background of the recent global financial crisis and the concept of one of the financial derivatives such as the credit default swap(CDS) or synthetic CDO(collateral debt obligations), given the rapid growing and changing the over-the-counter derivative markets in their volume and structures. In comparison with the previous literature such as the study of Park & Kim (2011), this research empirically performed more thorough and comprehensive investigations to find any financial characteristics or attributes to determine the CDS spreads. Regarding the results obtained from the multiple regression models, the explanatory variables such as STYIELD3, SLOPE, INASSETS, and VOLATILITY, showed their statistically significant effects on all the tested dependent variables(DVs). Another procedure such as the principle component analysis(PCA), was also performed to account for additional IDVs as possible determinants of the dependent variables. Subsequent to this analysis, larger coefficients of each corresponding eigenvector such as BETA, PFT2, GROWTH, STD, and BLEVERAGE were found to be possible financial determinants. For robustness, all the IDVs were employed to be tested in the 'full' regression model with stepwise procedure. As a result, STYIELD3, SLOPE, and VOLATILITY, and BETA showed their statistically significant relationship with all the dependent variables of the CDS spreads.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.232-238
• /
• 2003

Traditional operating systems use a virtual memory to provide users with a bigger memory than a physical memory. The virtual memory augments the insufficient physical memory by the swap device. Since disks are usually used as the swap device, the cost of a page fault is relatively high compared to the access cost of the physical memory. Recently, numerous papers have investigated the Network RAM in order to exploit the idle memory in the network instead of disks. Since today's distributed systems are interconnected with high-performance networks, the network latency is far smaller than the disk access latency In this paper we design and implement the Network RAM using block device driver on Linux. This is the first implementation of the Network RAM on Linux. We propose the new reliability method to recover the page when the other workstation's memory is damaged. The system using the Network RAM as the swap device reduces the execution time by 40.3% than the system using the disk as the swap device. The performance results suggest that the new reliability method that use the processor more efficiently has the similar execution time with others, but uses smaller server memory and generates less message traffic than others.

• Economic Analysis
• /
• v.27 no.1
• /
• pp.1-36
• /
• 2021

Given the US dollar's status as a global safe haven, global factors, such as US monetary policy, may have considerable impacts on financial markets in other countries. Regarding such hypothesis, this paper looked at the impacts of US monetary policy on domestic bond and FX swap markets through an event study. According to our analysis, US monetary policy had significant positive impacts on domestic interest rates. In particular, it turned out to have bigger impacts on long-term products with high term premiums. By period, the correlation between US monetary policy and domestic interest rates was not significant before the financial crisis, but was clearly positive after the crisis. The US conventional monetary policy was seen to have big impacts on short-term and medium-term KTB yields, while its unconventional monetary policy had major impacts on long-term KTB yields. Moreover, FX swap rates reacted very sensitively to US monetary policy shocks before the financial crisis, while they did not show any significant reactions after the crisis. This suggests that, in line with the covered interest rate parity, the impact of US monetary policy shocks was transmitted to domestic financial markets mainly through swap rate adjustments before the global financial crisis, but through the changes in domestic interest rates during the post-crisis period.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.2
• /
• pp.64-69
• /
• 2010

This paper designs the ABC(Advanced Block Cipher) algorithm which is a 64byte block encryption algorithm, improves the performance of encryption process time, and makes an key exchange using EC-DH. The ABC algorithm reduces basic memory occupation rates using the original data position exchange method which is a data swap key without S-Box, IP-Box and etc. Also, it prepares the exposure of symmetric key using the unfixed encryption(decryption) key excepting the fixed encryption(decryption) key. Therefore, the proposed ABC algorithm in this paper is a proper encryption algorithm in lower memory environment and mobile banking.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.753-758
• /
• 2010

In this paper we propose an efficient marker tracking system that exploits IR and web cameras. The proposed method solves the marker swap problem and allows for fast and responsive marker tracking. We use color information gathered from the IR reflector to assign a unique identification to each marker. We can locate each marker withthe IR camera and also identify the marker uniquely by using color information provided by the web camera. The experiment results show that marker swapping can be eliminated effectively. Furthermore, our approach allows for faster and more responsive marker tracking.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.4
• /
• pp.219-224
• /
• 2017

In facing the lack of a deterministic algorithm for economic load dispatch optimization problem, only non-deterministic heuristic algorithms have been suggested. Worse still, there is a near deficiency of research devoted to real-time load dispatch optimization algorithm. In this paper, therefore, I devise a shut-off and swap algorithm to solve real-time load dispatch optimization problem. With this algorithm in place, generators with maximum cost-per-unit generation power are to be shut off. The proposed shut-off criteria use only quadratic function in power generation cost function without valve effect nonlinear absolute function. When applied to the most prevalent economic load dispatch benchmark data, the proposed algorithm is proven to largely reduce the power cost of known algorithms.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.1
• /
• pp.80-89
• /
• 2013

This paper presents an efficient approach for solving economic dispatch (ED) problems with nonconvex cost functions using a 'Mean-Variance Optimization (MVO)' algorithm with Kuhn-Tucker condition and swap process. The aim of the ED problem, one of the most important activities in power system operation and planning, is to determine the optimal combination of power outputs of all generating units so as to meet the required load demand at minimum operating cost while satisfying system equality and inequality constraints. This paper applies Kuhn-Tucker condition and swap process to a MVO algorithm to improve a global minimum searching capability. The proposed MVO is applied to three different nonconvex ED problems with valve-point effects, prohibited operating zones, transmission network losses, and multi-fuels with valve-point effects. Additionally, it is applied to the large-scale power system of Korea. The results are compared with those of the state-of-the-art methods as well.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.161-171
• /
• 2010

As embedded systems adopt monolithic kernels, NAND flash memory is used for swap space of virtual memory systems. While flash memory has the advantages of low-power consumption, shock-resistance and non-volatility, it requires garbage collections due to its erase-before-write characteristic. The efficiency of garbage collection scheme largely affects the performance of flash memory. This paper proposes a novel garbage collection technique which exploits data redundancy between the main memory and flash memory in flash memory-based virtual memory systems. The proposed scheme takes the locality of data into consideration to minimize the garbage collection overhead. Experimental results demonstrate that the proposed garbage collection scheme improves performance by 37% on average compared to previous schemes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.476-487
• /
• 2009

The virtual memory system in 4.4 BSD operating systems exploits a clustering scheme to reduce disk I/Os in paging out (or flushing) modified pages that are intended to be replaced in order to make free rooms in memory. Upon the page out of a victim page, the scheme stores a cluster (or group) of modified pages contiguous with the victim in the virtual address space to swap disk at a single disk write. However, it fails to find large clusters of contiguous pages if applications change pages not adjacent with each other in the virtual address space. To address the problem, we propose a new clustering scheme called Multiple-Object Clustering (MOC), which together stores multiple clusters in the virtual address space at a single disk write instead of paging out the clusters to swap space at separate disk I/Os. This multiple-cluster transfer allows the virtual memory system to significantly decrease disk writes, thus improving the page-out performance. Our experiments in the FreeBSD 6.2 show that MOC improves the execution times of realistic benchmarks such as NS2, Scimark2 SOR, and nbench LU over the traditional clustering scheme ranging from 9 to 45%.