• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.477-490
• /
• 2006

Existing index structures need very much update cost because they repeat delete and insert operations in order to update continuously moving objects. In this paper, we propose a new index structure which reduces the update cost of continuously moving objects. The proposed index structure consists of a space partitioning index structure that stores the location of the moving objects and an auxiliary index structure that directly accesses to their current positions. In order to increase the fanout of the node, it stores not the real partitioning area but kd-tree as the information about the child node of the node. In addition, we don't traverse a whole index structure, but access the leaf nodes directly and accomplish a bottom-up update strategy for efficiently updating the positions of moving objects. We show through the various experiments that our index structure outperforms the existing index structures in terms of insertion, update and retrieval.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.64-70
• /
• 2003

Current growth of VLSI design depends critically on the research and development (If automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms Performing placement and routing impact on Performance and area of VLSI design. Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for the netlist partitioning problem for 4-layer channel routing. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of simulated annealing(SA) algorithm by analyzing the results which are the solution of given problems. Consequently experimental results show that out proposed algorithm reduce area over the SA algorithm.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.70-75
• /
• 2015

In this paper, we explore the efficient processing of continuous range queries over a huge number of moving objects, each of which retrieves the moving objects that are currently located within a geographic query region of interest. The moving objects should continually communicate with the server to report their current locations, so as to keep the results of the continuous range queries up-to-date. However, this increases the server workload and involves a enormous amount of communication as the number of continuous range queries and the moving objects becomes enormous. In this paper, we adopt an approach where we leverage available memory and computational resources of the moving objects in order to resolve these problems. To this end, we propose a query indexing structure, referred to as the Space Partitioning Query Index(SPQI), which enables the server to efficiently cooperate with the moving objects for processing continuous range queries. SPQI improves system performance in terms of server workload and communication cost. Through simulations, we show the superiority of SPQI.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.5 no.3 s.11
• /
• pp.29-39
• /
• 2006

In this paper, we propose an efficient method to detect the signal and evaluate performance of the system in frequency selective fading channel. We combine proposed system with OFDM (Orthogonal Frequency Division Multiplexing) to improve performance of the system. First, we study the SOSTTC-OFDM system using two transmit antenna and one receive antenna, and compare performance of the proposed space-time coded OFDM with that of previous system. We expand this system to the system using four transmit antennas with the proposed decoding method. Simulation results show that the proposed decoding method can detect the signal efficiently, and we identify that the performance of the proposed system is shown with varying doppler frequency in frequency selective fading channel.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.415-417
• /
• 2005

In order to retrieve the latent and sensible heat fluxes, high-resolution airborne imageries with visible, near infrared, and thermal infrared bands and ground-base meteorology measurements are utilized in this paper. The retrieval scheme is based on the balance of surface energy budget and momentum equations. There are three basic surface parameters including surface albedo $(\alpha)$, normalized difference vegetation index (NOVI) and surface kinetic temperature (TO). Lowtran 7 code is used to correct the atmosphere effect. The imageries were taken on 28 April and 5 May 2003. From the scattering plot of data set, we observed the extreme dry and wet pixels to derive the fitting of dry and wet controlled lines, respectively. Then the sensible heat and latent heat fluxes are derived from through a partitioning factor A. The retrieved latent and sensible heat fluxes are compared with in situ measurements, including eddy correlation and porometer measurements. It is shown that the retrieved fluxes from our scheme match with the measurements better than those derived from the S-SEBI model.

• Journal of Astronomy and Space Sciences
• /
• v.19 no.2
• /
• pp.107-122
• /
• 2002

Multi-body spacecraft attitude and configuration control formulations based on the use of collaborative control theory are considered. The control formulations are based on two-player, nonzero-sum, differential game theory applied using a Nash strategy. It is desired that the control laws allow different components of the multi-body system to perform different tasks. For example, it may be desired that one body points toward a fixed star while another body in the system slews to track another satellite. Although similar to the linear quadratic regulator formulation, the collaborative control formulation contains a number of additional design parameters because the problem is formulated as two control problems coupled together. The use of the freedom of the partitioning of the total problem into two coupled control problems and the selection of the elements of the cross-coupling matrices are specific problems ad-dressed in this paper. Examples are used to show that significant improvement in performance, as measured by realistic criteria, of collaborative control over conventional linear quadratic regulator control can be achieved by using proposed design guidelines.

• The KIPS Transactions:PartB
• /
• v.8B no.2
• /
• pp.208-214
• /
• 2001

웨이블릿을 이용한 분해와 복원은 영상의 압축에 널리 사용되는 도구이다. 웨이블릿 분해된자연 영상은 원 영상의 동일 부분을 표현하는 대역간의 계수 값 사이에 높은 상관관계를 갖고 있고, 하나의 대역 안의 인접한 계수들 사이에도 높은 상관 관계를 갖고 있다. EZW(Evbedded Zerotree Wavelet)나 SPIHT(Set Partitioning in Hierachical Trees)과 같이 성능이 우수하고 널리 사용되는 웨이블릿 기반 영상 압축은 웨이블릿 계수의 대역간 상관 관계를 이용하고 있다. Zero Tree에 기초한 이와 같은 방법들은 계수값의 부모 후손 관계를 이용하기 때문에 대역별 부호화를 수행할 수 없으며, 다중 해상도 복원이 필요한 응용 분야에 효과적으로 적용되어지지 못한다. 본 논문에서는 하나의 대역 내에서 인접한 계수들 간의 상관성을 이용한 대역 독립적 부호화 기법을 제안한다. 압축 성능은 SPIHT과 대등하거나 약간 우수한 것으로 나타났고, 다중해상도 복원에 효과적으로 적용할 수 있음을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.610-615
• /
• 2002

This paper considers a communication system consisting of a vector quantizer with selected code vectors with mapped into points in the modulated signal space. The modulated signal is transmitted over a Rayleigh flat fading channel. We optimize the modulated signal constellation to minimize the overall distortion of the system with the fixed vector quantization codebook. The optimization is obtained by partitioning the modulated signal space. Simulation results show that the signal constellation based on the proposed optimization scheme outperforms the conventional methods.

• Child Studies in Asia-Pacific Contexts
• /
• v.5 no.1
• /
• pp.21-38
• /
• 2015

This paper reviews Grammatical Mapping theory, a recently proposed theoretical paradigm for understanding children's acquisition of syntax, and ventures to apply the theory to the acquisition of semantics. Particularly, we focused on the domain of space, and proposed how children might acquire a unique system of spatial words in their mother tongue. Based on our review of evidence, we propose that there may be universal semantic primitives that serve as foundations of word meanings. We also propose that children must learn their mother tongue's semantic category system of spatial relations, from real time data. Finally, we argue that children's learning of word meanings may involve creation of a theory that makes sense to the child, and that this process of theory creation is possibly guided by universal principles and parameters.

• ETRI Journal
• /
• v.30 no.4
• /
• pp.618-620
• /
• 2008

A distributed virtual environment (DVE) allows multiple geographically distributed objects to interact concurrently in a shared virtual space. Most DVE applications use a non-replicated server architecture, which dynamically partitions a virtual space. An important issue in this system is effective scalability as the number of users increases. However, it is hard to provide suitable load balancing because of the unpredictable movements of users and hot-spot locations. Therefore, we propose a mechanism for sharing roles and separating service regions. The proposed mechanism reduces unnecessary partitions of short duration and supports efficient load balancing.