• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.86-93
• /
• 2009

We investigate lattice-reduction-aided precoding techniques for multi-user multiple-input multiple-output (MIMO) channels. When assuming full knowledge of the channel state information only at the transmitter, a vector perturbation (VP) is a promising precoding scheme that approaches sum capacity and has simple receiver. However, its encoding is nondeterministic polynomial time (NP)-hard problem. Vector perturbation using lattice reduction algorithms can remarkably reduce its encoding complexity. In this paper, we propose a vector perturbation scheme using Seysen's lattice reduction (VP-SLR) with simultaneously reducing primal basis and dual one. Simulation results show that the proposed VP-SLR has better bit error rate (BER) and larger capacity than vector perturbation with Lenstra-Lenstra-Lovasz lattice reduction (VP-LLL) in addition to less encoding complexity.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.341-342
• /
• 2008

GA(Genetic Algorithm)는 NP-Complete 도메인이나 NP-Hard 도메인 내의 문제들에 대해서 최적의 해를 찾기 위해서 많이 사용되어 지는 진화 컴퓨팅 방법 중 하나이다. 모바일 로봇 기술 중 경로계획은 NP-Complete 도메인 영역의 문제 중 하나로 이를 해결하기 위해서 Dijkstra 등의 그래프 이론을 이용한 연구가 많이 연구되었고 최근에는 GA등 진화 컴퓨팅 기법을 이용하여 최적의 경로를 찾는 연구가 많이 수행되고 있다. 그러나 모바일 로봇이 처리해야 될 공간 정보 크기가 증가함에 따라 기존 GA의 개체의 크기가 증가되어 게산 복잡도가 높아져 시간 지연등의 문제가 발생할 수 있다. 이는 모바일 로봇의 잠재적 오류로 발생될 수 있다. 공간 정보에는 동적이 장애물들이 예측 불허하게 나타 날 수 있는데 이것은 전역 경로 계획을 수립할 때 또한 반영되어야 된다. 본 논문에서는 k-means 클러스터링 기법을 이용하여 장애물 밀집도 및 거리 정보를 기반으로 공간정보를 k개의 군집 공간으로 재분류하여 이를 기반으로 N*M개의 그리드 개체 집단을 생성하여 최적 경로계획을 수립하는 GA를 제시한다.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.443-450
• /
• 2016

This paper deals with a kind of packing problem of which the goal is to compose one or more templates which will be used to produce the items of different types. Each template consists of a fixed number of slots which are assigned to the different types of items and the production of the items is accomplished by printing the template repeatedly. The objective is to minimize the total number of produced items. This problem is known to be NP-hard. We present a polynomial time approximation algorithm which has a constant approximation ratio. The proposed algorithm is based on the well-known first-fit strategy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.577-588
• /
• 2006

이 논문에서는 호의 가중치가 음수가 될 수 있는 무향 그래프에서 마디집합들을 선택했을 때, 각 마디집합 사이에 걸쳐 있는 호의 가중치 합을 최대화하는 최대 가중치 합 그래프마디 분리 문제에 대해 연구한다. 우선$P\;{\neq}\;NP$ 라는 가정 하에서, 이 문제는 NP - hard이며 어떠한 근사 계수를 가지는 근사해법도 존재하지 않는다는 것을 밝힌다. 또한 이 문제를 정수 계획으로 풀기 위해, 그래프의 절단면을 나타내는 벡터들이 만드는 다면체의 극대면(facet)을 정의하는 부등식들을 추가 제약식으로 사용하는 branch-and-cut 알고리듬을 제시하고 구현하였다.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.65-76
• /
• 2009

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2005.06a
• /
• pp.255-263
• /
• 2005

