Quasi-Periodic Replacement Policy for a Two-Unit Production System

Maintenance optimization of periodic replacement for mono-unit production system is a widely discussed topic.In practice,the replacement for a parallel production system with multi-unit served by one repairman is universal.The replacement action is often implemented in a maintenance window at random,although the replacement period appears as a quasi-periodic event.To optimize these maintenance policies,this study analyzes a bivariate quasi-periodic replacement policy (T,W) for a two-unit parallel production system with a maintenance window and one repairman.One unit of the system is replaced when either a failure occurs or a replacement plan comes in the maintenance window,whichever comes first.If one of the two units is in the replacement,the other may continue operating or waiting until the replacement is completed.An optimal replacement window [T*,T* + W*] can be obtained by jointly considering the system's long-running cost rate and the availability using the genetic algorithm.This study also introduces three examples of the production system with different types of units to illustrate the proposed policy.

Efficient cache replacement framework based on access hotness for spacecraft processors

A notable portion of cachelines in real-world workloads exhibits inner non-uniform access behaviors.However,modern cache management rarely considers this fine-grained feature,which impacts the effective cache capacity of contemporary high-performance spacecraft processors.To harness these non-uniform access behaviors,an efficient cache replacement framework featuring an auxiliary cache specifically designed to retain evicted hot data was proposed.This framework reconstructs the cache replacement policy,facilitating data migration between the main cache and the auxiliary cache.Unlike traditional cacheline-granularity policies,the approach excels at identifying and evicting infrequently used data,thereby optimizing cache utilization.The evaluation shows impressive performance improvement,especially on workloads with irregular access patterns.Benefiting from fine granularity,the proposal achieves superior storage efficiency compared with commonly used cache management schemes,providing a potential optimization opportunity for modern resource-constrained processors,such as spacecraft processors.Furthermore,the framework complements existing modern cache replacement policies and can be seamlessly integrated with minimal modifications,enhancing their overall efficacy.

A Cache Replacement Policy Based on Multi-Factors for Named Data Networking

Named Data Networking(NDN)is one of the most excellent future Internet architectures and every router in NDN has the capacity of caching contents passing by.It greatly reduces network traffic and improves the speed of content distribution and retrieval.In order to make full use of the limited caching space in routers,it is an urgent challenge to make an efficient cache replacement policy.However,the existing cache replacement policies only consider very few factors that affect the cache performance.In this paper,we present a cache replacement policy based on multi-factors for NDN(CRPM),in which the content with the least cache value is evicted from the caching space.CRPM fully analyzes multi-factors that affect the caching performance,puts forward the corresponding calculation methods,and utilize the multi-factors to measure the cache value of contents.Furthermore,a new cache value function is constructed,which makes the content with high value be stored in the router as long as possible,so as to ensure the efficient use of cache resources.The simulation results show that CPRM can effectively improve cache hit ratio,enhance cache resource utilization,reduce energy consumption and decrease hit distance of content acquisition.

Optimal Water Pipe Replacement Policy

Water scarcity is the major problem confronting both urban and rural dwellers in Enugu State. This scarcity emanated from indiscriminate pipe failure, lack of adequate maintenance, uncertainty on the time of repair or replacement of pipes etc. There is no systematic approach to determining replacement or repair time of the pipes. Hence, the rule of thumb is used in making such a vital decision. The population is increasing, houses are built but the network is not expanded and the existing ones that were installed for no less than two to three decades ago are not maintained. These compounded the problem of scarcity of water in the state. Replacement or repair of water pipes when they are seen spilling water cannot solve this lingering problem. The solution can be achieved by developing an adequate predictive model for water pipe replacement. Hence, this research is aimed at providing a solution to this problem of water scarcity by suggesting a policy that will be used for better planning. The interests in this paper were to obtain a water pipe failure model, the intensity function λ(t) [failure rate], the reliability R(t) and the optimal time of replacement and they were achieved. It was observed that the failure rate of the pipes increases with time while their reliability deteriorates with time. Hence, the Optimal replacement policy is that each pipe should be replaced after 4th break when the reliability = 0.0011.

DIPP—An LLC Replacement Policy for On-chip Dynamic Heterogeneous Multi-core Architecture

