Predicting Spread Probability of Learning-Effect Computer Virus

Algorithm 6

Procedure New-BAT.

(i)	Input: A scale-free network G (V, E), the first infected node TARGET, the damping factor d, and the allowed timeslot lag t.
(ii)	Output: The probability that the computer virus spreads throughout the whole network within time lag t.
(iii)	STEP 0. Count the degree of each node, calculate the PageRank values of each node, calculate the initial spread probability of each directed arc using Equation (7), and compute the temporal spread probability with the learning effect for each arc using Equation (12).
(iv)	STEP 1. Implement the proposed BAT-1 algorithm to search for all feasible basic state vectors constructed by the spread vectors and the 1-lag temporal vectors.
(v)	STEP 2. Implement the proposed BAT-2 algorithm to find all the feasible t-lag temporal vectors according to the 1-lag temporal vectors.
(vi)	STEP 3. Calculate and sum the probabilities of all the feasible state vectors using Equation (12).