Annotation of imach096d/src/imach.c, revision 1.16
1.2 lievre 1:
2: /*********************** Imach **************************************
3: This program computes Healthy Life Expectancies from cross-longitudinal
4: data. Cross-longitudinal consist in a first survey ("cross") where
5: individuals from different ages are interviewed on their health status
6: or degree of disability. At least a second wave of interviews
7: ("longitudinal") should measure each new individual health status.
8: Health expectancies are computed from the transistions observed between
9: waves and are computed for each degree of severity of disability (number
10: of life states). More degrees you consider, more time is necessary to
1.11 lievre 11: reach the Maximum Likelihood of the parameters involved in the model.
1.2 lievre 12: The simplest model is the multinomial logistic model where pij is
13: the probabibility to be observed in state j at the second wave conditional
14: to be observed in state i at the first wave. Therefore the model is:
15: log(pij/pii)= aij + bij*age+ cij*sex + etc , where 'age' is age and 'sex'
16: is a covariate. If you want to have a more complex model than "constant and
17: age", you should modify the program where the markup
18: *Covariates have to be included here again* invites you to do it.
19: More covariates you add, less is the speed of the convergence.
20:
21: The advantage that this computer programme claims, comes from that if the
22: delay between waves is not identical for each individual, or if some
23: individual missed an interview, the information is not rounded or lost, but
24: taken into account using an interpolation or extrapolation.
1.12 lievre 25: hPijx is the probability to be
1.2 lievre 26: observed in state i at age x+h conditional to the observed state i at age
27: x. The delay 'h' can be split into an exact number (nh*stepm) of
28: unobserved intermediate states. This elementary transition (by month or
29: quarter trimester, semester or year) is model as a multinomial logistic.
30: The hPx matrix is simply the matrix product of nh*stepm elementary matrices
31: and the contribution of each individual to the likelihood is simply hPijx.
32:
33: Also this programme outputs the covariance matrix of the parameters but also
34: of the life expectancies. It also computes the prevalence limits.
35:
36: Authors: Nicolas Brouard (brouard@ined.fr) and Agnès Lièvre (lievre@ined.fr).
37: Institut national d'études démographiques, Paris.
38: This software have been partly granted by Euro-REVES, a concerted action
39: from the European Union.
40: It is copyrighted identically to a GNU software product, ie programme and
41: software can be distributed freely for non commercial use. Latest version
42: can be accessed at http://euroreves.ined.fr/imach .
43: **********************************************************************/
44:
45: #include <math.h>
46: #include <stdio.h>
47: #include <stdlib.h>
48: #include <unistd.h>
49:
50: #define MAXLINE 256
51: #define FILENAMELENGTH 80
52: /*#define DEBUG*/
53: #define windows
1.5 lievre 54: #define GLOCK_ERROR_NOPATH -1 /* empty path */
55: #define GLOCK_ERROR_GETCWD -2 /* cannot get cwd */
56:
1.2 lievre 57: #define MAXPARM 30 /* Maximum number of parameters for the optimization */
58: #define NPARMAX 64 /* (nlstate+ndeath-1)*nlstate*ncovmodel */
59:
60: #define NINTERVMAX 8
61: #define NLSTATEMAX 8 /* Maximum number of live states (for func) */
62: #define NDEATHMAX 8 /* Maximum number of dead states (for func) */
63: #define NCOVMAX 8 /* Maximum number of covariates */
1.3 lievre 64: #define MAXN 20000
1.2 lievre 65: #define YEARM 12. /* Number of months per year */
66: #define AGESUP 130
67: #define AGEBASE 40
68:
69:
70: int nvar;
1.8 lievre 71: int cptcovn, cptcovage=0, cptcoveff=0,cptcov;
1.2 lievre 72: int npar=NPARMAX;
73: int nlstate=2; /* Number of live states */
74: int ndeath=1; /* Number of dead states */
75: int ncovmodel, ncov; /* Total number of covariables including constant a12*1 +b12*x ncovmodel=2 */
1.15 lievre 76: int popbased=0;
1.2 lievre 77:
78: int *wav; /* Number of waves for this individuual 0 is possible */
79: int maxwav; /* Maxim number of waves */
1.8 lievre 80: int jmin, jmax; /* min, max spacing between 2 waves */
1.2 lievre 81: int mle, weightopt;
82: int **mw; /* mw[mi][i] is number of the mi wave for this individual */
83: int **dh; /* dh[mi][i] is number of steps between mi,mi+1 for this individual */
1.8 lievre 84: double jmean; /* Mean space between 2 waves */
1.2 lievre 85: double **oldm, **newm, **savm; /* Working pointers to matrices */
86: double **oldms, **newms, **savms; /* Fixed working pointers to matrices */
1.13 lievre 87: FILE *fic,*ficpar, *ficparo,*ficres, *ficrespl, *ficrespij, *ficrest,*ficresf;
1.16 ! lievre 88: FILE *ficgp, *fichtm,*ficresprob,*ficpop;
1.2 lievre 89: FILE *ficreseij;
90: char filerese[FILENAMELENGTH];
91: FILE *ficresvij;
92: char fileresv[FILENAMELENGTH];
93: FILE *ficresvpl;
94: char fileresvpl[FILENAMELENGTH];
95:
96: #define NR_END 1
97: #define FREE_ARG char*
98: #define FTOL 1.0e-10
99:
100: #define NRANSI
101: #define ITMAX 200
102:
103: #define TOL 2.0e-4
104:
105: #define CGOLD 0.3819660
106: #define ZEPS 1.0e-10
107: #define SHFT(a,b,c,d) (a)=(b);(b)=(c);(c)=(d);
108:
109: #define GOLD 1.618034
110: #define GLIMIT 100.0
111: #define TINY 1.0e-20
112:
113: static double maxarg1,maxarg2;
114: #define FMAX(a,b) (maxarg1=(a),maxarg2=(b),(maxarg1)>(maxarg2)? (maxarg1):(maxarg2))
115: #define FMIN(a,b) (maxarg1=(a),maxarg2=(b),(maxarg1)<(maxarg2)? (maxarg1):(maxarg2))
116:
117: #define SIGN(a,b) ((b)>0.0 ? fabs(a) : -fabs(a))
118: #define rint(a) floor(a+0.5)
119:
120: static double sqrarg;
121: #define SQR(a) ((sqrarg=(a)) == 0.0 ? 0.0 :sqrarg*sqrarg)
122: #define SWAP(a,b) {temp=(a);(a)=(b);(b)=temp;}
123:
124: int imx;
125: int stepm;
126: /* Stepm, step in month: minimum step interpolation*/
127:
128: int m,nb;
1.6 lievre 129: int *num, firstpass=0, lastpass=4,*cod, *ncodemax, *Tage;
1.2 lievre 130: double **agev,*moisnais, *annais, *moisdc, *andc,**mint, **anint;
1.13 lievre 131: double **pmmij, ***probs, ***mobaverage;
1.2 lievre 132:
133: double *weight;
134: int **s; /* Status */
135: double *agedc, **covar, idx;
1.7 lievre 136: int **nbcode, *Tcode, *Tvar, **codtab, **Tvard, *Tprod, cptcovprod, *Tvaraff;
1.2 lievre 137:
138: double ftol=FTOL; /* Tolerance for computing Max Likelihood */
139: double ftolhess; /* Tolerance for computing hessian */
140:
1.7 lievre 141: /**************** split *************************/
1.5 lievre 142: static int split( char *path, char *dirc, char *name )
143: {
144: char *s; /* pointer */
145: int l1, l2; /* length counters */
146:
147: l1 = strlen( path ); /* length of path */
148: if ( l1 == 0 ) return( GLOCK_ERROR_NOPATH );
149: s = strrchr( path, '\\' ); /* find last / */
150: if ( s == NULL ) { /* no directory, so use current */
151: #if defined(__bsd__) /* get current working directory */
152: extern char *getwd( );
153:
154: if ( getwd( dirc ) == NULL ) {
155: #else
156: extern char *getcwd( );
157:
158: if ( getcwd( dirc, FILENAME_MAX ) == NULL ) {
159: #endif
160: return( GLOCK_ERROR_GETCWD );
161: }
162: strcpy( name, path ); /* we've got it */
163: } else { /* strip direcotry from path */
164: s++; /* after this, the filename */
165: l2 = strlen( s ); /* length of filename */
166: if ( l2 == 0 ) return( GLOCK_ERROR_NOPATH );
167: strcpy( name, s ); /* save file name */
168: strncpy( dirc, path, l1 - l2 ); /* now the directory */
169: dirc[l1-l2] = 0; /* add zero */
170: }
171: l1 = strlen( dirc ); /* length of directory */
172: if ( dirc[l1-1] != '\\' ) { dirc[l1] = '\\'; dirc[l1+1] = 0; }
173: return( 0 ); /* we're done */
174: }
175:
176:
1.2 lievre 177: /******************************************/
178:
179: void replace(char *s, char*t)
180: {
181: int i;
182: int lg=20;
183: i=0;
184: lg=strlen(t);
185: for(i=0; i<= lg; i++) {
186: (s[i] = t[i]);
187: if (t[i]== '\\') s[i]='/';
188: }
189: }
190:
191: int nbocc(char *s, char occ)
192: {
193: int i,j=0;
194: int lg=20;
195: i=0;
196: lg=strlen(s);
197: for(i=0; i<= lg; i++) {
198: if (s[i] == occ ) j++;
199: }
200: return j;
201: }
202:
203: void cutv(char *u,char *v, char*t, char occ)
204: {
1.6 lievre 205: int i,lg,j,p=0;
1.2 lievre 206: i=0;
207: for(j=0; j<=strlen(t)-1; j++) {
1.3 lievre 208: if((t[j]!= occ) && (t[j+1]== occ)) p=j+1;
1.2 lievre 209: }
210:
211: lg=strlen(t);
212: for(j=0; j<p; j++) {
213: (u[j] = t[j]);
214: }
1.6 lievre 215: u[p]='\0';
1.2 lievre 216:
217: for(j=0; j<= lg; j++) {
218: if (j>=(p+1))(v[j-p-1] = t[j]);
219: }
220: }
221:
222: /********************** nrerror ********************/
223:
224: void nrerror(char error_text[])
225: {
226: fprintf(stderr,"ERREUR ...\n");
227: fprintf(stderr,"%s\n",error_text);
228: exit(1);
229: }
230: /*********************** vector *******************/
231: double *vector(int nl, int nh)
232: {
233: double *v;
234: v=(double *) malloc((size_t)((nh-nl+1+NR_END)*sizeof(double)));
235: if (!v) nrerror("allocation failure in vector");
236: return v-nl+NR_END;
237: }
238:
239: /************************ free vector ******************/
240: void free_vector(double*v, int nl, int nh)
241: {
242: free((FREE_ARG)(v+nl-NR_END));
243: }
244:
245: /************************ivector *******************************/
246: int *ivector(long nl,long nh)
247: {
248: int *v;
249: v=(int *) malloc((size_t)((nh-nl+1+NR_END)*sizeof(int)));
250: if (!v) nrerror("allocation failure in ivector");
251: return v-nl+NR_END;
252: }
253:
254: /******************free ivector **************************/
255: void free_ivector(int *v, long nl, long nh)
256: {
257: free((FREE_ARG)(v+nl-NR_END));
258: }
259:
260: /******************* imatrix *******************************/
261: int **imatrix(long nrl, long nrh, long ncl, long nch)
262: /* allocate a int matrix with subscript range m[nrl..nrh][ncl..nch] */
263: {
264: long i, nrow=nrh-nrl+1,ncol=nch-ncl+1;
265: int **m;
266:
267: /* allocate pointers to rows */
268: m=(int **) malloc((size_t)((nrow+NR_END)*sizeof(int*)));
269: if (!m) nrerror("allocation failure 1 in matrix()");
270: m += NR_END;
271: m -= nrl;
272:
273:
274: /* allocate rows and set pointers to them */
275: m[nrl]=(int *) malloc((size_t)((nrow*ncol+NR_END)*sizeof(int)));
276: if (!m[nrl]) nrerror("allocation failure 2 in matrix()");
277: m[nrl] += NR_END;
278: m[nrl] -= ncl;
279:
280: for(i=nrl+1;i<=nrh;i++) m[i]=m[i-1]+ncol;
281:
282: /* return pointer to array of pointers to rows */
283: return m;
284: }
285:
286: /****************** free_imatrix *************************/
287: void free_imatrix(m,nrl,nrh,ncl,nch)
288: int **m;
289: long nch,ncl,nrh,nrl;
290: /* free an int matrix allocated by imatrix() */
291: {
292: free((FREE_ARG) (m[nrl]+ncl-NR_END));
293: free((FREE_ARG) (m+nrl-NR_END));
294: }
295:
296: /******************* matrix *******************************/
297: double **matrix(long nrl, long nrh, long ncl, long nch)
298: {
299: long i, nrow=nrh-nrl+1, ncol=nch-ncl+1;
300: double **m;
301:
302: m=(double **) malloc((size_t)((nrow+NR_END)*sizeof(double*)));
303: if (!m) nrerror("allocation failure 1 in matrix()");
304: m += NR_END;
305: m -= nrl;
306:
307: m[nrl]=(double *) malloc((size_t)((nrow*ncol+NR_END)*sizeof(double)));
308: if (!m[nrl]) nrerror("allocation failure 2 in matrix()");
309: m[nrl] += NR_END;
310: m[nrl] -= ncl;
311:
312: for (i=nrl+1; i<=nrh; i++) m[i]=m[i-1]+ncol;
313: return m;
314: }
315:
316: /*************************free matrix ************************/
317: void free_matrix(double **m, long nrl, long nrh, long ncl, long nch)
318: {
319: free((FREE_ARG)(m[nrl]+ncl-NR_END));
320: free((FREE_ARG)(m+nrl-NR_END));
321: }
322:
323: /******************* ma3x *******************************/
324: double ***ma3x(long nrl, long nrh, long ncl, long nch, long nll, long nlh)
325: {
326: long i, j, nrow=nrh-nrl+1, ncol=nch-ncl+1, nlay=nlh-nll+1;
327: double ***m;
328:
329: m=(double ***) malloc((size_t)((nrow+NR_END)*sizeof(double*)));
330: if (!m) nrerror("allocation failure 1 in matrix()");
331: m += NR_END;
332: m -= nrl;
333:
334: m[nrl]=(double **) malloc((size_t)((nrow*ncol+NR_END)*sizeof(double)));
335: if (!m[nrl]) nrerror("allocation failure 2 in matrix()");
336: m[nrl] += NR_END;
337: m[nrl] -= ncl;
338:
339: for (i=nrl+1; i<=nrh; i++) m[i]=m[i-1]+ncol;
340:
341: m[nrl][ncl]=(double *) malloc((size_t)((nrow*ncol*nlay+NR_END)*sizeof(double)));
342: if (!m[nrl][ncl]) nrerror("allocation failure 3 in matrix()");
343: m[nrl][ncl] += NR_END;
344: m[nrl][ncl] -= nll;
345: for (j=ncl+1; j<=nch; j++)
346: m[nrl][j]=m[nrl][j-1]+nlay;
347:
348: for (i=nrl+1; i<=nrh; i++) {
349: m[i][ncl]=m[i-1l][ncl]+ncol*nlay;
350: for (j=ncl+1; j<=nch; j++)
351: m[i][j]=m[i][j-1]+nlay;
352: }
353: return m;
354: }
355:
356: /*************************free ma3x ************************/
357: void free_ma3x(double ***m, long nrl, long nrh, long ncl, long nch,long nll, long nlh)
358: {
359: free((FREE_ARG)(m[nrl][ncl]+ nll-NR_END));
360: free((FREE_ARG)(m[nrl]+ncl-NR_END));
361: free((FREE_ARG)(m+nrl-NR_END));
362: }
363:
364: /***************** f1dim *************************/
365: extern int ncom;
366: extern double *pcom,*xicom;
367: extern double (*nrfunc)(double []);
368:
369: double f1dim(double x)
370: {
371: int j;
372: double f;
373: double *xt;
374:
375: xt=vector(1,ncom);
376: for (j=1;j<=ncom;j++) xt[j]=pcom[j]+x*xicom[j];
377: f=(*nrfunc)(xt);
378: free_vector(xt,1,ncom);
379: return f;
380: }
381:
382: /*****************brent *************************/
383: double brent(double ax, double bx, double cx, double (*f)(double), double tol, double *xmin)
384: {
385: int iter;
386: double a,b,d,etemp;
387: double fu,fv,fw,fx;
388: double ftemp;
389: double p,q,r,tol1,tol2,u,v,w,x,xm;
390: double e=0.0;
391:
392: a=(ax < cx ? ax : cx);
393: b=(ax > cx ? ax : cx);
394: x=w=v=bx;
395: fw=fv=fx=(*f)(x);
396: for (iter=1;iter<=ITMAX;iter++) {
397: xm=0.5*(a+b);
398: tol2=2.0*(tol1=tol*fabs(x)+ZEPS);
399: /* if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret)))*/
400: printf(".");fflush(stdout);
401: #ifdef DEBUG
402: printf("br %d,x=%.10e xm=%.10e b=%.10e a=%.10e tol=%.10e tol1=%.10e tol2=%.10e x-xm=%.10e fx=%.12e fu=%.12e,fw=%.12e,ftemp=%.12e,ftol=%.12e\n",iter,x,xm,b,a,tol,tol1,tol2,(x-xm),fx,fu,fw,ftemp,ftol);
403: /* if ((fabs(x-xm) <= (tol2-0.5*(b-a)))||(2.0*fabs(fu-ftemp) <= ftol*1.e-2*(fabs(fu)+fabs(ftemp)))) { */
404: #endif
405: if (fabs(x-xm) <= (tol2-0.5*(b-a))){
406: *xmin=x;
407: return fx;
408: }
409: ftemp=fu;
410: if (fabs(e) > tol1) {
411: r=(x-w)*(fx-fv);
412: q=(x-v)*(fx-fw);
413: p=(x-v)*q-(x-w)*r;
414: q=2.0*(q-r);
415: if (q > 0.0) p = -p;
416: q=fabs(q);
417: etemp=e;
418: e=d;
419: if (fabs(p) >= fabs(0.5*q*etemp) || p <= q*(a-x) || p >= q*(b-x))
420: d=CGOLD*(e=(x >= xm ? a-x : b-x));
421: else {
422: d=p/q;
423: u=x+d;
424: if (u-a < tol2 || b-u < tol2)
425: d=SIGN(tol1,xm-x);
426: }
427: } else {
428: d=CGOLD*(e=(x >= xm ? a-x : b-x));
429: }
430: u=(fabs(d) >= tol1 ? x+d : x+SIGN(tol1,d));
431: fu=(*f)(u);
432: if (fu <= fx) {
433: if (u >= x) a=x; else b=x;
434: SHFT(v,w,x,u)
435: SHFT(fv,fw,fx,fu)
436: } else {
437: if (u < x) a=u; else b=u;
438: if (fu <= fw || w == x) {
439: v=w;
440: w=u;
441: fv=fw;
442: fw=fu;
443: } else if (fu <= fv || v == x || v == w) {
444: v=u;
445: fv=fu;
446: }
447: }
448: }
449: nrerror("Too many iterations in brent");
450: *xmin=x;
451: return fx;
452: }
453:
454: /****************** mnbrak ***********************/
455:
456: void mnbrak(double *ax, double *bx, double *cx, double *fa, double *fb, double *fc,
457: double (*func)(double))
458: {
459: double ulim,u,r,q, dum;
460: double fu;
461:
462: *fa=(*func)(*ax);
463: *fb=(*func)(*bx);
464: if (*fb > *fa) {
465: SHFT(dum,*ax,*bx,dum)
466: SHFT(dum,*fb,*fa,dum)
467: }
468: *cx=(*bx)+GOLD*(*bx-*ax);
469: *fc=(*func)(*cx);
470: while (*fb > *fc) {
471: r=(*bx-*ax)*(*fb-*fc);
472: q=(*bx-*cx)*(*fb-*fa);
473: u=(*bx)-((*bx-*cx)*q-(*bx-*ax)*r)/
474: (2.0*SIGN(FMAX(fabs(q-r),TINY),q-r));
475: ulim=(*bx)+GLIMIT*(*cx-*bx);
476: if ((*bx-u)*(u-*cx) > 0.0) {
477: fu=(*func)(u);
478: } else if ((*cx-u)*(u-ulim) > 0.0) {
479: fu=(*func)(u);
480: if (fu < *fc) {
481: SHFT(*bx,*cx,u,*cx+GOLD*(*cx-*bx))
482: SHFT(*fb,*fc,fu,(*func)(u))
483: }
484: } else if ((u-ulim)*(ulim-*cx) >= 0.0) {
485: u=ulim;
486: fu=(*func)(u);
487: } else {
488: u=(*cx)+GOLD*(*cx-*bx);
489: fu=(*func)(u);
490: }
491: SHFT(*ax,*bx,*cx,u)
492: SHFT(*fa,*fb,*fc,fu)
493: }
494: }
495:
496: /*************** linmin ************************/
497:
498: int ncom;
499: double *pcom,*xicom;
500: double (*nrfunc)(double []);
501:
502: void linmin(double p[], double xi[], int n, double *fret,double (*func)(double []))
503: {
504: double brent(double ax, double bx, double cx,
505: double (*f)(double), double tol, double *xmin);
506: double f1dim(double x);
507: void mnbrak(double *ax, double *bx, double *cx, double *fa, double *fb,
508: double *fc, double (*func)(double));
509: int j;
510: double xx,xmin,bx,ax;
511: double fx,fb,fa;
512:
513: ncom=n;
514: pcom=vector(1,n);
515: xicom=vector(1,n);
516: nrfunc=func;
517: for (j=1;j<=n;j++) {
518: pcom[j]=p[j];
519: xicom[j]=xi[j];
520: }
521: ax=0.0;
522: xx=1.0;
523: mnbrak(&ax,&xx,&bx,&fa,&fx,&fb,f1dim);
524: *fret=brent(ax,xx,bx,f1dim,TOL,&xmin);
525: #ifdef DEBUG
526: printf("retour brent fret=%.12e xmin=%.12e\n",*fret,xmin);
527: #endif
528: for (j=1;j<=n;j++) {
529: xi[j] *= xmin;
530: p[j] += xi[j];
531: }
532: free_vector(xicom,1,n);
533: free_vector(pcom,1,n);
534: }
535:
536: /*************** powell ************************/
537: void powell(double p[], double **xi, int n, double ftol, int *iter, double *fret,
538: double (*func)(double []))
539: {
540: void linmin(double p[], double xi[], int n, double *fret,
541: double (*func)(double []));
542: int i,ibig,j;
543: double del,t,*pt,*ptt,*xit;
544: double fp,fptt;
545: double *xits;
546: pt=vector(1,n);
547: ptt=vector(1,n);
548: xit=vector(1,n);
549: xits=vector(1,n);
550: *fret=(*func)(p);
551: for (j=1;j<=n;j++) pt[j]=p[j];
552: for (*iter=1;;++(*iter)) {
553: fp=(*fret);
554: ibig=0;
555: del=0.0;
556: printf("\nPowell iter=%d -2*LL=%.12f",*iter,*fret);
557: for (i=1;i<=n;i++)
558: printf(" %d %.12f",i, p[i]);
559: printf("\n");
560: for (i=1;i<=n;i++) {
561: for (j=1;j<=n;j++) xit[j]=xi[j][i];
562: fptt=(*fret);
563: #ifdef DEBUG
564: printf("fret=%lf \n",*fret);
565: #endif
566: printf("%d",i);fflush(stdout);
567: linmin(p,xit,n,fret,func);
568: if (fabs(fptt-(*fret)) > del) {
569: del=fabs(fptt-(*fret));
570: ibig=i;
571: }
572: #ifdef DEBUG
573: printf("%d %.12e",i,(*fret));
574: for (j=1;j<=n;j++) {
575: xits[j]=FMAX(fabs(p[j]-pt[j]),1.e-5);
576: printf(" x(%d)=%.12e",j,xit[j]);
577: }
578: for(j=1;j<=n;j++)
579: printf(" p=%.12e",p[j]);
580: printf("\n");
581: #endif
582: }
583: if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret))) {
584: #ifdef DEBUG
585: int k[2],l;
586: k[0]=1;
587: k[1]=-1;
588: printf("Max: %.12e",(*func)(p));
589: for (j=1;j<=n;j++)
590: printf(" %.12e",p[j]);
591: printf("\n");
592: for(l=0;l<=1;l++) {
593: for (j=1;j<=n;j++) {
594: ptt[j]=p[j]+(p[j]-pt[j])*k[l];
595: printf("l=%d j=%d ptt=%.12e, xits=%.12e, p=%.12e, xit=%.12e", l,j,ptt[j],xits[j],p[j],xit[j]);
596: }
597: printf("func(ptt)=%.12e, deriv=%.12e\n",(*func)(ptt),(ptt[j]-p[j])/((*func)(ptt)-(*func)(p)));
598: }
599: #endif
600:
601:
602: free_vector(xit,1,n);
603: free_vector(xits,1,n);
604: free_vector(ptt,1,n);
605: free_vector(pt,1,n);
606: return;
607: }
608: if (*iter == ITMAX) nrerror("powell exceeding maximum iterations.");
609: for (j=1;j<=n;j++) {
610: ptt[j]=2.0*p[j]-pt[j];
611: xit[j]=p[j]-pt[j];
612: pt[j]=p[j];
613: }
614: fptt=(*func)(ptt);
615: if (fptt < fp) {
616: t=2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del)-del*SQR(fp-fptt);
617: if (t < 0.0) {
618: linmin(p,xit,n,fret,func);
619: for (j=1;j<=n;j++) {
620: xi[j][ibig]=xi[j][n];
621: xi[j][n]=xit[j];
622: }
623: #ifdef DEBUG
624: printf("Direction changed last moved %d in place of ibig=%d, new last is the average:\n",n,ibig);
625: for(j=1;j<=n;j++)
626: printf(" %.12e",xit[j]);
627: printf("\n");
628: #endif
629: }
630: }
631: }
632: }
633:
634: /**** Prevalence limit ****************/
635:
636: double **prevalim(double **prlim, int nlstate, double x[], double age, double **oldm, double **savm, double ftolpl, int ij)
637: {
638: /* Computes the prevalence limit in each live state at age x by left multiplying the unit
639: matrix by transitions matrix until convergence is reached */
640:
641: int i, ii,j,k;
642: double min, max, maxmin, maxmax,sumnew=0.;
643: double **matprod2();
644: double **out, cov[NCOVMAX], **pmij();
645: double **newm;
646: double agefin, delaymax=50 ; /* Max number of years to converge */
647:
648: for (ii=1;ii<=nlstate+ndeath;ii++)
649: for (j=1;j<=nlstate+ndeath;j++){
650: oldm[ii][j]=(ii==j ? 1.0 : 0.0);
651: }
1.6 lievre 652:
653: cov[1]=1.;
654:
655: /* Even if hstepm = 1, at least one multiplication by the unit matrix */
1.2 lievre 656: for(agefin=age-stepm/YEARM; agefin>=age-delaymax; agefin=agefin-stepm/YEARM){
657: newm=savm;
658: /* Covariates have to be included here again */
1.6 lievre 659: cov[2]=agefin;
660:
661: for (k=1; k<=cptcovn;k++) {
1.7 lievre 662: cov[2+k]=nbcode[Tvar[k]][codtab[ij][Tvar[k]]];
663: /*printf("ij=%d Tvar[k]=%d nbcode=%d cov=%lf\n",ij, Tvar[k],nbcode[Tvar[k]][codtab[ij][Tvar[k]]],cov[2+k]);*/
1.6 lievre 664: }
665: for (k=1; k<=cptcovage;k++)
666: cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2];
1.7 lievre 667: for (k=1; k<=cptcovprod;k++)
668: cov[2+Tprod[k]]=nbcode[Tvard[k][1]][codtab[ij][Tvard[k][1]]]*nbcode[Tvard[k][2]][codtab[ij][Tvard[k][2]]];
669:
670: /*printf("ij=%d cptcovprod=%d tvar=%d ", ij, cptcovprod, Tvar[1]);*/
671: /*printf("ij=%d cov[3]=%lf cov[4]=%lf \n",ij, cov[3],cov[4]);*/
672:
1.2 lievre 673: out=matprod2(newm, pmij(pmmij,cov,ncovmodel,x,nlstate),1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, oldm);
674:
675: savm=oldm;
676: oldm=newm;
677: maxmax=0.;
678: for(j=1;j<=nlstate;j++){
679: min=1.;
680: max=0.;
681: for(i=1; i<=nlstate; i++) {
682: sumnew=0;
683: for(k=1; k<=ndeath; k++) sumnew+=newm[i][nlstate+k];
684: prlim[i][j]= newm[i][j]/(1-sumnew);
685: max=FMAX(max,prlim[i][j]);
686: min=FMIN(min,prlim[i][j]);
687: }
688: maxmin=max-min;
689: maxmax=FMAX(maxmax,maxmin);
690: }
691: if(maxmax < ftolpl){
692: return prlim;
693: }
694: }
695: }
696:
1.12 lievre 697: /*************** transition probabilities ***************/
1.2 lievre 698:
699: double **pmij(double **ps, double *cov, int ncovmodel, double *x, int nlstate )
700: {
701: double s1, s2;
702: /*double t34;*/
703: int i,j,j1, nc, ii, jj;
704:
705: for(i=1; i<= nlstate; i++){
706: for(j=1; j<i;j++){
707: for (nc=1, s2=0.;nc <=ncovmodel; nc++){
708: /*s2 += param[i][j][nc]*cov[nc];*/
709: s2 += x[(i-1)*nlstate*ncovmodel+(j-1)*ncovmodel+nc+(i-1)*(ndeath-1)*ncovmodel]*cov[nc];
710: /*printf("Int j<i s1=%.17e, s2=%.17e\n",s1,s2);*/
711: }
712: ps[i][j]=s2;
713: /*printf("s1=%.17e, s2=%.17e\n",s1,s2);*/
714: }
715: for(j=i+1; j<=nlstate+ndeath;j++){
716: for (nc=1, s2=0.;nc <=ncovmodel; nc++){
717: s2 += x[(i-1)*nlstate*ncovmodel+(j-2)*ncovmodel+nc+(i-1)*(ndeath-1)*ncovmodel]*cov[nc];
718: /*printf("Int j>i s1=%.17e, s2=%.17e %lx %lx\n",s1,s2,s1,s2);*/
719: }
1.12 lievre 720: ps[i][j]=(s2);
1.2 lievre 721: }
722: }
1.12 lievre 723: /*ps[3][2]=1;*/
724:
1.2 lievre 725: for(i=1; i<= nlstate; i++){
726: s1=0;
727: for(j=1; j<i; j++)
728: s1+=exp(ps[i][j]);
729: for(j=i+1; j<=nlstate+ndeath; j++)
730: s1+=exp(ps[i][j]);
731: ps[i][i]=1./(s1+1.);
732: for(j=1; j<i; j++)
733: ps[i][j]= exp(ps[i][j])*ps[i][i];
734: for(j=i+1; j<=nlstate+ndeath; j++)
735: ps[i][j]= exp(ps[i][j])*ps[i][i];
736: /* ps[i][nlstate+1]=1.-s1- ps[i][i];*/ /* Sum should be 1 */
737: } /* end i */
738:
739: for(ii=nlstate+1; ii<= nlstate+ndeath; ii++){
740: for(jj=1; jj<= nlstate+ndeath; jj++){
741: ps[ii][jj]=0;
742: ps[ii][ii]=1;
743: }
744: }
745:
1.12 lievre 746:
1.2 lievre 747: /* for(ii=1; ii<= nlstate+ndeath; ii++){
748: for(jj=1; jj<= nlstate+ndeath; jj++){
749: printf("%lf ",ps[ii][jj]);
750: }
751: printf("\n ");
752: }
753: printf("\n ");printf("%lf ",cov[2]);*/
754: /*
755: for(i=1; i<= npar; i++) printf("%f ",x[i]);
756: goto end;*/
757: return ps;
758: }
759:
760: /**************** Product of 2 matrices ******************/
761:
762: double **matprod2(double **out, double **in,long nrl, long nrh, long ncl, long nch, long ncolol, long ncoloh, double **b)
763: {
1.13 lievre 764: /* Computes the matrix product of in(1,nrh-nrl+1)(1,nch-ncl+1) times
1.2 lievre 765: b(1,nch-ncl+1)(1,ncoloh-ncolol+1) into out(...) */
766: /* in, b, out are matrice of pointers which should have been initialized
767: before: only the contents of out is modified. The function returns
768: a pointer to pointers identical to out */
769: long i, j, k;
770: for(i=nrl; i<= nrh; i++)
771: for(k=ncolol; k<=ncoloh; k++)
772: for(j=ncl,out[i][k]=0.; j<=nch; j++)
773: out[i][k] +=in[i][j]*b[j][k];
774:
775: return out;
776: }
777:
778:
779: /************* Higher Matrix Product ***************/
780:
781: double ***hpxij(double ***po, int nhstepm, double age, int hstepm, double *x, int nlstate, int stepm, double **oldm, double **savm, int ij )
782: {
783: /* Computes the transition matrix starting at age 'age' over 'nhstepm*hstepm*stepm' month
784: duration (i.e. until
785: age (in years) age+nhstepm*stepm/12) by multiplying nhstepm*hstepm matrices.
786: Output is stored in matrix po[i][j][h] for h every 'hstepm' step
787: (typically every 2 years instead of every month which is too big).
788: Model is determined by parameters x and covariates have to be
789: included manually here.
790:
791: */
792:
793: int i, j, d, h, k;
794: double **out, cov[NCOVMAX];
795: double **newm;
796:
797: /* Hstepm could be zero and should return the unit matrix */
798: for (i=1;i<=nlstate+ndeath;i++)
799: for (j=1;j<=nlstate+ndeath;j++){
800: oldm[i][j]=(i==j ? 1.0 : 0.0);
801: po[i][j][0]=(i==j ? 1.0 : 0.0);
802: }
803: /* Even if hstepm = 1, at least one multiplication by the unit matrix */
804: for(h=1; h <=nhstepm; h++){
805: for(d=1; d <=hstepm; d++){
806: newm=savm;
807: /* Covariates have to be included here again */
808: cov[1]=1.;
809: cov[2]=age+((h-1)*hstepm + (d-1))*stepm/YEARM;
1.7 lievre 810: for (k=1; k<=cptcovn;k++) cov[2+k]=nbcode[Tvar[k]][codtab[ij][Tvar[k]]];
1.12 lievre 811: for (k=1; k<=cptcovage;k++)
1.7 lievre 812: cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2];
1.12 lievre 813: for (k=1; k<=cptcovprod;k++)
1.7 lievre 814: cov[2+Tprod[k]]=nbcode[Tvard[k][1]][codtab[ij][Tvard[k][1]]]*nbcode[Tvard[k][2]][codtab[ij][Tvard[k][2]]];
815:
816:
1.2 lievre 817: /*printf("hxi cptcov=%d cptcode=%d\n",cptcov,cptcode);*/
818: /*printf("h=%d d=%d age=%f cov=%f\n",h,d,age,cov[2]);*/
819: out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath,
820: pmij(pmmij,cov,ncovmodel,x,nlstate));
821: savm=oldm;
822: oldm=newm;
823: }
824: for(i=1; i<=nlstate+ndeath; i++)
825: for(j=1;j<=nlstate+ndeath;j++) {
826: po[i][j][h]=newm[i][j];
827: /*printf("i=%d j=%d h=%d po[i][j][h]=%f ",i,j,h,po[i][j][h]);
828: */
829: }
830: } /* end h */
831: return po;
832: }
833:
834:
835: /*************** log-likelihood *************/
836: double func( double *x)
837: {
1.6 lievre 838: int i, ii, j, k, mi, d, kk;
1.2 lievre 839: double l, ll[NLSTATEMAX], cov[NCOVMAX];
840: double **out;
841: double sw; /* Sum of weights */
842: double lli; /* Individual log likelihood */
843: long ipmx;
844: /*extern weight */
845: /* We are differentiating ll according to initial status */
846: /* for (i=1;i<=npar;i++) printf("%f ", x[i]);*/
847: /*for(i=1;i<imx;i++)
1.8 lievre 848: printf(" %d\n",s[4][i]);
1.2 lievre 849: */
1.6 lievre 850: cov[1]=1.;
1.2 lievre 851:
852: for(k=1; k<=nlstate; k++) ll[k]=0.;
853: for (i=1,ipmx=0, sw=0.; i<=imx; i++){
1.6 lievre 854: for (k=1; k<=cptcovn;k++) cov[2+k]=covar[Tvar[k]][i];
1.8 lievre 855: for(mi=1; mi<= wav[i]-1; mi++){
1.2 lievre 856: for (ii=1;ii<=nlstate+ndeath;ii++)
857: for (j=1;j<=nlstate+ndeath;j++) oldm[ii][j]=(ii==j ? 1.0 : 0.0);
1.8 lievre 858: for(d=0; d<dh[mi][i]; d++){
859: newm=savm;
860: cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM;
861: for (kk=1; kk<=cptcovage;kk++) {
862: cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2];
863: }
864:
865: out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath,
866: 1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate));
867: savm=oldm;
868: oldm=newm;
869:
870:
1.2 lievre 871: } /* end mult */
1.8 lievre 872:
1.2 lievre 873: lli=log(out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]);
874: /* printf(" %f ",out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]);*/
875: ipmx +=1;
876: sw += weight[i];
877: ll[s[mw[mi][i]][i]] += 2*weight[i]*lli;
878: } /* end of wave */
879: } /* end of individual */
880:
881: for(k=1,l=0.; k<=nlstate; k++) l += ll[k];
882: /* printf("l1=%f l2=%f ",ll[1],ll[2]); */
883: l= l*ipmx/sw; /* To get the same order of magnitude as if weight=1 for every body */
884: return -l;
885: }
886:
887:
888: /*********** Maximum Likelihood Estimation ***************/
889:
890: void mlikeli(FILE *ficres,double p[], int npar, int ncovmodel, int nlstate, double ftol, double (*func)(double []))
891: {
892: int i,j, iter;
893: double **xi,*delti;
894: double fret;
895: xi=matrix(1,npar,1,npar);
896: for (i=1;i<=npar;i++)
897: for (j=1;j<=npar;j++)
898: xi[i][j]=(i==j ? 1.0 : 0.0);
899: printf("Powell\n");
900: powell(p,xi,npar,ftol,&iter,&fret,func);
901:
902: printf("\n#Number of iterations = %d, -2 Log likelihood = %.12f\n",iter,func(p));
903: fprintf(ficres,"#Number of iterations = %d, -2 Log likelihood = %.12f ",iter,func(p));
904:
905: }
906:
907: /**** Computes Hessian and covariance matrix ***/
908: void hesscov(double **matcov, double p[], int npar, double delti[], double ftolhess, double (*func)(double []))
909: {
910: double **a,**y,*x,pd;
911: double **hess;
912: int i, j,jk;
913: int *indx;
914:
915: double hessii(double p[], double delta, int theta, double delti[]);
916: double hessij(double p[], double delti[], int i, int j);
917: void lubksb(double **a, int npar, int *indx, double b[]) ;
918: void ludcmp(double **a, int npar, int *indx, double *d) ;
919:
920: hess=matrix(1,npar,1,npar);
921:
922: printf("\nCalculation of the hessian matrix. Wait...\n");
923: for (i=1;i<=npar;i++){
924: printf("%d",i);fflush(stdout);
925: hess[i][i]=hessii(p,ftolhess,i,delti);
926: /*printf(" %f ",p[i]);*/
1.12 lievre 927: /*printf(" %lf ",hess[i][i]);*/
1.2 lievre 928: }
1.12 lievre 929:
1.2 lievre 930: for (i=1;i<=npar;i++) {
931: for (j=1;j<=npar;j++) {
932: if (j>i) {
933: printf(".%d%d",i,j);fflush(stdout);
934: hess[i][j]=hessij(p,delti,i,j);
1.12 lievre 935: hess[j][i]=hess[i][j];
936: /*printf(" %lf ",hess[i][j]);*/
1.2 lievre 937: }
938: }
939: }
940: printf("\n");
941:
942: printf("\nInverting the hessian to get the covariance matrix. Wait...\n");
943:
944: a=matrix(1,npar,1,npar);
945: y=matrix(1,npar,1,npar);
946: x=vector(1,npar);
947: indx=ivector(1,npar);
948: for (i=1;i<=npar;i++)
949: for (j=1;j<=npar;j++) a[i][j]=hess[i][j];
950: ludcmp(a,npar,indx,&pd);
951:
952: for (j=1;j<=npar;j++) {
953: for (i=1;i<=npar;i++) x[i]=0;
954: x[j]=1;
955: lubksb(a,npar,indx,x);
956: for (i=1;i<=npar;i++){
957: matcov[i][j]=x[i];
958: }
959: }
960:
961: printf("\n#Hessian matrix#\n");
962: for (i=1;i<=npar;i++) {
963: for (j=1;j<=npar;j++) {
964: printf("%.3e ",hess[i][j]);
965: }
966: printf("\n");
967: }
968:
969: /* Recompute Inverse */
970: for (i=1;i<=npar;i++)
971: for (j=1;j<=npar;j++) a[i][j]=matcov[i][j];
972: ludcmp(a,npar,indx,&pd);
973:
974: /* printf("\n#Hessian matrix recomputed#\n");
975:
976: for (j=1;j<=npar;j++) {
977: for (i=1;i<=npar;i++) x[i]=0;
978: x[j]=1;
979: lubksb(a,npar,indx,x);
980: for (i=1;i<=npar;i++){
981: y[i][j]=x[i];
982: printf("%.3e ",y[i][j]);
983: }
984: printf("\n");
985: }
986: */
987:
988: free_matrix(a,1,npar,1,npar);
989: free_matrix(y,1,npar,1,npar);
990: free_vector(x,1,npar);
991: free_ivector(indx,1,npar);
992: free_matrix(hess,1,npar,1,npar);
993:
994:
995: }
996:
997: /*************** hessian matrix ****************/
998: double hessii( double x[], double delta, int theta, double delti[])
999: {
1000: int i;
1001: int l=1, lmax=20;
1002: double k1,k2;
1003: double p2[NPARMAX+1];
1004: double res;
1005: double delt, delts, nkhi=10.,nkhif=1., khi=1.e-4;
1006: double fx;
1007: int k=0,kmax=10;
1008: double l1;
1009:
1010: fx=func(x);
1011: for (i=1;i<=npar;i++) p2[i]=x[i];
1012: for(l=0 ; l <=lmax; l++){
1013: l1=pow(10,l);
1014: delts=delt;
1015: for(k=1 ; k <kmax; k=k+1){
1016: delt = delta*(l1*k);
1017: p2[theta]=x[theta] +delt;
1018: k1=func(p2)-fx;
1019: p2[theta]=x[theta]-delt;
1020: k2=func(p2)-fx;
1021: /*res= (k1-2.0*fx+k2)/delt/delt; */
1022: res= (k1+k2)/delt/delt/2.; /* Divided by because L and not 2*L */
1023:
1024: #ifdef DEBUG
1025: printf("%d %d k1=%.12e k2=%.12e xk1=%.12e xk2=%.12e delt=%.12e res=%.12e l=%d k=%d,fx=%.12e\n",theta,theta,k1,k2,x[theta]+delt,x[theta]-delt,delt,res, l, k,fx);
1026: #endif
1027: /*if(fabs(k1-2.0*fx+k2) <1.e-13){ */
1028: if((k1 <khi/nkhi/2.) || (k2 <khi/nkhi/2.)){
1029: k=kmax;
1030: }
1031: else if((k1 >khi/nkhif) || (k2 >khi/nkhif)){ /* Keeps lastvalue before 3.84/2 KHI2 5% 1d.f. */
1032: k=kmax; l=lmax*10.;
1033: }
1034: else if((k1 >khi/nkhi) || (k2 >khi/nkhi)){
1035: delts=delt;
1036: }
1037: }
1038: }
1039: delti[theta]=delts;
1.12 lievre 1040: return res;
1.3 lievre 1041:
1.2 lievre 1042: }
1043:
1044: double hessij( double x[], double delti[], int thetai,int thetaj)
1045: {
1046: int i;
1047: int l=1, l1, lmax=20;
1048: double k1,k2,k3,k4,res,fx;
1049: double p2[NPARMAX+1];
1050: int k;
1051:
1052: fx=func(x);
1053: for (k=1; k<=2; k++) {
1054: for (i=1;i<=npar;i++) p2[i]=x[i];
1055: p2[thetai]=x[thetai]+delti[thetai]/k;
1056: p2[thetaj]=x[thetaj]+delti[thetaj]/k;
1057: k1=func(p2)-fx;
1058:
1059: p2[thetai]=x[thetai]+delti[thetai]/k;
1060: p2[thetaj]=x[thetaj]-delti[thetaj]/k;
1061: k2=func(p2)-fx;
1062:
1063: p2[thetai]=x[thetai]-delti[thetai]/k;
1064: p2[thetaj]=x[thetaj]+delti[thetaj]/k;
1065: k3=func(p2)-fx;
1066:
1067: p2[thetai]=x[thetai]-delti[thetai]/k;
1068: p2[thetaj]=x[thetaj]-delti[thetaj]/k;
1069: k4=func(p2)-fx;
1070: res=(k1-k2-k3+k4)/4.0/delti[thetai]*k/delti[thetaj]*k/2.; /* Because of L not 2*L */
1071: #ifdef DEBUG
1072: printf("%d %d k=%d, k1=%.12e k2=%.12e k3=%.12e k4=%.12e delti/k=%.12e deltj/k=%.12e, xi-de/k=%.12e xj-de/k=%.12e res=%.12e k1234=%.12e,k1-2=%.12e,k3-4=%.12e\n",thetai,thetaj,k,k1,k2,k3,k4,delti[thetai]/k,delti[thetaj]/k,x[thetai]-delti[thetai]/k,x[thetaj]-delti[thetaj]/k, res,k1-k2-k3+k4,k1-k2,k3-k4);
1073: #endif
1074: }
1075: return res;
1076: }
1077:
1078: /************** Inverse of matrix **************/
1079: void ludcmp(double **a, int n, int *indx, double *d)
1080: {
1081: int i,imax,j,k;
1082: double big,dum,sum,temp;
1083: double *vv;
1084:
1085: vv=vector(1,n);
1086: *d=1.0;
1087: for (i=1;i<=n;i++) {
1088: big=0.0;
1089: for (j=1;j<=n;j++)
1090: if ((temp=fabs(a[i][j])) > big) big=temp;
1091: if (big == 0.0) nrerror("Singular matrix in routine ludcmp");
1092: vv[i]=1.0/big;
1093: }
1094: for (j=1;j<=n;j++) {
1095: for (i=1;i<j;i++) {
1096: sum=a[i][j];
1097: for (k=1;k<i;k++) sum -= a[i][k]*a[k][j];
1098: a[i][j]=sum;
1099: }
1100: big=0.0;
1101: for (i=j;i<=n;i++) {
1102: sum=a[i][j];
1103: for (k=1;k<j;k++)
1104: sum -= a[i][k]*a[k][j];
1105: a[i][j]=sum;
1106: if ( (dum=vv[i]*fabs(sum)) >= big) {
1107: big=dum;
1108: imax=i;
1109: }
1110: }
1111: if (j != imax) {
1112: for (k=1;k<=n;k++) {
1113: dum=a[imax][k];
1114: a[imax][k]=a[j][k];
1115: a[j][k]=dum;
1116: }
1117: *d = -(*d);
1118: vv[imax]=vv[j];
1119: }
1120: indx[j]=imax;
1121: if (a[j][j] == 0.0) a[j][j]=TINY;
1122: if (j != n) {
1123: dum=1.0/(a[j][j]);
1124: for (i=j+1;i<=n;i++) a[i][j] *= dum;
1125: }
1126: }
1127: free_vector(vv,1,n); /* Doesn't work */
1128: ;
1129: }
1130:
1131: void lubksb(double **a, int n, int *indx, double b[])
1132: {
1133: int i,ii=0,ip,j;
1134: double sum;
1135:
1136: for (i=1;i<=n;i++) {
1137: ip=indx[i];
1138: sum=b[ip];
1139: b[ip]=b[i];
1140: if (ii)
1141: for (j=ii;j<=i-1;j++) sum -= a[i][j]*b[j];
1142: else if (sum) ii=i;
1143: b[i]=sum;
1144: }
1145: for (i=n;i>=1;i--) {
1146: sum=b[i];
1147: for (j=i+1;j<=n;j++) sum -= a[i][j]*b[j];
1148: b[i]=sum/a[i][i];
1149: }
1150: }
1151:
1152: /************ Frequencies ********************/
1.15 lievre 1153: void freqsummary(char fileres[], int agemin, int agemax, int **s, double **agev, int nlstate, int imx, int *Tvar, int **nbcode, int *ncodemax, int fprev1,int lprev1)
1.2 lievre 1154: { /* Some frequencies */
1155:
1156: int i, m, jk, k1, i1, j1, bool, z1,z2,j;
1157: double ***freq; /* Frequencies */
1158: double *pp;
1159: double pos;
1160: FILE *ficresp;
1161: char fileresp[FILENAMELENGTH];
1162:
1163: pp=vector(1,nlstate);
1.13 lievre 1164: probs= ma3x(1,130 ,1,8, 1,8);
1.2 lievre 1165: strcpy(fileresp,"p");
1166: strcat(fileresp,fileres);
1167: if((ficresp=fopen(fileresp,"w"))==NULL) {
1168: printf("Problem with prevalence resultfile: %s\n", fileresp);
1169: exit(0);
1170: }
1171: freq= ma3x(-1,nlstate+ndeath,-1,nlstate+ndeath,agemin,agemax+3);
1172: j1=0;
1173:
1.7 lievre 1174: j=cptcoveff;
1.2 lievre 1175: if (cptcovn<1) {j=1;ncodemax[1]=1;}
1176:
1177: for(k1=1; k1<=j;k1++){
1178: for(i1=1; i1<=ncodemax[k1];i1++){
1179: j1++;
1.8 lievre 1180: /*printf("cptcoveff=%d Tvaraff=%d", cptcoveff,Tvaraff[1]);
1181: scanf("%d", i);*/
1.2 lievre 1182: for (i=-1; i<=nlstate+ndeath; i++)
1183: for (jk=-1; jk<=nlstate+ndeath; jk++)
1184: for(m=agemin; m <= agemax+3; m++)
1185: freq[i][jk][m]=0;
1186:
1187: for (i=1; i<=imx; i++) {
1188: bool=1;
1189: if (cptcovn>0) {
1.7 lievre 1190: for (z1=1; z1<=cptcoveff; z1++)
1.8 lievre 1191: if (covar[Tvaraff[z1]][i]!= nbcode[Tvaraff[z1]][codtab[j1][z1]])
1192: bool=0;
1.2 lievre 1193: }
1194: if (bool==1) {
1.15 lievre 1195: for(m=fprev1; m<=lprev1; m++){
1.2 lievre 1196: if(agev[m][i]==0) agev[m][i]=agemax+1;
1197: if(agev[m][i]==1) agev[m][i]=agemax+2;
1198: freq[s[m][i]][s[m+1][i]][(int)agev[m][i]] += weight[i];
1199: freq[s[m][i]][s[m+1][i]][(int) agemax+3] += weight[i];
1200: }
1201: }
1202: }
1203: if (cptcovn>0) {
1.7 lievre 1204: fprintf(ficresp, "\n#********** Variable ");
1205: for (z1=1; z1<=cptcoveff; z1++) fprintf(ficresp, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtab[j1][z1]]);
1206: fprintf(ficresp, "**********\n#");
1.8 lievre 1207: }
1.2 lievre 1208: for(i=1; i<=nlstate;i++)
1209: fprintf(ficresp, " Age Prev(%d) N(%d) N",i,i);
1210: fprintf(ficresp, "\n");
1211:
1212: for(i=(int)agemin; i <= (int)agemax+3; i++){
1213: if(i==(int)agemax+3)
1214: printf("Total");
1215: else
1216: printf("Age %d", i);
1217: for(jk=1; jk <=nlstate ; jk++){
1218: for(m=-1, pp[jk]=0; m <=nlstate+ndeath ; m++)
1.14 lievre 1219: pp[jk] += freq[jk][m][i];
1.2 lievre 1220: }
1221: for(jk=1; jk <=nlstate ; jk++){
1222: for(m=-1, pos=0; m <=0 ; m++)
1223: pos += freq[jk][m][i];
1224: if(pp[jk]>=1.e-10)
1225: printf(" %d.=%.0f loss[%d]=%.1f%%",jk,pp[jk],jk,100*pos/pp[jk]);
1226: else
1227: printf(" %d.=%.0f loss[%d]=NaNQ%%",jk,pp[jk],jk);
1228: }
1.14 lievre 1229:
1230: for(jk=1; jk <=nlstate ; jk++){
1231: for(m=0, pp[jk]=0; m <=nlstate+ndeath; m++)
1.2 lievre 1232: pp[jk] += freq[jk][m][i];
1.14 lievre 1233: }
1234:
1.2 lievre 1235: for(jk=1,pos=0; jk <=nlstate ; jk++)
1236: pos += pp[jk];
1237: for(jk=1; jk <=nlstate ; jk++){
1238: if(pos>=1.e-5)
1239: printf(" %d.=%.0f prev[%d]=%.1f%%",jk,pp[jk],jk,100*pp[jk]/pos);
1240: else
1241: printf(" %d.=%.0f prev[%d]=NaNQ%%",jk,pp[jk],jk);
1242: if( i <= (int) agemax){
1.13 lievre 1243: if(pos>=1.e-5){
1.2 lievre 1244: fprintf(ficresp," %d %.5f %.0f %.0f",i,pp[jk]/pos, pp[jk],pos);
1.13 lievre 1245: probs[i][jk][j1]= pp[jk]/pos;
1246: /*printf("\ni=%d jk=%d j1=%d %.5f %.0f %.0f %f",i,jk,j1,pp[jk]/pos, pp[jk],pos,probs[i][jk][j1]);*/
1247: }
1.2 lievre 1248: else
1249: fprintf(ficresp," %d NaNq %.0f %.0f",i,pp[jk],pos);
1250: }
1251: }
1252: for(jk=-1; jk <=nlstate+ndeath; jk++)
1253: for(m=-1; m <=nlstate+ndeath; m++)
1254: if(freq[jk][m][i] !=0 ) printf(" %d%d=%.0f",jk,m,freq[jk][m][i]);
1255: if(i <= (int) agemax)
1256: fprintf(ficresp,"\n");
1257: printf("\n");
1258: }
1259: }
1260: }
1261:
1262: fclose(ficresp);
1263: free_ma3x(freq,-1,nlstate+ndeath,-1,nlstate+ndeath,(int) agemin,(int) agemax+3);
1264: free_vector(pp,1,nlstate);
1265:
1266: } /* End of Freq */
1267:
1.15 lievre 1268: /************ Prevalence ********************/
1269: void prevalence(int agemin, int agemax, int **s, double **agev, int nlstate, int imx, int *Tvar, int **nbcode, int *ncodemax, int fprev1,int lprev1)
1270: { /* Some frequencies */
1271:
1272: int i, m, jk, k1, i1, j1, bool, z1,z2,j;
1273: double ***freq; /* Frequencies */
1274: double *pp;
1275: double pos;
1276:
1277: pp=vector(1,nlstate);
1278: probs= ma3x(1,130 ,1,8, 1,8);
1279:
1280: freq=ma3x(-1,nlstate+ndeath,-1,nlstate+ndeath,agemin,agemax+3);
1281: j1=0;
1282:
1283: j=cptcoveff;
1284: if (cptcovn<1) {j=1;ncodemax[1]=1;}
1285:
1286: for(k1=1; k1<=j;k1++){
1287: for(i1=1; i1<=ncodemax[k1];i1++){
1288: j1++;
1289:
1290: for (i=-1; i<=nlstate+ndeath; i++)
1291: for (jk=-1; jk<=nlstate+ndeath; jk++)
1292: for(m=agemin; m <= agemax+3; m++)
1293: freq[i][jk][m]=0;
1294:
1295: for (i=1; i<=imx; i++) {
1296: bool=1;
1297: if (cptcovn>0) {
1298: for (z1=1; z1<=cptcoveff; z1++)
1299: if (covar[Tvaraff[z1]][i]!= nbcode[Tvaraff[z1]][codtab[j1][z1]])
1300: bool=0;
1301: }
1302: if (bool==1) {
1303: for(m=fprev1; m<=lprev1; m++){
1304: if(agev[m][i]==0) agev[m][i]=agemax+1;
1305: if(agev[m][i]==1) agev[m][i]=agemax+2;
1306: freq[s[m][i]][s[m+1][i]][(int)agev[m][i]] += weight[i];
1307: freq[s[m][i]][s[m+1][i]][(int) agemax+3] += weight[i];
1308: }
1309: }
1310: }
1311: for(i=(int)agemin; i <= (int)agemax+3; i++){
1312: for(jk=1; jk <=nlstate ; jk++){
1313: for(m=-1, pp[jk]=0; m <=nlstate+ndeath ; m++)
1314: pp[jk] += freq[jk][m][i];
1315: }
1316: for(jk=1; jk <=nlstate ; jk++){
1317: for(m=-1, pos=0; m <=0 ; m++)
1318: pos += freq[jk][m][i];
1319: }
1320:
1321: for(jk=1; jk <=nlstate ; jk++){
1322: for(m=0, pp[jk]=0; m <=nlstate+ndeath; m++)
1323: pp[jk] += freq[jk][m][i];
1324: }
1325:
1326: for(jk=1,pos=0; jk <=nlstate ; jk++) pos += pp[jk];
1327:
1328: for(jk=1; jk <=nlstate ; jk++){
1329: if( i <= (int) agemax){
1330: if(pos>=1.e-5){
1331: probs[i][jk][j1]= pp[jk]/pos;
1332: }
1333: }
1334: }
1335:
1336: }
1337: }
1338: }
1339:
1340:
1341: free_ma3x(freq,-1,nlstate+ndeath,-1,nlstate+ndeath,(int) agemin,(int) agemax+3);
1342: free_vector(pp,1,nlstate);
1343:
1344: } /* End of Freq */
1.2 lievre 1345: /************* Waves Concatenation ***************/
1346:
1347: void concatwav(int wav[], int **dh, int **mw, int **s, double *agedc, double **agev, int firstpass, int lastpass, int imx, int nlstate, int stepm)
1348: {
1349: /* Concatenates waves: wav[i] is the number of effective (useful waves) of individual i.
1350: Death is a valid wave (if date is known).
1351: mw[mi][i] is the mi (mi=1 to wav[i]) effective wave of individual i
1352: dh[m][i] of dh[mw[mi][i][i] is the delay between two effective waves m=mw[mi][i]
1353: and mw[mi+1][i]. dh depends on stepm.
1354: */
1355:
1356: int i, mi, m;
1.8 lievre 1357: /* int j, k=0,jk, ju, jl,jmin=1e+5, jmax=-1;
1358: double sum=0., jmean=0.;*/
1.2 lievre 1359:
1.11 lievre 1360: int j, k=0,jk, ju, jl;
1361: double sum=0.;
1362: jmin=1e+5;
1363: jmax=-1;
1364: jmean=0.;
1.2 lievre 1365: for(i=1; i<=imx; i++){
1366: mi=0;
1367: m=firstpass;
1368: while(s[m][i] <= nlstate){
1369: if(s[m][i]>=1)
1370: mw[++mi][i]=m;
1371: if(m >=lastpass)
1372: break;
1373: else
1374: m++;
1375: }/* end while */
1376: if (s[m][i] > nlstate){
1377: mi++; /* Death is another wave */
1378: /* if(mi==0) never been interviewed correctly before death */
1379: /* Only death is a correct wave */
1380: mw[mi][i]=m;
1381: }
1382:
1383: wav[i]=mi;
1384: if(mi==0)
1385: printf("Warning, no any valid information for:%d line=%d\n",num[i],i);
1386: }
1387:
1388: for(i=1; i<=imx; i++){
1389: for(mi=1; mi<wav[i];mi++){
1390: if (stepm <=0)
1391: dh[mi][i]=1;
1392: else{
1393: if (s[mw[mi+1][i]][i] > nlstate) {
1.10 lievre 1394: if (agedc[i] < 2*AGESUP) {
1.2 lievre 1395: j= rint(agedc[i]*12-agev[mw[mi][i]][i]*12);
1.8 lievre 1396: if(j==0) j=1; /* Survives at least one month after exam */
1397: k=k+1;
1398: if (j >= jmax) jmax=j;
1.11 lievre 1399: if (j <= jmin) jmin=j;
1.8 lievre 1400: sum=sum+j;
1.12 lievre 1401: /* if (j<10) printf("j=%d num=%d ",j,i); */
1.10 lievre 1402: }
1.2 lievre 1403: }
1404: else{
1405: j= rint( (agev[mw[mi+1][i]][i]*12 - agev[mw[mi][i]][i]*12));
1406: k=k+1;
1407: if (j >= jmax) jmax=j;
1408: else if (j <= jmin)jmin=j;
1.12 lievre 1409: /* if (j<10) printf("j=%d jmin=%d num=%d ",j,jmin,i); */
1.2 lievre 1410: sum=sum+j;
1411: }
1412: jk= j/stepm;
1413: jl= j -jk*stepm;
1414: ju= j -(jk+1)*stepm;
1415: if(jl <= -ju)
1416: dh[mi][i]=jk;
1417: else
1418: dh[mi][i]=jk+1;
1419: if(dh[mi][i]==0)
1420: dh[mi][i]=1; /* At least one step */
1421: }
1422: }
1423: }
1.8 lievre 1424: jmean=sum/k;
1425: printf("Delay (in months) between two waves Min=%d Max=%d Mean=%f\n\n ",jmin, jmax,jmean);
1.12 lievre 1426: }
1.2 lievre 1427: /*********** Tricode ****************************/
1428: void tricode(int *Tvar, int **nbcode, int imx)
1429: {
1.7 lievre 1430: int Ndum[20],ij=1, k, j, i;
1.2 lievre 1431: int cptcode=0;
1.7 lievre 1432: cptcoveff=0;
1433:
1434: for (k=0; k<19; k++) Ndum[k]=0;
1.2 lievre 1435: for (k=1; k<=7; k++) ncodemax[k]=0;
1.6 lievre 1436:
1.7 lievre 1437: for (j=1; j<=(cptcovn+2*cptcovprod); j++) {
1.2 lievre 1438: for (i=1; i<=imx; i++) {
1439: ij=(int)(covar[Tvar[j]][i]);
1440: Ndum[ij]++;
1.8 lievre 1441: /*printf("i=%d ij=%d Ndum[ij]=%d imx=%d",i,ij,Ndum[ij],imx);*/
1.2 lievre 1442: if (ij > cptcode) cptcode=ij;
1443: }
1.7 lievre 1444:
1.2 lievre 1445: for (i=0; i<=cptcode; i++) {
1446: if(Ndum[i]!=0) ncodemax[j]++;
1447: }
1448: ij=1;
1.7 lievre 1449:
1.8 lievre 1450:
1.2 lievre 1451: for (i=1; i<=ncodemax[j]; i++) {
1.7 lievre 1452: for (k=0; k<=19; k++) {
1.2 lievre 1453: if (Ndum[k] != 0) {
1454: nbcode[Tvar[j]][ij]=k;
1455: ij++;
1456: }
1457: if (ij > ncodemax[j]) break;
1458: }
1459: }
1.7 lievre 1460: }
1.8 lievre 1461:
1462: for (k=0; k<19; k++) Ndum[k]=0;
1463:
1.12 lievre 1464: for (i=1; i<=ncovmodel-2; i++) {
1.7 lievre 1465: ij=Tvar[i];
1466: Ndum[ij]++;
1467: }
1.8 lievre 1468:
1.7 lievre 1469: ij=1;
1.8 lievre 1470: for (i=1; i<=10; i++) {
1.7 lievre 1471: if((Ndum[i]!=0) && (i<=ncov)){
1.8 lievre 1472: Tvaraff[ij]=i;
1473: ij++;
1.7 lievre 1474: }
1475: }
1476:
1.8 lievre 1477: cptcoveff=ij-1;
1.6 lievre 1478: }
1.2 lievre 1479:
1480: /*********** Health Expectancies ****************/
1481:
1482: void evsij(char fileres[], double ***eij, double x[], int nlstate, int stepm, int bage, int fage, double **oldm, double **savm, int ij)
1483: {
1484: /* Health expectancies */
1485: int i, j, nhstepm, hstepm, h;
1486: double age, agelim,hf;
1487: double ***p3mat;
1488:
1489: fprintf(ficreseij,"# Health expectancies\n");
1490: fprintf(ficreseij,"# Age");
1491: for(i=1; i<=nlstate;i++)
1492: for(j=1; j<=nlstate;j++)
1493: fprintf(ficreseij," %1d-%1d",i,j);
1494: fprintf(ficreseij,"\n");
1495:
1496: hstepm=1*YEARM; /* Every j years of age (in month) */
1497: hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */
1498:
1499: agelim=AGESUP;
1500: for (age=bage; age<=fage; age ++){ /* If stepm=6 months */
1501: /* nhstepm age range expressed in number of stepm */
1502: nhstepm=(int) rint((agelim-age)*YEARM/stepm);
1503: /* Typically if 20 years = 20*12/6=40 stepm */
1504: if (stepm >= YEARM) hstepm=1;
1505: nhstepm = nhstepm/hstepm;/* Expressed in hstepm, typically 40/4=10 */
1506: p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
1507: /* Computed by stepm unit matrices, product of hstepm matrices, stored
1508: in an array of nhstepm length: nhstepm=10, hstepm=4, stepm=6 months */
1509: hpxij(p3mat,nhstepm,age,hstepm,x,nlstate,stepm,oldm, savm, ij);
1510:
1511:
1512: for(i=1; i<=nlstate;i++)
1513: for(j=1; j<=nlstate;j++)
1514: for (h=0, eij[i][j][(int)age]=0; h<=nhstepm; h++){
1515: eij[i][j][(int)age] +=p3mat[i][j][h];
1516: }
1517:
1518: hf=1;
1519: if (stepm >= YEARM) hf=stepm/YEARM;
1520: fprintf(ficreseij,"%.0f",age );
1521: for(i=1; i<=nlstate;i++)
1522: for(j=1; j<=nlstate;j++){
1523: fprintf(ficreseij," %.4f", hf*eij[i][j][(int)age]);
1524: }
1525: fprintf(ficreseij,"\n");
1526: free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
1527: }
1528: }
1529:
1530: /************ Variance ******************/
1531: void varevsij(char fileres[], double ***vareij, double **matcov, double x[], double delti[], int nlstate, int stepm, double bage, double fage, double **oldm, double **savm, double **prlim, double ftolpl, int ij)
1532: {
1533: /* Variance of health expectancies */
1534: /* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double ** savm,double ftolpl);*/
1535: double **newm;
1536: double **dnewm,**doldm;
1537: int i, j, nhstepm, hstepm, h;
1538: int k, cptcode;
1.12 lievre 1539: double *xp;
1.2 lievre 1540: double **gp, **gm;
1541: double ***gradg, ***trgradg;
1542: double ***p3mat;
1543: double age,agelim;
1544: int theta;
1545:
1546: fprintf(ficresvij,"# Covariances of life expectancies\n");
1547: fprintf(ficresvij,"# Age");
1548: for(i=1; i<=nlstate;i++)
1549: for(j=1; j<=nlstate;j++)
1550: fprintf(ficresvij," Cov(e%1d, e%1d)",i,j);
1551: fprintf(ficresvij,"\n");
1552:
1553: xp=vector(1,npar);
1554: dnewm=matrix(1,nlstate,1,npar);
1555: doldm=matrix(1,nlstate,1,nlstate);
1556:
1557: hstepm=1*YEARM; /* Every year of age */
1558: hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */
1559: agelim = AGESUP;
1560: for (age=bage; age<=fage; age ++){ /* If stepm=6 months */
1561: nhstepm=(int) rint((agelim-age)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */
1562: if (stepm >= YEARM) hstepm=1;
1563: nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */
1564: p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
1565: gradg=ma3x(0,nhstepm,1,npar,1,nlstate);
1566: gp=matrix(0,nhstepm,1,nlstate);
1567: gm=matrix(0,nhstepm,1,nlstate);
1568:
1569: for(theta=1; theta <=npar; theta++){
1570: for(i=1; i<=npar; i++){ /* Computes gradient */
1571: xp[i] = x[i] + (i==theta ?delti[theta]:0);
1572: }
1573: hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij);
1574: prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij);
1.14 lievre 1575:
1576: if (popbased==1) {
1577: for(i=1; i<=nlstate;i++)
1578: prlim[i][i]=probs[(int)age][i][ij];
1579: }
1580:
1.2 lievre 1581: for(j=1; j<= nlstate; j++){
1582: for(h=0; h<=nhstepm; h++){
1583: for(i=1, gp[h][j]=0.;i<=nlstate;i++)
1584: gp[h][j] += prlim[i][i]*p3mat[i][j][h];
1585: }
1586: }
1587:
1588: for(i=1; i<=npar; i++) /* Computes gradient */
1589: xp[i] = x[i] - (i==theta ?delti[theta]:0);
1590: hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij);
1591: prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij);
1.14 lievre 1592:
1593: if (popbased==1) {
1594: for(i=1; i<=nlstate;i++)
1595: prlim[i][i]=probs[(int)age][i][ij];
1596: }
1597:
1.2 lievre 1598: for(j=1; j<= nlstate; j++){
1599: for(h=0; h<=nhstepm; h++){
1600: for(i=1, gm[h][j]=0.;i<=nlstate;i++)
1601: gm[h][j] += prlim[i][i]*p3mat[i][j][h];
1602: }
1603: }
1.14 lievre 1604:
1.2 lievre 1605: for(j=1; j<= nlstate; j++)
1606: for(h=0; h<=nhstepm; h++){
1607: gradg[h][theta][j]= (gp[h][j]-gm[h][j])/2./delti[theta];
1608: }
1609: } /* End theta */
1610:
1611: trgradg =ma3x(0,nhstepm,1,nlstate,1,npar);
1612:
1613: for(h=0; h<=nhstepm; h++)
1614: for(j=1; j<=nlstate;j++)
1615: for(theta=1; theta <=npar; theta++)
1616: trgradg[h][j][theta]=gradg[h][theta][j];
1617:
1618: for(i=1;i<=nlstate;i++)
1619: for(j=1;j<=nlstate;j++)
1620: vareij[i][j][(int)age] =0.;
1621: for(h=0;h<=nhstepm;h++){
1622: for(k=0;k<=nhstepm;k++){
1623: matprod2(dnewm,trgradg[h],1,nlstate,1,npar,1,npar,matcov);
1624: matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg[k]);
1625: for(i=1;i<=nlstate;i++)
1626: for(j=1;j<=nlstate;j++)
1627: vareij[i][j][(int)age] += doldm[i][j];
1628: }
1629: }
1630: h=1;
1631: if (stepm >= YEARM) h=stepm/YEARM;
1632: fprintf(ficresvij,"%.0f ",age );
1633: for(i=1; i<=nlstate;i++)
1634: for(j=1; j<=nlstate;j++){
1635: fprintf(ficresvij," %.4f", h*vareij[i][j][(int)age]);
1636: }
1637: fprintf(ficresvij,"\n");
1638: free_matrix(gp,0,nhstepm,1,nlstate);
1639: free_matrix(gm,0,nhstepm,1,nlstate);
1640: free_ma3x(gradg,0,nhstepm,1,npar,1,nlstate);
1641: free_ma3x(trgradg,0,nhstepm,1,nlstate,1,npar);
1642: free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
1643: } /* End age */
1644:
1645: free_vector(xp,1,npar);
1646: free_matrix(doldm,1,nlstate,1,npar);
1647: free_matrix(dnewm,1,nlstate,1,nlstate);
1648:
1649: }
1650:
1651: /************ Variance of prevlim ******************/
1652: void varprevlim(char fileres[], double **varpl, double **matcov, double x[], double delti[], int nlstate, int stepm, double bage, double fage, double **oldm, double **savm, double **prlim, double ftolpl, int ij)
1653: {
1654: /* Variance of prevalence limit */
1655: /* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double ** savm,double ftolpl);*/
1656: double **newm;
1657: double **dnewm,**doldm;
1658: int i, j, nhstepm, hstepm;
1659: int k, cptcode;
1660: double *xp;
1661: double *gp, *gm;
1662: double **gradg, **trgradg;
1663: double age,agelim;
1664: int theta;
1665:
1666: fprintf(ficresvpl,"# Standard deviation of prevalences limit\n");
1667: fprintf(ficresvpl,"# Age");
1668: for(i=1; i<=nlstate;i++)
1669: fprintf(ficresvpl," %1d-%1d",i,i);
1670: fprintf(ficresvpl,"\n");
1671:
1672: xp=vector(1,npar);
1673: dnewm=matrix(1,nlstate,1,npar);
1674: doldm=matrix(1,nlstate,1,nlstate);
1675:
1676: hstepm=1*YEARM; /* Every year of age */
1677: hstepm=hstepm/stepm; /* Typically in stepm units, if j= 2 years, = 2/6 months = 4 */
1678: agelim = AGESUP;
1679: for (age=bage; age<=fage; age ++){ /* If stepm=6 months */
1680: nhstepm=(int) rint((agelim-age)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */
1681: if (stepm >= YEARM) hstepm=1;
1682: nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */
1683: gradg=matrix(1,npar,1,nlstate);
1684: gp=vector(1,nlstate);
1685: gm=vector(1,nlstate);
1686:
1687: for(theta=1; theta <=npar; theta++){
1688: for(i=1; i<=npar; i++){ /* Computes gradient */
1689: xp[i] = x[i] + (i==theta ?delti[theta]:0);
1690: }
1691: prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij);
1692: for(i=1;i<=nlstate;i++)
1693: gp[i] = prlim[i][i];
1694:
1695: for(i=1; i<=npar; i++) /* Computes gradient */
1696: xp[i] = x[i] - (i==theta ?delti[theta]:0);
1697: prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij);
1698: for(i=1;i<=nlstate;i++)
1699: gm[i] = prlim[i][i];
1700:
1701: for(i=1;i<=nlstate;i++)
1702: gradg[theta][i]= (gp[i]-gm[i])/2./delti[theta];
1703: } /* End theta */
1704:
1705: trgradg =matrix(1,nlstate,1,npar);
1706:
1707: for(j=1; j<=nlstate;j++)
1708: for(theta=1; theta <=npar; theta++)
1709: trgradg[j][theta]=gradg[theta][j];
1710:
1711: for(i=1;i<=nlstate;i++)
1712: varpl[i][(int)age] =0.;
1713: matprod2(dnewm,trgradg,1,nlstate,1,npar,1,npar,matcov);
1714: matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg);
1715: for(i=1;i<=nlstate;i++)
1716: varpl[i][(int)age] = doldm[i][i]; /* Covariances are useless */
1717:
1718: fprintf(ficresvpl,"%.0f ",age );
1719: for(i=1; i<=nlstate;i++)
1720: fprintf(ficresvpl," %.5f (%.5f)",prlim[i][i],sqrt(varpl[i][(int)age]));
1721: fprintf(ficresvpl,"\n");
1722: free_vector(gp,1,nlstate);
1723: free_vector(gm,1,nlstate);
1724: free_matrix(gradg,1,npar,1,nlstate);
1725: free_matrix(trgradg,1,nlstate,1,npar);
1726: } /* End age */
1727:
1728: free_vector(xp,1,npar);
1729: free_matrix(doldm,1,nlstate,1,npar);
1730: free_matrix(dnewm,1,nlstate,1,nlstate);
1731:
1732: }
1733:
1.13 lievre 1734: /************ Variance of one-step probabilities ******************/
1735: void varprob(char fileres[], double **matcov, double x[], double delti[], int nlstate, double bage, double fage, int ij)
1736: {
1737: int i, j;
1738: int k=0, cptcode;
1739: double **dnewm,**doldm;
1740: double *xp;
1741: double *gp, *gm;
1742: double **gradg, **trgradg;
1743: double age,agelim, cov[NCOVMAX];
1744: int theta;
1745: char fileresprob[FILENAMELENGTH];
1746:
1747: strcpy(fileresprob,"prob");
1748: strcat(fileresprob,fileres);
1749: if((ficresprob=fopen(fileresprob,"w"))==NULL) {
1750: printf("Problem with resultfile: %s\n", fileresprob);
1751: }
1752: printf("Computing variance of one-step probabilities: result on file '%s' \n",fileresprob);
1753:
1.2 lievre 1754:
1.13 lievre 1755: xp=vector(1,npar);
1756: dnewm=matrix(1,(nlstate+ndeath)*(nlstate+ndeath),1,npar);
1757: doldm=matrix(1,(nlstate+ndeath)*(nlstate+ndeath),1,(nlstate+ndeath)*(nlstate+ndeath));
1758:
1759: cov[1]=1;
1760: for (age=bage; age<=fage; age ++){
1761: cov[2]=age;
1762: gradg=matrix(1,npar,1,9);
1763: trgradg=matrix(1,9,1,npar);
1764: gp=vector(1,(nlstate+ndeath)*(nlstate+ndeath));
1765: gm=vector(1,(nlstate+ndeath)*(nlstate+ndeath));
1766:
1767: for(theta=1; theta <=npar; theta++){
1768: for(i=1; i<=npar; i++)
1769: xp[i] = x[i] + (i==theta ?delti[theta]:0);
1770:
1771: pmij(pmmij,cov,ncovmodel,xp,nlstate);
1772:
1773: k=0;
1774: for(i=1; i<= (nlstate+ndeath); i++){
1775: for(j=1; j<=(nlstate+ndeath);j++){
1776: k=k+1;
1777: gp[k]=pmmij[i][j];
1778: }
1779: }
1780:
1781: for(i=1; i<=npar; i++)
1782: xp[i] = x[i] - (i==theta ?delti[theta]:0);
1783:
1784:
1785: pmij(pmmij,cov,ncovmodel,xp,nlstate);
1786: k=0;
1787: for(i=1; i<=(nlstate+ndeath); i++){
1788: for(j=1; j<=(nlstate+ndeath);j++){
1789: k=k+1;
1790: gm[k]=pmmij[i][j];
1791: }
1792: }
1793:
1794: for(i=1; i<= (nlstate+ndeath)*(nlstate+ndeath); i++)
1795: gradg[theta][i]=(gp[i]-gm[i])/2./delti[theta];
1796: }
1797:
1798: for(j=1; j<=(nlstate+ndeath)*(nlstate+ndeath);j++)
1799: for(theta=1; theta <=npar; theta++)
1800: trgradg[j][theta]=gradg[theta][j];
1801:
1802: matprod2(dnewm,trgradg,1,9,1,npar,1,npar,matcov);
1803: matprod2(doldm,dnewm,1,9,1,npar,1,9,gradg);
1804:
1805: pmij(pmmij,cov,ncovmodel,x,nlstate);
1806:
1807: k=0;
1808: for(i=1; i<=(nlstate+ndeath); i++){
1809: for(j=1; j<=(nlstate+ndeath);j++){
1810: k=k+1;
1811: gm[k]=pmmij[i][j];
1812: }
1813: }
1814:
1815: /*printf("\n%d ",(int)age);
1816: for (i=1; i<=(nlstate+ndeath)*(nlstate+ndeath-1);i++){
1817:
1818:
1819: printf("%e [%e ;%e] ",gm[i],gm[i]-2*sqrt(doldm[i][i]),gm[i]+2*sqrt(doldm[i][i]));
1820: }*/
1821:
1822: fprintf(ficresprob,"\n%d ",(int)age);
1823:
1824: for (i=1; i<=(nlstate+ndeath)*(nlstate+ndeath-1);i++){
1825: if (i== 2) fprintf(ficresprob,"%.3e %.3e ",gm[i],doldm[i][i]);
1826: if (i== 4) fprintf(ficresprob,"%.3e %.3e ",gm[i],doldm[i][i]);
1827: }
1828:
1829: free_vector(gp,1,(nlstate+ndeath)*(nlstate+ndeath));
1830: free_vector(gm,1,(nlstate+ndeath)*(nlstate+ndeath));
1831: free_matrix(trgradg,1,(nlstate+ndeath)*(nlstate+ndeath),1,npar);
1832: free_matrix(gradg,1,(nlstate+ndeath)*(nlstate+ndeath),1,npar);
1833: }
1834: free_vector(xp,1,npar);
1835: fclose(ficresprob);
1836: exit(0);
1837: }
1.2 lievre 1838:
1839: /***********************************************/
1840: /**************** Main Program *****************/
1841: /***********************************************/
1842:
1843: /*int main(int argc, char *argv[])*/
1844: int main()
1845: {
1846:
1.8 lievre 1847: int i,j, k, n=MAXN,iter,m,size,cptcode, cptcod;
1.2 lievre 1848: double agedeb, agefin,hf;
1849: double agemin=1.e20, agemax=-1.e20;
1850:
1851: double fret;
1852: double **xi,tmp,delta;
1853:
1854: double dum; /* Dummy variable */
1855: double ***p3mat;
1856: int *indx;
1857: char line[MAXLINE], linepar[MAXLINE];
1858: char title[MAXLINE];
1.9 lievre 1859: char optionfile[FILENAMELENGTH], datafile[FILENAMELENGTH], filerespl[FILENAMELENGTH], optionfilehtm[FILENAMELENGTH];
1.13 lievre 1860: char fileres[FILENAMELENGTH], filerespij[FILENAMELENGTH], filereso[FILENAMELENGTH], fileresf[FILENAMELENGTH];
1.2 lievre 1861: char filerest[FILENAMELENGTH];
1862: char fileregp[FILENAMELENGTH];
1.16 ! lievre 1863: char popfile[FILENAMELENGTH];
1.2 lievre 1864: char path[80],pathc[80],pathcd[80],pathtot[80],model[20];
1865: int firstobs=1, lastobs=10;
1866: int sdeb, sfin; /* Status at beginning and end */
1867: int c, h , cpt,l;
1868: int ju,jl, mi;
1.7 lievre 1869: int i1,j1, k1,k2,k3,jk,aa,bb, stepsize, ij;
1.14 lievre 1870: int jnais,jdc,jint4,jint1,jint2,jint3,**outcome,**adl,*tab;
1.16 ! lievre 1871: int mobilav=0, fprev, lprev ,fprevfore=1, lprevfore=1,nforecast,popforecast=0;
1.2 lievre 1872: int hstepm, nhstepm;
1.16 ! lievre 1873: int *popage;
1.14 lievre 1874:
1.2 lievre 1875: double bage, fage, age, agelim, agebase;
1876: double ftolpl=FTOL;
1877: double **prlim;
1878: double *severity;
1879: double ***param; /* Matrix of parameters */
1880: double *p;
1881: double **matcov; /* Matrix of covariance */
1882: double ***delti3; /* Scale */
1883: double *delti; /* Scale */
1884: double ***eij, ***vareij;
1885: double **varpl; /* Variances of prevalence limits by age */
1886: double *epj, vepp;
1.16 ! lievre 1887: double kk1, kk2;
! 1888: double *popeffectif,*popcount;
1.13 lievre 1889:
1.10 lievre 1890: char version[80]="Imach version 64b, May 2001, INED-EUROREVES ";
1.2 lievre 1891: char *alph[]={"a","a","b","c","d","e"}, str[4];
1.5 lievre 1892:
1.13 lievre 1893:
1.2 lievre 1894: char z[1]="c", occ;
1895: #include <sys/time.h>
1896: #include <time.h>
1897: char stra[80], strb[80], strc[80], strd[80],stre[80],modelsav[80];
1898: /* long total_usecs;
1899: struct timeval start_time, end_time;
1900:
1901: gettimeofday(&start_time, (struct timezone*)0); */ /* at first time */
1902:
1903:
1.16 ! lievre 1904: printf("\nIMACH, Version 0.7");
1.2 lievre 1905: printf("\nEnter the parameter file name: ");
1906:
1907: #ifdef windows
1908: scanf("%s",pathtot);
1.5 lievre 1909: getcwd(pathcd, size);
1910: /*cygwin_split_path(pathtot,path,optionfile);
1911: printf("pathtot=%s, path=%s, optionfile=%s\n",pathtot,path,optionfile);*/
1912: /* cutv(path,optionfile,pathtot,'\\');*/
1913:
1914: split(pathtot, path,optionfile);
1.2 lievre 1915: chdir(path);
1916: replace(pathc,path);
1917: #endif
1918: #ifdef unix
1919: scanf("%s",optionfile);
1920: #endif
1921:
1922: /*-------- arguments in the command line --------*/
1923:
1924: strcpy(fileres,"r");
1925: strcat(fileres, optionfile);
1926:
1927: /*---------arguments file --------*/
1928:
1929: if((ficpar=fopen(optionfile,"r"))==NULL) {
1930: printf("Problem with optionfile %s\n",optionfile);
1931: goto end;
1932: }
1933:
1934: strcpy(filereso,"o");
1935: strcat(filereso,fileres);
1936: if((ficparo=fopen(filereso,"w"))==NULL) {
1937: printf("Problem with Output resultfile: %s\n", filereso);goto end;
1938: }
1939:
1940: /* Reads comments: lines beginning with '#' */
1941: while((c=getc(ficpar))=='#' && c!= EOF){
1942: ungetc(c,ficpar);
1943: fgets(line, MAXLINE, ficpar);
1944: puts(line);
1945: fputs(line,ficparo);
1946: }
1947: ungetc(c,ficpar);
1948:
1949: fscanf(ficpar,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%lf stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n",title, datafile, &lastobs, &firstpass,&lastpass,&ftol, &stepm, &ncov, &nlstate,&ndeath, &maxwav, &mle, &weightopt,model);
1950: printf("title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncov, nlstate,ndeath, maxwav, mle, weightopt,model);
1951: fprintf(ficparo,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol,stepm,ncov,nlstate,ndeath,maxwav, mle, weightopt,model);
1.14 lievre 1952: while((c=getc(ficpar))=='#' && c!= EOF){
1953: ungetc(c,ficpar);
1954: fgets(line, MAXLINE, ficpar);
1955: puts(line);
1956: fputs(line,ficparo);
1957: }
1958: ungetc(c,ficpar);
1959:
1960: fscanf(ficpar,"fprevalence=%d lprevalence=%d pop_based=%d\n",&fprev,&lprev,&popbased);
1.16 ! lievre 1961: fprintf(ficparo,"fprevalence=%d lprevalence=%d pop_based=%d\n",fprev,lprev,popbased);
! 1962:
1.14 lievre 1963: while((c=getc(ficpar))=='#' && c!= EOF){
1964: ungetc(c,ficpar);
1965: fgets(line, MAXLINE, ficpar);
1966: puts(line);
1967: fputs(line,ficparo);
1968: }
1969: ungetc(c,ficpar);
1970:
1.15 lievre 1971: fscanf(ficpar,"fprevalence=%d lprevalence=%d nforecast=%d mob_average=%d\n",&fprevfore,&lprevfore,&nforecast,&mobilav);
1.16 ! lievre 1972: fprintf(ficparo,"fprevalence=%d lprevalence=%d nforecast=%d mob_average=%d\n",fprevfore,lprevfore,nforecast,mobilav);
! 1973:
! 1974:
! 1975: while((c=getc(ficpar))=='#' && c!= EOF){
! 1976: ungetc(c,ficpar);
! 1977: fgets(line, MAXLINE, ficpar);
! 1978: puts(line);
! 1979: fputs(line,ficparo);
! 1980: }
! 1981: ungetc(c,ficpar);
! 1982:
! 1983: fscanf(ficpar,"popforecast=%d popfile=%s\n",&popforecast,popfile);
1.14 lievre 1984:
1.8 lievre 1985: covar=matrix(0,NCOVMAX,1,n);
1986: cptcovn=0;
1987: if (strlen(model)>1) cptcovn=nbocc(model,'+')+1;
1.2 lievre 1988:
1989: ncovmodel=2+cptcovn;
1990: nvar=ncovmodel-1; /* Suppressing age as a basic covariate */
1991:
1992: /* Read guess parameters */
1993: /* Reads comments: lines beginning with '#' */
1994: while((c=getc(ficpar))=='#' && c!= EOF){
1995: ungetc(c,ficpar);
1996: fgets(line, MAXLINE, ficpar);
1997: puts(line);
1998: fputs(line,ficparo);
1999: }
2000: ungetc(c,ficpar);
2001:
2002: param= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncovmodel);
2003: for(i=1; i <=nlstate; i++)
2004: for(j=1; j <=nlstate+ndeath-1; j++){
2005: fscanf(ficpar,"%1d%1d",&i1,&j1);
2006: fprintf(ficparo,"%1d%1d",i1,j1);
2007: printf("%1d%1d",i,j);
2008: for(k=1; k<=ncovmodel;k++){
2009: fscanf(ficpar," %lf",¶m[i][j][k]);
2010: printf(" %lf",param[i][j][k]);
2011: fprintf(ficparo," %lf",param[i][j][k]);
2012: }
2013: fscanf(ficpar,"\n");
2014: printf("\n");
2015: fprintf(ficparo,"\n");
2016: }
2017:
1.12 lievre 2018: npar= (nlstate+ndeath-1)*nlstate*ncovmodel;
2019:
1.2 lievre 2020: p=param[1][1];
2021:
2022: /* Reads comments: lines beginning with '#' */
2023: while((c=getc(ficpar))=='#' && c!= EOF){
2024: ungetc(c,ficpar);
2025: fgets(line, MAXLINE, ficpar);
2026: puts(line);
2027: fputs(line,ficparo);
2028: }
2029: ungetc(c,ficpar);
2030:
2031: delti3= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncovmodel);
2032: delti=vector(1,npar); /* Scale of each paramater (output from hesscov) */
2033: for(i=1; i <=nlstate; i++){
2034: for(j=1; j <=nlstate+ndeath-1; j++){
2035: fscanf(ficpar,"%1d%1d",&i1,&j1);
2036: printf("%1d%1d",i,j);
2037: fprintf(ficparo,"%1d%1d",i1,j1);
2038: for(k=1; k<=ncovmodel;k++){
2039: fscanf(ficpar,"%le",&delti3[i][j][k]);
2040: printf(" %le",delti3[i][j][k]);
2041: fprintf(ficparo," %le",delti3[i][j][k]);
2042: }
2043: fscanf(ficpar,"\n");
2044: printf("\n");
2045: fprintf(ficparo,"\n");
2046: }
2047: }
2048: delti=delti3[1][1];
2049:
2050: /* Reads comments: lines beginning with '#' */
2051: while((c=getc(ficpar))=='#' && c!= EOF){
2052: ungetc(c,ficpar);
2053: fgets(line, MAXLINE, ficpar);
2054: puts(line);
2055: fputs(line,ficparo);
2056: }
2057: ungetc(c,ficpar);
2058:
2059: matcov=matrix(1,npar,1,npar);
2060: for(i=1; i <=npar; i++){
2061: fscanf(ficpar,"%s",&str);
2062: printf("%s",str);
2063: fprintf(ficparo,"%s",str);
2064: for(j=1; j <=i; j++){
2065: fscanf(ficpar," %le",&matcov[i][j]);
2066: printf(" %.5le",matcov[i][j]);
2067: fprintf(ficparo," %.5le",matcov[i][j]);
2068: }
2069: fscanf(ficpar,"\n");
2070: printf("\n");
2071: fprintf(ficparo,"\n");
2072: }
2073: for(i=1; i <=npar; i++)
2074: for(j=i+1;j<=npar;j++)
2075: matcov[i][j]=matcov[j][i];
2076:
2077: printf("\n");
2078:
2079:
2080: /*-------- data file ----------*/
2081: if((ficres =fopen(fileres,"w"))==NULL) {
2082: printf("Problem with resultfile: %s\n", fileres);goto end;
2083: }
2084: fprintf(ficres,"#%s\n",version);
2085:
2086: if((fic=fopen(datafile,"r"))==NULL) {
2087: printf("Problem with datafile: %s\n", datafile);goto end;
2088: }
2089:
2090: n= lastobs;
2091: severity = vector(1,maxwav);
2092: outcome=imatrix(1,maxwav+1,1,n);
2093: num=ivector(1,n);
2094: moisnais=vector(1,n);
2095: annais=vector(1,n);
2096: moisdc=vector(1,n);
2097: andc=vector(1,n);
2098: agedc=vector(1,n);
2099: cod=ivector(1,n);
2100: weight=vector(1,n);
2101: for(i=1;i<=n;i++) weight[i]=1.0; /* Equal weights, 1 by default */
2102: mint=matrix(1,maxwav,1,n);
2103: anint=matrix(1,maxwav,1,n);
2104: s=imatrix(1,maxwav+1,1,n);
2105: adl=imatrix(1,maxwav+1,1,n);
2106: tab=ivector(1,NCOVMAX);
1.3 lievre 2107: ncodemax=ivector(1,8);
1.2 lievre 2108:
1.12 lievre 2109: i=1;
1.2 lievre 2110: while (fgets(line, MAXLINE, fic) != NULL) {
2111: if ((i >= firstobs) && (i <=lastobs)) {
2112:
2113: for (j=maxwav;j>=1;j--){
2114: cutv(stra, strb,line,' '); s[j][i]=atoi(strb);
2115: strcpy(line,stra);
2116: cutv(stra, strb,line,'/'); anint[j][i]=(double)(atoi(strb)); strcpy(line,stra);
2117: cutv(stra, strb,line,' '); mint[j][i]=(double)(atoi(strb)); strcpy(line,stra);
2118: }
2119:
2120: cutv(stra, strb,line,'/'); andc[i]=(double)(atoi(strb)); strcpy(line,stra);
2121: cutv(stra, strb,line,' '); moisdc[i]=(double)(atoi(strb)); strcpy(line,stra);
2122:
2123: cutv(stra, strb,line,'/'); annais[i]=(double)(atoi(strb)); strcpy(line,stra);
2124: cutv(stra, strb,line,' '); moisnais[i]=(double)(atoi(strb)); strcpy(line,stra);
2125:
2126: cutv(stra, strb,line,' '); weight[i]=(double)(atoi(strb)); strcpy(line,stra);
2127: for (j=ncov;j>=1;j--){
2128: cutv(stra, strb,line,' '); covar[j][i]=(double)(atoi(strb)); strcpy(line,stra);
2129: }
2130: num[i]=atol(stra);
1.12 lievre 2131:
2132: /*if((s[2][i]==2) && (s[3][i]==-1)&&(s[4][i]==9)){
2133: printf("%d %.lf %.lf %.lf %.lf/%.lf %.lf/%.lf %.lf/%.lf %d %.lf/%.lf %d %.lf/%.lf %d %.lf/%.lf %d\n",num[i],(covar[1][i]), (covar[2][i]),weight[i], (moisnais[i]), (annais[i]), (moisdc[i]), (andc[i]), (mint[1][i]), (anint[1][i]), (s[1][i]), (mint[2][i]), (anint[2][i]), (s[2][i]), (mint[3][i]), (anint[3][i]), (s[3][i]), (mint[4][i]), (anint[4][i]), (s[4][i])); ij=ij+1;}*/
1.2 lievre 2134:
2135: i=i+1;
2136: }
2137: }
1.12 lievre 2138: /* printf("ii=%d", ij);
2139: scanf("%d",i);*/
2140: imx=i-1; /* Number of individuals */
1.3 lievre 2141:
1.12 lievre 2142: /* for (i=1; i<=imx; i++){
2143: if ((s[1][i]==3) && (s[2][i]==2)) s[2][i]=3;
2144: if ((s[2][i]==3) && (s[3][i]==2)) s[3][i]=3;
2145: if ((s[3][i]==3) && (s[4][i]==2)) s[4][i]=3;
1.14 lievre 2146: }
2147: for (i=1; i<=imx; i++) printf("%d %.lf %.lf %.lf %.lf/%.lf %.lf/%.lf %.lf/%.lf %d %.lf/%.lf %d %.lf/%.lf %d %.lf/%.lf %d\n",num[i],(covar[1][i]), (covar[2][i]), (weight[i]), (moisnais[i]), (annais[i]), (moisdc[i]), (andc[i]), (mint[1][i]), (anint[1][i]), (s[1][i]), (mint[2][i]), (anint[2][i]), (s[2][i]), (mint[3][i]), (anint[3][i]), (s[3][i]), (mint[4][i]), (anint[4][i]), (s[4][i]));*/
1.2 lievre 2148:
2149: /* Calculation of the number of parameter from char model*/
1.7 lievre 2150: Tvar=ivector(1,15);
2151: Tprod=ivector(1,15);
2152: Tvaraff=ivector(1,15);
2153: Tvard=imatrix(1,15,1,2);
1.6 lievre 2154: Tage=ivector(1,15);
1.2 lievre 2155:
2156: if (strlen(model) >1){
1.7 lievre 2157: j=0, j1=0, k1=1, k2=1;
1.2 lievre 2158: j=nbocc(model,'+');
1.6 lievre 2159: j1=nbocc(model,'*');
1.2 lievre 2160: cptcovn=j+1;
1.7 lievre 2161: cptcovprod=j1;
1.3 lievre 2162:
1.8 lievre 2163:
1.2 lievre 2164: strcpy(modelsav,model);
1.8 lievre 2165: if ((strcmp(model,"age")==0) || (strcmp(model,"age*age")==0)){
2166: printf("Error. Non available option model=%s ",model);
2167: goto end;
2168: }
2169:
2170: for(i=(j+1); i>=1;i--){
2171: cutv(stra,strb,modelsav,'+');
2172: if (nbocc(modelsav,'+')==0) strcpy(strb,modelsav);
2173: /* printf("i=%d a=%s b=%s sav=%s\n",i, stra,strb,modelsav);*/
2174: /*scanf("%d",i);*/
2175: if (strchr(strb,'*')) {
2176: cutv(strd,strc,strb,'*');
2177: if (strcmp(strc,"age")==0) {
1.7 lievre 2178: cptcovprod--;
1.8 lievre 2179: cutv(strb,stre,strd,'V');
2180: Tvar[i]=atoi(stre);
2181: cptcovage++;
2182: Tage[cptcovage]=i;
2183: /*printf("stre=%s ", stre);*/
1.7 lievre 2184: }
1.8 lievre 2185: else if (strcmp(strd,"age")==0) {
1.7 lievre 2186: cptcovprod--;
1.8 lievre 2187: cutv(strb,stre,strc,'V');
2188: Tvar[i]=atoi(stre);
2189: cptcovage++;
2190: Tage[cptcovage]=i;
1.7 lievre 2191: }
2192: else {
1.8 lievre 2193: cutv(strb,stre,strc,'V');
2194: Tvar[i]=ncov+k1;
2195: cutv(strb,strc,strd,'V');
2196: Tprod[k1]=i;
2197: Tvard[k1][1]=atoi(strc);
2198: Tvard[k1][2]=atoi(stre);
2199: Tvar[cptcovn+k2]=Tvard[k1][1];
2200: Tvar[cptcovn+k2+1]=Tvard[k1][2];
1.7 lievre 2201: for (k=1; k<=lastobs;k++)
1.8 lievre 2202: covar[ncov+k1][k]=covar[atoi(stre)][k]*covar[atoi(strc)][k];
2203: k1++;
2204: k2=k2+2;
1.7 lievre 2205: }
1.2 lievre 2206: }
1.8 lievre 2207: else {
2208: /*printf("d=%s c=%s b=%s\n", strd,strc,strb);*/
2209: /* scanf("%d",i);*/
2210: cutv(strd,strc,strb,'V');
2211: Tvar[i]=atoi(strc);
2212: }
2213: strcpy(modelsav,stra);
2214: /*printf("a=%s b=%s sav=%s\n", stra,strb,modelsav);
2215: scanf("%d",i);*/
1.2 lievre 2216: }
1.8 lievre 2217: }
2218:
2219: /*printf("tvar1=%d tvar2=%d tvar3=%d cptcovage=%d Tage=%d",Tvar[1],Tvar[2],Tvar[3],cptcovage,Tage[1]);
2220: printf("cptcovprod=%d ", cptcovprod);
2221: scanf("%d ",i);*/
1.2 lievre 2222: fclose(fic);
2223:
1.7 lievre 2224: /* if(mle==1){*/
1.2 lievre 2225: if (weightopt != 1) { /* Maximisation without weights*/
2226: for(i=1;i<=n;i++) weight[i]=1.0;
2227: }
2228: /*-calculation of age at interview from date of interview and age at death -*/
2229: agev=matrix(1,maxwav,1,imx);
1.12 lievre 2230:
2231: for (i=1; i<=imx; i++)
2232: for(m=2; (m<= maxwav); m++)
2233: if ((mint[m][i]== 99) && (s[m][i] <= nlstate)){
2234: anint[m][i]=9999;
2235: s[m][i]=-1;
2236: }
1.2 lievre 2237:
2238: for (i=1; i<=imx; i++) {
2239: agedc[i]=(moisdc[i]/12.+andc[i])-(moisnais[i]/12.+annais[i]);
2240: for(m=1; (m<= maxwav); m++){
2241: if(s[m][i] >0){
2242: if (s[m][i] == nlstate+1) {
2243: if(agedc[i]>0)
2244: if(moisdc[i]!=99 && andc[i]!=9999)
2245: agev[m][i]=agedc[i];
1.8 lievre 2246: else {
2247: if (andc[i]!=9999){
1.2 lievre 2248: printf("Warning negative age at death: %d line:%d\n",num[i],i);
2249: agev[m][i]=-1;
1.8 lievre 2250: }
1.2 lievre 2251: }
2252: }
2253: else if(s[m][i] !=9){ /* Should no more exist */
2254: agev[m][i]=(mint[m][i]/12.+1./24.+anint[m][i])-(moisnais[i]/12.+1./24.+annais[i]);
1.3 lievre 2255: if(mint[m][i]==99 || anint[m][i]==9999)
1.2 lievre 2256: agev[m][i]=1;
2257: else if(agev[m][i] <agemin){
2258: agemin=agev[m][i];
2259: /*printf(" Min anint[%d][%d]=%.2f annais[%d]=%.2f, agemin=%.2f\n",m,i,anint[m][i], i,annais[i], agemin);*/
2260: }
2261: else if(agev[m][i] >agemax){
2262: agemax=agev[m][i];
2263: /* printf(" anint[%d][%d]=%.0f annais[%d]=%.0f, agemax=%.0f\n",m,i,anint[m][i], i,annais[i], agemax);*/
2264: }
2265: /*agev[m][i]=anint[m][i]-annais[i];*/
2266: /* agev[m][i] = age[i]+2*m;*/
2267: }
2268: else { /* =9 */
2269: agev[m][i]=1;
2270: s[m][i]=-1;
2271: }
2272: }
2273: else /*= 0 Unknown */
2274: agev[m][i]=1;
2275: }
2276:
2277: }
2278: for (i=1; i<=imx; i++) {
2279: for(m=1; (m<= maxwav); m++){
2280: if (s[m][i] > (nlstate+ndeath)) {
2281: printf("Error: Wrong value in nlstate or ndeath\n");
2282: goto end;
2283: }
2284: }
2285: }
2286:
2287: printf("Total number of individuals= %d, Agemin = %.2f, Agemax= %.2f\n\n", imx, agemin, agemax);
2288:
2289: free_vector(severity,1,maxwav);
2290: free_imatrix(outcome,1,maxwav+1,1,n);
2291: free_vector(moisnais,1,n);
2292: free_vector(annais,1,n);
2293: free_matrix(mint,1,maxwav,1,n);
2294: free_matrix(anint,1,maxwav,1,n);
2295: free_vector(moisdc,1,n);
2296: free_vector(andc,1,n);
2297:
2298:
2299: wav=ivector(1,imx);
2300: dh=imatrix(1,lastpass-firstpass+1,1,imx);
2301: mw=imatrix(1,lastpass-firstpass+1,1,imx);
2302:
2303: /* Concatenates waves */
2304: concatwav(wav, dh, mw, s, agedc, agev, firstpass, lastpass, imx, nlstate, stepm);
2305:
2306:
1.6 lievre 2307: Tcode=ivector(1,100);
1.8 lievre 2308: nbcode=imatrix(0,NCOVMAX,0,NCOVMAX);
1.7 lievre 2309: ncodemax[1]=1;
2310: if (cptcovn > 0) tricode(Tvar,nbcode,imx);
2311:
1.2 lievre 2312: codtab=imatrix(1,100,1,10);
2313: h=0;
1.7 lievre 2314: m=pow(2,cptcoveff);
1.2 lievre 2315:
1.7 lievre 2316: for(k=1;k<=cptcoveff; k++){
1.2 lievre 2317: for(i=1; i <=(m/pow(2,k));i++){
2318: for(j=1; j <= ncodemax[k]; j++){
1.7 lievre 2319: for(cpt=1; cpt <=(m/pow(2,cptcoveff+1-k)); cpt++){
1.2 lievre 2320: h++;
2321: if (h>m) h=1;codtab[h][k]=j;
2322: }
2323: }
2324: }
2325: }
2326:
1.7 lievre 2327:
2328: /*for(i=1; i <=m ;i++){
1.2 lievre 2329: for(k=1; k <=cptcovn; k++){
1.7 lievre 2330: printf("i=%d k=%d %d %d",i,k,codtab[i][k], cptcoveff);
1.2 lievre 2331: }
2332: printf("\n");
1.6 lievre 2333: }
2334: scanf("%d",i);*/
1.2 lievre 2335:
2336: /* Calculates basic frequencies. Computes observed prevalence at single age
2337: and prints on file fileres'p'. */
1.15 lievre 2338: freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx,Tvar,nbcode, ncodemax, fprev, lprev);
1.2 lievre 2339:
2340: pmmij= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
2341: oldms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
2342: newms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
2343: savms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
2344: oldm=oldms; newm=newms; savm=savms; /* Keeps fixed addresses to free */
1.12 lievre 2345:
1.2 lievre 2346: /* For Powell, parameters are in a vector p[] starting at p[1]
2347: so we point p on param[1][1] so that p[1] maps on param[1][1][1] */
2348: p=param[1][1]; /* *(*(*(param +1)+1)+0) */
1.7 lievre 2349:
2350: if(mle==1){
1.2 lievre 2351: mlikeli(ficres,p, npar, ncovmodel, nlstate, ftol, func);
1.7 lievre 2352: }
1.2 lievre 2353:
2354: /*--------- results files --------------*/
1.16 ! lievre 2355: fprintf(ficres,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncov=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncov, nlstate, ndeath, maxwav, mle,weightopt,model);
! 2356: fprintf(ficres,"fprevalence=%d lprevalence=%d pop_based=%d\n",fprev,lprev,popbased);
! 2357: fprintf(ficres,"fprevalence=%d lprevalence=%d nforecast=%d mob_average=%d\n",fprevfore,lprevfore,nforecast,mobilav);
! 2358:
1.2 lievre 2359: jk=1;
2360: fprintf(ficres,"# Parameters\n");
2361: printf("# Parameters\n");
2362: for(i=1,jk=1; i <=nlstate; i++){
2363: for(k=1; k <=(nlstate+ndeath); k++){
2364: if (k != i)
2365: {
2366: printf("%d%d ",i,k);
2367: fprintf(ficres,"%1d%1d ",i,k);
2368: for(j=1; j <=ncovmodel; j++){
2369: printf("%f ",p[jk]);
2370: fprintf(ficres,"%f ",p[jk]);
2371: jk++;
2372: }
2373: printf("\n");
2374: fprintf(ficres,"\n");
2375: }
2376: }
2377: }
1.7 lievre 2378: if(mle==1){
1.2 lievre 2379: /* Computing hessian and covariance matrix */
2380: ftolhess=ftol; /* Usually correct */
2381: hesscov(matcov, p, npar, delti, ftolhess, func);
1.7 lievre 2382: }
1.2 lievre 2383: fprintf(ficres,"# Scales\n");
2384: printf("# Scales\n");
2385: for(i=1,jk=1; i <=nlstate; i++){
2386: for(j=1; j <=nlstate+ndeath; j++){
2387: if (j!=i) {
2388: fprintf(ficres,"%1d%1d",i,j);
2389: printf("%1d%1d",i,j);
2390: for(k=1; k<=ncovmodel;k++){
2391: printf(" %.5e",delti[jk]);
2392: fprintf(ficres," %.5e",delti[jk]);
2393: jk++;
2394: }
2395: printf("\n");
2396: fprintf(ficres,"\n");
2397: }
2398: }
2399: }
2400:
2401: k=1;
2402: fprintf(ficres,"# Covariance\n");
2403: printf("# Covariance\n");
2404: for(i=1;i<=npar;i++){
2405: /* if (k>nlstate) k=1;
2406: i1=(i-1)/(ncovmodel*nlstate)+1;
2407: fprintf(ficres,"%s%d%d",alph[k],i1,tab[i]);
2408: printf("%s%d%d",alph[k],i1,tab[i]);*/
2409: fprintf(ficres,"%3d",i);
2410: printf("%3d",i);
2411: for(j=1; j<=i;j++){
2412: fprintf(ficres," %.5e",matcov[i][j]);
2413: printf(" %.5e",matcov[i][j]);
2414: }
2415: fprintf(ficres,"\n");
2416: printf("\n");
2417: k++;
2418: }
2419:
2420: while((c=getc(ficpar))=='#' && c!= EOF){
2421: ungetc(c,ficpar);
2422: fgets(line, MAXLINE, ficpar);
2423: puts(line);
2424: fputs(line,ficparo);
2425: }
2426: ungetc(c,ficpar);
2427:
2428: fscanf(ficpar,"agemin=%lf agemax=%lf bage=%lf fage=%lf\n",&agemin,&agemax, &bage, &fage);
2429:
2430: if (fage <= 2) {
2431: bage = agemin;
2432: fage = agemax;
2433: }
2434:
2435: fprintf(ficres,"# agemin agemax for life expectancy, bage fage (if mle==0 ie no data nor Max likelihood).\n");
2436: fprintf(ficres,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax,bage,fage);
1.7 lievre 2437:
2438:
1.2 lievre 2439: /*------------ gnuplot -------------*/
2440: chdir(pathcd);
2441: if((ficgp=fopen("graph.plt","w"))==NULL) {
1.5 lievre 2442: printf("Problem with file graph.gp");goto end;
1.2 lievre 2443: }
2444: #ifdef windows
2445: fprintf(ficgp,"cd \"%s\" \n",pathc);
2446: #endif
1.7 lievre 2447: m=pow(2,cptcoveff);
1.2 lievre 2448:
2449: /* 1eme*/
2450: for (cpt=1; cpt<= nlstate ; cpt ++) {
2451: for (k1=1; k1<= m ; k1 ++) {
2452:
2453: #ifdef windows
2454: fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nset ter gif small size 400,300\nplot [%.f:%.f] \"vpl%s\" every :::%d::%d u 1:2 \"\%%lf",agemin,fage,fileres,k1-1,k1-1);
2455: #endif
2456: #ifdef unix
2457: fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nplot [%.f:%.f] \"vpl%s\" u 1:2 \"\%%lf",agemin,fage,fileres);
2458: #endif
2459:
2460: for (i=1; i<= nlstate ; i ++) {
2461: if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)");
2462: else fprintf(ficgp," \%%*lf (\%%*lf)");
2463: }
2464: fprintf(ficgp,"\" t\"Stationary prevalence\" w l 0,\"vpl%s\" every :::%d::%d u 1:($2+2*$3) \"\%%lf",fileres,k1-1,k1-1);
2465: for (i=1; i<= nlstate ; i ++) {
2466: if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)");
2467: else fprintf(ficgp," \%%*lf (\%%*lf)");
2468: }
2469: fprintf(ficgp,"\" t\"95\%% CI\" w l 1,\"vpl%s\" every :::%d::%d u 1:($2-2*$3) \"\%%lf",fileres,k1-1,k1-1);
2470: for (i=1; i<= nlstate ; i ++) {
2471: if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)");
2472: else fprintf(ficgp," \%%*lf (\%%*lf)");
2473: }
2474: fprintf(ficgp,"\" t\"\" w l 1,\"p%s\" every :::%d::%d u 1:($%d) t\"Observed prevalence \" w l 2",fileres,k1-1,k1-1,2+4*(cpt-1));
2475: #ifdef unix
2476: fprintf(ficgp,"\nset ter gif small size 400,300");
2477: #endif
2478: fprintf(ficgp,"\nset out \"v%s%d%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt,k1);
2479: }
2480: }
2481: /*2 eme*/
2482:
2483: for (k1=1; k1<= m ; k1 ++) {
2484: fprintf(ficgp,"set ylabel \"Years\" \nset ter gif small size 400,300\nplot [%.f:%.f] ",agemin,fage);
2485:
2486: for (i=1; i<= nlstate+1 ; i ++) {
2487: k=2*i;
2488: fprintf(ficgp,"\"t%s\" every :::%d::%d u 1:2 \"\%%lf",fileres,k1-1,k1-1);
2489: for (j=1; j<= nlstate+1 ; j ++) {
2490: if (j==i) fprintf(ficgp," \%%lf (\%%lf)");
2491: else fprintf(ficgp," \%%*lf (\%%*lf)");
2492: }
2493: if (i== 1) fprintf(ficgp,"\" t\"TLE\" w l ,");
2494: else fprintf(ficgp,"\" t\"LE in state (%d)\" w l ,",i-1);
2495: fprintf(ficgp,"\"t%s\" every :::%d::%d u 1:($2-$3*2) \"\%%lf",fileres,k1-1,k1-1);
2496: for (j=1; j<= nlstate+1 ; j ++) {
2497: if (j==i) fprintf(ficgp," \%%lf (\%%lf)");
2498: else fprintf(ficgp," \%%*lf (\%%*lf)");
2499: }
2500: fprintf(ficgp,"\" t\"\" w l 0,");
2501: fprintf(ficgp,"\"t%s\" every :::%d::%d u 1:($2+$3*2) \"\%%lf",fileres,k1-1,k1-1);
2502: for (j=1; j<= nlstate+1 ; j ++) {
2503: if (j==i) fprintf(ficgp," \%%lf (\%%lf)");
2504: else fprintf(ficgp," \%%*lf (\%%*lf)");
2505: }
2506: if (i== (nlstate+1)) fprintf(ficgp,"\" t\"\" w l 0");
2507: else fprintf(ficgp,"\" t\"\" w l 0,");
2508: }
2509: fprintf(ficgp,"\nset out \"e%s%d.gif\" \nreplot\n\n",strtok(optionfile, "."),k1);
2510: }
2511:
2512: /*3eme*/
2513:
1.5 lievre 2514: for (k1=1; k1<= m ; k1 ++) {
1.2 lievre 2515: for (cpt=1; cpt<= nlstate ; cpt ++) {
2516: k=2+nlstate*(cpt-1);
2517: fprintf(ficgp,"set ter gif small size 400,300\nplot [%.f:%.f] \"e%s\" every :::%d::%d u 1:%d t \"e%d1\" w l",agemin,fage,fileres,k1-1,k1-1,k,cpt);
2518: for (i=1; i< nlstate ; i ++) {
2519: fprintf(ficgp,",\"e%s\" every :::%d::%d u 1:%d t \"e%d%d\" w l",fileres,k1-1,k1-1,k+i,cpt,i+1);
2520: }
2521: fprintf(ficgp,"\nset out \"exp%s%d%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt,k1);
2522: }
1.5 lievre 2523: }
1.2 lievre 2524:
2525: /* CV preval stat */
1.5 lievre 2526: for (k1=1; k1<= m ; k1 ++) {
1.2 lievre 2527: for (cpt=1; cpt<nlstate ; cpt ++) {
2528: k=3;
2529: fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \nset ter gif small size 400,300\nplot [%.f:%.f] \"pij%s\" u ($1==%d ? ($3):1/0):($%d/($%d",agemin,agemax,fileres,k1,k+cpt+1,k+1);
2530: for (i=1; i< nlstate ; i ++)
2531: fprintf(ficgp,"+$%d",k+i+1);
2532: fprintf(ficgp,")) t\"prev(%d,%d)\" w l",cpt,cpt+1);
2533:
2534: l=3+(nlstate+ndeath)*cpt;
2535: fprintf(ficgp,",\"pij%s\" u ($1==%d ? ($3):1/0):($%d/($%d",fileres,k1,l+cpt+1,l+1);
2536: for (i=1; i< nlstate ; i ++) {
2537: l=3+(nlstate+ndeath)*cpt;
2538: fprintf(ficgp,"+$%d",l+i+1);
2539: }
2540: fprintf(ficgp,")) t\"prev(%d,%d)\" w l\n",cpt+1,cpt+1);
2541: fprintf(ficgp,"set out \"p%s%d%d.gif\" \nreplot\n\n",strtok(optionfile, "."),cpt,k1);
2542: }
1.13 lievre 2543: }
1.5 lievre 2544:
1.2 lievre 2545: /* proba elementaires */
1.5 lievre 2546: for(i=1,jk=1; i <=nlstate; i++){
1.2 lievre 2547: for(k=1; k <=(nlstate+ndeath); k++){
2548: if (k != i) {
2549: for(j=1; j <=ncovmodel; j++){
1.5 lievre 2550: /*fprintf(ficgp,"%s%1d%1d=%f ",alph[j],i,k,p[jk]);*/
2551: /*fprintf(ficgp,"%s",alph[1]);*/
2552: fprintf(ficgp,"p%d=%f ",jk,p[jk]);
1.2 lievre 2553: jk++;
2554: fprintf(ficgp,"\n");
2555: }
2556: }
2557: }
1.5 lievre 2558: }
2559:
1.2 lievre 2560: for(jk=1; jk <=m; jk++) {
2561: fprintf(ficgp,"\nset ter gif small size 400,300\nset log y\nplot [%.f:%.f] ",agemin,agemax);
1.5 lievre 2562: i=1;
2563: for(k2=1; k2<=nlstate; k2++) {
2564: k3=i;
2565: for(k=1; k<=(nlstate+ndeath); k++) {
2566: if (k != k2){
2567: fprintf(ficgp," exp(p%d+p%d*x",i,i+1);
1.7 lievre 2568: ij=1;
2569: for(j=3; j <=ncovmodel; j++) {
2570: if(((j-2)==Tage[ij]) &&(ij <=cptcovage)) {
2571: fprintf(ficgp,"+p%d*%d*x",i+j-1,nbcode[Tvar[j-2]][codtab[jk][Tvar[j-2]]]);
2572: ij++;
2573: }
2574: else
1.6 lievre 2575: fprintf(ficgp,"+p%d*%d",i+j-1,nbcode[Tvar[j-2]][codtab[jk][j-2]]);
1.7 lievre 2576: }
2577: fprintf(ficgp,")/(1");
1.6 lievre 2578:
2579: for(k1=1; k1 <=nlstate; k1++){
2580: fprintf(ficgp,"+exp(p%d+p%d*x",k3+(k1-1)*ncovmodel,k3+(k1-1)*ncovmodel+1);
1.7 lievre 2581: ij=1;
2582: for(j=3; j <=ncovmodel; j++){
2583: if(((j-2)==Tage[ij]) &&(ij <=cptcovage)) {
2584: fprintf(ficgp,"+p%d*%d*x",k3+(k1-1)*ncovmodel+1+j-2,nbcode[Tvar[j-2]][codtab[jk][Tvar[j-2]]]);
2585: ij++;
2586: }
2587: else
1.6 lievre 2588: fprintf(ficgp,"+p%d*%d",k3+(k1-1)*ncovmodel+1+j-2,nbcode[Tvar[j-2]][codtab[jk][j-2]]);
1.7 lievre 2589: }
1.6 lievre 2590: fprintf(ficgp,")");
1.5 lievre 2591: }
2592: fprintf(ficgp,") t \"p%d%d\" ", k2,k);
2593: if ((k+k2)!= (nlstate*2+ndeath)) fprintf(ficgp,",");
1.6 lievre 2594: i=i+ncovmodel;
1.5 lievre 2595: }
2596: }
2597: }
1.6 lievre 2598: fprintf(ficgp,"\nset out \"pe%s%d.gif\" \nreplot\n\n",strtok(optionfile, "."),jk);
2599: }
1.5 lievre 2600:
2601: fclose(ficgp);
2602:
2603: chdir(path);
1.15 lievre 2604:
1.2 lievre 2605: free_ivector(wav,1,imx);
2606: free_imatrix(dh,1,lastpass-firstpass+1,1,imx);
1.15 lievre 2607: free_imatrix(mw,1,lastpass-firstpass+1,1,imx);
1.2 lievre 2608: free_ivector(num,1,n);
2609: free_vector(agedc,1,n);
2610: /*free_matrix(covar,1,NCOVMAX,1,n);*/
2611: fclose(ficparo);
2612: fclose(ficres);
1.7 lievre 2613: /* }*/
1.2 lievre 2614:
2615: /*________fin mle=1_________*/
2616:
2617:
2618:
2619: /* No more information from the sample is required now */
2620: /* Reads comments: lines beginning with '#' */
2621: while((c=getc(ficpar))=='#' && c!= EOF){
2622: ungetc(c,ficpar);
2623: fgets(line, MAXLINE, ficpar);
2624: puts(line);
2625: fputs(line,ficparo);
2626: }
2627: ungetc(c,ficpar);
2628:
2629: fscanf(ficpar,"agemin=%lf agemax=%lf bage=%lf fage=%lf\n",&agemin,&agemax, &bage, &fage);
2630: printf("agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax, bage, fage);
2631: fprintf(ficparo,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f\n",agemin,agemax,bage,fage);
2632: /*--------- index.htm --------*/
2633:
1.9 lievre 2634: strcpy(optionfilehtm,optionfile);
2635: strcat(optionfilehtm,".htm");
2636: if((fichtm=fopen(optionfilehtm,"w"))==NULL) {
2637: printf("Problem with %s \n",optionfilehtm);goto end;
1.2 lievre 2638: }
2639:
1.16 ! lievre 2640: fprintf(fichtm,"<body><ul> <font size=\"6\">Imach, Version 0.7 </font> <hr size=\"2\" color=\"#EC5E5E\">
1.8 lievre 2641: Titre=%s <br>Datafile=%s Firstpass=%d Lastpass=%d Stepm=%d Weight=%d Model=%s<br>
2642: Total number of observations=%d <br>
2643: Interval (in months) between two waves: Min=%d Max=%d Mean=%.2lf<br>
2644: <hr size=\"2\" color=\"#EC5E5E\">
2645: <li>Outputs files<br><br>\n
1.2 lievre 2646: - Observed prevalence in each state: <a href=\"p%s\">p%s</a> <br>\n
2647: - Estimated parameters and the covariance matrix: <a href=\"%s\">%s</a> <br>
2648: - Stationary prevalence in each state: <a href=\"pl%s\">pl%s</a> <br>
2649: - Transition probabilities: <a href=\"pij%s\">pij%s</a><br>
2650: - Copy of the parameter file: <a href=\"o%s\">o%s</a><br>
2651: - Life expectancies by age and initial health status: <a href=\"e%s\">e%s</a> <br>
2652: - Variances of life expectancies by age and initial health status: <a href=\"v%s\">v%s</a><br>
2653: - Health expectancies with their variances: <a href=\"t%s\">t%s</a> <br>
1.14 lievre 2654: - Standard deviation of stationary prevalences: <a href=\"vpl%s\">vpl%s</a> <br>
2655: - Prevalences forecasting: <a href=\"f%s\">f%s</a> <br>
2656: <br>",title,datafile,firstpass,lastpass,stepm, weightopt,model,imx,jmin,jmax,jmean,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres,fileres);
1.2 lievre 2657:
1.8 lievre 2658: fprintf(fichtm," <li>Graphs</li><p>");
1.2 lievre 2659:
1.7 lievre 2660: m=cptcoveff;
1.2 lievre 2661: if (cptcovn < 1) {m=1;ncodemax[1]=1;}
2662:
2663: j1=0;
2664: for(k1=1; k1<=m;k1++){
2665: for(i1=1; i1<=ncodemax[k1];i1++){
2666: j1++;
2667: if (cptcovn > 0) {
1.8 lievre 2668: fprintf(fichtm,"<hr size=\"2\" color=\"#EC5E5E\">************ Results for covariates");
1.7 lievre 2669: for (cpt=1; cpt<=cptcoveff;cpt++)
2670: fprintf(fichtm," V%d=%d ",Tvaraff[cpt],nbcode[Tvaraff[cpt]][codtab[j1][cpt]]);
1.8 lievre 2671: fprintf(fichtm," ************\n<hr size=\"2\" color=\"#EC5E5E\">");
1.2 lievre 2672: }
2673: fprintf(fichtm,"<br>- Probabilities: pe%s%d.gif<br>
2674: <img src=\"pe%s%d.gif\">",strtok(optionfile, "."),j1,strtok(optionfile, "."),j1);
2675: for(cpt=1; cpt<nlstate;cpt++){
2676: fprintf(fichtm,"<br>- Prevalence of disability : p%s%d%d.gif<br>
2677: <img src=\"p%s%d%d.gif\">",strtok(optionfile, "."),cpt,j1,strtok(optionfile, "."),cpt,j1);
2678: }
2679: for(cpt=1; cpt<=nlstate;cpt++) {
2680: fprintf(fichtm,"<br>- Observed and stationary prevalence (with confident
2681: interval) in state (%d): v%s%d%d.gif <br>
2682: <img src=\"v%s%d%d.gif\">",cpt,strtok(optionfile, "."),cpt,j1,strtok(optionfile, "."),cpt,j1);
2683: }
2684: for(cpt=1; cpt<=nlstate;cpt++) {
2685: fprintf(fichtm,"\n<br>- Health life expectancies by age and initial health state (%d): exp%s%d%d.gif <br>
1.5 lievre 2686: <img src=\"exp%s%d%d.gif\">",cpt,strtok(optionfile, "."),cpt,j1,strtok(optionfile, "."),cpt,j1);
1.2 lievre 2687: }
2688: fprintf(fichtm,"\n<br>- Total life expectancy by age and
2689: health expectancies in states (1) and (2): e%s%d.gif<br>
2690: <img src=\"e%s%d.gif\">",strtok(optionfile, "."),j1,strtok(optionfile, "."),j1);
2691: fprintf(fichtm,"\n</body>");
2692: }
2693: }
2694: fclose(fichtm);
2695:
2696: /*--------------- Prevalence limit --------------*/
2697:
2698: strcpy(filerespl,"pl");
2699: strcat(filerespl,fileres);
2700: if((ficrespl=fopen(filerespl,"w"))==NULL) {
2701: printf("Problem with Prev limit resultfile: %s\n", filerespl);goto end;
2702: }
2703: printf("Computing prevalence limit: result on file '%s' \n", filerespl);
2704: fprintf(ficrespl,"#Prevalence limit\n");
2705: fprintf(ficrespl,"#Age ");
2706: for(i=1; i<=nlstate;i++) fprintf(ficrespl,"%d-%d ",i,i);
2707: fprintf(ficrespl,"\n");
2708:
2709: prlim=matrix(1,nlstate,1,nlstate);
2710: pmmij= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
2711: oldms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
2712: newms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
2713: savms= matrix(1,nlstate+ndeath,1,nlstate+ndeath); /* creation */
2714: oldm=oldms; newm=newms; savm=savms; /* Keeps fixed addresses to free */
2715: k=0;
2716: agebase=agemin;
2717: agelim=agemax;
2718: ftolpl=1.e-10;
1.7 lievre 2719: i1=cptcoveff;
1.2 lievre 2720: if (cptcovn < 1){i1=1;}
2721:
2722: for(cptcov=1;cptcov<=i1;cptcov++){
2723: for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){
2724: k=k+1;
2725: /*printf("cptcov=%d cptcod=%d codtab=%d nbcode=%d\n",cptcov, cptcod,Tcode[cptcode],codtab[cptcod][cptcov]);*/
1.6 lievre 2726: fprintf(ficrespl,"\n#******");
1.7 lievre 2727: for(j=1;j<=cptcoveff;j++)
2728: fprintf(ficrespl," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]);
1.2 lievre 2729: fprintf(ficrespl,"******\n");
2730:
2731: for (age=agebase; age<=agelim; age++){
2732: prevalim(prlim, nlstate, p, age, oldm, savm,ftolpl,k);
2733: fprintf(ficrespl,"%.0f",age );
2734: for(i=1; i<=nlstate;i++)
2735: fprintf(ficrespl," %.5f", prlim[i][i]);
2736: fprintf(ficrespl,"\n");
2737: }
2738: }
2739: }
2740: fclose(ficrespl);
1.13 lievre 2741:
1.2 lievre 2742: /*------------- h Pij x at various ages ------------*/
2743:
2744: strcpy(filerespij,"pij"); strcat(filerespij,fileres);
2745: if((ficrespij=fopen(filerespij,"w"))==NULL) {
2746: printf("Problem with Pij resultfile: %s\n", filerespij);goto end;
2747: }
2748: printf("Computing pij: result on file '%s' \n", filerespij);
2749:
2750: stepsize=(int) (stepm+YEARM-1)/YEARM;
1.13 lievre 2751: /*if (stepm<=24) stepsize=2;*/
1.2 lievre 2752:
2753: agelim=AGESUP;
2754: hstepm=stepsize*YEARM; /* Every year of age */
2755: hstepm=hstepm/stepm; /* Typically 2 years, = 2/6 months = 4 */
2756:
2757: k=0;
2758: for(cptcov=1;cptcov<=i1;cptcov++){
2759: for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){
2760: k=k+1;
2761: fprintf(ficrespij,"\n#****** ");
1.7 lievre 2762: for(j=1;j<=cptcoveff;j++)
2763: fprintf(ficrespij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]);
1.2 lievre 2764: fprintf(ficrespij,"******\n");
2765:
2766: for (agedeb=fage; agedeb>=bage; agedeb--){ /* If stepm=6 months */
2767: nhstepm=(int) rint((agelim-agedeb)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */
2768: nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */
2769: p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
2770: oldm=oldms;savm=savms;
2771: hpxij(p3mat,nhstepm,agedeb,hstepm,p,nlstate,stepm,oldm,savm, k);
2772: fprintf(ficrespij,"# Age");
2773: for(i=1; i<=nlstate;i++)
2774: for(j=1; j<=nlstate+ndeath;j++)
2775: fprintf(ficrespij," %1d-%1d",i,j);
2776: fprintf(ficrespij,"\n");
2777: for (h=0; h<=nhstepm; h++){
2778: fprintf(ficrespij,"%d %.0f %.0f",k,agedeb, agedeb+ h*hstepm/YEARM*stepm );
2779: for(i=1; i<=nlstate;i++)
2780: for(j=1; j<=nlstate+ndeath;j++)
2781: fprintf(ficrespij," %.5f", p3mat[i][j][h]);
2782: fprintf(ficrespij,"\n");
2783: }
2784: free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
2785: fprintf(ficrespij,"\n");
2786: }
2787: }
2788: }
2789:
1.13 lievre 2790: /* varprob(fileres, matcov, p, delti, nlstate, (int) bage, (int) fage,k);*/
2791:
1.2 lievre 2792: fclose(ficrespij);
2793:
1.13 lievre 2794: /*---------- Forecasting ------------------*/
2795:
2796: strcpy(fileresf,"f");
2797: strcat(fileresf,fileres);
2798: if((ficresf=fopen(fileresf,"w"))==NULL) {
2799: printf("Problem with forecast resultfile: %s\n", fileresf);goto end;
2800: }
2801: printf("Computing forecasting: result on file '%s' \n", fileresf);
2802:
1.15 lievre 2803: prevalence(agemin, agemax, s, agev, nlstate, imx,Tvar,nbcode, ncodemax, fprevfore, lprevfore);
2804:
2805: free_matrix(agev,1,maxwav,1,imx);
1.13 lievre 2806: /* Mobile average */
2807:
2808: if (cptcoveff==0) ncodemax[cptcoveff]=1;
2809:
1.14 lievre 2810: if (mobilav==1) {
2811: mobaverage= ma3x(1, AGESUP,1,NCOVMAX, 1,NCOVMAX);
2812: for (agedeb=bage+3; agedeb<=fage-2; agedeb++)
2813: for (i=1; i<=nlstate;i++)
2814: for (cptcod=1;cptcod<=ncodemax[cptcov];cptcod++)
2815: mobaverage[(int)agedeb][i][cptcod]=0.;
2816:
2817: for (agedeb=bage+4; agedeb<=fage; agedeb++){
2818: for (i=1; i<=nlstate;i++){
2819: for (cptcod=1;cptcod<=ncodemax[cptcoveff];cptcod++){
2820: for (cpt=0;cpt<=4;cpt++){
2821: mobaverage[(int)agedeb-2][i][cptcod]=mobaverage[(int)agedeb-2][i][cptcod]+probs[(int)agedeb-cpt][i][cptcod];
1.13 lievre 2822: }
2823: mobaverage[(int)agedeb-2][i][cptcod]=mobaverage[(int)agedeb-2][i][cptcod]/5;
1.14 lievre 2824: }
1.13 lievre 2825: }
1.14 lievre 2826: }
1.13 lievre 2827: }
2828:
2829: stepsize=(int) (stepm+YEARM-1)/YEARM;
1.15 lievre 2830: if (stepm<=12) stepsize=1;
1.13 lievre 2831:
2832: agelim=AGESUP;
2833: hstepm=stepsize*YEARM; /* Every year of age */
1.15 lievre 2834: hstepm=hstepm/stepm; /* Typically 2 years, = 2 years/6 months = 4 */
1.16 ! lievre 2835:
! 2836: if (popforecast==1) {
! 2837: if((ficpop=fopen(popfile,"r"))==NULL) {
! 2838: printf("Problem with population file : %s\n",popfile);goto end;
! 2839: }
! 2840: popage=ivector(0,AGESUP);
! 2841: popeffectif=vector(0,AGESUP);
! 2842: popcount=vector(0,AGESUP);
! 2843:
! 2844: i=1;
! 2845: while ((c=fscanf(ficpop,"%d %lf\n",&popage[i],&popcount[i])) != EOF)
! 2846: {
! 2847: i=i+1;
! 2848: }
! 2849: imx=i;
! 2850:
! 2851: for (i=1; i<imx;i++) popeffectif[popage[i]]=popcount[i];
! 2852: }
1.15 lievre 2853:
1.13 lievre 2854: for(cptcov=1;cptcov<=i1;cptcov++){
2855: for(cptcod=1;cptcod<=ncodemax[cptcoveff];cptcod++){
2856: k=k+1;
2857: fprintf(ficresf,"\n#****** ");
2858: for(j=1;j<=cptcoveff;j++) {
2859: fprintf(ficresf,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]);
2860: }
2861: fprintf(ficresf,"******\n");
2862: fprintf(ficresf,"# StartingAge FinalAge Horizon(in years)");
2863: for(j=1; j<=nlstate+ndeath;j++) fprintf(ficresf," P.%d",j);
1.16 ! lievre 2864: if (popforecast==1) fprintf(ficresf," [Population]");
1.13 lievre 2865:
2866: for (agedeb=fage; agedeb>=bage; agedeb--){
1.16 ! lievre 2867: fprintf(ficresf,"\n%.f %.f 0",agedeb, agedeb);
1.14 lievre 2868: if (mobilav==1) {
1.13 lievre 2869: for(j=1; j<=nlstate;j++)
1.16 ! lievre 2870: fprintf(ficresf," %.3f",mobaverage[(int)agedeb][j][cptcod]);
1.14 lievre 2871: }
2872: else {
2873: for(j=1; j<=nlstate;j++)
1.16 ! lievre 2874: fprintf(ficresf," %.3f",probs[(int)agedeb][j][cptcod]);
1.15 lievre 2875: }
1.16 ! lievre 2876:
! 2877: for(j=1; j<=ndeath;j++) fprintf(ficresf," 0.00000");
! 2878: if (popforecast==1) fprintf(ficresf," [%.f] ",popeffectif[(int)agedeb]);
1.13 lievre 2879: }
1.16 ! lievre 2880:
! 2881: for (cpt=1; cpt<=nforecast;cpt++) {
! 2882: fprintf(ficresf,"\n");
1.13 lievre 2883: for (agedeb=fage; agedeb>=bage; agedeb--){ /* If stepm=6 months */
1.15 lievre 2884: nhstepm=(int) rint((agelim-agedeb)*YEARM/stepm);
2885: nhstepm = nhstepm/hstepm;
2886: /*printf("agedeb=%.lf stepm=%d hstepm=%d nhstepm=%d \n",agedeb,stepm,hstepm,nhstepm);*/
1.13 lievre 2887:
2888: p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
2889: oldm=oldms;savm=savms;
2890: hpxij(p3mat,nhstepm,agedeb,hstepm,p,nlstate,stepm,oldm,savm, k);
2891:
2892: for (h=0; h<=nhstepm; h++){
2893:
1.15 lievre 2894: if (h*hstepm/YEARM*stepm==cpt)
1.16 ! lievre 2895: fprintf(ficresf,"\n%.f %.f %.f",agedeb, agedeb+ h*hstepm/YEARM*stepm, h*hstepm/YEARM*stepm);
1.15 lievre 2896:
1.13 lievre 2897:
1.16 ! lievre 2898: for(j=1; j<=nlstate+ndeath;j++) {
! 2899: kk1=0.;kk2=0;
! 2900: for(i=1; i<=nlstate;i++) {
! 2901: if (mobilav==1)
! 2902: kk1=kk1+p3mat[i][j][h]*mobaverage[(int)agedeb][i][cptcod];
! 2903: else kk1=kk1+p3mat[i][j][h]*probs[(int)agedeb][i][cptcod];
! 2904: if (popforecast==1) kk2=kk1*popeffectif[(int)agedeb];
! 2905: }
! 2906: if (h*hstepm/YEARM*stepm==cpt) {
! 2907: fprintf(ficresf," %.3f", kk1);
! 2908: if (popforecast==1) fprintf(ficresf," [%.f]", kk2);
! 2909: }
1.13 lievre 2910: }
1.14 lievre 2911: }
1.13 lievre 2912: free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm);
1.16 ! lievre 2913:
! 2914: }
1.13 lievre 2915: }
2916: }
1.14 lievre 2917: }
2918: if (mobilav==1) free_ma3x(mobaverage,1, AGESUP,1,NCOVMAX, 1,NCOVMAX);
1.16 ! lievre 2919: if (popforecast==1) {
! 2920: free_ivector(popage,0,AGESUP);
! 2921: free_vector(popeffectif,0,AGESUP);
! 2922: free_vector(popcount,0,AGESUP);
! 2923: }
1.15 lievre 2924: free_imatrix(s,1,maxwav+1,1,n);
2925: free_vector(weight,1,n);
1.13 lievre 2926: fclose(ficresf);
1.2 lievre 2927: /*---------- Health expectancies and variances ------------*/
2928:
2929: strcpy(filerest,"t");
2930: strcat(filerest,fileres);
2931: if((ficrest=fopen(filerest,"w"))==NULL) {
2932: printf("Problem with total LE resultfile: %s\n", filerest);goto end;
2933: }
2934: printf("Computing Total LEs with variances: file '%s' \n", filerest);
2935:
2936:
2937: strcpy(filerese,"e");
2938: strcat(filerese,fileres);
2939: if((ficreseij=fopen(filerese,"w"))==NULL) {
2940: printf("Problem with Health Exp. resultfile: %s\n", filerese); exit(0);
2941: }
2942: printf("Computing Health Expectancies: result on file '%s' \n", filerese);
2943:
2944: strcpy(fileresv,"v");
2945: strcat(fileresv,fileres);
2946: if((ficresvij=fopen(fileresv,"w"))==NULL) {
2947: printf("Problem with variance resultfile: %s\n", fileresv);exit(0);
2948: }
2949: printf("Computing Variance-covariance of DFLEs: file '%s' \n", fileresv);
2950:
2951: k=0;
2952: for(cptcov=1;cptcov<=i1;cptcov++){
2953: for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){
2954: k=k+1;
2955: fprintf(ficrest,"\n#****** ");
1.7 lievre 2956: for(j=1;j<=cptcoveff;j++)
2957: fprintf(ficrest,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]);
1.2 lievre 2958: fprintf(ficrest,"******\n");
2959:
2960: fprintf(ficreseij,"\n#****** ");
1.7 lievre 2961: for(j=1;j<=cptcoveff;j++)
1.2 lievre 2962: fprintf(ficreseij,"V%d=%d ",j,nbcode[j][codtab[k][j]]);
2963: fprintf(ficreseij,"******\n");
2964:
2965: fprintf(ficresvij,"\n#****** ");
1.7 lievre 2966: for(j=1;j<=cptcoveff;j++)
1.2 lievre 2967: fprintf(ficresvij,"V%d=%d ",j,nbcode[j][codtab[k][j]]);
2968: fprintf(ficresvij,"******\n");
2969:
2970: eij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage);
2971: oldm=oldms;savm=savms;
2972: evsij(fileres, eij, p, nlstate, stepm, (int) bage, (int)fage, oldm, savm, k);
2973: vareij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage);
2974: oldm=oldms;savm=savms;
2975: varevsij(fileres, vareij, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl,k);
2976:
2977: fprintf(ficrest,"#Total LEs with variances: e.. (std) ");
2978: for (i=1;i<=nlstate;i++) fprintf(ficrest,"e.%d (std) ",i);
2979: fprintf(ficrest,"\n");
2980:
2981: hf=1;
2982: if (stepm >= YEARM) hf=stepm/YEARM;
2983: epj=vector(1,nlstate+1);
2984: for(age=bage; age <=fage ;age++){
2985: prevalim(prlim, nlstate, p, age, oldm, savm,ftolpl,k);
1.14 lievre 2986: if (popbased==1) {
2987: for(i=1; i<=nlstate;i++)
2988: prlim[i][i]=probs[(int)age][i][k];
2989: }
2990:
1.2 lievre 2991: fprintf(ficrest," %.0f",age);
2992: for(j=1, epj[nlstate+1]=0.;j <=nlstate;j++){
2993: for(i=1, epj[j]=0.;i <=nlstate;i++) {
2994: epj[j] += prlim[i][i]*hf*eij[i][j][(int)age];
2995: }
2996: epj[nlstate+1] +=epj[j];
2997: }
2998: for(i=1, vepp=0.;i <=nlstate;i++)
2999: for(j=1;j <=nlstate;j++)
3000: vepp += vareij[i][j][(int)age];
3001: fprintf(ficrest," %.2f (%.2f)", epj[nlstate+1],hf*sqrt(vepp));
3002: for(j=1;j <=nlstate;j++){
3003: fprintf(ficrest," %.2f (%.2f)", epj[j],hf*sqrt(vareij[j][j][(int)age]));
3004: }
3005: fprintf(ficrest,"\n");
3006: }
3007: }
3008: }
3009:
1.13 lievre 3010:
3011:
3012:
1.2 lievre 3013: fclose(ficreseij);
3014: fclose(ficresvij);
3015: fclose(ficrest);
3016: fclose(ficpar);
3017: free_vector(epj,1,nlstate+1);
1.5 lievre 3018: /* scanf("%d ",i); */
1.2 lievre 3019:
3020: /*------- Variance limit prevalence------*/
3021:
3022: strcpy(fileresvpl,"vpl");
3023: strcat(fileresvpl,fileres);
3024: if((ficresvpl=fopen(fileresvpl,"w"))==NULL) {
3025: printf("Problem with variance prev lim resultfile: %s\n", fileresvpl);
3026: exit(0);
3027: }
3028: printf("Computing Variance-covariance of Prevalence limit: file '%s' \n", fileresvpl);
3029:
3030: k=0;
3031: for(cptcov=1;cptcov<=i1;cptcov++){
3032: for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){
3033: k=k+1;
3034: fprintf(ficresvpl,"\n#****** ");
1.7 lievre 3035: for(j=1;j<=cptcoveff;j++)
3036: fprintf(ficresvpl,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]);
1.2 lievre 3037: fprintf(ficresvpl,"******\n");
3038:
3039: varpl=matrix(1,nlstate,(int) bage, (int) fage);
3040: oldm=oldms;savm=savms;
3041: varprevlim(fileres, varpl, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl,k);
3042: }
3043: }
3044:
3045: fclose(ficresvpl);
3046:
3047: /*---------- End : free ----------------*/
3048: free_matrix(varpl,1,nlstate,(int) bage, (int)fage);
3049:
3050: free_ma3x(vareij,1,nlstate,1,nlstate,(int) bage, (int)fage);
3051: free_ma3x(eij,1,nlstate,1,nlstate,(int) bage, (int)fage);
3052:
3053:
3054: free_matrix(pmmij,1,nlstate+ndeath,1,nlstate+ndeath);
3055: free_matrix(oldms, 1,nlstate+ndeath,1,nlstate+ndeath);
3056: free_matrix(newms, 1,nlstate+ndeath,1,nlstate+ndeath);
3057: free_matrix(savms, 1,nlstate+ndeath,1,nlstate+ndeath);
1.13 lievre 3058:
1.2 lievre 3059: free_matrix(matcov,1,npar,1,npar);
3060: free_vector(delti,1,npar);
3061:
3062: free_ma3x(param,1,nlstate,1, nlstate+ndeath-1,1,ncovmodel);
3063:
3064: printf("End of Imach\n");
3065: /* gettimeofday(&end_time, (struct timezone*)0);*/ /* after time */
3066:
3067: /* printf("Total time was %d Sec. %d uSec.\n", end_time.tv_sec -start_time.tv_sec, end_time.tv_usec -start_time.tv_usec);*/
3068: /*printf("Total time was %d uSec.\n", total_usecs);*/
3069: /*------ End -----------*/
1.12 lievre 3070:
1.2 lievre 3071:
3072: end:
3073: #ifdef windows
3074: chdir(pathcd);
3075: #endif
1.13 lievre 3076:
1.11 lievre 3077: system("..\\gp37mgw\\wgnuplot graph.plt");
1.2 lievre 3078:
3079: #ifdef windows
3080: while (z[0] != 'q') {
3081: chdir(pathcd);
3082: printf("\nType e to edit output files, c to start again, and q for exiting: ");
3083: scanf("%s",z);
3084: if (z[0] == 'c') system("./imach");
3085: else if (z[0] == 'e') {
3086: chdir(path);
1.10 lievre 3087: system(optionfilehtm);
1.2 lievre 3088: }
3089: else if (z[0] == 'q') exit(0);
3090: }
3091: #endif
3092: }
3093:
3094:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/small/back.gif){kind=icon}
Return to imach.c CVS log ![[TXT]](/icons/small/text.gif){kind=icon}
![[DIR]](/icons/small/dir.gif){kind=icon}
Up to [Local Repository] / imach096d / src