As the big data era is coming, it brings new challenges to the massive data processing. A combination of GPU and CPU on chip is the trend to release the pressure of large scale computing. We found that there are different memory access characteristics between GPU and CPU. The most important one is that the programs of GPU include a large number of threads, which lead to higher access frequency in cache than the CPU programs. Although the LRU policy favors the programs with high memory access frequency, the programs of GPU can’t get the corresponding performance boost even more cache resources are provided. So LRU policy is not suitable for heterogeneous multi-core processor. Based on the different characteristics of GPU and CPU programs on memory access, this paper proposes an LLC dynamic replacement policy--DIPP (Dynamic Insertion / Promotion Policy) for heterogeneous multi-core processors.The core idea of the replacement policy is to reduce the miss rate of the program and enhance the overall system performance by limiting the cache resources that GPU can acquire and reducing the thread interferences between programs. Experiments compare the DIPP replacement policy with LRU and we conduct a classified discussion according to the program results of GPU. Friendly programs enhance 23.29% on the average performance (using arithmetic mean).Large working sets programs can improve 13.95%, compute-intensive programs enhance 9.66% and stream class programs improve 3.8%.

Inspection-replacement policy of system under predictive maintenance

In general, every system is in one of the three states: normal, abnormal, or failure state. When the system is diagnosed as abnormal state, it needs predictive maintenance. If the system fails, an identical new one will replace it. The predictive main- tenance cannot make the system “as good as new”. Under these assumptions, the reliability index and the inspection-replacement policy of a system were studied. The explicit expression of the reliability index and the average income rate (i.e., the long-run average income per unit time) are derived by using probability analysis and vector Markov process method. The criterion of feasibility for the optimal inspection-replacement policy under the maximum average income rate is obtained. The numerical example shows the optimal inspection-replacement policy can raise the average income rate when the optimal inspec- tion-replacement policy is feasible.

Sensitivity Analysis of the Replacement Problem

The replacement problem can be modeled as a finite, irreducible, homogeneous Markov Chain. In our proposal, we modeled the problem using a Markov decision process and then, the instance is optimized using linear programming. Our goal is to analyze the sensitivity and robustness of the optimal solution across the perturbation of the optimal basis ?obtained from the simplex algorithm. The perturbation ?can be approximated by a given matrix H?such that . Some algebraic relations between the optimal solution and the perturbed instance are obtained and discussed.

债务置换、系统性金融风险与宏观政策搭配

我国推出债务置换政策致力于化解地方政府债务风险问题,但关于该政策能否有效化解风险以及其作用机制如何,目前尚无定论。本文通过构建动态随机一般均衡模型(DSGE)探索如何防范与化解债务置换政策对系统性金融风险的负面影响。理论分析发现,债务置换政策尽管能够缓解地方政府的短期违约风险,但是可能会带来系统性金融风险上升的副作用。其副作用来源于两种渠道:流动性渠道和违约转移渠道,债务置换设计中应该充分关注这两种渠道的副作用。本文还发现,搭配货币政策或宏观审慎政策可以缓解债务置换副作用,相比之下宏观审慎政策更加有效。因此,为更好地保障债务置换政策的成功,本文建议实施“债务置换+宏观审慎”的政策组合。

论“书同文”政策对“屦/履”历时更替的影响——基于出土资料与传世文献的综合考察

战国“履”的字形和{屦}的用字存在文字异形问题,受“书同文”政策的影响,这一问题在秦王政时期得到了解决。考察先秦至西汉早期出土资料与传世文献可知,同样是受“书同文”政策的影响,至迟在秦朝{履}最终替换{屦}而成为表示“鞋”义的常用词。这表明“书同文”政策确实对汉语用词的变化产生过重要的影响。

A Prefetch-Adaptive Intelligent Cache Replacement Policy Based on Machine Learning

