• Title/Summary/Keyword: 교체비

Search Result 468, Processing Time 0.026 seconds

A weight-based cluster head replacement algorithm in the Internet of Things (사물인터넷에서 가중치 기반 클러스터 헤드 교체 알고리즘)

  • Kim, Jeong-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.11
    • /
    • pp.91-96
    • /
    • 2014
  • Since the sensors of Internet of Things (IOT) collect various data, the lifetime of sensor network is very important and the data should be aggregated efficiently. The contiguous collection by the certain sensors occurs an excessive battery consumption and successive transmission of same value of data should be avoided. To solve these things, we propose an weight-based cluster head replacement method that divides whole network into several grids and cluster head is selected by remaining energy, density of alive sensors and location of sensor. The aim of algorithm maximizes the lifetime of network. Our simulation results shows that the proposed method is very simple as well as balances energy consumption.

Temporal Price Reduction as Cooperative Price Discrimination (협력적 가격차별 수단으로서의 일시적 가격할인)

  • Song, Jae-Do
    • Asia Marketing Journal
    • /
    • v.12 no.2
    • /
    • pp.135-154
    • /
    • 2010
  • This paper considers a duopoly where switching costs exist. The analysis proves that temporal price reductions can be pure strategy equilibrium where firms earn more profit than in a regular price strategy. Greater profits result from price discrimination in temporal price reductions. The equilibrium is contrasted with previous studies, which explain temporal price reductions as a result of mixed strategy. In a given model with an assumption about forming switching cost, firms can control their range of loyal consumers by properly setting their regular and promotional prices. The model shows that temporal price reduction tends to raise the regular price and decrease the range of loyal consumers.

  • PDF

A Buffer Replacement Policy using Hot Page Management Scheme for Improving Performance of Flash Memory (플래시 메모리 성능향상을 위한 핫 페이지 관리 기법을 이용한 버퍼교체 정책)

  • Daeyoung Kim;Junghan Kim;Hyun-jin Cho;Young Ik Eom
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.860-863
    • /
    • 2008
  • 플래시 메모리는 우리 생활에 널리 사용되고 있는 휴대용 저장장치 중의 하나이다. 빠른 입출력 속도와 저전력, 무소음, 작은 크기 등의 장점을 가지나 덮어쓰기가 불가능하고 읽기/쓰기의 속도에 비해 소거 연산의 속도가 매우 느리다는 단점이 있다. 이를 보완하기 위해, 호스트와 플래시 메모리 사이에 버퍼 캐시를 두어 사용하고 있으며, 버퍼 캐시에 사용되는 교체 정책에 따라 플래시 메모리 장치의 성능이 크게 영향을 받는다. 본 논문에서는 블록 단위의 LRU 기법의 단점을 개선한 HPLRU 기법을 제안한다. HPLRU 기법은 최근에 자주 참조되었던 페이지인 핫 페이지 들을 모아 리스트를 만들어 관리하고, 이를 통해 페이지 적중률을 향상시키고 다른 페이지들로 인해 핫 페이지들이 소거되는 현상을 개선하였다. 이 알고리즘은 임의 데이터 패턴에 좋은 성능을 보이며 쓰기 발생 횟수를 많이 감소시키는 결과를 보였다.

The Development of ACNR Conductor(II) - Electric Properties (ACNR가공송전선의 개발(II) - 전기적 특성)

  • Kim, Shang-Shu;Kim, Byung-Geol;Lee, Hee-Woong;Park, Joo-Hwan
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2005.07a
    • /
    • pp.629-630
    • /
    • 2005
  • ACSR(Aluminum Conductor Steel Reinforced)가공송전선은 교류전류의 흐름에 의하여 코어 (Core)부에 자기장이 발생되어 전력손실을 발생시킨다. 이로 인한 전력손실을 최소화 하는 방법으로는 코어의 재질을 자성체인 고탄소강선 대신에 비자성강으로 교체하는 방법이 있다. 본 연구에서는 기존의 고탄소강선 대신에 고강도 비자성강을 코어(Core)에 적용한 ACNR(Aluminum Conductor Nonmagnetic Steel Reinforced) 가공송전선을 개발하였다. ACNR 가공송전선의 전기적 특성시험에서 약 9%정도의 손실저감효과를 나타내었다.

  • PDF

