• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.529-532
• /
• 1988

This paper proposes a graph matching algorithm based on simulated annealing, which assures the globally optimal solution for circuit partitioning for the placement in the rectilinear region occurring as a result of the pre-placement of some macro cells, or onto the nonplanar surface in some military or space applications. The circuit graph ($G_{C}$) denoting the circuit topology is formed by a hierarchical bottom-up clustering of cells, while another graph called region graph ($G_{R}$) represents the geometry of a planar rectilinear region or a nonplanar surface for circuit placement. Finding the optimal many-to-one vertex mapping function from $G_{C}$ to $G_{R}$, such that the total mismatch cost between two graphs is minimal, is a combinatorial optimization problem which was solved in this work for various examples using simulated annealing.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.38-41
• /
• 2002

Many scientifc applications include manipulation of data points tying in a space. We describe a method, based on sector labeling to generate a space-filling curve for partitioning such given data points. Our method is straightforward and flexible, equipping a one-one correspondence between point-values on the curve and data points in space in more efficient than designated methods found in the literature. It is widely believed that the Hilbert curve achieves the desired properties on linear mappings due to the locality between data points. Therefore we focus on the Hilbert curve since, later on, we identify it as the most suitable for our application. We demonstrate on using our method for the data particles of an n-body simulation that based on Barnes-Hut algorithm.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.174-183
• /
• 2003

Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.26-28
• /
• 2008

Soil moisture plays an important role in the land-atmosphere energy balance because it governs the partitioning of energy through latent heat fluxes or evapotranspiration. From the numerous studies, it is evident that the L-band radiometer is a useful and effective tool to measure soil moisture. The objective of the study is to develop and to verify the soil moisture retrieval algorithms for the L-band radiometer system. Through the radiometer-observed brightness temperature, surface emissivity and reflectivity can be derived, and, hence, soil moisture. We collect field and L-band airborne radiometer data from washita92, SGP97 and SGP99 experiments to assist the development of the retrieval algorithms. Upon launching the satellite L-band radiometer such as ESA-sponsored SMOS (Soil Moisture and Ocean Salinity) mission, the developed algorithms may be used to study and monitor globe soil moisture change.

• Journal of the Korea Computer Graphics Society
• /
• v.5 no.2
• /
• pp.9-23
• /
• 1999

Visibility preprocessing is a useful method to reduce the complexity of scenes to be processed in real-time, and so enhances the overall rendering performance for interactive visualization of virtual environments. In this paper, we propose an efficient visibility preprocessing method. In the proposed method, we assume that navigatable areas in virtual environments are partitioned into rectangular parallelpiped cells or sub-worlds. To preprocess the visibility of each polygon for a given partitioned cell, we should determine at least the area-to-area visibility. This is inherently a four-dimensional problem. We efficiently express four-dimensional visibility information on two-dimensional spaces and keep it within a ternary tree, which is conceptually similar to a BSP(Binary Space Partitioning) tree, by exploiting the characteristics of conservative visibility. The proposed method is able to efficiently handle more general environments like urban scenes, and remove invisible polygons jointly blocked by multiple occluders. The proposed method requires O(nm) time and O(n+m) space. By selecting a suitable value for m, users can select a suitable level of trade-off between the preprocessing time and the quality of the computational result.

• Korean Institute of Interior Design Journal
• /
• no.13
• /
• pp.130-138
• /
• 1997

This study is to present the visual phenomenon of natural light in the interior space. The continuously changing natural light define the visual phenomenon of the architectural space. First, the objective of this study was finding the importance of the visual phenomena which were generated from correlating natural right with the interior space. And the second was to categorize the factors of the visual phenomenon which can be useful factors for modern interior design practice. As a result of this study, two visual phenomena were classified. First; territorial phenomenon: dividing, partitioning, and sectioning by natural light, Second; phenomena by the inflow methods of natural light; a) by direct inflow; transparency, expansion, and floating, b) by filtering fixtures; the architectural structure, color, and the transluscent material, c) by dramatic spacial present of natural light, d) by the sense of direction of naturel light; continuity, and transformatiov. Found and classified each factor is not presented by itself, rather compounded forms. Because of the limited analysis of modern buildings, these found visual factors can not represent all phenomena. But if we practice these finding factors to design present interior space, it is sure of being very valuable factors to re-introduce the overlooked natural light into interior space.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.171-174
• /
• 1998

A class of non-parametric detectors based on quantized m-dimensional noise sample space is introduced. Due to assuming the nongaussian noise as a channel model, it is not easy to design the detector through estimating the unknown functional form of noise; instead equiprobably partitioning m-dimensional noise into a finite number of regions, using a VQ and quantiles obtained by RMSA algorithm is used in this paper to design detectors. To show the comparison of performance between single sample detector and system suggested here, Monte-Carlo simulations were used. The effect of signal pulse shape on the receiver performance is analyzed too.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.493-496
• /
• 2000

In this paper, an adaptive neuro-fuzzy controller using the conditional fuzzy c-means(CFCM) methods is proposed. Usually, the number of fuzzy rules exponentially increases by applying the grid partitioning of the input space, in conventional adaptive neuro-fuzzy inference system(ANFIS) approaches. In order to solve this problem, CFCM method is adopted to render the clusters which represent the given input and output data. Finally, we applied the proposed method to the water path temperature control system and obtained a better performance than previous works.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1892-1893
• /
• 2011

본 논문에서는 Centroidal Voronoi Tessellation을 이용하여 군집로봇의 협조탐색을 위한 공간분할기법을 제안한다. 탐색공간은 Centroidal Voronoi Tessellation을 이용하여 분할한다. 전역 경로 계획 및 군집 로봇 간의 충돌 회피는 포텐셜 필드를 이용한다. 탐색공간에 밀도 함수를 사용하여 공간분할의 유동성을 부여한다. 마지막으로, 군집로봇의 협조탐색의 가능성을 시뮬레이션을 통하여 확인한다.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.2
• /
• pp.75-83
• /
• 2003

In this paper, OSP(Octal Space Partitioning) tree is proposed for the real time culling of infinite sets of geometries in interactive Virtual Environment applications. And MSVBSP(Modified Shadow Volume BSP) tree is suggested for the occlusion culling. Experimental results show that the OSP and MSVBSP tree are efficiently implemented in real time rendering of interactive geometries.