ABSTRACT Many physical systems contain a series of positions with different degradation characteristics and a series of functionally interchangeable components, in which the component reassignment (CR) is usually used to balance the degradation characteristics by reassigning the workloads of components. Although many research has been conducted on CR‐related problems, there is no existing research on periodic CR policy under unequal assignment, in which the number of components and positions are unequal. This paper proposes a new type of CR‐based preventive maintenance policy, namely, the periodic multiple CRs (PMCRs) policy. The PMCRs policy implements periodic CRs before the system replacement, minimal repairs for sudden failed components, and unequal assignment between positions and components. An optimization model is established to find the optimal number of CRs, the optimal interval for adjacent CRs, and the optimal assignment for CRs with the objective of minimizing the expected annual system maintenance cost. Furthermore, the upper bound and the lower bound on the optimal number of CRs are derived. Finally, based on the genetic algorithm‐based matheuristic method, numerical examples show that the proposed PMCRs policy can be used as an effective tool to improve the system's performance.
Acoustic Echo Cancellation (AEC) is an essential speech signal processing technology that removes echoes from microphone inputs to facilitate natural-sounding full-duplex communication. Currently, deep learning-based AEC methods primarily focus on refining model architectures, frequently neglecting the incorporation of knowledge from traditional filter theory. This paper presents an innovative approach to AEC by introducing an attention-enhanced short-time Wiener solution. Our method strategically harnesses attention mechanisms to mitigate the impact of double-talk interference, thereby optimizing the efficiency of knowledge utilization. The derivation of the short-term Wiener solution, which adapts classical Wiener solutions to finite input causality, integrates established insights from filter theory into this method. The experimental outcomes corroborate the effectiveness of our proposed approach, surpassing other baseline models in performance and generalization. The official code is available at https://github.com/ZhaoF-i/ASTWS-AEC
As a new form of support contract, performance-based contracting has been extensively applied in both public and private sectors. However, maintenance policies under performance-based contracting have not gotten enough attention. In this paper, a preventive maintenance optimization model based on three-stage failure process for a single-component system is investigated with an objective of maximizing the profit and improving system performance at a lower cost under performance-based contracting. Different from conventional optimization models, the step revenue function is used to correlate profit with availability and cost. Then, a maintenance optimization model is proposed to maximize profit by optimizing the inspection interval. Moreover, the customers’ upper limit of funds is considered when we use the revenue function, which has rarely been considered in past studies. Finally, a case study on the cold water pumps along with comparison of linear and step revenue function and sensitivity analysis is provided to illustrate the applicability and effectiveness of our proposed approach.
In this paper, we consider a linear m-gap-consecutive k-out-of-r-from-n: F system consisting of different elements. The elements are subjected to common cause failures, i.e., an external or internal failure which affects mutually exclusive sets of elements. Common cause failure usually occurs when a set of elements share the same energy resource. Based on the universal generating function technique, we propose a reliability evaluation algorithm for a linear m-gap-consecutive k-out-of-r-from-n: F system consisting of different elements subjected to common cause failures in this paper.
RT (rotation and translation) scan mode for 2D (two-dimensional) CT (computed tomography), based on multiple axes, can scan large-sized work pieces and components with paraxial X-ray beam. Compared with the traditional second generation scan mode of TR (translation and rotation), it can save about 3/4 times of the scan time. The accurate reconstruction algorithm by region, can remove the artifacts around inner and outer borders in general reconstruction images. But a mass of zero values participate back-projection operations, and slow down the accurate algorithm operation. In this paper, projection data are grouped according to the regions they located before being back-projected. Data are selected or not according to the regions ID determined in advance during back-projection. So zero values are kicked out by their locations, before doing some time-consuming works such as reading, judging or accumulating the values and so on. And computer simulations show that the reconstruction algorithm saves at least half of the operation time according to the number of rotation centers.