Migration experiments of THO and 237Np have performed through a sampled granite core in Chemlab2 probe at the Aspo hard Rock laboratory. The elution curves of THO were analysed to determine hydraulic properties such as the extent of dispersion effect according to flow rates. The retardation phenomena of the solutes were observed and described with elution curves and migration plumes. After migration test, the rock core was opened, and the remaining radioactivities on the rock fracture surfaces were measured. The transport process was simulated with a two-dimensional channel model. The mass transport process was described with three types of basic processes ; advection, sorption and matrix diffusion. By the combination of these processes, effects of each process on transport were described in terms of elution curves and migration plumes. By comparing the simulation results to the experimental one, it was possible to analyse the retardation effect quantitatively.

• Management Science and Financial Engineering
• /
• v.18 no.2
• /
• pp.19-22
• /
• 2012

In the bin-packing problem, we deal with how to pack the items by using a minimum number of bins. In the inverse bin-packing number problem, IBPN for short, we are given a list of items and a fixed number of bins. The objective is to perturb at the minimum cost the item-size vector so that all items can be packed into the prescribed number of bins. We show that IBPN is NP-hard and provide an approximation algorithm. We also consider a variant of IBPN where the prescribed solution value should be returned by a pre-selected specific approximation algorithm.

• Journal of Navigation and Port Research
• /
• v.34 no.1
• /
• pp.9-14
• /
• 2010

Nautical Publications is a special purpose book, or a specially compiled database, that is issued officially by or on the authority of a Government, authorized Hydrographic Office and is designed to meet the requirements of marine navigation such as SOLAS and PSC. Nautical publications include List of Lights, Sailing directions. The SNPWG(Standardization Nautical Publications Working Group) from the IHO is working to implement in computer systems all those elements of interest for Hydrography and Navigation Concerning nautical publications' digitization process, the SNPWG has defined three types of nautical publications: Type 1 : Hard copy(NP1), Type 2 : Digital version, A slight modification of type 1(NP2), Type 3 : Digital version for ECDIS(NP3). Nautical Publications is essential with nautical charts as reference information to navigate. Development of digital nautical publications is needed for liaison with the chart production system, up-to-dateness of hydrographic information, improvement of service. But, Korean status is positioned in NP1. In our study, we surveyed the present status of nautical publications for development strategy of digital nautical publications. We build database of south coast of sailing direction, develop a manager program, convert the contents to KML( Keyhole Markup Language), develop a user program.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.06a
• /
• pp.65-68
• /
• 2009

A Nautical Publication is a special purpose book, or a specially compiled database, that is issued officially by or on the authority of a Government, authorized Hydrographic Office or other elevant ogvernment institution and is designed to meet the requirements of marine navigation Nautical publications include list of lights, Buoys, Beacons, Radio Siganals, Sailing directions. The SNPWG(Standardization Nautical Publications Working Group) from the IHO is working to implement in computer systems all those elements of interest for Hydrography and Navigation Concerning the nautical publications digitization process, the SNPWG has defined three types of nautical publication: Type 1 : Hard copy(NP1), Type 2 : Digital version, A slight modification of type 1(NP2), Type 3 : Digital version for ECDIS(NP3). Nautical Publication is essential with nautical charts as refrerence information to navigation. Development of digital nautical publication is needed for liaison with charts production system, up-to-dateness of hydrographic information, improvement of service. But, korea's status is positioned in NP1. In our study, we surveyed the present status of nautical publciation for strategy of digital nautical publication development. Also, we build database of south coast of sailing direction and develp a program for compilation and management of sailing direction.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.683-690
• /
• 2006

Reducing power consumption to extend network lifetime is one of the most important challenges in designing wireless sensor networks. One promising approach to conserving system energy is to keep only a minimal number of sensors active and put others into low-powered sleep mode, while the active sensors can maintain a connected covet set for the target area. The problem of computing such minimum working sensor set is NP-hard. In this paper, a centralized Voronoi tessellation (CVT) based approximate algorithm is proposed to construct the near optimal cover set. When sensor's communication radius is at least twice of its sensing radius, the covet set is connected at the same time; In case of sensor's communication radius is smaller than twice of its sensing radius, a connection scheme is proposed to calculate the assistant nodes needed for constructing the connectivity of the cover set. Finally, the performance of the proposed algorithm is evaluated through theoretical analysis and extensive numerical experiments. Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.