Table - PMC

Skip to main content

View full-text article in PMC

. 2023 Sep 14;23(18):7889. doi: 10.3390/s23187889

Algorithm 2: Threshold Update Algorithm

1:

i f (C u r r e n t w i n d o w i s R T S w i n d o w | | N e x t w i n d o w i s R T S w i n d o w) {

2:

P_{u p_n e x t} = P_{u p_c u r r};

3:

P_{d o w n_n e x t} = P_{d o w n_c u r r};

4:

}

5:

e l s e {

6:

W = 0.2 * (s u m (h i s t o r y_l o s s) / h i s t o r y_l o s s . l e n g t h) + 0.8 * P_{l o s s};

7:

A v g = (P_{u p_o r g} + P_{d o w n_o r g}) / 2;

8:

i f (W \leq A v g & & P_{l o s s} < P_{u p_c u r r}) {

9:

P_{u p_n e x t} = (1 - W) * P_{u p_o r g} + P_{u p_c u r r};

10:

P_{d o w n_n e x t} =

P_{d o w n_c u r r} + W * P_{d o w n_o r g};

11:

i f (P_{u p_n e x t} > 0.3) {

P_{u p_n e x t} = 0.3;}

12:

i f (P_{d o w n_n e x t} > 0.5) {P_{d o w n_n e x t} = 0.5;}

13:

b r e a k;

14:

}

15:

i f (W > A v g & & P_{l o s s} > P_{d o w n_c u r r}) {

16:

P_{d o w n_n e x t} = P_{d o w n_c u r r} - W * P_{d o w n_o r g};

17:

P_{u p_n e x t} = P_{u p_c u r r} - (1 - W) * P_{u p_o r g};

18:

i f (P_{d o w n_n e x t} < 0.3) {

P_{d o w n_n e x t} = 0.3;}

19:

i f (P_{u p_n e x t} < 0.1) {P_{u p_n e x t} = 0.1;}

20:

b r e a k;

21:

}

22:

P_{u p_n e x t} = P_{u p_c u r r}

;
23:

P_{d o w n_n e x t} = P_{d o w n_c u r r};

24:

}

25:

h i s t o r y_l o s s . a p p e n d (P_{l o s s});

26:

i f (h i s t o r y_l o s s . l e n g t h \geq 10) {

27:

h i s t o r y . p o p (0);

28:

}