• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.823-832
• /
• 2011

In this paper, an efficient blind carrier frequency offset (CFO) estimation method in orthogonal frequency division multiplexing (OFDM) systems is proposed. In the proposed method, we obtain two time different received OFDM symbols by using both the cyclic prefix and oversampling technique, and a cost function is defined by using the two OFDM symbols. We show that the cost function can be approximately expressed as a cosine function. Using a property of the cosine function, a formular for estimating the CFO is derived. The estimator of the CFO requires three independent cost function values calculated at three different points of frequency offset. The proposed method is very efficient in computational complexity since no searching operation for the minimum cost value is required. The proposed method reduces 97% of the amount of FFT computation, compared with the ML method. Unlike the conventional methods such as the ML method and the MUSIC] method, the accuracy of the proposed method is independent of the searching resolution since the closed form solution exists. The computer simulation shows that the performance of the proposed method is superior to those of the MUSIC and the ML method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2000-2007
• /
• 1999

Recently, DDS (Distributed Database System) has been often implemented on VAN (Value Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centrailzed systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time. In a DDS design, the main problem is 1) how to select proper computer, and 2) how to allocate data fragment into proper nodes. This paper addresses DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes tow objectives, the operating and investment cost. GA (Genetic Algorithm) is developed to solve this mathematical formulation. A numerical experiment shows that the proposed method arrives at a good solution.

• Journal of Korean Society of Transportation
• /
• v.17 no.5
• /
• pp.111-122
• /
• 1999

A service network design model for LTL freight transportation is formulated as a mixed integer Programming Problem with two heuristic solution a1gorithms. The Proposed model derives the transportation Path for each origination-destination pair, taking into account transportation cost over the links and handling costs over the nodes. The first algorithm searches for a local minimum solution from a given initial solution by improving the quality of solution repeatedly while the second a1gorithm searches for a better solution using Simulated Annealing Method. For both solution algorithms, the initial solution is derived by a modified reverse Diikstras shortest Path a1gorithm. An illustrative example, Presented in the last part of the Paper, shows that the proposed algorithms find solutions which reduce the cost by 12% and 15% respectively, compared to the initial solution.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.545-551
• /
• 2005

The main objective of fraud detection is to minimize costs or losses that are incurred due to fraudulent transactions. Because of the problem's nature such as highly skewed, overlapping class distribution and non-uniform misclassification costs, it is, however, practically difficult to generate a classifier that is near-optimal in terms of classification costs at a desired operating range of rejection rates. This paper defines a performance measure that reflects classifier's costs at a specific operating range and offers a cost-sensitive learning approach that enables us to train classifiers suitable for real-world credit card fraud detection by directly optimizing the performance measure with evolutionary programming. The experimental results demonstrate that the proposed approach provides an effective way of training cost-sensitive classifiers for successful fraud detection, compared to other training methods.

• The Korean Journal of Applied Statistics
• /
• v.9 no.2
• /
• pp.145-159
• /
• 1996

We propose an adaptive searching method using some spatial relations among sample points to estimate the interesting area in the spatial population. The fundamental idea is to observe the neighboring sample points when a sample point is satified with some condition of an adaptive searching observation. For obseving the sample points with this method to estimate the area the sample size is decreased. From this result, we may expect to reduce the cost and time consuming in observation the sample points and to draw the shape of the interesting area without prior information of an spatial population. Some analytical simulation results are also presented.

• The Journal of the Korea Contents Association
• /
• v.21 no.8
• /
• pp.10-19
• /
• 2021

In CCVN, the existing content search and delivery protocols based on single-hop or multi-hop cause low content search ratio and high network traffic overhead. This paper proposes a RSU-based protocol for efficient content search and delivery. In the proposed protocol, an RSU chooses the candidate provider vehicle that provides the cost-minimized content delivery to the content requester vehicle. Simulation results verify that the proposed protocol achieves better performances.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.13-21
• /
• 2014

The set covering problem (SCP) is one of representative combinatorial optimization problems, which is defined as the problem of covering the m-rows by a subset of the n-columns at minimal cost. This paper proposes a method utilizing Integer Programming-based Local Search (IPbLS) to solve the set covering problem. IPbLS is a kind of local search technique in which the current solution is improved by searching neighborhood solutions. Integer programming is used to generate neighborhood solution in IPbLS. The effectiveness of the proposed algorithm has been tested on OR-Library test instances. The experimental results showed that IPbLS could search for the best known solutions in all the test instances. Especially, I confirmed that IPbLS could search for better solutions than the best known solutions in four test instances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.9-15
• /
• 2007

We propose the fast full search algorithm that reduces the computation of the block matching algorithm which is used for motion estimation of the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion pictures. However the proposed method is good for the fast and slow motion because it estimates the motion in the new search order after partitioning the search window. Also, when finding the motion vector, this paper presents the method that reduces the complexity by computing the matching error in the order which is determined by local image complexity. The proposed algorithm reduces the computation up to 99% for block matching error compared with the conventional spiral full search algorithm without any loss of image quality.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.2
• /
• pp.169-177
• /
• 2019

It is very important to understand the intention of a target ship to prevent collisions in multiple-ship situations. However, considering the intentions of a large number of ships at the same time is a great burden for the officer who must establish a collision avoidance plan. With a distributed algorithm, a ship can exchange information with a large number of target ships and search for a safe course. In this paper, I have applied a Distributed Stochastic Search Algorithm (DSSA), a distributed algorithm, for ship collision avoidance. A ship chooses the course that offers the greatest cost reduction or keeps its current course according to probability and constraints. DSSA is divided into five types according to the probability and constraints mentioned. In this paper, the five types of DSSA are applied for ship collision avoidance, and the effects on ship collision avoidance are analyzed. In addition, I have investigated which DSSA type is most suitable for collision avoidance. The experimental results show that the DSSA-A and B schemes offered effective ship collision avoidance. This algorithm is expected to be applicable for ship collision avoidance in a distributed system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.83-85
• /
• 2012

최근 스마트폰과 같은 모바일 단말기는 데이터 통신을 위해 3G, WiFi, WiBro, LTE 와 같은 다수의 네트워크 인터페이스를 가지고 있다. 또한 이와 같은 모바일 단말기는 대부분 배터리로 동작하기 때문에 에너지 효율성은 매우 중요한 요소이다. 따라서 해당 단말이 통신을 할 때, 주변 네트워크 환경에 따라 에너지, 통신비용 등을 고려하여 최적의 네트워크를 선택하여 사용할 수 있다. 이 때 주변 네트워크 환경에 따라 최적의 네트워크 인터페이스를 탐색하고 선택하는 것은 사용자의 명시적인 선택이나 주기적인 탐색 방법 등이 사용될 수 있다. 본 논문에서는 네트워크 탐색 주기에 따른 다중 네트워크 인터페이스 단말기의 에너지 효율성을 분석하고 효율적으로 네트워크 인터페이스를 선택하는 미들웨어의 프로토타입을 구현하고 평가하였다.