• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.414-424
• /
• 2012

Finding or automatically generating problem instance is useful for algorithm analysis/test. The topic has been of interest in the field of hardware/software engineering and theory of computation. We apply objective value-distance correlation analysis to problem spaces, as previous researchers applied it to solution spaces. According to problems, we define the objective function by (1) execution time of tested algorithm or (2) its optimality; this definition is interpreted as difficulty of the problem instance being solved. Our correlation analysis is based on the following aspects: (1) change of correlation when we use different algorithms or different distance functions for the same problem, (2) change of that when we improve the tested algorithm, (3) relation between a problem instance space and the solution space for the same problem. Our research demonstrates the way of problem instance space analysis and will accelerate the problem instance space analysis as an initiative research.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.338-338
• /
• 2017

하천기본계획, 생태하천 복원사업, 또는 하천재해예방 사업 등에 의해 수행되는 하천정비사업은 홍수재해예방, 생태하천 복구 등 여러 목적에 의해 시행되고 있다. 특히 최근 이루어지는 하천정비사업은 공원, 캠핑장, 주차장 등 시민들에게 다양한 편의시설을 제공하기 위한 친수공간으로 조성되고 있다. 이러한 하천구역 내의 친수공간 조성은 홍수주의보 및 홍수경보에 대응하는 유량에 비해 상대적으로 적은 유량에도 침수피해가 발생함으로써 중소규모의 유량에 대한 홍수위험도도 함께 증가시켰다. 친수공간 및 교량하부도로 등 저수위에 대한 홍수취약구간의 홍수정보를 취득하기 위해서는 해당 위험지점의 수위관측을 통해 위험상황을 실시간으로 모니터링 하는 것이 홍수피해에 대비하고 대응하기 위한 가장 확실한 방법이다. 하지만, 예산과 인력 등의 문제로 인해 모든 지점에 대해 수위관측을 실시하여 홍수예보시스템에 의해 홍수예측정보를 제공하기에는 현실적으로 한계가 있다. 따라서 친수공간에서의 홍수피해를 최소화하기 위해, 각 친수공간의 지형정보가 인근의 홍수예보지점 또는 수위관측소 지점과 어떠한 연관성을 갖는지 분석할 필요가 있다. 본 연구에서는 1차원 수리해석 모형을 통해 원거리에 위치한 수위관측 및 홍수정보를 이용하여 하천구역내 위치한 친수공간에 대한 침수위험도를 분석하기 위한 방법론을 제시하고자 하였다. 즉, 원거리에 위치한 수위관측소의 수위 및 유량 정보를 활용하여 수위관측이 이루어지 않는 지점의 침수정보를 예측하기 위한 방법론을 제시하고자 한다. 낙동강 하류부에 대해 제시한 방법론에 의해 목표로 하는 친수공간에 대한 유량별 수위에 대한 침수도표를 작성하였다. 본 방법론과 이에 의해 작성된 친수공간의 침수도표는 취약구간에 대한 각 수위별 침수정보를 제공하기 위한 기초자료로 활용될 수 있을 것으로 판단된다.

• Journal of KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.194-204
• /
• 2010

A space, real or virtual, comprises regions as its parts and physical objects residing in them. A coherent and sophisticated representaion scheme for their spatial relations premises the precision and plausibility in its associated agents' inferencing on the spatial relations and the development of events occurring in such a space. The existing spatial models are not suitable for a comprehensive representation of the general spatial relations in that they have limited expressive powers based on the dichotomy between the large and small scales, or support only a small set of topological relations. The representaion model we propose has the following distinctive chracteristics: firstly, our model provides a comprehensive representation scheme to accommodate large and small scale spaces in an integrated fashion; secondly, our model greatly elaborated the spatial relations among the small-scale objects based on their contact relations and the compositional relations among their respective components objects beyond the basic topological relations like disjoint and touch; thirdly, our model further diversifies the types of supported relations by adding the container property besides the soildness together with considering the gravity direction. The resulting integrated spatial knowledge representation scheme considering the gravity allows the diverse spatial relations in the real world to be simulated in a precise manner in relation to the associated spatial events and provides an expression measure for the agents in such a cyber-world to capture the spatial knowledge to be used for recognizing the situations in the spatial aspects.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.75-84
• /
• 2005

This research is to design a high performance NAND-type flash memory package with a smart buffer cache that enhances the exploitation of spatial and temporal locality. The proposed buffer structure in a NAND flash memory package, called as a smart buffer cache, consists of three parts, i.e., a fully-associative victim buffer with a small block size, a fully-associative spatial buffer with a large block size, and a dynamic fetching unit. This new NAND-type flash memory package can achieve dramatically high performance and low power consumption comparing with any conventional NAND-type flash memory. Our results show that the NAND flash memory package with a smart buffer cache can reduce the miss ratio by around 70% and the average memory access time by around 67%, over the conventional NAND flash memory configuration. Also, the average miss ratio and average memory access time of the package module with smart buffer for a given buffer space (e.g., 3KB) can achieve better performance than package modules with a conventional direct-mapped buffer with eight times(e.g., 32KB) as much space and a fully-associative configuration with twice as much space(e.g., 8KB)

