Newport iServer MicroServer iTHX-M Operator's Manual page 357

Then we form the sum of positive signed ranks,
S = sum(u(s ) s , i = 1:n),
i i
where u(s )=1 if s > 0, and u(s
i i
In our example, S = s
Small Probe Sets
When n is small (we use n < 12), we can assign signs to ranks r
2, ..., n) in every possible way, calculate the sum of positive ranks and
denote this sum by S
n
2
∑
n –
p S ( ) (
= u S
2
j
j = 1
where:
if S > S then u(S
j
if Sj < S then u(S
if S equals S then u(S
j
if S does not equal S then u(S
j
In our example, all possible signed ranks and the sum of positive ranks
S are list in the table below
j
does not matter, we use the ascending order of their absolute values in
the table and denote them by s'
Appendix C | Dynamic Model Mapping Algorithm
) = 0 if s
i i
+ s + s + s = 10.5.
1 2 4 5
n
(j=1, ..., 2 ). We define
j
> ) ( )
S + 0.5u S
=S
j
> S) is 1
j
> S) is 0
j
= S) is 1
j
= S) is 0
j
(Table C.3). Since the order of these ranks
.
i
< 0.
349
(i=1,
i