• Title/Summary/Keyword: Line Replacement

Search Result 184, Processing Time 0.025 seconds

The Method for Replacement of Strain Pole Crossarm using the Hot-line Support Arm (핫라인 써포트암을 이용한 완철교체공법)

  • Mun, S.W.;Park, Y.B.;Kim, J.S.;Song, H.S.;Cho, S.H.;Choi, M.H.
    • Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
    • /
    • 2006.05a
    • /
    • pp.59-64
    • /
    • 2006
  • In this paper, developed a uninterruptible hotline tools and method for replacement of strain pole crossarm on overhead distribution line. For practical use of developed tools, following direct hot-line methods were proposed: 'Direct hot-line method for replacement of pin pole crossarm', 'Direct hot-line method for alteration of crossarm' and 'Crossarm replacement method in uninterruptible cable displacement area'. These methods were proposed more simple and safe working on hotline job.

  • PDF

Development of Uninterruptible Hotline Tools and Method for Replacement of Strain Pole Crossarm on Overhead Distribution Line (가공배전선로용 무정전 내장주 완철교체용 활선공구 및 표준활션공법 개발)

  • Kim, Jeom-Sik;Song, Hyun-Suk;Mun, Sung-Won;Park, Yong-Beom;Cho, Si-Hyoung;Choi, Myoung-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2006.05a
    • /
    • pp.5-7
    • /
    • 2006
  • In this paper, developed a uninterruptible hotline tools and method for replacement of strain pole crossarm on overhead distribution line. For practical use of developed tools, following direct hot-line methods were proposed: 'Direct hot-lire method for replacement of pin pole crossarm', 'Direct hot-line method for alteration of crossarm' and 'Crossarm replacement method in uninterruptible cable displacement area'. These methods were proposed more simple and safe working on hotline job.

  • PDF

Procedure-Based On-Line Program Replacement (프로시저 단위의 온라인 프로그램 교체)

  • 김영진;이인환
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.1005-1008
    • /
    • 1999
  • This paper presents a method for procedure-based on-line program replacement for user applications. To deal with the size change in the procedure to replace, the method uses the unmapped area of process address space for mapping a new version of procedure. The method is effective in that and it does not cause large performance loss during the replacement or require any additional software layer for the replacement. The method is illustrated in the SUN Solaris environment.

  • PDF

Keeping-ownership Cache Replacement Policies for Remote Access Caches of NUMA System (NUMA 시스템에서 소유권에 근거한 원격 캐시 교체 정책)

  • 신숭현;곽종욱;장성태;전주식
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.8
    • /
    • pp.473-486
    • /
    • 2004
  • NUMA systems have remote access caches(RAC) in each local node to reduce the overhead for repeated remote memory accesses. By this RAC, memory latency and network traffic can be reduced and the performance of the multiprocessor system can be improved. Until now, several cache replacement policies have been proposed in recent years, and there also is cache replacement policy for multiprocessor systems. In this paper, we propose a cache replacement policy which is based on cache line coherence information. In this policy, the cache line that does not have an ownership is replaced first with respect to cache line that has an ownership. Like this way, the overhead to transfer ownership is avoided and the memory latency can be decreased. We also propose “Keeping-Ownership replacement policy with MRU (KOM)” and “Keeping-Ownership replacement policy with Reference Bit(KORB)” to reduce the frequent replacement penalty of the ownership-lacking cache line. We compare and analyze these with LRU and Pseudo LRU(PLRU). The simulation shows that KOM outperforms the PLRU by 25%, and KORB outperforms the PLRU by 13%. Although the hardware cost of KOM is very small, the performance of KOM is nearly equal to that of the LRU.

Cache Replacement Policy Based on Dynamic Counter for High Performance Processor (고성능 프로세서를 위한 카운터 기반의 캐시 교체 알고리즘)

  • Jung, Do Young;Lee, Yong Surk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.4
    • /
    • pp.52-58
    • /
    • 2013
  • Replacement policy is one of the key factors determining the effectiveness of a cache. The LRU replacement policy has remained the standard for caches for many years. However, the traditional LRU has ineffective performance in zero-reuse line intensive workloads, although it performs well in high temporal locality workloads. To address this problem, We propose a new replacement policy; DCR(Dynamic Counter based Replacement) policy. A temporal locality of workload dynamically changes across time and DCR policy is based on the detection of these changing. DCR policy improves cache miss rate over a traditional LRU policy, by as much as 2.7% at maximum and 0.47% at average.

A Study on the Numerical Model for Predicting Depth of Replacement and Consolidation by Embankment on Weak Soil (항만구조물의 기초처리공법 중 수치 PROGRAM을 이용한 강제치환 예상 추정선에 관한 연구)

  • 이상화;이영재
    • Journal of Ocean Engineering and Technology
    • /
    • v.14 no.3
    • /
    • pp.61-65
    • /
    • 2000
  • The estimation of soil stabilization is of great importance concerning the construction of structures on weak soil. A typical model of soil stabilization is considered as replacement, which is based on ground at failure due to direct loading on weak soil. The calculation of the line of predicting settlement was carried out using RPL and DIKE programs. The DIKE program is showing a tendency to excel totally about this embankment of the seadike. Hereafter, This program will be contributed widely to the construction of offshore structures on weak soil.

  • PDF

