• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.127-129
• /
• 2001

본 논문에서는 실시간성을 기반으로 하는 VOD시스템을 위한 우선 순위 가중치 기반의 가상 메모리 교체 기법을 제안하였다. 전통적인 운영체제에서 사용하는 가상 메모리 기법인 LRU와 LFU등은 우선 순위를 전혀 고려하지 않기 때문에 실시간 기반의 운영체제에는 전혀 적합하지 않다. 본 논문에서는 실시간성을 유지하기 위하여 프로세스의 우선 순위에 기반 한 차등화 된 가상 메모리 기법을 제안하였다. 그리고 낮은 우선 순위를 고려하여 주기억장치의 프로세스 공간 점유율도 고려하였다. 실험 결과, 서로 차등화 된 페이지 교체횟수를 보였고 일정한 수준의 우선 순위에 따라서 차등화 된 공간 점유율을 유지하였다.

• Proceedings of the Safety Management and Science Conference
• /
• 2005.05a
• /
• pp.291-295
• /
• 2005

• Journal of Korean Society of Water and Wastewater
• /
• v.28 no.5
• /
• pp.509-516
• /
• 2014

This study describes a reasonable planning method for water meter replacement which can minimize the metering under-registration for an increasement of revenue water. The increment analysis of real water usage was used to establish a replacement plan. The meter replacement database collected from K City was used as the basis of this analysis. The database included 964 connections of domestic and non-domestic consumers that had their meter replaced by aging at 2011. The result showed that the corelation between unregistered water volume and water meter age was lower than commonly expected where the current criteria of replacement is only water meter age(8 years) excluding the meters older than 13 years. And in the analysis result of water usage for 8 years, the total amount and increment of water usage had a significant effect on unregistered water volume. However the relation was different tendency as a total volume and slope of increment. In case of total water volume was larger than 10,000, larger than 7,000 and increment of 0.0 ~ -0.3, larger than 6,000 and increment more than -0.3 were analysed to need a replacement because of metering under-registration.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2016.05a
• /
• pp.523-523
• /
• 2016

본 연구에서는 두 지역의 실제 상수관망에 대해서 부정류해석을 수행하였고 각각의 상수관망에 필요한 부정류피해 최소화방안을 제시하였다. 본 연구에서는 실제 도시 상수관망인 광탄 GT1-1 소블럭 상수관망을 대상으로 부정류해석을 수행하였고 신뢰성해석을 통하여 구역별 파괴 확률을 산정하였다. 또한 상수관망의 운영인자로써 물 사용량지수와 급수전지수, 사용연수지수, 수압지수, 사고이력지수를 개발하여 광탄 GT1-1 소블럭 상수관망의 운영지수에 의한 구역별 위험도를 분석하여 상대적으로 안전에 취약한 구역을 선정할 수 있었다. 광탄 GT1-1 소블럭 상수관망을 7개 구역으로 나누어서 신뢰성해석과 운영지수에 따른 위험도 분석을 수행하였고 상대적으로 수격압으로 인한 관로파괴에 취약한 구역을 선정할 수 있었다. 또한 광탄 GT1-1 소블럭 상수관망에서는 구역별 파괴확률과 운영지수에 따른 위험도 순위가 같게 나타났다. 본 연구에서 개발된 상수 관망의 신뢰성해석모형과 운영지수를 운영관리에 적용한다면 향후 개량이나 교체가 필요한 상수 관로의 우선순위 선정에 유용하게 사용될 것으로 판단된다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.420-420
• /
• 2021

상수도관은 시간이 경과됨에 따라 부식이 발생하고 이로 인해 관의 두께 및 강도가 감소하여 점차 상수도관의 기능을 상실하게 된다. 이러한 노후 상수도관은 누수, 적수 등 수자원에 막대한 경제적인 손실을 발생시키고 사람들에게 많은 불편을 끼친다. 현재 우리나라도 전체 상수도관 중 노후 상수도관이 많은 부분을 차지하고 있기 때문에 교체나 개선이 시급한 실정이다. 하지만 전체 상수도관을 교체하는 것은 막대한 예산이 필요하기 때문에 현실적으로 어려운 문제이다. 따라서 상수도관의 노후도 분석을 통하여 상수관망의 최적 교체 우선순위를 판단하고 교체를 실시하는 것이 필요하다. 본 연구에서는 노후도 분석에 중요한 관의 부식깊이와 잔존수명을 예측하고 신뢰성해석을 통해 파괴확률을 산정하였다. 이를 위해 Romanoff(1957)와 환경부(2002)에서 실측한 상수관의 관종에 따른 관두께 변화를 적용하여 해석하였다. 실측 자료를 통해 부식깊이, 잔존수명 예측 모델을 수립하였으며 이에 따른 관의 파괴확률을 산정하였다. Romanoff(1957)의 혼합강관과 주철관에 대한 실측 자료를 사용하여 상수관의 사용연수가 10년, 20년, 30년 경과됨에 따른 부식깊이와 관파괴확률을 산정하였다. 혼합강관의 경우 사용연수에 따른 부식깊이는 0.57mm, 0.92mm, 1.21mm으로 산정되었으며, 주철관의 경우 0.16mm, 0.24mm, 0.31mm으로 산정되었다. 또한 신뢰성모형을 직경 300mm관에 적용한 결과 최대 상수도압 15kg/cm²에서 혼합강관의 사용연수에 따른 파괴확률은 3.36%, 4.65%, 6.18%로 나타났으며 주철관은 1.36%, 2.50%, 2.68%로 나타났다. 환경부(2002)의 주철관에 대한 부식 실측 자료를 통해 상수관의 사용연수 10년, 20년, 30년 경과에 따른 부식깊이와 관파괴확률을 산정하였으며 초기 관두께 측정 자료를 통해 잔존수명도 예측하였다. 부식깊이는 1.02mm, 1.25mm, 1.41mm으로 산정되었으며, 파괴확률은 5.15%, 6.30%, 7.35%로 산정되었다. 그리고 잔존수명의 경우 부식률이 20%일 때, 잔존수명은 약 30년으로 산정되었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.5
• /
• pp.315-327
• /
• 2013