Hardware prefetching and replacement policies are two techniques to improve the performance of the memory subsystem.While prefetching hides memory latency and improves performance,interactions take place with the cache replacement policies,thereby introducing performance variability in the application.To improve the accuracy of reuse of cache blocks in the presence of hardware prefetching,we propose Prefetch-Adaptive Intelligent Cache Replacement Policy(PAIC).PAIC is designed with separate predictors for prefetch and demand requests,and uses machine learning to optimize reuse prediction in the presence of prefetching.By distinguishing reuse predictions for prefetch and demand requests,PAIC can better combine the performance benefits from prefetching and replacement policies.We evaluate PAIC on a set of 27 memory-intensive programs from the SPEC 2006 and SPEC 2017.Under single-core configuration,PAIC improves performance over Least Recently Used(LRU)replacement policy by 37.22%,compared with improvements of 32.93%for Signature-based Hit Predictor(SHiP),34.56%for Hawkeye,and 34.43%for Glider.Under the four-core configuration,PAIC improves performance over LRU by 20.99%,versus 13.23%for SHiP,17.89%for Hawkeye and 15.50%for Glider.

A generalized geometric process based repairable system model with bivariate policy

The maintenance model of simple repairable system is studied.We assume that there are two types of failure,namely type Ⅰ failure(repairable failure)and type Ⅱ failure(irrepairable failure).As long as the type Ⅰ failure occurs,the system will be repaired immediately,which is failure repair(FR).Between the(n-1)th and the nth FR,the system is supposed to be preventively repaired(PR)as the consecutive working time of the system reaches λ^(n-1) T,where λ and T are specified values.Further,we assume that the system will go on working when the repair is finished and will be replaced at the occurrence of the Nth type Ⅰ failure or the occurrence of the first type Ⅱ failure,whichever occurs first.In practice,the system will degrade with the increasing number of repairs.That is,the consecutive working time of the system forms a decreasing generalized geometric process(GGP)whereas the successive repair time forms an increasing GGP.A simple bivariate policy(T,N)repairable model is introduced based on GGP.The alternative searching method is used to minimize the cost rate function C(N,T),and the optimal(T,N)^(*) is obtained.Finally,numerical cases are applied to demonstrate the reasonability of this model.

The Ordering and Replacement Policy for the System with Two Types of Failures

In this paper,the optimal maintenance policy is investigated for a system with stochastic lead time and two types of failures. The system has two types of failures, one type is repairable, when the repairable failure occurs, the system will be repaired by repairman, and the system after repair is not“as good as new". The other type of failure is unrepairable, and when the unrepairable failure occurs the system must be replaced by a new and identical one. The spare system for replacement is available only by order, and the lead time for delivering the spare system is stochastic. The successive survival times of the system form a stochastically decreasing geometric process, the consecutive repair times after failures of the system form a renewal process. By using the renewal process theory and geometric process theory, the explicit expression of the long-run average cost per unit time under ordering policy (N-1) is derived, and the corresponding optimal can be found analytically. Finally, the numerical analyses are given.

OPTIMUM ORDERING POLICY FOR PREVENTIVE AGE REPLACEMENT

Most of the spare ordering policies treated up to now have assumed that preventive and corrective replacement costs are equal, which implies in essential that there is no significant need for preventive replacement. This paper presents an ordering policy for preventive age replacement with minimal repair. Introducing the replacement, repair, inventory holding and shortage costs, the expected cost rate is derived. A procedure to determine jointly the ordering time for a spare and the preventive replacement time for the operating unit so as to minimize the expected cost rate is proposed. To explain the ordering policy and the optimization procedure, a numerical example is also included.

国家药品集中带量采购政策下抗肿瘤药品使用特征分析

目的:探究国家药品集中带量采购政策下抗肿瘤药品的使用特征,为进一步规范可替代品种使用监测、优化药品集采政策提供建议。方法:利用2019年—2020年国家药品供应保障综合管理信息平台的药品采购数据,采用描述性统计方法分析政策实施前后抗肿瘤药品采购金额、用药频度(DDDs)与日均费用(DDDc)的变化情况。结果:政策实施后抗肿瘤集采品种的采购金额与DDDc分别下降了31.87%和51.55%,DDDs上升了40.61%;可替代品种的采购金额与DDDs分别上升了49.20%与41.62%,DDDc变化不明显。从注册评价类型来看,政策实施后集采品种中的仿制药DDDs增幅高于原研药,药品费用下降明显;可替代品种中原研药的采购金额与DDDs的增长率高于仿制药。从可替代程度来看,可替代品种的采购金额、DDDs与DDDc增幅在政策实施后均高于基本可替代品种。结论:国家药品集采政策对抗肿瘤集采品种的降价省费效应显著,使用中选产品逐渐成为患者的一致选择;集采品种对可替代品种的替代效应并不明显,应采用信息化手段开展高替代程度品种的使用限额与用量监测,加快过评仿制药对高价原研药的替代使用。

