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

This paper implements and improves the performance of high computational subtractive clustering algorithm using a single instruction, multiple data (SIMD) based many-core processor. In addition, this paper implements five different processing element (PE) architectures (PEs=16, 64, 256, 1,024, 4,096) to select an optimal PE architecture for the subtractive clustering algorithm by estimating execution time and energy efficiency. Experimental results using two different medical images and three different resolutions ($128{\times}128$, $256{\times}256$, $512{\times}512$) show that PEs=4,096 achieves the highest performance and energy efficiency for all the cases.

• Computers and Concrete
• /
• v.13 no.2
• /
• pp.271-290
• /
• 2014

In this study, structural irregularities in plan, which has a considerable effect on earthquake behavior of buildings, have been investigated in detail based on Turkish Earthquake Code 2007. The study consists of six main parametric models and a total of 144 sub-models that are grouped based on RC structural systems such as frame, frame + rigid core, frame with shear wall, and frame with shear wall + rigid core. All models are designed to have both symmetrical plan geometry and regular rigidity distribution. Changes in the earthquake behavior of buildings were evaluated according to the number of storeys, number of axes and the configuration of structural elements. Many findings are obtained and assessed as a result of the analysis for each structural irregularity. The study shows that structural irregularities can be observed in completely symmetric buildings in terms of plan geometry and rigidity distribution.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.35 no.5
• /
• pp.56-63
• /
• 2007

This study used the nearest feature model to connect forest patches within the western Geum River Basin. Due to many different forest patch sizes, 3 alternative methods were tested to determine the best way to establish an ecological network with forest patches. Alternative 1 used all forest patches to determine whether patches were large enough. Alternative 2 used forest patches over 10 ha in size. Alternative 3 used natural conservation indices to select forest patches containing better qualities in the natural conservation level. As a result 635 out of 724 patches of over 10 ha were selected for comparison. Alternative 1 showed that forest patches of less than 10 ha were outliers interrupting the establishment of the ecological network. They generated an unnecessary ecological network to link core areas to comparison features. The ecological network was improved by using forest patches greater than 10 ha in size(Alternative 2). Each comparison feature was much more hierarchically connected to core areas in Alternative 2 than in Alternative 1. Forest patches filtered by natural conservation indices were useful for obtaining the best ecological network. Alternative 3 clearly showed the connections in the ecological network between core areas and forest.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.1
• /
• pp.7-13
• /
• 2011

Matrix multiplication is a fundamental operation of linear algebra and arises in many areas of science and engineering. This paper introduces an efficient parallel matrix multiplication scheme on N ${\times}$ N mesh-connected SIMD array processor, called multiple hierarchical SIMD architecture (HMSA). The architectural characteristic of HMSA is the hierarchically structured control units which consist of a global control unit, N local control units configured diagonally, and $N^2$ processing elements (PEs) arranged in an N ${\times}$ N array. PEs are communicating through local buses connecting four adjacent neighbor PEs in mesh-torus networks and global buses running across the rows and columns called horizontal buses and vertical buses, respectively. This architecture enables HMSA to have the features of diagonally indexed concurrent broadcast and the accessibility to either rows (row control mode) or columns (column control mode) of 2D array PEs alternately. An algorithmic mapping method is used for performance evaluation by mapping matrix multiplication on the proposed architecture. The asymptotic time complexities of them are evaluated and the result shows that paralle matrix multiplication on HMSA can provide significant performance improvement.

• The KIPS Transactions:PartB
• /
• v.18B no.4
• /
• pp.173-180
• /
• 2011

This paper shows an approach for real-time object segmentation on GPU (Graphics Processing Unit) using CUDA (Compute Unified Device Architecture). Recently, many applications that is monitoring system, motion analysis, object tracking or etc require real-time processing. It is not suitable for object segmentation to procedure real-time in CPU. NVIDIA provide CUDA platform for Parallel Processing for General Computation to upgrade limit of Hardware Graphic. In this paper, we use adaptive Gaussian Mixture Background Modeling in the step of object extraction and CCL(Connected Component Labeling) for classification. The speed of GPU and CPU is compared and evaluated with implementation in Core2 Quad processor with 2.4GHz.The GPU version achieved a speedup of 3x-4x over the CPU version.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.34 no.7
• /
• pp.89-98
• /
• 2018

Koolhaas' perspective on urbanism differs from the modern urbanism and typological urbanism. The Melun-Senart masterplan, La $D{\acute{e}}fense$ masterplan shows unique characteristic different from that of conventional urbanism. The roots of this creative approach can be found in the traits of his research with O.M. Ungers back in the 1970s. Koolhaas and Ungers have collaborated intimately from 1972 to 1977 to work on urban projects. This collaboration reaches its cilmax in their project City in the City, where many of Koolhaas' core concepts such as archipelago, void/solid, plurality, infrastructure, congestion, and social condenser are introduced. This thesis will explore the development of these concepts in their collaboration and shed new light on how this period has made a transition into Koolhaas' perspective on urbanism and architecture as well as his works. The purpose of this study is to investigate these core concepts of Koolhaas in City in the City, and to find the development and the meaning of these concepts in his projects.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.30-35
• /
• 2002

The deployment of multicast communication services in the Internet is expected to lead a stable packet transfer even in heavy traffic as in On-Line Game environment. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. So, measuring the bottleneck link bandwidth along a path is important for understanding the performance of multicast. We propose not only a definition of CBT's core link state that Steady-State(SS), Normal-State(NS) and Bottleneck State(BS) according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construct shard multicast trees.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2936-2938
• /
• 2005

The deployment of multicast communication services in the internet is expected to lead a stable packet transfer even in heavy traffic as in network system environment. The core based tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. so, measuring the bottleneck link bandwidth along a path is important for understanding th performance of multicast. We propose not only a definition of CBT's core link state that Steady-State, Normal-State and Bottleneck State according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construst shard multicast trees.

• Journal of Game and Entertainment
• /
• v.2 no.1
• /
• pp.8-16
• /
• 2006

The development of multicast communication services in the Internet is expected to lead a stable packet transfer even though On-Line Games generate heavy traffic. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibits two major deficiencies traffic concentration or poor core placement problem. Thus, measuring the bottleneck link bandwidth along a path is important to understand the performance of multicast. We propose a method in which the core router's state is classified into SS(Steady State), NS(Normal State) and BS(Bottleneck State) according to the estimated link speed rate, and also the changeover of multicast routing scheme for traffic overload. In addition, we introduce Anycast routing tree, an efficient architecture for constructing shard multicast trees.

• Annual Conference of KIPS
• /
• 2014.04a
• /
• pp.87-89
• /
• 2014

Aho-Corasick (AC) algorithm is a multiple patterns string matching algorithm commonly used in many applications with real-time performance requirements. In this paper, we parallelize the AC algorithm on the Intel's Many Integrated Core (MIC) Architecture, Xeon Phi Coprocessor. We propose a new technique to compress the Deterministic Finite Automaton structure which represents the set of pattern strings again which the input data is inspected for possible matches. The new technique reduces the cache misses and leads to significantly improved performance on Xeon Phi.