Procedure-Based On-Line Program Replacement (프로시저 단위의 온라인 프로그램 교체)

  • Kim, Young-Jin;Kim, Hyung-Gon;Kim, Hwa-Jun;Lee, In-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.4
    • /
    • pp.327-341
    • /
    • 2000
  • This paper presents a method for procedure-based on-line program replacement for user applications and illustrates the method in the SUN Solaris environment. In addition to developing procedures for directly changing the address space of a running process, the paper provides solutions on how to allocate space for the new version procedure and how to make the new version procedure work correctly in the old version process address space, when the size of new version procedure is different from that of old version, and thus facilitates procedure-based on-line software replacement. The method performs on-line program replacement using services provided by existing operating systems. Also, the method supports a small, procedure-based replacement and directly modifies necessary parts of a process address space, which results in small performance loss.

  • PDF

Replacement Condition Detection of Railway Point Machines Using Data Cube and SVM (데이터 큐브 모델과 SVM을 이용한 철도 선로전환기의 교체시기 탐지)

  • Choi, Yongju;Oh, Jeeyoung;Park, Daihee;Chung, Yongwha;Kim, Hee-Young
    • Smart Media Journal
    • /
    • v.6 no.2
    • /
    • pp.33-41
    • /
    • 2017
  • Railway point machines act as actuators that provide different routes to trains by driving switchblades from the current position to the opposite one. Since point failure caused by the aging effect can significantly affect railway operations with potentially disastrous consequences, replacement detection of point machine at an appropriate time is critical. In this paper, we propose a replacement condition detection method of point machine in railway condition monitoring systems using electrical current signals, after analyzing and relabeling domestic in-field replacement data by means of OLAP(On-Line Analytical Processing) operations in the multidimensional data cube into "does-not-need-to-be replaced" and "needs-to-be-replaced" data. The system enables extracting suitable feature vectors from the incoming electrical current signals by DWT(Discrete Wavelet Transform) with reduced feature dimensions using PCA(Principal Components Analysis), and employs SVM(Support Vector Machine) for the real-time replacement detection of point machine. Experimental results with in-field replacement data including points anomalies show that the system could detect the replacement conditions of railway point machines with accuracy exceeding 98%.

Remote Cache Replacement Policy using Processor Locality in Multi-Processor System (다중 프로세서 시스템에서 프로세서 지역성을 이용한 원격 캐쉬 교체 정책)

  • Han Sang Yoon;Kwak Jong Wook;Jhang Seong Tae;Jhon Chu Shik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.541-556
    • /
    • 2005
  • The memory access latency of the system has been a primary factor of performance degradation in single-processor system and multi-processor system. The remote memory access latency takes a lot of overhead over the local memory access latency especially in the distributed shared-memory system. To resolve this problem, the multi-level cache architecture that contains a remote cache in the multi-processor system has been proposed. In this paper, we propose a new cache replacement policy that improves the performance of the multi-processor system with the remote cache. If the multi-level cache keeps the multi-level inclusion(MLI) property and uses the LRU(Least Recently Used) cache replacement policy, the LRU information of the higher-level cache(a processor cache) would be different with that of the lower-level cache(a remote cache). In this situation, the replacement of a remote cache line can induce the exchange of a processor cache line that is used by the processor. It is a main factor of performance degradation in a whole system. To alleviate this disadvantage of the LRU replacement polity, the new policy analyses tht processor's remote memory access pattern of each node and uses this information to reduce the number of invalidations of the useful cache line in the higher-level cache. The new replacement policy of the remote cache can improve the performance by $3.5\%$ in maximum and $2.5\%$ in average on SPLASH-2 benchmarks, compared to the general LRU cache replacement policy.

A Study on the Effect of Returned Clothes Via On-line Sales on Their Brands (온라인상(上)에서 의류제품(衣類製品)의 반품(返品) 경험(經驗)이 브랜드에 대(對)한 태도(態度)에 미치는 영향(影響) 연구(硏究))

  • Kim, Yeon-Hee;Kim, Il
    • Journal of Fashion Business
    • /
    • v.7 no.4
    • /
    • pp.26-42
    • /
    • 2003
  • On-line clothes sale are on the increase, and the returns(for replacements or refunds) of the clothes are also increasing. Many studies on off-line consumers' complaints were made before, but few studies on the returns of clothes sold on-line have been made. From this viewpoint, this study was conducted to know what effect returns of clothes sold on-line have on their brands. Therefore, this study was first focused on the factors affecting complaint acts(return intention or return acts) such as lack of information and recognition of product, delivery errors and product defects concerning on-line sales, and second investigated the changes of buyers' attitude toward the brand following the their acts of returning the buyers, and third looked into the changes of on-line buyers' attitude toward the brand. The study is carried out by subdividing the objects of the study into return action(replacement, refundment) and purchasers who experienced return intention. Such experience is demonstratively analyzed to find how it has affected the attitude toward the brand. The study comes up with the following outcomes. First, the effect factor causing complaint action(return action, return intention) on-line is shown as the lack of the information and recognition of the product. Second, it is revealed that the effect factor causing complaint(return action, return intention) does not lie in an error in delivery or a defect of a product. Third, the positive response of a brand to a return action does not raise the repurchasing intention and positive attitude of purchasers who experienced returning a product, but lowers their private complaint action intention. Fourth, the repurchase intention of purchasers who experienced return intention for the brand is lowered, but their negative attitude and private complaint action intention is not raised.