Wireless Body Area Network (WBAN) is a network around a human body within 3~5m which consists of medical or non-medical device. WBAN has to satisfy many kinds of demands such as low-power, a variety of data rate and a data priority. Especially, it is hard for the nodes for monitoring vital signs to replace battery. Thus energy and channel efficiency is important because the battery power is limited. In this thesis, a novel algorithm for reducing the energy consumption is proposed. The proposed algorithm adjusts transmission period according to traffic. by means of determining transmission period by amount of data, the node can reduce energy consumption. Energy detection is performed in order to guarantee data priority before attempting to transmit. In case of failing to transmit, it is proposed that energy consumption is reduced through avoiding collision by changing priority. The comparison result shows that the proposed algorithm reduces power consumption and increasing maximum channel efficiency by avoiding collision.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.13-21
• /
• 2012

Mobile data caching is usually used as an effective way to improve the speed of local transaction processing and reduce server load. In mobile database environment, due to its characters - low bandwidth, excessive latency and intermittent network, caching is especially crucial. A lot of mobile data caching strategies have been proposed to handle these problems over the last few years. However, with smart phone widely application these approaches cannot support vast data requirements efficiently. In this paper, to make full use of cache data, lower wireless transmission quantity and raise transaction success rate, we design a new mobile data caching synchronization strategy based on in-demand and replacement priority. We experimentally verify that our techniques significantly reduce quantity of wireless transmission and improve transaction success rate, especially when mobile client request a large amount of data.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.82-94
• /
• 2015

In this paper, we propose hardware prefetch mechanism with an efficient cache replacement policy by giving priority to the trigger block in which a spatial region and producing a spatial region by using the displacement field. It could be taken into account the sequence of the program since a history is based on the trigger block of history record, and it could be quickly prefetching the instructions or data address by adding a stored value to the trigger address and displacement field since a history is stored as a displacement value. Also, we proposed a method of replacing at random by the cache replacement policy from the low priority block when the cache area is full after giving priority to the trigger block. We analyzed using the memory simulator program gem5 and PARSEC benchmark to assess the performance of the hardware prefetcher. As a result, compared to the existing hardware prefecture to generate the spatial region using a bit vector, L1 data cache miss rate was reduced about 44.5% on average and an average of 26.1% of L1 instruction misses occur. In addition, IPC (Instruction Per Cycle) showed an improvement of about 23.7% on average.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.372-385
• /
• 2002

In this paper, we propose an efficient buffer replacement method for the real-time multimedia data. The proposed method has multi level priority to consider the real-time characteristics. Each priority level is divided into a cold data set that is likely to be referenced for the first time and a hot data set that is likely to be re-referenced. An operation to select the victim data is sequentially executed from the cold set with the minimum priority level to the hot set with the maximum Priority level. It is chosen only at the lower level than or equal to the priority of the transaction that requests a buffer allocation. In the cold set, our method selects a media that has the maximum size in the level for a target of victim first of all. And in the hot set, our method selects a medium that has the maximum interval of the reference first of all. Since it maintains many popular media in the limited buffer space, the buffer hit ratio is increased. It also manages many service requests. As a result, our method improves the overall performance of the system. We compare the proposed method with the Priority-Hints method in terms of the buffer hit ratio and the deadline missing ratio of transactions. It is shown through the performance evaluation that our method outperforms the existing methods.

• Journal of the Korea Concrete Institute
• /
• v.17 no.3 s.87
• /
• pp.323-328
• /
• 2005

Bridge structures are properly designed in accordance with the design specifications with required safety margin. However, due to the heavy vehicle traffic and environmental attacks, bridge often requires repairs and the deteriorated one should be replaced or rehabilitated. In this paper, a prior ranking algorithm is proposed to assist a decision making process in bridge management at network level. Based on the literature survey for the existing studuies, two important factors which affect the decision making procedure for bridge management at network level are identified. These factors are implemented into the algorithm as a load carrying capacity function and traffic function, respectively.