The degradation detection for historical datasets. | Step1. Initialization. L represents the moving detection window length, w represents the window width of ALWS, and let L = L1,w = w1. | Step2. According formula(3), calculate the SD sequence([SD1,SD2,...,SDN]) of full cycles. | Step3. Calculate the ALWS sequence of full cycles. | For i in (w,N): | sd = [SDi-w +1,SDi-w +1,...,SDi] | According the formula (), calculate a(i) = ALWS(sd) | End for | Get the sequence [a1, a2,..., aN-w +1]. Add m-1 zero before it and get the new ALWS sequence [A1, A2,...,Am-1,a1,...aN-w +1], where A1 = ... = Aw-1 =0. | Step4. Using Z to represent the number of nonzeros in the detection window sequence and [T_low,T_up] represents the time interval when the obvious degradation point. | For j in (1, N-L), do: | Get the detection window sequence: [Aj,...,Aj+L] | Count the number Z of nonzero in the detection sequence: Z = is_not_zero([Aj,...,Aj+L]) | If Z more than int (0.5*L) | T_low = j | T_up = j + L1 | break | Else | continue | End if | End for | Step5. For each engine in the historic database, according to the above step 1-4, the degradation interval is determined, and the original historical database D0 can be divided into two datasets, D1 in the health stage and D2 in the obvious degradation stage. |
|