DataMuseum.dk

Presents historical artifacts from the history of:

RegneCentralen GIER Computer

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about RegneCentralen GIER Computer

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - download

⟦fe0376aa9⟧ Bits:30000693 GRID-TEST (var 2)., 8-hole paper tape

    Length: 3687 (0xe67)
    Description: Bits:30000693 GRID-TEST (var 2).
    Types: 8-hole paper tape
    Notes: Gier Text

GIER Text (HTML)

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< ___