Semantic Caching Method that consider Layer and Region for Disconnected Operation in Location Based Service (위치 기반 서비스에서 비연결 연산을 위한 Layer와 Region을 고려한 의미론적 캐싱 기법)

  • 이상철;이충호;김재홍;배해영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.301-303
    • /
    • 2001
  • 현재 무선단말기 보급의 확대와 시간과 공간의 제약을 뛰어넘는 장점으로 무선 인터넷 환경이 급속도로 발전하고 있다. 그러나, 본 논문의 연구 분야인 모바일 지리정보 시스템(Mobile Geographic Information System)에서 무선인터넷을 통하여 실시간 지리 정보를 얻기 위해 사용자의 무선단말기와 서버 사이에 빈번한 데이터 송수신이 이뤄져야 하며 데이터의 빠른 변화를 수용해야 한다. 그러나, 아직 현저히 낮은 대역폭을 가진 채널을 통해 통신하며, 비싼 이용 요금과 오류로 인한 자발적 또는 비자발적 연결 끊김 현상 등은 서비스 제공에 한계를 가진다. 그러므로 본 논문에서는 이동 컴퓨팅 환경의 연구를 통해 연결 끊김 현상에서도 클라이언트의 지속적인 서비스 운영을 위한 비연결 연산으로 의미론적 캐시 기법과 캐시 교체 전략에 대해 알아보며, 본 논문에서는 Layer와 Region을 고려한 의미론적 캐싱 기법을 제안하여 무선 환경에서 동적인 지도서비스를 위한 기법을 제시하였다. 이 연구를 통해 아직 많은 한계를 지닌 무선인터넷 환경에서 지리정보뿐 아니라 위치기반의 다양한 서비스 분야에 응용될 수 있으리라 기대된다.

  • PDF

Effectiveness of Reinforcement for Transitional Zone between Tunnel and Earthwork Using the Large Sleeper (대형침목을 이용한 터널/토공 접속구간의 보강효과)

  • Choi, Chan-Yong;Lee, Jin-Wook;Kim, Hun-Ki
    • Journal of the Korean Society for Railway
    • /
    • v.13 no.2
    • /
    • pp.214-221
    • /
    • 2010
  • The transitional zone between tunnel and earthwork is one of the most vulnerable areas site for railway lines and because of differential settlement due to different stiffness of each supporting layer, it has to conducted a maintenance work constantly. In this study, it is conducted to compare the effect of reinforcement by wheel load and displacement of the sleepers after existing sleepers are replaced with the large sleepers for 20m long in-field transitional zone. Also, numerical parametric study using multi-layer elastic method has been performed to compare rail force, settlement and stresses of ballast while varying size and space of the sleeper. The field test and numerical results show that replacing the large sleepers improves about 10% of total settlement and coefficient of wheel force than conventional sleepers. Effectiveness of improvement is about 9.3%, 4%, 14.5% for rail seat force, settlement of sleepers and ballast pressure respectively with size of sleepers.

Efficient Cooperative Caching Algorithm for Distributed File Systems (분산 파일시스템을 위한 효율적인 협력캐쉬 알고리즘)

  • 박새미;이석재;유재수
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.11a
    • /
    • pp.234-244
    • /
    • 2003
  • In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced block to the idel node on cache replacement in order to maintain the replaced block in the cache field. However the wrong approximate information deteriorates the performance, the concistency maintenance goes to great expense to exchange messeges and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintance cost for consistency and the management cost for cache Age-information. Also, we show the superiority of our algorithm through the performance evaluation.

  • PDF