Optimal Age Replacement Policy with Replacement Occurrence While the Warranty is in Effect

This study considers an age replacement policy(ARP) for a repairable product with an increasing failure rate with and without a product warranty. As for the warranty policy to consider in association with such an age replacement policy, we adapt a renewable minimal repair-replacement warrant(MRRW) policy with 2D factors of failure time of the product and its corresponding repair time. The expected cost rate during the life cycle of the product is utilized as a criterion to find the optimal policies for both with and without the product warranty. We determine the optimal replacement age that minimizes the objective function which evaluates the expected cost rate during the product cycle and investigate the impact of several factors on the optimal replacement age. The main objective of this study lies on the generalization of the classical age replacement policy to the situation where a renewable warranty depending on 2D factors is in effect. We present some interesting observations regarding the effect of relevant factors based on numerical analysis.

北京市自建设施供水管理现状、问题及对策建议

以北京市自建设施供水为例,分析了当前存在的问题,从完善管理体制机制、出台配套法规政策、加强日常管理、推动所属自备水源井置换等方面提出解决对策建议。

代理缓存一致性策略和替换策略的研究

针对代理缓存的一致性策略和替换策略还没有很好地结合起来,从而影响了代理缓存系统的整体性能的现状,分别探讨了基于Internet的代理缓存一致性策略和替换策略的处理流程、性能评价指标和研究现状,进而给出将这两种策略结合起来的一致性—替换算法的处理流程,并提出陈旧命中比是其主要性能评价指标,能很好地衡量代理缓存的各种算法的优劣和代理缓存系统的整体性能。

缓存技术在移动数据库中的应用研究

缓存技术是提高数据访问性能的经典技术,已经在计算技术的很多方面得到了成功的应用。在移动计算环境中,由于设备和网络资源的限制,缓存将发挥更加重要的作用。研究了移动数据库中的客户端缓存管理技术,重点讨论了缓存管理的缓存粒度、缓存一致性策略和缓存替换策略3个关键问题。

制度变迁与旅游经济增长——基于双重差分方法的“局改委”政策评估

为了考察旅游局变更为旅游发展委员会对旅游经济增长的影响,文章将进行"局改委"的地级市作为处理组,将未进行"局改委"的地级市作为控制组,构建286个地级市2000—2013年的面板数据集,采用固定效应模型对"局改委"的政策效果进行评估。研究发现,从国内旅游收入、国内旅游人数、旅游外汇收入、境外旅游人数,以及国内旅游收入的增长率等方面来考察,"局改委"确实显著促进了地区旅游经济的增长。为了验证结果的可靠性,文章还采用Probit模型对可能存在的选择性偏误问题进行了检验,结果表明,地区旅游经济增长水平与决定是否进行"局改委"之间并无必然联系,没有充分的证据说明旅游经济的增长与"局改委"之间存在自选择问题。此外,对"局改委"影响旅游经济增长机制的分析还表明,"局改委"对旅游经济增长的影响是通过提高地区旅游资源禀赋实现的。

不完全维修下的单部件系统视情维修及更换策略

实际装备维修工程中,系统并不总能够通过维修恢复如新,并且修后工作时间和维修时间会随着系统年龄增加而分别呈现缩短和延长趋势。针对这个问题,利用连续时间马尔科夫链理论建立单部件系统在不完全维修条件下的视情维修及更换策略模型。根据马氏过程平稳状态下统计平衡原理得到状态概率方程组,并给出相应的递归求解算法。分别以系统稳态可用度最大、长期运行费用率最低以及规定可用度约束下平均故障前时间最长为目标,确定系统最优检测频率、视情维修阈值和更换策略。最后通过算例说明系统在最优维修及更换策略下达到的性能指标与系统劣化属性和维修能力水平的关系,验证了该模型的可行性。