• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.580-590
• /
• 2018

Active distribution system (ADS) considering distributed generation (DG) and electric vehicle (EV) is an effective way to cut carbon emission and improve system benefits. ADS is an evolving, complex and uncertain system, thus comprehensive model and effective optimization algorithms are needed. Battery swapping station (BSS) for EV service is an essential type of flexible load (FL). This paper establishes ADS planning model considering BSS firstly for the minimization of total cost including feeder investment, operation and maintenance, net loss and carbon tax. Meanwhile, immune binary firefly algorithm (IBFA) is proposed to optimize ADS planning. Firefly algorithm (FA) is a novel intelligent algorithm with simple structure and good convergence. By involving biological immune system into FA, IBFA adjusts antibody population scale to increase diversity and global search capability. To validate proposed algorithm, IBFA is compared with particle swarm optimization (PSO) algorithm on IEEE 39-bus system. The results prove that IBFA performs better than PSO in global search and convergence in ADS planning.

• The Korean Journal of Applied Statistics
• /
• v.25 no.3
• /
• pp.485-501
• /
• 2012

This research is to find a design D that minimizes forecast variance in d dimensions over the candidate space ${\chi}$. We want a robust design since we may not know the specific covariance structure. We seek a design that minimizes a coverage criterion and hope that this design will provide a small forecast variance even if the covariance structure is unobservable. The details of an exchange or swapping algorithm and several properties of the parameters of coverage criterion with the unknown correlation structures are discussed.

• Journal of Internet Computing and Services
• /
• v.6 no.4
• /
• pp.47-58
• /
• 2005

There are two major type of flash memory products, namely, NAND-type and NOR-type flash memory. NOR-type flash memory is generally deployed as ROM BIOS code storage because if offers Byte I/O and fast read operation. However, NOR-type flash memory is more expensive than NAND-type flash memory in terms of the cost per byte ratio, and hence NAND type flash memory is more widely used as large data storage such as embedded Linux file systems. In this paper, we designed an efficient flash memory file system based an Embedded system and presented to make up for reduced to Swapping a weak System Performance to flash file system using NAND-type flash memory, then proposed Swapping algorithm insured to an Execution time. Based on Implementation and simulation studies, Then, We improved performance bases on NAND-type flash memory to the requirement of the embedded system.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.432-441
• /
• 2006

As the community antenna television (CATV) networks becomes ubiquitous, instead of constructing an entirely new broadband network infrastructure, it has emerged as one of the rapid and economic technologies to interconnecting heterogeneous network to provide broadband access to subscribers. How to support ubiquitous real-time multimedia applications, especially in a heavy traffic environment, becomes a critical issue in modern CATV networks. In this paper, we propose a time guaranteed and efficient upstream minislots allocation algorithm for supporting quality-of-service (QoS) traffic over data over cable service interface specification (DOCSIS) CATV networks to fulfill the needs of realtime interactive services, such as video telephony, video on demand (VOD), distance learning, and so on. The proposed adaptive fast expansion algorithm and the loading statistics with dynamic swapping algorithm have been shown to perform better than that of the multimedia cable network system (MCNS) DOCSIS.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.40-46
• /
• 1999

The task scheduling has an effect on system execution time in a precedence constrained task graph onto the multiprocessor system. This problem is known to be NP-hard. many people made an effort to obtain near optimal schedule. We compared modified critical path schedule with many other methods(CP, MH, DL Swapping) For testing this subject, we created randomly a directed acyclic task graph with many root nodes and terminal nodes simulation result convinced for us that the modified critical path algorithm is superior to the other scheduling algorithm.

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

This paper presents the design of a placement sysyem integrated in PCB design system. to get an optimal component positioning from part and net list. Unplaced components are placed in initial process using modified cluster development algorithm and are swapped in improvement process using the GFDR(Generalized Force Directed Relaxation) algorithm. The result is optimized in post process by component rotating or pin/gate swapping. Experimental results shwo that the placement system produces manufacturable layouts which are optimal in terms of total routing length.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.121-135
• /
• 2013

This paper propose an efficient algorithm for selecting electric bus charging facility location. In nature, the optimal charging facility location problem is similar to Set Covering Problem. Set Covering Problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The Set Covering Problem has been proven to be NP-Complete. In order to overcome the computational complexity involved in seeking optimal solutions, this paper present an enhanced greedy algorithm and simulated annealing algorithm. In this paper, we apply the developed algorithm to Seoul's public bus system.

• Proceedings of the KSPS conference
• /
• 2006.05a
• /
• pp.77-81
• /
• 2006

This paper presents a technique of imposing the prosodic features of a native speaker's utterance onto the same sentence uttered by a non-native speaker. Three acoustic aspects of the prosodic features were considered: the fundamental frequency (F0) contour, segmental durations, and the intensity contour. The fundamental frequency contour and the segmental durations of the native speaker's utterance were imposed on the non-native speaker's utterance by using the PSOLA (pitch-synchronous overlap and add) algorithm [1] implemented in Praat[2]. The intensity contour transfer was also done in Praat. The technique of transferring one or more of these prosodic features was elaborated and its implications in the area of language education were discussed.

• Journal of Computing Science and Engineering
• /
• v.8 no.3
• /
• pp.157-172
• /
• 2014

Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space of virtual memory. Since the read/write characteristics of NAND flash memory are very different from those of hard disks, an efficient page replacement algorithm is needed for this environment. Our analysis shows that temporal locality is dominant in virtual memory references but that is not the case for write references, when the read and write references are monitored separately. Based on this observation, we present a new page replacement algorithm that uses different strategies for read and write operations in predicting the re-reference likelihood of pages. For read operations, only temporal locality is used; but for write operations, both write frequency and temporal locality are used. The algorithm logically partitions the memory space into read and write areas to keep track of their reference patterns precisely, and then dynamically adjusts their size based on their reference patterns and I/O costs. Without requiring any external parameter to tune, the proposed algorithm outperforms CLOCK, CAR, and CFLRU by 20%-66%. It also supports optimized implementations for virtual memory systems.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.3
• /
• pp.17-23
• /
• 2002

Motion capture system is widely used nowadays in the entertainment industry like movies, computer games and broadcasting. This system consist of several high resolution and high speed CCD cameras and expensive frame grabbing hardware for image acquisition. KAIST VR laboratory focused on low cost system for a few years and have been developed a LAN based optical motion capture system. But, by using low cost system some problems like occlusion, noise and swapping of markers' trajectory can be occurred. And more labor intensive work is needed for post-processing process. In this thesis, we propose a trajectory rectification algorithm by confidence model of markers attached on actor. Confidence model is based on graph structure and consist of linkage, marker and frame confidence. To reduce the manual work in post-processing, we have to reconstruct the marker graph by maximizing the frame confidence.