• Title/Summary/Keyword: Replacement Algorithm

Search Result 234, Processing Time 0.024 seconds

Optimal Block Lifting Scheduling Considering the Minimization of Travel Distance at an Idle State and Wire Replacement of a Goliath Crane (골리앗 크레인의 공주행 거리와 와이어 교체 최소를 고려한 최적 블록 리프팅 계획)

  • Roh, Myung-Il;Lee, Kyu-Yeul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.1
    • /
    • pp.1-10
    • /
    • 2010
  • Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.

Prediction Equation of Compulsory Replacement Depth of Silty Layer in Sihwa Region (시화지역 실트질 지반에서 강제치환심도 예측식 산정)

  • Park, Young;Lim, Heui-Dae
    • Journal of the Korean Geotechnical Society
    • /
    • v.27 no.9
    • /
    • pp.55-66
    • /
    • 2011
  • The compulsory replacement method for soft ground treatment is simple but excellent in economic feasibility. However, the accurate replacement depth is not easy to properly predicted since an theoretical algorithm has not presently been established so far. In this research a prediction equation is proposed in a new form based on the liquid limit and natural moisture content rather than on the bearing capacity of the soft soil layer. The equation is based on the monitoring as well as the confirmatory boring at the site. In addition, the equation has been derived from the data obtained from the analysis of the characteristics of silt/clay of Sihwa region. The final prediction equation has been drawn by applying the regression analysis method.

Delay Attenuation LFU (DA-LFU) Cache Replacement Policy to Improve Hit Rates in CCN (CCN에서 적중률 향상을 위한 지연감쇠 LFU(DA-LFU) 캐시 교체 정책)

  • Ban, Bin;Kwon, Tae-Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.3
    • /
    • pp.59-66
    • /
    • 2020
  • Content Centric Network(CCN) with architecture that is completely different from traditional host-based networks has emerged to address problems such as the explosion of traffic load in the current network. Research on cache replacement policies is very active to improve the performance of CCN with the characteristics that all routers cache on the network. Therefore, this paper proposes a cache replacement policy suitable for situations in which popularity is constantly changing, taking into account the actual network situation. In order to evaluate the performance of the proposed algorithm, we experimented in an environment where the popularity of content is constantly changing, and confirmed that we are superior to the existing replacement policy through comparing hit rates and analyzing server load.

A Study on Disposal Diagnosis Algorithm of PV Modules Considering Performance Degradation Rate (태양광모듈의 성능저하율을 고려한 폐기진단 알고리즘에 관한 연구)

  • Park, Ji-Hyun;Lee, Hu-Dong;Tae, Dong-Hyun;Ferreira, Marito;Rho, Dae-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.10
    • /
    • pp.493-502
    • /
    • 2019
  • Recently, the installation of renewable energy including PV systems in distribution systems has increased energetically to cope with climate change and energy shortages according to the government's policy of renewable energy 3020. On the other hand, the electrical performance and lifespan of PV modules installed outdoors can be decreased considerably due to a range of deterioration phenomena depending on the ambient environmental factors. To overcome these problems, replacement of degraded PV modules with new ones is increased before the lifespan guaranteed by the makers of PV modules. Therefore, this paper proposes a disposal diagnosis algorithm to evaluate the time interval of the optimal replacement for PV modules according to performance degradation rate of PV modules. In addition, this study modeled an economic evaluation, which is composed of the cost and benefit of PV systems. From the simulation results based on the proposed modeling and algorithm to consider the performance degradation rate specifically, the replacement approach was found to have the best B/C ratio in 10th year with a 3[%] degradation rate and the disposal diagnosis algorithm of PV modules are useful and practical tools for economic evaluations of the replacement of PV modules.

An Efficient Data Replacement Algorithm for Performance Optimization of MapReduce in Non-dedicated Distributed Computing Environments (비-전용 분산 컴퓨팅 환경에서 맵-리듀스 처리 성능 최적화를 위한 효율적인 데이터 재배치 알고리즘)

  • Ryu, Eunkyung;Son, Ingook;Park, Junho;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.9
    • /
    • pp.20-27
    • /
    • 2013
  • In recently years, with the growth of social media and the development of mobile devices, the data have been significantly increased. MapReduce is an emerging programming model that processes large amount of data. However, since MapReduce evenly places the data in the dedicated distributed computing environment, it is not suitable to the non-dedicated distributed computing environment. The data replacement algorithms were proposed for performance optimization of MapReduce in the non-dedicated distributed computing environments. However, they spend much time for date replacement and cause the network load for unnecessary data transmission. In this paper, we propose an efficient data replacement algorithm for the performance optimization of MapReduce in the non-dedicated distributed computing environments. The proposed scheme computes the ratio of data blocks in the nodes based on the node availability model and reduces the network load by transmitting the data blocks considering the data placement. Our experimental results show that the proposed scheme outperforms the existing scheme.

Load Redistribution of Prestressed Concrete Girder Bridges during the Bearing Replacement

  • Park, Sun-Kyu;Kim, Hyeong-Yeol;Kim, Jung-Hyuk
    • KCI Concrete Journal
    • /
    • v.11 no.3
    • /
    • pp.141-151
    • /
    • 1999
  • In the replacement of bearing system of bridges, the jacking work to secure work spaces may cause damage of the superstructure, hence the behavior of superstructure by the jacking force must be considered. Especially, in prestressed concrete I-type girder bridges, considering the stress concentration at the girder and the load redistribution of superstructure, the allowable jacking force and jacking sequence have to be determined. In this study, an analytical method is proposed to calculate the jacking force and overall jacking sequence for the replacement of bearing system without any damage to the superstructure. The stress concentration at the girder and load redistribution of the deck due to jacking force are considered to compute the allowable jacking force for each girder and overall jacking sequence for girders in the deck. Using the solution algorithm developed in this study, the optimum jacking sequence and required jacking force for the prestressed concrete I-type gilder bridge having the standard sections are calculated.

  • PDF

