• Journal of the Korean Institute of Landscape Architecture
• /
• v.43 no.1
• /
• pp.16-28
• /
• 2015

This study is suggested to enlarge the green area and to connect and improve the present green areas by deriving the lines of community greenway using living areas and community spaces close to the life of residence in Nam-gu. The purpose of this paper is to suggest the method of establishing greenway for the formation of community in which the residence can grow the community spirit and love their living space much more. Land-use status, green coverage ratio, and impermeability paving ratio are investigated. The community facilities are classified. The highest is educational facility, which is 7.7%, the green facility is 1.9% and the total area of community facilities which is 21.4%. The total area of Nam-gu is divided into 31 zones in total according to the administrative districts, the mail roads and reserved land of railroad and urban development. The total 20 lines of community greenway lines are chosen and the total length of lines is 18.2km. Finally, the characteristics of community greenway lines are analysed, the characteristics of community greenway lines are overall estimated according to the land-use, the street environment and the community facility. The classification system of community greenway is established on the basis on the function and purpose of greenway, the present status of land-use and the type of community facility. Based on the field investigation, the 6 greenway types are suggested considering the interconnection. The method of establishment of community greenway is suggested according to the principle of function and purpose, the principle of land-use and the principle of use of the facilities. Furthermore, the planting methods suitable to each greenway type are suggested in the building planting case of wall planting, roof planting, veranda planting, etc., and in the complex planting of parks, schools, roads, parking lots and other small areas.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1183-1193
• /
• 2010

The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.10
• /
• pp.17-28
• /
• 1999

In this paper, an ASIC emulation system called ACE (ASIC Emulator) is proposed. It can produce the prototype of target ASIC in a short time and verify the function of ASIC circuit immediately The ACE is consist of emulation software in which there are EDIF reader, library translator, technology mapper, circuit partitioner and LDF generator and emulation hardware including emulation board and logic analyzer. Technology mapping is consist of three steps such as circuit partitioning and extraction of logic function, minimization of logic function and grouping of logic function. During those procedures, the number of basic logic blocks and maximum levels are minimized by making the output to be assigned in a same block sharing product-terms and input variables as much as possible. Circuit partitioner obtain chip-level netlists satisfying some constraints on routing structure of emulation board as well as the architecture of FPGA chip. A new partitioning algorithm whose objective function is the minimization of the number of interconnections among FPGA chips and among group of FPGA chips is proposed. The routing structure of emulation board take the advantage of complete graph and partial crossbar structure in order to minimize the interconnection delay between FPGA chips regardless of circuit size. logic analyzer display the waveform of probing signal on PC monitor that is designated by user. In order to evaluate the performance of the proposed emulation system, video Quad-splitter, one of the commercial ASIC, is implemented on the emulation board. Experimental results show that it is operated in the real time of 14.3MHz and functioned perfectly.

• Journal of the Korea Institute of Building Construction
• /
• v.16 no.1
• /
• pp.35-43
• /
• 2016

Concrete is a representative heterogeneous material and mechanical properties of concrete are influenced by various factors. Due to the fact that pores in concrete affect determining compressive strength of concrete, studies which deal with distribution and magnitudes of pores are very important. That way, studies using picture imaging have been emerged. Studies on mechanical performance evaluation of structural lightweight foamed concrete and FEM analysis based on picture image are inadequate because lightweight foamed concrete has been researched for only non-structural. Therefore, in this study, cement paste with foaming agent to evaluate mechanical performance is made, FEM analysis with picture image is conducted and young's modulus of experiment and analysis are compared. In this study, dosage of foaming agent is determined 7 level to check pore distribution and water-binder ratio is determined 20% to progress research about structural light weight foamed concrete. Weight of unit volume is minimum at 0.8% of foaming agent dosage. However, weight of unit volume is increased over 0.8% of foaming agent dosage because of interconnection with independent pores. For FEM analysis, cement paste is photographed to use image analyzer(HF-MA C01). Consequently, the fact that Young's Modulus of experiment and FEM analysis are same is drawn by using OOF(Object Oriented Finite elements).

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.5
• /
• pp.219-230
• /
• 2017

General-Purpose Graphics Processing Units (GPGPUs) build massively parallel architecture and apply multithreading technology to explore parallelism. By using programming models like CUDA, and OpenCL, GPGPUs are becoming the best in exploiting plentiful thread-level parallelism caused by parallel applications. Unfortunately, modern GPGPU cannot efficiently utilize its available hardware resources for numerous general-purpose applications. One of the primary reasons is the inefficiency of existing warp/thread block schedulers in hiding long latency instructions, resulting in lost opportunity to improve the performance. This paper studies the effects of hardware thread scheduling policy on GPGPU performance. We propose a novel warp scheduling policy that can alleviate the drawbacks of the traditional round-robin policy. The proposed warp scheduler first classifies the warps of a thread block into two groups, warps with long latency and warps with short latency and then schedules the warps with long latency before the warps with short latency. Furthermore, to support the proposed warp scheduler, we also propose a supplemental technique that can dynamically reduce the number of streaming multiprocessors to which will be assigned thread blocks when encountering a high contention degree at the memory and interconnection network. Based on our experiments on a 15-streaming multiprocessor GPGPU platform, the proposed warp scheduling policy provides an average IPC improvement of 7.5% over the baseline round-robin warp scheduling policy. This paper also shows that the GPGPU performance can be improved by approximately 8.9% on average when the two proposed techniques are combined.