“…c c Conditioning data is then read in (if available) and assigned to the nearest node if within the grid network. ',Iagfl tite(*,*y****** ***************************************r ead(1in,*,er&7) isas write(*,111) isas write(ldbg,l 11) isas 111 forrnat(flAnnealing schedule: ',i2/, +' ( &user, l:defarrl~2fas~3:very fast )') read(lin,*,err=97) (sas(i),i=I,6) read(Iin,*,en=97) part read(1in,*,err=97) seed read(lin,*,es-r=97) nsim read(lin,*,err=97) nx,xnm,xsiz read(lin,*,err=97) ny,yrnn,ysiz read(lin,*,err=97) nz,zrnn,zsiz rcad(Iin, (Deutsch and Cockerham, 1994) c sas(3)=sas(3)*dble(nx*ny*nz) sas(4)=sas(4)*dbIe(nx*ny*nz) if(isas.eq.1) then Sas(l) = I.odo sas(2) = O.ldO sas(3) = 100.dO*dble(nx*ny*nz) 555(4)= 10.dO*dble(nx*ny*nz) sas(5) = 3.dO sas(6) = 0.001dO elseif(isas.eq.2) then 555(I)= l.odo sas(2) =0.05d0 SSS(3)= 50.dO*dble(nx*ny *nz) sas(4) = 5.dO*dble(nx*ny*nz) sas(5) = 3.dO SSS(6)= 0.001dO elseif(isas.eq.3) then sa.s(l) = 0.5d0 sas(2) = O.OldO sas(3) = 10.dO*dble(nx*ny*nz) SSS(4)= 2.dO*dbIe(nx*ny*nz) sas(5) = 3.dO sas(6) = 0.001dO endif write(*,112)(sas(i),i=l,6),part write(ldbg,112)(sas(i),i=l ,6),part 112 forrnat('User set schedule:'/ + 'To = ',f5.lj + 'T factor= ',f5.1J + ' Knrax = ',e7.lj + ' Kaccept = ',e7.l/ + 's =',f5.lJ + 'Ornirs = ',e7.1J + 'Part = ',i2) write(*,*~*********************************************q read(lin,*,en=97) nst,cO,isiIl sill = CO wnte(*, 100) isill,nst,cO if(nst.Ie.0) then write(*,9997) nst 9997 forrnat('nst must beat least 1, it has been set to ',i4J, + 'The c or a values can be set to zero') stop endif + '#of neighborhood = ',i4) write(*,*~*********************************************' read(lbr,*)ymean,ystd,itrans read(lin,*) peut,aspcut,xcrr~ptarget c c Read which annealing algorithm should be used: …”