Dynamic Programming Model for Optimal Replacement Policy with Multiple Challengers (다수의 도전장비 존재시 설비의 경제적 수명과 최적 대체결정을 위한 동적 계획모형)

  • Kim, Tae-Hyun;Kim, Sheung-Kown
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.4
    • /
    • pp.466-475
    • /
    • 1999
  • A backward Dynamic Programming(DP) model for the optimal facility replacement decision problem during a finite planning horizon is presented. Multiple alternative challengers to a current defender are considered. All facilities are assumed to have finite service lives. The objective of the DP model is to maximize the profit over a finite planning horizon. As for the cost elements, purchasing cost, maintenance costs and repair costs as well as salvage value are considered. The time to failure is assumed to follow a weibull distribution and the maximum likelihood estimation of Weibull parameters is used to evaluate the expected cost of repair. To evaluate the revenue, the rate of operation during a specified period is employed. The cash flow component of each challenger can vary independently according to the time of occurrence and the item can be extended easily. The effects of inflation and the time value of money are considered. The algorithm is illustrated with a numerical example. A MATLAB implementation of the model is used to identify the optimal sequence and timing of the replacement.

  • PDF

Video Compression using Characteristics of Wavelet Coefficients (웨이브렛 계수의 특성을 이용한 비디오 영상 압축)

  • 문종현;방만원
    • Journal of Broadcast Engineering
    • /
    • v.7 no.1
    • /
    • pp.45-54
    • /
    • 2002
  • This paper proposes a video compression algorithm using characteristics of wavelet coefficients. The proposed algorithm can provide lowed bit rate and faster running time while guaranteeing the reconstructed image qualify by the human virtual system. In this approach, each video sequence is decomposed into a pyramid structure of subimages with various resolution to use multiresolution capability of discrete wavelet transform. Then similarities between two neighboring frames are obtained from a low-frequency subband which Includes an important information of an image and motion informations are extracted from the similarity criteria. Four legion selection filters are designed according to the similarity criteria and compression processes are carried out by encoding the coefficients In preservation legions and replacement regions of high-frequency subbands. Region selection filters classify the high-frequency subbands Into preservation regions and replacement regions based on the similarity criteria and the coefficients In replacement regions are replaced by that of a reference frame or reduced to zero according to block-based similarities between a reference frame and successive frames. Encoding is carried out by quantizing and arithmetic encoding the wavelet coefficients in preservation regions and replacement regions separately. A reference frame is updated at the bottom point If the curve of similarity rates looks like concave pattern. Simulation results show that the proposed algorithm provides high compression ratio with proper Image quality. It also outperforms the previous Milton's algorithm in an Image quality, compression ratio and running time, leading to compression ratio less than 0.2bpp. PSNR of 32 dB and running tome of 10ms for a standard video image of size 352${\times}$240 pixels.

A Study on Rheological Properties of Cement Paste using Expansive Additives by Kind & Replacement Ratio (팽창재 종류 및 치환율에 따른 시멘트 페이스트의 레올로지 특성)

  • Park, Chun-Young;Kang, Byeung-Hee
    • Journal of the Korea Institute of Building Construction
    • /
    • v.8 no.2
    • /
    • pp.99-106
    • /
    • 2008
  • To improve concrete tensile strength and bending strength, New plan that have more economical and simple manufacture process is groped. By an alternative plan, chemical pre-stressed concrete is presented. In this study, we analyzed the rheological properties of cement paste with the kind and replacement ratio of k-type CSA type expansive additives that is used mainly in domestic. and we suggested that the algorithm of a mixing plan in the chemical pre-stressed concrete and from this, we presented the basic report for the right mixing plan. From the results, Flow increased more or less according to use of expansive additives. This phenomenon was observed by increasing paste amount that shows as substitution for expansive additives that specific gravity is smaller than that of cement. As linear regression a result supposing paste that mix expansive additives by Bingham plastic fluid. The shear rate and shear stress expressed high interrelationship. therefore, flow analysis of quantitative was available. The plastic viscosity following to replacement ratio of expansive additives is no change almost, the yield value is decreased in proportion to the added amount of expansive additives. Through this experiment, we could evaluate rheological properties of cement paste using the expansive additives. Hereafter by an additional experiment, we must confirm stability assessment of material separation by using the aggregate with the kind and replacement ratio of expansive additives.

A LFU based on Real-time Producer Popularity in Concent Centric Networks (CCN에서 실시간 생성자 인기도 기반의 LFU 정책)

  • Choi, Jong-Hyun;Kwon, Tea-Wook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.6
    • /
    • pp.1113-1120
    • /
    • 2021
  • Content Central Network (CCN) appeared to improve network efficiency by transforming IP-based network into content name-based network structures. Each router performs caching mechanism to improve network efficiency in the CCN. And the cache replacement policy applied to the CCN router is an important factor that determines the overall performance of the CCN. Therefore various studies has been done relating to cache replacement policy of the CCN. In this paper, we proposed a cache replacement policy that improves the limitations of the LFU policy. The proposal algorithm applies real-time producer popularity-based variables. And through experiments, we proved that the proposed policy shows a better cache hit ratio than existing policies.