An Efficient Buffer Cache Management Algorithm based on Prefetching (선반입을 이용한 효율적인 버퍼 캐쉬 관리 알고리즘)

  • Jeon, Heung-Seok;Noh, Sam-Hyeok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.529-539
    • /
    • 2000
  • This paper proposes a prefetch-based disk buffer management algorithm, which we call W2R (Veighingjwaiting Room). Instead of using elaborate prefetching schemes to decide which blockto prefetch and when, we simply follow the LRU-OBL (One Block Lookahead) approach and prefetchthe logical next block along with the block that is being referenced. The basic difference is that theW2R algorithm logically partitions the buffer into two rooms, namely, the Weighing Room and theWaiting Room. The referenced, hence fetched block is placed in the Weighing Room, while theprefetched logical next block is placed in the Waiting Room. By so doing, we alleviate some inherentdeficiencies of blindly prefetching the logical next block of a referenced block. Specifically, a prefetchedblock that is never used may replace a possibly valuable block and a prefetched block, thoughreferenced in the future, may replace a block that is used earlier than itself. We show through tracedriven simulation that for the workloads and the environments considered the W2R algorithm improvesthe hit rate by a maximum of 23.19 percentage points compared to the 2Q algorithm and a maximumof 10,25 percentage feints compared to the LRU-OBL algorithm.

  • PDF

Design of a AC driver with constant current and negative temperature resistance for a LED lamp (정전류와 부 열저항 특성을 갖는 AC Direct Driver를 이용한 LED 형광등 개발)

  • Kim, Hyun-jo;Son, Kyung-min;Kim, Min;Kim, Gwan-Hyung;Byun, Gi-sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.382-384
    • /
    • 2013
  • LED is much brighter than the traditional incandescent, and low power consumption. Development and commercialization of LED fluorescent lamp is made in order to improve efficient fluorescent lamps with this existing and environmental problems. Because, unlike fluorescent lamps, it is not possible to directly use AC power to the unidirectional element having a polarity, LED requires a power supply. The power supply function is lowered as compared with the fluorescent lamp common in terms of maintenance costs because of the high price large. In this study, we constructed a circuit that can be controlled with a constant current in order to eliminate a phenomenon that brightness of the light which rectifies the AC power supply easy to place in the power supply due to the current change due to the voltage fluctuation is changed, in maintenance, I would like to propose how to develop a device which can be easily replaced less expensive composed of interchangeable modules of Plug in / out method to distinguish the LED module this.

  • PDF

Suggestion of an Automatic BIM-based Repair & Replacement (R&R) Cost Estimating Process (BIM기반 건축물 수선교체비 산정 자동화방안 제시)

  • Park, Ji-Eun;Yu, Jung-Ho
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2016.05a
    • /
    • pp.87-88
    • /
    • 2016
  • In order to assess the design value of engineering work from the point of view of LCC (Life Cycle Cost) in Korea, it is mandatory for all construction works that the total construction costs are over 10 billion won. The LCC includes initial construction costs, maintenance & operation costs, energy costs, end-of-life costs, and so on. Among these, the portion for maintenance & operation costs for a building is sizeable, as compared to the initial construction costs. Furthermore, the paradigm for construction industry has rapidly shifted from 2D to BIM, which includes design planning and data management. However, the study of BIM-based LCC analysis is not adequate today, even though all domestic construction projects ordered by the Public Procurement Service have to adopt BIM. Therefore, this study suggests a methodology of BIM-based LCC analysis that is particularly focused on repair and replacement (R&R) cost. For this purpose, we defined requirements of calculating R&R cost and extracted X from the relevant IFC data. Thereafter, we input them to the ontology of calculating the initial construction costs to obtain an objective output. Finally, in order to automatically calculate R&R cost, mapping with R&R criteria was performed. We expect that our methodology will contribute to more efficiently calculate R&R cost and, furthermore, that this methodology will be applicable to all range of total LCC. Thus, the proposed process of automatic BIM-based LCC analysis will contribute to making LCC analysis more fast and accurate than it is at present.

  • PDF