• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.673-682
• /
• 2005

Distance browsing queries, namely k-nearest neighbor queries, are the most important queries in spatial database applications, e.g., Geographic Information Systems(GISs). Recently, GIS applications trends to extend themselves toward wide multi-user environments such as the Web. Since many techniques for such queries, where Hjaltason and Samet's algorithm is the most efficient one, were optimized for only one query, we need to complement them suitable for multi-user environments. It can be a good approach that we store many individual query results in a cache, i.e., query result caching and reuse them in evaluating incoming queries, j.e., query result matching. In this paper, we propose a complementary Hjaltason and Samet's algerian capable of reusing previous query results in a cache for answering distance browsing queries in multi-user GIS environments. Our experimental results conform the efficiency of our approach.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.9
• /
• pp.49-57
• /
• 2009

In this paper, we propose a multiple voltage scheduling method which reduces energy consumption considering both timing constraints and resource constraints. In the other multiple voltage scheduling techniques, high voltage is assigned to operations in the longest path and low voltage is assigned to operations that are not on the longest path. However, in those methods, voltages are assigned to specific operations restrictively. We use a simulated annealing technique, in which several voltages are assigned to specific operations flexibly regardless of whether they are on the longest path. In this paper, a post processing algorithm is proposed to further reduce the energy consumption. In some cases, designers may want to reduce the level shifters. To make tradeoff between the total energy and the number (or energy) of level shifters weighted term can be added to the cost function. When the level shifter energy is weighted six times, for example, the number of level shifters is reduced by about 24% and their energy consumption is reduced by about 20%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.64-77
• /
• 2013

In this paper, we propose a joint bandwidth allocation and path selection scheme for IEEE 802.16j networks in uplink with cooperative relaying, and we evaluate the performance of the proposed scheme by using OPNET based simulation in hilly terrain with heavy tree density. The proposed scheme maximizes the system throughput in uplink with cooperative relaying in IEEE 802.16j networks. Then, we transform the proposed scheme into multi-dimensional multiple choice knapsack problem (MMKP) based scheme. We also propose uplink throughput maximization scheme and MMKP based scheme without cooperative relaying. We show that the system throughput of the proposed MMKP based scheme is higher than that of link quality based scheme, and cooperative relaying provides higher system throughput than the conventional case without cooperative relaying in uplink.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.217-225
• /
• 2009

Tone injection scheme has been known as one of peak to average power ratio (PAPR) reduction methods deployable to multi-carrier system like orthogonal frequency division multiplexing (OFDM). The basic idea in tone injection scheme is to enforce the constellation size larger so that each of original constellation points is mapped into the preassigned distinct locations. According to the tone injection scheme, it increases symbol power highly induced inherently by expanding constellation to get optimal PAPR reduction. In the other hand, to get optimal power increase, the PAPR would be reduced insufficiently with limited tone injection signal. To withstand these problems, this paper consider the reduction of the PAPR and power increase problem simultaneously, Toward this, the tone injection scheme accomplished by employing the weighted sum genetic algorithm which has been utilized to solve multi-objective optimization problem (MOOP). The simulation results verifies that the proposed scheme can control the effective PAPR performance and alleviation of power increase flexibly by the weight value at the expense of relatively low complexity.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.193-199
• /
• 2005

One of the important fields for heuristics algorithm is how to balance between Intensificationand Diversification. Ant Colony System(ACS) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem(TSP). In this paper, we propose Multi Colony Interaction Ant Model that achieves positive negative interaction through elite strategy divided by intensification strategy and diversification strategy to improve the performance of original ACS. And, we apply multi colony interaction ant model by this proposed elite strategy to TSP and compares with original ACS method for the performance.

• Journal of the Korean Society for Railway
• /
• v.14 no.1
• /
• pp.24-30
• /
• 2011

Conventional slope stability analysis is focused on calculating minimum factor of safety or maximum probability of failure. To minimize inherent uncertainty of soil properties and analytical model and to reflect various analytical models and its failure shape in slope stability analysis, slope stability analysis method considering simultaneous failure probability for multi failure mode was proposed. Linear programming recently introduced in system reliability analysis was used for calculation of simultaneous failure probability. System reliability analysis for various analytical models could be executed by this method. For application analysis for embankment, the results of this method shows that system stability of embankment calculate quantitatively.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1064-1071
• /
• 2019

Multiview stereo matching algorithm is used to reconstruct 3D shape from a set of 2D images. Conventional multiview stereo algorithms have been implemented on high-performance hardware due to the heavy complexity that contains a large number of calculations in each step. However, as the performance of mobile graphics processors has recently increased rapidly, complex computer vision algorithms can now be implemented on mobile devices like a smartphone and an embedded board. In this paper we parallelize an multiview stereo algorithm using OpenCL on mobile GPU and provide various optimization techniques on the embedded hardware with limited resource.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.25-34
• /
• 2007

Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

• Journal of the Korea Computer Graphics Society
• /
• v.12 no.1
• /
• pp.1-7
• /
• 2006

본 논문에서는 다양체 (manifold) 구조와 스칼라 변위함수 (scalar displacement function)에 기반한 새로운 변위곡면 (displaced surface)의 표현 기법을 제안한다. 변위곡면은 제어메쉬 (control mesh)의 각 정점에서 변위된 국소적 패치들 (displaced local patches)을 블렌딩 (blending)함으로써 생성된다. 제안된 변위곡면은 점 군 (point cloud)의 형태로 주어진 기하학적 모델을 근사하기 위해서 사용된다. 점 군의 데이터로터 제어메쉬가 생성되고, 점 군의 점들이 제어메쉬의 국소적 패치들 (local patches)에 사영 (projection)되어 각 패치들로 부터의 스칼라 변위함수가 구해지고, 이러한 변위함수들을 최적화 하여 높은 정밀도를 갖는 최종적인 곡면을 생성된다. 점 군의 형태로 주어진 다양한 모델에 대한 실험 결과를 통해서 제안된 근사기법의 효율성과 정밀도가 입증된다. 본 논문에서 제안된 표현기법은 다 단계 (multi-level) 변위함수를 통해 다중해상도 표현 (multi-resolution representations)과 골격기반 형상변형 (skeleton-driven deformation)등과 같은 다양한 응용들에 효율적으로 사용된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.397-399
• /
• 2003

파장분할다중화방식(WDM-Wavelength Division Multiplexing) 네트워크는 차세대 전송망으로서 주목받고 있다. 광경로들의 집합으로서 WDM 네트워크의 가상 토폴로지가 정의되는데, 각각의 광경로를 정의하는 광학 스위치들이 재구성 가능하기 때문에, 가상 토폴로지 또한 재구성 가능하게 된다. 이러한 WDM 네트워크의 특징은 IP, SONET, ATM과 같은 클라이언트 층이 요구하는 트래픽 패턴에 따라 가상 토폴로지를 재구성함으로서 네트워크 성능을 최적화시킬 수 있게 된다. 본 논문에서는 시간에 따라 변화하는 트래픽 패턴 하에서 가상 토폴로지를 재구성하면서, 각 광경로의 트래픽에 대한 로드벨런싱을 수행하는 기법을 제시한다. 이 기법은 기존의 기법들과 달리 미래의 트래픽 패턴을 알고 있다는 가정을 필요로 하지 않으며, 동적인 워터마즈 결정을 통해 전범위에서의 로드벨런싱을 수행하게 된다.