According to Fig. 18, for air-gapped CT, the remanence of iron core decreases continuously with the increase of running time, and decreases to 0.127 T at 0.5 s, which is about 7.1% of the saturation magnetic flux density; and for closed-core CT, the remanence is stable after the fault is removed, the minimum value of which is 1.312 T, which is much larger than the air-gapped CT.
The smaller the protection time settings are, the quicker the fault can be removed.
The protection logic also reflects the original intention of dead-zone protection that the fault cannot be removed at all after the protection has operated.
Scholars do not state that vulnerability is a fault to be removed, rather they hold the opinion that it is an inherent property of any social system, so everybody has to copy with it in order to be surprised by an unforeseeable future as little as possible [66, 67].
The condition of finitely many faults can be removed by postulating strong fairness.
This does not mean that by correcting warnings of a warning category with higher correspondence to mutations, faults will be removed.
Consequently, according to the developed new algorithm, fault resistance and compensator effects are removed and fault location can be precisely detected.
For most software reliability models in literature, software faults are assumed to be removed immediately and perfectly upon detection [9, 17, 18].
It also recognises that fault and blame need to be removed from the process so that partners can come to the negotiating table not with the belligerent attitude of war-time foes but one more conducive to conflict-resolution.
The common assumption for most existingsoftware reliability growth models is that fault is independent and can be removed perfectly upon detection.
Moreover, software faults are independent and can be removed perfectly upon detection.
