1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 PAGE: 1 0REQUESTED OPTIONS (EXECUTE): OPT(2) XREF SXM 0OPTIONS IN EFFECT: NOLIST NOMAP XREF NOGOSTMT NODECK SOURCE TERM OBJECT FIXED TRMFLG SRCFLG NOSYM NORENT SDUMP(ISN) SXM NOVECTOR IL(DIM) NOTEST NODC NOICA NODIRECTIVE NODBCS NOSAA OPT(2) LANGLVL(77) NOFIPS FLAG(I) AUTODBL(NONE) NAME(MAIN) LINECOUNT(60) CHARLEN(500) 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C C CLUSPAC: Computer Programs for Mixture-Model Clustering C C C C COPYRIGHT 1991 STANLEY LOUIS SCLOVE. C C C C C CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C$STATEMENTS=100000 C CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C C HW1DT CLUSPAC C C C C " HW1DT CLUSPAC" is an adaptation of "MIX1DT CLUSPAC" to C C treat a case in which the mixing probabilities are parametric C C functions of some other parameters. For example, the mixing C C probabilities may have to satisfy the Hardy-Weinberg C C conditions p(1) = p**2, p(2) = 2pq, p(3) = q**2. C C C C "MIX1DT CLUSPAC" IS A PROGRAM FOR CLUSTERING UNIVARIATE C C DATA (DATA ON THE LINE) BY ITERATIVE MAXIMIZATION OF THE C C MIXTURE-MODEL LIKELIHOOD C C C C N K C C --- -- C C L = | | > P(C)*F(X(I)|C) C C | | -- C C I=1 C=1 C C C C C C REFERENCE: C C C C Wolfe, J. H. (1970). Pattern clustering by multivariate C C mixture analysis. Multivariate Behavioral Research 5, 329-350. C C C C MANUAL MODE: NUMBER OF CLUSTERS AND INITIAL MEANS ARE C C INPUT. (USE PROGRAM MIX1DTA FOR AUTOMATIC SETTING OF C C NUMBERS OF CLUSTERS AND INITIAL MEANS.) C C C C C C PROGRAMMED BY C C DR. STANLEY L. SCLOVE 312/996-2681 C C DEPARTMENT OF C C INFORMATION & DECISION SCIENCES M/C 294 C C COLLEGE OF BUSINESS ADMINISTRATION C C UNIVERSITY OF ILLINOIS AT CHICAGO C 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 2 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 C BOX 4348 C C CHICAGO, IL 60680-4348 C C C C C C HW1DT VERSION 1.2 23-FEB-92 C C COPYRIGHT 1992 STANLEY LOUIS SCLOVE. C C C C MIX1DT VERSION 1.0 3-NOV-89 C C COPYRIGHT 1991 STANLEY LOUIS SCLOVE. C C C C C C C C RESTRICTIONS (CAN BE MODIFIED): C C N, SAMPLE SIZE, AT MOST 999; C C K, NUMBER OF CLUSTERS, AT MOST 29 (FIXED AT 3 IN HW1DT); C C ITER, MAXIMUM NUMBER OF ITERATIONS, 20. C C C C C C C C CONTROL CARDS: C C C C (1) DATASET TITLE C C (2) N, IN FORMAT (2X,I4) C C (3) FMT, IN FORMAT (18A4), E.G., (1X,F4.1). C C ALLOW AT LEAST ONE BLANK IN FMT: IT WILL ALSO BE USED C C FOR OUTPUT, WHERE CC1 IS FOR CARRIAGE CONTROL. C C ALLOW A CC FOR THE DECIMAL POINT ON OUTPUT, C C WHETHER OR NOT THERE IS ONE ON INPUT. C C (4) DATA, IN FORMAT SPECIFIED BY FMT C C (5) K, NUMBER OF CLUSTERS, IN FORMAT (2X,I1) C C (6) K INITIAL VALUES OF PRIOR PROBS, MEANS AND VARIANCES, C C IN FORMAT (5X,F3.2,2X,F8.2,2X,F8.2). C C C C C CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C 1 DIMENSION X(999),XMNDSQ(999),ICLUS(999),IOTA(999) 2 DIMENSION DSQ(29),C(29),SUM(29) 3 DIMENSION TITLE(18) 4 DIMENSION B(29),NC(29),XMEAN(29),XMEANOL(29) 5 DIMENSION FMT(18) 6 DIMENSION SS(29),SSD(29) 7 DIMENSION SD(29) 8 DIMENSION VAR(29) 9 DIMENSION ICLSOL(999) 10 DIMENSION F(999,29) 11 DIMENSION P(29),XNC(29) 12 DIMENSION PP(29,999) 13 DIMENSION XMXPR(999) 14 DIMENSION DENOM(999) 15 DOUBLE PRECISION SUM,SS,F,P,PP,SUMSQS,TOTAL 16 DOUBLE PRECISION TEMP 17 DOUBLE PRECISION XMEAN,XMEANOL,XMN2LL,XMN2LLOL,WGSS,SSDEVS C 18 READ (5,64000) TITLE 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 3 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 C C WRITE PROGRAM INFORMATION. 19 WRITE (6,56000) 20 WRITE (6,32000) 21 WRITE (6,34000) C 22 WRITE (6,70000) TITLE C C READ SAMPLE SIZE, N. 23 READ (5,12000) N 24 XN = N 25 WRITE (6,66000) N C C READ DATA FORMAT. 26 READ (5,64000) FMT C C READ DATA AND C COMPUTE STATISTICS OF WHOLE SAMPLE: 27 TOTAL=0.0 28 SUMSQS=0.0 29 SSDEVS=0.0 C 30 DO 300 I = 1,N 1 31 READ (5,FMT) X(I) 1 32 TOTAL = TOTAL + X(I) 1 33 SUMSQS = SUMSQS + X(I)*X(I) 1 34 IF (I .EQ. 1) GO TO 100 1 35 GO TO 200 1 36 100 XMAX = X(1) 1 37 XMIN = X(1) 1 38 200 CONTINUE 1 39 IF (X(I) .LT. XMIN) XMIN=X(I) 1 41 IF (X(I) .GT. XMAX) XMAX=X(I) 1 43 300 CONTINUE C WRITE DATA: 44 WRITE (6,24000) 45 IF ( N .GE. 31) GO TO 350 46 WRITE (6,FMT) (X(I),I=1,N) 47 350 CONTINUE C WRITE SUMMARY STATISTICS FOR WHOLE SAMPLE: 48 WRITE (6,44000) 49 WRITE (6,FMT) XMIN 50 WRITE (6,46000) 51 WRITE (6,FMT) XMAX 52 XBAR = TOTAL/XN 53 SSDEVS = SUMSQS- TOTAL*TOTAL/XN 54 VARHAT = SSDEVS/XN 55 WRITE (6,50000) XBAR 56 WRITE (6,52000) VARHAT C 57 PI = 3.141593 58 TEMP = 2.0*PI*SSDEVS/N 59 XMN2LL = N*(1.0 + DLOG(TEMP)) 60 STDDEV = SQRT(VARHAT) 61 WRITE (6,54000) SSDEVS, XMN2LL, STDDEV 62 NOPARM = 1 + 1 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 4 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 63 AIC = XMN2LL + 2.0*NOPARM 64 WRITE (6,82000) AIC 65 SCH = XMN2LL + ALOG(XN)*NOPARM 66 XKASH = SCH - ALOG(2*VARHAT**3) 67 WRITE (6,48000) XKASH C C C READ K, NUMBER OF CLUSTERS. 68 READ (5,10000) K C In applications of the Hardy-Weinberg law, there are three C classes: 69 K = 3 70 WRITE (6,36000) K C C C READ INITIAL PRIOR PROBS, MEANS AND VARIANCES: 71 DO 400 IC=1,K 1 72 READ (5,14000) P(IC),XMEAN(IC),VAR(IC) 1 73 400 CONTINUE C C C C WRITE INITIAL PRIOR PROBS, MEANS AND VARIANCES: 74 WRITE (6,26000) 75 DO 500 IC = 1,K 1 76 WRITE (6,28000) IC, P(IC), XMEAN(IC), VAR(IC) 1 77 500 CONTINUE C C SET CONSTANTS. 78 DO 600 INTGER=1,N 1 79 IOTA(INTGER) = INTGER 1 80 600 CONTINUE C 81 ITER = 1 C IF THE INITIAL PRIOR PROBABILITIES ARE EQUAL, THEN THE C FIRST ITERATION IS EQUIVALENT TO MINIMUM DISTANCE CLUSTERING C TO INITIAL MEANS (I.E., "ISODATA"). C IN GENERAL, THE CLUSTERING IS BY MAXIMUM POSTERIOR C PROBABILITY CLUSTERING. C 82 700 CONTINUE C 83 IF (ITER .EQ. 1) GO TO 900 C C STORE OLD CLUSTERING RESULTS FOR TESTING CONVERGENCE: 84 XMN2LLOL = XMN2LL 85 DO 800 I = 1,N 1 86 ICLSOL(I) = ICLUS(I) 1 87 XMEANOL(I) = XMEAN(I) 1 88 800 CONTINUE 89 DO 850 IC = 1,N 1 90 XMEANOL(IC) = XMEAN(IC) 1 91 850 CONTINUE C C COMMENCE DISTANCE COMPUTATIONS. 92 900 CONTINUE 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 5 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 93 DO 1100 I = 1,N 1 94 DO 1100 IC = 1,K 2 95 DSQ(IC) = ( XMEAN(IC) - X(I) )**2 2 96 ZSQ = DSQ(IC)/VAR(IC) 2 97 IF ( ZSQ .LE. 174.673 ) GO TO 1000 2 98 F(I,IC) = 0.0 2 99 GO TO 1100 2 100 1000 CONTINUE C NOTE THAT A PROB. DENSITY FUNCTION OTHER THAN THE GAUSSIAN C COULD BE USED HERE: 2 101 F(I,IC) =(EXP(-ZSQ/2.0))/(SQRT(2*PI*VAR(IC))) 2 102 1100 CONTINUE C XMNDSQ(I) = MIN SQ. DISTANCE FROM X(I) TO ANY MEAN C C C 103 1200 CONTINUE C C COMPUTE POSTERIOR PROBABILITIES OF GROUP MEMBERSHIP: 104 DO 1300 I = 1,N 1 105 DENOM(I) = 0.0 1 106 DO 1300 IH=1,K 2 107 DENOM(I) = DENOM(I) + P(IH)*F(I,IH) 2 108 1300 CONTINUE 109 DO 1400 I = 1,N 1 110 DO 1400 IC=1,K C IF ( DENOM(I) .EQ. 0.0 ) DENOM(I)=0.0001 2 111 PP(IC,I)= P(IC)*F(I,IC)/DENOM(I) 2 112 1400 CONTINUE C C COMPUTE NEW LABELS BY MAX POSTERIOR PROBABILITY: 113 DO 1600 I = 1,N 1 114 XMXPR(I) = PP(1,I) 1 115 ICLUS(I) = 1 1 116 DO 1600 IC = 2,K 2 117 IF ( PP(IC,I) .GT. XMXPR(I) ) GO TO 1500 2 118 GO TO 1600 2 119 1500 XMXPR(I) = PP(IC,I) 2 120 ICLUS(I) = IC 2 121 1600 CONTINUE C 122 IF (N .GE. 31) GO TO 1650 C C WRITE NEW LABELS: 123 WRITE (6,16000) 124 WRITE (6,18000) (IOTA(I), I=1,N) 125 WRITE (6,20000) (ICLUS(I), I=1,N) 126 1650 CONTINUE C C UPDATE CLUSTER PRIOR PROBABILITIES P(IC), MEANS XMEAN(IC) AND C VARIANCES VAR(IC): 127 WGSS = 0.0 128 DO 1800 IC = 1,K 1 129 XNC(IC) = 0.0 C XNC(IC) WILL BE THE SUM OVER ALL N OBSERVATIONS OF THEIR C POSTERIOR PROBABILITIES OF MEMBERSHIP IN CLUSTER IC. 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 6 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 1 130 SUM(IC) = 0.0 1 131 SS(IC) = 0.0 1 132 DO 1700 I = 1,N 2 133 XNC(IC) = XNC(IC) + PP(IC,I) 2 134 SUM(IC) = SUM(IC) + PP(IC,I)*X(I) 2 135 SS(IC) = SS(IC) + PP(IC,I)*X(I)*X(I) 2 136 1700 CONTINUE 1 137 IF ( XNC(IC) .EQ. 0.0 ) GO TO 2700 1 138 XMEAN(IC) = SUM(IC)/XNC(IC) 1 139 SSD(IC) = SS(IC) - SUM(IC)*SUM(IC)/XNC(IC) 1 140 VAR(IC) = SSD(IC)/(XNC(IC)) C IF ( VAR(IC) .LE. 0.0 ) VAR(IC) = 0.0001 1 141 SD(IC) = SQRT(VAR(IC)) 1 142 P(IC) = XNC(IC)/XN 1 143 WGSS = WGSS + SSD(IC) 1 144 1800 CONTINUE 145 WRITE (6,79100) ( P(IC), IC = 1,K) 146 79100 FORMAT(1X,'UNRESTRICTED ESTIMATES OF MIXING PROBS: ',3F8.3) C C Estimate Hardy-Weinberg p and q: 147 PEA = P(1) + 0.5*P(2) 148 Q = 0.5*P(2) + P(3) 149 WRITE (6,79300) PEA, Q 150 79300 FORMAT(1X, 'ESTIMATES OF GENE POOL PROBS: ', 3F8.3) C Re-compute mixing probability estimates as functions of C p and q: 151 P(1) = PEA**2 152 P(2) = 2.0*PEA*Q 153 P(3) = Q**2 C 154 WRITE (6,79200) ( P(IC), IC = 1,K) 155 79200 FORMAT(1X, 'RESTRICTED ESTIMATES OF MIXING PROBS: ',3F8.3) C C COUNT NUMBERS IN CLUSTERS: 156 DO 1900 IC = 1,K 1 157 NC(IC) = 0 1 158 1900 CONTINUE 159 DO 2000 I = 1,N 1 160 IGROUP = ICLUS(I) 1 161 NC(IGROUP) = NC(IGROUP) + 1 1 162 2000 CONTINUE C C C 163 VARHAT = WGSS/XN C 164 SUMLNF = 0.0 165 DO 2200 I=1,N 1 166 SUMPXF = 0.0 1 167 DO 2100 IC=1,K 2 168 SUMPXF = SUMPXF + P(IC)*F(I,IC) 2 169 2100 CONTINUE 1 170 SUMLNF = SUMLNF + ALOG(SUMPXF) 1 171 2200 CONTINUE C 172 XMN2LL = -2.0*SUMLNF 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 7 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 C C 173 WGMS = WGSS/(N-K) 174 WRITE (6,40000) WGSS, XMN2LL, WGMS 175 STDERR = SQRT(WGMS) 176 WRITE (6,74000) STDERR C 177 KM1 = K-1 178 DO 2300 IC=1,KM1 1 179 ICP1 = IC+1 C B(IC) IS BOUNDARY BETWEEN G-TH AND G+1-ST CLASSES. 1 180 B(IC) = ( XMEAN(IC) + XMEAN(ICP1) )/2.0 1 181 BDYADJ = DLOG(P(ICP1)) - DLOG(P(IC)) 1 182 BDYADJ = BDYADJ/(XMEAN(ICP1) - XMEAN(IC)) 1 183 BDYADJ = VARHAT*BDYADJ 1 184 B(IC) = B(IC) - BDYADJ 1 185 2300 CONTINUE 186 WRITE (6,58000) ITER 187 WRITE (6,42000) (B(IC),IC=1,KM1) 188 WRITE (6,38000) (XMEAN(IC),IC=1,K) 189 IF (ITER .EQ. 1) GO TO 2500 190 DO 2400 I = 1,N C If any case changes cluster, another iteration will be performed. 1 191 IF (ICLUS(I) .EQ. ICLSOL(I)) GO TO 2400 1 192 GO TO 2500 1 193 2400 CONTINUE 194 WRITE (6,79000) C Even if no case changes cluster, another iteration will be C performed if the parameter estimates have changed much. 195 DO 2450 IC = 1,K 1 196 TEST=(XMEAN(IC)-XMEANOL(IC))/XMEANOL(IC) 1 197 IF (ABS(TEST) .LE. 0.0001) GO TO 2450 1 198 GO TO 2500 1 199 2450 CONTINUE 200 GO TO 2900 201 2500 CONTINUE 202 ITER = ITER + 1 203 IF (ITER.GE.100) GO TO 2600 204 GO TO 700 205 2600 WRITE (6,80000) 206 2700 CONTINUE 207 WRITE (6,88000) 208 2800 STOP C C 209 2900 CONTINUE C 210 WRITE (6,60000) ( P(IC), IC = 1,K ) 211 WRITE (6,62000) (NC(IC),IC=1,K) 212 WRITE (6,72000) (VAR(IC),IC=1,K) 213 WRITE (6,68000) (SD(IC), IC=1,K) C VARHAT IS MLE OF VARIANCE. 214 VARHAT = WGSS/N 215 WRITE (6,30000) VARHAT C C 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 8 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 216 IF (N .GE. 31) GO TO 3050 217 WRITE (6,78000) 218 DO 3000 I=1,N 1 219 WRITE (6,76000) X(I),ICLUS(I),(PP(IC,I),IC=1,K) 1 220 3000 CONTINUE C 221 3050 CONTINUE C C C COMPUTE MODEL-SELECTION CRITERIA: C In general, C NO. PARAMETERS = K MEANS + K VARIANCES + (K-1) PROBS. C But in the Hardy-Weinberg model, K=3 and there is only one free C mixing probability parameter, namely p. C NO. PARAMETERS = 3 MEANS + 3 VARIANCES + 1 PROB. PARAMETER = 7 222 NOPARM = 7 C 223 WRITE (6,86000) NOPARM 224 AIC = XMN2LL + 2.0*NOPARM 225 SCH = XMN2LL + ALOG(XN)*NOPARM C C SCHWARZ' CRITERION IS FIRST-DEGREE EXPANSION OF C LOG POSTERIOR PROBABILITY OF THE MODEL. C KASHYAP'S CRITERION IS SECOND-DEGREE EXPANSION OF SAME. 226 XKASH = SCH - ALOG(2*VARHAT**3) C 227 WRITE (6,82000) AIC 228 WRITE (6,84000) SCH 229 WRITE (6,48000) XKASH C C C 230 STOP 231 10000 FORMAT(2X,I1) 232 12000 FORMAT(2X,I4) 233 14000 FORMAT(5X,F3.2,2X,F8.2,2X,F8.2) 234 16000 FORMAT(1X,'CLUSTERING') 235 18000 FORMAT(1X,'POINT: '/, (1X,40I3)) 236 20000 FORMAT(1X,'CLUSTER: '/, (1X,40I3)) 237 24000 FORMAT(1X,'DATA:'/) 238 26000 FORMAT(/1X,'INITIAL PRIOR PROBS, MEANS AND VARIANCES:') 239 28000 FORMAT(1X,I2,2X,3F11.2) 240 30000 FORMAT(1X, 'M.L. ESTIMATE OF COMMON VARIANCE = ',F14.5/) 241 32000 FORMAT(1X,'CMS DSN = HW1DT CLUSPAC') 242 34000 FORMAT(1X,'COPYRIGHT 1991 STANLEY LOUIS SCLOVE.'/) 243 36000 FORMAT('1',1X,'K = ',I1,' CLUSTERS') 244 38000 FORMAT(1X,'MEANS: ',9F13.3) 245 40000 FORMAT(/1X,'WGSS = ',F14.4,' MINUS 2 LOG LIKELIHOOD = ', XF14.4, ' WGMS = ',F14.4/) 246 42000 FORMAT(1X,'BOUNDARIES:', 8X, 9F13.3) 247 44000 FORMAT(1X,'MINIMUM OF SAMPLE: ') 248 46000 FORMAT(1X,'MAXIMUM OF SAMPLE: ') 249 48000 FORMAT( 1X,'KASHYAP CRITERION = ', F14.4) 250 50000 FORMAT(/,1X,'MEAN = ', F14.4) 251 52000 FORMAT(1X, 'M.L. ESTIMATE OF VARIANCE = ',F14.5/) 252 54000 FORMAT(/1X,'SSDEVS = ',F14.4,' MINUS 2 LOG LIKELIHOOD = ', 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 9 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 XF14.4, ' STDDEV = ',F14.4/) 253 56000 FORMAT('1','****************************************', X/,1X,'PROGRAM HW1DT CLUSPAC'/1X,'MIXTURE MODEL CLUSTERING'/ X,1X,'FOR UNIVARIATE DATA (DATA ON THE LINE)'/ X,1X,'WITH UNEQUAL CLASS VARIANCES. '/ X,1X,'MIXING PROBABILITIES GIVEN BY THE HARDY-WEINBERG LAW. '/ X1X,'DEVELOPED AND PROGRAMMED BY DR. STANLEY L. SCLOVE' X/,1X,'VERSION 1.2 23-FEB-92 '/) 254 58000 FORMAT(1X,'ITERATION ', I2) 255 60000 FORMAT(1X,'PROBS:',5X,9F13.3) 256 62000 FORMAT(1X,'NUMBERS:',3X,9(I10,3X)) 257 64000 FORMAT(18A4) 258 66000 FORMAT(1X,'N = ',I3/) 259 68000 FORMAT(1X,'STD.DEVS.: ',9F13.3) 260 70000 FORMAT(1X,18A4/) 261 72000 FORMAT(1X,'VARIANCES: ',9F13.3) 262 74000 FORMAT(1X,'STD.ERROR=SQRT(WGMS) = ',F13.4/) 263 76000 FORMAT(1X,F8.2,2X,I2,3X,(8F6.3/)) 264 78000 FORMAT(1X/,1X,'DATA, LABELS AND PROBS OF CLUSTER MEMBERSHIP'/) 265 79000 FORMAT(/,1X,'NO CASE CHANGED CLUSTERS IN THIS ITERATION.') 266 80000 FORMAT(1X,'PROGRAM HAS NOT CONVERGED IN 99 ITERATIONS. STOP') 267 82000 FORMAT(1X,'AIC = ', F14.4 ) 268 84000 FORMAT(1X,'SCHWARZ CRITERION = ', F14.4 ) 269 86000 FORMAT(/1X,'NUMBER OF PARAMETERS = ',I4 ) 270 88000 FORMAT(1X,'NO OBSERVATIONS IN GROUP ',I3,'. STOP') 271 END 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 10 0SYMBOL CROSS REFERENCE DICTIONARY 0PROGRAM NAME: MAIN 0TAGS: A-ARRAY I-INTRINSIC FUNCTION S-ASSIGNED C-COMMON K-NAMED CONSTANT T-EXPLICITLY TYPED D-DUMMY ARGUMENT N-ENTRY V-INITIAL VALUE E-EQUIVALENCED P-PROMOTED X-EXTERNAL SUBPROGRAM F-STATEMENT FUNCTION Q-PADDED Y-DYNAMIC COMMON G-GENERIC NAME R-SUBPROGRAM NAME 0NAME TYPE TAG DECLARED REFS (F:REFD S:SET B:REFD/MAY BE SET) +________ ____ ______ ________ ______________________________________ 0ABS GI 197 AIC R*4 63S 64F 224S 227F ALOG R*4 I 65 66 170 225 226 B R*4 A 4 180S 184F 184S 187F BDYADJ R*4 181S 182F 182S 183F 183S 184F C R*4 A 2 UNREFERENCED DENOM R*4 A 14 105S 107F 107S 111F DLOG R*8 I 59 181 181 DSQ R*4 A 2 95S 96F EXP GI 101 F R*8 AT 10 15 98S 101S 107F 111F 168F FMT R*4 A 5 26S 31 46F 49F 51F I I*4 30S 31 32F 33F 33F 34F 39F 40F 41F 42B 46S 46S 85S 86F 86F 87F 87B 93S 95F 98F 101B 104S 105F 107F 107F 107B 109S 111F 111F 111B 113S 114F 114F 115F 117F 117F 119F 119F 120B 124S 124S 125S 125S 132S 133F 134F 134F 135F 135F 135B 159S 160B 165S 168B 190S 191F 191B 218S 219F 219F 219B IC I*4 71S 72F 72S 72F 75S 76F 76F 76F 76B 89S 90F 90B 94S 95F 95F 96F 96F 98F 101F 101B 110S 111F 111F 111B 116S 117F 119F 120B 128S 129F 130F 131F 133F 133F 133F 134F 134F 134F 135F 135F 135F 137F 138F 138F 138F 139F 139F 139F 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 11 0TAGS: A-ARRAY I-INTRINSIC FUNCTION S-ASSIGNED C-COMMON K-NAMED CONSTANT T-EXPLICITLY TYPED D-DUMMY ARGUMENT N-ENTRY V-INITIAL VALUE E-EQUIVALENCED P-PROMOTED X-EXTERNAL SUBPROGRAM F-STATEMENT FUNCTION Q-PADDED Y-DYNAMIC COMMON G-GENERIC NAME R-SUBPROGRAM NAME 0NAME TYPE TAG DECLARED REFS (F:REFD S:SET B:REFD/MAY BE SET) +________ ____ ______ ________ ______________________________________ 0 139F 139F 140F 140F 140F 141F 141F 142F 142F 143B 145S 145S 154S 154S 156S 157B 167S 168F 168B 178S 179F 180F 180F 181F 182F 184F 184B 187S 187S 188S 188S 195S 196F 196F 196B 210S 210S 211S 211S 212S 212S 213S 213S 219S 219S ICLSOL I*4 A 9 86S 191F ICLUS I*4 A 1 86F 115S 120S 125F 160F 191F 219F ICP1 I*4 179S 180F 181F 182F IGROUP I*4 160S 161F 161F IH I*4 106S 107F 107B INTGER I*4 78S 79F 79B IOTA I*4 A 1 79S 124F ITER I*4 81S 83F 186F 189F 202F 202S 203F K I*4 68S 69S 70F 71F 75F 94F 106F 110F 116F 128F 145F 154F 156F 167F 173F 177F 188F 195F 210F 211F 212F 213F 219F KM1 I*4 177S 178F 187F N I*4 23S 24F 25F 30F 45F 46F 58F 59F 78F 85F 89F 93F 104F 109F 113F 122F 124F 125F 132F 159F 165F 173F 190F 214F 216F 218F NC I*4 A 4 157S 161F 161S 211F NOPARM I*4 62S 63F 65F 222S 223F 224F 225F P R*8 AT 11 15 72S 76F 107F 111F 142S 145F 147F 147F 148F 148F 151S 152S 153S 154F 168F 181F 181F 210F PEA R*4 147S 149F 151F 152F PI R*4 57S 58F 101F PP R*8 AT 12 15 111S 114F 117F 119F 133F 134F 135F 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 12 0TAGS: A-ARRAY I-INTRINSIC FUNCTION S-ASSIGNED C-COMMON K-NAMED CONSTANT T-EXPLICITLY TYPED D-DUMMY ARGUMENT N-ENTRY V-INITIAL VALUE E-EQUIVALENCED P-PROMOTED X-EXTERNAL SUBPROGRAM F-STATEMENT FUNCTION Q-PADDED Y-DYNAMIC COMMON G-GENERIC NAME R-SUBPROGRAM NAME 0NAME TYPE TAG DECLARED REFS (F:REFD S:SET B:REFD/MAY BE SET) +________ ____ ______ ________ ______________________________________ 0 219F Q R*4 148S 149F 152F 153F SCH R*4 65S 66F 225S 226F 228F SD R*4 A 7 141S 213F SQRT GI 60 101 141 175 SS R*8 AT 6 15 131S 135F 135S 139F SSD R*4 A 6 139S 140F 143F SSDEVS R*8 T 17 29S 53S 54F 58F 61F STDDEV R*4 60S 61F STDERR R*4 175S 176F SUM R*8 AT 2 15 130S 134F 134S 138F 139F 139F SUMLNF R*4 164S 170F 170S 172F SUMPXF R*4 166S 168F 168S 170F SUMSQS R*8 T 15 28S 33F 33S 53F TEMP R*8 T 16 58S 59F TEST R*4 196S 197F TITLE R*4 A 3 18S 22F TOTAL R*8 T 15 27S 32F 32S 52F 53F 53F VAR R*4 A 8 72S 76F 96F 101F 140S 141F 212F VARHAT R*4 54S 56F 60F 66F 163S 183F 214S 215F 226F WGMS R*4 173S 174F 175F WGSS R*8 T 17 127S 143F 143S 163F 173F 174F 214F X R*4 A 1 31S 32F 33F 33F 36F 37F 39F 40F 41F 42F 46F 95F 134F 135F 135F 219F XBAR R*4 52S 55F XKASH R*4 66S 67F 226S 229F XMAX R*4 36S 41F 42S 51F XMEAN R*8 AT 4 17 72S 76F 87F 90F 95F 138S 180F 180F 182F 182F 188F 196F XMEANOL R*8 AT 4 17 87S 90S 196F 196F XMIN R*4 37S 39F 40S 49F XMNDSQ R*4 A 1 UNREFERENCED XMN2LL R*8 T 17 59S 61F 63F 65F 84F 172S 174F 224F 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 13 0TAGS: A-ARRAY I-INTRINSIC FUNCTION S-ASSIGNED C-COMMON K-NAMED CONSTANT T-EXPLICITLY TYPED D-DUMMY ARGUMENT N-ENTRY V-INITIAL VALUE E-EQUIVALENCED P-PROMOTED X-EXTERNAL SUBPROGRAM F-STATEMENT FUNCTION Q-PADDED Y-DYNAMIC COMMON G-GENERIC NAME R-SUBPROGRAM NAME 0NAME TYPE TAG DECLARED REFS (F:REFD S:SET B:REFD/MAY BE SET) +________ ____ ______ ________ ______________________________________ 0 225F XMN2LLOL R*8 T 17 84S XMXPR R*4 A 13 114S 117F 119S XN R*4 24S 52F 53F 54F 65F 142F 163F 225F XNC R*4 A 11 129S 133F 133S 137F 138F 139F 140F 142F ZSQ R*4 96S 97F 101F 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 14 0LABEL CROSS REFERENCE DICTIONARY 0TAGS: A-USED AS ARGUMENT F-FORMAT S-USED IN ASSIGN STATEMENT B-OBJECT OF BRANCH N-NON-EXECUTABLE 0 LABEL TAG DEFINED REFERENCED +____________ ___ _______ ___________________________________________ 0 100 B 36 34 200 B 38 35 300 43 30 350 B 47 45 400 73 71 500 77 75 600 80 78 700 B 82 204 800 88 85 850 91 89 900 B 92 83 1000 B 100 97 1100 B 102 93 94 99 1200 103 UNREFERENCED 1300 108 104 106 1400 112 109 110 1500 B 119 117 1600 B 121 113 116 118 1650 B 126 122 1700 136 132 1800 144 128 1900 158 156 2000 162 159 2100 169 167 2200 171 165 2300 185 178 2400 B 193 190 191 2450 B 199 195 197 2500 B 201 189 192 198 2600 B 205 203 2700 B 206 137 2800 208 UNREFERENCED 2900 B 209 200 3000 220 218 3050 B 221 216 10000 NF 231 68 12000 NF 232 23 14000 NF 233 72 16000 NF 234 123 18000 NF 235 124 20000 NF 236 125 24000 NF 237 44 26000 NF 238 74 28000 NF 239 76 30000 NF 240 215 32000 NF 241 20 34000 NF 242 21 36000 NF 243 70 38000 NF 244 188 40000 NF 245 174 1LEVEL 2.3.0 (MAR 1988) VS FORTRAN FEB 23, 1992 15:24:31 NAME:MAIN PAGE: 15 0TAGS: A-USED AS ARGUMENT F-FORMAT S-USED IN ASSIGN STATEMENT B-OBJECT OF BRANCH N-NON-EXECUTABLE 0 LABEL TAG DEFINED REFERENCED +____________ ___ _______ ___________________________________________ 0 42000 NF 246 187 44000 NF 247 48 46000 NF 248 50 48000 NF 249 67 229 50000 NF 250 55 52000 NF 251 56 54000 NF 252 61 56000 NF 253 19 58000 NF 254 186 60000 NF 255 210 62000 NF 256 211 64000 NF 257 18 26 66000 NF 258 25 68000 NF 259 213 70000 NF 260 22 72000 NF 261 212 74000 NF 262 176 76000 NF 263 219 78000 NF 264 217 79000 NF 265 194 79100 NF 146 145 79200 NF 155 154 79300 NF 150 149 80000 NF 266 205 82000 NF 267 64 227 84000 NF 268 228 86000 NF 269 223 88000 NF 270 207 0*STATISTICS* SOURCE STATEMENTS = 269, PROGRAM SIZE = 499108 BYTES, PROGRAM NAME = MAIN PAGE: 1. 0*STATISTICS* NO DIAGNOSTICS GENERATED. 0**MAIN** END OF COMPILATION 1 ****** TIME STAMP: 92.05415.24.31