|
DataMuseum.dkPresents historical artifacts from the history of: RegneCentralen GIER Computer |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about RegneCentralen GIER Computer Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - download
Length: 3687 (0xe67) Description: Bits:30000693 GRID-TEST (var 2). Types: 8-hole paper tape Notes: Gier Text
algol<begin _____integer sum 2,i,j,l,m,n,ptnr,p,r; _______real sum 1,sum 3,sum 4; ____select(19);writecr; m:=read integer; n:=read integer;r:=read integer; p:=n⨯(n-1)/2;begin _____real array A[1:m,1:n]; real array B[1:r,1:p]; ____ _____ ____ _____real array C[1:p,1:r]; ____ _____procedure spearman(m,n,r,MATRIX,RHOMATRIX); _________value m,n,r; _____integer m,n,r; _______real array MATRIX; real array RHOMATRIX; ____ _____ ____ _____begin _____integer i,j,k,p; _______real sum; ____p:=0;for j:=1 step 1 until n-1 do ___ ____ _____ __begin _____for k:=j+1 step 1 until n do ___ ____ _____ __begin _____sum:=0;p:=p+1;for i:=1 step 1 until m do ___ ____ _____ __begin _____sum:=sum+(MATRIX[i,j]-MATRIX[i,k])∧2; |end; ___RHOMATRIX[r,p]:=1-6⨯sum/(m∧3-m); |end ___end ___end procedure spearman; ___procedure rangordning(m,n,MATRIX,RANGMATRIX); _________value m,n; _____integer m,n; _______real array MATRIX;real array RANGMATRIX; ____ _____ ____ _____begin _____integer i,j,k,sum a,sum b; _______for i:=1 step 1 until m do ___ ____ _____ __begin _____for j:=1 step 1 until n do ___ ____ _____ __begin _____sum a:=0;sum b:=-1;for k:=1 step 1 until n do ___ ____ _____ __begin _____if MATRIX[i,j]<MATRIX[i,k] then sum a:=sum a+1; __ ____if MATRIX[i,j]=MATRIX[i,k] then sum b:=sum b+1; __ ____end; ___RANGMATRIX[j,i]:=(2⨯(n-sum a)-sum b)/2;end; ___end ___end procedure rangordning; ___next datagroup: ptnr:=read integer;for ptnr:=ptnr,read integer while ptnr|0 do ___ _____ = __begin _____sum 1:=0;sum 4:=0;writetext(|<patient number:|); < >write(|dddddddddd|,ptnr);writecr; < >for l:=1 step 1 until r do ___ ____ _____ __begin _____sum 3:=0;for i:=1 step 1 until m do ___ ____ _____ __begin _____for j:=1 step 1 until n do ___ ____ _____ __begin _____A[i,j]:=read real;if A[i,j]=0 then __ ____begin _____writetext(|<input error:too few elements in the datagroup|); < >writecr;writecr;writecr;go to next datagroup; __ __end; ___end; ___end; ___for j:=1 step 1 until n do ___ ____ _____ __begin _____sum 2:=0;for i:=1 step 1 until m do ___ ____ _____ __begin _____sum 2:=sum 2+A[i,j];sum 4:=sum 4+1;end; ___if sum 2|m⨯(m+1)/2 then __ = ____begin _____writetext(|<input error:wrong sum in the columns of the datagroup|);writecr; < >go to overspring; __ __end; ___end; ___spearman(m,n,l,A,B);for j:=1 step 1 until p do ___ ____ _____ __begin _____sum 1:=sum 1+B[l,j]∧2; |sum 3:=sum 3+B[l,j]∧2; |end; ___writetext(|<intensity score grid|); < >write(|dd|,l); < >writetext(|<=|); < >write(|__dddd.dd|,100⨯sum 3);writecr; <,, >end; ___writetext(|<intensity score =|); < >write(|__dddd.dd|,100⨯sum 1);writecr; <,, >rangordning(r,p,B,C); spearman(p,r,1,C,B);writetext(|<consistency score =|); < >write(|__d.ddd|,B[1,1]);writecr; <,, >overspring:for ptnr:=read integer while ptnr|0 do ___ _____ = __begin _____sum 4:=sum 4+1;if sum 4>2⨯m⨯n then __ ____begin _____writetext(|<input error:too many elements in the datagroup|); < >writecr;end; ___end;writecr;writecr; ___end ___end ___end;t< ___