• The KIPS Transactions:PartA
• /
• v.16A no.2
• /
• pp.69-78
• /
• 2009

One of the most effective way to improve cache performance is to exploit both temporal and spatial locality given by any program executive characteristics. In this paper we present a high performance and low power cache structure with a bank selection mechanism that enhances exploitation of spatial and temporal locality. The proposed cache system consists of two parts, i.e., a main direct-mapped cache with a small block size and a fully associative buffer with a large block size as a multiple of the small block size. Especially, the main direct-mapped cache is constructed as two banks for low power consumption and stores a small block which is selected from fully associative buffer by the proposed bank selection algorithm. By using the bank selection algorithm and three state bits, We selectively extend the lifetime of those small blocks with high temporal locality by storing them in the main direct-mapped caches. This approach effectively reduces conflict misses and cache pollution at the same time. According to the simulation results, the average miss ratio, compared with the Victim and STAS caches with the same size, is improved by about 23% and 32% for Mibench applications respectively. The average memory access time is reduced by about 14% and 18% compared with the he victim and STAS caches respectively. It is also shown that energy consumption of the proposed cache is around 10% lower than other cache systems that we examine.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.90-102
• /
• 2010

Flash memory has been widely used as an important storage device for consumer electronics. For the flash memory-based storage systems, FTL (Flash Translation Layer) is used to handle the mapping between a logical page address and a physical page address. Especially, log buffer-based FTLs provide a good performance with small-sized mapping information. In designing the log buffer-based FTL, one important factor is to determine the mapping structure between data blocks and log blocks, called associativity. While previous works use static associativity fixed at the design time, we propose a new log block mapping scheme which adjusts associativity based on the run-time workload. Our proposed scheme improves the I/O performance about 5~16% compared to the static scheme by adjusting the associativity to provide the best performance.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.461-470
• /
• 2013

The capacity for tracing relationships among various artifacts which are created at each phase of software system development is essential for software quality management. Software release refers to delivering a set of newly created or changed artifacts to customers. The relationships among artifacts which comprise software release must be traced so that the work for customer's requirement of change and functional enhancement is effectively established. And release management can be effectively realized through the integration of configuration management and change management. This paper proposes the technique for supporting change management of artifacts and for tracing relationships of artifacts which comprise software release through the integrated environment of personal workspace and configuration management system. In the proposed environment, the visualized version graph and automated tagging function are used for tracing relationships of artifacts.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.673-677
• /
• 2010

Recently, NAND flash memory has been widely used in embedded systems, personal computers, and server systems because of its attractive features, such as non-volatility, fast access speed, shock resistance, and low power consumption. Due to its hardware characteristics, specifically its 'erase-before-write' feature, Flash Translation Layer is required for using flash memory like hard disk drive. Many FTL schemes have been proposed, but conventional FTL schemes have problems such as block thrashing and block associativity problem. The KAST scheme tried to solve these problems by limiting the number of associations between data block and log block to K. But it has also block thrashing problem in random access I/O pattern. In this paper, we proposed a new FTL scheme, UDA-LBAST. Like KAST, the proposed scheme also limits the log block association, but does not limit data block association. So we could minimize the cost of merge operations, and reduce merge costs by using a new block reclaim scheme, log block garbage collection.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.49-58
• /
• 2020

In this study, we solve an online multi-object problem which finds object states (i.e. locations and sizes) while conserving their identifications in online-provided images and detections. We handle this problem based on a tracking-by-detection approach by linking (or associating) detections between frames. For more accurate online association, we propose novel online appearance learning with discrete fourier transform and partial least square analysis (PLS). We first transform each object image into a Fourier image in order to extract meaningful features on a frequency domain. We then learn PLS subspaces which can discriminate frequency features of different objects. In addition, we incorporate the proposed appearance learning into the recent confidence-based association method, and extensively compare our methods with the state-of-the-art methods on MOT benchmark challenge datasets.

• Journal of Environmental Science International
• /
• v.7 no.2
• /
• pp.177-184
• /
• 1998

The spatial rainfall distributions accompanied by the heavy rainfalls in the Korean peninsula were class-sified to 6 typical patterns and synoptic characteristics of each pattern were muined. 274 cases of heavy rainfall events occurred for 10 years from 1981 through 1990 were used for thls study In the 4 types of them, heavy rainfalls are not by the strongly developed but by the rapidly deepening low pressure systems. which have a wall defiried low and high level jets before arrival to the Korean peninsula. In another 2 types, heavy rainfall are due to speciauy developed surface low pressure system. Most of the heavy rain areas are associated with the location of the low level Jets and their direction and with the position of surface warm front. In the 4 types, the heavy rain areas extend In zonal direction. And the latitudinal locations of these areas are associated with the polar low center or strong main trough over 500 hPa level. The more northwestern part of the Asla the low locates the higher latitude in the Korean Peninsula the rainfall concentration occurs at. It is also known that the seasonal drifting of the lows have some relations to the procession of summer monsoon but its characteristics change year by year.