version 1.99, 2004/06/05 08:57:40
|
version 1.217, 2015/12/23 17:18:31
|
Line 1
|
Line 1
|
/* $Id$ |
/* $Id$ |
$State$ |
$State$ |
$Log$ |
$Log$ |
|
Revision 1.217 2015/12/23 17:18:31 brouard |
|
Summary: Experimental backcast |
|
|
|
Revision 1.216 2015/12/18 17:32:11 brouard |
|
Summary: 0.98r4 Warning and status=-2 |
|
|
|
Version 0.98r4 is now: |
|
- displaying an error when status is -1, date of interview unknown and date of death known; |
|
- permitting a status -2 when the vital status is unknown at a known date of right truncation. |
|
Older changes concerning s=-2, dating from 2005 have been supersed. |
|
|
|
Revision 1.215 2015/12/16 08:52:24 brouard |
|
Summary: 0.98r4 working |
|
|
|
Revision 1.214 2015/12/16 06:57:54 brouard |
|
Summary: temporary not working |
|
|
|
Revision 1.213 2015/12/11 18:22:17 brouard |
|
Summary: 0.98r4 |
|
|
|
Revision 1.212 2015/11/21 12:47:24 brouard |
|
Summary: minor typo |
|
|
|
Revision 1.211 2015/11/21 12:41:11 brouard |
|
Summary: 0.98r3 with some graph of projected cross-sectional |
|
|
|
Author: Nicolas Brouard |
|
|
|
Revision 1.210 2015/11/18 17:41:20 brouard |
|
Summary: Start working on projected prevalences |
|
|
|
Revision 1.209 2015/11/17 22:12:03 brouard |
|
Summary: Adding ftolpl parameter |
|
Author: N Brouard |
|
|
|
We had difficulties to get smoothed confidence intervals. It was due |
|
to the period prevalence which wasn't computed accurately. The inner |
|
parameter ftolpl is now an outer parameter of the .imach parameter |
|
file after estepm. If ftolpl is small 1.e-4 and estepm too, |
|
computation are long. |
|
|
|
Revision 1.208 2015/11/17 14:31:57 brouard |
|
Summary: temporary |
|
|
|
Revision 1.207 2015/10/27 17:36:57 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.206 2015/10/24 07:14:11 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.205 2015/10/23 15:50:53 brouard |
|
Summary: 0.98r3 some clarification for graphs on likelihood contributions |
|
|
|
Revision 1.204 2015/10/01 16:20:26 brouard |
|
Summary: Some new graphs of contribution to likelihood |
|
|
|
Revision 1.203 2015/09/30 17:45:14 brouard |
|
Summary: looking at better estimation of the hessian |
|
|
|
Also a better criteria for convergence to the period prevalence And |
|
therefore adding the number of years needed to converge. (The |
|
prevalence in any alive state shold sum to one |
|
|
|
Revision 1.202 2015/09/22 19:45:16 brouard |
|
Summary: Adding some overall graph on contribution to likelihood. Might change |
|
|
|
Revision 1.201 2015/09/15 17:34:58 brouard |
|
Summary: 0.98r0 |
|
|
|
- Some new graphs like suvival functions |
|
- Some bugs fixed like model=1+age+V2. |
|
|
|
Revision 1.200 2015/09/09 16:53:55 brouard |
|
Summary: Big bug thanks to Flavia |
|
|
|
Even model=1+age+V2. did not work anymore |
|
|
|
Revision 1.199 2015/09/07 14:09:23 brouard |
|
Summary: 0.98q6 changing default small png format for graph to vectorized svg. |
|
|
|
Revision 1.198 2015/09/03 07:14:39 brouard |
|
Summary: 0.98q5 Flavia |
|
|
|
Revision 1.197 2015/09/01 18:24:39 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.196 2015/08/18 23:17:52 brouard |
|
Summary: 0.98q5 |
|
|
|
Revision 1.195 2015/08/18 16:28:39 brouard |
|
Summary: Adding a hack for testing purpose |
|
|
|
After reading the title, ftol and model lines, if the comment line has |
|
a q, starting with #q, the answer at the end of the run is quit. It |
|
permits to run test files in batch with ctest. The former workaround was |
|
$ echo q | imach foo.imach |
|
|
|
Revision 1.194 2015/08/18 13:32:00 brouard |
|
Summary: Adding error when the covariance matrix doesn't contain the exact number of lines required by the model line. |
|
|
|
Revision 1.193 2015/08/04 07:17:42 brouard |
|
Summary: 0.98q4 |
|
|
|
Revision 1.192 2015/07/16 16:49:02 brouard |
|
Summary: Fixing some outputs |
|
|
|
Revision 1.191 2015/07/14 10:00:33 brouard |
|
Summary: Some fixes |
|
|
|
Revision 1.190 2015/05/05 08:51:13 brouard |
|
Summary: Adding digits in output parameters (7 digits instead of 6) |
|
|
|
Fix 1+age+. |
|
|
|
Revision 1.189 2015/04/30 14:45:16 brouard |
|
Summary: 0.98q2 |
|
|
|
Revision 1.188 2015/04/30 08:27:53 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.187 2015/04/29 09:11:15 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.186 2015/04/23 12:01:52 brouard |
|
Summary: V1*age is working now, version 0.98q1 |
|
|
|
Some codes had been disabled in order to simplify and Vn*age was |
|
working in the optimization phase, ie, giving correct MLE parameters, |
|
but, as usual, outputs were not correct and program core dumped. |
|
|
|
Revision 1.185 2015/03/11 13:26:42 brouard |
|
Summary: Inclusion of compile and links command line for Intel Compiler |
|
|
|
Revision 1.184 2015/03/11 11:52:39 brouard |
|
Summary: Back from Windows 8. Intel Compiler |
|
|
|
Revision 1.183 2015/03/10 20:34:32 brouard |
|
Summary: 0.98q0, trying with directest, mnbrak fixed |
|
|
|
We use directest instead of original Powell test; probably no |
|
incidence on the results, but better justifications; |
|
We fixed Numerical Recipes mnbrak routine which was wrong and gave |
|
wrong results. |
|
|
|
Revision 1.182 2015/02/12 08:19:57 brouard |
|
Summary: Trying to keep directest which seems simpler and more general |
|
Author: Nicolas Brouard |
|
|
|
Revision 1.181 2015/02/11 23:22:24 brouard |
|
Summary: Comments on Powell added |
|
|
|
Author: |
|
|
|
Revision 1.180 2015/02/11 17:33:45 brouard |
|
Summary: Finishing move from main to function (hpijx and prevalence_limit) |
|
|
|
Revision 1.179 2015/01/04 09:57:06 brouard |
|
Summary: back to OS/X |
|
|
|
Revision 1.178 2015/01/04 09:35:48 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.177 2015/01/03 18:40:56 brouard |
|
Summary: Still testing ilc32 on OSX |
|
|
|
Revision 1.176 2015/01/03 16:45:04 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.175 2015/01/03 16:33:42 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.174 2015/01/03 16:15:49 brouard |
|
Summary: Still in cross-compilation |
|
|
|
Revision 1.173 2015/01/03 12:06:26 brouard |
|
Summary: trying to detect cross-compilation |
|
|
|
Revision 1.172 2014/12/27 12:07:47 brouard |
|
Summary: Back from Visual Studio and Intel, options for compiling for Windows XP |
|
|
|
Revision 1.171 2014/12/23 13:26:59 brouard |
|
Summary: Back from Visual C |
|
|
|
Still problem with utsname.h on Windows |
|
|
|
Revision 1.170 2014/12/23 11:17:12 brouard |
|
Summary: Cleaning some \%% back to %% |
|
|
|
The escape was mandatory for a specific compiler (which one?), but too many warnings. |
|
|
|
Revision 1.169 2014/12/22 23:08:31 brouard |
|
Summary: 0.98p |
|
|
|
Outputs some informations on compiler used, OS etc. Testing on different platforms. |
|
|
|
Revision 1.168 2014/12/22 15:17:42 brouard |
|
Summary: update |
|
|
|
Revision 1.167 2014/12/22 13:50:56 brouard |
|
Summary: Testing uname and compiler version and if compiled 32 or 64 |
|
|
|
Testing on Linux 64 |
|
|
|
Revision 1.166 2014/12/22 11:40:47 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.165 2014/12/16 11:20:36 brouard |
|
Summary: After compiling on Visual C |
|
|
|
* imach.c (Module): Merging 1.61 to 1.162 |
|
|
|
Revision 1.164 2014/12/16 10:52:11 brouard |
|
Summary: Merging with Visual C after suppressing some warnings for unused variables. Also fixing Saito's bug 0.98Xn |
|
|
|
* imach.c (Module): Merging 1.61 to 1.162 |
|
|
|
Revision 1.163 2014/12/16 10:30:11 brouard |
|
* imach.c (Module): Merging 1.61 to 1.162 |
|
|
|
Revision 1.162 2014/09/25 11:43:39 brouard |
|
Summary: temporary backup 0.99! |
|
|
|
Revision 1.1 2014/09/16 11:06:58 brouard |
|
Summary: With some code (wrong) for nlopt |
|
|
|
Author: |
|
|
|
Revision 1.161 2014/09/15 20:41:41 brouard |
|
Summary: Problem with macro SQR on Intel compiler |
|
|
|
Revision 1.160 2014/09/02 09:24:05 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.159 2014/09/01 10:34:10 brouard |
|
Summary: WIN32 |
|
Author: Brouard |
|
|
|
Revision 1.158 2014/08/27 17:11:51 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.157 2014/08/27 16:26:55 brouard |
|
Summary: Preparing windows Visual studio version |
|
Author: Brouard |
|
|
|
In order to compile on Visual studio, time.h is now correct and time_t |
|
and tm struct should be used. difftime should be used but sometimes I |
|
just make the differences in raw time format (time(&now). |
|
Trying to suppress #ifdef LINUX |
|
Add xdg-open for __linux in order to open default browser. |
|
|
|
Revision 1.156 2014/08/25 20:10:10 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.155 2014/08/25 18:32:34 brouard |
|
Summary: New compile, minor changes |
|
Author: Brouard |
|
|
|
Revision 1.154 2014/06/20 17:32:08 brouard |
|
Summary: Outputs now all graphs of convergence to period prevalence |
|
|
|
Revision 1.153 2014/06/20 16:45:46 brouard |
|
Summary: If 3 live state, convergence to period prevalence on same graph |
|
Author: Brouard |
|
|
|
Revision 1.152 2014/06/18 17:54:09 brouard |
|
Summary: open browser, use gnuplot on same dir than imach if not found in the path |
|
|
|
Revision 1.151 2014/06/18 16:43:30 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.150 2014/06/18 16:42:35 brouard |
|
Summary: If gnuplot is not in the path try on same directory than imach binary (OSX) |
|
Author: brouard |
|
|
|
Revision 1.149 2014/06/18 15:51:14 brouard |
|
Summary: Some fixes in parameter files errors |
|
Author: Nicolas Brouard |
|
|
|
Revision 1.148 2014/06/17 17:38:48 brouard |
|
Summary: Nothing new |
|
Author: Brouard |
|
|
|
Just a new packaging for OS/X version 0.98nS |
|
|
|
Revision 1.147 2014/06/16 10:33:11 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.146 2014/06/16 10:20:28 brouard |
|
Summary: Merge |
|
Author: Brouard |
|
|
|
Merge, before building revised version. |
|
|
|
Revision 1.145 2014/06/10 21:23:15 brouard |
|
Summary: Debugging with valgrind |
|
Author: Nicolas Brouard |
|
|
|
Lot of changes in order to output the results with some covariates |
|
After the Edimburgh REVES conference 2014, it seems mandatory to |
|
improve the code. |
|
No more memory valgrind error but a lot has to be done in order to |
|
continue the work of splitting the code into subroutines. |
|
Also, decodemodel has been improved. Tricode is still not |
|
optimal. nbcode should be improved. Documentation has been added in |
|
the source code. |
|
|
|
Revision 1.143 2014/01/26 09:45:38 brouard |
|
Summary: Version 0.98nR (to be improved, but gives same optimization results as 0.98k. Nice, promising |
|
|
|
* imach.c (Module): Trying to merge old staffs together while being at Tokyo. Not tested... |
|
(Module): Version 0.98nR Running ok, but output format still only works for three covariates. |
|
|
|
Revision 1.142 2014/01/26 03:57:36 brouard |
|
Summary: gnuplot changed plot w l 1 has to be changed to plot w l lt 2 |
|
|
|
* imach.c (Module): Trying to merge old staffs together while being at Tokyo. Not tested... |
|
|
|
Revision 1.141 2014/01/26 02:42:01 brouard |
|
* imach.c (Module): Trying to merge old staffs together while being at Tokyo. Not tested... |
|
|
|
Revision 1.140 2011/09/02 10:37:54 brouard |
|
Summary: times.h is ok with mingw32 now. |
|
|
|
Revision 1.139 2010/06/14 07:50:17 brouard |
|
After the theft of my laptop, I probably lost some lines of codes which were not uploaded to the CVS tree. |
|
I remember having already fixed agemin agemax which are pointers now but not cvs saved. |
|
|
|
Revision 1.138 2010/04/30 18:19:40 brouard |
|
*** empty log message *** |
|
|
|
Revision 1.137 2010/04/29 18:11:38 brouard |
|
(Module): Checking covariates for more complex models |
|
than V1+V2. A lot of change to be done. Unstable. |
|
|
|
Revision 1.136 2010/04/26 20:30:53 brouard |
|
(Module): merging some libgsl code. Fixing computation |
|
of likelione (using inter/intrapolation if mle = 0) in order to |
|
get same likelihood as if mle=1. |
|
Some cleaning of code and comments added. |
|
|
|
Revision 1.135 2009/10/29 15:33:14 brouard |
|
(Module): Now imach stops if date of birth, at least year of birth, is not given. Some cleaning of the code. |
|
|
|
Revision 1.134 2009/10/29 13:18:53 brouard |
|
(Module): Now imach stops if date of birth, at least year of birth, is not given. Some cleaning of the code. |
|
|
|
Revision 1.133 2009/07/06 10:21:25 brouard |
|
just nforces |
|
|
|
Revision 1.132 2009/07/06 08:22:05 brouard |
|
Many tings |
|
|
|
Revision 1.131 2009/06/20 16:22:47 brouard |
|
Some dimensions resccaled |
|
|
|
Revision 1.130 2009/05/26 06:44:34 brouard |
|
(Module): Max Covariate is now set to 20 instead of 8. A |
|
lot of cleaning with variables initialized to 0. Trying to make |
|
V2+V3*age+V1+V4 strb=V3*age+V1+V4 working better. |
|
|
|
Revision 1.129 2007/08/31 13:49:27 lievre |
|
Modification of the way of exiting when the covariate is not binary in order to see on the window the error message before exiting |
|
|
|
Revision 1.128 2006/06/30 13:02:05 brouard |
|
(Module): Clarifications on computing e.j |
|
|
|
Revision 1.127 2006/04/28 18:11:50 brouard |
|
(Module): Yes the sum of survivors was wrong since |
|
imach-114 because nhstepm was no more computed in the age |
|
loop. Now we define nhstepma in the age loop. |
|
(Module): In order to speed up (in case of numerous covariates) we |
|
compute health expectancies (without variances) in a first step |
|
and then all the health expectancies with variances or standard |
|
deviation (needs data from the Hessian matrices) which slows the |
|
computation. |
|
In the future we should be able to stop the program is only health |
|
expectancies and graph are needed without standard deviations. |
|
|
|
Revision 1.126 2006/04/28 17:23:28 brouard |
|
(Module): Yes the sum of survivors was wrong since |
|
imach-114 because nhstepm was no more computed in the age |
|
loop. Now we define nhstepma in the age loop. |
|
Version 0.98h |
|
|
|
Revision 1.125 2006/04/04 15:20:31 lievre |
|
Errors in calculation of health expectancies. Age was not initialized. |
|
Forecasting file added. |
|
|
|
Revision 1.124 2006/03/22 17:13:53 lievre |
|
Parameters are printed with %lf instead of %f (more numbers after the comma). |
|
The log-likelihood is printed in the log file |
|
|
|
Revision 1.123 2006/03/20 10:52:43 brouard |
|
* imach.c (Module): <title> changed, corresponds to .htm file |
|
name. <head> headers where missing. |
|
|
|
* imach.c (Module): Weights can have a decimal point as for |
|
English (a comma might work with a correct LC_NUMERIC environment, |
|
otherwise the weight is truncated). |
|
Modification of warning when the covariates values are not 0 or |
|
1. |
|
Version 0.98g |
|
|
|
Revision 1.122 2006/03/20 09:45:41 brouard |
|
(Module): Weights can have a decimal point as for |
|
English (a comma might work with a correct LC_NUMERIC environment, |
|
otherwise the weight is truncated). |
|
Modification of warning when the covariates values are not 0 or |
|
1. |
|
Version 0.98g |
|
|
|
Revision 1.121 2006/03/16 17:45:01 lievre |
|
* imach.c (Module): Comments concerning covariates added |
|
|
|
* imach.c (Module): refinements in the computation of lli if |
|
status=-2 in order to have more reliable computation if stepm is |
|
not 1 month. Version 0.98f |
|
|
|
Revision 1.120 2006/03/16 15:10:38 lievre |
|
(Module): refinements in the computation of lli if |
|
status=-2 in order to have more reliable computation if stepm is |
|
not 1 month. Version 0.98f |
|
|
|
Revision 1.119 2006/03/15 17:42:26 brouard |
|
(Module): Bug if status = -2, the loglikelihood was |
|
computed as likelihood omitting the logarithm. Version O.98e |
|
|
|
Revision 1.118 2006/03/14 18:20:07 brouard |
|
(Module): varevsij Comments added explaining the second |
|
table of variances if popbased=1 . |
|
(Module): Covariances of eij, ekl added, graphs fixed, new html link. |
|
(Module): Function pstamp added |
|
(Module): Version 0.98d |
|
|
|
Revision 1.117 2006/03/14 17:16:22 brouard |
|
(Module): varevsij Comments added explaining the second |
|
table of variances if popbased=1 . |
|
(Module): Covariances of eij, ekl added, graphs fixed, new html link. |
|
(Module): Function pstamp added |
|
(Module): Version 0.98d |
|
|
|
Revision 1.116 2006/03/06 10:29:27 brouard |
|
(Module): Variance-covariance wrong links and |
|
varian-covariance of ej. is needed (Saito). |
|
|
|
Revision 1.115 2006/02/27 12:17:45 brouard |
|
(Module): One freematrix added in mlikeli! 0.98c |
|
|
|
Revision 1.114 2006/02/26 12:57:58 brouard |
|
(Module): Some improvements in processing parameter |
|
filename with strsep. |
|
|
|
Revision 1.113 2006/02/24 14:20:24 brouard |
|
(Module): Memory leaks checks with valgrind and: |
|
datafile was not closed, some imatrix were not freed and on matrix |
|
allocation too. |
|
|
|
Revision 1.112 2006/01/30 09:55:26 brouard |
|
(Module): Back to gnuplot.exe instead of wgnuplot.exe |
|
|
|
Revision 1.111 2006/01/25 20:38:18 brouard |
|
(Module): Lots of cleaning and bugs added (Gompertz) |
|
(Module): Comments can be added in data file. Missing date values |
|
can be a simple dot '.'. |
|
|
|
Revision 1.110 2006/01/25 00:51:50 brouard |
|
(Module): Lots of cleaning and bugs added (Gompertz) |
|
|
|
Revision 1.109 2006/01/24 19:37:15 brouard |
|
(Module): Comments (lines starting with a #) are allowed in data. |
|
|
|
Revision 1.108 2006/01/19 18:05:42 lievre |
|
Gnuplot problem appeared... |
|
To be fixed |
|
|
|
Revision 1.107 2006/01/19 16:20:37 brouard |
|
Test existence of gnuplot in imach path |
|
|
|
Revision 1.106 2006/01/19 13:24:36 brouard |
|
Some cleaning and links added in html output |
|
|
|
Revision 1.105 2006/01/05 20:23:19 lievre |
|
*** empty log message *** |
|
|
|
Revision 1.104 2005/09/30 16:11:43 lievre |
|
(Module): sump fixed, loop imx fixed, and simplifications. |
|
(Module): If the status is missing at the last wave but we know |
|
that the person is alive, then we can code his/her status as -2 |
|
(instead of missing=-1 in earlier versions) and his/her |
|
contributions to the likelihood is 1 - Prob of dying from last |
|
health status (= 1-p13= p11+p12 in the easiest case of somebody in |
|
the healthy state at last known wave). Version is 0.98 |
|
|
|
Revision 1.103 2005/09/30 15:54:49 lievre |
|
(Module): sump fixed, loop imx fixed, and simplifications. |
|
|
|
Revision 1.102 2004/09/15 17:31:30 brouard |
|
Add the possibility to read data file including tab characters. |
|
|
|
Revision 1.101 2004/09/15 10:38:38 brouard |
|
Fix on curr_time |
|
|
|
Revision 1.100 2004/07/12 18:29:06 brouard |
|
Add version for Mac OS X. Just define UNIX in Makefile |
|
|
Revision 1.99 2004/06/05 08:57:40 brouard |
Revision 1.99 2004/06/05 08:57:40 brouard |
*** empty log message *** |
*** empty log message *** |
|
|
Line 15
|
Line 520
|
|
|
The same imach parameter file can be used but the option for mle should be -3. |
The same imach parameter file can be used but the option for mle should be -3. |
|
|
Agnès, who wrote this part of the code, tried to keep most of the |
Agnès, who wrote this part of the code, tried to keep most of the |
former routines in order to include the new code within the former code. |
former routines in order to include the new code within the former code. |
|
|
The output is very simple: only an estimate of the intercept and of |
The output is very simple: only an estimate of the intercept and of |
Line 146
|
Line 651
|
hPijx. |
hPijx. |
|
|
Also this programme outputs the covariance matrix of the parameters but also |
Also this programme outputs the covariance matrix of the parameters but also |
of the life expectancies. It also computes the stable prevalence. |
of the life expectancies. It also computes the period (stable) prevalence. |
|
|
Authors: Nicolas Brouard (brouard@ined.fr) and Agnès Lièvre (lievre@ined.fr). |
Authors: Nicolas Brouard (brouard@ined.fr) and Agnès Lièvre (lievre@ined.fr). |
Institut national d'études démographiques, Paris. |
Institut national d'études démographiques, Paris. |
This software have been partly granted by Euro-REVES, a concerted action |
This software have been partly granted by Euro-REVES, a concerted action |
from the European Union. |
from the European Union. |
It is copyrighted identically to a GNU software product, ie programme and |
It is copyrighted identically to a GNU software product, ie programme and |
Line 175
|
Line 680
|
begin-prev-date,... |
begin-prev-date,... |
open gnuplot file |
open gnuplot file |
open html file |
open html file |
stable prevalence |
period (stable) prevalence | pl_nom 1-1 2-2 etc by covariate |
for age prevalim() |
for age prevalim() | #****** V1=0 V2=1 V3=1 V4=0 ****** |
h Pij x |
| 65 1 0 2 1 3 1 4 0 0.96326 0.03674 |
variance of p varprob |
freexexit2 possible for memory heap. |
|
|
|
h Pij x | pij_nom ficrestpij |
|
# Cov Agex agex+h hpijx with i,j= 1-1 1-2 1-3 2-1 2-2 2-3 |
|
1 85 85 1.00000 0.00000 0.00000 0.00000 1.00000 0.00000 |
|
1 85 86 0.68299 0.22291 0.09410 0.71093 0.00000 0.28907 |
|
|
|
1 65 99 0.00364 0.00322 0.99314 0.00350 0.00310 0.99340 |
|
1 65 100 0.00214 0.00204 0.99581 0.00206 0.00196 0.99597 |
|
variance of p one-step probabilities varprob | prob_nom ficresprob #One-step probabilities and stand. devi in () |
|
Standard deviation of one-step probabilities | probcor_nom ficresprobcor #One-step probabilities and correlation matrix |
|
Matrix of variance covariance of one-step probabilities | probcov_nom ficresprobcov #One-step probabilities and covariance matrix |
|
|
forecasting if prevfcast==1 prevforecast call prevalence() |
forecasting if prevfcast==1 prevforecast call prevalence() |
health expectancies |
health expectancies |
Variance-covariance of DFLE |
Variance-covariance of DFLE |
Line 187
|
Line 704
|
varevsij() |
varevsij() |
if popbased==1 varevsij(,popbased) |
if popbased==1 varevsij(,popbased) |
total life expectancies |
total life expectancies |
Variance of stable prevalence |
Variance of period (stable) prevalence |
end |
end |
*/ |
*/ |
|
|
|
/* #define DEBUG */ |
|
/* #define DEBUGBRENT */ |
|
/* #define DEBUGLINMIN */ |
|
/* #define DEBUGHESS */ |
|
#define DEBUGHESSIJ |
|
/* #define LINMINORIGINAL /\* Don't use loop on scale in linmin (accepting nan)*\/ */ |
|
#define POWELL /* Instead of NLOPT */ |
|
#define POWELLF1F3 /* Skip test */ |
|
/* #define POWELLORIGINAL /\* Don't use Directest to decide new direction but original Powell test *\/ */ |
|
/* #define MNBRAKORIGINAL /\* Don't use mnbrak fix *\/ */ |
|
|
|
|
|
|
#include <math.h> |
#include <math.h> |
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
|
#include <string.h> |
|
|
|
#ifdef _WIN32 |
|
#include <io.h> |
|
#include <windows.h> |
|
#include <tchar.h> |
|
#else |
#include <unistd.h> |
#include <unistd.h> |
|
#endif |
|
|
|
#include <limits.h> |
|
#include <sys/types.h> |
|
|
|
#if defined(__GNUC__) |
|
#include <sys/utsname.h> /* Doesn't work on Windows */ |
|
#endif |
|
|
|
#include <sys/stat.h> |
|
#include <errno.h> |
|
/* extern int errno; */ |
|
|
|
/* #ifdef LINUX */ |
|
/* #include <time.h> */ |
|
/* #include "timeval.h" */ |
|
/* #else */ |
/* #include <sys/time.h> */ |
/* #include <sys/time.h> */ |
|
/* #endif */ |
|
|
#include <time.h> |
#include <time.h> |
#include "timeval.h" |
|
|
#ifdef GSL |
|
#include <gsl/gsl_errno.h> |
|
#include <gsl/gsl_multimin.h> |
|
#endif |
|
|
|
|
|
#ifdef NLOPT |
|
#include <nlopt.h> |
|
typedef struct { |
|
double (* function)(double [] ); |
|
} myfunc_data ; |
|
#endif |
|
|
/* #include <libintl.h> */ |
/* #include <libintl.h> */ |
/* #define _(String) gettext (String) */ |
/* #define _(String) gettext (String) */ |
|
|
#define MAXLINE 256 |
#define MAXLINE 1024 /* Was 256. Overflow with 312 with 2 states and 4 covariates. Should be ok */ |
|
|
#define GNUPLOTPROGRAM "gnuplot" |
#define GNUPLOTPROGRAM "gnuplot" |
/*#define GNUPLOTPROGRAM "..\\gp37mgw\\wgnuplot"*/ |
/*#define GNUPLOTPROGRAM "..\\gp37mgw\\wgnuplot"*/ |
#define FILENAMELENGTH 132 |
#define FILENAMELENGTH 132 |
/*#define DEBUG*/ |
|
/*#define windows*/ |
|
#define GLOCK_ERROR_NOPATH -1 /* empty path */ |
#define GLOCK_ERROR_NOPATH -1 /* empty path */ |
#define GLOCK_ERROR_GETCWD -2 /* cannot get cwd */ |
#define GLOCK_ERROR_GETCWD -2 /* cannot get cwd */ |
|
|
#define MAXPARM 30 /* Maximum number of parameters for the optimization */ |
#define MAXPARM 128 /**< Maximum number of parameters for the optimization */ |
#define NPARMAX 64 /* (nlstate+ndeath-1)*nlstate*ncovmodel */ |
#define NPARMAX 64 /**< (nlstate+ndeath-1)*nlstate*ncovmodel */ |
|
|
#define NINTERVMAX 8 |
#define NINTERVMAX 8 |
#define NLSTATEMAX 8 /* Maximum number of live states (for func) */ |
#define NLSTATEMAX 8 /**< Maximum number of live states (for func) */ |
#define NDEATHMAX 8 /* Maximum number of dead states (for func) */ |
#define NDEATHMAX 8 /**< Maximum number of dead states (for func) */ |
#define NCOVMAX 8 /* Maximum number of covariates */ |
#define NCOVMAX 20 /**< Maximum number of covariates, including generated covariates V1*V2 */ |
|
#define codtabm(h,k) (1 & (h-1) >> (k-1))+1 |
|
/*#define decodtabm(h,k,cptcoveff)= (h <= (1<<cptcoveff)?(((h-1) >> (k-1)) & 1) +1 : -1)*/ |
|
#define decodtabm(h,k,cptcoveff) (((h-1) >> (k-1)) & 1) +1 |
#define MAXN 20000 |
#define MAXN 20000 |
#define YEARM 12. /* Number of months per year */ |
#define YEARM 12. /**< Number of months per year */ |
#define AGESUP 130 |
#define AGESUP 130 |
#define AGEBASE 40 |
#define AGEBASE 40 |
#define AGEGOMP 10. /* Minimal age for Gompertz adjustment */ |
#define AGEOVERFLOW 1.e20 |
#ifdef unix |
#define AGEGOMP 10 /**< Minimal age for Gompertz adjustment */ |
#define DIRSEPARATOR '/' |
#ifdef _WIN32 |
#define ODIRSEPARATOR '\\' |
|
#else |
|
#define DIRSEPARATOR '\\' |
#define DIRSEPARATOR '\\' |
|
#define CHARSEPARATOR "\\" |
#define ODIRSEPARATOR '/' |
#define ODIRSEPARATOR '/' |
|
#else |
|
#define DIRSEPARATOR '/' |
|
#define CHARSEPARATOR "/" |
|
#define ODIRSEPARATOR '\\' |
#endif |
#endif |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* $State$ */ |
/* $State$ */ |
|
#include "version.h" |
char version[]="Imach version 0.97b, May 2004, INED-EUROREVES "; |
char version[]=__IMACH_VERSION__; |
|
char copyright[]="October 2015,INED-EUROREVES-Institut de longevite-Japan Society for the Promotion of Science (Grant-in-Aid for Scientific Research 25293121), Intel Software 2015"; |
char fullversion[]="$Revision$ $Date$"; |
char fullversion[]="$Revision$ $Date$"; |
int erreur, nberr=0, nbwarn=0; /* Error number, number of errors number of warnings */ |
char strstart[80]; |
int nvar; |
char optionfilext[10], optionfilefiname[FILENAMELENGTH]; |
int cptcovn=0, cptcovage=0, cptcoveff=0,cptcov; |
int erreur=0, nberr=0, nbwarn=0; /* Error number, number of errors number of warnings */ |
|
int nagesqr=0, nforce=0; /* nagesqr=1 if model is including age*age, number of forces */ |
|
/* Number of covariates model=V2+V1+ V3*age+V2*V4 */ |
|
int cptcovn=0; /**< cptcovn number of covariates added in the model (excepting constant and age and age*product) */ |
|
int cptcovt=0; /**< cptcovt number of covariates added in the model (excepting constant and age) */ |
|
int cptcovs=0; /**< cptcovs number of simple covariates V2+V1 =2 */ |
|
int cptcovage=0; /**< Number of covariates with age: V3*age only =1 */ |
|
int cptcovprodnoage=0; /**< Number of covariate products without age */ |
|
int cptcoveff=0; /* Total number of covariates to vary for printing results */ |
|
int cptcov=0; /* Working variable */ |
int npar=NPARMAX; |
int npar=NPARMAX; |
int nlstate=2; /* Number of live states */ |
int nlstate=2; /* Number of live states */ |
int ndeath=1; /* Number of dead states */ |
int ndeath=1; /* Number of dead states */ |
int ncovmodel, ncovcol; /* Total number of covariables including constant a12*1 +b12*x ncovmodel=2 */ |
int ncovmodel=0, ncovcol=0; /* Total number of covariables including constant a12*1 +b12*x ncovmodel=2 */ |
int popbased=0; |
int popbased=0; |
|
|
int *wav; /* Number of waves for this individuual 0 is possible */ |
int *wav; /* Number of waves for this individuual 0 is possible */ |
int maxwav; /* Maxim number of waves */ |
int maxwav=0; /* Maxim number of waves */ |
int jmin, jmax; /* min, max spacing between 2 waves */ |
int jmin=0, jmax=0; /* min, max spacing between 2 waves */ |
int gipmx, gsw; /* Global variables on the number of contributions |
int ijmin=0, ijmax=0; /* Individuals having jmin and jmax */ |
|
int gipmx=0, gsw=0; /* Global variables on the number of contributions |
to the likelihood and the sum of weights (done by funcone)*/ |
to the likelihood and the sum of weights (done by funcone)*/ |
int mle, weightopt; |
int mle=1, weightopt=0; |
int **mw; /* mw[mi][i] is number of the mi wave for this individual */ |
int **mw; /* mw[mi][i] is number of the mi wave for this individual */ |
int **dh; /* dh[mi][i] is number of steps between mi,mi+1 for this individual */ |
int **dh; /* dh[mi][i] is number of steps between mi,mi+1 for this individual */ |
int **bh; /* bh[mi][i] is the bias (+ or -) for this individual if the delay between |
int **bh; /* bh[mi][i] is the bias (+ or -) for this individual if the delay between |
* wave mi and wave mi+1 is not an exact multiple of stepm. */ |
* wave mi and wave mi+1 is not an exact multiple of stepm. */ |
double jmean; /* Mean space between 2 waves */ |
int countcallfunc=0; /* Count the number of calls to func */ |
|
double jmean=1; /* Mean space between 2 waves */ |
|
double **matprod2(); /* test */ |
double **oldm, **newm, **savm; /* Working pointers to matrices */ |
double **oldm, **newm, **savm; /* Working pointers to matrices */ |
double **oldms, **newms, **savms; /* Fixed working pointers to matrices */ |
double **oldms, **newms, **savms; /* Fixed working pointers to matrices */ |
FILE *fic,*ficpar, *ficparo,*ficres, *ficrespl, *ficrespij, *ficrest,*ficresf,*ficrespop; |
/*FILE *fic ; */ /* Used in readdata only */ |
|
FILE *ficpar, *ficparo,*ficres, *ficresp, *ficresphtm, *ficresphtmfr, *ficrespl, *ficresplb,*ficrespij, *ficrespijb, *ficrest,*ficresf, *ficresfb,*ficrespop; |
FILE *ficlog, *ficrespow; |
FILE *ficlog, *ficrespow; |
int globpr; /* Global variable for printing or not */ |
int globpr=0; /* Global variable for printing or not */ |
double fretone; /* Only one call to likelihood */ |
double fretone; /* Only one call to likelihood */ |
long ipmx; /* Number of contributions */ |
long ipmx=0; /* Number of contributions */ |
double sw; /* Sum of weights */ |
double sw; /* Sum of weights */ |
char filerespow[FILENAMELENGTH]; |
char filerespow[FILENAMELENGTH]; |
char fileresilk[FILENAMELENGTH]; /* File of individual contributions to the likelihood */ |
char fileresilk[FILENAMELENGTH]; /* File of individual contributions to the likelihood */ |
Line 276 FILE *ficresprobmorprev;
|
Line 858 FILE *ficresprobmorprev;
|
FILE *fichtm, *fichtmcov; /* Html File */ |
FILE *fichtm, *fichtmcov; /* Html File */ |
FILE *ficreseij; |
FILE *ficreseij; |
char filerese[FILENAMELENGTH]; |
char filerese[FILENAMELENGTH]; |
|
FILE *ficresstdeij; |
|
char fileresstde[FILENAMELENGTH]; |
|
FILE *ficrescveij; |
|
char filerescve[FILENAMELENGTH]; |
FILE *ficresvij; |
FILE *ficresvij; |
char fileresv[FILENAMELENGTH]; |
char fileresv[FILENAMELENGTH]; |
FILE *ficresvpl; |
FILE *ficresvpl; |
char fileresvpl[FILENAMELENGTH]; |
char fileresvpl[FILENAMELENGTH]; |
char title[MAXLINE]; |
char title[MAXLINE]; |
char optionfile[FILENAMELENGTH], datafile[FILENAMELENGTH], filerespl[FILENAMELENGTH]; |
char optionfile[FILENAMELENGTH], datafile[FILENAMELENGTH], filerespl[FILENAMELENGTH], fileresplb[FILENAMELENGTH]; |
char optionfilext[10], optionfilefiname[FILENAMELENGTH], plotcmd[FILENAMELENGTH]; |
char plotcmd[FILENAMELENGTH], pplotcmd[FILENAMELENGTH]; |
char tmpout[FILENAMELENGTH], tmpout2[FILENAMELENGTH]; |
char tmpout[FILENAMELENGTH], tmpout2[FILENAMELENGTH]; |
char command[FILENAMELENGTH]; |
char command[FILENAMELENGTH]; |
int outcmd=0; |
int outcmd=0; |
|
|
char fileres[FILENAMELENGTH], filerespij[FILENAMELENGTH], filereso[FILENAMELENGTH], rfileres[FILENAMELENGTH]; |
char fileres[FILENAMELENGTH], filerespij[FILENAMELENGTH], filerespijb[FILENAMELENGTH], filereso[FILENAMELENGTH], rfileres[FILENAMELENGTH]; |
|
char fileresu[FILENAMELENGTH]; /* fileres without r in front */ |
char filelog[FILENAMELENGTH]; /* Log file */ |
char filelog[FILENAMELENGTH]; /* Log file */ |
char filerest[FILENAMELENGTH]; |
char filerest[FILENAMELENGTH]; |
char fileregp[FILENAMELENGTH]; |
char fileregp[FILENAMELENGTH]; |
Line 296 char popfile[FILENAMELENGTH];
|
Line 882 char popfile[FILENAMELENGTH];
|
|
|
char optionfilegnuplot[FILENAMELENGTH], optionfilehtm[FILENAMELENGTH], optionfilehtmcov[FILENAMELENGTH] ; |
char optionfilegnuplot[FILENAMELENGTH], optionfilehtm[FILENAMELENGTH], optionfilehtmcov[FILENAMELENGTH] ; |
|
|
struct timeval start_time, end_time, curr_time, last_time, forecast_time; |
/* struct timeval start_time, end_time, curr_time, last_time, forecast_time; */ |
struct timezone tzp; |
/* struct timezone tzp; */ |
extern int gettimeofday(); |
/* extern int gettimeofday(); */ |
struct tm tmg, tm, tmf, *gmtime(), *localtime(); |
struct tm tml, *gmtime(), *localtime(); |
long time_value; |
|
extern long time(); |
extern time_t time(); |
|
|
|
struct tm start_time, end_time, curr_time, last_time, forecast_time; |
|
time_t rstart_time, rend_time, rcurr_time, rlast_time, rforecast_time; /* raw time */ |
|
struct tm tm; |
|
|
char strcurr[80], strfor[80]; |
char strcurr[80], strfor[80]; |
|
|
|
char *endptr; |
|
long lval; |
|
double dval; |
|
|
#define NR_END 1 |
#define NR_END 1 |
#define FREE_ARG char* |
#define FREE_ARG char* |
#define FTOL 1.0e-10 |
#define FTOL 1.0e-10 |
Line 327 static double maxarg1,maxarg2;
|
Line 922 static double maxarg1,maxarg2;
|
|
|
#define SIGN(a,b) ((b)>0.0 ? fabs(a) : -fabs(a)) |
#define SIGN(a,b) ((b)>0.0 ? fabs(a) : -fabs(a)) |
#define rint(a) floor(a+0.5) |
#define rint(a) floor(a+0.5) |
|
/* http://www.thphys.uni-heidelberg.de/~robbers/cmbeasy/doc/html/myutils_8h-source.html */ |
|
#define mytinydouble 1.0e-16 |
|
/* #define DEQUAL(a,b) (fabs((a)-(b))<mytinydouble) */ |
|
/* http://www.thphys.uni-heidelberg.de/~robbers/cmbeasy/doc/html/mynrutils_8h-source.html */ |
|
/* static double dsqrarg; */ |
|
/* #define DSQR(a) (DEQUAL((dsqrarg=(a)),0.0) ? 0.0 : dsqrarg*dsqrarg) */ |
static double sqrarg; |
static double sqrarg; |
#define SQR(a) ((sqrarg=(a)) == 0.0 ? 0.0 :sqrarg*sqrarg) |
#define SQR(a) ((sqrarg=(a)) == 0.0 ? 0.0 :sqrarg*sqrarg) |
#define SWAP(a,b) {temp=(a);(a)=(b);(b)=temp;} |
#define SWAP(a,b) {temp=(a);(a)=(b);(b)=temp;} |
Line 342 int estepm;
|
Line 942 int estepm;
|
|
|
int m,nb; |
int m,nb; |
long *num; |
long *num; |
int firstpass=0, lastpass=4,*cod, *ncodemax, *Tage,*cens; |
int firstpass=0, lastpass=4,*cod, *cens; |
|
int *ncodemax; /* ncodemax[j]= Number of modalities of the j th |
|
covariate for which somebody answered excluding |
|
undefined. Usually 2: 0 and 1. */ |
|
int *ncodemaxwundef; /* ncodemax[j]= Number of modalities of the j th |
|
covariate for which somebody answered including |
|
undefined. Usually 3: -1, 0 and 1. */ |
double **agev,*moisnais, *annais, *moisdc, *andc,**mint, **anint; |
double **agev,*moisnais, *annais, *moisdc, *andc,**mint, **anint; |
double **pmmij, ***probs; |
double **pmmij, ***probs; |
double *ageexmed,*agecens; |
double *ageexmed,*agecens; |
Line 350 double dateintmean=0;
|
Line 956 double dateintmean=0;
|
|
|
double *weight; |
double *weight; |
int **s; /* Status */ |
int **s; /* Status */ |
double *agedc, **covar, idx; |
double *agedc; |
int **nbcode, *Tcode, *Tvar, **codtab, **Tvard, *Tprod, cptcovprod, *Tvaraff; |
double **covar; /**< covar[j,i], value of jth covariate for individual i, |
|
* covar=matrix(0,NCOVMAX,1,n); |
|
* cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*age; */ |
|
double idx; |
|
int **nbcode, *Tvar; /**< model=V2 => Tvar[1]= 2 */ |
|
int *Tage; |
|
int *Ndum; /** Freq of modality (tricode */ |
|
/* int **codtab;*/ /**< codtab=imatrix(1,100,1,10); */ |
|
int **Tvard, *Tprod, cptcovprod, *Tvaraff; |
|
double *lsurv, *lpop, *tpop; |
|
|
double ftol=FTOL; /* Tolerance for computing Max Likelihood */ |
double ftol=FTOL; /**< Tolerance for computing Max Likelihood */ |
double ftolhess; /* Tolerance for computing hessian */ |
double ftolhess; /**< Tolerance for computing hessian */ |
|
|
/**************** split *************************/ |
/**************** split *************************/ |
static int split( char *path, char *dirc, char *name, char *ext, char *finame ) |
static int split( char *path, char *dirc, char *name, char *ext, char *finame ) |
{ |
{ |
/* From a file name with full path (either Unix or Windows) we extract the directory (dirc) |
/* From a file name with (full) path (either Unix or Windows) we extract the directory (dirc) |
the name of the file (name), its extension only (ext) and its first part of the name (finame) |
the name of the file (name), its extension only (ext) and its first part of the name (finame) |
*/ |
*/ |
char *ss; /* pointer */ |
char *ss; /* pointer */ |
int l1, l2; /* length counters */ |
int l1=0, l2=0; /* length counters */ |
|
|
l1 = strlen(path ); /* length of path */ |
l1 = strlen(path ); /* length of path */ |
if ( l1 == 0 ) return( GLOCK_ERROR_NOPATH ); |
if ( l1 == 0 ) return( GLOCK_ERROR_NOPATH ); |
ss= strrchr( path, DIRSEPARATOR ); /* find last / */ |
ss= strrchr( path, DIRSEPARATOR ); /* find last / */ |
if ( ss == NULL ) { /* no directory, so use current */ |
if ( ss == NULL ) { /* no directory, so determine current directory */ |
|
strcpy( name, path ); /* we got the fullname name because no directory */ |
/*if(strrchr(path, ODIRSEPARATOR )==NULL) |
/*if(strrchr(path, ODIRSEPARATOR )==NULL) |
printf("Warning you should use %s as a separator\n",DIRSEPARATOR);*/ |
printf("Warning you should use %s as a separator\n",DIRSEPARATOR);*/ |
/* get current working directory */ |
/* get current working directory */ |
/* extern char* getcwd ( char *buf , int len);*/ |
/* extern char* getcwd ( char *buf , int len);*/ |
if ( getcwd( dirc, FILENAME_MAX ) == NULL ) { |
#ifdef WIN32 |
|
if (_getcwd( dirc, FILENAME_MAX ) == NULL ) { |
|
#else |
|
if (getcwd(dirc, FILENAME_MAX) == NULL) { |
|
#endif |
return( GLOCK_ERROR_GETCWD ); |
return( GLOCK_ERROR_GETCWD ); |
} |
} |
strcpy( name, path ); /* we've got it */ |
/* got dirc from getcwd*/ |
} else { /* strip direcotry from path */ |
printf(" DIRC = %s \n",dirc); |
|
} else { /* strip directory from path */ |
ss++; /* after this, the filename */ |
ss++; /* after this, the filename */ |
l2 = strlen( ss ); /* length of filename */ |
l2 = strlen( ss ); /* length of filename */ |
if ( l2 == 0 ) return( GLOCK_ERROR_NOPATH ); |
if ( l2 == 0 ) return( GLOCK_ERROR_NOPATH ); |
strcpy( name, ss ); /* save file name */ |
strcpy( name, ss ); /* save file name */ |
strncpy( dirc, path, l1 - l2 ); /* now the directory */ |
strncpy( dirc, path, l1 - l2 ); /* now the directory */ |
dirc[l1-l2] = 0; /* add zero */ |
dirc[l1-l2] = '\0'; /* add zero */ |
|
printf(" DIRC2 = %s \n",dirc); |
} |
} |
|
/* We add a separator at the end of dirc if not exists */ |
l1 = strlen( dirc ); /* length of directory */ |
l1 = strlen( dirc ); /* length of directory */ |
/*#ifdef windows |
if( dirc[l1-1] != DIRSEPARATOR ){ |
if ( dirc[l1-1] != '\\' ) { dirc[l1] = '\\'; dirc[l1+1] = 0; } |
dirc[l1] = DIRSEPARATOR; |
#else |
dirc[l1+1] = 0; |
if ( dirc[l1-1] != '/' ) { dirc[l1] = '/'; dirc[l1+1] = 0; } |
printf(" DIRC3 = %s \n",dirc); |
#endif |
} |
*/ |
|
ss = strrchr( name, '.' ); /* find last / */ |
ss = strrchr( name, '.' ); /* find last / */ |
if (ss >0){ |
if (ss >0){ |
ss++; |
ss++; |
Line 401 static int split( char *path, char *dirc
|
Line 1023 static int split( char *path, char *dirc
|
strncpy( finame, name, l1-l2); |
strncpy( finame, name, l1-l2); |
finame[l1-l2]= 0; |
finame[l1-l2]= 0; |
} |
} |
|
|
return( 0 ); /* we're done */ |
return( 0 ); /* we're done */ |
} |
} |
|
|
Line 419 void replace_back_to_slash(char *s, char
|
Line 1042 void replace_back_to_slash(char *s, char
|
} |
} |
} |
} |
|
|
|
char *trimbb(char *out, char *in) |
|
{ /* Trim multiple blanks in line but keeps first blanks if line starts with blanks */ |
|
char *s; |
|
s=out; |
|
while (*in != '\0'){ |
|
while( *in == ' ' && *(in+1) == ' '){ /* && *(in+1) != '\0'){*/ |
|
in++; |
|
} |
|
*out++ = *in++; |
|
} |
|
*out='\0'; |
|
return s; |
|
} |
|
|
|
/* char *substrchaine(char *out, char *in, char *chain) */ |
|
/* { */ |
|
/* /\* Substract chain 'chain' from 'in', return and output 'out' *\/ */ |
|
/* char *s, *t; */ |
|
/* t=in;s=out; */ |
|
/* while ((*in != *chain) && (*in != '\0')){ */ |
|
/* *out++ = *in++; */ |
|
/* } */ |
|
|
|
/* /\* *in matches *chain *\/ */ |
|
/* while ((*in++ == *chain++) && (*in != '\0')){ */ |
|
/* printf("*in = %c, *out= %c *chain= %c \n", *in, *out, *chain); */ |
|
/* } */ |
|
/* in--; chain--; */ |
|
/* while ( (*in != '\0')){ */ |
|
/* printf("Bef *in = %c, *out= %c *chain= %c \n", *in, *out, *chain); */ |
|
/* *out++ = *in++; */ |
|
/* printf("Aft *in = %c, *out= %c *chain= %c \n", *in, *out, *chain); */ |
|
/* } */ |
|
/* *out='\0'; */ |
|
/* out=s; */ |
|
/* return out; */ |
|
/* } */ |
|
char *substrchaine(char *out, char *in, char *chain) |
|
{ |
|
/* Substract chain 'chain' from 'in', return and output 'out' */ |
|
/* in="V1+V1*age+age*age+V2", chain="age*age" */ |
|
|
|
char *strloc; |
|
|
|
strcpy (out, in); |
|
strloc = strstr(out, chain); /* strloc points to out at age*age+V2 */ |
|
printf("Bef strloc=%s chain=%s out=%s \n", strloc, chain, out); |
|
if(strloc != NULL){ |
|
/* will affect out */ /* strloc+strlenc(chain)=+V2 */ /* Will also work in Unicode */ |
|
memmove(strloc,strloc+strlen(chain), strlen(strloc+strlen(chain))+1); |
|
/* strcpy (strloc, strloc +strlen(chain));*/ |
|
} |
|
printf("Aft strloc=%s chain=%s in=%s out=%s \n", strloc, chain, in, out); |
|
return out; |
|
} |
|
|
|
|
|
char *cutl(char *blocc, char *alocc, char *in, char occ) |
|
{ |
|
/* cuts string in into blocc and alocc where blocc ends before FIRST occurence of char 'occ' |
|
and alocc starts after first occurence of char 'occ' : ex cutv(blocc,alocc,"abcdef2ghi2j",'2') |
|
gives blocc="abcdef" and alocc="ghi2j". |
|
If occ is not found blocc is null and alocc is equal to in. Returns blocc |
|
*/ |
|
char *s, *t; |
|
t=in;s=in; |
|
while ((*in != occ) && (*in != '\0')){ |
|
*alocc++ = *in++; |
|
} |
|
if( *in == occ){ |
|
*(alocc)='\0'; |
|
s=++in; |
|
} |
|
|
|
if (s == t) {/* occ not found */ |
|
*(alocc-(in-s))='\0'; |
|
in=s; |
|
} |
|
while ( *in != '\0'){ |
|
*blocc++ = *in++; |
|
} |
|
|
|
*blocc='\0'; |
|
return t; |
|
} |
|
char *cutv(char *blocc, char *alocc, char *in, char occ) |
|
{ |
|
/* cuts string in into blocc and alocc where blocc ends before LAST occurence of char 'occ' |
|
and alocc starts after last occurence of char 'occ' : ex cutv(blocc,alocc,"abcdef2ghi2j",'2') |
|
gives blocc="abcdef2ghi" and alocc="j". |
|
If occ is not found blocc is null and alocc is equal to in. Returns alocc |
|
*/ |
|
char *s, *t; |
|
t=in;s=in; |
|
while (*in != '\0'){ |
|
while( *in == occ){ |
|
*blocc++ = *in++; |
|
s=in; |
|
} |
|
*blocc++ = *in++; |
|
} |
|
if (s == t) /* occ not found */ |
|
*(blocc-(in-s))='\0'; |
|
else |
|
*(blocc-(in-s)-1)='\0'; |
|
in=s; |
|
while ( *in != '\0'){ |
|
*alocc++ = *in++; |
|
} |
|
|
|
*alocc='\0'; |
|
return s; |
|
} |
|
|
int nbocc(char *s, char occ) |
int nbocc(char *s, char occ) |
{ |
{ |
int i,j=0; |
int i,j=0; |
Line 431 int nbocc(char *s, char occ)
|
Line 1168 int nbocc(char *s, char occ)
|
return j; |
return j; |
} |
} |
|
|
void cutv(char *u,char *v, char*t, char occ) |
/* void cutv(char *u,char *v, char*t, char occ) */ |
{ |
/* { */ |
/* cuts string t into u and v where u is ended by char occ excluding it |
/* /\* cuts string t into u and v where u ends before last occurence of char 'occ' */ |
and v is after occ excluding it too : ex cutv(u,v,"abcdef2ghi2j",2) |
/* and v starts after last occurence of char 'occ' : ex cutv(u,v,"abcdef2ghi2j",'2') */ |
gives u="abcedf" and v="ghi2j" */ |
/* gives u="abcdef2ghi" and v="j" *\/ */ |
int i,lg,j,p=0; |
/* int i,lg,j,p=0; */ |
i=0; |
/* i=0; */ |
for(j=0; j<=strlen(t)-1; j++) { |
/* lg=strlen(t); */ |
if((t[j]!= occ) && (t[j+1]== occ)) p=j+1; |
/* for(j=0; j<=lg-1; j++) { */ |
} |
/* if((t[j]!= occ) && (t[j+1]== occ)) p=j+1; */ |
|
/* } */ |
|
|
lg=strlen(t); |
/* for(j=0; j<p; j++) { */ |
for(j=0; j<p; j++) { |
/* (u[j] = t[j]); */ |
(u[j] = t[j]); |
/* } */ |
} |
/* u[p]='\0'; */ |
u[p]='\0'; |
|
|
|
for(j=0; j<= lg; j++) { |
/* for(j=0; j<= lg; j++) { */ |
if (j>=(p+1))(v[j-p-1] = t[j]); |
/* if (j>=(p+1))(v[j-p-1] = t[j]); */ |
} |
/* } */ |
|
/* } */ |
|
|
|
#ifdef _WIN32 |
|
char * strsep(char **pp, const char *delim) |
|
{ |
|
char *p, *q; |
|
|
|
if ((p = *pp) == NULL) |
|
return 0; |
|
if ((q = strpbrk (p, delim)) != NULL) |
|
{ |
|
*pp = q + 1; |
|
*q = '\0'; |
|
} |
|
else |
|
*pp = 0; |
|
return p; |
} |
} |
|
#endif |
|
|
/********************** nrerror ********************/ |
/********************** nrerror ********************/ |
|
|
Line 560 double **matrix(long nrl, long nrh, long
|
Line 1315 double **matrix(long nrl, long nrh, long
|
|
|
for (i=nrl+1; i<=nrh; i++) m[i]=m[i-1]+ncol; |
for (i=nrl+1; i<=nrh; i++) m[i]=m[i-1]+ncol; |
return m; |
return m; |
/* print *(*(m+1)+70) or print m[1][70]; print m+1 or print &(m[1]) |
/* print *(*(m+1)+70) or print m[1][70]; print m+1 or print &(m[1]) or &(m[1][0]) |
|
m[i] = address of ith row of the table. &(m[i]) is its value which is another adress |
|
that of m[i][0]. In order to get the value p m[i][0] but it is unitialized. |
*/ |
*/ |
} |
} |
|
|
Line 649 char *subdirf3(char fileres[], char *pre
|
Line 1406 char *subdirf3(char fileres[], char *pre
|
strcat(tmpout,fileres); |
strcat(tmpout,fileres); |
return tmpout; |
return tmpout; |
} |
} |
|
|
|
/*************** function subdirfext ***********/ |
|
char *subdirfext(char fileres[], char *preop, char *postop) |
|
{ |
|
|
|
strcpy(tmpout,preop); |
|
strcat(tmpout,fileres); |
|
strcat(tmpout,postop); |
|
return tmpout; |
|
} |
|
|
|
/*************** function subdirfext3 ***********/ |
|
char *subdirfext3(char fileres[], char *preop, char *postop) |
|
{ |
|
|
|
/* Caution optionfilefiname is hidden */ |
|
strcpy(tmpout,optionfilefiname); |
|
strcat(tmpout,"/"); |
|
strcat(tmpout,preop); |
|
strcat(tmpout,fileres); |
|
strcat(tmpout,postop); |
|
return tmpout; |
|
} |
|
|
|
char *asc_diff_time(long time_sec, char ascdiff[]) |
|
{ |
|
long sec_left, days, hours, minutes; |
|
days = (time_sec) / (60*60*24); |
|
sec_left = (time_sec) % (60*60*24); |
|
hours = (sec_left) / (60*60) ; |
|
sec_left = (sec_left) %(60*60); |
|
minutes = (sec_left) /60; |
|
sec_left = (sec_left) % (60); |
|
sprintf(ascdiff,"%ld day(s) %ld hour(s) %ld minute(s) %ld second(s)",days, hours, minutes, sec_left); |
|
return ascdiff; |
|
} |
|
|
/***************** f1dim *************************/ |
/***************** f1dim *************************/ |
extern int ncom; |
extern int ncom; |
Line 670 double f1dim(double x)
|
Line 1463 double f1dim(double x)
|
|
|
/*****************brent *************************/ |
/*****************brent *************************/ |
double brent(double ax, double bx, double cx, double (*f)(double), double tol, double *xmin) |
double brent(double ax, double bx, double cx, double (*f)(double), double tol, double *xmin) |
{ |
{ |
|
/* Given a function f, and given a bracketing triplet of abscissas ax, bx, cx (such that bx is |
|
* between ax and cx, and f(bx) is less than both f(ax) and f(cx) ), this routine isolates |
|
* the minimum to a fractional precision of about tol using Brent’s method. The abscissa of |
|
* the minimum is returned as xmin, and the minimum function value is returned as brent , the |
|
* returned function value. |
|
*/ |
int iter; |
int iter; |
double a,b,d,etemp; |
double a,b,d,etemp; |
double fu,fv,fw,fx; |
double fu=0,fv,fw,fx; |
double ftemp; |
double ftemp=0.; |
double p,q,r,tol1,tol2,u,v,w,x,xm; |
double p,q,r,tol1,tol2,u,v,w,x,xm; |
double e=0.0; |
double e=0.0; |
|
|
Line 688 double brent(double ax, double bx, doubl
|
Line 1487 double brent(double ax, double bx, doubl
|
/* if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret)))*/ |
/* if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret)))*/ |
printf(".");fflush(stdout); |
printf(".");fflush(stdout); |
fprintf(ficlog,".");fflush(ficlog); |
fprintf(ficlog,".");fflush(ficlog); |
#ifdef DEBUG |
#ifdef DEBUGBRENT |
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); |
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); |
fprintf(ficlog,"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); |
fprintf(ficlog,"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); |
/* if ((fabs(x-xm) <= (tol2-0.5*(b-a)))||(2.0*fabs(fu-ftemp) <= ftol*1.e-2*(fabs(fu)+fabs(ftemp)))) { */ |
/* if ((fabs(x-xm) <= (tol2-0.5*(b-a)))||(2.0*fabs(fu-ftemp) <= ftol*1.e-2*(fabs(fu)+fabs(ftemp)))) { */ |
Line 723 double brent(double ax, double bx, doubl
|
Line 1522 double brent(double ax, double bx, doubl
|
if (fu <= fx) { |
if (fu <= fx) { |
if (u >= x) a=x; else b=x; |
if (u >= x) a=x; else b=x; |
SHFT(v,w,x,u) |
SHFT(v,w,x,u) |
SHFT(fv,fw,fx,fu) |
SHFT(fv,fw,fx,fu) |
} else { |
} else { |
if (u < x) a=u; else b=u; |
if (u < x) a=u; else b=u; |
if (fu <= fw || w == x) { |
if (fu <= fw || w == x) { |
v=w; |
v=w; |
w=u; |
w=u; |
fv=fw; |
fv=fw; |
fw=fu; |
fw=fu; |
} else if (fu <= fv || v == x || v == w) { |
} else if (fu <= fv || v == x || v == w) { |
v=u; |
v=u; |
fv=fu; |
fv=fu; |
} |
} |
} |
} |
} |
} |
nrerror("Too many iterations in brent"); |
nrerror("Too many iterations in brent"); |
*xmin=x; |
*xmin=x; |
Line 746 double brent(double ax, double bx, doubl
|
Line 1545 double brent(double ax, double bx, doubl
|
|
|
void mnbrak(double *ax, double *bx, double *cx, double *fa, double *fb, double *fc, |
void mnbrak(double *ax, double *bx, double *cx, double *fa, double *fb, double *fc, |
double (*func)(double)) |
double (*func)(double)) |
{ |
{ /* Given a function func , and given distinct initial points ax and bx , this routine searches in |
|
the downhill direction (defined by the function as evaluated at the initial points) and returns |
|
new points ax , bx , cx that bracket a minimum of the function. Also returned are the function |
|
values at the three points, fa, fb , and fc such that fa > fb and fb < fc. |
|
*/ |
double ulim,u,r,q, dum; |
double ulim,u,r,q, dum; |
double fu; |
double fu; |
|
|
*fa=(*func)(*ax); |
double scale=10.; |
*fb=(*func)(*bx); |
int iterscale=0; |
|
|
|
*fa=(*func)(*ax); /* xta[j]=pcom[j]+(*ax)*xicom[j]; fa=f(xta[j])*/ |
|
*fb=(*func)(*bx); /* xtb[j]=pcom[j]+(*bx)*xicom[j]; fb=f(xtb[j]) */ |
|
|
|
|
|
/* while(*fb != *fb){ /\* *ax should be ok, reducing distance to *ax *\/ */ |
|
/* printf("Warning mnbrak *fb = %lf, *bx=%lf *ax=%lf *fa==%lf iter=%d\n",*fb, *bx, *ax, *fa, iterscale++); */ |
|
/* *bx = *ax - (*ax - *bx)/scale; */ |
|
/* *fb=(*func)(*bx); /\* xtb[j]=pcom[j]+(*bx)*xicom[j]; fb=f(xtb[j]) *\/ */ |
|
/* } */ |
|
|
if (*fb > *fa) { |
if (*fb > *fa) { |
SHFT(dum,*ax,*bx,dum) |
SHFT(dum,*ax,*bx,dum) |
SHFT(dum,*fb,*fa,dum) |
SHFT(dum,*fb,*fa,dum) |
} |
} |
*cx=(*bx)+GOLD*(*bx-*ax); |
*cx=(*bx)+GOLD*(*bx-*ax); |
*fc=(*func)(*cx); |
*fc=(*func)(*cx); |
while (*fb > *fc) { |
#ifdef DEBUG |
|
printf("mnbrak0 *fb=%.12e *fc=%.12e\n",*fb,*fc); |
|
fprintf(ficlog,"mnbrak0 *fb=%.12e *fc=%.12e\n",*fb,*fc); |
|
#endif |
|
while (*fb > *fc) { /* Declining a,b,c with fa> fb > fc */ |
r=(*bx-*ax)*(*fb-*fc); |
r=(*bx-*ax)*(*fb-*fc); |
q=(*bx-*cx)*(*fb-*fa); |
q=(*bx-*cx)*(*fb-*fa); |
u=(*bx)-((*bx-*cx)*q-(*bx-*ax)*r)/ |
u=(*bx)-((*bx-*cx)*q-(*bx-*ax)*r)/ |
(2.0*SIGN(FMAX(fabs(q-r),TINY),q-r)); |
(2.0*SIGN(FMAX(fabs(q-r),TINY),q-r)); /* Minimum abscissa of a parabolic estimated from (a,fa), (b,fb) and (c,fc). */ |
ulim=(*bx)+GLIMIT*(*cx-*bx); |
ulim=(*bx)+GLIMIT*(*cx-*bx); /* Maximum abscissa where function should be evaluated */ |
if ((*bx-u)*(u-*cx) > 0.0) { |
if ((*bx-u)*(u-*cx) > 0.0) { /* if u_p is between b and c */ |
fu=(*func)(u); |
fu=(*func)(u); |
} else if ((*cx-u)*(u-ulim) > 0.0) { |
#ifdef DEBUG |
|
/* f(x)=A(x-u)**2+f(u) */ |
|
double A, fparabu; |
|
A= (*fb - *fa)/(*bx-*ax)/(*bx+*ax-2*u); |
|
fparabu= *fa - A*(*ax-u)*(*ax-u); |
|
printf("mnbrak (*ax=%.12f, *fa=%.12lf), (*bx=%.12f, *fb=%.12lf), (*cx=%.12f, *fc=%.12lf), (*u=%.12f, fu=%.12lf, fparabu=%.12f)\n",*ax,*fa,*bx,*fb,*cx,*fc,u,fu, fparabu); |
|
fprintf(ficlog, "mnbrak (*ax=%.12f, *fa=%.12lf), (*bx=%.12f, *fb=%.12lf), (*cx=%.12f, *fc=%.12lf), (*u=%.12f, fu=%.12lf, fparabu=%.12f)\n",*ax,*fa,*bx,*fb,*cx,*fc,u,fu, fparabu); |
|
/* And thus,it can be that fu > *fc even if fparabu < *fc */ |
|
/* mnbrak (*ax=7.666299858533, *fa=299039.693133272231), (*bx=8.595447774979, *fb=298976.598289369489), |
|
(*cx=10.098840694817, *fc=298946.631474258087), (*u=9.852501168332, fu=298948.773013752128, fparabu=298945.434711494134) */ |
|
/* In that case, there is no bracket in the output! Routine is wrong with many consequences.*/ |
|
#endif |
|
#ifdef MNBRAKORIGINAL |
|
#else |
|
/* if (fu > *fc) { */ |
|
/* #ifdef DEBUG */ |
|
/* printf("mnbrak4 fu > fc \n"); */ |
|
/* fprintf(ficlog, "mnbrak4 fu > fc\n"); */ |
|
/* #endif */ |
|
/* /\* SHFT(u,*cx,*cx,u) /\\* ie a=c, c=u and u=c; in that case, next SHFT(a,b,c,u) will give a=b=b, b=c=u, c=u=c and *\\/ *\/ */ |
|
/* /\* SHFT(*fa,*fc,fu,*fc) /\\* (b, u, c) is a bracket while test fb > fc will be fu > fc will exit *\\/ *\/ */ |
|
/* dum=u; /\* Shifting c and u *\/ */ |
|
/* u = *cx; */ |
|
/* *cx = dum; */ |
|
/* dum = fu; */ |
|
/* fu = *fc; */ |
|
/* *fc =dum; */ |
|
/* } else { /\* end *\/ */ |
|
/* #ifdef DEBUG */ |
|
/* printf("mnbrak3 fu < fc \n"); */ |
|
/* fprintf(ficlog, "mnbrak3 fu < fc\n"); */ |
|
/* #endif */ |
|
/* dum=u; /\* Shifting c and u *\/ */ |
|
/* u = *cx; */ |
|
/* *cx = dum; */ |
|
/* dum = fu; */ |
|
/* fu = *fc; */ |
|
/* *fc =dum; */ |
|
/* } */ |
|
#ifdef DEBUG |
|
printf("mnbrak34 fu < or >= fc \n"); |
|
fprintf(ficlog, "mnbrak34 fu < fc\n"); |
|
#endif |
|
dum=u; /* Shifting c and u */ |
|
u = *cx; |
|
*cx = dum; |
|
dum = fu; |
|
fu = *fc; |
|
*fc =dum; |
|
#endif |
|
} else if ((*cx-u)*(u-ulim) > 0.0) { /* u is after c but before ulim */ |
|
#ifdef DEBUG |
|
printf("mnbrak2 u after c but before ulim\n"); |
|
fprintf(ficlog, "mnbrak2 u after c but before ulim\n"); |
|
#endif |
fu=(*func)(u); |
fu=(*func)(u); |
if (fu < *fc) { |
if (fu < *fc) { |
SHFT(*bx,*cx,u,*cx+GOLD*(*cx-*bx)) |
#ifdef DEBUG |
SHFT(*fb,*fc,fu,(*func)(u)) |
printf("mnbrak2 u after c but before ulim AND fu < fc\n"); |
} |
fprintf(ficlog, "mnbrak2 u after c but before ulim AND fu <fc \n"); |
} else if ((u-ulim)*(ulim-*cx) >= 0.0) { |
#endif |
|
SHFT(*bx,*cx,u,*cx+GOLD*(*cx-*bx)) |
|
SHFT(*fb,*fc,fu,(*func)(u)) |
|
} |
|
} else if ((u-ulim)*(ulim-*cx) >= 0.0) { /* u outside ulim (verifying that ulim is beyond c) */ |
|
#ifdef DEBUG |
|
printf("mnbrak2 u outside ulim (verifying that ulim is beyond c)\n"); |
|
fprintf(ficlog, "mnbrak2 u outside ulim (verifying that ulim is beyond c)\n"); |
|
#endif |
u=ulim; |
u=ulim; |
fu=(*func)(u); |
fu=(*func)(u); |
} else { |
} else { /* u could be left to b (if r > q parabola has a maximum) */ |
|
#ifdef DEBUG |
|
printf("mnbrak2 u could be left to b (if r > q parabola has a maximum)\n"); |
|
fprintf(ficlog, "mnbrak2 u could be left to b (if r > q parabola has a maximum)\n"); |
|
#endif |
u=(*cx)+GOLD*(*cx-*bx); |
u=(*cx)+GOLD*(*cx-*bx); |
fu=(*func)(u); |
fu=(*func)(u); |
} |
} /* end tests */ |
SHFT(*ax,*bx,*cx,u) |
SHFT(*ax,*bx,*cx,u) |
SHFT(*fa,*fb,*fc,fu) |
SHFT(*fa,*fb,*fc,fu) |
} |
#ifdef DEBUG |
|
printf("mnbrak2 (*ax=%.12f, *fa=%.12lf), (*bx=%.12f, *fb=%.12lf), (*cx=%.12f, *fc=%.12lf), (*u=%.12f, fu=%.12lf)\n",*ax,*fa,*bx,*fb,*cx,*fc,u,fu); |
|
fprintf(ficlog, "mnbrak2 (*ax=%.12f, *fa=%.12lf), (*bx=%.12f, *fb=%.12lf), (*cx=%.12f, *fc=%.12lf), (*u=%.12f, fu=%.12lf)\n",*ax,*fa,*bx,*fb,*cx,*fc,u,fu); |
|
#endif |
|
} /* end while; ie return (a, b, c, fa, fb, fc) such that a < b < c with f(a) > f(b) and fb < f(c) */ |
} |
} |
|
|
/*************** linmin ************************/ |
/*************** linmin ************************/ |
|
/* Given an n -dimensional point p[1..n] and an n -dimensional direction xi[1..n] , moves and |
|
resets p to where the function func(p) takes on a minimum along the direction xi from p , |
|
and replaces xi by the actual vector displacement that p was moved. Also returns as fret |
|
the value of func at the returned location p . This is actually all accomplished by calling the |
|
routines mnbrak and brent .*/ |
int ncom; |
int ncom; |
double *pcom,*xicom; |
double *pcom,*xicom; |
double (*nrfunc)(double []); |
double (*nrfunc)(double []); |
Line 800 void linmin(double p[], double xi[], int
|
Line 1692 void linmin(double p[], double xi[], int
|
int j; |
int j; |
double xx,xmin,bx,ax; |
double xx,xmin,bx,ax; |
double fx,fb,fa; |
double fx,fb,fa; |
|
|
|
#ifdef LINMINORIGINAL |
|
#else |
|
double scale=10., axs, xxs; /* Scale added for infinity */ |
|
#endif |
|
|
ncom=n; |
ncom=n; |
pcom=vector(1,n); |
pcom=vector(1,n); |
xicom=vector(1,n); |
xicom=vector(1,n); |
nrfunc=func; |
nrfunc=func; |
for (j=1;j<=n;j++) { |
for (j=1;j<=n;j++) { |
pcom[j]=p[j]; |
pcom[j]=p[j]; |
xicom[j]=xi[j]; |
xicom[j]=xi[j]; /* Former scale xi[j] of currrent direction i */ |
} |
} |
ax=0.0; |
|
xx=1.0; |
#ifdef LINMINORIGINAL |
mnbrak(&ax,&xx,&bx,&fa,&fx,&fb,f1dim); |
xx=1.; |
*fret=brent(ax,xx,bx,f1dim,TOL,&xmin); |
#else |
|
axs=0.0; |
|
xxs=1.; |
|
do{ |
|
xx= xxs; |
|
#endif |
|
ax=0.; |
|
mnbrak(&ax,&xx,&bx,&fa,&fx,&fb,f1dim); /* Outputs: xtx[j]=pcom[j]+(*xx)*xicom[j]; fx=f(xtx[j]) */ |
|
/* brackets with inputs ax=0 and xx=1, but points, pcom=p, and directions values, xicom=xi, are sent via f1dim(x) */ |
|
/* xt[x,j]=pcom[j]+x*xicom[j] f(ax) = f(xt(a,j=1,n)) = f(p(j) + 0 * xi(j)) and f(xx) = f(xt(x, j=1,n)) = f(p(j) + 1 * xi(j)) */ |
|
/* Outputs: fa=f(p(j)) and fx=f(p(j) + xxs * xi(j) ) and f(bx)= f(p(j)+ bx* xi(j)) */ |
|
/* Given input ax=axs and xx=xxs, xx might be too far from ax to get a finite f(xx) */ |
|
/* Searches on line, outputs (ax, xx, bx) such that fx < min(fa and fb) */ |
|
/* Find a bracket a,x,b in direction n=xi ie xicom, order may change. Scale is [0:xxs*xi[j]] et non plus [0:xi[j]]*/ |
|
#ifdef LINMINORIGINAL |
|
#else |
|
if (fx != fx){ |
|
xxs=xxs/scale; /* Trying a smaller xx, closer to initial ax=0 */ |
|
printf("|"); |
|
fprintf(ficlog,"|"); |
|
#ifdef DEBUGLINMIN |
|
printf("\nLinmin NAN : input [axs=%lf:xxs=%lf], mnbrak outputs fx=%lf <(fb=%lf and fa=%lf) with xx=%lf in [ax=%lf:bx=%lf] \n", axs, xxs, fx,fb, fa, xx, ax, bx); |
|
#endif |
|
} |
|
}while(fx != fx); |
|
#endif |
|
|
|
#ifdef DEBUGLINMIN |
|
printf("\nLinmin after mnbrak: ax=%12.7f xx=%12.7f bx=%12.7f fa=%12.2f fx=%12.2f fb=%12.2f\n", ax,xx,bx,fa,fx,fb); |
|
fprintf(ficlog,"\nLinmin after mnbrak: ax=%12.7f xx=%12.7f bx=%12.7f fa=%12.2f fx=%12.2f fb=%12.2f\n", ax,xx,bx,fa,fx,fb); |
|
#endif |
|
*fret=brent(ax,xx,bx,f1dim,TOL,&xmin); /* Giving a bracketting triplet (ax, xx, bx), find a minimum, xmin, according to f1dim, *fret(xmin),*/ |
|
/* fa = f(p[j] + ax * xi[j]), fx = f(p[j] + xx * xi[j]), fb = f(p[j] + bx * xi[j]) */ |
|
/* fmin = f(p[j] + xmin * xi[j]) */ |
|
/* P+lambda n in that direction (lambdamin), with TOL between abscisses */ |
|
/* f1dim(xmin): for (j=1;j<=ncom;j++) xt[j]=pcom[j]+xmin*xicom[j]; */ |
#ifdef DEBUG |
#ifdef DEBUG |
printf("retour brent fret=%.12e xmin=%.12e\n",*fret,xmin); |
printf("retour brent fret=%.12e xmin=%.12e\n",*fret,xmin); |
fprintf(ficlog,"retour brent fret=%.12e xmin=%.12e\n",*fret,xmin); |
fprintf(ficlog,"retour brent fret=%.12e xmin=%.12e\n",*fret,xmin); |
#endif |
#endif |
|
#ifdef DEBUGLINMIN |
|
printf("linmin end "); |
|
fprintf(ficlog,"linmin end "); |
|
#endif |
for (j=1;j<=n;j++) { |
for (j=1;j<=n;j++) { |
|
#ifdef LINMINORIGINAL |
xi[j] *= xmin; |
xi[j] *= xmin; |
p[j] += xi[j]; |
#else |
|
#ifdef DEBUGLINMIN |
|
if(xxs <1.0) |
|
printf(" before xi[%d]=%12.8f", j,xi[j]); |
|
#endif |
|
xi[j] *= xmin*xxs; /* xi rescaled by xmin and number of loops: if xmin=-1.237 and xi=(1,0,...,0) xi=(-1.237,0,...,0) */ |
|
#ifdef DEBUGLINMIN |
|
if(xxs <1.0) |
|
printf(" after xi[%d]=%12.8f, xmin=%12.8f, ax=%12.8f, xx=%12.8f, bx=%12.8f, xxs=%12.8f", j,xi[j], xmin, ax, xx, bx,xxs ); |
|
#endif |
|
#endif |
|
p[j] += xi[j]; /* Parameters values are updated accordingly */ |
} |
} |
|
#ifdef DEBUGLINMIN |
|
printf("\n"); |
|
printf("Comparing last *frec(xmin=%12.8f)=%12.8f from Brent and frec(0.)=%12.8f \n", xmin, *fret, (*func)(p)); |
|
fprintf(ficlog,"Comparing last *frec(xmin=%12.8f)=%12.8f from Brent and frec(0.)=%12.8f \n", xmin, *fret, (*func)(p)); |
|
for (j=1;j<=n;j++) { |
|
printf(" xi[%d]= %14.10f p[%d]= %12.7f",j,xi[j],j,p[j]); |
|
fprintf(ficlog," xi[%d]= %14.10f p[%d]= %12.7f",j,xi[j],j,p[j]); |
|
if(j % ncovmodel == 0){ |
|
printf("\n"); |
|
fprintf(ficlog,"\n"); |
|
} |
|
} |
|
#else |
|
#endif |
free_vector(xicom,1,n); |
free_vector(xicom,1,n); |
free_vector(pcom,1,n); |
free_vector(pcom,1,n); |
} |
} |
|
|
char *asc_diff_time(long time_sec, char ascdiff[]) |
|
{ |
|
long sec_left, days, hours, minutes; |
|
days = (time_sec) / (60*60*24); |
|
sec_left = (time_sec) % (60*60*24); |
|
hours = (sec_left) / (60*60) ; |
|
sec_left = (sec_left) %(60*60); |
|
minutes = (sec_left) /60; |
|
sec_left = (sec_left) % (60); |
|
sprintf(ascdiff,"%d day(s) %d hour(s) %d minute(s) %d second(s)",days, hours, minutes, sec_left); |
|
return ascdiff; |
|
} |
|
|
|
/*************** powell ************************/ |
/*************** powell ************************/ |
|
/* |
|
Minimization of a function func of n variables. Input consists of an initial starting point |
|
p[1..n] ; an initial matrix xi[1..n][1..n] , whose columns contain the initial set of di- |
|
rections (usually the n unit vectors); and ftol , the fractional tolerance in the function value |
|
such that failure to decrease by more than this amount on one iteration signals doneness. On |
|
output, p is set to the best point found, xi is the then-current direction set, fret is the returned |
|
function value at p , and iter is the number of iterations taken. The routine linmin is used. |
|
*/ |
void powell(double p[], double **xi, int n, double ftol, int *iter, double *fret, |
void powell(double p[], double **xi, int n, double ftol, int *iter, double *fret, |
double (*func)(double [])) |
double (*func)(double [])) |
{ |
{ |
Line 846 void powell(double p[], double **xi, int
|
Line 1804 void powell(double p[], double **xi, int
|
double (*func)(double [])); |
double (*func)(double [])); |
int i,ibig,j; |
int i,ibig,j; |
double del,t,*pt,*ptt,*xit; |
double del,t,*pt,*ptt,*xit; |
|
double directest; |
double fp,fptt; |
double fp,fptt; |
double *xits; |
double *xits; |
int niterf, itmp; |
int niterf, itmp; |
Line 856 void powell(double p[], double **xi, int
|
Line 1815 void powell(double p[], double **xi, int
|
xits=vector(1,n); |
xits=vector(1,n); |
*fret=(*func)(p); |
*fret=(*func)(p); |
for (j=1;j<=n;j++) pt[j]=p[j]; |
for (j=1;j<=n;j++) pt[j]=p[j]; |
|
rcurr_time = time(NULL); |
for (*iter=1;;++(*iter)) { |
for (*iter=1;;++(*iter)) { |
fp=(*fret); |
fp=(*fret); /* From former iteration or initial value */ |
ibig=0; |
ibig=0; |
del=0.0; |
del=0.0; |
last_time=curr_time; |
rlast_time=rcurr_time; |
(void) gettimeofday(&curr_time,&tzp); |
/* (void) gettimeofday(&curr_time,&tzp); */ |
printf("\nPowell iter=%d -2*LL=%.12f %ld sec. %ld sec.",*iter,*fret, curr_time.tv_sec-last_time.tv_sec, curr_time.tv_sec-start_time.tv_sec);fflush(stdout); |
rcurr_time = time(NULL); |
/* fprintf(ficlog,"\nPowell iter=%d -2*LL=%.12f %ld sec. %ld sec.",*iter,*fret, curr_time.tv_sec-last_time.tv_sec, curr_time.tv_sec-start_time.tv_sec); |
curr_time = *localtime(&rcurr_time); |
fprintf(ficrespow,"%d %.12f %ld",*iter,*fret,curr_time.tv_sec-start_time.tv_sec); |
printf("\nPowell iter=%d -2*LL=%.12f %ld sec. %ld sec.",*iter,*fret, rcurr_time-rlast_time, rcurr_time-rstart_time);fflush(stdout); |
*/ |
fprintf(ficlog,"\nPowell iter=%d -2*LL=%.12f %ld sec. %ld sec.",*iter,*fret,rcurr_time-rlast_time, rcurr_time-rstart_time); fflush(ficlog); |
for (i=1;i<=n;i++) { |
/* fprintf(ficrespow,"%d %.12f %ld",*iter,*fret,curr_time.tm_sec-start_time.tm_sec); */ |
|
for (i=1;i<=n;i++) { |
printf(" %d %.12f",i, p[i]); |
printf(" %d %.12f",i, p[i]); |
fprintf(ficlog," %d %.12lf",i, p[i]); |
fprintf(ficlog," %d %.12lf",i, p[i]); |
fprintf(ficrespow," %.12lf", p[i]); |
fprintf(ficrespow," %.12lf", p[i]); |
Line 875 void powell(double p[], double **xi, int
|
Line 1836 void powell(double p[], double **xi, int
|
fprintf(ficlog,"\n"); |
fprintf(ficlog,"\n"); |
fprintf(ficrespow,"\n");fflush(ficrespow); |
fprintf(ficrespow,"\n");fflush(ficrespow); |
if(*iter <=3){ |
if(*iter <=3){ |
tm = *localtime(&curr_time.tv_sec); |
tml = *localtime(&rcurr_time); |
strcpy(strcurr,asctime(&tmf)); |
strcpy(strcurr,asctime(&tml)); |
/* asctime_r(&tm,strcurr); */ |
rforecast_time=rcurr_time; |
forecast_time=curr_time; |
|
itmp = strlen(strcurr); |
itmp = strlen(strcurr); |
if(strcurr[itmp-1]=='\n') |
if(strcurr[itmp-1]=='\n') /* Windows outputs with a new line */ |
strcurr[itmp-1]='\0'; |
strcurr[itmp-1]='\0'; |
printf("\nConsidering the time needed for this last iteration #%d: %ld seconds,\n",*iter,curr_time.tv_sec-last_time.tv_sec); |
printf("\nConsidering the time needed for the last iteration #%d: %ld seconds,\n",*iter,rcurr_time-rlast_time); |
fprintf(ficlog,"\nConsidering the time needed for this last iteration #%d: %ld seconds,\n",*iter,curr_time.tv_sec-last_time.tv_sec); |
fprintf(ficlog,"\nConsidering the time needed for this last iteration #%d: %ld seconds,\n",*iter,rcurr_time-rlast_time); |
for(niterf=10;niterf<=30;niterf+=10){ |
for(niterf=10;niterf<=30;niterf+=10){ |
forecast_time.tv_sec=curr_time.tv_sec+(niterf-*iter)*(curr_time.tv_sec-last_time.tv_sec); |
rforecast_time=rcurr_time+(niterf-*iter)*(rcurr_time-rlast_time); |
tmf = *localtime(&forecast_time.tv_sec); |
forecast_time = *localtime(&rforecast_time); |
/* asctime_r(&tmf,strfor); */ |
strcpy(strfor,asctime(&forecast_time)); |
strcpy(strfor,asctime(&tmf)); |
|
itmp = strlen(strfor); |
itmp = strlen(strfor); |
if(strfor[itmp-1]=='\n') |
if(strfor[itmp-1]=='\n') |
strfor[itmp-1]='\0'; |
strfor[itmp-1]='\0'; |
printf(" - if your program needs %d iterations to converge, convergence will be \n reached in %s or\n on %s (current time is %s);\n",niterf, asc_diff_time(forecast_time.tv_sec-curr_time.tv_sec,tmpout),strfor,strcurr); |
printf(" - if your program needs %d iterations to converge, convergence will be \n reached in %s i.e.\n on %s (current time is %s);\n",niterf, asc_diff_time(rforecast_time-rcurr_time,tmpout),strfor,strcurr); |
fprintf(ficlog," - if your program needs %d iterations to converge, convergence will be \n reached in %s or\n on %s (current time is %s);\n",niterf, asc_diff_time(forecast_time.tv_sec-curr_time.tv_sec,tmpout),strfor,strcurr); |
fprintf(ficlog," - if your program needs %d iterations to converge, convergence will be \n reached in %s i.e.\n on %s (current time is %s);\n",niterf, asc_diff_time(rforecast_time-rcurr_time,tmpout),strfor,strcurr); |
} |
} |
} |
} |
for (i=1;i<=n;i++) { |
for (i=1;i<=n;i++) { /* For each direction i */ |
for (j=1;j<=n;j++) xit[j]=xi[j][i]; |
for (j=1;j<=n;j++) xit[j]=xi[j][i]; /* Directions stored from previous iteration with previous scales */ |
fptt=(*fret); |
fptt=(*fret); |
#ifdef DEBUG |
#ifdef DEBUG |
printf("fret=%lf \n",*fret); |
printf("fret=%lf, %lf, %lf \n", *fret, *fret, *fret); |
fprintf(ficlog,"fret=%lf \n",*fret); |
fprintf(ficlog, "fret=%lf, %lf, %lf \n", *fret, *fret, *fret); |
#endif |
#endif |
printf("%d",i);fflush(stdout); |
printf("%d",i);fflush(stdout); /* print direction (parameter) i */ |
fprintf(ficlog,"%d",i);fflush(ficlog); |
fprintf(ficlog,"%d",i);fflush(ficlog); |
linmin(p,xit,n,fret,func); |
linmin(p,xit,n,fret,func); /* Point p[n]. xit[n] has been loaded for direction i as input.*/ |
if (fabs(fptt-(*fret)) > del) { |
/* Outputs are fret(new point p) p is updated and xit rescaled */ |
|
if (fabs(fptt-(*fret)) > del) { /* We are keeping the max gain on each of the n directions */ |
|
/* because that direction will be replaced unless the gain del is small */ |
|
/* in comparison with the 'probable' gain, mu^2, with the last average direction. */ |
|
/* Unless the n directions are conjugate some gain in the determinant may be obtained */ |
|
/* with the new direction. */ |
del=fabs(fptt-(*fret)); |
del=fabs(fptt-(*fret)); |
ibig=i; |
ibig=i; |
} |
} |
Line 919 void powell(double p[], double **xi, int
|
Line 1883 void powell(double p[], double **xi, int
|
fprintf(ficlog," x(%d)=%.12e",j,xit[j]); |
fprintf(ficlog," x(%d)=%.12e",j,xit[j]); |
} |
} |
for(j=1;j<=n;j++) { |
for(j=1;j<=n;j++) { |
printf(" p=%.12e",p[j]); |
printf(" p(%d)=%.12e",j,p[j]); |
fprintf(ficlog," p=%.12e",p[j]); |
fprintf(ficlog," p(%d)=%.12e",j,p[j]); |
} |
} |
printf("\n"); |
printf("\n"); |
fprintf(ficlog,"\n"); |
fprintf(ficlog,"\n"); |
#endif |
#endif |
} |
} /* end loop on each direction i */ |
if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret))) { |
/* Convergence test will use last linmin estimation (fret) and compare former iteration (fp) */ |
|
/* But p and xit have been updated at the end of linmin, *fret corresponds to new p, xit */ |
|
/* New value of last point Pn is not computed, P(n-1) */ |
|
if (2.0*fabs(fp-(*fret)) <= ftol*(fabs(fp)+fabs(*fret))) { /* Did we reach enough precision? */ |
|
/* We could compare with a chi^2. chisquare(0.95,ddl=1)=3.84 */ |
|
/* By adding age*age in a model, the new -2LL should be lower and the difference follows a */ |
|
/* a chisquare statistics with 1 degree. To be significant at the 95% level, it should have */ |
|
/* decreased of more than 3.84 */ |
|
/* By adding age*age and V1*age the gain (-2LL) should be more than 5.99 (ddl=2) */ |
|
/* By using V1+V2+V3, the gain should be 7.82, compared with basic 1+age. */ |
|
/* By adding 10 parameters more the gain should be 18.31 */ |
|
|
|
/* Starting the program with initial values given by a former maximization will simply change */ |
|
/* the scales of the directions and the directions, because the are reset to canonical directions */ |
|
/* Thus the first calls to linmin will give new points and better maximizations until fp-(*fret) is */ |
|
/* under the tolerance value. If the tolerance is very small 1.e-9, it could last long. */ |
#ifdef DEBUG |
#ifdef DEBUG |
int k[2],l; |
int k[2],l; |
k[0]=1; |
k[0]=1; |
Line 956 void powell(double p[], double **xi, int
|
Line 1935 void powell(double p[], double **xi, int
|
free_vector(ptt,1,n); |
free_vector(ptt,1,n); |
free_vector(pt,1,n); |
free_vector(pt,1,n); |
return; |
return; |
} |
} /* enough precision */ |
if (*iter == ITMAX) nrerror("powell exceeding maximum iterations."); |
if (*iter == ITMAX) nrerror("powell exceeding maximum iterations."); |
for (j=1;j<=n;j++) { |
for (j=1;j<=n;j++) { /* Computes the extrapolated point P_0 + 2 (P_n-P_0) */ |
ptt[j]=2.0*p[j]-pt[j]; |
ptt[j]=2.0*p[j]-pt[j]; |
xit[j]=p[j]-pt[j]; |
xit[j]=p[j]-pt[j]; |
pt[j]=p[j]; |
pt[j]=p[j]; |
} |
} |
fptt=(*func)(ptt); |
fptt=(*func)(ptt); /* f_3 */ |
if (fptt < fp) { |
#ifdef POWELLF1F3 |
t=2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del)-del*SQR(fp-fptt); |
#else |
if (t < 0.0) { |
if (fptt < fp) { /* If extrapolated point is better, decide if we keep that new direction or not */ |
linmin(p,xit,n,fret,func); |
#endif |
|
/* (x1 f1=fp), (x2 f2=*fret), (x3 f3=fptt), (xm fm) */ |
|
/* From x1 (P0) distance of x2 is at h and x3 is 2h */ |
|
/* Let f"(x2) be the 2nd derivative equal everywhere. */ |
|
/* Then the parabolic through (x1,f1), (x2,f2) and (x3,f3) */ |
|
/* will reach at f3 = fm + h^2/2 f"m ; f" = (f1 -2f2 +f3 ) / h**2 */ |
|
/* Conditional for using this new direction is that mu^2 = (f1-2f2+f3)^2 /2 < del */ |
|
/* t=2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del)-del*SQR(fp-fptt); */ |
|
#ifdef NRCORIGINAL |
|
t=2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del)- del*SQR(fp-fptt); /* Original Numerical Recipes in C*/ |
|
#else |
|
t=2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del); /* Intel compiler doesn't work on one line; bug reported */ |
|
t= t- del*SQR(fp-fptt); |
|
#endif |
|
directest = fp-2.0*(*fret)+fptt - 2.0 * del; /* If delta was big enough we change it for a new direction */ |
|
#ifdef DEBUG |
|
printf("t1= %.12lf, t2= %.12lf, t=%.12lf directest=%.12lf\n", 2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del),del*SQR(fp-fptt),t,directest); |
|
fprintf(ficlog,"t1= %.12lf, t2= %.12lf, t=%.12lf directest=%.12lf\n", 2.0*(fp-2.0*(*fret)+fptt)*SQR(fp-(*fret)-del),del*SQR(fp-fptt),t,directest); |
|
printf("t3= %.12lf, t4= %.12lf, t3*= %.12lf, t4*= %.12lf\n",SQR(fp-(*fret)-del),SQR(fp-fptt), |
|
(fp-(*fret)-del)*(fp-(*fret)-del),(fp-fptt)*(fp-fptt)); |
|
fprintf(ficlog,"t3= %.12lf, t4= %.12lf, t3*= %.12lf, t4*= %.12lf\n",SQR(fp-(*fret)-del),SQR(fp-fptt), |
|
(fp-(*fret)-del)*(fp-(*fret)-del),(fp-fptt)*(fp-fptt)); |
|
printf("tt= %.12lf, t=%.12lf\n",2.0*(fp-2.0*(*fret)+fptt)*(fp-(*fret)-del)*(fp-(*fret)-del)-del*(fp-fptt)*(fp-fptt),t); |
|
fprintf(ficlog, "tt= %.12lf, t=%.12lf\n",2.0*(fp-2.0*(*fret)+fptt)*(fp-(*fret)-del)*(fp-(*fret)-del)-del*(fp-fptt)*(fp-fptt),t); |
|
#endif |
|
#ifdef POWELLORIGINAL |
|
if (t < 0.0) { /* Then we use it for new direction */ |
|
#else |
|
if (directest*t < 0.0) { /* Contradiction between both tests */ |
|
printf("directest= %.12lf (if <0 we include P0 Pn as new direction), t= %.12lf, f1= %.12lf,f2= %.12lf,f3= %.12lf, del= %.12lf\n",directest, t, fp,(*fret),fptt,del); |
|
printf("f1-2f2+f3= %.12lf, f1-f2-del= %.12lf, f1-f3= %.12lf\n",fp-2.0*(*fret)+fptt, fp -(*fret) -del, fp-fptt); |
|
fprintf(ficlog,"directest= %.12lf (if <0 we include P0 Pn as new direction), t= %.12lf, f1= %.12lf,f2= %.12lf,f3= %.12lf, del= %.12lf\n",directest, t, fp,(*fret),fptt, del); |
|
fprintf(ficlog,"f1-2f2+f3= %.12lf, f1-f2-del= %.12lf, f1-f3= %.12lf\n",fp-2.0*(*fret)+fptt, fp -(*fret) -del, fp-fptt); |
|
} |
|
if (directest < 0.0) { /* Then we use it for new direction */ |
|
#endif |
|
#ifdef DEBUGLINMIN |
|
printf("Before linmin in direction P%d-P0\n",n); |
|
for (j=1;j<=n;j++) { |
|
printf(" Before xit[%d]= %12.7f p[%d]= %12.7f",j,xit[j],j,p[j]); |
|
fprintf(ficlog," Before xit[%d]= %12.7f p[%d]= %12.7f",j,xit[j],j,p[j]); |
|
if(j % ncovmodel == 0){ |
|
printf("\n"); |
|
fprintf(ficlog,"\n"); |
|
} |
|
} |
|
#endif |
|
linmin(p,xit,n,fret,func); /* computes minimum on the extrapolated direction: changes p and rescales xit.*/ |
|
#ifdef DEBUGLINMIN |
|
for (j=1;j<=n;j++) { |
|
printf("After xit[%d]= %12.7f p[%d]= %12.7f",j,xit[j],j,p[j]); |
|
fprintf(ficlog,"After xit[%d]= %12.7f p[%d]= %12.7f",j,xit[j],j,p[j]); |
|
if(j % ncovmodel == 0){ |
|
printf("\n"); |
|
fprintf(ficlog,"\n"); |
|
} |
|
} |
|
#endif |
for (j=1;j<=n;j++) { |
for (j=1;j<=n;j++) { |
xi[j][ibig]=xi[j][n]; |
xi[j][ibig]=xi[j][n]; /* Replace direction with biggest decrease by last direction n */ |
xi[j][n]=xit[j]; |
xi[j][n]=xit[j]; /* and this nth direction by the by the average p_0 p_n */ |
} |
} |
|
printf("Gaining to use new average direction of P0 P%d instead of biggest increase direction %d :\n",n,ibig); |
|
fprintf(ficlog,"Gaining to use new average direction of P0 P%d instead of biggest increase direction %d :\n",n,ibig); |
|
|
#ifdef DEBUG |
#ifdef DEBUG |
printf("Direction changed last moved %d in place of ibig=%d, new last is the average:\n",n,ibig); |
printf("Direction changed last moved %d in place of ibig=%d, new last is the average:\n",n,ibig); |
fprintf(ficlog,"Direction changed last moved %d in place of ibig=%d, new last is the average:\n",n,ibig); |
fprintf(ficlog,"Direction changed last moved %d in place of ibig=%d, new last is the average:\n",n,ibig); |
Line 982 void powell(double p[], double **xi, int
|
Line 2021 void powell(double p[], double **xi, int
|
printf("\n"); |
printf("\n"); |
fprintf(ficlog,"\n"); |
fprintf(ficlog,"\n"); |
#endif |
#endif |
} |
} /* end of t or directest negative */ |
} |
#ifdef POWELLF1F3 |
} |
#else |
|
} /* end if (fptt < fp) */ |
|
#endif |
|
} /* loop iteration */ |
} |
} |
|
|
/**** Prevalence limit (stable prevalence) ****************/ |
/**** Prevalence limit (stable or period prevalence) ****************/ |
|
|
double **prevalim(double **prlim, int nlstate, double x[], double age, double **oldm, double **savm, double ftolpl, int ij) |
double **prevalim(double **prlim, int nlstate, double x[], double age, double **oldm, double **savm, double ftolpl, int *ncvyear, int ij) |
{ |
{ |
/* Computes the prevalence limit in each live state at age x by left multiplying the unit |
/* Computes the prevalence limit in each live state at age x by left multiplying the unit |
matrix by transitions matrix until convergence is reached */ |
matrix by transitions matrix until convergence is reached with precision ftolpl */ |
|
/* Wx= Wx-1 Px-1= Wx-2 Px-2 Px-1 = Wx-n Px-n ... Px-2 Px-1 I */ |
|
/* Wx is row vector: population in state 1, population in state 2, population dead */ |
|
/* or prevalence in state 1, prevalence in state 2, 0 */ |
|
/* newm is the matrix after multiplications, its rows are identical at a factor */ |
|
/* Initial matrix pimij */ |
|
/* {0.85204250825084937, 0.13044499163996345, 0.017512500109187184, */ |
|
/* 0.090851990222114765, 0.88271245433047185, 0.026435555447413338, */ |
|
/* 0, 0 , 1} */ |
|
/* |
|
* and after some iteration: */ |
|
/* {0.45504275246439968, 0.42731458730878791, 0.11764266022681241, */ |
|
/* 0.45201005341706885, 0.42865420071559901, 0.11933574586733192, */ |
|
/* 0, 0 , 1} */ |
|
/* And prevalence by suppressing the deaths are close to identical rows in prlim: */ |
|
/* {0.51571254859325999, 0.4842874514067399, */ |
|
/* 0.51326036147820708, 0.48673963852179264} */ |
|
/* If we start from prlim again, prlim tends to a constant matrix */ |
|
|
int i, ii,j,k; |
int i, ii,j,k; |
double min, max, maxmin, maxmax,sumnew=0.; |
double *min, *max, *meandiff, maxmax,sumnew=0.; |
double **matprod2(); |
/* double **matprod2(); */ /* test */ |
double **out, cov[NCOVMAX], **pmij(); |
double **out, cov[NCOVMAX+1], **pmij(); |
double **newm; |
double **newm; |
double agefin, delaymax=50 ; /* Max number of years to converge */ |
double agefin, delaymax=200. ; /* 100 Max number of years to converge */ |
|
int ncvloop=0; |
|
|
|
min=vector(1,nlstate); |
|
max=vector(1,nlstate); |
|
meandiff=vector(1,nlstate); |
|
|
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (j=1;j<=nlstate+ndeath;j++){ |
for (j=1;j<=nlstate+ndeath;j++){ |
oldm[ii][j]=(ii==j ? 1.0 : 0.0); |
oldm[ii][j]=(ii==j ? 1.0 : 0.0); |
} |
} |
|
|
cov[1]=1.; |
cov[1]=1.; |
|
|
/* Even if hstepm = 1, at least one multiplication by the unit matrix */ |
/* Even if hstepm = 1, at least one multiplication by the unit matrix */ |
|
/* Start at agefin= age, computes the matrix of passage and loops decreasing agefin until convergence is reached */ |
for(agefin=age-stepm/YEARM; agefin>=age-delaymax; agefin=agefin-stepm/YEARM){ |
for(agefin=age-stepm/YEARM; agefin>=age-delaymax; agefin=agefin-stepm/YEARM){ |
|
ncvloop++; |
newm=savm; |
newm=savm; |
/* Covariates have to be included here again */ |
/* Covariates have to be included here again */ |
cov[2]=agefin; |
cov[2]=agefin; |
|
if(nagesqr==1) |
for (k=1; k<=cptcovn;k++) { |
cov[3]= agefin*agefin;; |
cov[2+k]=nbcode[Tvar[k]][codtab[ij][Tvar[k]]]; |
for (k=1; k<=cptcovn;k++) { |
/* printf("ij=%d k=%d Tvar[k]=%d nbcode=%d cov=%lf codtab[ij][Tvar[k]]=%d \n",ij,k, Tvar[k],nbcode[Tvar[k]][codtab[ij][Tvar[k]]],cov[2+k], codtab[ij][Tvar[k]]);*/ |
/* cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(ij,Tvar[k])]; */ |
} |
cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(ij,k)]; |
for (k=1; k<=cptcovage;k++) cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2]; |
/* printf("prevalim ij=%d k=%d Tvar[%d]=%d nbcode=%d cov=%lf codtabm(%d,Tvar[%d])=%d \n",ij,k, k, Tvar[k],nbcode[Tvar[k]][codtabm(ij,Tvar[k])],cov[2+k], ij, k, codtabm(ij,Tvar[k])]); */ |
for (k=1; k<=cptcovprod;k++) |
} |
cov[2+Tprod[k]]=nbcode[Tvard[k][1]][codtab[ij][Tvard[k][1]]]*nbcode[Tvard[k][2]][codtab[ij][Tvard[k][2]]]; |
/*wrong? for (k=1; k<=cptcovage;k++) cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2]; */ |
|
/* for (k=1; k<=cptcovage;k++) cov[2+nagesqr+Tage[k]]=nbcode[Tvar[k]][codtabm(ij,Tvar[k])]*cov[2]; */ |
/*printf("ij=%d cptcovprod=%d tvar=%d ", ij, cptcovprod, Tvar[1]);*/ |
for (k=1; k<=cptcovage;k++) cov[2+nagesqr+Tage[k]]=nbcode[Tvar[k]][codtabm(ij,k)]*cov[2]; |
/*printf("ij=%d cov[3]=%lf cov[4]=%lf \n",ij, cov[3],cov[4]);*/ |
for (k=1; k<=cptcovprod;k++) /* Useless */ |
/*printf("ij=%d cov[3]=%lf \n",ij, cov[3]);*/ |
/* cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,Tvard[k][1])] * nbcode[Tvard[k][2]][codtabm(ij,Tvard[k][2])]; */ |
out=matprod2(newm, pmij(pmmij,cov,ncovmodel,x,nlstate),1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, oldm); |
cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,k)] * nbcode[Tvard[k][2]][codtabm(ij,k)]; |
|
|
|
/*printf("ij=%d cptcovprod=%d tvar=%d ", ij, cptcovprod, Tvar[1]);*/ |
|
/*printf("ij=%d cov[3]=%lf cov[4]=%lf \n",ij, cov[3],cov[4]);*/ |
|
/*printf("ij=%d cov[3]=%lf \n",ij, cov[3]);*/ |
|
/* savm=pmij(pmmij,cov,ncovmodel,x,nlstate); */ |
|
/* out=matprod2(newm, pmij(pmmij,cov,ncovmodel,x,nlstate),1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, oldm); /\* Bug Valgrind *\/ */ |
|
out=matprod2(newm, pmij(pmmij,cov,ncovmodel,x,nlstate),1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, oldm); /* Bug Valgrind */ |
|
|
savm=oldm; |
savm=oldm; |
oldm=newm; |
oldm=newm; |
maxmax=0.; |
|
for(j=1;j<=nlstate;j++){ |
for(j=1; j<=nlstate; j++){ |
min=1.; |
max[j]=0.; |
max=0.; |
min[j]=1.; |
for(i=1; i<=nlstate; i++) { |
} |
sumnew=0; |
for(i=1;i<=nlstate;i++){ |
for(k=1; k<=ndeath; k++) sumnew+=newm[i][nlstate+k]; |
sumnew=0; |
|
for(k=1; k<=ndeath; k++) sumnew+=newm[i][nlstate+k]; |
|
for(j=1; j<=nlstate; j++){ |
prlim[i][j]= newm[i][j]/(1-sumnew); |
prlim[i][j]= newm[i][j]/(1-sumnew); |
max=FMAX(max,prlim[i][j]); |
max[j]=FMAX(max[j],prlim[i][j]); |
min=FMIN(min,prlim[i][j]); |
min[j]=FMIN(min[j],prlim[i][j]); |
} |
} |
maxmin=max-min; |
|
maxmax=FMAX(maxmax,maxmin); |
|
} |
} |
|
|
|
maxmax=0.; |
|
for(j=1; j<=nlstate; j++){ |
|
meandiff[j]=(max[j]-min[j])/(max[j]+min[j])*2.; /* mean difference for each column */ |
|
maxmax=FMAX(maxmax,meandiff[j]); |
|
/* printf(" age= %d meandiff[%d]=%f, agefin=%d max[%d]=%f min[%d]=%f maxmax=%f\n", (int)age, j, meandiff[j],(int)agefin, j, max[j], j, min[j],maxmax); */ |
|
} /* j loop */ |
|
*ncvyear= (int)age- (int)agefin; |
|
/* printf("maxmax=%lf maxmin=%lf ncvloop=%d, age=%d, agefin=%d ncvyear=%d \n", maxmax, maxmin, ncvloop, (int)age, (int)agefin, *ncvyear); */ |
if(maxmax < ftolpl){ |
if(maxmax < ftolpl){ |
|
/* printf("maxmax=%lf ncvloop=%ld, age=%d, agefin=%d ncvyear=%d \n", maxmax, ncvloop, (int)age, (int)agefin, *ncvyear); */ |
|
free_vector(min,1,nlstate); |
|
free_vector(max,1,nlstate); |
|
free_vector(meandiff,1,nlstate); |
return prlim; |
return prlim; |
} |
} |
} |
} /* age loop */ |
|
/* After some age loop it doesn't converge */ |
|
printf("Warning: the stable prevalence at age %d did not converge with the required precision (%g > ftolpl=%g) within %.0f years. Try to lower 'ftolpl'. \n\ |
|
Earliest age to start was %d-%d=%d, ncvloop=%d, ncvyear=%d\n", (int)age, maxmax, ftolpl, delaymax, (int)age, (int)delaymax, (int)agefin, ncvloop, *ncvyear); |
|
/* Try to lower 'ftol', for example from 1.e-8 to 6.e-9.\n", ftolpl, (int)age, (int)delaymax, (int)agefin, ncvloop, (int)age-(int)agefin); */ |
|
free_vector(min,1,nlstate); |
|
free_vector(max,1,nlstate); |
|
free_vector(meandiff,1,nlstate); |
|
|
|
return prlim; /* should not reach here */ |
|
} |
|
|
|
|
|
/**** Back Prevalence limit (stable or period prevalence) ****************/ |
|
|
|
double **bprevalim(double **bprlim, int nlstate, double x[], double age, double **oldm, double **savm, double ftolpl, int *ncvyear, int ij) |
|
{ |
|
/* Computes the prevalence limit in each live state at age x by left multiplying the unit |
|
matrix by transitions matrix until convergence is reached with precision ftolpl */ |
|
/* Wx= Wx-1 Px-1= Wx-2 Px-2 Px-1 = Wx-n Px-n ... Px-2 Px-1 I */ |
|
/* Wx is row vector: population in state 1, population in state 2, population dead */ |
|
/* or prevalence in state 1, prevalence in state 2, 0 */ |
|
/* newm is the matrix after multiplications, its rows are identical at a factor */ |
|
/* Initial matrix pimij */ |
|
/* {0.85204250825084937, 0.13044499163996345, 0.017512500109187184, */ |
|
/* 0.090851990222114765, 0.88271245433047185, 0.026435555447413338, */ |
|
/* 0, 0 , 1} */ |
|
/* |
|
* and after some iteration: */ |
|
/* {0.45504275246439968, 0.42731458730878791, 0.11764266022681241, */ |
|
/* 0.45201005341706885, 0.42865420071559901, 0.11933574586733192, */ |
|
/* 0, 0 , 1} */ |
|
/* And prevalence by suppressing the deaths are close to identical rows in prlim: */ |
|
/* {0.51571254859325999, 0.4842874514067399, */ |
|
/* 0.51326036147820708, 0.48673963852179264} */ |
|
/* If we start from prlim again, prlim tends to a constant matrix */ |
|
|
|
int i, ii,j,k; |
|
double *min, *max, *meandiff, maxmax,sumnew=0.; |
|
/* double **matprod2(); */ /* test */ |
|
double **out, cov[NCOVMAX+1], **bmij(); |
|
double **newm; |
|
double agefin, delaymax=200. ; /* 100 Max number of years to converge */ |
|
int ncvloop=0; |
|
|
|
min=vector(1,nlstate); |
|
max=vector(1,nlstate); |
|
meandiff=vector(1,nlstate); |
|
|
|
for (ii=1;ii<=nlstate+ndeath;ii++) |
|
for (j=1;j<=nlstate+ndeath;j++){ |
|
oldm[ii][j]=(ii==j ? 1.0 : 0.0); |
|
} |
|
|
|
cov[1]=1.; |
|
|
|
/* Even if hstepm = 1, at least one multiplication by the unit matrix */ |
|
/* Start at agefin= age, computes the matrix of passage and loops decreasing agefin until convergence is reached */ |
|
for(agefin=age+stepm/YEARM; agefin<=age+delaymax; agefin=agefin+stepm/YEARM){ |
|
ncvloop++; |
|
newm=savm; |
|
/* Covariates have to be included here again */ |
|
cov[2]=agefin; |
|
if(nagesqr==1) |
|
cov[3]= agefin*agefin;; |
|
for (k=1; k<=cptcovn;k++) { |
|
/* cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(ij,Tvar[k])]; */ |
|
cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(ij,k)]; |
|
/* printf("prevalim ij=%d k=%d Tvar[%d]=%d nbcode=%d cov=%lf codtabm(%d,Tvar[%d])=%d \n",ij,k, k, Tvar[k],nbcode[Tvar[k]][codtabm(ij,Tvar[k])],cov[2+k], ij, k, codtabm(ij,Tvar[k])]); */ |
|
} |
|
/*wrong? for (k=1; k<=cptcovage;k++) cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2]; */ |
|
/* for (k=1; k<=cptcovage;k++) cov[2+nagesqr+Tage[k]]=nbcode[Tvar[k]][codtabm(ij,Tvar[k])]*cov[2]; */ |
|
for (k=1; k<=cptcovage;k++) cov[2+nagesqr+Tage[k]]=nbcode[Tvar[k]][codtabm(ij,k)]*cov[2]; |
|
for (k=1; k<=cptcovprod;k++) /* Useless */ |
|
/* cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,Tvard[k][1])] * nbcode[Tvard[k][2]][codtabm(ij,Tvard[k][2])]; */ |
|
cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,k)] * nbcode[Tvard[k][2]][codtabm(ij,k)]; |
|
|
|
/*printf("ij=%d cptcovprod=%d tvar=%d ", ij, cptcovprod, Tvar[1]);*/ |
|
/*printf("ij=%d cov[3]=%lf cov[4]=%lf \n",ij, cov[3],cov[4]);*/ |
|
/*printf("ij=%d cov[3]=%lf \n",ij, cov[3]);*/ |
|
/* savm=pmij(pmmij,cov,ncovmodel,x,nlstate); */ |
|
/* out=matprod2(newm, pmij(pmmij,cov,ncovmodel,x,nlstate),1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, oldm); /\* Bug Valgrind *\/ */ |
|
out=matprod2(newm, oldm ,1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, bmij(pmmij,cov,ncovmodel,x,nlstate)); /* Bug Valgrind */ |
|
|
|
savm=oldm; |
|
oldm=newm; |
|
|
|
for(j=1; j<=nlstate; j++){ |
|
max[j]=0.; |
|
min[j]=1.; |
|
} |
|
/* sumnew=0; */ |
|
/* for(k=1; k<=ndeath; k++) sumnew+=newm[i][nlstate+k]; */ |
|
for(j=1; j<=nlstate; j++){ |
|
for(i=1;i<=nlstate;i++){ |
|
/* bprlim[i][j]= newm[i][j]/(1-sumnew); */ |
|
bprlim[i][j]= newm[i][j]; |
|
max[i]=FMAX(max[i],bprlim[i][j]); |
|
min[i]=FMIN(min[i],bprlim[i][j]); |
|
} |
|
} |
|
|
|
maxmax=0.; |
|
for(i=1; i<=nlstate; i++){ |
|
meandiff[i]=(max[i]-min[i])/(max[i]+min[i])*2.; /* mean difference for each column */ |
|
maxmax=FMAX(maxmax,meandiff[i]); |
|
/* printf("Back age= %d meandiff[%d]=%f, agefin=%d max[%d]=%f min[%d]=%f maxmax=%f\n", (int)age, i, meandiff[i],(int)agefin, i, max[i], i, min[i],maxmax); */ |
|
} /* j loop */ |
|
*ncvyear= -( (int)age- (int)agefin); |
|
/* printf("Back maxmax=%lf ncvloop=%d, age=%d, agefin=%d ncvyear=%d \n", maxmax, ncvloop, (int)age, (int)agefin, *ncvyear); */ |
|
if(maxmax < ftolpl){ |
|
printf("OK Back maxmax=%lf ncvloop=%d, age=%d, agefin=%d ncvyear=%d \n", maxmax, ncvloop, (int)age, (int)agefin, *ncvyear); |
|
free_vector(min,1,nlstate); |
|
free_vector(max,1,nlstate); |
|
free_vector(meandiff,1,nlstate); |
|
return bprlim; |
|
} |
|
} /* age loop */ |
|
/* After some age loop it doesn't converge */ |
|
printf("Warning: the back stable prevalence at age %d did not converge with the required precision (%g > ftolpl=%g) within %.0f years. Try to lower 'ftolpl'. \n\ |
|
Oldest age to start was %d-%d=%d, ncvloop=%d, ncvyear=%d\n", (int)age, maxmax, ftolpl, delaymax, (int)age, (int)delaymax, (int)agefin, ncvloop, *ncvyear); |
|
/* Try to lower 'ftol', for example from 1.e-8 to 6.e-9.\n", ftolpl, (int)age, (int)delaymax, (int)agefin, ncvloop, (int)age-(int)agefin); */ |
|
free_vector(min,1,nlstate); |
|
free_vector(max,1,nlstate); |
|
free_vector(meandiff,1,nlstate); |
|
|
|
return bprlim; /* should not reach here */ |
} |
} |
|
|
/*************** transition probabilities ***************/ |
/*************** transition probabilities ***************/ |
|
|
double **pmij(double **ps, double *cov, int ncovmodel, double *x, int nlstate ) |
double **pmij(double **ps, double *cov, int ncovmodel, double *x, int nlstate ) |
{ |
{ |
double s1, s2; |
/* According to parameters values stored in x and the covariate's values stored in cov, |
|
computes the probability to be observed in state j being in state i by appying the |
|
model to the ncovmodel covariates (including constant and age). |
|
lnpijopii=ln(pij/pii)= aij+bij*age+cij*v1+dij*v2+... = sum_nc=1^ncovmodel xij(nc)*cov[nc] |
|
and, according on how parameters are entered, the position of the coefficient xij(nc) of the |
|
ncth covariate in the global vector x is given by the formula: |
|
j<i nc+((i-1)*(nlstate+ndeath-1)+j-1)*ncovmodel |
|
j>=i nc + ((i-1)*(nlstate+ndeath-1)+(j-2))*ncovmodel |
|
Computes ln(pij/pii) (lnpijopii), deduces pij/pii by exponentiation, |
|
sums on j different of i to get 1-pii/pii, deduces pii, and then all pij. |
|
Outputs ps[i][j] the probability to be observed in j being in j according to |
|
the values of the covariates cov[nc] and corresponding parameter values x[nc+shiftij] |
|
*/ |
|
double s1, lnpijopii; |
/*double t34;*/ |
/*double t34;*/ |
int i,j,j1, nc, ii, jj; |
int i,j, nc, ii, jj; |
|
|
for(i=1; i<= nlstate; i++){ |
for(i=1; i<= nlstate; i++){ |
for(j=1; j<i;j++){ |
for(j=1; j<i;j++){ |
for (nc=1, s2=0.;nc <=ncovmodel; nc++){ |
for (nc=1, lnpijopii=0.;nc <=ncovmodel; nc++){ |
/*s2 += param[i][j][nc]*cov[nc];*/ |
/*lnpijopii += param[i][j][nc]*cov[nc];*/ |
s2 += x[(i-1)*nlstate*ncovmodel+(j-1)*ncovmodel+nc+(i-1)*(ndeath-1)*ncovmodel]*cov[nc]; |
lnpijopii += x[nc+((i-1)*(nlstate+ndeath-1)+j-1)*ncovmodel]*cov[nc]; |
/* printf("Int j<i s1=%.17e, s2=%.17e\n",s1,s2); */ |
/* printf("Int j<i s1=%.17e, lnpijopii=%.17e\n",s1,lnpijopii); */ |
} |
} |
ps[i][j]=s2; |
ps[i][j]=lnpijopii; /* In fact ln(pij/pii) */ |
/* printf("s1=%.17e, s2=%.17e\n",s1,s2); */ |
/* printf("s1=%.17e, lnpijopii=%.17e\n",s1,lnpijopii); */ |
} |
} |
for(j=i+1; j<=nlstate+ndeath;j++){ |
for(j=i+1; j<=nlstate+ndeath;j++){ |
for (nc=1, s2=0.;nc <=ncovmodel; nc++){ |
for (nc=1, lnpijopii=0.;nc <=ncovmodel; nc++){ |
s2 += x[(i-1)*nlstate*ncovmodel+(j-2)*ncovmodel+nc+(i-1)*(ndeath-1)*ncovmodel]*cov[nc]; |
/*lnpijopii += x[(i-1)*nlstate*ncovmodel+(j-2)*ncovmodel+nc+(i-1)*(ndeath-1)*ncovmodel]*cov[nc];*/ |
/* printf("Int j>i s1=%.17e, s2=%.17e %lx %lx\n",s1,s2,s1,s2); */ |
lnpijopii += x[nc + ((i-1)*(nlstate+ndeath-1)+(j-2))*ncovmodel]*cov[nc]; |
|
/* printf("Int j>i s1=%.17e, lnpijopii=%.17e %lx %lx\n",s1,lnpijopii,s1,lnpijopii); */ |
} |
} |
ps[i][j]=s2; |
ps[i][j]=lnpijopii; /* In fact ln(pij/pii) */ |
} |
} |
} |
} |
/*ps[3][2]=1;*/ |
|
|
|
for(i=1; i<= nlstate; i++){ |
for(i=1; i<= nlstate; i++){ |
s1=0; |
s1=0; |
for(j=1; j<i; j++) |
for(j=1; j<i; j++){ |
s1+=exp(ps[i][j]); |
s1+=exp(ps[i][j]); /* In fact sums pij/pii */ |
for(j=i+1; j<=nlstate+ndeath; j++) |
/*printf("debug1 %d %d ps=%lf exp(ps)=%lf s1+=%lf\n",i,j,ps[i][j],exp(ps[i][j]),s1); */ |
s1+=exp(ps[i][j]); |
} |
|
for(j=i+1; j<=nlstate+ndeath; j++){ |
|
s1+=exp(ps[i][j]); /* In fact sums pij/pii */ |
|
/*printf("debug2 %d %d ps=%lf exp(ps)=%lf s1+=%lf\n",i,j,ps[i][j],exp(ps[i][j]),s1); */ |
|
} |
|
/* s1= sum_{j<>i} pij/pii=(1-pii)/pii and thus pii is known from s1 */ |
ps[i][i]=1./(s1+1.); |
ps[i][i]=1./(s1+1.); |
|
/* Computing other pijs */ |
for(j=1; j<i; j++) |
for(j=1; j<i; j++) |
ps[i][j]= exp(ps[i][j])*ps[i][i]; |
ps[i][j]= exp(ps[i][j])*ps[i][i]; |
for(j=i+1; j<=nlstate+ndeath; j++) |
for(j=i+1; j<=nlstate+ndeath; j++) |
Line 1098 double **pmij(double **ps, double *cov,
|
Line 2329 double **pmij(double **ps, double *cov,
|
} |
} |
} |
} |
|
|
|
|
|
/* for(ii=1; ii<= nlstate+ndeath; ii++){ */ |
|
/* for(jj=1; jj<= nlstate+ndeath; jj++){ */ |
|
/* printf(" pmij ps[%d][%d]=%lf ",ii,jj,ps[ii][jj]); */ |
|
/* } */ |
|
/* printf("\n "); */ |
|
/* } */ |
|
/* printf("\n ");printf("%lf ",cov[2]);*/ |
|
/* |
|
for(i=1; i<= npar; i++) printf("%f ",x[i]); |
|
goto end;*/ |
|
return ps; |
|
} |
|
|
|
/*************** transition probabilities ***************/ |
|
|
|
double **bmij(double **ps, double *cov, int ncovmodel, double *x, int nlstate ) |
|
{ |
|
/* According to parameters values stored in x and the covariate's values stored in cov, |
|
computes the probability to be observed in state j being in state i by appying the |
|
model to the ncovmodel covariates (including constant and age). |
|
lnpijopii=ln(pij/pii)= aij+bij*age+cij*v1+dij*v2+... = sum_nc=1^ncovmodel xij(nc)*cov[nc] |
|
and, according on how parameters are entered, the position of the coefficient xij(nc) of the |
|
ncth covariate in the global vector x is given by the formula: |
|
j<i nc+((i-1)*(nlstate+ndeath-1)+j-1)*ncovmodel |
|
j>=i nc + ((i-1)*(nlstate+ndeath-1)+(j-2))*ncovmodel |
|
Computes ln(pij/pii) (lnpijopii), deduces pij/pii by exponentiation, |
|
sums on j different of i to get 1-pii/pii, deduces pii, and then all pij. |
|
Outputs ps[i][j] the probability to be observed in j being in j according to |
|
the values of the covariates cov[nc] and corresponding parameter values x[nc+shiftij] |
|
*/ |
|
double s1, lnpijopii; |
|
/*double t34;*/ |
|
int i,j, nc, ii, jj; |
|
|
/* for(ii=1; ii<= nlstate+ndeath; ii++){ */ |
for(i=1; i<= nlstate; i++){ |
/* for(jj=1; jj<= nlstate+ndeath; jj++){ */ |
for(j=1; j<i;j++){ |
/* printf("ddd %lf ",ps[ii][jj]); */ |
for (nc=1, lnpijopii=0.;nc <=ncovmodel; nc++){ |
/* } */ |
/*lnpijopii += param[i][j][nc]*cov[nc];*/ |
/* printf("\n "); */ |
lnpijopii += x[nc+((i-1)*(nlstate+ndeath-1)+j-1)*ncovmodel]*cov[nc]; |
/* } */ |
/* printf("Int j<i s1=%.17e, lnpijopii=%.17e\n",s1,lnpijopii); */ |
/* printf("\n ");printf("%lf ",cov[2]); */ |
} |
/* |
ps[i][j]=lnpijopii; /* In fact ln(pij/pii) */ |
|
/* printf("s1=%.17e, lnpijopii=%.17e\n",s1,lnpijopii); */ |
|
} |
|
for(j=i+1; j<=nlstate+ndeath;j++){ |
|
for (nc=1, lnpijopii=0.;nc <=ncovmodel; nc++){ |
|
/*lnpijopii += x[(i-1)*nlstate*ncovmodel+(j-2)*ncovmodel+nc+(i-1)*(ndeath-1)*ncovmodel]*cov[nc];*/ |
|
lnpijopii += x[nc + ((i-1)*(nlstate+ndeath-1)+(j-2))*ncovmodel]*cov[nc]; |
|
/* printf("Int j>i s1=%.17e, lnpijopii=%.17e %lx %lx\n",s1,lnpijopii,s1,lnpijopii); */ |
|
} |
|
ps[i][j]=lnpijopii; /* In fact ln(pij/pii) */ |
|
} |
|
} |
|
|
|
for(i=1; i<= nlstate; i++){ |
|
s1=0; |
|
for(j=1; j<i; j++){ |
|
s1+=exp(ps[i][j]); /* In fact sums pij/pii */ |
|
/*printf("debug1 %d %d ps=%lf exp(ps)=%lf s1+=%lf\n",i,j,ps[i][j],exp(ps[i][j]),s1); */ |
|
} |
|
for(j=i+1; j<=nlstate+ndeath; j++){ |
|
s1+=exp(ps[i][j]); /* In fact sums pij/pii */ |
|
/*printf("debug2 %d %d ps=%lf exp(ps)=%lf s1+=%lf\n",i,j,ps[i][j],exp(ps[i][j]),s1); */ |
|
} |
|
/* s1= sum_{j<>i} pij/pii=(1-pii)/pii and thus pii is known from s1 */ |
|
ps[i][i]=1./(s1+1.); |
|
/* Computing other pijs */ |
|
for(j=1; j<i; j++) |
|
ps[i][j]= exp(ps[i][j])*ps[i][i]; |
|
for(j=i+1; j<=nlstate+ndeath; j++) |
|
ps[i][j]= exp(ps[i][j])*ps[i][i]; |
|
/* ps[i][nlstate+1]=1.-s1- ps[i][i];*/ /* Sum should be 1 */ |
|
} /* end i */ |
|
|
|
for(ii=nlstate+1; ii<= nlstate+ndeath; ii++){ |
|
for(jj=1; jj<= nlstate+ndeath; jj++){ |
|
ps[ii][jj]=0; |
|
ps[ii][ii]=1; |
|
} |
|
} |
|
/* Added for backcast */ |
|
for(jj=1; jj<= nlstate; jj++){ |
|
s1=0.; |
|
for(ii=1; ii<= nlstate; ii++){ |
|
s1+=ps[ii][jj]; |
|
} |
|
for(ii=1; ii<= nlstate; ii++){ |
|
ps[ii][jj]=ps[ii][jj]/s1; |
|
} |
|
} |
|
|
|
/* for(ii=1; ii<= nlstate+ndeath; ii++){ */ |
|
/* for(jj=1; jj<= nlstate+ndeath; jj++){ */ |
|
/* printf(" pmij ps[%d][%d]=%lf ",ii,jj,ps[ii][jj]); */ |
|
/* } */ |
|
/* printf("\n "); */ |
|
/* } */ |
|
/* printf("\n ");printf("%lf ",cov[2]);*/ |
|
/* |
for(i=1; i<= npar; i++) printf("%f ",x[i]); |
for(i=1; i<= npar; i++) printf("%f ",x[i]); |
goto end;*/ |
goto end;*/ |
return ps; |
return ps; |
} |
} |
|
|
|
|
/**************** Product of 2 matrices ******************/ |
/**************** Product of 2 matrices ******************/ |
|
|
double **matprod2(double **out, double **in,long nrl, long nrh, long ncl, long nch, long ncolol, long ncoloh, double **b) |
double **matprod2(double **out, double **in,int nrl, int nrh, int ncl, int nch, int ncolol, int ncoloh, double **b) |
{ |
{ |
/* Computes the matrix product of in(1,nrh-nrl+1)(1,nch-ncl+1) times |
/* Computes the matrix product of in(1,nrh-nrl+1)(1,nch-ncl+1) times |
b(1,nch-ncl+1)(1,ncoloh-ncolol+1) into out(...) */ |
b(1,nch-ncl+1)(1,ncoloh-ncolol+1) into out(...) */ |
/* in, b, out are matrice of pointers which should have been initialized |
/* in, b, out are matrice of pointers which should have been initialized |
before: only the contents of out is modified. The function returns |
before: only the contents of out is modified. The function returns |
a pointer to pointers identical to out */ |
a pointer to pointers identical to out */ |
long i, j, k; |
int i, j, k; |
for(i=nrl; i<= nrh; i++) |
for(i=nrl; i<= nrh; i++) |
for(k=ncolol; k<=ncoloh; k++) |
for(k=ncolol; k<=ncoloh; k++){ |
for(j=ncl,out[i][k]=0.; j<=nch; j++) |
out[i][k]=0.; |
out[i][k] +=in[i][j]*b[j][k]; |
for(j=ncl; j<=nch; j++) |
|
out[i][k] +=in[i][j]*b[j][k]; |
|
} |
return out; |
return out; |
} |
} |
|
|
Line 1148 double ***hpxij(double ***po, int nhstep
|
Line 2472 double ***hpxij(double ***po, int nhstep
|
*/ |
*/ |
|
|
int i, j, d, h, k; |
int i, j, d, h, k; |
double **out, cov[NCOVMAX]; |
double **out, cov[NCOVMAX+1]; |
double **newm; |
double **newm; |
|
double agexact; |
|
double agebegin, ageend; |
|
|
/* Hstepm could be zero and should return the unit matrix */ |
/* Hstepm could be zero and should return the unit matrix */ |
for (i=1;i<=nlstate+ndeath;i++) |
for (i=1;i<=nlstate+ndeath;i++) |
Line 1163 double ***hpxij(double ***po, int nhstep
|
Line 2489 double ***hpxij(double ***po, int nhstep
|
newm=savm; |
newm=savm; |
/* Covariates have to be included here again */ |
/* Covariates have to be included here again */ |
cov[1]=1.; |
cov[1]=1.; |
cov[2]=age+((h-1)*hstepm + (d-1))*stepm/YEARM; |
agexact=age+((h-1)*hstepm + (d-1))*stepm/YEARM; /* age just before transition */ |
for (k=1; k<=cptcovn;k++) cov[2+k]=nbcode[Tvar[k]][codtab[ij][Tvar[k]]]; |
cov[2]=agexact; |
for (k=1; k<=cptcovage;k++) |
if(nagesqr==1) |
cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2]; |
cov[3]= agexact*agexact; |
for (k=1; k<=cptcovprod;k++) |
for (k=1; k<=cptcovn;k++) |
cov[2+Tprod[k]]=nbcode[Tvard[k][1]][codtab[ij][Tvard[k][1]]]*nbcode[Tvard[k][2]][codtab[ij][Tvard[k][2]]]; |
cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(ij,k)]; |
|
/* cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(ij,Tvar[k])]; */ |
|
for (k=1; k<=cptcovage;k++) /* Should start at cptcovn+1 */ |
|
/* cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2]; */ |
|
cov[2+nagesqr+Tage[k]]=nbcode[Tvar[Tage[k]]][codtabm(ij,k)]*cov[2]; |
|
/* cov[2+nagesqr+Tage[k]]=nbcode[Tvar[Tage[k]]][codtabm(ij,Tvar[Tage[k]])]*cov[2]; */ |
|
for (k=1; k<=cptcovprod;k++) /* Useless because included in cptcovn */ |
|
cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,k)]*nbcode[Tvard[k][2]][codtabm(ij,k)]; |
|
/* cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,Tvard[k][1])]*nbcode[Tvard[k][2]][codtabm(ij,Tvard[k][2])]; */ |
|
|
|
|
/*printf("hxi cptcov=%d cptcode=%d\n",cptcov,cptcode);*/ |
/*printf("hxi cptcov=%d cptcode=%d\n",cptcov,cptcode);*/ |
/*printf("h=%d d=%d age=%f cov=%f\n",h,d,age,cov[2]);*/ |
/*printf("h=%d d=%d age=%f cov=%f\n",h,d,age,cov[2]);*/ |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, |
pmij(pmmij,cov,ncovmodel,x,nlstate)); |
pmij(pmmij,cov,ncovmodel,x,nlstate)); |
|
/* if((int)age == 70){ */ |
|
/* printf(" Forward hpxij age=%d agexact=%f d=%d nhstepm=%d hstepm=%d\n", (int) age, agexact, d, nhstepm, hstepm); */ |
|
/* for(i=1; i<=nlstate+ndeath; i++) { */ |
|
/* printf("%d pmmij ",i); */ |
|
/* for(j=1;j<=nlstate+ndeath;j++) { */ |
|
/* printf("%f ",pmmij[i][j]); */ |
|
/* } */ |
|
/* printf(" oldm "); */ |
|
/* for(j=1;j<=nlstate+ndeath;j++) { */ |
|
/* printf("%f ",oldm[i][j]); */ |
|
/* } */ |
|
/* printf("\n"); */ |
|
/* } */ |
|
/* } */ |
savm=oldm; |
savm=oldm; |
oldm=newm; |
oldm=newm; |
} |
} |
for(i=1; i<=nlstate+ndeath; i++) |
for(i=1; i<=nlstate+ndeath; i++) |
for(j=1;j<=nlstate+ndeath;j++) { |
for(j=1;j<=nlstate+ndeath;j++) { |
po[i][j][h]=newm[i][j]; |
po[i][j][h]=newm[i][j]; |
/*printf("i=%d j=%d h=%d po[i][j][h]=%f ",i,j,h,po[i][j][h]); |
/*if(h==nhstepm) printf("po[%d][%d][%d]=%f ",i,j,h,po[i][j][h]);*/ |
*/ |
} |
|
/*printf("h=%d ",h);*/ |
|
} /* end h */ |
|
/* printf("\n H=%d \n",h); */ |
|
return po; |
|
} |
|
|
|
/************* Higher Back Matrix Product ***************/ |
|
|
|
double ***hbxij(double ***po, int nhstepm, double age, int hstepm, double *x, int nlstate, int stepm, double **oldm, double **savm, int ij ) |
|
{ |
|
/* Computes the transition matrix starting at age 'age' over |
|
'nhstepm*hstepm*stepm' months (i.e. until |
|
age (in years) age+nhstepm*hstepm*stepm/12) by multiplying |
|
nhstepm*hstepm matrices. |
|
Output is stored in matrix po[i][j][h] for h every 'hstepm' step |
|
(typically every 2 years instead of every month which is too big |
|
for the memory). |
|
Model is determined by parameters x and covariates have to be |
|
included manually here. |
|
|
|
*/ |
|
|
|
int i, j, d, h, k; |
|
double **out, cov[NCOVMAX+1]; |
|
double **newm; |
|
double agexact; |
|
double agebegin, ageend; |
|
|
|
/* Hstepm could be zero and should return the unit matrix */ |
|
for (i=1;i<=nlstate+ndeath;i++) |
|
for (j=1;j<=nlstate+ndeath;j++){ |
|
oldm[i][j]=(i==j ? 1.0 : 0.0); |
|
po[i][j][0]=(i==j ? 1.0 : 0.0); |
|
} |
|
/* Even if hstepm = 1, at least one multiplication by the unit matrix */ |
|
for(h=1; h <=nhstepm; h++){ |
|
for(d=1; d <=hstepm; d++){ |
|
newm=savm; |
|
/* Covariates have to be included here again */ |
|
cov[1]=1.; |
|
agexact=age-((h-1)*hstepm + (d-1))*stepm/YEARM; /* age just before transition */ |
|
/* agexact=age+((h-1)*hstepm + (d-1))*stepm/YEARM; /\* age just before transition *\/ */ |
|
cov[2]=agexact; |
|
if(nagesqr==1) |
|
cov[3]= agexact*agexact; |
|
for (k=1; k<=cptcovn;k++) |
|
cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(ij,k)]; |
|
/* cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(ij,Tvar[k])]; */ |
|
for (k=1; k<=cptcovage;k++) /* Should start at cptcovn+1 */ |
|
/* cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2]; */ |
|
cov[2+nagesqr+Tage[k]]=nbcode[Tvar[Tage[k]]][codtabm(ij,k)]*cov[2]; |
|
/* cov[2+nagesqr+Tage[k]]=nbcode[Tvar[Tage[k]]][codtabm(ij,Tvar[Tage[k]])]*cov[2]; */ |
|
for (k=1; k<=cptcovprod;k++) /* Useless because included in cptcovn */ |
|
cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,k)]*nbcode[Tvard[k][2]][codtabm(ij,k)]; |
|
/* cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,Tvard[k][1])]*nbcode[Tvard[k][2]][codtabm(ij,Tvard[k][2])]; */ |
|
|
|
|
|
/*printf("hxi cptcov=%d cptcode=%d\n",cptcov,cptcode);*/ |
|
/*printf("h=%d d=%d age=%f cov=%f\n",h,d,age,cov[2]);*/ |
|
out=matprod2(newm, bmij(pmmij,cov,ncovmodel,x,nlstate),1,nlstate+ndeath,1,nlstate+ndeath,1,nlstate+ndeath, |
|
oldm); |
|
/* if((int)age == 70){ */ |
|
/* printf(" Backward hbxij age=%d agexact=%f d=%d nhstepm=%d hstepm=%d\n", (int) age, agexact, d, nhstepm, hstepm); */ |
|
/* for(i=1; i<=nlstate+ndeath; i++) { */ |
|
/* printf("%d pmmij ",i); */ |
|
/* for(j=1;j<=nlstate+ndeath;j++) { */ |
|
/* printf("%f ",pmmij[i][j]); */ |
|
/* } */ |
|
/* printf(" oldm "); */ |
|
/* for(j=1;j<=nlstate+ndeath;j++) { */ |
|
/* printf("%f ",oldm[i][j]); */ |
|
/* } */ |
|
/* printf("\n"); */ |
|
/* } */ |
|
/* } */ |
|
savm=oldm; |
|
oldm=newm; |
|
} |
|
for(i=1; i<=nlstate+ndeath; i++) |
|
for(j=1;j<=nlstate+ndeath;j++) { |
|
po[i][j][h]=newm[i][j]; |
|
/*if(h==nhstepm) printf("po[%d][%d][%d]=%f ",i,j,h,po[i][j][h]);*/ |
} |
} |
|
/*printf("h=%d ",h);*/ |
} /* end h */ |
} /* end h */ |
|
/* printf("\n H=%d \n",h); */ |
return po; |
return po; |
} |
} |
|
|
|
|
|
#ifdef NLOPT |
|
double myfunc(unsigned n, const double *p1, double *grad, void *pd){ |
|
double fret; |
|
double *xt; |
|
int j; |
|
myfunc_data *d2 = (myfunc_data *) pd; |
|
/* xt = (p1-1); */ |
|
xt=vector(1,n); |
|
for (j=1;j<=n;j++) xt[j]=p1[j-1]; /* xt[1]=p1[0] */ |
|
|
|
fret=(d2->function)(xt); /* p xt[1]@8 is fine */ |
|
/* fret=(*func)(xt); /\* p xt[1]@8 is fine *\/ */ |
|
printf("Function = %.12lf ",fret); |
|
for (j=1;j<=n;j++) printf(" %d %.8lf", j, xt[j]); |
|
printf("\n"); |
|
free_vector(xt,1,n); |
|
return fret; |
|
} |
|
#endif |
|
|
/*************** log-likelihood *************/ |
/*************** log-likelihood *************/ |
double func( double *x) |
double func( double *x) |
{ |
{ |
int i, ii, j, k, mi, d, kk; |
int i, ii, j, k, mi, d, kk; |
double l, ll[NLSTATEMAX], cov[NCOVMAX]; |
double l, ll[NLSTATEMAX+1], cov[NCOVMAX+1]; |
double **out; |
double **out; |
double sw; /* Sum of weights */ |
double sw; /* Sum of weights */ |
double lli; /* Individual log likelihood */ |
double lli; /* Individual log likelihood */ |
int s1, s2; |
int s1, s2; |
double bbh, survp; |
double bbh, survp; |
long ipmx; |
long ipmx; |
|
double agexact; |
/*extern weight */ |
/*extern weight */ |
/* We are differentiating ll according to initial status */ |
/* We are differentiating ll according to initial status */ |
/* for (i=1;i<=npar;i++) printf("%f ", x[i]);*/ |
/* for (i=1;i<=npar;i++) printf("%f ", x[i]);*/ |
/*for(i=1;i<imx;i++) |
/*for(i=1;i<imx;i++) |
printf(" %d\n",s[4][i]); |
printf(" %d\n",s[4][i]); |
*/ |
*/ |
|
|
|
++countcallfunc; |
|
|
cov[1]=1.; |
cov[1]=1.; |
|
|
for(k=1; k<=nlstate; k++) ll[k]=0.; |
for(k=1; k<=nlstate; k++) ll[k]=0.; |
|
|
if(mle==1){ |
if(mle==1){ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (k=1; k<=cptcovn;k++) cov[2+k]=covar[Tvar[k]][i]; |
/* Computes the values of the ncovmodel covariates of the model |
|
depending if the covariates are fixed or variying (age dependent) and stores them in cov[] |
|
Then computes with function pmij which return a matrix p[i][j] giving the elementary probability |
|
to be observed in j being in i according to the model. |
|
*/ |
|
for (k=1; k<=cptcovn;k++){ /* Simple and product covariates without age* products */ |
|
cov[2+nagesqr+k]=covar[Tvar[k]][i]; |
|
} |
|
/* In model V2+V1*V4+age*V3+V3*V2 Tvar[1] is V2, Tvar[2=V1*V4] |
|
is 6, Tvar[3=age*V3] should not be computed because of age Tvar[4=V3*V2] |
|
has been calculated etc */ |
for(mi=1; mi<= wav[i]-1; mi++){ |
for(mi=1; mi<= wav[i]-1; mi++){ |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (j=1;j<=nlstate+ndeath;j++){ |
for (j=1;j<=nlstate+ndeath;j++){ |
Line 1221 double func( double *x)
|
Line 2687 double func( double *x)
|
} |
} |
for(d=0; d<dh[mi][i]; d++){ |
for(d=0; d<dh[mi][i]; d++){ |
newm=savm; |
newm=savm; |
cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM; |
agexact=agev[mw[mi][i]][i]+d*stepm/YEARM; |
|
cov[2]=agexact; |
|
if(nagesqr==1) |
|
cov[3]= agexact*agexact; |
for (kk=1; kk<=cptcovage;kk++) { |
for (kk=1; kk<=cptcovage;kk++) { |
cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2]; |
cov[Tage[kk]+2+nagesqr]=covar[Tvar[Tage[kk]]][i]*agexact; /* Tage[kk] gives the data-covariate associated with age */ |
} |
} |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); |
Line 1232 double func( double *x)
|
Line 2701 double func( double *x)
|
} /* end mult */ |
} /* end mult */ |
|
|
/*lli=log(out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]);*/ /* Original formula */ |
/*lli=log(out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]);*/ /* Original formula */ |
/* But now since version 0.9 we anticipate for bias and large stepm. |
/* But now since version 0.9 we anticipate for bias at large stepm. |
* If stepm is larger than one month (smallest stepm) and if the exact delay |
* If stepm is larger than one month (smallest stepm) and if the exact delay |
* (in months) between two waves is not a multiple of stepm, we rounded to |
* (in months) between two waves is not a multiple of stepm, we rounded to |
* the nearest (and in case of equal distance, to the lowest) interval but now |
* the nearest (and in case of equal distance, to the lowest) interval but now |
* we keep into memory the bias bh[mi][i] and also the previous matrix product |
* we keep into memory the bias bh[mi][i] and also the previous matrix product |
* (i.e to dh[mi][i]-1) saved in 'savm'. The we inter(extra)polate the |
* (i.e to dh[mi][i]-1) saved in 'savm'. Then we inter(extra)polate the |
* probability in order to take into account the bias as a fraction of the way |
* probability in order to take into account the bias as a fraction of the way |
* from savm to out if bh is neagtive or even beyond if bh is positive. bh varies |
* from savm to out if bh is negative or even beyond if bh is positive. bh varies |
* -stepm/2 to stepm/2 . |
* -stepm/2 to stepm/2 . |
* For stepm=1 the results are the same as for previous versions of Imach. |
* For stepm=1 the results are the same as for previous versions of Imach. |
* For stepm > 1 the results are less biased than in previous versions. |
* For stepm > 1 the results are less biased than in previous versions. |
Line 1247 double func( double *x)
|
Line 2716 double func( double *x)
|
s1=s[mw[mi][i]][i]; |
s1=s[mw[mi][i]][i]; |
s2=s[mw[mi+1][i]][i]; |
s2=s[mw[mi+1][i]][i]; |
bbh=(double)bh[mi][i]/(double)stepm; |
bbh=(double)bh[mi][i]/(double)stepm; |
/* bias is positive if real duration |
/* bias bh is positive if real duration |
* is higher than the multiple of stepm and negative otherwise. |
* is higher than the multiple of stepm and negative otherwise. |
*/ |
*/ |
/* lli= (savm[s1][s2]>1.e-8 ?(1.+bbh)*log(out[s1][s2])- bbh*log(savm[s1][s2]):log((1.+bbh)*out[s1][s2]));*/ |
/* lli= (savm[s1][s2]>1.e-8 ?(1.+bbh)*log(out[s1][s2])- bbh*log(savm[s1][s2]):log((1.+bbh)*out[s1][s2]));*/ |
if( s2 > nlstate){ |
if( s2 > nlstate){ |
/* i.e. if s2 is a death state and if the date of death is known then the contribution |
/* i.e. if s2 is a death state and if the date of death is known |
to the likelihood is the probability to die between last step unit time and current |
then the contribution to the likelihood is the probability to |
step unit time, which is also the differences between probability to die before dh |
die between last step unit time and current step unit time, |
and probability to die before dh-stepm . |
which is also equal to probability to die before dh |
|
minus probability to die before dh-stepm . |
In version up to 0.92 likelihood was computed |
In version up to 0.92 likelihood was computed |
as if date of death was unknown. Death was treated as any other |
as if date of death was unknown. Death was treated as any other |
health state: the date of the interview describes the actual state |
health state: the date of the interview describes the actual state |
Line 1274 double func( double *x)
|
Line 2744 double func( double *x)
|
which slows down the processing. The difference can be up to 10% |
which slows down the processing. The difference can be up to 10% |
lower mortality. |
lower mortality. |
*/ |
*/ |
|
/* If, at the beginning of the maximization mostly, the |
|
cumulative probability or probability to be dead is |
|
constant (ie = 1) over time d, the difference is equal to |
|
0. out[s1][3] = savm[s1][3]: probability, being at state |
|
s1 at precedent wave, to be dead a month before current |
|
wave is equal to probability, being at state s1 at |
|
precedent wave, to be dead at mont of the current |
|
wave. Then the observed probability (that this person died) |
|
is null according to current estimated parameter. In fact, |
|
it should be very low but not zero otherwise the log go to |
|
infinity. |
|
*/ |
|
/* #ifdef INFINITYORIGINAL */ |
|
/* lli=log(out[s1][s2] - savm[s1][s2]); */ |
|
/* #else */ |
|
/* if ((out[s1][s2] - savm[s1][s2]) < mytinydouble) */ |
|
/* lli=log(mytinydouble); */ |
|
/* else */ |
|
/* lli=log(out[s1][s2] - savm[s1][s2]); */ |
|
/* #endif */ |
lli=log(out[s1][s2] - savm[s1][s2]); |
lli=log(out[s1][s2] - savm[s1][s2]); |
}else{ |
|
|
} else if ( s2==-1 ) { /* alive */ |
|
for (j=1,survp=0. ; j<=nlstate; j++) |
|
survp += (1.+bbh)*out[s1][j]- bbh*savm[s1][j]; |
|
/*survp += out[s1][j]; */ |
|
lli= log(survp); |
|
} |
|
else if (s2==-4) { |
|
for (j=3,survp=0. ; j<=nlstate; j++) |
|
survp += (1.+bbh)*out[s1][j]- bbh*savm[s1][j]; |
|
lli= log(survp); |
|
} |
|
else if (s2==-5) { |
|
for (j=1,survp=0. ; j<=2; j++) |
|
survp += (1.+bbh)*out[s1][j]- bbh*savm[s1][j]; |
|
lli= log(survp); |
|
} |
|
else{ |
lli= log((1.+bbh)*out[s1][s2]- bbh*savm[s1][s2]); /* linear interpolation */ |
lli= log((1.+bbh)*out[s1][s2]- bbh*savm[s1][s2]); /* linear interpolation */ |
/* lli= (savm[s1][s2]>(double)1.e-8 ?log((1.+bbh)*out[s1][s2]- bbh*(savm[s1][s2])):log((1.+bbh)*out[s1][s2]));*/ /* linear interpolation */ |
/* lli= (savm[s1][s2]>(double)1.e-8 ?log((1.+bbh)*out[s1][s2]- bbh*(savm[s1][s2])):log((1.+bbh)*out[s1][s2]));*/ /* linear interpolation */ |
} |
} |
Line 1285 double func( double *x)
|
Line 2792 double func( double *x)
|
ipmx +=1; |
ipmx +=1; |
sw += weight[i]; |
sw += weight[i]; |
ll[s[mw[mi][i]][i]] += 2*weight[i]*lli; |
ll[s[mw[mi][i]][i]] += 2*weight[i]*lli; |
|
/* if (lli < log(mytinydouble)){ */ |
|
/* printf("Close to inf lli = %.10lf < %.10lf i= %d mi= %d, s[%d][i]=%d s1=%d s2=%d\n", lli,log(mytinydouble), i, mi,mw[mi][i], s[mw[mi][i]][i], s1,s2); */ |
|
/* fprintf(ficlog,"Close to inf lli = %.10lf i= %d mi= %d, s[mw[mi][i]][i]=%d\n", lli, i, mi,s[mw[mi][i]][i]); */ |
|
/* } */ |
} /* end of wave */ |
} /* end of wave */ |
} /* end of individual */ |
} /* end of individual */ |
} else if(mle==2){ |
} else if(mle==2){ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (k=1; k<=cptcovn;k++) cov[2+k]=covar[Tvar[k]][i]; |
for (k=1; k<=cptcovn;k++) cov[2+nagesqr+k]=covar[Tvar[k]][i]; |
for(mi=1; mi<= wav[i]-1; mi++){ |
for(mi=1; mi<= wav[i]-1; mi++){ |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (j=1;j<=nlstate+ndeath;j++){ |
for (j=1;j<=nlstate+ndeath;j++){ |
Line 1298 double func( double *x)
|
Line 2809 double func( double *x)
|
} |
} |
for(d=0; d<=dh[mi][i]; d++){ |
for(d=0; d<=dh[mi][i]; d++){ |
newm=savm; |
newm=savm; |
cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM; |
agexact=agev[mw[mi][i]][i]+d*stepm/YEARM; |
|
cov[2]=agexact; |
|
if(nagesqr==1) |
|
cov[3]= agexact*agexact; |
for (kk=1; kk<=cptcovage;kk++) { |
for (kk=1; kk<=cptcovage;kk++) { |
cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2]; |
cov[Tage[kk]+2+nagesqr]=covar[Tvar[Tage[kk]]][i]*agexact; |
} |
} |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); |
Line 1319 double func( double *x)
|
Line 2833 double func( double *x)
|
} /* end of individual */ |
} /* end of individual */ |
} else if(mle==3){ /* exponential inter-extrapolation */ |
} else if(mle==3){ /* exponential inter-extrapolation */ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (k=1; k<=cptcovn;k++) cov[2+k]=covar[Tvar[k]][i]; |
for (k=1; k<=cptcovn;k++) cov[2+nagesqr+k]=covar[Tvar[k]][i]; |
for(mi=1; mi<= wav[i]-1; mi++){ |
for(mi=1; mi<= wav[i]-1; mi++){ |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (j=1;j<=nlstate+ndeath;j++){ |
for (j=1;j<=nlstate+ndeath;j++){ |
Line 1328 double func( double *x)
|
Line 2842 double func( double *x)
|
} |
} |
for(d=0; d<dh[mi][i]; d++){ |
for(d=0; d<dh[mi][i]; d++){ |
newm=savm; |
newm=savm; |
cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM; |
agexact=agev[mw[mi][i]][i]+d*stepm/YEARM; |
|
cov[2]=agexact; |
|
if(nagesqr==1) |
|
cov[3]= agexact*agexact; |
for (kk=1; kk<=cptcovage;kk++) { |
for (kk=1; kk<=cptcovage;kk++) { |
cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2]; |
cov[Tage[kk]+2+nagesqr]=covar[Tvar[Tage[kk]]][i]*agexact; |
} |
} |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); |
Line 1349 double func( double *x)
|
Line 2866 double func( double *x)
|
} /* end of individual */ |
} /* end of individual */ |
}else if (mle==4){ /* ml=4 no inter-extrapolation */ |
}else if (mle==4){ /* ml=4 no inter-extrapolation */ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (k=1; k<=cptcovn;k++) cov[2+k]=covar[Tvar[k]][i]; |
for (k=1; k<=cptcovn;k++) cov[2+nagesqr+k]=covar[Tvar[k]][i]; |
for(mi=1; mi<= wav[i]-1; mi++){ |
for(mi=1; mi<= wav[i]-1; mi++){ |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (j=1;j<=nlstate+ndeath;j++){ |
for (j=1;j<=nlstate+ndeath;j++){ |
Line 1358 double func( double *x)
|
Line 2875 double func( double *x)
|
} |
} |
for(d=0; d<dh[mi][i]; d++){ |
for(d=0; d<dh[mi][i]; d++){ |
newm=savm; |
newm=savm; |
cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM; |
agexact=agev[mw[mi][i]][i]+d*stepm/YEARM; |
|
cov[2]=agexact; |
|
if(nagesqr==1) |
|
cov[3]= agexact*agexact; |
for (kk=1; kk<=cptcovage;kk++) { |
for (kk=1; kk<=cptcovage;kk++) { |
cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2]; |
cov[Tage[kk]+2+nagesqr]=covar[Tvar[Tage[kk]]][i]*agexact; |
} |
} |
|
|
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
Line 1373 double func( double *x)
|
Line 2893 double func( double *x)
|
s2=s[mw[mi+1][i]][i]; |
s2=s[mw[mi+1][i]][i]; |
if( s2 > nlstate){ |
if( s2 > nlstate){ |
lli=log(out[s1][s2] - savm[s1][s2]); |
lli=log(out[s1][s2] - savm[s1][s2]); |
|
} else if ( s2==-1 ) { /* alive */ |
|
for (j=1,survp=0. ; j<=nlstate; j++) |
|
survp += out[s1][j]; |
|
lli= log(survp); |
}else{ |
}else{ |
lli=log(out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]); /* Original formula */ |
lli=log(out[s[mw[mi][i]][i]][s[mw[mi+1][i]][i]]); /* Original formula */ |
} |
} |
Line 1384 double func( double *x)
|
Line 2908 double func( double *x)
|
} /* end of individual */ |
} /* end of individual */ |
}else{ /* ml=5 no inter-extrapolation no jackson =0.8a */ |
}else{ /* ml=5 no inter-extrapolation no jackson =0.8a */ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (k=1; k<=cptcovn;k++) cov[2+k]=covar[Tvar[k]][i]; |
for (k=1; k<=cptcovn;k++) cov[2+nagesqr+k]=covar[Tvar[k]][i]; |
for(mi=1; mi<= wav[i]-1; mi++){ |
for(mi=1; mi<= wav[i]-1; mi++){ |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (j=1;j<=nlstate+ndeath;j++){ |
for (j=1;j<=nlstate+ndeath;j++){ |
Line 1393 double func( double *x)
|
Line 2917 double func( double *x)
|
} |
} |
for(d=0; d<dh[mi][i]; d++){ |
for(d=0; d<dh[mi][i]; d++){ |
newm=savm; |
newm=savm; |
cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM; |
agexact=agev[mw[mi][i]][i]+d*stepm/YEARM; |
|
cov[2]=agexact; |
|
if(nagesqr==1) |
|
cov[3]= agexact*agexact; |
for (kk=1; kk<=cptcovage;kk++) { |
for (kk=1; kk<=cptcovage;kk++) { |
cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2]; |
cov[Tage[kk]+2+nagesqr]=covar[Tvar[Tage[kk]]][i]*agexact; |
} |
} |
|
|
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
Line 1425 double funcone( double *x)
|
Line 2952 double funcone( double *x)
|
{ |
{ |
/* Same as likeli but slower because of a lot of printf and if */ |
/* Same as likeli but slower because of a lot of printf and if */ |
int i, ii, j, k, mi, d, kk; |
int i, ii, j, k, mi, d, kk; |
double l, ll[NLSTATEMAX], cov[NCOVMAX]; |
double l, ll[NLSTATEMAX+1], cov[NCOVMAX+1]; |
double **out; |
double **out; |
double lli; /* Individual log likelihood */ |
double lli; /* Individual log likelihood */ |
double llt; |
double llt; |
int s1, s2; |
int s1, s2; |
double bbh, survp; |
double bbh, survp; |
|
double agexact; |
|
double agebegin, ageend; |
/*extern weight */ |
/*extern weight */ |
/* We are differentiating ll according to initial status */ |
/* We are differentiating ll according to initial status */ |
/* for (i=1;i<=npar;i++) printf("%f ", x[i]);*/ |
/* for (i=1;i<=npar;i++) printf("%f ", x[i]);*/ |
Line 1442 double funcone( double *x)
|
Line 2971 double funcone( double *x)
|
for(k=1; k<=nlstate; k++) ll[k]=0.; |
for(k=1; k<=nlstate; k++) ll[k]=0.; |
|
|
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (i=1,ipmx=0, sw=0.; i<=imx; i++){ |
for (k=1; k<=cptcovn;k++) cov[2+k]=covar[Tvar[k]][i]; |
for (k=1; k<=cptcovn;k++) cov[2+nagesqr+k]=covar[Tvar[k]][i]; |
for(mi=1; mi<= wav[i]-1; mi++){ |
for(mi=1; mi<= wav[i]-1; mi++){ |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (ii=1;ii<=nlstate+ndeath;ii++) |
for (j=1;j<=nlstate+ndeath;j++){ |
for (j=1;j<=nlstate+ndeath;j++){ |
oldm[ii][j]=(ii==j ? 1.0 : 0.0); |
oldm[ii][j]=(ii==j ? 1.0 : 0.0); |
savm[ii][j]=(ii==j ? 1.0 : 0.0); |
savm[ii][j]=(ii==j ? 1.0 : 0.0); |
} |
} |
for(d=0; d<dh[mi][i]; d++){ |
|
|
agebegin=agev[mw[mi][i]][i]; /* Age at beginning of effective wave */ |
|
ageend=agev[mw[mi][i]][i] + (dh[mi][i])*stepm/YEARM; /* Age at end of effective wave and at the end of transition */ |
|
for(d=0; d<dh[mi][i]; d++){ /* Delay between two effective waves */ |
|
/*dh[m][i] or dh[mw[mi][i]][i] is the delay between two effective waves m=mw[mi][i] |
|
and mw[mi+1][i]. dh depends on stepm.*/ |
newm=savm; |
newm=savm; |
cov[2]=agev[mw[mi][i]][i]+d*stepm/YEARM; |
agexact=agev[mw[mi][i]][i]+d*stepm/YEARM; |
|
cov[2]=agexact; |
|
if(nagesqr==1) |
|
cov[3]= agexact*agexact; |
for (kk=1; kk<=cptcovage;kk++) { |
for (kk=1; kk<=cptcovage;kk++) { |
cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2]; |
cov[Tage[kk]+2+nagesqr]=covar[Tvar[Tage[kk]]][i]*agexact; |
} |
} |
|
|
|
/* savm=pmij(pmmij,cov,ncovmodel,x,nlstate); */ |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); |
1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); |
|
/* out=matprod2(newm,oldm,1,nlstate+ndeath,1,nlstate+ndeath, */ |
|
/* 1,nlstate+ndeath,pmij(pmmij,cov,ncovmodel,x,nlstate)); */ |
savm=oldm; |
savm=oldm; |
oldm=newm; |
oldm=newm; |
} /* end mult */ |
} /* end mult */ |
|
|
s1=s[mw[mi][i]][i]; |
s1=s[mw[mi][i]][i]; |
s2=s[mw[mi+1][i]][i]; |
s2=s[mw[mi+1][i]][i]; |
|
/* if(s2==-1){ */ |
|
/* printf(" s1=%d, s2=%d i=%d \n", s1, s2, i); */ |
|
/* /\* exit(1); *\/ */ |
|
/* } */ |
bbh=(double)bh[mi][i]/(double)stepm; |
bbh=(double)bh[mi][i]/(double)stepm; |
/* bias is positive if real duration |
/* bias is positive if real duration |
* is higher than the multiple of stepm and negative otherwise. |
* is higher than the multiple of stepm and negative otherwise. |
*/ |
*/ |
if( s2 > nlstate && (mle <5) ){ /* Jackson */ |
if( s2 > nlstate && (mle <5) ){ /* Jackson */ |
lli=log(out[s1][s2] - savm[s1][s2]); |
lli=log(out[s1][s2] - savm[s1][s2]); |
} else if (mle==1){ |
} else if ( s2==-1 ) { /* alive */ |
|
for (j=1,survp=0. ; j<=nlstate; j++) |
|
survp += (1.+bbh)*out[s1][j]- bbh*savm[s1][j]; |
|
lli= log(survp); |
|
}else if (mle==1){ |
lli= log((1.+bbh)*out[s1][s2]- bbh*savm[s1][s2]); /* linear interpolation */ |
lli= log((1.+bbh)*out[s1][s2]- bbh*savm[s1][s2]); /* linear interpolation */ |
} else if(mle==2){ |
} else if(mle==2){ |
lli= (savm[s1][s2]>(double)1.e-8 ?log((1.+bbh)*out[s1][s2]- bbh*savm[s1][s2]):log((1.+bbh)*out[s1][s2])); /* linear interpolation */ |
lli= (savm[s1][s2]>(double)1.e-8 ?log((1.+bbh)*out[s1][s2]- bbh*savm[s1][s2]):log((1.+bbh)*out[s1][s2])); /* linear interpolation */ |
Line 1477 double funcone( double *x)
|
Line 3026 double funcone( double *x)
|
lli= (savm[s1][s2]>(double)1.e-8 ?(1.+bbh)*log(out[s1][s2])- bbh*log(savm[s1][s2]):log((1.+bbh)*out[s1][s2])); /* exponential inter-extrapolation */ |
lli= (savm[s1][s2]>(double)1.e-8 ?(1.+bbh)*log(out[s1][s2])- bbh*log(savm[s1][s2]):log((1.+bbh)*out[s1][s2])); /* exponential inter-extrapolation */ |
} else if (mle==4){ /* mle=4 no inter-extrapolation */ |
} else if (mle==4){ /* mle=4 no inter-extrapolation */ |
lli=log(out[s1][s2]); /* Original formula */ |
lli=log(out[s1][s2]); /* Original formula */ |
} else{ /* ml>=5 no inter-extrapolation no jackson =0.8a */ |
} else{ /* mle=0 back to 1 */ |
lli=log(out[s1][s2]); /* Original formula */ |
lli= log((1.+bbh)*out[s1][s2]- bbh*savm[s1][s2]); /* linear interpolation */ |
|
/*lli=log(out[s1][s2]); */ /* Original formula */ |
} /* End of if */ |
} /* End of if */ |
ipmx +=1; |
ipmx +=1; |
sw += weight[i]; |
sw += weight[i]; |
ll[s[mw[mi][i]][i]] += 2*weight[i]*lli; |
ll[s[mw[mi][i]][i]] += 2*weight[i]*lli; |
/* printf("i=%6d s1=%1d s2=%1d mi=%1d mw=%1d dh=%3d prob=%10.6f w=%6.4f out=%10.6f sav=%10.6f\n",i,s1,s2,mi,mw[mi][i],dh[mi][i],exp(lli),weight[i],out[s1][s2],savm[s1][s2]); */ |
/*printf("i=%6d s1=%1d s2=%1d mi=%1d mw=%1d dh=%3d prob=%10.6f w=%6.4f out=%10.6f sav=%10.6f\n",i,s1,s2,mi,mw[mi][i],dh[mi][i],exp(lli),weight[i],out[s1][s2],savm[s1][s2]); */ |
if(globpr){ |
if(globpr){ |
fprintf(ficresilk,"%9d %6d %1d %1d %1d %1d %3d %10.6f %6.4f\ |
fprintf(ficresilk,"%9ld %6.1f %6.1f %6d %2d %2d %2d %2d %3d %11.6f %8.4f %8.3f\ |
%10.6f %10.6f %10.6f ", \ |
%11.6f %11.6f %11.6f ", \ |
num[i],i,s1,s2,mi,mw[mi][i],dh[mi][i],exp(lli),weight[i], |
num[i], agebegin, ageend, i,s1,s2,mi,mw[mi][i],dh[mi][i],exp(lli),weight[i],weight[i]*gipmx/gsw, |
2*weight[i]*lli,out[s1][s2],savm[s1][s2]); |
2*weight[i]*lli,out[s1][s2],savm[s1][s2]); |
for(k=1,llt=0.,l=0.; k<=nlstate; k++){ |
for(k=1,llt=0.,l=0.; k<=nlstate; k++){ |
llt +=ll[k]*gipmx/gsw; |
llt +=ll[k]*gipmx/gsw; |
Line 1519 void likelione(FILE *ficres,double p[],
|
Line 3069 void likelione(FILE *ficres,double p[],
|
int k; |
int k; |
|
|
if(*globpri !=0){ /* Just counts and sums, no printings */ |
if(*globpri !=0){ /* Just counts and sums, no printings */ |
strcpy(fileresilk,"ilk"); |
strcpy(fileresilk,"ILK_"); |
strcat(fileresilk,fileres); |
strcat(fileresilk,fileresu); |
if((ficresilk=fopen(fileresilk,"w"))==NULL) { |
if((ficresilk=fopen(fileresilk,"w"))==NULL) { |
printf("Problem with resultfile: %s\n", fileresilk); |
printf("Problem with resultfile: %s\n", fileresilk); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresilk); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresilk); |
} |
} |
fprintf(ficresilk, "#individual(line's_record) s1 s2 wave# effective_wave# number_of_matrices_product pij weight -2ln(pij)*weight 0pij_x 0pij_(x-stepm) cumulating_loglikeli_by_health_state(reweighted=-2ll*weightXnumber_of_contribs/sum_of_weights) and_total\n"); |
fprintf(ficresilk, "#individual(line's_record) count ageb ageend s1 s2 wave# effective_wave# number_of_matrices_product pij weight weight/gpw -2ln(pij)*weight 0pij_x 0pij_(x-stepm) cumulating_loglikeli_by_health_state(reweighted=-2ll*weightXnumber_of_contribs/sum_of_weights) and_total\n"); |
fprintf(ficresilk, "#num_i i s1 s2 mi mw dh likeli weight 2wlli out sav "); |
fprintf(ficresilk, "#num_i ageb agend i s1 s2 mi mw dh likeli weight %%weight 2wlli out sav "); |
/* i,s1,s2,mi,mw[mi][i],dh[mi][i],exp(lli),weight[i],2*weight[i]*lli,out[s1][s2],savm[s1][s2]); */ |
/* i,s1,s2,mi,mw[mi][i],dh[mi][i],exp(lli),weight[i],2*weight[i]*lli,out[s1][s2],savm[s1][s2]); */ |
for(k=1; k<=nlstate; k++) |
for(k=1; k<=nlstate; k++) |
fprintf(ficresilk," -2*gipw/gsw*weight*ll[%d]++",k); |
fprintf(ficresilk," -2*gipw/gsw*weight*ll[%d]++",k); |
Line 1536 void likelione(FILE *ficres,double p[],
|
Line 3086 void likelione(FILE *ficres,double p[],
|
*fretone=(*funcone)(p); |
*fretone=(*funcone)(p); |
if(*globpri !=0){ |
if(*globpri !=0){ |
fclose(ficresilk); |
fclose(ficresilk); |
fprintf(fichtm,"\n<br>File of contributions to the likelihood: <a href=\"%s\">%s</a><br>\n",subdirf(fileresilk),subdirf(fileresilk)); |
if (mle ==0) |
fflush(fichtm); |
fprintf(fichtm,"\n<br>File of contributions to the likelihood computed with initial parameters and mle = %d.",mle); |
} |
else if(mle >=1) |
|
fprintf(fichtm,"\n<br>File of contributions to the likelihood computed with optimized parameters mle = %d.",mle); |
|
fprintf(fichtm," You should at least run with mle >= 1 to get starting values corresponding to the optimized parameters in order to visualize the real contribution of each individual/wave: <a href=\"%s\">%s</a><br>\n",subdirf(fileresilk),subdirf(fileresilk)); |
|
|
|
|
|
for (k=1; k<= nlstate ; k++) { |
|
fprintf(fichtm,"<br>- Probability p<sub>%dj</sub> by origin %d and destination j. Dot's sizes are related to corresponding weight: <a href=\"%s-p%dj.png\">%s-p%dj.png</a><br> \ |
|
<img src=\"%s-p%dj.png\">",k,k,subdirf2(optionfilefiname,"ILK_"),k,subdirf2(optionfilefiname,"ILK_"),k,subdirf2(optionfilefiname,"ILK_"),k); |
|
} |
|
fprintf(fichtm,"<br>- The function drawn is -2Log(L) in Log scale: by state of origin <a href=\"%s-ori.png\">%s-ori.png</a><br> \ |
|
<img src=\"%s-ori.png\">",subdirf2(optionfilefiname,"ILK_"),subdirf2(optionfilefiname,"ILK_"),subdirf2(optionfilefiname,"ILK_")); |
|
fprintf(fichtm,"<br>- and by state of destination <a href=\"%s-dest.png\">%s-dest.png</a><br> \ |
|
<img src=\"%s-dest.png\">",subdirf2(optionfilefiname,"ILK_"),subdirf2(optionfilefiname,"ILK_"),subdirf2(optionfilefiname,"ILK_")); |
|
fflush(fichtm); |
|
} |
return; |
return; |
} |
} |
|
|
Line 1547 void likelione(FILE *ficres,double p[],
|
Line 3111 void likelione(FILE *ficres,double p[],
|
|
|
void mlikeli(FILE *ficres,double p[], int npar, int ncovmodel, int nlstate, double ftol, double (*func)(double [])) |
void mlikeli(FILE *ficres,double p[], int npar, int ncovmodel, int nlstate, double ftol, double (*func)(double [])) |
{ |
{ |
int i,j, iter; |
int i,j, iter=0; |
double **xi; |
double **xi; |
double fret; |
double fret; |
double fretone; /* Only one call to likelihood */ |
double fretone; /* Only one call to likelihood */ |
/* char filerespow[FILENAMELENGTH];*/ |
/* char filerespow[FILENAMELENGTH];*/ |
|
|
|
#ifdef NLOPT |
|
int creturn; |
|
nlopt_opt opt; |
|
/* double lb[9] = { -HUGE_VAL, -HUGE_VAL, -HUGE_VAL, -HUGE_VAL, -HUGE_VAL, -HUGE_VAL, -HUGE_VAL, -HUGE_VAL, -HUGE_VAL }; /\* lower bounds *\/ */ |
|
double *lb; |
|
double minf; /* the minimum objective value, upon return */ |
|
double * p1; /* Shifted parameters from 0 instead of 1 */ |
|
myfunc_data dinst, *d = &dinst; |
|
#endif |
|
|
|
|
xi=matrix(1,npar,1,npar); |
xi=matrix(1,npar,1,npar); |
for (i=1;i<=npar;i++) |
for (i=1;i<=npar;i++) |
for (j=1;j<=npar;j++) |
for (j=1;j<=npar;j++) |
xi[i][j]=(i==j ? 1.0 : 0.0); |
xi[i][j]=(i==j ? 1.0 : 0.0); |
printf("Powell\n"); fprintf(ficlog,"Powell\n"); |
printf("Powell\n"); fprintf(ficlog,"Powell\n"); |
strcpy(filerespow,"pow"); |
strcpy(filerespow,"POW_"); |
strcat(filerespow,fileres); |
strcat(filerespow,fileres); |
if((ficrespow=fopen(filerespow,"w"))==NULL) { |
if((ficrespow=fopen(filerespow,"w"))==NULL) { |
printf("Problem with resultfile: %s\n", filerespow); |
printf("Problem with resultfile: %s\n", filerespow); |
Line 1568 void mlikeli(FILE *ficres,double p[], in
|
Line 3144 void mlikeli(FILE *ficres,double p[], in
|
for(j=1;j<=nlstate+ndeath;j++) |
for(j=1;j<=nlstate+ndeath;j++) |
if(j!=i)fprintf(ficrespow," p%1d%1d",i,j); |
if(j!=i)fprintf(ficrespow," p%1d%1d",i,j); |
fprintf(ficrespow,"\n"); |
fprintf(ficrespow,"\n"); |
|
#ifdef POWELL |
powell(p,xi,npar,ftol,&iter,&fret,func); |
powell(p,xi,npar,ftol,&iter,&fret,func); |
|
#endif |
|
|
|
#ifdef NLOPT |
|
#ifdef NEWUOA |
|
opt = nlopt_create(NLOPT_LN_NEWUOA,npar); |
|
#else |
|
opt = nlopt_create(NLOPT_LN_BOBYQA,npar); |
|
#endif |
|
lb=vector(0,npar-1); |
|
for (i=0;i<npar;i++) lb[i]= -HUGE_VAL; |
|
nlopt_set_lower_bounds(opt, lb); |
|
nlopt_set_initial_step1(opt, 0.1); |
|
|
|
p1= (p+1); /* p *(p+1)@8 and p *(p1)@8 are equal p1[0]=p[1] */ |
|
d->function = func; |
|
printf(" Func %.12lf \n",myfunc(npar,p1,NULL,d)); |
|
nlopt_set_min_objective(opt, myfunc, d); |
|
nlopt_set_xtol_rel(opt, ftol); |
|
if ((creturn=nlopt_optimize(opt, p1, &minf)) < 0) { |
|
printf("nlopt failed! %d\n",creturn); |
|
} |
|
else { |
|
printf("found minimum after %d evaluations (NLOPT=%d)\n", countcallfunc ,NLOPT); |
|
printf("found minimum at f(%g,%g) = %0.10g\n", p[0], p[1], minf); |
|
iter=1; /* not equal */ |
|
} |
|
nlopt_destroy(opt); |
|
#endif |
|
free_matrix(xi,1,npar,1,npar); |
fclose(ficrespow); |
fclose(ficrespow); |
printf("\n#Number of iterations = %d, -2 Log likelihood = %.12f\n",iter,func(p)); |
printf("\n#Number of iterations & function calls = %d & %d, -2 Log likelihood = %.12f\n",iter, countcallfunc,func(p)); |
fprintf(ficlog,"\n#Number of iterations = %d, -2 Log likelihood = %.12f \n",iter,func(p)); |
fprintf(ficlog,"\n#Number of iterations & function calls = %d & %d, -2 Log likelihood = %.12f\n",iter, countcallfunc,func(p)); |
fprintf(ficres,"#Number of iterations = %d, -2 Log likelihood = %.12f \n",iter,func(p)); |
fprintf(ficres,"#Number of iterations & function calls = %d & %d, -2 Log likelihood = %.12f\n",iter, countcallfunc,func(p)); |
|
|
} |
} |
|
|
/**** Computes Hessian and covariance matrix ***/ |
/**** Computes Hessian and covariance matrix ***/ |
void hesscov(double **matcov, double p[], int npar, double delti[], double ftolhess, double (*func)(double [])) |
void hesscov(double **matcov, double **hess, double p[], int npar, double delti[], double ftolhess, double (*func)(double [])) |
{ |
{ |
double **a,**y,*x,pd; |
double **a,**y,*x,pd; |
double **hess; |
/* double **hess; */ |
int i, j,jk; |
int i, j; |
int *indx; |
int *indx; |
|
|
double hessii(double p[], double delta, int theta, double delti[],double (*func)(double []),int npar); |
double hessii(double p[], double delta, int theta, double delti[],double (*func)(double []),int npar); |
double hessij(double p[], double delti[], int i, int j,double (*func)(double []),int npar); |
double hessij(double p[], double **hess, double delti[], int i, int j,double (*func)(double []),int npar); |
void lubksb(double **a, int npar, int *indx, double b[]) ; |
void lubksb(double **a, int npar, int *indx, double b[]) ; |
void ludcmp(double **a, int npar, int *indx, double *d) ; |
void ludcmp(double **a, int npar, int *indx, double *d) ; |
double gompertz(double p[]); |
double gompertz(double p[]); |
hess=matrix(1,npar,1,npar); |
/* hess=matrix(1,npar,1,npar); */ |
|
|
printf("\nCalculation of the hessian matrix. Wait...\n"); |
printf("\nCalculation of the hessian matrix. Wait...\n"); |
fprintf(ficlog,"\nCalculation of the hessian matrix. Wait...\n"); |
fprintf(ficlog,"\nCalculation of the hessian matrix. Wait...\n"); |
for (i=1;i<=npar;i++){ |
for (i=1;i<=npar;i++){ |
printf("%d",i);fflush(stdout); |
printf("%d-",i);fflush(stdout); |
fprintf(ficlog,"%d",i);fflush(ficlog); |
fprintf(ficlog,"%d-",i);fflush(ficlog); |
|
|
hess[i][i]=hessii(p,ftolhess,i,delti,func,npar); |
hess[i][i]=hessii(p,ftolhess,i,delti,func,npar); |
|
|
Line 1608 void hesscov(double **matcov, double p[]
|
Line 3212 void hesscov(double **matcov, double p[]
|
for (i=1;i<=npar;i++) { |
for (i=1;i<=npar;i++) { |
for (j=1;j<=npar;j++) { |
for (j=1;j<=npar;j++) { |
if (j>i) { |
if (j>i) { |
printf(".%d%d",i,j);fflush(stdout); |
printf(".%d-%d",i,j);fflush(stdout); |
fprintf(ficlog,".%d%d",i,j);fflush(ficlog); |
fprintf(ficlog,".%d-%d",i,j);fflush(ficlog); |
hess[i][j]=hessij(p,delti,i,j,func,npar); |
hess[i][j]=hessij(p,hess, delti,i,j,func,npar); |
|
|
hess[j][i]=hess[i][j]; |
hess[j][i]=hess[i][j]; |
/*printf(" %lf ",hess[i][j]);*/ |
/*printf(" %lf ",hess[i][j]);*/ |
Line 1644 void hesscov(double **matcov, double p[]
|
Line 3248 void hesscov(double **matcov, double p[]
|
fprintf(ficlog,"\n#Hessian matrix#\n"); |
fprintf(ficlog,"\n#Hessian matrix#\n"); |
for (i=1;i<=npar;i++) { |
for (i=1;i<=npar;i++) { |
for (j=1;j<=npar;j++) { |
for (j=1;j<=npar;j++) { |
printf("%.3e ",hess[i][j]); |
printf("%.6e ",hess[i][j]); |
fprintf(ficlog,"%.3e ",hess[i][j]); |
fprintf(ficlog,"%.6e ",hess[i][j]); |
} |
} |
printf("\n"); |
printf("\n"); |
fprintf(ficlog,"\n"); |
fprintf(ficlog,"\n"); |
} |
} |
|
|
|
/* printf("\n#Covariance matrix#\n"); */ |
|
/* fprintf(ficlog,"\n#Covariance matrix#\n"); */ |
|
/* for (i=1;i<=npar;i++) { */ |
|
/* for (j=1;j<=npar;j++) { */ |
|
/* printf("%.6e ",matcov[i][j]); */ |
|
/* fprintf(ficlog,"%.6e ",matcov[i][j]); */ |
|
/* } */ |
|
/* printf("\n"); */ |
|
/* fprintf(ficlog,"\n"); */ |
|
/* } */ |
|
|
/* Recompute Inverse */ |
/* Recompute Inverse */ |
for (i=1;i<=npar;i++) |
/* for (i=1;i<=npar;i++) */ |
for (j=1;j<=npar;j++) a[i][j]=matcov[i][j]; |
/* for (j=1;j<=npar;j++) a[i][j]=matcov[i][j]; */ |
ludcmp(a,npar,indx,&pd); |
/* ludcmp(a,npar,indx,&pd); */ |
|
|
|
/* printf("\n#Hessian matrix recomputed#\n"); */ |
|
|
|
/* for (j=1;j<=npar;j++) { */ |
|
/* for (i=1;i<=npar;i++) x[i]=0; */ |
|
/* x[j]=1; */ |
|
/* lubksb(a,npar,indx,x); */ |
|
/* for (i=1;i<=npar;i++){ */ |
|
/* y[i][j]=x[i]; */ |
|
/* printf("%.3e ",y[i][j]); */ |
|
/* fprintf(ficlog,"%.3e ",y[i][j]); */ |
|
/* } */ |
|
/* printf("\n"); */ |
|
/* fprintf(ficlog,"\n"); */ |
|
/* } */ |
|
|
|
/* Verifying the inverse matrix */ |
|
#ifdef DEBUGHESS |
|
y=matprod2(y,hess,1,npar,1,npar,1,npar,matcov); |
|
|
/* printf("\n#Hessian matrix recomputed#\n"); |
printf("\n#Verification: multiplying the matrix of covariance by the Hessian matrix, should be unity:#\n"); |
|
fprintf(ficlog,"\n#Verification: multiplying the matrix of covariance by the Hessian matrix. Should be unity:#\n"); |
|
|
for (j=1;j<=npar;j++) { |
for (j=1;j<=npar;j++) { |
for (i=1;i<=npar;i++) x[i]=0; |
|
x[j]=1; |
|
lubksb(a,npar,indx,x); |
|
for (i=1;i<=npar;i++){ |
for (i=1;i<=npar;i++){ |
y[i][j]=x[i]; |
printf("%.2f ",y[i][j]); |
printf("%.3e ",y[i][j]); |
fprintf(ficlog,"%.2f ",y[i][j]); |
fprintf(ficlog,"%.3e ",y[i][j]); |
|
} |
} |
printf("\n"); |
printf("\n"); |
fprintf(ficlog,"\n"); |
fprintf(ficlog,"\n"); |
} |
} |
*/ |
#endif |
|
|
free_matrix(a,1,npar,1,npar); |
free_matrix(a,1,npar,1,npar); |
free_matrix(y,1,npar,1,npar); |
free_matrix(y,1,npar,1,npar); |
free_vector(x,1,npar); |
free_vector(x,1,npar); |
free_ivector(indx,1,npar); |
free_ivector(indx,1,npar); |
free_matrix(hess,1,npar,1,npar); |
/* free_matrix(hess,1,npar,1,npar); */ |
|
|
|
|
} |
} |
|
|
/*************** hessian matrix ****************/ |
/*************** hessian matrix ****************/ |
double hessii(double x[], double delta, int theta, double delti[], double (*func)(double []), int npar) |
double hessii(double x[], double delta, int theta, double delti[], double (*func)(double []), int npar) |
{ |
{ /* Around values of x, computes the function func and returns the scales delti and hessian */ |
int i; |
int i; |
int l=1, lmax=20; |
int l=1, lmax=20; |
double k1,k2; |
double k1,k2, res, fx; |
double p2[NPARMAX+1]; |
double p2[MAXPARM+1]; /* identical to x */ |
double res; |
|
double delt=0.0001, delts, nkhi=10.,nkhif=1., khi=1.e-4; |
double delt=0.0001, delts, nkhi=10.,nkhif=1., khi=1.e-4; |
double fx; |
|
int k=0,kmax=10; |
int k=0,kmax=10; |
double l1; |
double l1; |
|
|
fx=func(x); |
fx=func(x); |
for (i=1;i<=npar;i++) p2[i]=x[i]; |
for (i=1;i<=npar;i++) p2[i]=x[i]; |
for(l=0 ; l <=lmax; l++){ |
for(l=0 ; l <=lmax; l++){ /* Enlarging the zone around the Maximum */ |
l1=pow(10,l); |
l1=pow(10,l); |
delts=delt; |
delts=delt; |
for(k=1 ; k <kmax; k=k+1){ |
for(k=1 ; k <kmax; k=k+1){ |
delt = delta*(l1*k); |
delt = delta*(l1*k); |
p2[theta]=x[theta] +delt; |
p2[theta]=x[theta] +delt; |
k1=func(p2)-fx; |
k1=func(p2)-fx; /* Might be negative if too close to the theoretical maximum */ |
p2[theta]=x[theta]-delt; |
p2[theta]=x[theta]-delt; |
k2=func(p2)-fx; |
k2=func(p2)-fx; |
/*res= (k1-2.0*fx+k2)/delt/delt; */ |
/*res= (k1-2.0*fx+k2)/delt/delt; */ |
res= (k1+k2)/delt/delt/2.; /* Divided by because L and not 2*L */ |
res= (k1+k2)/delt/delt/2.; /* Divided by 2 because L and not 2*L */ |
|
|
#ifdef DEBUG |
#ifdef DEBUGHESSII |
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); |
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); |
fprintf(ficlog,"%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); |
fprintf(ficlog,"%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); |
#endif |
#endif |
Line 1717 double hessii(double x[], double delta,
|
Line 3346 double hessii(double x[], double delta,
|
k=kmax; |
k=kmax; |
} |
} |
else if((k1 >khi/nkhif) || (k2 >khi/nkhif)){ /* Keeps lastvalue before 3.84/2 KHI2 5% 1d.f. */ |
else if((k1 >khi/nkhif) || (k2 >khi/nkhif)){ /* Keeps lastvalue before 3.84/2 KHI2 5% 1d.f. */ |
k=kmax; l=lmax*10.; |
k=kmax; l=lmax*10; |
} |
} |
else if((k1 >khi/nkhi) || (k2 >khi/nkhi)){ |
else if((k1 >khi/nkhi) || (k2 >khi/nkhi)){ |
delts=delt; |
delts=delt; |
} |
} |
} |
} /* End loop k */ |
} |
} |
delti[theta]=delts; |
delti[theta]=delts; |
return res; |
return res; |
|
|
} |
} |
|
|
double hessij( double x[], double delti[], int thetai,int thetaj,double (*func)(double []),int npar) |
double hessij( double x[], double **hess, double delti[], int thetai,int thetaj,double (*func)(double []),int npar) |
{ |
{ |
int i; |
int i; |
int l=1, l1, lmax=20; |
int l=1, lmax=20; |
double k1,k2,k3,k4,res,fx; |
double k1,k2,k3,k4,res,fx; |
double p2[NPARMAX+1]; |
double p2[MAXPARM+1]; |
int k; |
int k, kmax=1; |
|
double v1, v2, cv12, lc1, lc2; |
|
|
|
int firstime=0; |
|
|
fx=func(x); |
fx=func(x); |
for (k=1; k<=2; k++) { |
for (k=1; k<=kmax; k=k+10) { |
for (i=1;i<=npar;i++) p2[i]=x[i]; |
for (i=1;i<=npar;i++) p2[i]=x[i]; |
p2[thetai]=x[thetai]+delti[thetai]/k; |
p2[thetai]=x[thetai]+delti[thetai]*k; |
p2[thetaj]=x[thetaj]+delti[thetaj]/k; |
p2[thetaj]=x[thetaj]+delti[thetaj]*k; |
k1=func(p2)-fx; |
k1=func(p2)-fx; |
|
|
p2[thetai]=x[thetai]+delti[thetai]/k; |
p2[thetai]=x[thetai]+delti[thetai]*k; |
p2[thetaj]=x[thetaj]-delti[thetaj]/k; |
p2[thetaj]=x[thetaj]-delti[thetaj]*k; |
k2=func(p2)-fx; |
k2=func(p2)-fx; |
|
|
p2[thetai]=x[thetai]-delti[thetai]/k; |
p2[thetai]=x[thetai]-delti[thetai]*k; |
p2[thetaj]=x[thetaj]+delti[thetaj]/k; |
p2[thetaj]=x[thetaj]+delti[thetaj]*k; |
k3=func(p2)-fx; |
k3=func(p2)-fx; |
|
|
p2[thetai]=x[thetai]-delti[thetai]/k; |
p2[thetai]=x[thetai]-delti[thetai]*k; |
p2[thetaj]=x[thetaj]-delti[thetaj]/k; |
p2[thetaj]=x[thetaj]-delti[thetaj]*k; |
k4=func(p2)-fx; |
k4=func(p2)-fx; |
res=(k1-k2-k3+k4)/4.0/delti[thetai]*k/delti[thetaj]*k/2.; /* Because of L not 2*L */ |
res=(k1-k2-k3+k4)/4.0/delti[thetai]/k/delti[thetaj]/k/2.; /* Because of L not 2*L */ |
#ifdef DEBUG |
if(k1*k2*k3*k4 <0.){ |
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); |
firstime=1; |
fprintf(ficlog,"%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); |
kmax=kmax+10; |
|
} |
|
if(kmax >=10 || firstime ==1){ |
|
printf("Warning: directions %d-%d, you are not estimating the Hessian at the exact maximum likelihood; increase ftol=%.2e\n",thetai,thetaj, ftol); |
|
fprintf(ficlog,"Warning: directions %d-%d, you are not estimating the Hessian at the exact maximum likelihood; increase ftol=%.2e\n",thetai,thetaj, ftol); |
|
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); |
|
fprintf(ficlog,"%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); |
|
} |
|
#ifdef DEBUGHESSIJ |
|
v1=hess[thetai][thetai]; |
|
v2=hess[thetaj][thetaj]; |
|
cv12=res; |
|
/* Computing eigen value of Hessian matrix */ |
|
lc1=((v1+v2)+sqrt((v1+v2)*(v1+v2) - 4*(v1*v2-cv12*cv12)))/2.; |
|
lc2=((v1+v2)-sqrt((v1+v2)*(v1+v2) - 4*(v1*v2-cv12*cv12)))/2.; |
|
if ((lc2 <0) || (lc1 <0) ){ |
|
printf("Warning: sub Hessian matrix '%d%d' does not have positive eigen values \n",thetai,thetaj); |
|
fprintf(ficlog, "Warning: sub Hessian matrix '%d%d' does not have positive eigen values \n",thetai,thetaj); |
|
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); |
|
fprintf(ficlog,"%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); |
|
} |
#endif |
#endif |
} |
} |
return res; |
return res; |
} |
} |
|
|
|
/* Not done yet: Was supposed to fix if not exactly at the maximum */ |
|
/* double hessij( double x[], double delti[], int thetai,int thetaj,double (*func)(double []),int npar) */ |
|
/* { */ |
|
/* int i; */ |
|
/* int l=1, lmax=20; */ |
|
/* double k1,k2,k3,k4,res,fx; */ |
|
/* double p2[MAXPARM+1]; */ |
|
/* double delt=0.0001, delts, nkhi=10.,nkhif=1., khi=1.e-4; */ |
|
/* int k=0,kmax=10; */ |
|
/* double l1; */ |
|
|
|
/* fx=func(x); */ |
|
/* for(l=0 ; l <=lmax; l++){ /\* Enlarging the zone around the Maximum *\/ */ |
|
/* l1=pow(10,l); */ |
|
/* delts=delt; */ |
|
/* for(k=1 ; k <kmax; k=k+1){ */ |
|
/* delt = delti*(l1*k); */ |
|
/* for (i=1;i<=npar;i++) p2[i]=x[i]; */ |
|
/* p2[thetai]=x[thetai]+delti[thetai]/k; */ |
|
/* p2[thetaj]=x[thetaj]+delti[thetaj]/k; */ |
|
/* k1=func(p2)-fx; */ |
|
|
|
/* p2[thetai]=x[thetai]+delti[thetai]/k; */ |
|
/* p2[thetaj]=x[thetaj]-delti[thetaj]/k; */ |
|
/* k2=func(p2)-fx; */ |
|
|
|
/* p2[thetai]=x[thetai]-delti[thetai]/k; */ |
|
/* p2[thetaj]=x[thetaj]+delti[thetaj]/k; */ |
|
/* k3=func(p2)-fx; */ |
|
|
|
/* p2[thetai]=x[thetai]-delti[thetai]/k; */ |
|
/* p2[thetaj]=x[thetaj]-delti[thetaj]/k; */ |
|
/* k4=func(p2)-fx; */ |
|
/* res=(k1-k2-k3+k4)/4.0/delti[thetai]*k/delti[thetaj]*k/2.; /\* Because of L not 2*L *\/ */ |
|
/* #ifdef DEBUGHESSIJ */ |
|
/* 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); */ |
|
/* fprintf(ficlog,"%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); */ |
|
/* #endif */ |
|
/* if((k1 <khi/nkhi/2.) || (k2 <khi/nkhi/2.)|| (k4 <khi/nkhi/2.)|| (k4 <khi/nkhi/2.)){ */ |
|
/* k=kmax; */ |
|
/* } */ |
|
/* else if((k1 >khi/nkhif) || (k2 >khi/nkhif) || (k4 >khi/nkhif) || (k4 >khi/nkhif)){ /\* Keeps lastvalue before 3.84/2 KHI2 5% 1d.f. *\/ */ |
|
/* k=kmax; l=lmax*10; */ |
|
/* } */ |
|
/* else if((k1 >khi/nkhi) || (k2 >khi/nkhi)){ */ |
|
/* delts=delt; */ |
|
/* } */ |
|
/* } /\* End loop k *\/ */ |
|
/* } */ |
|
/* delti[theta]=delts; */ |
|
/* return res; */ |
|
/* } */ |
|
|
|
|
/************** Inverse of matrix **************/ |
/************** Inverse of matrix **************/ |
void ludcmp(double **a, int n, int *indx, double *d) |
void ludcmp(double **a, int n, int *indx, double *d) |
{ |
{ |
Line 1838 void lubksb(double **a, int n, int *indx
|
Line 3544 void lubksb(double **a, int n, int *indx
|
} |
} |
} |
} |
|
|
|
void pstamp(FILE *fichier) |
|
{ |
|
fprintf(fichier,"# %s.%s\n#IMaCh version %s, %s\n#%s\n# %s", optionfilefiname,optionfilext,version,copyright, fullversion, strstart); |
|
} |
|
|
/************ Frequencies ********************/ |
/************ Frequencies ********************/ |
void freqsummary(char fileres[], int iagemin, int iagemax, int **s, double **agev, int nlstate, int imx, int *Tvaraff, int **nbcode, int *ncodemax,double **mint,double **anint) |
void freqsummary(char fileres[], int iagemin, int iagemax, int **s, double **agev, int nlstate, int imx, \ |
|
int *Tvaraff, int **nbcode, int *ncodemax,double **mint,double **anint, char strstart[],\ |
|
int firstpass, int lastpass, int stepm, int weightopt, char model[]) |
{ /* Some frequencies */ |
{ /* Some frequencies */ |
|
|
int i, m, jk, k1,i1, j1, bool, z1,z2,j; |
int i, m, jk, j1, bool, z1,j; |
|
int mi; /* Effective wave */ |
int first; |
int first; |
double ***freq; /* Frequencies */ |
double ***freq; /* Frequencies */ |
double *pp, **prop; |
double *pp, **prop; |
double pos,posprop, k2, dateintsum=0,k2cpt=0; |
double pos,posprop, k2, dateintsum=0,k2cpt=0; |
FILE *ficresp; |
char fileresp[FILENAMELENGTH], fileresphtm[FILENAMELENGTH], fileresphtmfr[FILENAMELENGTH]; |
char fileresp[FILENAMELENGTH]; |
double agebegin, ageend; |
|
|
pp=vector(1,nlstate); |
pp=vector(1,nlstate); |
prop=matrix(1,nlstate,iagemin,iagemax+3); |
prop=matrix(1,nlstate,iagemin,iagemax+3); |
strcpy(fileresp,"p"); |
strcpy(fileresp,"P_"); |
strcat(fileresp,fileres); |
strcat(fileresp,fileresu); |
|
/*strcat(fileresphtm,fileresu);*/ |
if((ficresp=fopen(fileresp,"w"))==NULL) { |
if((ficresp=fopen(fileresp,"w"))==NULL) { |
printf("Problem with prevalence resultfile: %s\n", fileresp); |
printf("Problem with prevalence resultfile: %s\n", fileresp); |
fprintf(ficlog,"Problem with prevalence resultfile: %s\n", fileresp); |
fprintf(ficlog,"Problem with prevalence resultfile: %s\n", fileresp); |
exit(0); |
exit(0); |
} |
} |
freq= ma3x(-1,nlstate+ndeath,-1,nlstate+ndeath,iagemin,iagemax+3); |
|
|
strcpy(fileresphtm,subdirfext(optionfilefiname,"PHTM_",".htm")); |
|
if((ficresphtm=fopen(fileresphtm,"w"))==NULL) { |
|
printf("Problem with prevalence HTM resultfile '%s' with errno='%s'\n",fileresphtm,strerror(errno)); |
|
fprintf(ficlog,"Problem with prevalence HTM resultfile '%s' with errno='%s'\n",fileresphtm,strerror(errno)); |
|
fflush(ficlog); |
|
exit(70); |
|
} |
|
else{ |
|
fprintf(ficresphtm,"<html><head>\n<title>IMaCh PHTM_ %s</title></head>\n <body><font size=\"2\">%s <br> %s</font> \ |
|
<hr size=\"2\" color=\"#EC5E5E\"> \n\ |
|
Title=%s <br>Datafile=%s Firstpass=%d Lastpass=%d Stepm=%d Weight=%d Model=1+age+%s<br>\n",\ |
|
fileresphtm,version,fullversion,title,datafile,firstpass,lastpass,stepm, weightopt, model); |
|
} |
|
fprintf(ficresphtm,"Current page is file <a href=\"%s\">%s</a><br>\n\n<h4>Frequencies and prevalence by age at begin of transition</h4>\n",fileresphtm, fileresphtm); |
|
|
|
strcpy(fileresphtmfr,subdirfext(optionfilefiname,"PHTMFR_",".htm")); |
|
if((ficresphtmfr=fopen(fileresphtmfr,"w"))==NULL) { |
|
printf("Problem with frequency table HTM resultfile '%s' with errno='%s'\n",fileresphtmfr,strerror(errno)); |
|
fprintf(ficlog,"Problem with frequency table HTM resultfile '%s' with errno='%s'\n",fileresphtmfr,strerror(errno)); |
|
fflush(ficlog); |
|
exit(70); |
|
} |
|
else{ |
|
fprintf(ficresphtmfr,"<html><head>\n<title>IMaCh PHTM_Frequency table %s</title></head>\n <body><font size=\"2\">%s <br> %s</font> \ |
|
<hr size=\"2\" color=\"#EC5E5E\"> \n\ |
|
Title=%s <br>Datafile=%s Firstpass=%d Lastpass=%d Stepm=%d Weight=%d Model=1+age+%s<br>\n",\ |
|
fileresphtmfr,version,fullversion,title,datafile,firstpass,lastpass,stepm, weightopt, model); |
|
} |
|
fprintf(ficresphtmfr,"Current page is file <a href=\"%s\">%s</a><br>\n\n<h4>Frequencies of all effective transitions by age at begin of transition </h4>Unknown status is -1<br/>\n",fileresphtmfr, fileresphtmfr); |
|
|
|
freq= ma3x(-5,nlstate+ndeath,-5,nlstate+ndeath,iagemin,iagemax+3); |
j1=0; |
j1=0; |
|
|
j=cptcoveff; |
j=cptcoveff; |
Line 1867 void freqsummary(char fileres[], int ia
|
Line 3613 void freqsummary(char fileres[], int ia
|
|
|
first=1; |
first=1; |
|
|
for(k1=1; k1<=j;k1++){ |
for (j1 = 1; j1 <= (int) pow(2,cptcoveff); j1++){ /* Loop on covariates combination */ |
for(i1=1; i1<=ncodemax[k1];i1++){ |
|
j1++; |
|
/*printf("cptcoveff=%d Tvaraff=%d", cptcoveff,Tvaraff[1]); |
/*printf("cptcoveff=%d Tvaraff=%d", cptcoveff,Tvaraff[1]); |
scanf("%d", i);*/ |
scanf("%d", i);*/ |
for (i=-1; i<=nlstate+ndeath; i++) |
for (i=-5; i<=nlstate+ndeath; i++) |
for (jk=-1; jk<=nlstate+ndeath; jk++) |
for (jk=-5; jk<=nlstate+ndeath; jk++) |
for(m=iagemin; m <= iagemax+3; m++) |
for(m=iagemin; m <= iagemax+3; m++) |
freq[i][jk][m]=0; |
freq[i][jk][m]=0; |
|
|
for (i=1; i<=nlstate; i++) |
for (i=1; i<=nlstate; i++) |
for(m=iagemin; m <= iagemax+3; m++) |
for(m=iagemin; m <= iagemax+3; m++) |
prop[i][m]=0; |
prop[i][m]=0; |
|
|
dateintsum=0; |
dateintsum=0; |
k2cpt=0; |
k2cpt=0; |
for (i=1; i<=imx; i++) { |
for (i=1; i<=imx; i++) { /* For each individual i */ |
bool=1; |
bool=1; |
if (cptcovn>0) { |
if (cptcovn>0) { /* Filter is here: Must be looked at for model=V1+V2+V3+V4 */ |
for (z1=1; z1<=cptcoveff; z1++) |
for (z1=1; z1<=cptcoveff; z1++) |
if (covar[Tvaraff[z1]][i]!= nbcode[Tvaraff[z1]][codtab[j1][z1]]) |
if (covar[Tvaraff[z1]][i]!= nbcode[Tvaraff[z1]][codtabm(j1,z1)]){ |
bool=0; |
/* Tests if the value of each of the covariates of i is equal to filter j1 */ |
} |
bool=0; |
|
/* printf("bool=%d i=%d, z1=%d, Tvaraff[%d]=%d, covar[Tvarff][%d]=%2f, codtabm(%d,%d)=%d, nbcode[Tvaraff][codtabm(%d,%d)=%d, j1=%d\n", |
|
bool,i,z1, z1, Tvaraff[z1],i,covar[Tvaraff[z1]][i],j1,z1,codtabm(j1,z1), |
|
j1,z1,nbcode[Tvaraff[z1]][codtabm(j1,z1)],j1);*/ |
|
/* For j1=7 in V1+V2+V3+V4 = 0 1 1 0 and codtabm(7,3)=1 and nbcde[3][?]=1*/ |
|
} |
|
} /* cptcovn > 0 */ |
|
|
if (bool==1){ |
if (bool==1){ |
for(m=firstpass; m<=lastpass; m++){ |
/* for(m=firstpass; m<=lastpass; m++){ */ |
k2=anint[m][i]+(mint[m][i]/12.); |
for(mi=1; mi<wav[i];mi++){ |
/*if ((k2>=dateprev1) && (k2<=dateprev2)) {*/ |
m=mw[mi][i]; |
if(agev[m][i]==0) agev[m][i]=iagemax+1; |
/* dh[m][i] or dh[mw[mi][i]][i] is the delay between two effective (mi) waves m=mw[mi][i] |
if(agev[m][i]==1) agev[m][i]=iagemax+2; |
and mw[mi+1][i]. dh depends on stepm. */ |
if (s[m][i]>0 && s[m][i]<=nlstate) prop[s[m][i]][(int)agev[m][i]] += weight[i]; |
agebegin=agev[m][i]; /* Age at beginning of wave before transition*/ |
|
ageend=agev[m][i]+(dh[m][i])*stepm/YEARM; /* Age at end of wave and transition */ |
|
if(m >=firstpass && m <=lastpass){ |
|
k2=anint[m][i]+(mint[m][i]/12.); |
|
/*if ((k2>=dateprev1) && (k2<=dateprev2)) {*/ |
|
if(agev[m][i]==0) agev[m][i]=iagemax+1; /* All ages equal to 0 are in iagemax+1 */ |
|
if(agev[m][i]==1) agev[m][i]=iagemax+2; /* All ages equal to 1 are in iagemax+2 */ |
|
if (s[m][i]>0 && s[m][i]<=nlstate) /* If status at wave m is known and a live state */ |
|
prop[s[m][i]][(int)agev[m][i]] += weight[i]; /* At age of beginning of transition, where status is known */ |
if (m<lastpass) { |
if (m<lastpass) { |
freq[s[m][i]][s[m+1][i]][(int)agev[m][i]] += weight[i]; |
/* if(s[m][i]==4 && s[m+1][i]==4) */ |
freq[s[m][i]][s[m+1][i]][iagemax+3] += weight[i]; |
/* printf(" num=%ld m=%d, i=%d s1=%d s2=%d agev at m=%d\n", num[i], m, i,s[m][i],s[m+1][i], (int)agev[m][i]); */ |
} |
if(s[m][i]==-1) |
|
printf(" num=%ld m=%d, i=%d s1=%d s2=%d agev at m=%d agebegin=%.2f ageend=%.2f, agemed=%d\n", num[i], m, i,s[m][i],s[m+1][i], (int)agev[m][i],agebegin, ageend, (int)((agebegin+ageend)/2.)); |
if ((agev[m][i]>1) && (agev[m][i]< (iagemax+3))) { |
freq[s[m][i]][s[m+1][i]][(int)agev[m][i]] += weight[i]; /* At age of beginning of transition, where status is known */ |
dateintsum=dateintsum+k2; |
/* freq[s[m][i]][s[m+1][i]][(int)((agebegin+ageend)/2.)] += weight[i]; */ |
k2cpt++; |
freq[s[m][i]][s[m+1][i]][iagemax+3] += weight[i]; /* Total is in iagemax+3 *//* At age of beginning of transition, where status is known */ |
} |
} |
/*}*/ |
} |
} |
if ((agev[m][i]>1) && (agev[m][i]< (iagemax+3)) && (anint[m][i]!=9999) && (mint[m][i]!=99)) { |
} |
dateintsum=dateintsum+k2; |
} |
k2cpt++; |
|
/* printf("i=%ld dateintmean = %lf dateintsum=%lf k2cpt=%lf k2=%lf\n",i, dateintsum/k2cpt, dateintsum,k2cpt, k2); */ |
|
} |
|
/*}*/ |
|
} /* end m */ |
|
} /* end bool */ |
|
} /* end i = 1 to imx */ |
|
|
/* fprintf(ficresp, "#Count between %.lf/%.lf/%.lf and %.lf/%.lf/%.lf\n",jprev1, mprev1,anprev1,jprev2, mprev2,anprev2);*/ |
/* fprintf(ficresp, "#Count between %.lf/%.lf/%.lf and %.lf/%.lf/%.lf\n",jprev1, mprev1,anprev1,jprev2, mprev2,anprev2);*/ |
|
pstamp(ficresp); |
if (cptcovn>0) { |
if (cptcovn>0) { |
fprintf(ficresp, "\n#********** Variable "); |
fprintf(ficresp, "\n#********** Variable "); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficresp, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtab[j1][z1]]); |
fprintf(ficresphtm, "\n<br/><br/><h3>********** Variable "); |
fprintf(ficresp, "**********\n#"); |
fprintf(ficresphtmfr, "\n<br/><br/><h3>********** Variable "); |
|
for (z1=1; z1<=cptcoveff; z1++){ |
|
fprintf(ficresp, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
|
fprintf(ficresphtm, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
|
fprintf(ficresphtmfr, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
|
} |
|
fprintf(ficresp, "**********\n#"); |
|
fprintf(ficresphtm, "**********</h3>\n"); |
|
fprintf(ficresphtmfr, "**********</h3>\n"); |
|
fprintf(ficlog, "\n#********** Variable "); |
|
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficlog, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
|
fprintf(ficlog, "**********\n"); |
} |
} |
for(i=1; i<=nlstate;i++) |
fprintf(ficresphtm,"<table style=\"text-align:center; border: 1px solid\">"); |
|
for(i=1; i<=nlstate;i++) { |
fprintf(ficresp, " Age Prev(%d) N(%d) N",i,i); |
fprintf(ficresp, " Age Prev(%d) N(%d) N",i,i); |
|
fprintf(ficresphtm, "<th>Age</th><th>Prev(%d)</th><th>N(%d)</th><th>N</th>",i,i); |
|
} |
fprintf(ficresp, "\n"); |
fprintf(ficresp, "\n"); |
|
fprintf(ficresphtm, "\n"); |
|
|
|
/* Header of frequency table by age */ |
|
fprintf(ficresphtmfr,"<table style=\"text-align:center; border: 1px solid\">"); |
|
fprintf(ficresphtmfr,"<th>Age</th> "); |
|
for(jk=-1; jk <=nlstate+ndeath; jk++){ |
|
for(m=-1; m <=nlstate+ndeath; m++){ |
|
if(jk!=0 && m!=0) |
|
fprintf(ficresphtmfr,"<th>%d%d</th> ",jk,m); |
|
} |
|
} |
|
fprintf(ficresphtmfr, "\n"); |
|
|
|
/* For each age */ |
for(i=iagemin; i <= iagemax+3; i++){ |
for(i=iagemin; i <= iagemax+3; i++){ |
if(i==iagemax+3){ |
fprintf(ficresphtm,"<tr>"); |
|
if(i==iagemax+1){ |
|
fprintf(ficlog,"1"); |
|
fprintf(ficresphtmfr,"<tr><th>0</th> "); |
|
}else if(i==iagemax+2){ |
|
fprintf(ficlog,"0"); |
|
fprintf(ficresphtmfr,"<tr><th>Unknown</th> "); |
|
}else if(i==iagemax+3){ |
fprintf(ficlog,"Total"); |
fprintf(ficlog,"Total"); |
|
fprintf(ficresphtmfr,"<tr><th>Total</th> "); |
}else{ |
}else{ |
if(first==1){ |
if(first==1){ |
first=0; |
first=0; |
printf("See log file for details...\n"); |
printf("See log file for details...\n"); |
} |
} |
|
fprintf(ficresphtmfr,"<tr><th>%d</th> ",i); |
fprintf(ficlog,"Age %d", i); |
fprintf(ficlog,"Age %d", i); |
} |
} |
for(jk=1; jk <=nlstate ; jk++){ |
for(jk=1; jk <=nlstate ; jk++){ |
Line 1941 void freqsummary(char fileres[], int ia
|
Line 3742 void freqsummary(char fileres[], int ia
|
pos += freq[jk][m][i]; |
pos += freq[jk][m][i]; |
if(pp[jk]>=1.e-10){ |
if(pp[jk]>=1.e-10){ |
if(first==1){ |
if(first==1){ |
printf(" %d.=%.0f loss[%d]=%.1f%%",jk,pp[jk],jk,100*pos/pp[jk]); |
printf(" %d.=%.0f loss[%d]=%.1f%%",jk,pp[jk],jk,100*pos/pp[jk]); |
} |
} |
fprintf(ficlog," %d.=%.0f loss[%d]=%.1f%%",jk,pp[jk],jk,100*pos/pp[jk]); |
fprintf(ficlog," %d.=%.0f loss[%d]=%.1f%%",jk,pp[jk],jk,100*pos/pp[jk]); |
}else{ |
}else{ |
Line 1972 void freqsummary(char fileres[], int ia
|
Line 3773 void freqsummary(char fileres[], int ia
|
if( i <= iagemax){ |
if( i <= iagemax){ |
if(pos>=1.e-5){ |
if(pos>=1.e-5){ |
fprintf(ficresp," %d %.5f %.0f %.0f",i,prop[jk][i]/posprop, prop[jk][i],posprop); |
fprintf(ficresp," %d %.5f %.0f %.0f",i,prop[jk][i]/posprop, prop[jk][i],posprop); |
|
fprintf(ficresphtm,"<th>%d</th><td>%.5f</td><td>%.0f</td><td>%.0f</td>",i,prop[jk][i]/posprop, prop[jk][i],posprop); |
/*probs[i][jk][j1]= pp[jk]/pos;*/ |
/*probs[i][jk][j1]= pp[jk]/pos;*/ |
/*printf("\ni=%d jk=%d j1=%d %.5f %.0f %.0f %f",i,jk,j1,pp[jk]/pos, pp[jk],pos,probs[i][jk][j1]);*/ |
/*printf("\ni=%d jk=%d j1=%d %.5f %.0f %.0f %f",i,jk,j1,pp[jk]/pos, pp[jk],pos,probs[i][jk][j1]);*/ |
} |
} |
else |
else{ |
fprintf(ficresp," %d NaNq %.0f %.0f",i,prop[jk][i],posprop); |
fprintf(ficresp," %d NaNq %.0f %.0f",i,prop[jk][i],posprop); |
|
fprintf(ficresphtm,"<th>%d</th><td>NaNq</td><td>%.0f</td><td>%.0f</td>",i, prop[jk][i],posprop); |
|
} |
} |
} |
} |
} |
|
|
for(jk=-1; jk <=nlstate+ndeath; jk++) |
for(jk=-1; jk <=nlstate+ndeath; jk++){ |
for(m=-1; m <=nlstate+ndeath; m++) |
for(m=-1; m <=nlstate+ndeath; m++){ |
if(freq[jk][m][i] !=0 ) { |
if(freq[jk][m][i] !=0 ) { /* minimizing output */ |
if(first==1) |
if(first==1){ |
printf(" %d%d=%.0f",jk,m,freq[jk][m][i]); |
printf(" %d%d=%.0f",jk,m,freq[jk][m][i]); |
|
} |
fprintf(ficlog," %d%d=%.0f",jk,m,freq[jk][m][i]); |
fprintf(ficlog," %d%d=%.0f",jk,m,freq[jk][m][i]); |
} |
} |
if(i <= iagemax) |
if(jk!=0 && m!=0) |
|
fprintf(ficresphtmfr,"<td>%.0f</td> ",freq[jk][m][i]); |
|
} |
|
} |
|
fprintf(ficresphtmfr,"</tr>\n "); |
|
if(i <= iagemax){ |
fprintf(ficresp,"\n"); |
fprintf(ficresp,"\n"); |
|
fprintf(ficresphtm,"</tr>\n"); |
|
} |
if(first==1) |
if(first==1) |
printf("Others in log...\n"); |
printf("Others in log...\n"); |
fprintf(ficlog,"\n"); |
fprintf(ficlog,"\n"); |
} |
} /* end loop i */ |
} |
fprintf(ficresphtm,"</table>\n"); |
} |
fprintf(ficresphtmfr,"</table>\n"); |
|
/*}*/ |
|
} /* end j1 */ |
dateintmean=dateintsum/k2cpt; |
dateintmean=dateintsum/k2cpt; |
|
|
fclose(ficresp); |
fclose(ficresp); |
free_ma3x(freq,-1,nlstate+ndeath,-1,nlstate+ndeath, iagemin, iagemax+3); |
fclose(ficresphtm); |
|
fclose(ficresphtmfr); |
|
free_ma3x(freq,-5,nlstate+ndeath,-5,nlstate+ndeath, iagemin, iagemax+3); |
free_vector(pp,1,nlstate); |
free_vector(pp,1,nlstate); |
free_matrix(prop,1,nlstate,iagemin, iagemax+3); |
free_matrix(prop,1,nlstate,iagemin, iagemax+3); |
/* End of Freq */ |
/* End of Freq */ |
Line 2012 void prevalence(double ***probs, double
|
Line 3828 void prevalence(double ***probs, double
|
We still use firstpass and lastpass as another selection. |
We still use firstpass and lastpass as another selection. |
*/ |
*/ |
|
|
int i, m, jk, k1, i1, j1, bool, z1,z2,j; |
int i, m, jk, j1, bool, z1,j; |
double ***freq; /* Frequencies */ |
int mi; /* Effective wave */ |
double *pp, **prop; |
int iage; |
double pos,posprop; |
double agebegin, ageend; |
|
|
|
double **prop; |
|
double posprop; |
double y2; /* in fractional years */ |
double y2; /* in fractional years */ |
int iagemin, iagemax; |
int iagemin, iagemax; |
|
int first; /** to stop verbosity which is redirected to log file */ |
|
|
iagemin= (int) agemin; |
iagemin= (int) agemin; |
iagemax= (int) agemax; |
iagemax= (int) agemax; |
Line 2026 void prevalence(double ***probs, double
|
Line 3846 void prevalence(double ***probs, double
|
/* freq=ma3x(-1,nlstate+ndeath,-1,nlstate+ndeath,iagemin,iagemax+3);*/ |
/* freq=ma3x(-1,nlstate+ndeath,-1,nlstate+ndeath,iagemin,iagemax+3);*/ |
j1=0; |
j1=0; |
|
|
j=cptcoveff; |
/*j=cptcoveff;*/ |
if (cptcovn<1) {j=1;ncodemax[1]=1;} |
if (cptcovn<1) {j=1;ncodemax[1]=1;} |
|
|
for(k1=1; k1<=j;k1++){ |
first=1; |
for(i1=1; i1<=ncodemax[k1];i1++){ |
for(j1=1; j1<= (int) pow(2,cptcoveff);j1++){ |
j1++; |
for (i=1; i<=nlstate; i++) |
|
for(iage=iagemin; iage <= iagemax+3; iage++) |
for (i=1; i<=nlstate; i++) |
prop[i][iage]=0.0; |
for(m=iagemin; m <= iagemax+3; m++) |
|
prop[i][m]=0.0; |
for (i=1; i<=imx; i++) { /* Each individual */ |
|
bool=1; |
for (i=1; i<=imx; i++) { /* Each individual */ |
if (cptcovn>0) { /* Filter is here: Must be looked at for model=V1+V2+V3+V4 */ |
bool=1; |
for (z1=1; z1<=cptcoveff; z1++) |
if (cptcovn>0) { |
if (covar[Tvaraff[z1]][i]!= nbcode[Tvaraff[z1]][codtabm(j1,z1)]) |
for (z1=1; z1<=cptcoveff; z1++) |
bool=0; |
if (covar[Tvaraff[z1]][i]!= nbcode[Tvaraff[z1]][codtab[j1][z1]]) |
} |
bool=0; |
if (bool==1) { |
} |
/* for(m=firstpass; m<=lastpass; m++){/\* Other selection (we can limit to certain interviews*\/ */ |
if (bool==1) { |
for(mi=1; mi<wav[i];mi++){ |
for(m=firstpass; m<=lastpass; m++){/* Other selection (we can limit to certain interviews*/ |
m=mw[mi][i]; |
|
agebegin=agev[m][i]; /* Age at beginning of wave before transition*/ |
|
/* ageend=agev[m][i]+(dh[m][i])*stepm/YEARM; /\* Age at end of wave and transition *\/ */ |
|
if(m >=firstpass && m <=lastpass){ |
y2=anint[m][i]+(mint[m][i]/12.); /* Fractional date in year */ |
y2=anint[m][i]+(mint[m][i]/12.); /* Fractional date in year */ |
if ((y2>=dateprev1) && (y2<=dateprev2)) { /* Here is the main selection (fractional years) */ |
if ((y2>=dateprev1) && (y2<=dateprev2)) { /* Here is the main selection (fractional years) */ |
if(agev[m][i]==0) agev[m][i]=iagemax+1; |
if(agev[m][i]==0) agev[m][i]=iagemax+1; |
if(agev[m][i]==1) agev[m][i]=iagemax+2; |
if(agev[m][i]==1) agev[m][i]=iagemax+2; |
if((int)agev[m][i] <iagemin || (int)agev[m][i] >iagemax+3) printf("Error on individual =%d agev[m][i]=%f m=%d\n",i, agev[m][i],m); |
if((int)agev[m][i] <iagemin || (int)agev[m][i] >iagemax+3) printf("Error on individual =%d agev[m][i]=%f m=%d\n",i, agev[m][i],m); |
if (s[m][i]>0 && s[m][i]<=nlstate) { |
if (s[m][i]>0 && s[m][i]<=nlstate) { |
/*if(i>4620) printf(" i=%d m=%d s[m][i]=%d (int)agev[m][i]=%d weight[i]=%f prop=%f\n",i,m,s[m][i],(int)agev[m][m],weight[i],prop[s[m][i]][(int)agev[m][i]]);*/ |
/*if(i>4620) printf(" i=%d m=%d s[m][i]=%d (int)agev[m][i]=%d weight[i]=%f prop=%f\n",i,m,s[m][i],(int)agev[m][m],weight[i],prop[s[m][i]][(int)agev[m][i]]);*/ |
prop[s[m][i]][(int)agev[m][i]] += weight[i]; |
prop[s[m][i]][(int)agev[m][i]] += weight[i];/* At age of beginning of transition, where status is known */ |
prop[s[m][i]][iagemax+3] += weight[i]; |
prop[s[m][i]][iagemax+3] += weight[i]; |
} |
} /* end valid statuses */ |
} |
} /* end selection of dates */ |
} /* end selection of waves */ |
} /* end selection of waves */ |
} |
} /* end effective waves */ |
} |
} /* end bool */ |
for(i=iagemin; i <= iagemax+3; i++){ |
} |
|
for(i=iagemin; i <= iagemax+3; i++){ |
for(jk=1,posprop=0; jk <=nlstate ; jk++) { |
for(jk=1,posprop=0; jk <=nlstate ; jk++) { |
posprop += prop[jk][i]; |
posprop += prop[jk][i]; |
} |
} |
|
|
for(jk=1; jk <=nlstate ; jk++){ |
for(jk=1; jk <=nlstate ; jk++){ |
if( i <= iagemax){ |
if( i <= iagemax){ |
if(posprop>=1.e-5){ |
if(posprop>=1.e-5){ |
probs[i][jk][j1]= prop[jk][i]/posprop; |
probs[i][jk][j1]= prop[jk][i]/posprop; |
} |
} else{ |
} |
if(first==1){ |
}/* end jk */ |
first=0; |
}/* end i */ |
printf("Warning Observed prevalence probs[%d][%d][%d]=%lf because of lack of cases\nSee others on log file...\n",jk,i,j1,probs[i][jk][j1]); |
} /* end i1 */ |
} |
} /* end k1 */ |
} |
|
} |
|
}/* end jk */ |
|
}/* end i */ |
|
/*} *//* end i1 */ |
|
} /* end j1 */ |
|
|
/* free_ma3x(freq,-1,nlstate+ndeath,-1,nlstate+ndeath, iagemin, iagemax+3);*/ |
/* free_ma3x(freq,-1,nlstate+ndeath,-1,nlstate+ndeath, iagemin, iagemax+3);*/ |
/*free_vector(pp,1,nlstate);*/ |
/*free_vector(pp,1,nlstate);*/ |
Line 2096 void concatwav(int wav[], int **dh, int
|
Line 3924 void concatwav(int wav[], int **dh, int
|
int i, mi, m; |
int i, mi, m; |
/* int j, k=0,jk, ju, jl,jmin=1e+5, jmax=-1; |
/* int j, k=0,jk, ju, jl,jmin=1e+5, jmax=-1; |
double sum=0., jmean=0.;*/ |
double sum=0., jmean=0.;*/ |
int first; |
int first, firstwo, firsthree; |
int j, k=0,jk, ju, jl; |
int j, k=0,jk, ju, jl; |
double sum=0.; |
double sum=0.; |
first=0; |
first=0; |
jmin=1e+5; |
firstwo=0; |
|
firsthree=0; |
|
jmin=100000; |
jmax=-1; |
jmax=-1; |
jmean=0.; |
jmean=0.; |
for(i=1; i<=imx; i++){ |
for(i=1; i<=imx; i++){ /* For simple cases and if state is death */ |
mi=0; |
mi=0; |
m=firstpass; |
m=firstpass; |
while(s[m][i] <= nlstate){ |
while(s[m][i] <= nlstate){ /* a live state */ |
if(s[m][i]>=1) |
if(s[m][i]>=1 || s[m][i]==-4 || s[m][i]==-5){ /* Since 0.98r4 if status=-2 vital status is really unknown, wave should be skipped */ |
mw[++mi][i]=m; |
mw[++mi][i]=m; |
if(m >=lastpass) |
} |
|
if(m >=lastpass){ |
|
if(s[m][i]==-1 && (int) andc[i] == 9999 && (int)anint[m][i] != 9999){ |
|
if(firsthree == 0){ |
|
printf("Information! Unknown health status for individual %ld line=%d occurred at last wave %d at known date %d/%d. Please, check if your unknown date of death %d/%d means a live state %d at wave %d. This case(%d)/wave(%d) contributes to the likelihood.\nOthers in log file only\n",num[i],i,lastpass,(int)mint[m][i],(int)anint[m][i], (int) moisdc[i], (int) andc[i], s[m][i], m, i, m); |
|
fprintf(ficlog,"Information! Unknown status for individual %ld line=%d occurred at last wave %d at known date %d/%d. Please, check if your unknown date of death %d/%d means a live state %d at wave %d. This case(%d)/wave(%d) contributes to the likelihood.\nOthers in log file only\n",num[i],i,lastpass,(int)mint[m][i],(int)anint[m][i], (int) moisdc[i], (int) andc[i], s[m][i], m, i, m); |
|
firsthree=1; |
|
}else{ |
|
fprintf(ficlog,"Information! Unknown status for individual %ld line=%d occurred at last wave %d at known date %d/%d. Please, check if your unknown date of death %d/%d means a live state %d at wave %d. This case(%d)/wave(%d) contributes to the likelihood.\nOthers in log file only\n",num[i],i,lastpass,(int)mint[m][i],(int)anint[m][i], (int) moisdc[i], (int) andc[i], s[m][i], m, i, m); |
|
} |
|
mw[++mi][i]=m; |
|
} |
|
if(s[m][i]==-2){ /* Vital status is really unknown */ |
|
nbwarn++; |
|
if((int)anint[m][i] == 9999){ /* Has the vital status really been verified? */ |
|
printf("Warning! Vital status for individual %ld (line=%d) at last wave %d interviewed at date %d/%d is unknown %d. Please, check if the vital status and the date of death %d/%d are really unknown. This case (%d)/wave (%d) is skipped, no contribution to likelihood.\nOthers in log file only\n",num[i],i,lastpass,(int)mint[m][i],(int)anint[m][i], s[m][i], (int) moisdc[i], (int) andc[i], i, m); |
|
fprintf(ficlog,"Warning! Vital status for individual %ld (line=%d) at last wave %d interviewed at date %d/%d is unknown %d. Please, check if the vital status and the date of death %d/%d are really unknown. This case (%d)/wave (%d) is skipped, no contribution to likelihood.\nOthers in log file only\n",num[i],i,lastpass,(int)mint[m][i],(int)anint[m][i], s[m][i], (int) moisdc[i], (int) andc[i], i, m); |
|
} |
|
break; |
|
} |
break; |
break; |
|
} |
else |
else |
m++; |
m++; |
}/* end while */ |
}/* end while */ |
if (s[m][i] > nlstate){ |
|
|
/* After last pass */ |
|
if (s[m][i] > nlstate){ /* In a death state */ |
mi++; /* Death is another wave */ |
mi++; /* Death is another wave */ |
/* if(mi==0) never been interviewed correctly before death */ |
/* if(mi==0) never been interviewed correctly before death */ |
/* Only death is a correct wave */ |
/* Only death is a correct wave */ |
mw[mi][i]=m; |
mw[mi][i]=m; |
|
}else if ((int) andc[i] != 9999) { /* Status is either death or negative. A death occured after lastpass, we can't take it into account because of potential bias */ |
|
/* m++; */ |
|
/* mi++; */ |
|
/* s[m][i]=nlstate+1; /\* We are setting the status to the last of non live state *\/ */ |
|
/* mw[mi][i]=m; */ |
|
nberr++; |
|
if(firstwo==0){ |
|
printf("Error! Death for individual %ld line=%d occurred %d/%d after last wave %d interviewed at %d/%d. Potential bias if other individuals are still alive at this date but ignored. This case (%d)/wave (%d) is skipped, no contribution to likelihood.\nOthers in log file only\n",num[i],i,(int) moisdc[i], (int) andc[i], lastpass,(int)mint[m][i],(int)anint[m][i], i,m ); |
|
fprintf(ficlog,"Error! Death for individual %ld line=%d occurred %d/%d after last wave %d interviewed at %d/%d. Potential bias if other individuals are still alive at this date but ignored. This case (%d)/wave (%d) is skipped, no contribution to likelihood.\nOthers in log file only\n",num[i],i,(int) moisdc[i], (int) andc[i], lastpass,(int)mint[m][i],(int)anint[m][i], i,m ); |
|
firstwo=1; |
|
}else if(firstwo==1){ |
|
fprintf(ficlog,"Error! Death for individual %ld line=%d occurred %d/%d after last wave %d interviewed at %d/%d. Potential bias if other individuals are still alive at this date but ignored. This case (%d)/wave (%d) is skipped, no contribution to likelihood.\nOthers in log file only\n",num[i],i,(int) moisdc[i], (int) andc[i], lastpass,(int)mint[m][i],(int)anint[m][i], i,m ); |
|
} |
} |
} |
|
|
wav[i]=mi; |
wav[i]=mi; |
if(mi==0){ |
if(mi==0){ |
nbwarn++; |
nbwarn++; |
if(first==0){ |
if(first==0){ |
printf("Warning! None valid information for:%ld line=%d (skipped) and may be others, see log file\n",num[i],i); |
printf("Warning! No valid information for individual %ld line=%d (skipped) and may be others, see log file\n",num[i],i); |
first=1; |
first=1; |
} |
} |
if(first==1){ |
if(first==1){ |
fprintf(ficlog,"Warning! None valid information for:%ld line=%d (skipped)\n",num[i],i); |
fprintf(ficlog,"Warning! No valid information for individual %ld line=%d (skipped)\n",num[i],i); |
} |
} |
} /* end mi==0 */ |
} /* end mi==0 */ |
} /* End individuals */ |
} /* End individuals */ |
|
/* wav and mw are no more changed */ |
|
|
|
|
for(i=1; i<=imx; i++){ |
for(i=1; i<=imx; i++){ |
for(mi=1; mi<wav[i];mi++){ |
for(mi=1; mi<wav[i];mi++){ |
if (stepm <=0) |
if (stepm <=0) |
Line 2147 void concatwav(int wav[], int **dh, int
|
Line 4013 void concatwav(int wav[], int **dh, int
|
nberr++; |
nberr++; |
printf("Error! Negative delay (%d to death) between waves %d and %d of individual %ld at line %d who is aged %.1f with statuses from %d to %d\n ",j,mw[mi][i],mw[mi+1][i],num[i], i,agev[mw[mi][i]][i],s[mw[mi][i]][i] ,s[mw[mi+1][i]][i]); |
printf("Error! Negative delay (%d to death) between waves %d and %d of individual %ld at line %d who is aged %.1f with statuses from %d to %d\n ",j,mw[mi][i],mw[mi+1][i],num[i], i,agev[mw[mi][i]][i],s[mw[mi][i]][i] ,s[mw[mi+1][i]][i]); |
j=1; /* Temporary Dangerous patch */ |
j=1; /* Temporary Dangerous patch */ |
printf(" We assumed that the date of interview was correct (and not the date of death) and postponed the death %d month(s) (one stepm) after the interview.\n You MUST fix the contradiction between dates.\n",stepm); |
printf(" We assumed that the date of interview was correct (and not the date of death) and postponed the death %d month(s) (one stepm) after the interview. You MUST fix the contradiction between dates.\n",stepm); |
fprintf(ficlog,"Error! Negative delay (%d to death) between waves %d and %d of individual %ld at line %d who is aged %.1f with statuses from %d to %d\n ",j,mw[mi][i],mw[mi+1][i],num[i], i,agev[mw[mi][i]][i],s[mw[mi][i]][i] ,s[mw[mi+1][i]][i]); |
fprintf(ficlog,"Error! Negative delay (%d to death) between waves %d and %d of individual %ld at line %d who is aged %.1f with statuses from %d to %d\n ",j,mw[mi][i],mw[mi+1][i],num[i], i,agev[mw[mi][i]][i],s[mw[mi][i]][i] ,s[mw[mi+1][i]][i]); |
fprintf(ficlog," We assumed that the date of interview was correct (and not the date of death) and postponed the death %d month(s) (one stepm) after the interview.\n You MUST fix the contradiction between dates.\n",stepm); |
fprintf(ficlog," We assumed that the date of interview was correct (and not the date of death) and postponed the death %d month(s) (one stepm) after the interview. You MUST fix the contradiction between dates.\n",stepm); |
} |
} |
k=k+1; |
k=k+1; |
if (j >= jmax) jmax=j; |
if (j >= jmax){ |
if (j <= jmin) jmin=j; |
jmax=j; |
|
ijmax=i; |
|
} |
|
if (j <= jmin){ |
|
jmin=j; |
|
ijmin=i; |
|
} |
sum=sum+j; |
sum=sum+j; |
/*if (j<0) printf("j=%d num=%d \n",j,i);*/ |
/*if (j<0) printf("j=%d num=%d \n",j,i);*/ |
/* printf("%d %d %d %d\n", s[mw[mi][i]][i] ,s[mw[mi+1][i]][i],j,i);*/ |
/* printf("%d %d %d %d\n", s[mw[mi][i]][i] ,s[mw[mi+1][i]][i],j,i);*/ |
Line 2161 void concatwav(int wav[], int **dh, int
|
Line 4033 void concatwav(int wav[], int **dh, int
|
} |
} |
else{ |
else{ |
j= rint( (agev[mw[mi+1][i]][i]*12 - agev[mw[mi][i]][i]*12)); |
j= rint( (agev[mw[mi+1][i]][i]*12 - agev[mw[mi][i]][i]*12)); |
/* printf("%d %d %d %d\n", s[mw[mi][i]][i] ,s[mw[mi+1][i]][i],j,i);*/ |
/* if (j<0) printf("%d %lf %lf %d %d %d\n", i,agev[mw[mi+1][i]][i], agev[mw[mi][i]][i],j,s[mw[mi][i]][i] ,s[mw[mi+1][i]][i]); */ |
|
|
k=k+1; |
k=k+1; |
if (j >= jmax) jmax=j; |
if (j >= jmax) { |
else if (j <= jmin)jmin=j; |
jmax=j; |
|
ijmax=i; |
|
} |
|
else if (j <= jmin){ |
|
jmin=j; |
|
ijmin=i; |
|
} |
/* if (j<10) printf("j=%d jmin=%d num=%d ",j,jmin,i); */ |
/* if (j<10) printf("j=%d jmin=%d num=%d ",j,jmin,i); */ |
/*printf("%d %lf %d %d %d\n", i,agev[mw[mi][i]][i],j,s[mw[mi][i]][i] ,s[mw[mi+1][i]][i]);*/ |
/*printf("%d %lf %d %d %d\n", i,agev[mw[mi][i]][i],j,s[mw[mi][i]][i] ,s[mw[mi+1][i]][i]);*/ |
if(j<0){ |
if(j<0){ |
Line 2182 void concatwav(int wav[], int **dh, int
|
Line 4061 void concatwav(int wav[], int **dh, int
|
dh[mi][i]=jk; |
dh[mi][i]=jk; |
bh[mi][i]=0; |
bh[mi][i]=0; |
}else{ /* We want a negative bias in order to only have interpolation ie |
}else{ /* We want a negative bias in order to only have interpolation ie |
* at the price of an extra matrix product in likelihood */ |
* to avoid the price of an extra matrix product in likelihood */ |
dh[mi][i]=jk+1; |
dh[mi][i]=jk+1; |
bh[mi][i]=ju; |
bh[mi][i]=ju; |
} |
} |
Line 2207 void concatwav(int wav[], int **dh, int
|
Line 4086 void concatwav(int wav[], int **dh, int
|
} /* end wave */ |
} /* end wave */ |
} |
} |
jmean=sum/k; |
jmean=sum/k; |
printf("Delay (in months) between two waves Min=%d Max=%d Mean=%f\n\n ",jmin, jmax,jmean); |
printf("Delay (in months) between two waves Min=%d (for indiviudal %ld) Max=%d (%ld) Mean=%f\n\n ",jmin, num[ijmin], jmax, num[ijmax], jmean); |
fprintf(ficlog,"Delay (in months) between two waves Min=%d Max=%d Mean=%f\n\n ",jmin, jmax,jmean); |
fprintf(ficlog,"Delay (in months) between two waves Min=%d (for indiviudal %d) Max=%d (%d) Mean=%f\n\n ",jmin, ijmin, jmax, ijmax, jmean); |
} |
} |
|
|
/*********** Tricode ****************************/ |
/*********** Tricode ****************************/ |
void tricode(int *Tvar, int **nbcode, int imx) |
void tricode(int *Tvar, int **nbcode, int imx, int *Ndum) |
{ |
{ |
|
/**< Uses cptcovn+2*cptcovprod as the number of covariates */ |
int Ndum[20],ij=1, k, j, i, maxncov=19; |
/* Tvar[i]=atoi(stre); find 'n' in Vn and stores in Tvar. If model=V2+V1 Tvar[1]=2 and Tvar[2]=1 |
int cptcode=0; |
* Boring subroutine which should only output nbcode[Tvar[j]][k] |
|
* Tvar[5] in V2+V1+V3*age+V2*V4 is 2 (V2) |
|
* nbcode[Tvar[j]][1]= |
|
*/ |
|
|
|
int ij=1, k=0, j=0, i=0, maxncov=NCOVMAX; |
|
int modmaxcovj=0; /* Modality max of covariates j */ |
|
int cptcode=0; /* Modality max of covariates j */ |
|
int modmincovj=0; /* Modality min of covariates j */ |
|
|
|
|
cptcoveff=0; |
cptcoveff=0; |
|
|
for (k=0; k<maxncov; k++) Ndum[k]=0; |
for (k=1; k <= maxncov; k++) ncodemax[k]=0; /* Horrible constant again replaced by NCOVMAX */ |
for (k=1; k<=7; k++) ncodemax[k]=0; |
|
|
|
for (j=1; j<=(cptcovn+2*cptcovprod); j++) { |
/* Loop on covariates without age and products */ |
for (i=1; i<=imx; i++) { /*reads the data file to get the maximum |
for (j=1; j<=(cptcovs); j++) { /* From model V1 + V2*age+ V3 + V3*V4 keeps V1 + V3 = 2 only */ |
modality*/ |
for (k=-1; k < maxncov; k++) Ndum[k]=0; |
ij=(int)(covar[Tvar[j]][i]); /* ij is the modality of this individual*/ |
for (i=1; i<=imx; i++) { /* Loop on individuals: reads the data file to get the maximum value of the |
Ndum[ij]++; /*store the modality */ |
modality of this covariate Vj*/ |
|
ij=(int)(covar[Tvar[j]][i]); /* ij=0 or 1 or -1. Value of the covariate Tvar[j] for individual i |
|
* If product of Vn*Vm, still boolean *: |
|
* If it was coded 1, 2, 3, 4 should be splitted into 3 boolean variables |
|
* 1 => 0 0 0, 2 => 0 0 1, 3 => 0 1 1, 4=1 0 0 */ |
|
/* Finds for covariate j, n=Tvar[j] of Vn . ij is the |
|
modality of the nth covariate of individual i. */ |
|
if (ij > modmaxcovj) |
|
modmaxcovj=ij; |
|
else if (ij < modmincovj) |
|
modmincovj=ij; |
|
if ((ij < -1) && (ij > NCOVMAX)){ |
|
printf( "Error: minimal is less than -1 or maximal is bigger than %d. Exiting. \n", NCOVMAX ); |
|
exit(1); |
|
}else |
|
Ndum[ij]++; /*counts and stores the occurence of this modality 0, 1, -1*/ |
|
/* If coded 1, 2, 3 , counts the number of 1 Ndum[1], number of 2, Ndum[2], etc */ |
/*printf("i=%d ij=%d Ndum[ij]=%d imx=%d",i,ij,Ndum[ij],imx);*/ |
/*printf("i=%d ij=%d Ndum[ij]=%d imx=%d",i,ij,Ndum[ij],imx);*/ |
if (ij > cptcode) cptcode=ij; /* getting the maximum of covariable |
/* getting the maximum value of the modality of the covariate |
Tvar[j]. If V=sex and male is 0 and |
(should be 0 or 1 now) Tvar[j]. If V=sex and male is coded 0 and |
female is 1, then cptcode=1.*/ |
female is 1, then modmaxcovj=1.*/ |
} |
} /* end for loop on individuals i */ |
|
printf(" Minimal and maximal values of %d th covariate V%d: min=%d max=%d \n", j, Tvar[j], modmincovj, modmaxcovj); |
for (i=0; i<=cptcode; i++) { |
fprintf(ficlog," Minimal and maximal values of %d th covariate V%d: min=%d max=%d \n", j, Tvar[j], modmincovj, modmaxcovj); |
if(Ndum[i]!=0) ncodemax[j]++; /* Nomber of modalities of the j th covariates. In fact ncodemax[j]=2 (dichotom. variables) but it can be more */ |
cptcode=modmaxcovj; |
} |
/* Ndum[0] = frequency of 0 for model-covariate j, Ndum[1] frequency of 1 etc. */ |
|
/*for (i=0; i<=cptcode; i++) {*/ |
ij=1; |
for (k=modmincovj; k<=modmaxcovj; k++) { /* k=-1 ? 0 and 1*//* For each value k of the modality of model-cov j */ |
for (i=1; i<=ncodemax[j]; i++) { |
printf("Frequencies of covariates %d ie V%d with value %d: %d\n", j, Tvar[j], k, Ndum[k]); |
for (k=0; k<= maxncov; k++) { |
fprintf(ficlog, "Frequencies of covariates %d ie V%d with value %d: %d\n", j, Tvar[j], k, Ndum[k]); |
if (Ndum[k] != 0) { |
if( Ndum[k] != 0 ){ /* Counts if nobody answered modality k ie empty modality, we skip it and reorder */ |
nbcode[Tvar[j]][ij]=k; |
if( k != -1){ |
/* store the modality in an array. k is a modality. If we have model=V1+V1*sex then: nbcode[1][1]=0 ; nbcode[1][2]=1; nbcode[2][1]=0 ; nbcode[2][2]=1; */ |
ncodemax[j]++; /* ncodemax[j]= Number of modalities of the j th |
|
covariate for which somebody answered excluding |
ij++; |
undefined. Usually 2: 0 and 1. */ |
|
} |
|
ncodemaxwundef[j]++; /* ncodemax[j]= Number of modalities of the j th |
|
covariate for which somebody answered including |
|
undefined. Usually 3: -1, 0 and 1. */ |
|
} |
|
/* In fact ncodemax[j]=2 (dichotom. variables only) but it could be more for |
|
historical reasons: 3 if coded 1, 2, 3 and 4 and Ndum[2]=0 */ |
|
} /* Ndum[-1] number of undefined modalities */ |
|
|
|
/* j is a covariate, n=Tvar[j] of Vn; Fills nbcode */ |
|
/* For covariate j, modalities could be 1, 2, 3, 4, 5, 6, 7. |
|
If Ndum[1]=0, Ndum[2]=0, Ndum[3]= 635, Ndum[4]=0, Ndum[5]=0, Ndum[6]=27, Ndum[7]=125; |
|
modmincovj=3; modmaxcovj = 7; |
|
There are only 3 modalities non empty 3, 6, 7 (or 2 if 27 is too few) : ncodemax[j]=3; |
|
which will be coded 0, 1, 2 which in binary on 2=3-1 digits are 0=00 1=01, 2=10; |
|
defining two dummy variables: variables V1_1 and V1_2. |
|
nbcode[Tvar[j]][ij]=k; |
|
nbcode[Tvar[j]][1]=0; |
|
nbcode[Tvar[j]][2]=1; |
|
nbcode[Tvar[j]][3]=2; |
|
To be continued (not working yet). |
|
*/ |
|
ij=0; /* ij is similar to i but can jump over null modalities */ |
|
for (i=modmincovj; i<=modmaxcovj; i++) { /* i= 1 to 2 for dichotomous, or from 1 to 3 or from -1 or 0 to 1 currently*/ |
|
if (Ndum[i] == 0) { /* If nobody responded to this modality k */ |
|
break; |
} |
} |
if (ij > ncodemax[j]) break; |
ij++; |
} |
nbcode[Tvar[j]][ij]=i; /* stores the original value of modality i in an array nbcode, ij modality from 1 to last non-nul modality.*/ |
} |
cptcode = ij; /* New max modality for covar j */ |
} |
} /* end of loop on modality i=-1 to 1 or more */ |
|
|
for (k=0; k< maxncov; k++) Ndum[k]=0; |
/* for (k=0; k<= cptcode; k++) { /\* k=-1 ? k=0 to 1 *\//\* Could be 1 to 4 *\//\* cptcode=modmaxcovj *\/ */ |
|
/* /\*recode from 0 *\/ */ |
for (i=1; i<=ncovmodel-2; i++) { |
/* k is a modality. If we have model=V1+V1*sex */ |
/* Listing of all covariables in staement model to see if some covariates appear twice. For example, V1 appears twice in V1+V1*V2.*/ |
/* then: nbcode[1][1]=0 ; nbcode[1][2]=1; nbcode[2][1]=0 ; nbcode[2][2]=1; */ |
ij=Tvar[i]; |
/* But if some modality were not used, it is recoded from 0 to a newer modmaxcovj=cptcode *\/ */ |
Ndum[ij]++; |
/* } */ |
} |
/* /\* cptcode = ij; *\/ /\* New max modality for covar j *\/ */ |
|
/* if (ij > ncodemax[j]) { */ |
ij=1; |
/* printf( " Error ij=%d > ncodemax[%d]=%d\n", ij, j, ncodemax[j]); */ |
for (i=1; i<= maxncov; i++) { |
/* fprintf(ficlog, " Error ij=%d > ncodemax[%d]=%d\n", ij, j, ncodemax[j]); */ |
|
/* break; */ |
|
/* } */ |
|
/* } /\* end of loop on modality k *\/ */ |
|
} /* end of loop on model-covariate j. nbcode[Tvarj][1]=0 and nbcode[Tvarj][2]=1 sets the value of covariate j*/ |
|
|
|
for (k=-1; k< maxncov; k++) Ndum[k]=0; |
|
|
|
for (i=1; i<=ncovmodel-2-nagesqr; i++) { /* -2, cste and age and eventually age*age */ |
|
/* Listing of all covariables in statement model to see if some covariates appear twice. For example, V1 appears twice in V1+V1*V2.*/ |
|
ij=Tvar[i]; /* Tvar might be -1 if status was unknown */ |
|
Ndum[ij]++; /* Might be supersed V1 + V1*age */ |
|
} |
|
|
|
ij=0; |
|
for (i=0; i<= maxncov-1; i++) { /* modmaxcovj is unknown here. Only Ndum[2(V2),3(age*V3), 5(V3*V2) 6(V1*V4) */ |
|
/*printf("Ndum[%d]=%d\n",i, Ndum[i]);*/ |
if((Ndum[i]!=0) && (i<=ncovcol)){ |
if((Ndum[i]!=0) && (i<=ncovcol)){ |
Tvaraff[ij]=i; /*For printing */ |
|
ij++; |
ij++; |
|
/*printf("diff Ndum[%d]=%d\n",i, Ndum[i]);*/ |
|
Tvaraff[ij]=i; /*For printing (unclear) */ |
|
}else{ |
|
/* Tvaraff[ij]=0; */ |
} |
} |
} |
} |
|
/* ij--; */ |
cptcoveff=ij-1; /*Number of simple covariates*/ |
cptcoveff=ij; /*Number of total covariates*/ |
|
|
} |
} |
|
|
|
|
/*********** Health Expectancies ****************/ |
/*********** Health Expectancies ****************/ |
|
|
void evsij(char fileres[], double ***eij, double x[], int nlstate, int stepm, int bage, int fage, double **oldm, double **savm, int ij, int estepm,double delti[],double **matcov ) |
void evsij(double ***eij, double x[], int nlstate, int stepm, int bage, int fage, double **oldm, double **savm, int cij, int estepm,char strstart[] ) |
|
|
|
{ |
|
/* Health expectancies, no variances */ |
|
int i, j, nhstepm, hstepm, h, nstepm; |
|
int nhstepma, nstepma; /* Decreasing with age */ |
|
double age, agelim, hf; |
|
double ***p3mat; |
|
double eip; |
|
|
|
pstamp(ficreseij); |
|
fprintf(ficreseij,"# (a) Life expectancies by health status at initial age and (b) health expectancies by health status at initial age\n"); |
|
fprintf(ficreseij,"# Age"); |
|
for(i=1; i<=nlstate;i++){ |
|
for(j=1; j<=nlstate;j++){ |
|
fprintf(ficreseij," e%1d%1d ",i,j); |
|
} |
|
fprintf(ficreseij," e%1d. ",i); |
|
} |
|
fprintf(ficreseij,"\n"); |
|
|
|
|
|
if(estepm < stepm){ |
|
printf ("Problem %d lower than %d\n",estepm, stepm); |
|
} |
|
else hstepm=estepm; |
|
/* We compute the life expectancy from trapezoids spaced every estepm months |
|
* This is mainly to measure the difference between two models: for example |
|
* if stepm=24 months pijx are given only every 2 years and by summing them |
|
* we are calculating an estimate of the Life Expectancy assuming a linear |
|
* progression in between and thus overestimating or underestimating according |
|
* to the curvature of the survival function. If, for the same date, we |
|
* estimate the model with stepm=1 month, we can keep estepm to 24 months |
|
* to compare the new estimate of Life expectancy with the same linear |
|
* hypothesis. A more precise result, taking into account a more precise |
|
* curvature will be obtained if estepm is as small as stepm. */ |
|
|
|
/* For example we decided to compute the life expectancy with the smallest unit */ |
|
/* hstepm beeing the number of stepms, if hstepm=1 the length of hstepm is stepm. |
|
nhstepm is the number of hstepm from age to agelim |
|
nstepm is the number of stepm from age to agelin. |
|
Look at hpijx to understand the reason of that which relies in memory size |
|
and note for a fixed period like estepm months */ |
|
/* We decided (b) to get a life expectancy respecting the most precise curvature of the |
|
survival function given by stepm (the optimization length). Unfortunately it |
|
means that if the survival funtion is printed only each two years of age and if |
|
you sum them up and add 1 year (area under the trapezoids) you won't get the same |
|
results. So we changed our mind and took the option of the best precision. |
|
*/ |
|
hstepm=hstepm/stepm; /* Typically in stepm units, if stepm=6 & estepm=24 , = 24/6 months = 4 */ |
|
|
|
agelim=AGESUP; |
|
/* If stepm=6 months */ |
|
/* Computed by stepm unit matrices, product of hstepm matrices, stored |
|
in an array of nhstepm length: nhstepm=10, hstepm=4, stepm=6 months */ |
|
|
|
/* nhstepm age range expressed in number of stepm */ |
|
nstepm=(int) rint((agelim-bage)*YEARM/stepm); /* Biggest nstepm */ |
|
/* Typically if 20 years nstepm = 20*12/6=40 stepm */ |
|
/* if (stepm >= YEARM) hstepm=1;*/ |
|
nhstepm = nstepm/hstepm;/* Expressed in hstepm, typically nhstepm=40/4=10 */ |
|
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
|
|
for (age=bage; age<=fage; age ++){ |
|
nstepma=(int) rint((agelim-bage)*YEARM/stepm); /* Biggest nstepm */ |
|
/* Typically if 20 years nstepm = 20*12/6=40 stepm */ |
|
/* if (stepm >= YEARM) hstepm=1;*/ |
|
nhstepma = nstepma/hstepm;/* Expressed in hstepm, typically nhstepma=40/4=10 */ |
|
|
|
/* If stepm=6 months */ |
|
/* Computed by stepm unit matrices, product of hstepma matrices, stored |
|
in an array of nhstepma length: nhstepma=10, hstepm=4, stepm=6 months */ |
|
|
|
hpxij(p3mat,nhstepma,age,hstepm,x,nlstate,stepm,oldm, savm, cij); |
|
|
|
hf=hstepm*stepm/YEARM; /* Duration of hstepm expressed in year unit. */ |
|
|
|
printf("%d|",(int)age);fflush(stdout); |
|
fprintf(ficlog,"%d|",(int)age);fflush(ficlog); |
|
|
|
/* Computing expectancies */ |
|
for(i=1; i<=nlstate;i++) |
|
for(j=1; j<=nlstate;j++) |
|
for (h=0, eij[i][j][(int)age]=0; h<=nhstepm-1; h++){ |
|
eij[i][j][(int)age] += (p3mat[i][j][h]+p3mat[i][j][h+1])/2.0*hf; |
|
|
|
/* if((int)age==70)printf("i=%2d,j=%2d,h=%2d,age=%3d,%9.4f,%9.4f,%9.4f\n",i,j,h,(int)age,p3mat[i][j][h],hf,eij[i][j][(int)age]);*/ |
|
|
|
} |
|
|
|
fprintf(ficreseij,"%3.0f",age ); |
|
for(i=1; i<=nlstate;i++){ |
|
eip=0; |
|
for(j=1; j<=nlstate;j++){ |
|
eip +=eij[i][j][(int)age]; |
|
fprintf(ficreseij,"%9.4f", eij[i][j][(int)age] ); |
|
} |
|
fprintf(ficreseij,"%9.4f", eip ); |
|
} |
|
fprintf(ficreseij,"\n"); |
|
|
|
} |
|
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
printf("\n"); |
|
fprintf(ficlog,"\n"); |
|
|
|
} |
|
|
|
void cvevsij(double ***eij, double x[], int nlstate, int stepm, int bage, int fage, double **oldm, double **savm, int cij, int estepm,double delti[],double **matcov,char strstart[] ) |
|
|
{ |
{ |
/* Health expectancies */ |
/* Covariances of health expectancies eij and of total life expectancies according |
int i, j, nhstepm, hstepm, h, nstepm, k, cptj; |
to initial status i, ei. . |
|
*/ |
|
int i, j, nhstepm, hstepm, h, nstepm, k, cptj, cptj2, i2, j2, ij, ji; |
|
int nhstepma, nstepma; /* Decreasing with age */ |
double age, agelim, hf; |
double age, agelim, hf; |
double ***p3mat,***varhe; |
double ***p3matp, ***p3matm, ***varhe; |
double **dnewm,**doldm; |
double **dnewm,**doldm; |
double *xp; |
double *xp, *xm; |
double **gp, **gm; |
double **gp, **gm; |
double ***gradg, ***trgradg; |
double ***gradg, ***trgradg; |
int theta; |
int theta; |
|
|
|
double eip, vip; |
|
|
varhe=ma3x(1,nlstate*nlstate,1,nlstate*nlstate,(int) bage, (int) fage); |
varhe=ma3x(1,nlstate*nlstate,1,nlstate*nlstate,(int) bage, (int) fage); |
xp=vector(1,npar); |
xp=vector(1,npar); |
|
xm=vector(1,npar); |
dnewm=matrix(1,nlstate*nlstate,1,npar); |
dnewm=matrix(1,nlstate*nlstate,1,npar); |
doldm=matrix(1,nlstate*nlstate,1,nlstate*nlstate); |
doldm=matrix(1,nlstate*nlstate,1,nlstate*nlstate); |
|
|
fprintf(ficreseij,"# Health expectancies\n"); |
pstamp(ficresstdeij); |
fprintf(ficreseij,"# Age"); |
fprintf(ficresstdeij,"# Health expectancies with standard errors\n"); |
for(i=1; i<=nlstate;i++) |
fprintf(ficresstdeij,"# Age"); |
|
for(i=1; i<=nlstate;i++){ |
for(j=1; j<=nlstate;j++) |
for(j=1; j<=nlstate;j++) |
fprintf(ficreseij," %1d-%1d (SE)",i,j); |
fprintf(ficresstdeij," e%1d%1d (SE)",i,j); |
fprintf(ficreseij,"\n"); |
fprintf(ficresstdeij," e%1d. ",i); |
|
} |
|
fprintf(ficresstdeij,"\n"); |
|
|
|
pstamp(ficrescveij); |
|
fprintf(ficrescveij,"# Subdiagonal matrix of covariances of health expectancies by age: cov(eij,ekl)\n"); |
|
fprintf(ficrescveij,"# Age"); |
|
for(i=1; i<=nlstate;i++) |
|
for(j=1; j<=nlstate;j++){ |
|
cptj= (j-1)*nlstate+i; |
|
for(i2=1; i2<=nlstate;i2++) |
|
for(j2=1; j2<=nlstate;j2++){ |
|
cptj2= (j2-1)*nlstate+i2; |
|
if(cptj2 <= cptj) |
|
fprintf(ficrescveij," %1d%1d,%1d%1d",i,j,i2,j2); |
|
} |
|
} |
|
fprintf(ficrescveij,"\n"); |
|
|
if(estepm < stepm){ |
if(estepm < stepm){ |
printf ("Problem %d lower than %d\n",estepm, stepm); |
printf ("Problem %d lower than %d\n",estepm, stepm); |
} |
} |
Line 2326 void evsij(char fileres[], double ***eij
|
Line 4409 void evsij(char fileres[], double ***eij
|
*/ |
*/ |
hstepm=hstepm/stepm; /* Typically in stepm units, if stepm=6 & estepm=24 , = 24/6 months = 4 */ |
hstepm=hstepm/stepm; /* Typically in stepm units, if stepm=6 & estepm=24 , = 24/6 months = 4 */ |
|
|
|
/* If stepm=6 months */ |
|
/* nhstepm age range expressed in number of stepm */ |
agelim=AGESUP; |
agelim=AGESUP; |
for (age=bage; age<=fage; age ++){ /* If stepm=6 months */ |
nstepm=(int) rint((agelim-bage)*YEARM/stepm); |
/* nhstepm age range expressed in number of stepm */ |
/* Typically if 20 years nstepm = 20*12/6=40 stepm */ |
nstepm=(int) rint((agelim-age)*YEARM/stepm); |
/* if (stepm >= YEARM) hstepm=1;*/ |
|
nhstepm = nstepm/hstepm;/* Expressed in hstepm, typically nhstepm=40/4=10 */ |
|
|
|
p3matp=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
p3matm=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
gradg=ma3x(0,nhstepm,1,npar,1,nlstate*nlstate); |
|
trgradg =ma3x(0,nhstepm,1,nlstate*nlstate,1,npar); |
|
gp=matrix(0,nhstepm,1,nlstate*nlstate); |
|
gm=matrix(0,nhstepm,1,nlstate*nlstate); |
|
|
|
for (age=bage; age<=fage; age ++){ |
|
nstepma=(int) rint((agelim-bage)*YEARM/stepm); /* Biggest nstepm */ |
/* Typically if 20 years nstepm = 20*12/6=40 stepm */ |
/* Typically if 20 years nstepm = 20*12/6=40 stepm */ |
/* if (stepm >= YEARM) hstepm=1;*/ |
/* if (stepm >= YEARM) hstepm=1;*/ |
nhstepm = nstepm/hstepm;/* Expressed in hstepm, typically nhstepm=40/4=10 */ |
nhstepma = nstepma/hstepm;/* Expressed in hstepm, typically nhstepma=40/4=10 */ |
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
gradg=ma3x(0,nhstepm,1,npar,1,nlstate*nlstate); |
|
gp=matrix(0,nhstepm,1,nlstate*nlstate); |
|
gm=matrix(0,nhstepm,1,nlstate*nlstate); |
|
|
|
/* Computed by stepm unit matrices, product of hstepm matrices, stored |
|
in an array of nhstepm length: nhstepm=10, hstepm=4, stepm=6 months */ |
|
hpxij(p3mat,nhstepm,age,hstepm,x,nlstate,stepm,oldm, savm, ij); |
|
|
|
|
|
|
/* If stepm=6 months */ |
|
/* Computed by stepm unit matrices, product of hstepma matrices, stored |
|
in an array of nhstepma length: nhstepma=10, hstepm=4, stepm=6 months */ |
|
|
hf=hstepm*stepm/YEARM; /* Duration of hstepm expressed in year unit. */ |
hf=hstepm*stepm/YEARM; /* Duration of hstepm expressed in year unit. */ |
|
|
/* Computing Variances of health expectancies */ |
/* Computing Variances of health expectancies */ |
|
/* Gradient is computed with plus gp and minus gm. Code is duplicated in order to |
for(theta=1; theta <=npar; theta++){ |
decrease memory allocation */ |
|
for(theta=1; theta <=npar; theta++){ |
for(i=1; i<=npar; i++){ |
for(i=1; i<=npar; i++){ |
xp[i] = x[i] + (i==theta ?delti[theta]:0); |
xp[i] = x[i] + (i==theta ?delti[theta]:0); |
|
xm[i] = x[i] - (i==theta ?delti[theta]:0); |
} |
} |
hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij); |
hpxij(p3matp,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, cij); |
|
hpxij(p3matm,nhstepm,age,hstepm,xm,nlstate,stepm,oldm,savm, cij); |
|
|
cptj=0; |
|
for(j=1; j<= nlstate; j++){ |
for(j=1; j<= nlstate; j++){ |
for(i=1; i<=nlstate; i++){ |
for(i=1; i<=nlstate; i++){ |
cptj=cptj+1; |
for(h=0; h<=nhstepm-1; h++){ |
for(h=0, gp[h][cptj]=0.; h<=nhstepm-1; h++){ |
gp[h][(j-1)*nlstate + i] = (p3matp[i][j][h]+p3matp[i][j][h+1])/2.; |
gp[h][cptj] = (p3mat[i][j][h]+p3mat[i][j][h+1])/2.; |
gm[h][(j-1)*nlstate + i] = (p3matm[i][j][h]+p3matm[i][j][h+1])/2.; |
} |
} |
} |
} |
} |
} |
|
|
|
for(ij=1; ij<= nlstate*nlstate; ij++) |
for(i=1; i<=npar; i++) |
|
xp[i] = x[i] - (i==theta ?delti[theta]:0); |
|
hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij); |
|
|
|
cptj=0; |
|
for(j=1; j<= nlstate; j++){ |
|
for(i=1;i<=nlstate;i++){ |
|
cptj=cptj+1; |
|
for(h=0, gm[h][cptj]=0.; h<=nhstepm-1; h++){ |
|
|
|
gm[h][cptj] = (p3mat[i][j][h]+p3mat[i][j][h+1])/2.; |
|
} |
|
} |
|
} |
|
for(j=1; j<= nlstate*nlstate; j++) |
|
for(h=0; h<=nhstepm-1; h++){ |
for(h=0; h<=nhstepm-1; h++){ |
gradg[h][theta][j]= (gp[h][j]-gm[h][j])/2./delti[theta]; |
gradg[h][theta][ij]= (gp[h][ij]-gm[h][ij])/2./delti[theta]; |
} |
} |
} |
}/* End theta */ |
|
|
/* End theta */ |
|
|
for(h=0; h<=nhstepm-1; h++) |
trgradg =ma3x(0,nhstepm,1,nlstate*nlstate,1,npar); |
|
|
|
for(h=0; h<=nhstepm-1; h++) |
|
for(j=1; j<=nlstate*nlstate;j++) |
for(j=1; j<=nlstate*nlstate;j++) |
for(theta=1; theta <=npar; theta++) |
for(theta=1; theta <=npar; theta++) |
trgradg[h][j][theta]=gradg[h][theta][j]; |
trgradg[h][j][theta]=gradg[h][theta][j]; |
|
|
|
|
for(i=1;i<=nlstate*nlstate;i++) |
for(ij=1;ij<=nlstate*nlstate;ij++) |
for(j=1;j<=nlstate*nlstate;j++) |
for(ji=1;ji<=nlstate*nlstate;ji++) |
varhe[i][j][(int)age] =0.; |
varhe[ij][ji][(int)age] =0.; |
|
|
printf("%d|",(int)age);fflush(stdout); |
printf("%d|",(int)age);fflush(stdout); |
fprintf(ficlog,"%d|",(int)age);fflush(ficlog); |
fprintf(ficlog,"%d|",(int)age);fflush(ficlog); |
Line 2404 void evsij(char fileres[], double ***eij
|
Line 4479 void evsij(char fileres[], double ***eij
|
for(k=0;k<=nhstepm-1;k++){ |
for(k=0;k<=nhstepm-1;k++){ |
matprod2(dnewm,trgradg[h],1,nlstate*nlstate,1,npar,1,npar,matcov); |
matprod2(dnewm,trgradg[h],1,nlstate*nlstate,1,npar,1,npar,matcov); |
matprod2(doldm,dnewm,1,nlstate*nlstate,1,npar,1,nlstate*nlstate,gradg[k]); |
matprod2(doldm,dnewm,1,nlstate*nlstate,1,npar,1,nlstate*nlstate,gradg[k]); |
for(i=1;i<=nlstate*nlstate;i++) |
for(ij=1;ij<=nlstate*nlstate;ij++) |
for(j=1;j<=nlstate*nlstate;j++) |
for(ji=1;ji<=nlstate*nlstate;ji++) |
varhe[i][j][(int)age] += doldm[i][j]*hf*hf; |
varhe[ij][ji][(int)age] += doldm[ij][ji]*hf*hf; |
} |
} |
} |
} |
|
|
/* Computing expectancies */ |
/* Computing expectancies */ |
|
hpxij(p3matm,nhstepm,age,hstepm,x,nlstate,stepm,oldm, savm, cij); |
for(i=1; i<=nlstate;i++) |
for(i=1; i<=nlstate;i++) |
for(j=1; j<=nlstate;j++) |
for(j=1; j<=nlstate;j++) |
for (h=0, eij[i][j][(int)age]=0; h<=nhstepm-1; h++){ |
for (h=0, eij[i][j][(int)age]=0; h<=nhstepm-1; h++){ |
eij[i][j][(int)age] += (p3mat[i][j][h]+p3mat[i][j][h+1])/2.0*hf; |
eij[i][j][(int)age] += (p3matm[i][j][h]+p3matm[i][j][h+1])/2.0*hf; |
|
|
/* if((int)age==70)printf("i=%2d,j=%2d,h=%2d,age=%3d,%9.4f,%9.4f,%9.4f\n",i,j,h,(int)age,p3mat[i][j][h],hf,eij[i][j][(int)age]);*/ |
/* if((int)age==70)printf("i=%2d,j=%2d,h=%2d,age=%3d,%9.4f,%9.4f,%9.4f\n",i,j,h,(int)age,p3mat[i][j][h],hf,eij[i][j][(int)age]);*/ |
|
|
} |
} |
|
|
fprintf(ficreseij,"%3.0f",age ); |
fprintf(ficresstdeij,"%3.0f",age ); |
cptj=0; |
for(i=1; i<=nlstate;i++){ |
for(i=1; i<=nlstate;i++) |
eip=0.; |
|
vip=0.; |
for(j=1; j<=nlstate;j++){ |
for(j=1; j<=nlstate;j++){ |
cptj++; |
eip += eij[i][j][(int)age]; |
fprintf(ficreseij," %9.4f (%.4f)", eij[i][j][(int)age], sqrt(varhe[cptj][cptj][(int)age]) ); |
for(k=1; k<=nlstate;k++) /* Sum on j and k of cov(eij,eik) */ |
|
vip += varhe[(j-1)*nlstate+i][(k-1)*nlstate+i][(int)age]; |
|
fprintf(ficresstdeij," %9.4f (%.4f)", eij[i][j][(int)age], sqrt(varhe[(j-1)*nlstate+i][(j-1)*nlstate+i][(int)age]) ); |
} |
} |
fprintf(ficreseij,"\n"); |
fprintf(ficresstdeij," %9.4f (%.4f)", eip, sqrt(vip)); |
|
} |
free_matrix(gm,0,nhstepm,1,nlstate*nlstate); |
fprintf(ficresstdeij,"\n"); |
free_matrix(gp,0,nhstepm,1,nlstate*nlstate); |
|
free_ma3x(gradg,0,nhstepm,1,npar,1,nlstate*nlstate); |
fprintf(ficrescveij,"%3.0f",age ); |
free_ma3x(trgradg,0,nhstepm,1,nlstate*nlstate,1,npar); |
for(i=1; i<=nlstate;i++) |
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
for(j=1; j<=nlstate;j++){ |
|
cptj= (j-1)*nlstate+i; |
|
for(i2=1; i2<=nlstate;i2++) |
|
for(j2=1; j2<=nlstate;j2++){ |
|
cptj2= (j2-1)*nlstate+i2; |
|
if(cptj2 <= cptj) |
|
fprintf(ficrescveij," %.4f", varhe[cptj][cptj2][(int)age]); |
|
} |
|
} |
|
fprintf(ficrescveij,"\n"); |
|
|
} |
} |
|
free_matrix(gm,0,nhstepm,1,nlstate*nlstate); |
|
free_matrix(gp,0,nhstepm,1,nlstate*nlstate); |
|
free_ma3x(gradg,0,nhstepm,1,npar,1,nlstate*nlstate); |
|
free_ma3x(trgradg,0,nhstepm,1,nlstate*nlstate,1,npar); |
|
free_ma3x(p3matm,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
free_ma3x(p3matp,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
printf("\n"); |
printf("\n"); |
fprintf(ficlog,"\n"); |
fprintf(ficlog,"\n"); |
|
|
|
free_vector(xm,1,npar); |
free_vector(xp,1,npar); |
free_vector(xp,1,npar); |
free_matrix(dnewm,1,nlstate*nlstate,1,npar); |
free_matrix(dnewm,1,nlstate*nlstate,1,npar); |
free_matrix(doldm,1,nlstate*nlstate,1,nlstate*nlstate); |
free_matrix(doldm,1,nlstate*nlstate,1,nlstate*nlstate); |
Line 2444 void evsij(char fileres[], double ***eij
|
Line 4541 void evsij(char fileres[], double ***eij
|
} |
} |
|
|
/************ Variance ******************/ |
/************ Variance ******************/ |
void varevsij(char optionfilefiname[], 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, int estepm, int cptcov, int cptcod, int popbased, int mobilav) |
void varevsij(char optionfilefiname[], 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 *ncvyearp, int ij, int estepm, int cptcov, int cptcod, int popbased, int mobilav, char strstart[]) |
{ |
{ |
/* Variance of health expectancies */ |
/* Variance of health expectancies */ |
/* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double ** savm,double ftolpl);*/ |
/* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double ** savm,double ftolpl);*/ |
/* double **newm;*/ |
/* double **newm;*/ |
|
/* int movingaverage(double ***probs, double bage,double fage, double ***mobaverage, int mobilav)*/ |
|
|
|
int movingaverage(); |
double **dnewm,**doldm; |
double **dnewm,**doldm; |
double **dnewmp,**doldmp; |
double **dnewmp,**doldmp; |
int i, j, nhstepm, hstepm, h, nstepm ; |
int i, j, nhstepm, hstepm, h, nstepm ; |
int k, cptcode; |
int k; |
double *xp; |
double *xp; |
double **gp, **gm; /* for var eij */ |
double **gp, **gm; /* for var eij */ |
double ***gradg, ***trgradg; /*for var eij */ |
double ***gradg, ***trgradg; /*for var eij */ |
Line 2470 void varevsij(char optionfilefiname[], d
|
Line 4570 void varevsij(char optionfilefiname[], d
|
|
|
if(popbased==1){ |
if(popbased==1){ |
if(mobilav!=0) |
if(mobilav!=0) |
strcpy(digitp,"-populbased-mobilav-"); |
strcpy(digitp,"-POPULBASED-MOBILAV_"); |
else strcpy(digitp,"-populbased-nomobil-"); |
else strcpy(digitp,"-POPULBASED-NOMOBIL_"); |
} |
} |
else |
else |
strcpy(digitp,"-stablbased-"); |
strcpy(digitp,"-STABLBASED_"); |
|
|
if (mobilav!=0) { |
if (mobilav!=0) { |
mobaverage= ma3x(1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
mobaverage= ma3x(1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
Line 2484 void varevsij(char optionfilefiname[], d
|
Line 4584 void varevsij(char optionfilefiname[], d
|
} |
} |
} |
} |
|
|
strcpy(fileresprobmorprev,"prmorprev"); |
strcpy(fileresprobmorprev,"PRMORPREV-"); |
sprintf(digit,"%-d",ij); |
sprintf(digit,"%-d",ij); |
/*printf("DIGIT=%s, ij=%d ijr=%-d|\n",digit, ij,ij);*/ |
/*printf("DIGIT=%s, ij=%d ijr=%-d|\n",digit, ij,ij);*/ |
strcat(fileresprobmorprev,digit); /* Tvar to be done */ |
strcat(fileresprobmorprev,digit); /* Tvar to be done */ |
strcat(fileresprobmorprev,digitp); /* Popbased or not, mobilav or not */ |
strcat(fileresprobmorprev,digitp); /* Popbased or not, mobilav or not */ |
strcat(fileresprobmorprev,fileres); |
strcat(fileresprobmorprev,fileresu); |
if((ficresprobmorprev=fopen(fileresprobmorprev,"w"))==NULL) { |
if((ficresprobmorprev=fopen(fileresprobmorprev,"w"))==NULL) { |
printf("Problem with resultfile: %s\n", fileresprobmorprev); |
printf("Problem with resultfile: %s\n", fileresprobmorprev); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresprobmorprev); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresprobmorprev); |
} |
} |
printf("Computing total mortality p.j=w1*p1j+w2*p2j+..: result on file '%s' \n",fileresprobmorprev); |
printf("Computing total mortality p.j=w1*p1j+w2*p2j+..: result on file '%s' \n",fileresprobmorprev); |
fprintf(ficlog,"Computing total mortality p.j=w1*p1j+w2*p2j+..: result on file '%s' \n",fileresprobmorprev); |
fprintf(ficlog,"Computing total mortality p.j=w1*p1j+w2*p2j+..: result on file '%s' \n",fileresprobmorprev); |
|
pstamp(ficresprobmorprev); |
fprintf(ficresprobmorprev,"# probabilities of dying before estepm=%d months for people of exact age and weighted probabilities w1*p1j+w2*p2j+... stand dev in()\n",estepm); |
fprintf(ficresprobmorprev,"# probabilities of dying before estepm=%d months for people of exact age and weighted probabilities w1*p1j+w2*p2j+... stand dev in()\n",estepm); |
fprintf(ficresprobmorprev,"# Age cov=%-d",ij); |
fprintf(ficresprobmorprev,"# Age cov=%-d",ij); |
for(j=nlstate+1; j<=(nlstate+ndeath);j++){ |
for(j=nlstate+1; j<=(nlstate+ndeath);j++){ |
Line 2504 void varevsij(char optionfilefiname[], d
|
Line 4605 void varevsij(char optionfilefiname[], d
|
fprintf(ficresprobmorprev," w%1d p%-d%-d",i,i,j); |
fprintf(ficresprobmorprev," w%1d p%-d%-d",i,i,j); |
} |
} |
fprintf(ficresprobmorprev,"\n"); |
fprintf(ficresprobmorprev,"\n"); |
|
|
fprintf(ficgp,"\n# Routine varevsij"); |
fprintf(ficgp,"\n# Routine varevsij"); |
|
fprintf(ficgp,"\nunset title \n"); |
|
/* fprintf(fichtm, "#Local time at start: %s", strstart);*/ |
fprintf(fichtm,"\n<li><h4> Computing probabilities of dying over estepm months as a weighted average (i.e global mortality independent of initial healh state)</h4></li>\n"); |
fprintf(fichtm,"\n<li><h4> Computing probabilities of dying over estepm months as a weighted average (i.e global mortality independent of initial healh state)</h4></li>\n"); |
fprintf(fichtm,"\n<br>%s <br>\n",digitp); |
fprintf(fichtm,"\n<br>%s <br>\n",digitp); |
/* } */ |
/* } */ |
varppt = matrix(nlstate+1,nlstate+ndeath,nlstate+1,nlstate+ndeath); |
varppt = matrix(nlstate+1,nlstate+ndeath,nlstate+1,nlstate+ndeath); |
|
pstamp(ficresvij); |
fprintf(ficresvij,"# Variance and covariance of health expectancies e.j \n# (weighted average of eij where weights are the stable prevalence in health states i\n"); |
fprintf(ficresvij,"# Variance and covariance of health expectancies e.j \n# (weighted average of eij where weights are "); |
|
if(popbased==1) |
|
fprintf(ficresvij,"the age specific prevalence observed (cross-sectionally) in the population i.e cross-sectionally\n in each health state (popbased=1) (mobilav=%d\n",mobilav); |
|
else |
|
fprintf(ficresvij,"the age specific period (stable) prevalences in each health state \n"); |
fprintf(ficresvij,"# Age"); |
fprintf(ficresvij,"# Age"); |
for(i=1; i<=nlstate;i++) |
for(i=1; i<=nlstate;i++) |
for(j=1; j<=nlstate;j++) |
for(j=1; j<=nlstate;j++) |
fprintf(ficresvij," Cov(e%1d, e%1d)",i,j); |
fprintf(ficresvij," Cov(e.%1d, e.%1d)",i,j); |
fprintf(ficresvij,"\n"); |
fprintf(ficresvij,"\n"); |
|
|
xp=vector(1,npar); |
xp=vector(1,npar); |
Line 2535 void varevsij(char optionfilefiname[], d
|
Line 4643 void varevsij(char optionfilefiname[], d
|
/* For example we decided to compute the life expectancy with the smallest unit */ |
/* For example we decided to compute the life expectancy with the smallest unit */ |
/* hstepm beeing the number of stepms, if hstepm=1 the length of hstepm is stepm. |
/* hstepm beeing the number of stepms, if hstepm=1 the length of hstepm is stepm. |
nhstepm is the number of hstepm from age to agelim |
nhstepm is the number of hstepm from age to agelim |
nstepm is the number of stepm from age to agelin. |
nstepm is the number of stepm from age to agelim. |
Look at hpijx to understand the reason of that which relies in memory size |
Look at function hpijx to understand why because of memory size limitations, |
and note for a fixed period like k years */ |
we decided (b) to get a life expectancy respecting the most precise curvature of the |
/* We decided (b) to get a life expectancy respecting the most precise curvature of the |
|
survival function given by stepm (the optimization length). Unfortunately it |
survival function given by stepm (the optimization length). Unfortunately it |
means that if the survival funtion is printed every two years of age and if |
means that if the survival funtion is printed every two years of age and if |
you sum them up and add 1 year (area under the trapezoids) you won't get the same |
you sum them up and add 1 year (area under the trapezoids) you won't get the same |
Line 2559 void varevsij(char optionfilefiname[], d
|
Line 4666 void varevsij(char optionfilefiname[], d
|
for(i=1; i<=npar; i++){ /* Computes gradient x + delta*/ |
for(i=1; i<=npar; i++){ /* Computes gradient x + delta*/ |
xp[i] = x[i] + (i==theta ?delti[theta]:0); |
xp[i] = x[i] + (i==theta ?delti[theta]:0); |
} |
} |
hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij); |
|
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij); |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ncvyearp,ij); |
|
|
if (popbased==1) { |
if (popbased==1) { |
if(mobilav ==0){ |
if(mobilav ==0){ |
Line 2572 void varevsij(char optionfilefiname[], d
|
Line 4679 void varevsij(char optionfilefiname[], d
|
} |
} |
} |
} |
|
|
|
hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij); /* Returns p3mat[i][j][h] for h=1 to nhstepm */ |
for(j=1; j<= nlstate; j++){ |
for(j=1; j<= nlstate; j++){ |
for(h=0; h<=nhstepm; h++){ |
for(h=0; h<=nhstepm; h++){ |
for(i=1, gp[h][j]=0.;i<=nlstate;i++) |
for(i=1, gp[h][j]=0.;i<=nlstate;i++) |
gp[h][j] += prlim[i][i]*p3mat[i][j][h]; |
gp[h][j] += prlim[i][i]*p3mat[i][j][h]; |
} |
} |
} |
} |
/* This for computing probability of death (h=1 means |
/* Next for computing probability of death (h=1 means |
computed over hstepm matrices product = hstepm*stepm months) |
computed over hstepm matrices product = hstepm*stepm months) |
as a weighted average of prlim. |
as a weighted average of prlim. |
*/ |
*/ |
Line 2590 void varevsij(char optionfilefiname[], d
|
Line 4698 void varevsij(char optionfilefiname[], d
|
|
|
for(i=1; i<=npar; i++) /* Computes gradient x - delta */ |
for(i=1; i<=npar; i++) /* Computes gradient x - delta */ |
xp[i] = x[i] - (i==theta ?delti[theta]:0); |
xp[i] = x[i] - (i==theta ?delti[theta]:0); |
hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij); |
|
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij); |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ncvyearp, ij); |
|
|
if (popbased==1) { |
if (popbased==1) { |
if(mobilav ==0){ |
if(mobilav ==0){ |
Line 2603 void varevsij(char optionfilefiname[], d
|
Line 4711 void varevsij(char optionfilefiname[], d
|
} |
} |
} |
} |
|
|
for(j=1; j<= nlstate; j++){ |
hpxij(p3mat,nhstepm,age,hstepm,xp,nlstate,stepm,oldm,savm, ij); |
|
|
|
for(j=1; j<= nlstate; j++){ /* Sum of wi * eij = e.j */ |
for(h=0; h<=nhstepm; h++){ |
for(h=0; h<=nhstepm; h++){ |
for(i=1, gm[h][j]=0.;i<=nlstate;i++) |
for(i=1, gm[h][j]=0.;i<=nlstate;i++) |
gm[h][j] += prlim[i][i]*p3mat[i][j][h]; |
gm[h][j] += prlim[i][i]*p3mat[i][j][h]; |
Line 2665 void varevsij(char optionfilefiname[], d
|
Line 4775 void varevsij(char optionfilefiname[], d
|
varppt[j][i]=doldmp[j][i]; |
varppt[j][i]=doldmp[j][i]; |
/* end ppptj */ |
/* end ppptj */ |
/* x centered again */ |
/* x centered again */ |
hpxij(p3mat,nhstepm,age,hstepm,x,nlstate,stepm,oldm,savm, ij); |
|
prevalim(prlim,nlstate,x,age,oldm,savm,ftolpl,ij); |
prevalim(prlim,nlstate,x,age,oldm,savm,ftolpl,ncvyearp,ij); |
|
|
if (popbased==1) { |
if (popbased==1) { |
if(mobilav ==0){ |
if(mobilav ==0){ |
Line 2682 void varevsij(char optionfilefiname[], d
|
Line 4792 void varevsij(char optionfilefiname[], d
|
computed over hstepm (estepm) matrices product = hstepm*stepm months) |
computed over hstepm (estepm) matrices product = hstepm*stepm months) |
as a weighted average of prlim. |
as a weighted average of prlim. |
*/ |
*/ |
|
hpxij(p3mat,nhstepm,age,hstepm,x,nlstate,stepm,oldm,savm, ij); |
for(j=nlstate+1;j<=nlstate+ndeath;j++){ |
for(j=nlstate+1;j<=nlstate+ndeath;j++){ |
for(i=1,gmp[j]=0.;i<= nlstate; i++) |
for(i=1,gmp[j]=0.;i<= nlstate; i++) |
gmp[j] += prlim[i][i]*p3mat[i][j][1]; |
gmp[j] += prlim[i][i]*p3mat[i][j][1]; |
Line 2713 void varevsij(char optionfilefiname[], d
|
Line 4824 void varevsij(char optionfilefiname[], d
|
free_vector(gmp,nlstate+1,nlstate+ndeath); |
free_vector(gmp,nlstate+1,nlstate+ndeath); |
free_matrix(gradgp,1,npar,nlstate+1,nlstate+ndeath); |
free_matrix(gradgp,1,npar,nlstate+1,nlstate+ndeath); |
free_matrix(trgradgp,nlstate+1,nlstate+ndeath,1,npar); /* mu or p point j*/ |
free_matrix(trgradgp,nlstate+1,nlstate+ndeath,1,npar); /* mu or p point j*/ |
fprintf(ficgp,"\nset noparametric;set nolabel; set ter png small;set size 0.65, 0.65"); |
/* fprintf(ficgp,"\nunset parametric;unset label; set ter png small size 320, 240"); */ |
|
fprintf(ficgp,"\nunset parametric;unset label; set ter svg size 640, 480"); |
/* for(j=nlstate+1; j<= nlstate+ndeath; j++){ *//* Only the first actually */ |
/* for(j=nlstate+1; j<= nlstate+ndeath; j++){ *//* Only the first actually */ |
fprintf(ficgp,"\n set log y; set nolog x;set xlabel \"Age\"; set ylabel \"Force of mortality (year-1)\";"); |
fprintf(ficgp,"\n set log y; unset log x;set xlabel \"Age\"; set ylabel \"Force of mortality (year-1)\";"); |
|
fprintf(ficgp,"\nset out \"%s%s.svg\";",subdirf3(optionfilefiname,"VARMUPTJGR-",digitp),digit); |
/* fprintf(ficgp,"\n plot \"%s\" u 1:($3*%6.3f) not w l 1 ",fileresprobmorprev,YEARM/estepm); */ |
/* fprintf(ficgp,"\n plot \"%s\" u 1:($3*%6.3f) not w l 1 ",fileresprobmorprev,YEARM/estepm); */ |
/* fprintf(ficgp,"\n replot \"%s\" u 1:(($3+1.96*$4)*%6.3f) t \"95\%% interval\" w l 2 ",fileresprobmorprev,YEARM/estepm); */ |
/* fprintf(ficgp,"\n replot \"%s\" u 1:(($3+1.96*$4)*%6.3f) t \"95\%% interval\" w l 2 ",fileresprobmorprev,YEARM/estepm); */ |
/* fprintf(ficgp,"\n replot \"%s\" u 1:(($3-1.96*$4)*%6.3f) not w l 2 ",fileresprobmorprev,YEARM/estepm); */ |
/* fprintf(ficgp,"\n replot \"%s\" u 1:(($3-1.96*$4)*%6.3f) not w l 2 ",fileresprobmorprev,YEARM/estepm); */ |
fprintf(ficgp,"\n plot \"%s\" u 1:($3) not w l 1 ",subdirf(fileresprobmorprev)); |
fprintf(ficgp,"\n plot \"%s\" u 1:($3) not w l lt 1 ",subdirf(fileresprobmorprev)); |
fprintf(ficgp,"\n replot \"%s\" u 1:(($3+1.96*$4)) t \"95\%% interval\" w l 2 ",subdirf(fileresprobmorprev)); |
fprintf(ficgp,"\n replot \"%s\" u 1:(($3+1.96*$4)) t \"95%% interval\" w l lt 2 ",subdirf(fileresprobmorprev)); |
fprintf(ficgp,"\n replot \"%s\" u 1:(($3-1.96*$4)) not w l 2 ",subdirf(fileresprobmorprev)); |
fprintf(ficgp,"\n replot \"%s\" u 1:(($3-1.96*$4)) not w l lt 2 ",subdirf(fileresprobmorprev)); |
fprintf(fichtm,"\n<br> File (multiple files are possible if covariates are present): <A href=\"%s\">%s</a>\n",subdirf(fileresprobmorprev),subdirf(fileresprobmorprev)); |
fprintf(fichtm,"\n<br> File (multiple files are possible if covariates are present): <A href=\"%s\">%s</a>\n",subdirf(fileresprobmorprev),subdirf(fileresprobmorprev)); |
fprintf(fichtm,"\n<br> Probability is computed over estepm=%d months. <br> <img src=\"%s%s.png\"> <br>\n", estepm,subdirf3(optionfilefiname,"varmuptjgr",digitp),digit); |
fprintf(fichtm,"\n<br> Probability is computed over estepm=%d months. <br> <img src=\"%s%s.svg\"> <br>\n", estepm,subdirf3(optionfilefiname,"VARMUPTJGR-",digitp),digit); |
/* fprintf(fichtm,"\n<br> Probability is computed over estepm=%d months and then divided by estepm and multiplied by %.0f in order to have the probability to die over a year <br> <img src=\"varmuptjgr%s%s.png\"> <br>\n", stepm,YEARM,digitp,digit); |
/* fprintf(fichtm,"\n<br> Probability is computed over estepm=%d months and then divided by estepm and multiplied by %.0f in order to have the probability to die over a year <br> <img src=\"varmuptjgr%s%s.svg\"> <br>\n", stepm,YEARM,digitp,digit); |
*/ |
*/ |
/* fprintf(ficgp,"\nset out \"varmuptjgr%s%s%s.png\";replot;",digitp,optionfilefiname,digit); */ |
/* fprintf(ficgp,"\nset out \"varmuptjgr%s%s%s.svg\";replot;",digitp,optionfilefiname,digit); */ |
fprintf(ficgp,"\nset out \"%s%s.png\";replot;\n",subdirf3(optionfilefiname,"varmuptjgr",digitp),digit); |
fprintf(ficgp,"\nset out;\nset out \"%s%s.svg\";replot;set out;\n",subdirf3(optionfilefiname,"VARMUPTJGR-",digitp),digit); |
|
|
free_vector(xp,1,npar); |
free_vector(xp,1,npar); |
free_matrix(doldm,1,nlstate,1,nlstate); |
free_matrix(doldm,1,nlstate,1,nlstate); |
Line 2742 void varevsij(char optionfilefiname[], d
|
Line 4855 void varevsij(char optionfilefiname[], d
|
} /* end varevsij */ |
} /* end varevsij */ |
|
|
/************ Variance of prevlim ******************/ |
/************ Variance of prevlim ******************/ |
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) |
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 *ncvyearp, int ij, char strstart[]) |
{ |
{ |
/* Variance of prevalence limit */ |
/* Variance of prevalence limit for each state ij using current parameters x[] and estimates of neighbourhood give by delti*/ |
/* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double **savm,double ftolpl);*/ |
/* double **prevalim(double **prlim, int nlstate, double *xp, double age, double **oldm, double **savm,double ftolpl);*/ |
double **newm; |
|
double **dnewm,**doldm; |
double **dnewm,**doldm; |
int i, j, nhstepm, hstepm; |
int i, j, nhstepm, hstepm; |
int k, cptcode; |
|
double *xp; |
double *xp; |
double *gp, *gm; |
double *gp, *gm; |
double **gradg, **trgradg; |
double **gradg, **trgradg; |
|
double **mgm, **mgp; |
double age,agelim; |
double age,agelim; |
int theta; |
int theta; |
|
|
fprintf(ficresvpl,"# Standard deviation of stable prevalences \n"); |
pstamp(ficresvpl); |
|
fprintf(ficresvpl,"# Standard deviation of period (stable) prevalences \n"); |
fprintf(ficresvpl,"# Age"); |
fprintf(ficresvpl,"# Age"); |
for(i=1; i<=nlstate;i++) |
for(i=1; i<=nlstate;i++) |
fprintf(ficresvpl," %1d-%1d",i,i); |
fprintf(ficresvpl," %1d-%1d",i,i); |
Line 2774 void varprevlim(char fileres[], double *
|
Line 4888 void varprevlim(char fileres[], double *
|
if (stepm >= YEARM) hstepm=1; |
if (stepm >= YEARM) hstepm=1; |
nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */ |
nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */ |
gradg=matrix(1,npar,1,nlstate); |
gradg=matrix(1,npar,1,nlstate); |
|
mgp=matrix(1,npar,1,nlstate); |
|
mgm=matrix(1,npar,1,nlstate); |
gp=vector(1,nlstate); |
gp=vector(1,nlstate); |
gm=vector(1,nlstate); |
gm=vector(1,nlstate); |
|
|
Line 2781 void varprevlim(char fileres[], double *
|
Line 4897 void varprevlim(char fileres[], double *
|
for(i=1; i<=npar; i++){ /* Computes gradient */ |
for(i=1; i<=npar; i++){ /* Computes gradient */ |
xp[i] = x[i] + (i==theta ?delti[theta]:0); |
xp[i] = x[i] + (i==theta ?delti[theta]:0); |
} |
} |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij); |
if((int)age==79 ||(int)age== 80 ||(int)age== 81 ) |
for(i=1;i<=nlstate;i++) |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ncvyearp,ij); |
|
else |
|
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ncvyearp,ij); |
|
for(i=1;i<=nlstate;i++){ |
gp[i] = prlim[i][i]; |
gp[i] = prlim[i][i]; |
|
mgp[theta][i] = prlim[i][i]; |
|
} |
for(i=1; i<=npar; i++) /* Computes gradient */ |
for(i=1; i<=npar; i++) /* Computes gradient */ |
xp[i] = x[i] - (i==theta ?delti[theta]:0); |
xp[i] = x[i] - (i==theta ?delti[theta]:0); |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ij); |
if((int)age==79 ||(int)age== 80 ||(int)age== 81 ) |
for(i=1;i<=nlstate;i++) |
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ncvyearp,ij); |
|
else |
|
prevalim(prlim,nlstate,xp,age,oldm,savm,ftolpl,ncvyearp,ij); |
|
for(i=1;i<=nlstate;i++){ |
gm[i] = prlim[i][i]; |
gm[i] = prlim[i][i]; |
|
mgm[theta][i] = prlim[i][i]; |
|
} |
for(i=1;i<=nlstate;i++) |
for(i=1;i<=nlstate;i++) |
gradg[theta][i]= (gp[i]-gm[i])/2./delti[theta]; |
gradg[theta][i]= (gp[i]-gm[i])/2./delti[theta]; |
|
/* gradg[theta][2]= -gradg[theta][1]; */ /* For testing if nlstate=2 */ |
} /* End theta */ |
} /* End theta */ |
|
|
trgradg =matrix(1,nlstate,1,npar); |
trgradg =matrix(1,nlstate,1,npar); |
Line 2800 void varprevlim(char fileres[], double *
|
Line 4925 void varprevlim(char fileres[], double *
|
for(j=1; j<=nlstate;j++) |
for(j=1; j<=nlstate;j++) |
for(theta=1; theta <=npar; theta++) |
for(theta=1; theta <=npar; theta++) |
trgradg[j][theta]=gradg[theta][j]; |
trgradg[j][theta]=gradg[theta][j]; |
|
/* if((int)age==79 ||(int)age== 80 ||(int)age== 81 ){ */ |
|
/* printf("\nmgm mgp %d ",(int)age); */ |
|
/* for(j=1; j<=nlstate;j++){ */ |
|
/* printf(" %d ",j); */ |
|
/* for(theta=1; theta <=npar; theta++) */ |
|
/* printf(" %d %lf %lf",theta,mgm[theta][j],mgp[theta][j]); */ |
|
/* printf("\n "); */ |
|
/* } */ |
|
/* } */ |
|
/* if((int)age==79 ||(int)age== 80 ||(int)age== 81 ){ */ |
|
/* printf("\n gradg %d ",(int)age); */ |
|
/* for(j=1; j<=nlstate;j++){ */ |
|
/* printf("%d ",j); */ |
|
/* for(theta=1; theta <=npar; theta++) */ |
|
/* printf("%d %lf ",theta,gradg[theta][j]); */ |
|
/* printf("\n "); */ |
|
/* } */ |
|
/* } */ |
|
|
for(i=1;i<=nlstate;i++) |
for(i=1;i<=nlstate;i++) |
varpl[i][(int)age] =0.; |
varpl[i][(int)age] =0.; |
|
if((int)age==79 ||(int)age== 80 ||(int)age== 81){ |
|
matprod2(dnewm,trgradg,1,nlstate,1,npar,1,npar,matcov); |
|
matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg); |
|
}else{ |
matprod2(dnewm,trgradg,1,nlstate,1,npar,1,npar,matcov); |
matprod2(dnewm,trgradg,1,nlstate,1,npar,1,npar,matcov); |
matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg); |
matprod2(doldm,dnewm,1,nlstate,1,npar,1,nlstate,gradg); |
|
} |
for(i=1;i<=nlstate;i++) |
for(i=1;i<=nlstate;i++) |
varpl[i][(int)age] = doldm[i][i]; /* Covariances are useless */ |
varpl[i][(int)age] = doldm[i][i]; /* Covariances are useless */ |
|
|
Line 2814 void varprevlim(char fileres[], double *
|
Line 4962 void varprevlim(char fileres[], double *
|
fprintf(ficresvpl,"\n"); |
fprintf(ficresvpl,"\n"); |
free_vector(gp,1,nlstate); |
free_vector(gp,1,nlstate); |
free_vector(gm,1,nlstate); |
free_vector(gm,1,nlstate); |
|
free_matrix(mgm,1,npar,1,nlstate); |
|
free_matrix(mgp,1,npar,1,nlstate); |
free_matrix(gradg,1,npar,1,nlstate); |
free_matrix(gradg,1,npar,1,nlstate); |
free_matrix(trgradg,1,nlstate,1,npar); |
free_matrix(trgradg,1,nlstate,1,npar); |
} /* End age */ |
} /* End age */ |
Line 2825 void varprevlim(char fileres[], double *
|
Line 4975 void varprevlim(char fileres[], double *
|
} |
} |
|
|
/************ Variance of one-step probabilities ******************/ |
/************ Variance of one-step probabilities ******************/ |
void varprob(char optionfilefiname[], double **matcov, double x[], double delti[], int nlstate, double bage, double fage, int ij, int *Tvar, int **nbcode, int *ncodemax) |
void varprob(char optionfilefiname[], double **matcov, double x[], double delti[], int nlstate, double bage, double fage, int ij, int *Tvar, int **nbcode, int *ncodemax, char strstart[]) |
{ |
{ |
int i, j=0, i1, k1, l1, t, tj; |
int i, j=0, k1, l1, tj; |
int k2, l2, j1, z1; |
int k2, l2, j1, z1; |
int k=0,l, cptcode; |
int k=0, l; |
int first=1, first1; |
int first=1, first1, first2; |
double cv12, mu1, mu2, lc1, lc2, v12, v21, v11, v22,v1,v2, c12, tnalp; |
double cv12, mu1, mu2, lc1, lc2, v12, v21, v11, v22,v1,v2, c12, tnalp; |
double **dnewm,**doldm; |
double **dnewm,**doldm; |
double *xp; |
double *xp; |
double *gp, *gm; |
double *gp, *gm; |
double **gradg, **trgradg; |
double **gradg, **trgradg; |
double **mu; |
double **mu; |
double age,agelim, cov[NCOVMAX]; |
double age, cov[NCOVMAX+1]; |
double std=2.0; /* Number of standard deviation wide of confidence ellipsoids */ |
double std=2.0; /* Number of standard deviation wide of confidence ellipsoids */ |
int theta; |
int theta; |
char fileresprob[FILENAMELENGTH]; |
char fileresprob[FILENAMELENGTH]; |
char fileresprobcov[FILENAMELENGTH]; |
char fileresprobcov[FILENAMELENGTH]; |
char fileresprobcor[FILENAMELENGTH]; |
char fileresprobcor[FILENAMELENGTH]; |
|
|
double ***varpij; |
double ***varpij; |
|
|
strcpy(fileresprob,"prob"); |
strcpy(fileresprob,"PROB_"); |
strcat(fileresprob,fileres); |
strcat(fileresprob,fileres); |
if((ficresprob=fopen(fileresprob,"w"))==NULL) { |
if((ficresprob=fopen(fileresprob,"w"))==NULL) { |
printf("Problem with resultfile: %s\n", fileresprob); |
printf("Problem with resultfile: %s\n", fileresprob); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresprob); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresprob); |
} |
} |
strcpy(fileresprobcov,"probcov"); |
strcpy(fileresprobcov,"PROBCOV_"); |
strcat(fileresprobcov,fileres); |
strcat(fileresprobcov,fileresu); |
if((ficresprobcov=fopen(fileresprobcov,"w"))==NULL) { |
if((ficresprobcov=fopen(fileresprobcov,"w"))==NULL) { |
printf("Problem with resultfile: %s\n", fileresprobcov); |
printf("Problem with resultfile: %s\n", fileresprobcov); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresprobcov); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresprobcov); |
} |
} |
strcpy(fileresprobcor,"probcor"); |
strcpy(fileresprobcor,"PROBCOR_"); |
strcat(fileresprobcor,fileres); |
strcat(fileresprobcor,fileresu); |
if((ficresprobcor=fopen(fileresprobcor,"w"))==NULL) { |
if((ficresprobcor=fopen(fileresprobcor,"w"))==NULL) { |
printf("Problem with resultfile: %s\n", fileresprobcor); |
printf("Problem with resultfile: %s\n", fileresprobcor); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresprobcor); |
fprintf(ficlog,"Problem with resultfile: %s\n", fileresprobcor); |
Line 2870 void varprob(char optionfilefiname[], do
|
Line 5019 void varprob(char optionfilefiname[], do
|
fprintf(ficlog,"Computing matrix of variance covariance of one-step probabilities: result on file '%s' \n",fileresprobcov); |
fprintf(ficlog,"Computing matrix of variance covariance of one-step probabilities: result on file '%s' \n",fileresprobcov); |
printf("and correlation matrix of one-step probabilities: result on file '%s' \n",fileresprobcor); |
printf("and correlation matrix of one-step probabilities: result on file '%s' \n",fileresprobcor); |
fprintf(ficlog,"and correlation matrix of one-step probabilities: result on file '%s' \n",fileresprobcor); |
fprintf(ficlog,"and correlation matrix of one-step probabilities: result on file '%s' \n",fileresprobcor); |
|
pstamp(ficresprob); |
fprintf(ficresprob,"#One-step probabilities and stand. devi in ()\n"); |
fprintf(ficresprob,"#One-step probabilities and stand. devi in ()\n"); |
fprintf(ficresprob,"# Age"); |
fprintf(ficresprob,"# Age"); |
|
pstamp(ficresprobcov); |
fprintf(ficresprobcov,"#One-step probabilities and covariance matrix\n"); |
fprintf(ficresprobcov,"#One-step probabilities and covariance matrix\n"); |
fprintf(ficresprobcov,"# Age"); |
fprintf(ficresprobcov,"# Age"); |
|
pstamp(ficresprobcor); |
fprintf(ficresprobcor,"#One-step probabilities and correlation matrix\n"); |
fprintf(ficresprobcor,"#One-step probabilities and correlation matrix\n"); |
fprintf(ficresprobcov,"# Age"); |
fprintf(ficresprobcor,"# Age"); |
|
|
|
|
for(i=1; i<=nlstate;i++) |
for(i=1; i<=nlstate;i++) |
Line 2889 void varprob(char optionfilefiname[], do
|
Line 5040 void varprob(char optionfilefiname[], do
|
fprintf(ficresprobcov,"\n"); |
fprintf(ficresprobcov,"\n"); |
fprintf(ficresprobcor,"\n"); |
fprintf(ficresprobcor,"\n"); |
*/ |
*/ |
xp=vector(1,npar); |
xp=vector(1,npar); |
dnewm=matrix(1,(nlstate)*(nlstate+ndeath),1,npar); |
dnewm=matrix(1,(nlstate)*(nlstate+ndeath),1,npar); |
doldm=matrix(1,(nlstate)*(nlstate+ndeath),1,(nlstate)*(nlstate+ndeath)); |
doldm=matrix(1,(nlstate)*(nlstate+ndeath),1,(nlstate)*(nlstate+ndeath)); |
mu=matrix(1,(nlstate)*(nlstate+ndeath), (int) bage, (int)fage); |
mu=matrix(1,(nlstate)*(nlstate+ndeath), (int) bage, (int)fage); |
Line 2899 void varprob(char optionfilefiname[], do
|
Line 5050 void varprob(char optionfilefiname[], do
|
fprintf(fichtm,"\n<li><h4> Computing and drawing one step probabilities with their confidence intervals</h4></li>\n"); |
fprintf(fichtm,"\n<li><h4> Computing and drawing one step probabilities with their confidence intervals</h4></li>\n"); |
fprintf(fichtm,"\n"); |
fprintf(fichtm,"\n"); |
|
|
fprintf(fichtm,"\n<li><h4> <a href=\"%s\">Matrix of variance-covariance of pairs of step probabilities (drawings)</a></h4></li>\n",optionfilehtmcov); |
fprintf(fichtm,"\n<li><h4> <a href=\"%s\">Matrix of variance-covariance of one-step probabilities (drawings)</a></h4> this page is important in order to visualize confidence intervals and especially correlation between disability and recovery, or more generally, way in and way back.</li>\n",optionfilehtmcov); |
fprintf(fichtmcov,"\n<h4>Matrix of variance-covariance of pairs of step probabilities</h4>\n\ |
fprintf(fichtmcov,"Current page is file <a href=\"%s\">%s</a><br>\n\n<h4>Matrix of variance-covariance of pairs of step probabilities</h4>\n",optionfilehtmcov, optionfilehtmcov); |
file %s<br>\n",optionfilehtmcov); |
fprintf(fichtmcov,"\nEllipsoids of confidence centered on point (p<inf>ij</inf>, p<inf>kl</inf>) are estimated \ |
fprintf(fichtmcov,"\nEllipsoids of confidence centered on point (p<inf>ij</inf>, p<inf>kl</inf>) are estimated\ |
|
and drawn. It helps understanding how is the covariance between two incidences.\ |
and drawn. It helps understanding how is the covariance between two incidences.\ |
They are expressed in year<sup>-1</sup> in order to be less dependent of stepm.<br>\n"); |
They are expressed in year<sup>-1</sup> in order to be less dependent of stepm.<br>\n"); |
fprintf(fichtmcov,"\n<br> Contour plot corresponding to x'cov<sup>-1</sup>x = 4 (where x is the column vector (pij,pkl)) are drawn. \ |
fprintf(fichtmcov,"\n<br> Contour plot corresponding to x'cov<sup>-1</sup>x = 4 (where x is the column vector (pij,pkl)) are drawn. \ |
Line 2914 standard deviations wide on each axis. <
|
Line 5064 standard deviations wide on each axis. <
|
To be simple, these graphs help to understand the significativity of each parameter in relation to a second other one.<br> \n"); |
To be simple, these graphs help to understand the significativity of each parameter in relation to a second other one.<br> \n"); |
|
|
cov[1]=1; |
cov[1]=1; |
tj=cptcoveff; |
/* tj=cptcoveff; */ |
|
tj = (int) pow(2,cptcoveff); |
if (cptcovn<1) {tj=1;ncodemax[1]=1;} |
if (cptcovn<1) {tj=1;ncodemax[1]=1;} |
j1=0; |
j1=0; |
for(t=1; t<=tj;t++){ |
for(j1=1; j1<=tj;j1++){ |
for(i1=1; i1<=ncodemax[t];i1++){ |
/*for(i1=1; i1<=ncodemax[t];i1++){ */ |
j1++; |
/*j1++;*/ |
if (cptcovn>0) { |
if (cptcovn>0) { |
fprintf(ficresprob, "\n#********** Variable "); |
fprintf(ficresprob, "\n#********** Variable "); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficresprob, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtab[j1][z1]]); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficresprob, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
fprintf(ficresprob, "**********\n#\n"); |
fprintf(ficresprob, "**********\n#\n"); |
fprintf(ficresprobcov, "\n#********** Variable "); |
fprintf(ficresprobcov, "\n#********** Variable "); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficresprobcov, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtab[j1][z1]]); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficresprobcov, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
fprintf(ficresprobcov, "**********\n#\n"); |
fprintf(ficresprobcov, "**********\n#\n"); |
|
|
fprintf(ficgp, "\n#********** Variable "); |
fprintf(ficgp, "\n#********** Variable "); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficgp, " V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtab[j1][z1]]); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficgp, " V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
fprintf(ficgp, "**********\n#\n"); |
fprintf(ficgp, "**********\n#\n"); |
|
|
|
|
fprintf(fichtmcov, "\n<hr size=\"2\" color=\"#EC5E5E\">********** Variable "); |
fprintf(fichtmcov, "\n<hr size=\"2\" color=\"#EC5E5E\">********** Variable "); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(fichtm, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtab[j1][z1]]); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(fichtm, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
fprintf(fichtmcov, "**********\n<hr size=\"2\" color=\"#EC5E5E\">"); |
fprintf(fichtmcov, "**********\n<hr size=\"2\" color=\"#EC5E5E\">"); |
|
|
fprintf(ficresprobcor, "\n#********** Variable "); |
fprintf(ficresprobcor, "\n#********** Variable "); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficresprobcor, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtab[j1][z1]]); |
for (z1=1; z1<=cptcoveff; z1++) fprintf(ficresprobcor, "V%d=%d ",Tvaraff[z1],nbcode[Tvaraff[z1]][codtabm(j1,z1)]); |
fprintf(ficresprobcor, "**********\n#"); |
fprintf(ficresprobcor, "**********\n#"); |
} |
} |
|
|
|
gradg=matrix(1,npar,1,(nlstate)*(nlstate+ndeath)); |
|
trgradg=matrix(1,(nlstate)*(nlstate+ndeath),1,npar); |
|
gp=vector(1,(nlstate)*(nlstate+ndeath)); |
|
gm=vector(1,(nlstate)*(nlstate+ndeath)); |
for (age=bage; age<=fage; age ++){ |
for (age=bage; age<=fage; age ++){ |
cov[2]=age; |
cov[2]=age; |
|
if(nagesqr==1) |
|
cov[3]= age*age; |
for (k=1; k<=cptcovn;k++) { |
for (k=1; k<=cptcovn;k++) { |
cov[2+k]=nbcode[Tvar[k]][codtab[j1][Tvar[k]]]; |
cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(j1,k)]; |
|
/*cov[2+nagesqr+k]=nbcode[Tvar[k]][codtabm(j1,Tvar[k])];*//* j1 1 2 3 4 |
|
* 1 1 1 1 1 |
|
* 2 2 1 1 1 |
|
* 3 1 2 1 1 |
|
*/ |
|
/* nbcode[1][1]=0 nbcode[1][2]=1;*/ |
} |
} |
for (k=1; k<=cptcovage;k++) cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2]; |
/* for (k=1; k<=cptcovage;k++) cov[2+Tage[k]]=cov[2+Tage[k]]*cov[2]; */ |
|
for (k=1; k<=cptcovage;k++) cov[2+Tage[k]]=nbcode[Tvar[Tage[k]]][codtabm(ij,k)]*cov[2]; |
for (k=1; k<=cptcovprod;k++) |
for (k=1; k<=cptcovprod;k++) |
cov[2+Tprod[k]]=nbcode[Tvard[k][1]][codtab[ij][Tvard[k][1]]]*nbcode[Tvard[k][2]][codtab[ij][Tvard[k][2]]]; |
cov[2+nagesqr+Tprod[k]]=nbcode[Tvard[k][1]][codtabm(ij,k)]*nbcode[Tvard[k][2]][codtabm(ij,k)]; |
|
|
gradg=matrix(1,npar,1,(nlstate)*(nlstate+ndeath)); |
|
trgradg=matrix(1,(nlstate)*(nlstate+ndeath),1,npar); |
|
gp=vector(1,(nlstate)*(nlstate+ndeath)); |
|
gm=vector(1,(nlstate)*(nlstate+ndeath)); |
|
|
|
for(theta=1; theta <=npar; theta++){ |
for(theta=1; theta <=npar; theta++){ |
for(i=1; i<=npar; i++) |
for(i=1; i<=npar; i++) |
Line 2992 To be simple, these graphs help to under
|
Line 5152 To be simple, these graphs help to under
|
|
|
matprod2(dnewm,trgradg,1,(nlstate)*(nlstate+ndeath),1,npar,1,npar,matcov); |
matprod2(dnewm,trgradg,1,(nlstate)*(nlstate+ndeath),1,npar,1,npar,matcov); |
matprod2(doldm,dnewm,1,(nlstate)*(nlstate+ndeath),1,npar,1,(nlstate)*(nlstate+ndeath),gradg); |
matprod2(doldm,dnewm,1,(nlstate)*(nlstate+ndeath),1,npar,1,(nlstate)*(nlstate+ndeath),gradg); |
free_vector(gp,1,(nlstate+ndeath)*(nlstate+ndeath)); |
|
free_vector(gm,1,(nlstate+ndeath)*(nlstate+ndeath)); |
|
free_matrix(trgradg,1,(nlstate+ndeath)*(nlstate+ndeath),1,npar); |
|
free_matrix(gradg,1,(nlstate+ndeath)*(nlstate+ndeath),1,npar); |
|
|
|
pmij(pmmij,cov,ncovmodel,x,nlstate); |
pmij(pmmij,cov,ncovmodel,x,nlstate); |
|
|
Line 3029 To be simple, these graphs help to under
|
Line 5185 To be simple, these graphs help to under
|
i=0; |
i=0; |
for (k=1; k<=(nlstate);k++){ |
for (k=1; k<=(nlstate);k++){ |
for (l=1; l<=(nlstate+ndeath);l++){ |
for (l=1; l<=(nlstate+ndeath);l++){ |
i=i++; |
i++; |
fprintf(ficresprobcov,"\n%d %d-%d",(int)age,k,l); |
fprintf(ficresprobcov,"\n%d %d-%d",(int)age,k,l); |
fprintf(ficresprobcor,"\n%d %d-%d",(int)age,k,l); |
fprintf(ficresprobcor,"\n%d %d-%d",(int)age,k,l); |
for (j=1; j<=i;j++){ |
for (j=1; j<=i;j++){ |
|
/* printf(" k=%d l=%d i=%d j=%d\n",k,l,i,j);fflush(stdout); */ |
fprintf(ficresprobcov," %11.3e",varpij[i][j][(int)age]); |
fprintf(ficresprobcov," %11.3e",varpij[i][j][(int)age]); |
fprintf(ficresprobcor," %11.3e",varpij[i][j][(int) age]/sqrt(varpij[i][i][(int) age])/sqrt(varpij[j][j][(int)age])); |
fprintf(ficresprobcor," %11.3e",varpij[i][j][(int) age]/sqrt(varpij[i][i][(int) age])/sqrt(varpij[j][j][(int)age])); |
} |
} |
} |
} |
}/* end of loop for state */ |
}/* end of loop for state */ |
} /* end of loop for age */ |
} /* end of loop for age */ |
|
free_vector(gp,1,(nlstate+ndeath)*(nlstate+ndeath)); |
|
free_vector(gm,1,(nlstate+ndeath)*(nlstate+ndeath)); |
|
free_matrix(trgradg,1,(nlstate+ndeath)*(nlstate+ndeath),1,npar); |
|
free_matrix(gradg,1,(nlstate+ndeath)*(nlstate+ndeath),1,npar); |
|
|
/* Confidence intervalle of pij */ |
/* Confidence intervalle of pij */ |
/* |
/* |
fprintf(ficgp,"\nset noparametric;unset label"); |
fprintf(ficgp,"\nunset parametric;unset label"); |
fprintf(ficgp,"\nset log y;unset log x; set xlabel \"Age\";set ylabel \"probability (year-1)\""); |
fprintf(ficgp,"\nset log y;unset log x; set xlabel \"Age\";set ylabel \"probability (year-1)\""); |
fprintf(ficgp,"\nset ter png small\nset size 0.65,0.65"); |
fprintf(ficgp,"\nset ter png small\nset size 0.65,0.65"); |
fprintf(fichtm,"\n<br>Probability with confidence intervals expressed in year<sup>-1</sup> :<a href=\"pijgr%s.png\">pijgr%s.png</A>, ",optionfilefiname,optionfilefiname); |
fprintf(fichtm,"\n<br>Probability with confidence intervals expressed in year<sup>-1</sup> :<a href=\"pijgr%s.png\">pijgr%s.png</A>, ",optionfilefiname,optionfilefiname); |
Line 3052 To be simple, these graphs help to under
|
Line 5213 To be simple, these graphs help to under
|
*/ |
*/ |
|
|
/* Drawing ellipsoids of confidence of two variables p(k1-l1,k2-l2)*/ |
/* Drawing ellipsoids of confidence of two variables p(k1-l1,k2-l2)*/ |
first1=1; |
first1=1;first2=2; |
for (k2=1; k2<=(nlstate);k2++){ |
for (k2=1; k2<=(nlstate);k2++){ |
for (l2=1; l2<=(nlstate+ndeath);l2++){ |
for (l2=1; l2<=(nlstate+ndeath);l2++){ |
if(l2==k2) continue; |
if(l2==k2) continue; |
Line 3073 To be simple, these graphs help to under
|
Line 5234 To be simple, these graphs help to under
|
/* Computing eigen value of matrix of covariance */ |
/* Computing eigen value of matrix of covariance */ |
lc1=((v1+v2)+sqrt((v1+v2)*(v1+v2) - 4*(v1*v2-cv12*cv12)))/2.; |
lc1=((v1+v2)+sqrt((v1+v2)*(v1+v2) - 4*(v1*v2-cv12*cv12)))/2.; |
lc2=((v1+v2)-sqrt((v1+v2)*(v1+v2) - 4*(v1*v2-cv12*cv12)))/2.; |
lc2=((v1+v2)-sqrt((v1+v2)*(v1+v2) - 4*(v1*v2-cv12*cv12)))/2.; |
|
if ((lc2 <0) || (lc1 <0) ){ |
|
if(first2==1){ |
|
first1=0; |
|
printf("Strange: j1=%d One eigen value of 2x2 matrix of covariance is negative, lc1=%11.3e, lc2=%11.3e, v1=%11.3e, v2=%11.3e, cv12=%11.3e.\n It means that the matrix was not well estimated (varpij), for i=%2d, j=%2d, age=%4d .\n See files %s and %s. Probably WRONG RESULTS. See log file for details...\n", j1, lc1, lc2, v1, v2, cv12, i, j, (int)age,fileresprobcov, fileresprobcor); |
|
} |
|
fprintf(ficlog,"Strange: j1=%d One eigen value of 2x2 matrix of covariance is negative, lc1=%11.3e, lc2=%11.3e, v1=%11.3e, v2=%11.3e, cv12=%11.3e.\n It means that the matrix was not well estimated (varpij), for i=%2d, j=%2d, age=%4d .\n See files %s and %s. Probably WRONG RESULTS.\n", j1, lc1, lc2, v1, v2, cv12, i, j, (int)age,fileresprobcov, fileresprobcor);fflush(ficlog); |
|
/* lc1=fabs(lc1); */ /* If we want to have them positive */ |
|
/* lc2=fabs(lc2); */ |
|
} |
|
|
/* Eigen vectors */ |
/* Eigen vectors */ |
v11=(1./sqrt(1+(v1-lc1)*(v1-lc1)/cv12/cv12)); |
v11=(1./sqrt(1+(v1-lc1)*(v1-lc1)/cv12/cv12)); |
/*v21=sqrt(1.-v11*v11); *//* error */ |
/*v21=sqrt(1.-v11*v11); *//* error */ |
Line 3090 To be simple, these graphs help to under
|
Line 5261 To be simple, these graphs help to under
|
/* mu2+ v21*lc1*cost + v22*lc2*sin(t) */ |
/* mu2+ v21*lc1*cost + v22*lc2*sin(t) */ |
if(first==1){ |
if(first==1){ |
first=0; |
first=0; |
|
fprintf(ficgp,"\n# Ellipsoids of confidence\n#\n"); |
fprintf(ficgp,"\nset parametric;unset label"); |
fprintf(ficgp,"\nset parametric;unset label"); |
fprintf(ficgp,"\nset log y;set log x; set xlabel \"p%1d%1d (year-1)\";set ylabel \"p%1d%1d (year-1)\"",k1,l1,k2,l2); |
fprintf(ficgp,"\nset log y;set log x; set xlabel \"p%1d%1d (year-1)\";set ylabel \"p%1d%1d (year-1)\"",k1,l1,k2,l2); |
fprintf(ficgp,"\nset ter png small\nset size 0.65,0.65"); |
fprintf(ficgp,"\nset ter svg size 640, 480"); |
fprintf(fichtmcov,"\n<br>Ellipsoids of confidence cov(p%1d%1d,p%1d%1d) expressed in year<sup>-1</sup>\ |
fprintf(fichtmcov,"\n<br>Ellipsoids of confidence cov(p%1d%1d,p%1d%1d) expressed in year<sup>-1</sup>\ |
:<a href=\"%s%d%1d%1d-%1d%1d.png\">\ |
:<a href=\"%s_%d%1d%1d-%1d%1d.svg\">\ |
%s%d%1d%1d-%1d%1d.png</A>, ",k1,l1,k2,l2,\ |
%s_%d%1d%1d-%1d%1d.svg</A>, ",k1,l1,k2,l2,\ |
subdirf2(optionfilefiname,"varpijgr"), j1,k1,l1,k2,l2,\ |
subdirf2(optionfilefiname,"VARPIJGR_"), j1,k1,l1,k2,l2,\ |
subdirf2(optionfilefiname,"varpijgr"), j1,k1,l1,k2,l2); |
subdirf2(optionfilefiname,"VARPIJGR_"), j1,k1,l1,k2,l2); |
fprintf(fichtmcov,"\n<br><img src=\"%s%d%1d%1d-%1d%1d.png\"> ",subdirf2(optionfilefiname,"varpijgr"), j1,k1,l1,k2,l2); |
fprintf(fichtmcov,"\n<br><img src=\"%s_%d%1d%1d-%1d%1d.svg\"> ",subdirf2(optionfilefiname,"VARPIJGR_"), j1,k1,l1,k2,l2); |
fprintf(fichtmcov,"\n<br> Correlation at age %d (%.3f),",(int) age, c12); |
fprintf(fichtmcov,"\n<br> Correlation at age %d (%.3f),",(int) age, c12); |
fprintf(ficgp,"\nset out \"%s%d%1d%1d-%1d%1d.png\"",subdirf2(optionfilefiname,"varpijgr"), j1,k1,l1,k2,l2); |
fprintf(ficgp,"\nset out \"%s_%d%1d%1d-%1d%1d.svg\"",subdirf2(optionfilefiname,"VARPIJGR_"), j1,k1,l1,k2,l2); |
fprintf(ficgp,"\nset label \"%d\" at %11.3e,%11.3e center",(int) age, mu1,mu2); |
fprintf(ficgp,"\nset label \"%d\" at %11.3e,%11.3e center",(int) age, mu1,mu2); |
fprintf(ficgp,"\n# Age %d, p%1d%1d - p%1d%1d",(int) age, k1,l1,k2,l2); |
fprintf(ficgp,"\n# Age %d, p%1d%1d - p%1d%1d",(int) age, k1,l1,k2,l2); |
fprintf(ficgp,"\nplot [-pi:pi] %11.3e+ %.3f*(%11.3e*%11.3e*cos(t)+%11.3e*%11.3e*sin(t)), %11.3e +%.3f*(%11.3e*%11.3e*cos(t)+%11.3e*%11.3e*sin(t)) not",\ |
fprintf(ficgp,"\nplot [-pi:pi] %11.3e+ %.3f*(%11.3e*%11.3e*cos(t)+%11.3e*%11.3e*sin(t)), %11.3e +%.3f*(%11.3e*%11.3e*cos(t)+%11.3e*%11.3e*sin(t)) not",\ |
Line 3117 To be simple, these graphs help to under
|
Line 5289 To be simple, these graphs help to under
|
}/* if first */ |
}/* if first */ |
} /* age mod 5 */ |
} /* age mod 5 */ |
} /* end loop age */ |
} /* end loop age */ |
fprintf(ficgp,"\nset out \"%s%d%1d%1d-%1d%1d.png\";replot;",subdirf2(optionfilefiname,"varpijgr"), j1,k1,l1,k2,l2); |
fprintf(ficgp,"\nset out;\nset out \"%s_%d%1d%1d-%1d%1d.svg\";replot;set out;",subdirf2(optionfilefiname,"VARPIJGR_"), j1,k1,l1,k2,l2); |
first=1; |
first=1; |
} /*l12 */ |
} /*l12 */ |
} /* k12 */ |
} /* k12 */ |
} /*l1 */ |
} /*l1 */ |
}/* k1 */ |
}/* k1 */ |
} /* loop covariates */ |
/* } */ /* loop covariates */ |
} |
} |
free_ma3x(varpij,1,nlstate,1,nlstate+ndeath,(int) bage, (int)fage); |
free_ma3x(varpij,1,nlstate,1,nlstate+ndeath,(int) bage, (int)fage); |
free_matrix(mu,1,(nlstate+ndeath)*(nlstate+ndeath),(int) bage, (int)fage); |
free_matrix(mu,1,(nlstate+ndeath)*(nlstate+ndeath),(int) bage, (int)fage); |
|
free_matrix(doldm,1,(nlstate)*(nlstate+ndeath),1,(nlstate)*(nlstate+ndeath)); |
|
free_matrix(dnewm,1,(nlstate)*(nlstate+ndeath),1,npar); |
free_vector(xp,1,npar); |
free_vector(xp,1,npar); |
fclose(ficresprob); |
fclose(ficresprob); |
fclose(ficresprobcov); |
fclose(ficresprobcov); |
Line 3137 To be simple, these graphs help to under
|
Line 5311 To be simple, these graphs help to under
|
|
|
|
|
/******************* Printing html file ***********/ |
/******************* Printing html file ***********/ |
void printinghtml(char fileres[], char title[], char datafile[], int firstpass, \ |
void printinghtml(char fileresu[], char title[], char datafile[], int firstpass, \ |
int lastpass, int stepm, int weightopt, char model[],\ |
int lastpass, int stepm, int weightopt, char model[],\ |
int imx,int jmin, int jmax, double jmeanint,char rfileres[],\ |
int imx,int jmin, int jmax, double jmeanint,char rfileres[],\ |
int popforecast, int estepm ,\ |
int popforecast, int prevfcast, int backcast, int estepm , \ |
double jprev1, double mprev1,double anprev1, \ |
double jprev1, double mprev1,double anprev1, double dateprev1, \ |
double jprev2, double mprev2,double anprev2){ |
double jprev2, double mprev2,double anprev2, double dateprev2){ |
int jj1, k1, i1, cpt; |
int jj1, k1, i1, cpt; |
|
|
fprintf(fichtm,"<ul><li><h4>Result files (first order: no variance)</h4>\n \ |
fprintf(fichtm,"<ul><li><a href='#firstorder'>Result files (first order: no variance)</a>\n \ |
- Observed prevalence in each state (during the period defined between %.lf/%.lf/%.lf and %.lf/%.lf/%.lf): <a href=\"%s\">%s</a> <br>\n ", |
<li><a href='#secondorder'>Result files (second order (variance)</a>\n \ |
jprev1, mprev1,anprev1,jprev2, mprev2,anprev2,subdirf2(fileres,"p"),subdirf2(fileres,"p")); |
</ul>"); |
|
fprintf(fichtm,"<ul><li><h4><a name='firstorder'>Result files (first order: no variance)</a></h4>\n"); |
|
fprintf(fichtm,"<li>- Observed frequency between two states (during the period defined between %.lf/%.lf/%.lf and %.lf/%.lf/%.lf): <a href=\"%s\">%s</a> (html file)<br/>\n", |
|
jprev1, mprev1,anprev1,jprev2, mprev2,anprev2,subdirfext3(optionfilefiname,"PHTMFR_",".htm"),subdirfext3(optionfilefiname,"PHTMFR_",".htm")); |
|
fprintf(fichtm,"<li> - Observed prevalence in each state (during the period defined between %.lf/%.lf/%.lf and %.lf/%.lf/%.lf): <a href=\"%s\">%s</a> (html file) ", |
|
jprev1, mprev1,anprev1,jprev2, mprev2,anprev2,subdirfext3(optionfilefiname,"PHTM_",".htm"),subdirfext3(optionfilefiname,"PHTM_",".htm")); |
|
fprintf(fichtm,", <a href=\"%s\">%s</a> (text file) <br>\n",subdirf2(fileresu,"P_"),subdirf2(fileresu,"P_")); |
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
- Estimated transition probabilities over %d (stepm) months: <a href=\"%s\">%s</a><br>\n ", |
- Estimated transition probabilities over %d (stepm) months: <a href=\"%s\">%s</a><br>\n ", |
stepm,subdirf2(fileres,"pij"),subdirf2(fileres,"pij")); |
stepm,subdirf2(fileresu,"PIJ_"),subdirf2(fileresu,"PIJ_")); |
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
- Stable prevalence in each health state: <a href=\"%s\">%s</a> <br>\n", |
- Estimated back transition probabilities over %d (stepm) months: <a href=\"%s\">%s</a><br>\n ", |
subdirf2(fileres,"pl"),subdirf2(fileres,"pl")); |
stepm,subdirf2(fileresu,"PIJB_"),subdirf2(fileresu,"PIJB_")); |
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
- Life expectancies by age and initial health status (estepm=%2d months): \ |
- Period (stable) prevalence in each health state: <a href=\"%s\">%s</a> <br>\n", |
<a href=\"%s\">%s</a> <br>\n</li>", |
subdirf2(fileresu,"PL_"),subdirf2(fileresu,"PL_")); |
estepm,subdirf2(fileres,"e"),subdirf2(fileres,"e")); |
fprintf(fichtm,"\ |
|
- Period (stable) back prevalence in each health state: <a href=\"%s\">%s</a> <br>\n", |
|
subdirf2(fileresu,"PLB_"),subdirf2(fileresu,"PLB_")); |
|
fprintf(fichtm,"\ |
|
- (a) Life expectancies by health status at initial age, e<sub>i.</sub> (b) health expectancies by health status at initial age, e<sub>ij</sub> . If one or more covariates are included, specific tables for each value of the covariate are output in sequences within the same file (estepm=%2d months): \ |
|
<a href=\"%s\">%s</a> <br>\n", |
|
estepm,subdirf2(fileresu,"E_"),subdirf2(fileresu,"E_")); |
|
if(prevfcast==1){ |
|
fprintf(fichtm,"\ |
|
- Prevalence projections by age and states: \ |
|
<a href=\"%s\">%s</a> <br>\n</li>", subdirf2(fileresu,"F_"),subdirf2(fileresu,"F_")); |
|
} |
|
|
fprintf(fichtm," \n<ul><li><b>Graphs</b></li><p>"); |
fprintf(fichtm," \n<ul><li><b>Graphs</b></li><p>"); |
|
|
m=cptcoveff; |
m=pow(2,cptcoveff); |
if (cptcovn < 1) {m=1;ncodemax[1]=1;} |
if (cptcovn < 1) {m=1;ncodemax[1]=1;} |
|
|
jj1=0; |
jj1=0; |
for(k1=1; k1<=m;k1++){ |
for(k1=1; k1<=m;k1++){ |
for(i1=1; i1<=ncodemax[k1];i1++){ |
/* for(i1=1; i1<=ncodemax[k1];i1++){ */ |
jj1++; |
jj1++; |
if (cptcovn > 0) { |
if (cptcovn > 0) { |
fprintf(fichtm,"<hr size=\"2\" color=\"#EC5E5E\">************ Results for covariates"); |
fprintf(fichtm,"<hr size=\"2\" color=\"#EC5E5E\">************ Results for covariates"); |
for (cpt=1; cpt<=cptcoveff;cpt++) |
for (cpt=1; cpt<=cptcoveff;cpt++){ |
fprintf(fichtm," V%d=%d ",Tvaraff[cpt],nbcode[Tvaraff[cpt]][codtab[jj1][cpt]]); |
fprintf(fichtm," V%d=%d ",Tvaraff[cpt],nbcode[Tvaraff[cpt]][codtabm(jj1,cpt)]); |
|
printf(" V%d=%d ",Tvaraff[cpt],nbcode[Tvaraff[cpt]][codtabm(jj1,cpt)]);fflush(stdout); |
|
} |
fprintf(fichtm," ************\n<hr size=\"2\" color=\"#EC5E5E\">"); |
fprintf(fichtm," ************\n<hr size=\"2\" color=\"#EC5E5E\">"); |
} |
} |
|
/* aij, bij */ |
|
fprintf(fichtm,"<br>- Logit model (yours is: 1+age+%s), for example: logit(pij)=log(pij/pii)= aij+ bij age + V1 age + etc. as a function of age: <a href=\"%s_%d-1.svg\">%s_%d-1.svg</a><br> \ |
|
<img src=\"%s_%d-1.svg\">",model,subdirf2(optionfilefiname,"PE_"),jj1,subdirf2(optionfilefiname,"PE_"),jj1,subdirf2(optionfilefiname,"PE_"),jj1); |
/* Pij */ |
/* Pij */ |
fprintf(fichtm,"<br>- Pij or Conditional probabilities to be observed in state j being in state i, %d (stepm) months before: %s%d1.png<br> \ |
fprintf(fichtm,"<br>\n- P<sub>ij</sub> or conditional probabilities to be observed in state j being in state i, %d (stepm) months before: <a href=\"%s_%d-2.svg\">%s_%d-2.svg</a><br> \ |
<img src=\"%s%d1.png\">",stepm,subdirf2(optionfilefiname,"pe"),jj1,subdirf2(optionfilefiname,"pe"),jj1); |
<img src=\"%s_%d-2.svg\">",stepm,subdirf2(optionfilefiname,"PE_"),jj1,subdirf2(optionfilefiname,"PE_"),jj1,subdirf2(optionfilefiname,"PE_"),jj1); |
/* Quasi-incidences */ |
/* Quasi-incidences */ |
fprintf(fichtm,"<br>- Pij or Conditional probabilities to be observed in state j being in state i %d (stepm) months\ |
fprintf(fichtm,"<br>\n- I<sub>ij</sub> or Conditional probabilities to be observed in state j being in state i %d (stepm) months\ |
before but expressed in per year i.e. quasi incidences if stepm is small and probabilities too: %s%d2.png<br> \ |
before but expressed in per year i.e. quasi incidences if stepm is small and probabilities too,\ |
<img src=\"%s%d2.png\">",stepm,subdirf2(optionfilefiname,"pe"),jj1,subdirf2(optionfilefiname,"pe"),jj1); |
incidence (rates) are the limit when h tends to zero of the ratio of the probability <sub>h</sub>P<sub>ij</sub> \ |
/* Stable prevalence in each health state */ |
divided by h: <sub>h</sub>P<sub>ij</sub>/h : <a href=\"%s_%d-3.svg\">%s_%d-3.svg</a><br> \ |
for(cpt=1; cpt<nlstate;cpt++){ |
<img src=\"%s_%d-3.svg\">",stepm,subdirf2(optionfilefiname,"PE_"),jj1,subdirf2(optionfilefiname,"PE_"),jj1,subdirf2(optionfilefiname,"PE_"),jj1); |
fprintf(fichtm,"<br>- Stable prevalence in each health state : p%s%d%d.png<br> \ |
/* Survival functions (period) in state j */ |
<img src=\"%s%d%d.png\">",subdirf2(optionfilefiname,"p"),cpt,jj1,subdirf2(optionfilefiname,"p"),cpt,jj1); |
for(cpt=1; cpt<=nlstate;cpt++){ |
} |
fprintf(fichtm,"<br>\n- Survival functions in state %d. Or probability to survive in state %d being in state (1 to %d) at different ages. <a href=\"%s%d_%d.svg\">%s%d_%d.svg</a><br> \ |
|
<img src=\"%s_%d-%d.svg\">", cpt, cpt, nlstate, subdirf2(optionfilefiname,"LIJ_"),cpt,jj1,subdirf2(optionfilefiname,"LIJ_"),cpt,jj1,subdirf2(optionfilefiname,"LIJ_"),cpt,jj1); |
|
} |
|
/* State specific survival functions (period) */ |
|
for(cpt=1; cpt<=nlstate;cpt++){ |
|
fprintf(fichtm,"<br>\n- Survival functions from state %d in each live state and total.\ |
|
Or probability to survive in various states (1 to %d) being in state %d at different ages.\ |
|
<a href=\"%s%d_%d.svg\">%s%d_%d.svg</a><br> <img src=\"%s_%d-%d.svg\">", cpt, nlstate, cpt, subdirf2(optionfilefiname,"LIJT_"),cpt,jj1,subdirf2(optionfilefiname,"LIJT_"),cpt,jj1,subdirf2(optionfilefiname,"LIJT_"),cpt,jj1); |
|
} |
|
/* Period (stable) prevalence in each health state */ |
|
for(cpt=1; cpt<=nlstate;cpt++){ |
|
fprintf(fichtm,"<br>\n- Convergence to period (stable) prevalence in state %d. Or probability to be in state %d being in state (1 to %d) at different ages. <a href=\"%s_%d-%d.svg\">%s_%d-%d.svg</a><br> \ |
|
<img src=\"%s_%d-%d.svg\">", cpt, cpt, nlstate, subdirf2(optionfilefiname,"P_"),cpt,jj1,subdirf2(optionfilefiname,"P_"),cpt,jj1,subdirf2(optionfilefiname,"P_"),cpt,jj1); |
|
} |
|
if(backcast==1){ |
|
/* Period (stable) back prevalence in each health state */ |
|
for(cpt=1; cpt<=nlstate;cpt++){ |
|
fprintf(fichtm,"<br>\n- Convergence to period (stable) back prevalence in state %d. Or probability to be in state %d being in state (1 to %d) at different ages. <a href=\"%s_%d-%d.svg\">%s_%d-%d.svg</a><br> \ |
|
<img src=\"%s_%d-%d.svg\">", cpt, cpt, nlstate, subdirf2(optionfilefiname,"PB_"),cpt,jj1,subdirf2(optionfilefiname,"PB_"),cpt,jj1,subdirf2(optionfilefiname,"PB_"),cpt,jj1); |
|
} |
|
} |
|
if(prevfcast==1){ |
|
/* Projection of prevalence up to period (stable) prevalence in each health state */ |
|
for(cpt=1; cpt<=nlstate;cpt++){ |
|
fprintf(fichtm,"<br>\n- Projection of cross-sectional prevalence (estimated with cases observed from %.1f to %.1f) up to period (stable) prevalence in state %d. Or probability to be in state %d being in state (1 to %d) at different ages. <a href=\"%s%d_%d.svg\">%s%d_%d.svg</a><br> \ |
|
<img src=\"%s_%d-%d.svg\">", dateprev1, dateprev2, cpt, cpt, nlstate, subdirf2(optionfilefiname,"PROJ_"),cpt,jj1,subdirf2(optionfilefiname,"PROJ_"),cpt,jj1,subdirf2(optionfilefiname,"PROJ_"),cpt,jj1); |
|
} |
|
} |
|
|
for(cpt=1; cpt<=nlstate;cpt++) { |
for(cpt=1; cpt<=nlstate;cpt++) { |
fprintf(fichtm,"\n<br>- Health life expectancies by age and initial health state (%d): %s%d%d.png <br> \ |
fprintf(fichtm,"\n<br>- Life expectancy by health state (%d) at initial age and its decomposition into health expectancies in each alive state (1 to %d) (or area under each survival functions): <a href=\"%s_%d%d.svg\">%s_%d%d.svg</a> <br> \ |
<img src=\"%s%d%d.png\">",cpt,subdirf2(optionfilefiname,"exp"),cpt,jj1,subdirf2(optionfilefiname,"exp"),cpt,jj1); |
<img src=\"%s_%d%d.svg\">",cpt,nlstate,subdirf2(optionfilefiname,"EXP_"),cpt,jj1,subdirf2(optionfilefiname,"EXP_"),cpt,jj1,subdirf2(optionfilefiname,"EXP_"),cpt,jj1); |
} |
} |
} /* end i1 */ |
/* } /\* end i1 *\/ */ |
}/* End k1 */ |
}/* End k1 */ |
fprintf(fichtm,"</ul>"); |
fprintf(fichtm,"</ul>"); |
|
|
|
|
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
\n<br><li><h4> Result files (second order: variances)</h4>\n\ |
\n<br><li><h4> <a name='secondorder'>Result files (second order: variances)</a></h4>\n\ |
- Parameter file with estimated parameters and covariance matrix: <a href=\"%s\">%s</a> <br>\n", rfileres,rfileres); |
- Parameter file with estimated parameters and covariance matrix: <a href=\"%s\">%s</a> <br> \ |
|
- 95%% confidence intervals and Wald tests of the estimated parameters are in the log file if optimization has been done (mle != 0).<br> \ |
|
But because parameters are usually highly correlated (a higher incidence of disability \ |
|
and a higher incidence of recovery can give very close observed transition) it might \ |
|
be very useful to look not only at linear confidence intervals estimated from the \ |
|
variances but at the covariance matrix. And instead of looking at the estimated coefficients \ |
|
(parameters) of the logistic regression, it might be more meaningful to visualize the \ |
|
covariance matrix of the one-step probabilities. \ |
|
See page 'Matrix of variance-covariance of one-step probabilities' below. \n", rfileres,rfileres); |
|
|
fprintf(fichtm," - Variance of one-step probabilities: <a href=\"%s\">%s</a> <br>\n", |
fprintf(fichtm," - Standard deviation of one-step probabilities: <a href=\"%s\">%s</a> <br>\n", |
subdirf2(fileres,"prob"),subdirf2(fileres,"prob")); |
subdirf2(fileresu,"PROB_"),subdirf2(fileresu,"PROB_")); |
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
- Variance-covariance of one-step probabilities: <a href=\"%s\">%s</a> <br>\n", |
- Variance-covariance of one-step probabilities: <a href=\"%s\">%s</a> <br>\n", |
subdirf2(fileres,"probcov"),subdirf2(fileres,"probcov")); |
subdirf2(fileresu,"PROBCOV_"),subdirf2(fileresu,"PROBCOV_")); |
|
|
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
- Correlation matrix of one-step probabilities: <a href=\"%s\">%s</a> <br>\n", |
- Correlation matrix of one-step probabilities: <a href=\"%s\">%s</a> <br>\n", |
subdirf2(fileres,"probcor"),subdirf2(fileres,"probcor")); |
subdirf2(fileresu,"PROBCOR_"),subdirf2(fileresu,"PROBCOR_")); |
|
fprintf(fichtm,"\ |
|
- Variances and covariances of health expectancies by age and <b>initial health status</b> (cov(e<sup>ij</sup>,e<sup>kl</sup>)(estepm=%2d months): \ |
|
<a href=\"%s\">%s</a> <br>\n</li>", |
|
estepm,subdirf2(fileresu,"CVE_"),subdirf2(fileresu,"CVE_")); |
|
fprintf(fichtm,"\ |
|
- (a) Health expectancies by health status at initial age (e<sup>ij</sup>) and standard errors (in parentheses) (b) life expectancies and standard errors (e<sup>i.</sup>=e<sup>i1</sup>+e<sup>i2</sup>+...)(estepm=%2d months): \ |
|
<a href=\"%s\">%s</a> <br>\n</li>", |
|
estepm,subdirf2(fileresu,"STDE_"),subdirf2(fileresu,"STDE_")); |
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
- Variances and covariances of life expectancies by age and initial health status (estepm=%d months): <a href=\"%s\">%s</a><br>\n", |
- Variances and covariances of health expectancies by age. Status (i) based health expectancies (in state j), e<sup>ij</sup> are weighted by the period prevalences in each state i (if popbased=1, an additional computation is done using the cross-sectional prevalences, i.e population based) (estepm=%d months): <a href=\"%s\">%s</a><br>\n", |
estepm, subdirf2(fileres,"v"),subdirf2(fileres,"v")); |
estepm, subdirf2(fileresu,"V_"),subdirf2(fileresu,"V_")); |
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
- Health expectancies with their variances (no covariance): <a href=\"%s\">%s</a> <br>\n", |
- Total life expectancy and total health expectancies to be spent in each health state e<sup>.j</sup> with their standard errors (if popbased=1, an additional computation is done using the cross-sectional prevalences, i.e population based) (estepm=%d months): <a href=\"%s\">%s</a> <br>\n", |
subdirf2(fileres,"t"),subdirf2(fileres,"t")); |
estepm, subdirf2(fileresu,"T_"),subdirf2(fileresu,"T_")); |
fprintf(fichtm,"\ |
fprintf(fichtm,"\ |
- Standard deviation of stable prevalences: <a href=\"%s\">%s</a> <br>\n",\ |
- Standard deviation of period (stable) prevalences: <a href=\"%s\">%s</a> <br>\n",\ |
subdirf2(fileres,"vpl"),subdirf2(fileres,"vpl")); |
subdirf2(fileresu,"VPL_"),subdirf2(fileresu,"VPL_")); |
|
|
/* if(popforecast==1) fprintf(fichtm,"\n */ |
/* if(popforecast==1) fprintf(fichtm,"\n */ |
/* - Prevalences forecasting: <a href=\"f%s\">f%s</a> <br>\n */ |
/* - Prevalences forecasting: <a href=\"f%s\">f%s</a> <br>\n */ |
Line 3227 fprintf(fichtm," \n<ul><li><b>Graphs</b>
|
Line 5466 fprintf(fichtm," \n<ul><li><b>Graphs</b>
|
fflush(fichtm); |
fflush(fichtm); |
fprintf(fichtm," <ul><li><b>Graphs</b></li><p>"); |
fprintf(fichtm," <ul><li><b>Graphs</b></li><p>"); |
|
|
m=cptcoveff; |
m=pow(2,cptcoveff); |
if (cptcovn < 1) {m=1;ncodemax[1]=1;} |
if (cptcovn < 1) {m=1;ncodemax[1]=1;} |
|
|
jj1=0; |
jj1=0; |
for(k1=1; k1<=m;k1++){ |
for(k1=1; k1<=m;k1++){ |
for(i1=1; i1<=ncodemax[k1];i1++){ |
/* for(i1=1; i1<=ncodemax[k1];i1++){ */ |
jj1++; |
jj1++; |
if (cptcovn > 0) { |
if (cptcovn > 0) { |
fprintf(fichtm,"<hr size=\"2\" color=\"#EC5E5E\">************ Results for covariates"); |
fprintf(fichtm,"<hr size=\"2\" color=\"#EC5E5E\">************ Results for covariates"); |
for (cpt=1; cpt<=cptcoveff;cpt++) |
for (cpt=1; cpt<=cptcoveff;cpt++) |
fprintf(fichtm," V%d=%d ",Tvaraff[cpt],nbcode[Tvaraff[cpt]][codtab[jj1][cpt]]); |
fprintf(fichtm," V%d=%d ",Tvaraff[cpt],nbcode[Tvaraff[cpt]][codtabm(jj1,cpt)]); |
fprintf(fichtm," ************\n<hr size=\"2\" color=\"#EC5E5E\">"); |
fprintf(fichtm," ************\n<hr size=\"2\" color=\"#EC5E5E\">"); |
} |
} |
for(cpt=1; cpt<=nlstate;cpt++) { |
for(cpt=1; cpt<=nlstate;cpt++) { |
fprintf(fichtm,"<br>- Observed (cross-sectional) and period (incidence based) \ |
fprintf(fichtm,"<br>- Observed (cross-sectional) and period (incidence based) \ |
prevalence (with 95%% confidence interval) in state (%d): %s%d%d.png <br>\ |
prevalence (with 95%% confidence interval) in state (%d): <a href=\"%s_%d%d.svg\"> %s_%d-%d.svg <br>\ |
<img src=\"%s%d%d.png\">",cpt,subdirf2(optionfilefiname,"v"),cpt,jj1,subdirf2(optionfilefiname,"v"),cpt,jj1); |
<img src=\"%s_%d-%d.svg\">",cpt,subdirf2(optionfilefiname,"V_"),cpt,jj1,subdirf2(optionfilefiname,"V_"),cpt,jj1,subdirf2(optionfilefiname,"V_"),cpt,jj1); |
} |
} |
fprintf(fichtm,"\n<br>- Total life expectancy by age and \ |
fprintf(fichtm,"\n<br>- Total life expectancy by age and \ |
health expectancies in states (1) and (2): %s%d.png<br>\ |
health expectancies in states (1) and (2). If popbased=1 the smooth (due to the model) \ |
<img src=\"%s%d.png\">",subdirf2(optionfilefiname,"e"),jj1,subdirf2(optionfilefiname,"e"),jj1); |
true period expectancies (those weighted with period prevalences are also\ |
} /* end i1 */ |
drawn in addition to the population based expectancies computed using\ |
|
observed and cahotic prevalences: <a href=\"%s_%d.svg\">%s_%d.svg<br>\ |
|
<img src=\"%s_%d.svg\">",subdirf2(optionfilefiname,"E_"),jj1,subdirf2(optionfilefiname,"E_"),jj1,subdirf2(optionfilefiname,"E_"),jj1); |
|
/* } /\* end i1 *\/ */ |
}/* End k1 */ |
}/* End k1 */ |
fprintf(fichtm,"</ul>"); |
fprintf(fichtm,"</ul>"); |
fflush(fichtm); |
fflush(fichtm); |
} |
} |
|
|
/******************* Gnuplot file **************/ |
/******************* Gnuplot file **************/ |
void printinggnuplot(char fileres[], char optionfilefiname[], double ageminpar, double agemaxpar, double fage , char pathc[], double p[]){ |
void printinggnuplot(char fileresu[], char optionfilefiname[], double ageminpar, double agemaxpar, double fage , int prevfcast, char pathc[], double p[]){ |
|
|
char dirfileres[132],optfileres[132]; |
char dirfileres[132],optfileres[132]; |
int m,cpt,k1,i,k,j,jk,k2,k3,ij,l; |
int cpt=0,k1=0,i=0,k=0,j=0,jk=0,k2=0,k3=0,ij=0,l=0; |
int ng; |
int lv=0, vlv=0, kl=0; |
|
int ng=0; |
|
int vpopbased; |
/* if((ficgp=fopen(optionfilegnuplot,"a"))==NULL) { */ |
/* if((ficgp=fopen(optionfilegnuplot,"a"))==NULL) { */ |
/* printf("Problem with file %s",optionfilegnuplot); */ |
/* printf("Problem with file %s",optionfilegnuplot); */ |
/* fprintf(ficlog,"Problem with file %s",optionfilegnuplot); */ |
/* fprintf(ficlog,"Problem with file %s",optionfilegnuplot); */ |
Line 3270 void printinggnuplot(char fileres[], cha
|
Line 5514 void printinggnuplot(char fileres[], cha
|
/*#endif */ |
/*#endif */ |
m=pow(2,cptcoveff); |
m=pow(2,cptcoveff); |
|
|
|
/* Contribution to likelihood */ |
|
/* Plot the probability implied in the likelihood */ |
|
fprintf(ficgp,"\n# Contributions to the Likelihood, mle >=1. For mle=4 no interpolation, pure matrix products.\n#\n"); |
|
fprintf(ficgp,"\n set log y; unset log x;set xlabel \"Age\"; set ylabel \"Likelihood (-2Log(L))\";"); |
|
/* fprintf(ficgp,"\nset ter svg size 640, 480"); */ /* Too big for svg */ |
|
fprintf(ficgp,"\nset ter pngcairo size 640, 480"); |
|
/* nice for mle=4 plot by number of matrix products. |
|
replot "rrtest1/toto.txt" u 2:($4 == 1 && $5==2 ? $9 : 1/0):5 t "p12" with point lc 1 */ |
|
/* replot exp(p1+p2*x)/(1+exp(p1+p2*x)+exp(p3+p4*x)+exp(p5+p6*x)) t "p12(x)" */ |
|
/* fprintf(ficgp,"\nset out \"%s.svg\";",subdirf2(optionfilefiname,"ILK_")); */ |
|
fprintf(ficgp,"\nset out \"%s-dest.png\";",subdirf2(optionfilefiname,"ILK_")); |
|
fprintf(ficgp,"\nset log y;plot \"%s\" u 2:(-$13):6 t \"All sample, transitions colored by destination\" with dots lc variable; set out;\n",subdirf(fileresilk)); |
|
fprintf(ficgp,"\nset out \"%s-ori.png\";",subdirf2(optionfilefiname,"ILK_")); |
|
fprintf(ficgp,"\nset log y;plot \"%s\" u 2:(-$13):5 t \"All sample, transitions colored by origin\" with dots lc variable; set out;\n\n",subdirf(fileresilk)); |
|
for (i=1; i<= nlstate ; i ++) { |
|
fprintf(ficgp,"\nset out \"%s-p%dj.png\";set ylabel \"Probability for each individual/wave\";",subdirf2(optionfilefiname,"ILK_"),i); |
|
fprintf(ficgp,"unset log;\n# plot weighted, mean weight should have point size of 0.5\n plot \"%s\"",subdirf(fileresilk)); |
|
fprintf(ficgp," u 2:($5 == %d && $6==%d ? $10 : 1/0):($12/4.):6 t \"p%d%d\" with points pointtype 7 ps variable lc variable \\\n",i,1,i,1); |
|
for (j=2; j<= nlstate+ndeath ; j ++) { |
|
fprintf(ficgp,",\\\n \"\" u 2:($5 == %d && $6==%d ? $10 : 1/0):($12/4.):6 t \"p%d%d\" with points pointtype 7 ps variable lc variable ",i,j,i,j); |
|
} |
|
fprintf(ficgp,";\nset out; unset ylabel;\n"); |
|
} |
|
/* unset log; plot "rrtest1_sorted_4/ILK_rrtest1_sorted_4.txt" u 2:($4 == 1 && $5==2 ? $9 : 1/0):5 t "p12" with points lc variable */ |
|
/* fprintf(ficgp,"\nset log y;plot \"%s\" u 2:(-$11):3 t \"All sample, all transitions\" with dots lc variable",subdirf(fileresilk)); */ |
|
/* fprintf(ficgp,"\nreplot \"%s\" u 2:($3 <= 3 ? -$11 : 1/0):3 t \"First 3 individuals\" with line lc variable", subdirf(fileresilk)); */ |
|
fprintf(ficgp,"\nset out;unset log\n"); |
|
/* fprintf(ficgp,"\nset out \"%s.svg\"; replot; set out; # bug gnuplot",subdirf2(optionfilefiname,"ILK_")); */ |
|
|
strcpy(dirfileres,optionfilefiname); |
strcpy(dirfileres,optionfilefiname); |
strcpy(optfileres,"vpl"); |
strcpy(optfileres,"vpl"); |
/* 1eme*/ |
/* 1eme*/ |
for (cpt=1; cpt<= nlstate ; cpt ++) { |
for (cpt=1; cpt<= nlstate ; cpt ++) { /* For each live state */ |
for (k1=1; k1<= m ; k1 ++) { |
for (k1=1; k1<= m ; k1 ++) { /* For each combination of covariate */ |
fprintf(ficgp,"\nset out \"%s%d%d.png\" \n",subdirf2(optionfilefiname,"v"),cpt,k1); |
/* plot [100000000000000000000:-100000000000000000000] "mysbiaspar/vplrmysbiaspar.txt to check */ |
fprintf(ficgp,"\n#set out \"v%s%d%d.png\" \n",optionfilefiname,cpt,k1); |
fprintf(ficgp,"\n# 1st: Period (stable) prevalence with CI: 'VPL_' files "); |
|
for (k=1; k<=cptcoveff; k++){ /* For each covariate and each value */ |
|
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate number corresponding to k1 combination */ |
|
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
|
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
|
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
|
vlv= nbcode[Tvaraff[lv]][lv]; |
|
fprintf(ficgp," V%d=%d ",k,vlv); |
|
} |
|
fprintf(ficgp,"\n#\n"); |
|
|
|
fprintf(ficgp,"\nset out \"%s_%d-%d.svg\" \n",subdirf2(optionfilefiname,"V_"),cpt,k1); |
|
fprintf(ficgp,"\n#set out \"V_%s_%d-%d.svg\" \n",optionfilefiname,cpt,k1); |
fprintf(ficgp,"set xlabel \"Age\" \n\ |
fprintf(ficgp,"set xlabel \"Age\" \n\ |
set ylabel \"Probability\" \n\ |
set ylabel \"Probability\" \n\ |
set ter png small\n\ |
set ter svg size 640, 480\n\ |
set size 0.65,0.65\n\ |
plot [%.f:%.f] \"%s\" every :::%d::%d u 1:2 \"%%lf",ageminpar,fage,subdirf2(fileresu,"VPL_"),k1-1,k1-1); |
plot [%.f:%.f] \"%s\" every :::%d::%d u 1:2 \"\%%lf",ageminpar,fage,subdirf2(fileres,"vpl"),k1-1,k1-1); |
|
|
|
for (i=1; i<= nlstate ; i ++) { |
for (i=1; i<= nlstate ; i ++) { |
if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)"); |
if (i==cpt) fprintf(ficgp," %%lf (%%lf)"); |
else fprintf(ficgp," \%%*lf (\%%*lf)"); |
else fprintf(ficgp," %%*lf (%%*lf)"); |
} |
} |
fprintf(ficgp,"\" t\"Stable prevalence\" w l 0,\"%s\" every :::%d::%d u 1:($2+1.96*$3) \"\%%lf",subdirf2(fileres,"vpl"),k1-1,k1-1); |
fprintf(ficgp,"\" t\"Period (stable) prevalence\" w l lt 0,\"%s\" every :::%d::%d u 1:($2+1.96*$3) \"%%lf",subdirf2(fileresu,"VPL_"),k1-1,k1-1); |
for (i=1; i<= nlstate ; i ++) { |
for (i=1; i<= nlstate ; i ++) { |
if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)"); |
if (i==cpt) fprintf(ficgp," %%lf (%%lf)"); |
else fprintf(ficgp," \%%*lf (\%%*lf)"); |
else fprintf(ficgp," %%*lf (%%*lf)"); |
} |
} |
fprintf(ficgp,"\" t\"95\%% CI\" w l 1,\"%s\" every :::%d::%d u 1:($2-1.96*$3) \"\%%lf",subdirf2(fileres,"vpl"),k1-1,k1-1); |
fprintf(ficgp,"\" t\"95%% CI\" w l lt 1,\"%s\" every :::%d::%d u 1:($2-1.96*$3) \"%%lf",subdirf2(fileresu,"VPL_"),k1-1,k1-1); |
for (i=1; i<= nlstate ; i ++) { |
for (i=1; i<= nlstate ; i ++) { |
if (i==cpt) fprintf(ficgp," \%%lf (\%%lf)"); |
if (i==cpt) fprintf(ficgp," %%lf (%%lf)"); |
else fprintf(ficgp," \%%*lf (\%%*lf)"); |
else fprintf(ficgp," %%*lf (%%*lf)"); |
} |
} |
fprintf(ficgp,"\" t\"\" w l 1,\"%s\" every :::%d::%d u 1:($%d) t\"Observed prevalence \" w l 2",subdirf2(fileres,"p"),k1-1,k1-1,2+4*(cpt-1)); |
fprintf(ficgp,"\" t\"\" w l lt 1,\"%s\" every :::%d::%d u 1:($%d) t\"Observed prevalence \" w l lt 2",subdirf2(fileresu,"P_"),k1-1,k1-1,2+4*(cpt-1)); |
} |
fprintf(ficgp,"\nset out \n"); |
} |
} /* k1 */ |
|
} /* cpt */ |
/*2 eme*/ |
/*2 eme*/ |
|
|
for (k1=1; k1<= m ; k1 ++) { |
for (k1=1; k1<= m ; k1 ++) { |
fprintf(ficgp,"\nset out \"%s%d.png\" \n",subdirf2(optionfilefiname,"e"),k1); |
fprintf(ficgp,"\n# 2nd: Total life expectancy with CI: 't' files "); |
fprintf(ficgp,"set ylabel \"Years\" \nset ter png small\nset size 0.65,0.65\nplot [%.f:%.f] ",ageminpar,fage); |
for (k=1; k<=cptcoveff; k++){ /* For each covariate and each value */ |
|
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate number corresponding to k1 combination */ |
for (i=1; i<= nlstate+1 ; i ++) { |
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
k=2*i; |
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
fprintf(ficgp,"\"%s\" every :::%d::%d u 1:2 \"\%%lf",subdirf2(fileres,"t"),k1-1,k1-1); |
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
for (j=1; j<= nlstate+1 ; j ++) { |
vlv= nbcode[Tvaraff[lv]][lv]; |
if (j==i) fprintf(ficgp," \%%lf (\%%lf)"); |
fprintf(ficgp," V%d=%d ",k,vlv); |
else fprintf(ficgp," \%%*lf (\%%*lf)"); |
} |
} |
fprintf(ficgp,"\n#\n"); |
if (i== 1) fprintf(ficgp,"\" t\"TLE\" w l ,"); |
|
else fprintf(ficgp,"\" t\"LE in state (%d)\" w l ,",i-1); |
fprintf(ficgp,"\nset out \"%s_%d.svg\" \n",subdirf2(optionfilefiname,"E_"),k1); |
fprintf(ficgp,"\"%s\" every :::%d::%d u 1:($2-$3*2) \"\%%lf",subdirf2(fileres,"t"),k1-1,k1-1); |
for(vpopbased=0; vpopbased <= popbased; vpopbased++){ /* Done for vpopbased=0 and vpopbased=1 if popbased==1*/ |
for (j=1; j<= nlstate+1 ; j ++) { |
if(vpopbased==0) |
if (j==i) fprintf(ficgp," \%%lf (\%%lf)"); |
fprintf(ficgp,"set ylabel \"Years\" \nset ter svg size 640, 480\nplot [%.f:%.f] ",ageminpar,fage); |
else fprintf(ficgp," \%%*lf (\%%*lf)"); |
else |
} |
fprintf(ficgp,"\nreplot "); |
fprintf(ficgp,"\" t\"\" w l 0,"); |
for (i=1; i<= nlstate+1 ; i ++) { |
fprintf(ficgp,"\"%s\" every :::%d::%d u 1:($2+$3*2) \"\%%lf",subdirf2(fileres,"t"),k1-1,k1-1); |
k=2*i; |
for (j=1; j<= nlstate+1 ; j ++) { |
fprintf(ficgp,"\"%s\" every :::%d::%d u 1:($2==%d && $4!=0 ?$4 : 1/0) \"%%lf %%lf %%lf",subdirf2(fileresu,"T_"),k1-1,k1-1, vpopbased); |
if (j==i) fprintf(ficgp," \%%lf (\%%lf)"); |
for (j=1; j<= nlstate+1 ; j ++) { |
else fprintf(ficgp," \%%*lf (\%%*lf)"); |
if (j==i) fprintf(ficgp," %%lf (%%lf)"); |
} |
else fprintf(ficgp," %%*lf (%%*lf)"); |
if (i== (nlstate+1)) fprintf(ficgp,"\" t\"\" w l 0"); |
} |
else fprintf(ficgp,"\" t\"\" w l 0,"); |
if (i== 1) fprintf(ficgp,"\" t\"TLE\" w l lt %d, \\\n",i); |
} |
else fprintf(ficgp,"\" t\"LE in state (%d)\" w l lt %d, \\\n",i-1,i+1); |
} |
fprintf(ficgp,"\"%s\" every :::%d::%d u 1:($2==%d && $4!=0 ? $4-$5*2 : 1/0) \"%%lf %%lf %%lf",subdirf2(fileresu,"T_"),k1-1,k1-1,vpopbased); |
|
for (j=1; j<= nlstate+1 ; j ++) { |
|
if (j==i) fprintf(ficgp," %%lf (%%lf)"); |
|
else fprintf(ficgp," %%*lf (%%*lf)"); |
|
} |
|
fprintf(ficgp,"\" t\"\" w l lt 0,"); |
|
fprintf(ficgp,"\"%s\" every :::%d::%d u 1:($2==%d && $4!=0 ? $4+$5*2 : 1/0) \"%%lf %%lf %%lf",subdirf2(fileresu,"T_"),k1-1,k1-1,vpopbased); |
|
for (j=1; j<= nlstate+1 ; j ++) { |
|
if (j==i) fprintf(ficgp," %%lf (%%lf)"); |
|
else fprintf(ficgp," %%*lf (%%*lf)"); |
|
} |
|
if (i== (nlstate+1)) fprintf(ficgp,"\" t\"\" w l lt 0"); |
|
else fprintf(ficgp,"\" t\"\" w l lt 0,\\\n"); |
|
} /* state */ |
|
} /* vpopbased */ |
|
fprintf(ficgp,"\nset out;set out \"%s_%d.svg\"; replot; set out; \n",subdirf2(optionfilefiname,"E_"),k1); /* Buggy gnuplot */ |
|
} /* k1 */ |
|
|
|
|
/*3eme*/ |
/*3eme*/ |
|
|
for (k1=1; k1<= m ; k1 ++) { |
for (k1=1; k1<= m ; k1 ++) { |
for (cpt=1; cpt<= nlstate ; cpt ++) { |
for (cpt=1; cpt<= nlstate ; cpt ++) { |
k=2+nlstate*(2*cpt-2); |
fprintf(ficgp,"\n# 3d: Life expectancy with EXP_ files: cov=%d state=%d",k1, cpt); |
fprintf(ficgp,"\nset out \"%s%d%d.png\" \n",subdirf2(optionfilefiname,"exp"),cpt,k1); |
for (k=1; k<=cptcoveff; k++){ /* For each covariate and each value */ |
fprintf(ficgp,"set ter png small\n\ |
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate number corresponding to k1 combination */ |
set size 0.65,0.65\n\ |
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
plot [%.f:%.f] \"%s\" every :::%d::%d u 1:%d t \"e%d1\" w l",ageminpar,fage,subdirf2(fileres,"e"),k1-1,k1-1,k,cpt); |
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
|
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
|
vlv= nbcode[Tvaraff[lv]][lv]; |
|
fprintf(ficgp," V%d=%d ",k,vlv); |
|
} |
|
fprintf(ficgp,"\n#\n"); |
|
|
|
/* k=2+nlstate*(2*cpt-2); */ |
|
k=2+(nlstate+1)*(cpt-1); |
|
fprintf(ficgp,"\nset out \"%s_%d%d.svg\" \n",subdirf2(optionfilefiname,"EXP_"),cpt,k1); |
|
fprintf(ficgp,"set ter svg size 640, 480\n\ |
|
plot [%.f:%.f] \"%s\" every :::%d::%d u 1:%d t \"e%d1\" w l",ageminpar,fage,subdirf2(fileresu,"E_"),k1-1,k1-1,k,cpt); |
/*fprintf(ficgp,",\"e%s\" every :::%d::%d u 1:($%d-2*$%d) \"\%%lf ",fileres,k1-1,k1-1,k,k+1); |
/*fprintf(ficgp,",\"e%s\" every :::%d::%d u 1:($%d-2*$%d) \"\%%lf ",fileres,k1-1,k1-1,k,k+1); |
for (i=1; i<= nlstate*2 ; i ++) fprintf(ficgp,"\%%lf (\%%lf) "); |
for (i=1; i<= nlstate*2 ; i ++) fprintf(ficgp,"\%%lf (\%%lf) "); |
fprintf(ficgp,"\" t \"e%d1\" w l",cpt); |
fprintf(ficgp,"\" t \"e%d1\" w l",cpt); |
Line 3349 plot [%.f:%.f] \"%s\" every :::%d::%d u
|
Line 5660 plot [%.f:%.f] \"%s\" every :::%d::%d u
|
|
|
*/ |
*/ |
for (i=1; i< nlstate ; i ++) { |
for (i=1; i< nlstate ; i ++) { |
fprintf(ficgp," ,\"%s\" every :::%d::%d u 1:%d t \"e%d%d\" w l",subdirf2(fileres,"e"),k1-1,k1-1,k+2*i,cpt,i+1); |
fprintf(ficgp," ,\"%s\" every :::%d::%d u 1:%d t \"e%d%d\" w l",subdirf2(fileresu,"E_"),k1-1,k1-1,k+i,cpt,i+1); |
|
/* fprintf(ficgp," ,\"%s\" every :::%d::%d u 1:%d t \"e%d%d\" w l",subdirf2(fileres,"e"),k1-1,k1-1,k+2*i,cpt,i+1);*/ |
|
|
} |
} |
|
fprintf(ficgp," ,\"%s\" every :::%d::%d u 1:%d t \"e%d.\" w l",subdirf2(fileresu,"E_"),k1-1,k1-1,k+nlstate,cpt); |
} |
} |
} |
} |
|
|
/* CV preval stable (period) */ |
/* Survival functions (period) from state i in state j by initial state i */ |
for (k1=1; k1<= m ; k1 ++) { |
for (k1=1; k1<= m ; k1 ++) { /* For each multivariate if any */ |
for (cpt=1; cpt<=nlstate ; cpt ++) { |
for (cpt=1; cpt<=nlstate ; cpt ++) { /* For each life state */ |
|
fprintf(ficgp,"\n#\n#\n# Survival functions in state j : 'LIJ_' files, cov=%d state=%d",k1, cpt); |
|
for (k=1; k<=cptcoveff; k++){ /* For each covariate and each value */ |
|
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate number corresponding to k1 combination */ |
|
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
|
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
|
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
|
vlv= nbcode[Tvaraff[lv]][lv]; |
|
fprintf(ficgp," V%d=%d ",k,vlv); |
|
} |
|
fprintf(ficgp,"\n#\n"); |
|
|
|
fprintf(ficgp,"\nset out \"%s_%d-%d.svg\" \n",subdirf2(optionfilefiname,"LIJ_"),cpt,k1); |
|
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability to be alive\" \n\ |
|
set ter svg size 640, 480\n\ |
|
unset log y\n\ |
|
plot [%.f:%.f] ", ageminpar, agemaxpar); |
k=3; |
k=3; |
fprintf(ficgp,"\nset out \"%s%d%d.png\" \n",subdirf2(optionfilefiname,"p"),cpt,k1); |
for (i=1; i<= nlstate ; i ++){ |
|
if(i==1){ |
|
fprintf(ficgp,"\"%s\"",subdirf2(fileresu,"PIJ_")); |
|
}else{ |
|
fprintf(ficgp,", '' "); |
|
} |
|
l=(nlstate+ndeath)*(i-1)+1; |
|
fprintf(ficgp," u ($1==%d ? ($3):1/0):($%d/($%d",k1,k+l+(cpt-1),k+l); |
|
for (j=2; j<= nlstate+ndeath ; j ++) |
|
fprintf(ficgp,"+$%d",k+l+j-1); |
|
fprintf(ficgp,")) t \"l(%d,%d)\" w l",i,cpt); |
|
} /* nlstate */ |
|
fprintf(ficgp,"\nset out\n"); |
|
} /* end cpt state*/ |
|
} /* end covariate */ |
|
|
|
/* Survival functions (period) from state i in state j by final state j */ |
|
for (k1=1; k1<= m ; k1 ++) { /* For each covariate if any */ |
|
for (cpt=1; cpt<=nlstate ; cpt ++) { /* For each inital state */ |
|
fprintf(ficgp,"\n#\n#\n# Survival functions in state j and all livestates from state i by final state j: 'lij' files, cov=%d state=%d",k1, cpt); |
|
for (k=1; k<=cptcoveff; k++){ /* For each covariate and each value */ |
|
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate number corresponding to k1 combination */ |
|
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
|
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
|
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
|
vlv= nbcode[Tvaraff[lv]][lv]; |
|
fprintf(ficgp," V%d=%d ",k,vlv); |
|
} |
|
fprintf(ficgp,"\n#\n"); |
|
|
|
fprintf(ficgp,"\nset out \"%s_%d-%d.svg\" \n",subdirf2(optionfilefiname,"LIJT_"),cpt,k1); |
|
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability to be alive\" \n\ |
|
set ter svg size 640, 480\n\ |
|
unset log y\n\ |
|
plot [%.f:%.f] ", ageminpar, agemaxpar); |
|
k=3; |
|
for (j=1; j<= nlstate ; j ++){ /* Lived in state j */ |
|
if(j==1) |
|
fprintf(ficgp,"\"%s\"",subdirf2(fileresu,"PIJ_")); |
|
else |
|
fprintf(ficgp,", '' "); |
|
l=(nlstate+ndeath)*(cpt-1) +j; |
|
fprintf(ficgp," u (($1==%d && (floor($2)%%5 == 0)) ? ($3):1/0):($%d",k1,k+l); |
|
/* for (i=2; i<= nlstate+ndeath ; i ++) */ |
|
/* fprintf(ficgp,"+$%d",k+l+i-1); */ |
|
fprintf(ficgp,") t \"l(%d,%d)\" w l",cpt,j); |
|
} /* nlstate */ |
|
fprintf(ficgp,", '' "); |
|
fprintf(ficgp," u (($1==%d && (floor($2)%%5 == 0)) ? ($3):1/0):(",k1); |
|
for (j=1; j<= nlstate ; j ++){ /* Lived in state j */ |
|
l=(nlstate+ndeath)*(cpt-1) +j; |
|
if(j < nlstate) |
|
fprintf(ficgp,"$%d +",k+l); |
|
else |
|
fprintf(ficgp,"$%d) t\"l(%d,.)\" w l",k+l,cpt); |
|
} |
|
fprintf(ficgp,"\nset out\n"); |
|
} /* end cpt state*/ |
|
} /* end covariate */ |
|
|
|
/* CV preval stable (period) for each covariate */ |
|
for (k1=1; k1<= m ; k1 ++) { /* For each covariate combination (1 to m=2**k), if any covariate is present */ |
|
for (cpt=1; cpt<=nlstate ; cpt ++) { /* For each life state */ |
|
fprintf(ficgp,"\n#\n#\n#CV preval stable (period): 'pij' files, covariatecombination#=%d state=%d",k1, cpt); |
|
for (k=1; k<=cptcoveff; k++){ /* For each covariate and each value */ |
|
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate number corresponding to k1 combination */ |
|
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
|
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
|
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
|
vlv= nbcode[Tvaraff[lv]][lv]; |
|
fprintf(ficgp," V%d=%d ",k,vlv); |
|
} |
|
fprintf(ficgp,"\n#\n"); |
|
|
|
fprintf(ficgp,"\nset out \"%s_%d-%d.svg\" \n",subdirf2(optionfilefiname,"P_"),cpt,k1); |
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \n\ |
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \n\ |
set ter png small\nset size 0.65,0.65\n\ |
set ter svg size 640, 480\n\ |
unset log y\n\ |
unset log y\n\ |
plot [%.f:%.f] \"%s\" u ($1==%d ? ($3):1/0):($%d/($%d",ageminpar,agemaxpar,subdirf2(fileres,"pij"),k1,k+cpt+1,k+1); |
plot [%.f:%.f] ", ageminpar, agemaxpar); |
|
k=3; /* Offset */ |
for (i=1; i< nlstate ; i ++) |
for (i=1; i<= nlstate ; i ++){ |
fprintf(ficgp,"+$%d",k+i+1); |
if(i==1) |
fprintf(ficgp,")) t\"prev(%d,%d)\" w l",cpt,cpt+1); |
fprintf(ficgp,"\"%s\"",subdirf2(fileresu,"PIJ_")); |
|
else |
l=3+(nlstate+ndeath)*cpt; |
fprintf(ficgp,", '' "); |
fprintf(ficgp,",\"%s\" u ($1==%d ? ($3):1/0):($%d/($%d",subdirf2(fileres,"pij"),k1,l+cpt+1,l+1); |
l=(nlstate+ndeath)*(i-1)+1; |
for (i=1; i< nlstate ; i ++) { |
fprintf(ficgp," u ($1==%d ? ($3):1/0):($%d/($%d",k1,k+l+(cpt-1),k+l); |
l=3+(nlstate+ndeath)*cpt; |
for (j=2; j<= nlstate ; j ++) |
fprintf(ficgp,"+$%d",l+i+1); |
fprintf(ficgp,"+$%d",k+l+j-1); |
|
fprintf(ficgp,")) t \"prev(%d,%d)\" w l",i,cpt); |
|
} /* nlstate */ |
|
fprintf(ficgp,"\nset out\n"); |
|
} /* end cpt state*/ |
|
} /* end covariate */ |
|
|
|
/* CV back preval stable (period) for each covariate */ |
|
for (k1=1; k1<= m ; k1 ++) { /* For each covariate combination (1 to m=2**k), if any covariate is present */ |
|
for (cpt=1; cpt<=nlstate ; cpt ++) { /* For each life state */ |
|
fprintf(ficgp,"\n#\n#\n#CV Back preval stable (period): 'pij' files, covariatecombination#=%d state=%d",k1, cpt); |
|
for (k=1; k<=cptcoveff; k++){ /* For each covariate and each value */ |
|
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate number corresponding to k1 combination */ |
|
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
|
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
|
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
|
vlv= nbcode[Tvaraff[lv]][lv]; |
|
fprintf(ficgp," V%d=%d ",k,vlv); |
} |
} |
fprintf(ficgp,")) t\"prev(%d,%d)\" w l\n",cpt+1,cpt+1); |
fprintf(ficgp,"\n#\n"); |
} |
|
} |
fprintf(ficgp,"\nset out \"%s_%d-%d.svg\" \n",subdirf2(optionfilefiname,"PB_"),cpt,k1); |
|
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Probability\" \n\ |
|
set ter svg size 640, 480\n\ |
|
unset log y\n\ |
|
plot [%.f:%.f] ", ageminpar, agemaxpar); |
|
k=3; /* Offset */ |
|
for (i=1; i<= nlstate ; i ++){ |
|
if(i==1) |
|
fprintf(ficgp,"\"%s\"",subdirf2(fileresu,"PIJB_")); |
|
else |
|
fprintf(ficgp,", '' "); |
|
l=(nlstate+ndeath)*(i-1)+1; |
|
fprintf(ficgp," u ($1==%d ? ($3):1/0):($%d/($%d",k1,k+l+(cpt-1),k+l); /* a vérifier */ |
|
for (j=2; j<= nlstate ; j ++) |
|
fprintf(ficgp,"+$%d",k+l+j-1); |
|
fprintf(ficgp,")) t \"prev(%d,%d)\" w l",i,cpt); |
|
} /* nlstate */ |
|
fprintf(ficgp,"\nset out\n"); |
|
} /* end cpt state*/ |
|
} /* end covariate */ |
|
|
|
if(prevfcast==1){ |
|
/* Projection from cross-sectional to stable (period) for each covariate */ |
|
|
|
for (k1=1; k1<= m ; k1 ++) { /* For each covariate combination (1 to m=2**k), if any covariate is present */ |
|
for (cpt=1; cpt<=nlstate ; cpt ++) { /* For each life state */ |
|
fprintf(ficgp,"\n#\n#\n#Projection of prevalence to stable (period): 'PROJ_' files, covariatecombination#=%d state=%d",k1, cpt); |
|
for (k=1; k<=cptcoveff; k++){ /* For each correspondig covariate value */ |
|
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate value corresponding to k1 combination and kth covariate */ |
|
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
|
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
|
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
|
vlv= nbcode[Tvaraff[lv]][lv]; |
|
fprintf(ficgp," V%d=%d ",k,vlv); |
|
} |
|
fprintf(ficgp,"\n#\n"); |
|
|
|
fprintf(ficgp,"# hpijx=probability over h years, hp.jx is weighted by observed prev\n "); |
|
fprintf(ficgp,"\nset out \"%s_%d-%d.svg\" \n",subdirf2(optionfilefiname,"PROJ_"),cpt,k1); |
|
fprintf(ficgp,"set xlabel \"Age\" \nset ylabel \"Prevalence\" \n\ |
|
set ter svg size 640, 480\n\ |
|
unset log y\n\ |
|
plot [%.f:%.f] ", ageminpar, agemaxpar); |
|
for (i=1; i<= nlstate+1 ; i ++){ /* nlstate +1 p11 p21 p.1 */ |
|
/*# V1 = 1 V2 = 0 yearproj age p11 p21 p.1 p12 p22 p.2 p13 p23 p.3*/ |
|
/*# 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 */ |
|
/*# yearproj age p11 p21 p.1 p12 p22 p.2 p13 p23 p.3*/ |
|
/*# 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 */ |
|
if(i==1){ |
|
fprintf(ficgp,"\"%s\"",subdirf2(fileresu,"F_")); |
|
}else{ |
|
fprintf(ficgp,",\\\n '' "); |
|
} |
|
if(cptcoveff ==0){ /* No covariate */ |
|
fprintf(ficgp," u 2:("); /* Age is in 2 */ |
|
/*# yearproj age p11 p21 p31 p.1 p12 p22 p32 p.2 p13 p23 p33 p.3 p14 p24 p34 p.4*/ |
|
/*# 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 */ |
|
if(i==nlstate+1) |
|
fprintf(ficgp," $%d/(1.-$%d)) t 'p.%d' with line ", \ |
|
2+(cpt-1)*(nlstate+1)+1+(i-1), 2+1+(i-1)+(nlstate+1)*nlstate,cpt ); |
|
else |
|
fprintf(ficgp," $%d/(1.-$%d)) t 'p%d%d' with line ", \ |
|
2+(cpt-1)*(nlstate+1)+1+(i-1), 2+1+(i-1)+(nlstate+1)*nlstate,i,cpt ); |
|
}else{ |
|
fprintf(ficgp,"u 6:(("); /* Age is in 6 */ |
|
/*# V1 = 1 V2 = 0 yearproj age p11 p21 p.1 p12 p22 p.2 p13 p23 p.3*/ |
|
/*# 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 */ |
|
kl=0; |
|
for (k=1; k<=cptcoveff; k++){ /* For each covariate */ |
|
lv= decodtabm(k1,k,cptcoveff); /* Should be the covariate value corresponding to k1 combination and kth covariate */ |
|
/* decodtabm(1,1,4) = 1 because h=1 k= (1) 1 1 1 */ |
|
/* decodtabm(1,2,4) = 1 because h=1 k= 1 (1) 1 1 */ |
|
/* decodtabm(13,3,4)= 2 because h=13 k= 1 1 (2) 2 */ |
|
vlv= nbcode[Tvaraff[lv]][lv]; |
|
kl++; |
|
/* kl=6+(cpt-1)*(nlstate+1)+1+(i-1); /\* 6+(1-1)*(2+1)+1+(1-1)=7, 6+(2-1)(2+1)+1+(1-1)=10 *\/ */ |
|
/*6+(cpt-1)*(nlstate+1)+1+(i-1)+(nlstate+1)*nlstate; 6+(1-1)*(2+1)+1+(1-1) +(2+1)*2=13 */ |
|
/*6+1+(i-1)+(nlstate+1)*nlstate; 6+1+(1-1) +(2+1)*2=13 */ |
|
/* '' u 6:(($1==1 && $2==0 && $3==2 && $4==0)? $9/(1.-$15) : 1/0):($5==2000? 3:2) t 'p.1' with line lc variable*/ |
|
if(k==cptcoveff) |
|
if(i==nlstate+1) |
|
fprintf(ficgp,"$%d==%d && $%d==%d)? $%d/(1.-$%d) : 1/0) t 'p.%d' with line ",kl, k,kl+1,nbcode[Tvaraff[lv]][lv], \ |
|
6+(cpt-1)*(nlstate+1)+1+(i-1), 6+1+(i-1)+(nlstate+1)*nlstate,cpt ); |
|
else |
|
fprintf(ficgp,"$%d==%d && $%d==%d)? $%d/(1.-$%d) : 1/0) t 'p%d%d' with line ",kl, k,kl+1,nbcode[Tvaraff[lv]][lv], \ |
|
6+(cpt-1)*(nlstate+1)+1+(i-1), 6+1+(i-1)+(nlstate+1)*nlstate,i,cpt ); |
|
else{ |
|
fprintf(ficgp,"$%d==%d && $%d==%d && ",kl, k,kl+1,nbcode[Tvaraff[lv]][lv]); |
|
kl++; |
|
} |
|
} /* end covariate */ |
|
} /* end if covariate */ |
|
} /* nlstate */ |
|
fprintf(ficgp,"\nset out\n"); |
|
} /* end cpt state*/ |
|
} /* end covariate */ |
|
} /* End if prevfcast */ |
|
|
|
|
/* proba elementaires */ |
/* proba elementaires */ |
|
fprintf(ficgp,"\n##############\n#MLE estimated parameters\n#############\n"); |
for(i=1,jk=1; i <=nlstate; i++){ |
for(i=1,jk=1; i <=nlstate; i++){ |
|
fprintf(ficgp,"# initial state %d\n",i); |
for(k=1; k <=(nlstate+ndeath); k++){ |
for(k=1; k <=(nlstate+ndeath); k++){ |
if (k != i) { |
if (k != i) { |
|
fprintf(ficgp,"# current state %d\n",k); |
for(j=1; j <=ncovmodel; j++){ |
for(j=1; j <=ncovmodel; j++){ |
fprintf(ficgp,"p%d=%f ",jk,p[jk]); |
fprintf(ficgp,"p%d=%f; ",jk,p[jk]); |
jk++; |
jk++; |
fprintf(ficgp,"\n"); |
|
} |
} |
|
fprintf(ficgp,"\n"); |
} |
} |
} |
} |
} |
} |
|
fprintf(ficgp,"##############\n#\n"); |
|
|
for(ng=1; ng<=2;ng++){ /* Number of graphics: first is probabilities second is incidence per year*/ |
/*goto avoid;*/ |
|
fprintf(ficgp,"\n##############\n#Graphics of probabilities or incidences\n#############\n"); |
|
fprintf(ficgp,"# logi(p12/p11)=a12+b12*age+c12age*age+d12*V1+e12*V1*age\n"); |
|
fprintf(ficgp,"# logi(p12/p11)=p1 +p2*age +p3*age*age+ p4*V1+ p5*V1*age\n"); |
|
fprintf(ficgp,"# logi(p13/p11)=a13+b13*age+c13age*age+d13*V1+e13*V1*age\n"); |
|
fprintf(ficgp,"# logi(p13/p11)=p6 +p7*age +p8*age*age+ p9*V1+ p10*V1*age\n"); |
|
fprintf(ficgp,"# p12+p13+p14+p11=1=p11(1+exp(a12+b12*age+c12age*age+d12*V1+e12*V1*age)\n"); |
|
fprintf(ficgp,"# +exp(a13+b13*age+c13age*age+d13*V1+e13*V1*age)+...)\n"); |
|
fprintf(ficgp,"# p11=1/(1+exp(a12+b12*age+c12age*age+d12*V1+e12*V1*age)\n"); |
|
fprintf(ficgp,"# +exp(a13+b13*age+c13age*age+d13*V1+e13*V1*age)+...)\n"); |
|
fprintf(ficgp,"# p12=exp(a12+b12*age+c12age*age+d12*V1+e12*V1*age)/\n"); |
|
fprintf(ficgp,"# (1+exp(a12+b12*age+c12age*age+d12*V1+e12*V1*age)\n"); |
|
fprintf(ficgp,"# +exp(a13+b13*age+c13age*age+d13*V1+e13*V1*age))\n"); |
|
fprintf(ficgp,"# +exp(a14+b14*age+c14age*age+d14*V1+e14*V1*age)+...)\n"); |
|
fprintf(ficgp,"#\n"); |
|
for(ng=1; ng<=3;ng++){ /* Number of graphics: first is logit, 2nd is probabilities, third is incidences per year*/ |
|
fprintf(ficgp,"# ng=%d\n",ng); |
|
fprintf(ficgp,"# jk=1 to 2^%d=%d\n",cptcoveff,m); |
for(jk=1; jk <=m; jk++) { |
for(jk=1; jk <=m; jk++) { |
fprintf(ficgp,"\nset out \"%s%d%d.png\" \n",subdirf2(optionfilefiname,"pe"),jk,ng); |
fprintf(ficgp,"# jk=%d\n",jk); |
if (ng==2) |
fprintf(ficgp,"\nset out \"%s_%d-%d.svg\" ",subdirf2(optionfilefiname,"PE_"),jk,ng); |
|
fprintf(ficgp,"\nset ter svg size 640, 480 "); |
|
if (ng==1){ |
|
fprintf(ficgp,"\nset ylabel \"Value of the logit of the model\"\n"); /* exp(a12+b12*x) could be nice */ |
|
fprintf(ficgp,"\nunset log y"); |
|
}else if (ng==2){ |
|
fprintf(ficgp,"\nset ylabel \"Probability\"\n"); |
|
fprintf(ficgp,"\nset log y"); |
|
}else if (ng==3){ |
fprintf(ficgp,"\nset ylabel \"Quasi-incidence per year\"\n"); |
fprintf(ficgp,"\nset ylabel \"Quasi-incidence per year\"\n"); |
else |
fprintf(ficgp,"\nset log y"); |
fprintf(ficgp,"\nset title \"Probability\"\n"); |
}else |
fprintf(ficgp,"\nset ter png small\nset size 0.65,0.65\nset log y\nplot [%.f:%.f] ",ageminpar,agemaxpar); |
fprintf(ficgp,"\nunset title "); |
|
fprintf(ficgp,"\nplot [%.f:%.f] ",ageminpar,agemaxpar); |
i=1; |
i=1; |
for(k2=1; k2<=nlstate; k2++) { |
for(k2=1; k2<=nlstate; k2++) { |
k3=i; |
k3=i; |
for(k=1; k<=(nlstate+ndeath); k++) { |
for(k=1; k<=(nlstate+ndeath); k++) { |
if (k != k2){ |
if (k != k2){ |
if(ng==2) |
switch( ng) { |
fprintf(ficgp," %f*exp(p%d+p%d*x",YEARM/stepm,i,i+1); |
case 1: |
else |
if(nagesqr==0) |
fprintf(ficgp," exp(p%d+p%d*x",i,i+1); |
fprintf(ficgp," p%d+p%d*x",i,i+1); |
ij=1; |
else /* nagesqr =1 */ |
for(j=3; j <=ncovmodel; j++) { |
fprintf(ficgp," p%d+p%d*x+p%d*x*x",i,i+1,i+1+nagesqr); |
if(((j-2)==Tage[ij]) &&(ij <=cptcovage)) { |
break; |
fprintf(ficgp,"+p%d*%d*x",i+j-1,nbcode[Tvar[j-2]][codtab[jk][Tvar[j-2]]]); |
case 2: /* ng=2 */ |
ij++; |
if(nagesqr==0) |
|
fprintf(ficgp," exp(p%d+p%d*x",i,i+1); |
|
else /* nagesqr =1 */ |
|
fprintf(ficgp," exp(p%d+p%d*x+p%d*x*x",i,i+1,i+1+nagesqr); |
|
break; |
|
case 3: |
|
if(nagesqr==0) |
|
fprintf(ficgp," %f*exp(p%d+p%d*x",YEARM/stepm,i,i+1); |
|
else /* nagesqr =1 */ |
|
fprintf(ficgp," %f*exp(p%d+p%d*x+p%d*x*x",YEARM/stepm,i,i+1,i+1+nagesqr); |
|
break; |
|
} |
|
ij=1;/* To be checked else nbcode[0][0] wrong */ |
|
for(j=3; j <=ncovmodel-nagesqr; j++) { |
|
/* printf("Tage[%d]=%d, j=%d\n", ij, Tage[ij], j); */ |
|
if(ij <=cptcovage) { /* Bug valgrind */ |
|
if((j-2)==Tage[ij]) { /* Bug valgrind */ |
|
fprintf(ficgp,"+p%d*%d*x",i+j+nagesqr-1,nbcode[Tvar[j-2]][codtabm(jk,j-2)]); |
|
/* fprintf(ficgp,"+p%d*%d*x",i+j+nagesqr-1,nbcode[Tvar[j-2]][codtabm(jk,Tvar[j-2])]); */ |
|
ij++; |
|
} |
} |
} |
else |
else |
fprintf(ficgp,"+p%d*%d",i+j-1,nbcode[Tvar[j-2]][codtab[jk][j-2]]); |
fprintf(ficgp,"+p%d*%d",i+j+nagesqr-1,nbcode[Tvar[j-2]][codtabm(jk,j-2)]); |
} |
} |
|
}else{ |
|
i=i-ncovmodel; |
|
if(ng !=1 ) /* For logit formula of log p11 is more difficult to get */ |
|
fprintf(ficgp," (1."); |
|
} |
|
|
|
if(ng != 1){ |
fprintf(ficgp,")/(1"); |
fprintf(ficgp,")/(1"); |
|
|
for(k1=1; k1 <=nlstate; k1++){ |
for(k1=1; k1 <=nlstate; k1++){ |
fprintf(ficgp,"+exp(p%d+p%d*x",k3+(k1-1)*ncovmodel,k3+(k1-1)*ncovmodel+1); |
if(nagesqr==0) |
|
fprintf(ficgp,"+exp(p%d+p%d*x",k3+(k1-1)*ncovmodel,k3+(k1-1)*ncovmodel+1); |
|
else /* nagesqr =1 */ |
|
fprintf(ficgp,"+exp(p%d+p%d*x+p%d*x*x",k3+(k1-1)*ncovmodel,k3+(k1-1)*ncovmodel+1,k3+(k1-1)*ncovmodel+1+nagesqr); |
|
|
ij=1; |
ij=1; |
for(j=3; j <=ncovmodel; j++){ |
for(j=3; j <=ncovmodel-nagesqr; j++){ |
if(((j-2)==Tage[ij]) &&(ij <=cptcovage)) { |
if(ij <=cptcovage) { /* Bug valgrind */ |
fprintf(ficgp,"+p%d*%d*x",k3+(k1-1)*ncovmodel+1+j-2,nbcode[Tvar[j-2]][codtab[jk][Tvar[j-2]]]); |
if((j-2)==Tage[ij]) { /* Bug valgrind */ |
ij++; |
fprintf(ficgp,"+p%d*%d*x",k3+(k1-1)*ncovmodel+1+j-2+nagesqr,nbcode[Tvar[j-2]][codtabm(jk,j-2)]); |
|
/* fprintf(ficgp,"+p%d*%d*x",k3+(k1-1)*ncovmodel+1+j-2+nagesqr,nbcode[Tvar[j-2]][codtabm(jk,Tvar[j-2])]); */ |
|
ij++; |
|
} |
} |
} |
else |
else |
fprintf(ficgp,"+p%d*%d",k3+(k1-1)*ncovmodel+1+j-2,nbcode[Tvar[j-2]][codtab[jk][j-2]]); |
fprintf(ficgp,"+p%d*%d",k3+(k1-1)*ncovmodel+1+j-2+nagesqr,nbcode[Tvar[j-2]][codtabm(jk,j-2)]); |
} |
} |
fprintf(ficgp,")"); |
fprintf(ficgp,")"); |
} |
} |
fprintf(ficgp,") t \"p%d%d\" ", k2,k); |
fprintf(ficgp,")"); |
if ((k+k2)!= (nlstate*2+ndeath)) fprintf(ficgp,","); |
if(ng ==2) |
i=i+ncovmodel; |
fprintf(ficgp," t \"p%d%d\" ", k2,k); |
|
else /* ng= 3 */ |
|
fprintf(ficgp," t \"i%d%d\" ", k2,k); |
|
}else{ /* end ng <> 1 */ |
|
if( k !=k2) /* logit p11 is hard to draw */ |
|
fprintf(ficgp," t \"logit(p%d%d)\" ", k2,k); |
} |
} |
|
if ((k+k2)!= (nlstate*2+ndeath) && ng != 1) |
|
fprintf(ficgp,","); |
|
if (ng == 1 && k!=k2 && (k+k2)!= (nlstate*2+ndeath)) |
|
fprintf(ficgp,","); |
|
i=i+ncovmodel; |
} /* end k */ |
} /* end k */ |
} /* end k2 */ |
} /* end k2 */ |
|
fprintf(ficgp,"\n set out\n"); |
} /* end jk */ |
} /* end jk */ |
} /* end ng */ |
} /* end ng */ |
|
/* avoid: */ |
fflush(ficgp); |
fflush(ficgp); |
} /* end gnuplot */ |
} /* end gnuplot */ |
|
|
Line 3488 int movingaverage(double ***probs, doubl
|
Line 6081 int movingaverage(double ***probs, doubl
|
|
|
|
|
/************** Forecasting ******************/ |
/************** Forecasting ******************/ |
prevforecast(char fileres[], double anproj1, double mproj1, double jproj1, double ageminpar, double agemax, double dateprev1, double dateprev2, int mobilav, double bage, double fage, int firstpass, int lastpass, double anproj2, double p[], int cptcoveff){ |
void prevforecast(char fileres[], double anproj1, double mproj1, double jproj1, double ageminpar, double agemax, double dateprev1, double dateprev2, int mobilav, double bage, double fage, int firstpass, int lastpass, double anproj2, double p[], int cptcoveff){ |
/* proj1, year, month, day of starting projection |
/* proj1, year, month, day of starting projection |
agemin, agemax range of age |
agemin, agemax range of age |
dateprev1 dateprev2 range of dates during which prevalence is computed |
dateprev1 dateprev2 range of dates during which prevalence is computed |
anproj2 year of en of projection (same day and month as proj1). |
anproj2 year of en of projection (same day and month as proj1). |
*/ |
*/ |
int yearp, stepsize, hstepm, nhstepm, j, k, c, cptcod, i, h, i1; |
int yearp, stepsize, hstepm, nhstepm, j, k, cptcod, i, h, i1; |
int *popage; |
|
double agec; /* generic age */ |
double agec; /* generic age */ |
double agelim, ppij, yp,yp1,yp2,jprojmean,mprojmean,anprojmean; |
double agelim, ppij, yp,yp1,yp2,jprojmean,mprojmean,anprojmean; |
double *popeffectif,*popcount; |
double *popeffectif,*popcount; |
Line 3504 prevforecast(char fileres[], double anpr
|
Line 6096 prevforecast(char fileres[], double anpr
|
char fileresf[FILENAMELENGTH]; |
char fileresf[FILENAMELENGTH]; |
|
|
agelim=AGESUP; |
agelim=AGESUP; |
|
/* Compute observed prevalence between dateprev1 and dateprev2 by counting the number of people |
|
in each health status at the date of interview (if between dateprev1 and dateprev2). |
|
We still use firstpass and lastpass as another selection. |
|
*/ |
|
/* freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx,Tvaraff,nbcode, ncodemax,mint,anint,strstart,\ */ |
|
/* firstpass, lastpass, stepm, weightopt, model); */ |
prevalence(probs, ageminpar, agemax, s, agev, nlstate, imx, Tvar, nbcode, ncodemax, mint, anint, dateprev1, dateprev2, firstpass, lastpass); |
prevalence(probs, ageminpar, agemax, s, agev, nlstate, imx, Tvar, nbcode, ncodemax, mint, anint, dateprev1, dateprev2, firstpass, lastpass); |
|
|
strcpy(fileresf,"f"); |
strcpy(fileresf,"F_"); |
strcat(fileresf,fileres); |
strcat(fileresf,fileresu); |
if((ficresf=fopen(fileresf,"w"))==NULL) { |
if((ficresf=fopen(fileresf,"w"))==NULL) { |
printf("Problem with forecast resultfile: %s\n", fileresf); |
printf("Problem with forecast resultfile: %s\n", fileresf); |
fprintf(ficlog,"Problem with forecast resultfile: %s\n", fileresf); |
fprintf(ficlog,"Problem with forecast resultfile: %s\n", fileresf); |
} |
} |
printf("Computing forecasting: result on file '%s' \n", fileresf); |
printf("Computing forecasting: result on file '%s', please wait... \n", fileresf); |
fprintf(ficlog,"Computing forecasting: result on file '%s' \n", fileresf); |
fprintf(ficlog,"Computing forecasting: result on file '%s', please wait... \n", fileresf); |
|
|
if (cptcoveff==0) ncodemax[cptcoveff]=1; |
if (cptcoveff==0) ncodemax[cptcoveff]=1; |
|
|
Line 3554 prevforecast(char fileres[], double anpr
|
Line 6152 prevforecast(char fileres[], double anpr
|
for(cptcov=1, k=0;cptcov<=i1;cptcov++){ |
for(cptcov=1, k=0;cptcov<=i1;cptcov++){ |
for(cptcod=1;cptcod<=ncodemax[cptcoveff];cptcod++){ |
for(cptcod=1;cptcod<=ncodemax[cptcoveff];cptcod++){ |
k=k+1; |
k=k+1; |
fprintf(ficresf,"\n#******"); |
fprintf(ficresf,"\n#****** hpijx=probability over h years, hp.jx is weighted by observed prev \n#"); |
for(j=1;j<=cptcoveff;j++) { |
for(j=1;j<=cptcoveff;j++) { |
fprintf(ficresf," V%d=%d, hpijx=probability over h years, hp.jx is weighted by observed prev ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
fprintf(ficresf," V%d (=) %d",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
} |
} |
fprintf(ficresf,"******\n"); |
fprintf(ficresf," yearproj age"); |
fprintf(ficresf,"# Covariate valuofcovar yearproj age"); |
|
for(j=1; j<=nlstate+ndeath;j++){ |
for(j=1; j<=nlstate+ndeath;j++){ |
for(i=1; i<=nlstate;i++) |
for(i=1; i<=nlstate;i++) |
fprintf(ficresf," p%d%d",i,j); |
fprintf(ficresf," p%d%d",i,j); |
fprintf(ficresf," p.%d",j); |
fprintf(ficresf," p.%d",j); |
} |
} |
for (yearp=0; yearp<=(anproj2-anproj1);yearp +=stepsize) { |
for (yearp=0; yearp<=(anproj2-anproj1);yearp +=stepsize) { |
fprintf(ficresf,"\n"); |
fprintf(ficresf,"\n"); |
fprintf(ficresf,"\n# Forecasting at date %.lf/%.lf/%.lf ",jproj1,mproj1,anproj1+yearp); |
fprintf(ficresf,"\n# Forecasting at date %.lf/%.lf/%.lf ",jproj1,mproj1,anproj1+yearp); |
|
|
for (agec=fage; agec>=(ageminpar-1); agec--){ |
for (agec=fage; agec>=(ageminpar-1); agec--){ |
nhstepm=(int) rint((agelim-agec)*YEARM/stepm); |
nhstepm=(int) rint((agelim-agec)*YEARM/stepm); |
nhstepm = nhstepm/hstepm; |
nhstepm = nhstepm/hstepm; |
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
oldm=oldms;savm=savms; |
oldm=oldms;savm=savms; |
hpxij(p3mat,nhstepm,agec,hstepm,p,nlstate,stepm,oldm,savm, k); |
hpxij(p3mat,nhstepm,agec,hstepm,p,nlstate,stepm,oldm,savm, k); |
|
|
for (h=0; h<=nhstepm; h++){ |
for (h=0; h<=nhstepm; h++){ |
if (h*hstepm/YEARM*stepm ==yearp) { |
if (h*hstepm/YEARM*stepm ==yearp) { |
fprintf(ficresf,"\n"); |
fprintf(ficresf,"\n"); |
for(j=1;j<=cptcoveff;j++) |
for(j=1;j<=cptcoveff;j++) |
fprintf(ficresf,"%d %d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
fprintf(ficresf,"%d %d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
fprintf(ficresf,"%.f %.f ",anproj1+yearp,agec+h*hstepm/YEARM*stepm); |
fprintf(ficresf,"%.f %.f ",anproj1+yearp,agec+h*hstepm/YEARM*stepm); |
} |
} |
for(j=1; j<=nlstate+ndeath;j++) { |
for(j=1; j<=nlstate+ndeath;j++) { |
Line 3609 prevforecast(char fileres[], double anpr
|
Line 6205 prevforecast(char fileres[], double anpr
|
if (mobilav!=0) free_ma3x(mobaverage,1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
if (mobilav!=0) free_ma3x(mobaverage,1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
|
|
fclose(ficresf); |
fclose(ficresf); |
|
printf("End of Computing forecasting \n"); |
|
fprintf(ficlog,"End of Computing forecasting\n"); |
|
|
|
} |
|
|
|
/************** Back Forecasting ******************/ |
|
void prevbackforecast(char fileres[], double anback1, double mback1, double jback1, double ageminpar, double agemax, double dateprev1, double dateprev2, int mobilav, double bage, double fage, int firstpass, int lastpass, double anback2, double p[], int cptcoveff){ |
|
/* back1, year, month, day of starting backection |
|
agemin, agemax range of age |
|
dateprev1 dateprev2 range of dates during which prevalence is computed |
|
anback2 year of en of backection (same day and month as back1). |
|
*/ |
|
int yearp, stepsize, hstepm, nhstepm, j, k, cptcod, i, h, i1; |
|
double agec; /* generic age */ |
|
double agelim, ppij, yp,yp1,yp2,jprojmean,mprojmean,anprojmean; |
|
double *popeffectif,*popcount; |
|
double ***p3mat; |
|
double ***mobaverage; |
|
char fileresfb[FILENAMELENGTH]; |
|
|
|
agelim=AGESUP; |
|
/* Compute observed prevalence between dateprev1 and dateprev2 by counting the number of people |
|
in each health status at the date of interview (if between dateprev1 and dateprev2). |
|
We still use firstpass and lastpass as another selection. |
|
*/ |
|
/* freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx,Tvaraff,nbcode, ncodemax,mint,anint,strstart,\ */ |
|
/* firstpass, lastpass, stepm, weightopt, model); */ |
|
prevalence(probs, ageminpar, agemax, s, agev, nlstate, imx, Tvar, nbcode, ncodemax, mint, anint, dateprev1, dateprev2, firstpass, lastpass); |
|
|
|
strcpy(fileresfb,"FB_"); |
|
strcat(fileresfb,fileresu); |
|
if((ficresfb=fopen(fileresfb,"w"))==NULL) { |
|
printf("Problem with back forecast resultfile: %s\n", fileresfb); |
|
fprintf(ficlog,"Problem with back forecast resultfile: %s\n", fileresfb); |
|
} |
|
printf("Computing back forecasting: result on file '%s', please wait... \n", fileresfb); |
|
fprintf(ficlog,"Computing back forecasting: result on file '%s', please wait... \n", fileresfb); |
|
|
|
if (cptcoveff==0) ncodemax[cptcoveff]=1; |
|
|
|
if (mobilav!=0) { |
|
mobaverage= ma3x(1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
|
if (movingaverage(probs, ageminpar, fage, mobaverage,mobilav)!=0){ |
|
fprintf(ficlog," Error in movingaverage mobilav=%d\n",mobilav); |
|
printf(" Error in movingaverage mobilav=%d\n",mobilav); |
|
} |
|
} |
|
|
|
stepsize=(int) (stepm+YEARM-1)/YEARM; |
|
if (stepm<=12) stepsize=1; |
|
if(estepm < stepm){ |
|
printf ("Problem %d lower than %d\n",estepm, stepm); |
|
} |
|
else hstepm=estepm; |
|
|
|
hstepm=hstepm/stepm; |
|
yp1=modf(dateintmean,&yp);/* extracts integral of datemean in yp and |
|
fractional in yp1 */ |
|
anprojmean=yp; |
|
yp2=modf((yp1*12),&yp); |
|
mprojmean=yp; |
|
yp1=modf((yp2*30.5),&yp); |
|
jprojmean=yp; |
|
if(jprojmean==0) jprojmean=1; |
|
if(mprojmean==0) jprojmean=1; |
|
|
|
i1=cptcoveff; |
|
if (cptcovn < 1){i1=1;} |
|
|
|
fprintf(ficresfb,"# Mean day of interviews %.lf/%.lf/%.lf (%.2f) between %.2f and %.2f \n",jprojmean,mprojmean,anprojmean,dateintmean,dateprev1,dateprev2); |
|
|
|
fprintf(ficresfb,"#****** Routine prevbackforecast **\n"); |
|
|
|
/* if (h==(int)(YEARM*yearp)){ */ |
|
for(cptcov=1, k=0;cptcov<=i1;cptcov++){ |
|
for(cptcod=1;cptcod<=ncodemax[cptcoveff];cptcod++){ |
|
k=k+1; |
|
fprintf(ficresfb,"\n#****** hbijx=probability over h years, hp.jx is weighted by observed prev \n#"); |
|
for(j=1;j<=cptcoveff;j++) { |
|
fprintf(ficresfb," V%d (=) %d",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
} |
|
fprintf(ficresfb," yearbproj age"); |
|
for(j=1; j<=nlstate+ndeath;j++){ |
|
for(i=1; i<=nlstate;i++) |
|
fprintf(ficresfb," p%d%d",i,j); |
|
fprintf(ficresfb," p.%d",j); |
|
} |
|
for (yearp=0; yearp>=(anback2-anback1);yearp -=stepsize) { |
|
/* for (yearp=0; yearp<=(anproj2-anproj1);yearp +=stepsize) { */ |
|
fprintf(ficresfb,"\n"); |
|
fprintf(ficresfb,"\n# Back Forecasting at date %.lf/%.lf/%.lf ",jback1,mback1,anback1+yearp); |
|
for (agec=fage; agec>=(ageminpar-1); agec--){ |
|
nhstepm=(int) rint((agelim-agec)*YEARM/stepm); |
|
nhstepm = nhstepm/hstepm; |
|
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
oldm=oldms;savm=savms; |
|
hbxij(p3mat,nhstepm,agec,hstepm,p,nlstate,stepm,oldm,savm, k); |
|
|
|
for (h=0; h<=nhstepm; h++){ |
|
if (h*hstepm/YEARM*stepm ==yearp) { |
|
fprintf(ficresfb,"\n"); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficresfb,"%d %d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
fprintf(ficresfb,"%.f %.f ",anback1+yearp,agec+h*hstepm/YEARM*stepm); |
|
} |
|
for(j=1; j<=nlstate+ndeath;j++) { |
|
ppij=0.; |
|
for(i=1; i<=nlstate;i++) { |
|
if (mobilav==1) |
|
ppij=ppij+p3mat[i][j][h]*mobaverage[(int)agec][i][cptcod]; |
|
else { |
|
ppij=ppij+p3mat[i][j][h]*probs[(int)(agec)][i][cptcod]; |
|
} |
|
if (h*hstepm/YEARM*stepm== yearp) { |
|
fprintf(ficresfb," %.3f", p3mat[i][j][h]); |
|
} |
|
} /* end i */ |
|
if (h*hstepm/YEARM*stepm==yearp) { |
|
fprintf(ficresfb," %.3f", ppij); |
|
} |
|
}/* end j */ |
|
} /* end h */ |
|
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
} /* end agec */ |
|
} /* end yearp */ |
|
} /* end cptcod */ |
|
} /* end cptcov */ |
|
|
|
if (mobilav!=0) free_ma3x(mobaverage,1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
|
|
|
fclose(ficresfb); |
|
printf("End of Computing Back forecasting \n"); |
|
fprintf(ficlog,"End of Computing Back forecasting\n"); |
|
|
} |
} |
|
|
/************** Forecasting *****not tested NB*************/ |
/************** Forecasting *****not tested NB*************/ |
populforecast(char fileres[], double anpyram,double mpyram,double jpyram,double ageminpar, double agemax,double dateprev1, double dateprev2, int mobilav, double agedeb, double fage, int popforecast, char popfile[], double anpyram1,double p[], int i2){ |
void populforecast(char fileres[], double anpyram,double mpyram,double jpyram,double ageminpar, double agemax,double dateprev1, double dateprev2, int mobilav, double agedeb, double fage, int popforecast, char popfile[], double anpyram1,double p[], int i2){ |
|
|
int cpt, stepsize, hstepm, nhstepm, j,k,c, cptcod, i,h; |
int cpt, stepsize, hstepm, nhstepm, j,k,c, cptcod, i,h; |
int *popage; |
int *popage; |
Line 3630 populforecast(char fileres[], double anp
|
Line 6360 populforecast(char fileres[], double anp
|
prevalence(probs, ageminpar, agemax, s, agev, nlstate, imx, Tvar, nbcode, ncodemax, mint, anint, dateprev1, dateprev2, firstpass, lastpass); |
prevalence(probs, ageminpar, agemax, s, agev, nlstate, imx, Tvar, nbcode, ncodemax, mint, anint, dateprev1, dateprev2, firstpass, lastpass); |
|
|
|
|
strcpy(filerespop,"pop"); |
strcpy(filerespop,"POP_"); |
strcat(filerespop,fileres); |
strcat(filerespop,fileresu); |
if((ficrespop=fopen(filerespop,"w"))==NULL) { |
if((ficrespop=fopen(filerespop,"w"))==NULL) { |
printf("Problem with forecast resultfile: %s\n", filerespop); |
printf("Problem with forecast resultfile: %s\n", filerespop); |
fprintf(ficlog,"Problem with forecast resultfile: %s\n", filerespop); |
fprintf(ficlog,"Problem with forecast resultfile: %s\n", filerespop); |
Line 3678 populforecast(char fileres[], double anp
|
Line 6408 populforecast(char fileres[], double anp
|
k=k+1; |
k=k+1; |
fprintf(ficrespop,"\n#******"); |
fprintf(ficrespop,"\n#******"); |
for(j=1;j<=cptcoveff;j++) { |
for(j=1;j<=cptcoveff;j++) { |
fprintf(ficrespop," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
fprintf(ficrespop," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
} |
} |
fprintf(ficrespop,"******\n"); |
fprintf(ficrespop,"******\n"); |
fprintf(ficrespop,"# Age"); |
fprintf(ficrespop,"# Age"); |
Line 3789 void prwizard(int ncovmodel, int nlstate
|
Line 6519 void prwizard(int ncovmodel, int nlstate
|
|
|
/* Wizard to print covariance matrix template */ |
/* Wizard to print covariance matrix template */ |
|
|
char ca[32], cb[32], cc[32]; |
char ca[32], cb[32]; |
int i,j, k, l, li, lj, lk, ll, jj, npar, itimes; |
int i,j, k, li, lj, lk, ll, jj, npar, itimes; |
int numlinepar; |
int numlinepar; |
|
|
printf("# Parameters nlstate*nlstate*ncov a12*1 + b12 * age + ...\n"); |
printf("# Parameters nlstate*nlstate*ncov a12*1 + b12 * age + ...\n"); |
Line 3910 double gompertz(double x[])
|
Line 6640 double gompertz(double x[])
|
{ |
{ |
double A,B,L=0.0,sump=0.,num=0.; |
double A,B,L=0.0,sump=0.,num=0.; |
int i,n=0; /* n is the size of the sample */ |
int i,n=0; /* n is the size of the sample */ |
|
|
for (i=0;i<=imx-1 ; i++) { |
for (i=0;i<=imx-1 ; i++) { |
sump=sump+weight[i]; |
sump=sump+weight[i]; |
sump=sump+1; |
/* sump=sump+1;*/ |
num=num+1; |
num=num+1; |
} |
} |
|
|
|
|
/* for (i=1; i<=imx; i++) |
/* for (i=0; i<=imx; i++) |
if (wav[i]>0) printf("i=%d ageex=%lf agecens=%lf agedc=%lf cens=%d %d\n" ,i,ageexmed[i],agecens[i],agedc[i],cens[i],wav[i]);*/ |
if (wav[i]>0) printf("i=%d ageex=%lf agecens=%lf agedc=%lf cens=%d %d\n" ,i,ageexmed[i],agecens[i],agedc[i],cens[i],wav[i]);*/ |
|
|
for (i=0;i<=imx-1 ; i++) |
for (i=1;i<=imx ; i++) |
{ |
{ |
if (cens[i]==1 & wav[i]>1) |
if (cens[i] == 1 && wav[i]>1) |
A=-x[1]/(x[2])* |
A=-x[1]/(x[2])*(exp(x[2]*(agecens[i]-agegomp))-exp(x[2]*(ageexmed[i]-agegomp))); |
(exp(x[2]/YEARM*(agecens[i]*12-agegomp*12))-exp(x[2]/YEARM*(ageexmed[i]*12-agegomp*12))); |
|
|
|
if (cens[i]==0 & wav[i]>1) |
|
A=-x[1]/(x[2])* |
|
(exp(x[2]/YEARM*(agedc[i]*12-agegomp*12))-exp(x[2]/YEARM*(ageexmed[i]*12-agegomp*12))) |
|
+log(x[1]/YEARM)+x[2]/YEARM*(agedc[i]*12-agegomp*12)+log(YEARM); |
|
|
|
if (wav[i]>1 & agecens[i]>15) { |
if (cens[i] == 0 && wav[i]>1) |
|
A=-x[1]/(x[2])*(exp(x[2]*(agedc[i]-agegomp))-exp(x[2]*(ageexmed[i]-agegomp))) |
|
+log(x[1]/YEARM)+x[2]*(agedc[i]-agegomp)+log(YEARM); |
|
|
|
/*if (wav[i] > 1 && agecens[i] > 15) {*/ /* ??? */ |
|
if (wav[i] > 1 ) { /* ??? */ |
L=L+A*weight[i]; |
L=L+A*weight[i]; |
/* printf("\ni=%d A=%f L=%lf x[1]=%lf x[2]=%lf ageex=%lf agecens=%lf cens=%d agedc=%lf weight=%lf\n",i,A,L,x[1],x[2],ageexmed[i]*12,agecens[i]*12,cens[i],agedc[i]*12,weight[i]);*/ |
/* printf("\ni=%d A=%f L=%lf x[1]=%lf x[2]=%lf ageex=%lf agecens=%lf cens=%d agedc=%lf weight=%lf\n",i,A,L,x[1],x[2],ageexmed[i]*12,agecens[i]*12,cens[i],agedc[i]*12,weight[i]);*/ |
} |
} |
Line 3942 double gompertz(double x[])
|
Line 6672 double gompertz(double x[])
|
return -2*L*num/sump; |
return -2*L*num/sump; |
} |
} |
|
|
|
#ifdef GSL |
|
/******************* Gompertz_f Likelihood ******************************/ |
|
double gompertz_f(const gsl_vector *v, void *params) |
|
{ |
|
double A,B,LL=0.0,sump=0.,num=0.; |
|
double *x= (double *) v->data; |
|
int i,n=0; /* n is the size of the sample */ |
|
|
|
for (i=0;i<=imx-1 ; i++) { |
|
sump=sump+weight[i]; |
|
/* sump=sump+1;*/ |
|
num=num+1; |
|
} |
|
|
|
|
|
/* for (i=0; i<=imx; i++) |
|
if (wav[i]>0) printf("i=%d ageex=%lf agecens=%lf agedc=%lf cens=%d %d\n" ,i,ageexmed[i],agecens[i],agedc[i],cens[i],wav[i]);*/ |
|
printf("x[0]=%lf x[1]=%lf\n",x[0],x[1]); |
|
for (i=1;i<=imx ; i++) |
|
{ |
|
if (cens[i] == 1 && wav[i]>1) |
|
A=-x[0]/(x[1])*(exp(x[1]*(agecens[i]-agegomp))-exp(x[1]*(ageexmed[i]-agegomp))); |
|
|
|
if (cens[i] == 0 && wav[i]>1) |
|
A=-x[0]/(x[1])*(exp(x[1]*(agedc[i]-agegomp))-exp(x[1]*(ageexmed[i]-agegomp))) |
|
+log(x[0]/YEARM)+x[1]*(agedc[i]-agegomp)+log(YEARM); |
|
|
|
/*if (wav[i] > 1 && agecens[i] > 15) {*/ /* ??? */ |
|
if (wav[i] > 1 ) { /* ??? */ |
|
LL=LL+A*weight[i]; |
|
/* printf("\ni=%d A=%f L=%lf x[1]=%lf x[2]=%lf ageex=%lf agecens=%lf cens=%d agedc=%lf weight=%lf\n",i,A,L,x[1],x[2],ageexmed[i]*12,agecens[i]*12,cens[i],agedc[i]*12,weight[i]);*/ |
|
} |
|
} |
|
|
|
/*printf("x1=%2.9f x2=%2.9f x3=%2.9f L=%f\n",x[1],x[2],x[3],L);*/ |
|
printf("x[0]=%lf x[1]=%lf -2*LL*num/sump=%lf\n",x[0],x[1],-2*LL*num/sump); |
|
|
|
return -2*LL*num/sump; |
|
} |
|
#endif |
|
|
/******************* Printing html file ***********/ |
/******************* Printing html file ***********/ |
void printinghtmlmort(char fileres[], char title[], char datafile[], int firstpass, \ |
void printinghtmlmort(char fileresu[], char title[], char datafile[], int firstpass, \ |
int lastpass, int stepm, int weightopt, char model[],\ |
int lastpass, int stepm, int weightopt, char model[],\ |
int imx, double p[],double **matcov){ |
int imx, double p[],double **matcov,double agemortsup){ |
int i; |
int i,k; |
|
|
fprintf(fichtm,"<ul><li><h4>Result files </h4>\n Force of mortality. Parameters of the Gompertz fit (with confidence interval in brackets):<br>"); |
fprintf(fichtm,"<ul><li><h4>Result files </h4>\n Force of mortality. Parameters of the Gompertz fit (with confidence interval in brackets):<br>"); |
fprintf(fichtm," mu(age) =%lf*exp(%lf*(age-%d)) per year<br><br>",p[1],p[2],agegomp); |
fprintf(fichtm," mu(age) =%lf*exp(%lf*(age-%d)) per year<br><br>",p[1],p[2],agegomp); |
for (i=1;i<=2;i++) |
for (i=1;i<=2;i++) |
fprintf(fichtm," p[%d] = %lf [%f ; %f]<br>\n",i,p[i],p[i]-2*sqrt(matcov[i][i]),p[i]+2*sqrt(matcov[i][i])); |
fprintf(fichtm," p[%d] = %lf [%f ; %f]<br>\n",i,p[i],p[i]-2*sqrt(matcov[i][i]),p[i]+2*sqrt(matcov[i][i])); |
fprintf(fichtm,"<br><br><img src=\"graphmort.png\">"); |
fprintf(fichtm,"<br><br><img src=\"graphmort.svg\">"); |
fprintf(fichtm,"</ul>"); |
fprintf(fichtm,"</ul>"); |
|
|
|
fprintf(fichtm,"<ul><li><h4>Life table</h4>\n <br>"); |
|
|
|
fprintf(fichtm,"\nAge l<inf>x</inf> q<inf>x</inf> d(x,x+1) L<inf>x</inf> T<inf>x</inf> e<infx</inf><br>"); |
|
|
|
for (k=agegomp;k<(agemortsup-2);k++) |
|
fprintf(fichtm,"%d %.0lf %lf %.0lf %.0lf %.0lf %lf<br>\n",k,lsurv[k],p[1]*exp(p[2]*(k-agegomp)),(p[1]*exp(p[2]*(k-agegomp)))*lsurv[k],lpop[k],tpop[k],tpop[k]/lsurv[k]); |
|
|
|
|
fflush(fichtm); |
fflush(fichtm); |
} |
} |
|
|
/******************* Gnuplot file **************/ |
/******************* Gnuplot file **************/ |
void printinggnuplotmort(char fileres[], char optionfilefiname[], double ageminpar, double agemaxpar, double fage , char pathc[], double p[]){ |
void printinggnuplotmort(char fileresu[], char optionfilefiname[], double ageminpar, double agemaxpar, double fage , char pathc[], double p[]){ |
|
|
char dirfileres[132],optfileres[132]; |
char dirfileres[132],optfileres[132]; |
int m,cpt,k1,i,k,j,jk,k2,k3,ij,l; |
|
int ng; |
int ng; |
|
|
|
|
Line 3972 void printinggnuplotmort(char fileres[],
|
Line 6752 void printinggnuplotmort(char fileres[],
|
|
|
strcpy(dirfileres,optionfilefiname); |
strcpy(dirfileres,optionfilefiname); |
strcpy(optfileres,"vpl"); |
strcpy(optfileres,"vpl"); |
fprintf(ficgp,"set out \"graphmort.png\"\n "); |
fprintf(ficgp,"set out \"graphmort.svg\"\n "); |
fprintf(ficgp,"set xlabel \"Age\"\n set ylabel \"Force of mortality (per year)\" \n "); |
fprintf(ficgp,"set xlabel \"Age\"\n set ylabel \"Force of mortality (per year)\" \n "); |
fprintf(ficgp, "set ter png small\n set log y\n"); |
fprintf(ficgp, "set ter svg size 640, 480\n set log y\n"); |
fprintf(ficgp, "set size 0.65,0.65\n"); |
/* fprintf(ficgp, "set size 0.65,0.65\n"); */ |
fprintf(ficgp,"plot [%d:100] %lf*exp(%lf*(x-%d))",agegomp,p[1],p[2],agegomp); |
fprintf(ficgp,"plot [%d:100] %lf*exp(%lf*(x-%d))",agegomp,p[1],p[2],agegomp); |
|
|
} |
} |
|
|
|
int readdata(char datafile[], int firstobs, int lastobs, int *imax) |
|
{ |
|
|
|
/*-------- data file ----------*/ |
|
FILE *fic; |
|
char dummy[]=" "; |
|
int i=0, j=0, n=0; |
|
int linei, month, year,iout; |
|
char line[MAXLINE], linetmp[MAXLINE]; |
|
char stra[MAXLINE], strb[MAXLINE]; |
|
char *stratrunc; |
|
int lstra; |
|
|
|
|
|
if((fic=fopen(datafile,"r"))==NULL) { |
|
printf("Problem while opening datafile: %s\n", datafile);fflush(stdout); |
|
fprintf(ficlog,"Problem while opening datafile: %s\n", datafile);fflush(ficlog);return 1; |
|
} |
|
|
|
i=1; |
|
linei=0; |
|
while ((fgets(line, MAXLINE, fic) != NULL) &&((i >= firstobs) && (i <=lastobs))) { |
|
linei=linei+1; |
|
for(j=strlen(line); j>=0;j--){ /* Untabifies line */ |
|
if(line[j] == '\t') |
|
line[j] = ' '; |
|
} |
|
for(j=strlen(line)-1; (line[j]==' ')||(line[j]==10)||(line[j]==13);j--){ |
|
; |
|
}; |
|
line[j+1]=0; /* Trims blanks at end of line */ |
|
if(line[0]=='#'){ |
|
fprintf(ficlog,"Comment line\n%s\n",line); |
|
printf("Comment line\n%s\n",line); |
|
continue; |
|
} |
|
trimbb(linetmp,line); /* Trims multiple blanks in line */ |
|
strcpy(line, linetmp); |
|
|
|
|
|
for (j=maxwav;j>=1;j--){ |
|
cutv(stra, strb, line, ' '); |
|
if(strb[0]=='.') { /* Missing status */ |
|
lval=-1; |
|
}else{ |
|
errno=0; |
|
lval=strtol(strb,&endptr,10); |
|
/* if (errno == ERANGE && (lval == LONG_MAX || lval == LONG_MIN))*/ |
|
if( strb[0]=='\0' || (*endptr != '\0')){ |
|
printf("Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a status of wave %d. Setting maxwav=%d might be wrong. Exiting.\n", strb, linei,i,line,j,maxwav); |
|
fprintf(ficlog,"Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a status of wave %d. Setting maxwav=%d might be wrong. Exiting.\n", strb, linei,i,line,j,maxwav);fflush(ficlog); |
|
return 1; |
|
} |
|
} |
|
s[j][i]=lval; |
|
|
|
strcpy(line,stra); |
|
cutv(stra, strb,line,' '); |
|
if( (iout=sscanf(strb,"%d/%d",&month, &year)) != 0){ |
|
} |
|
else if( (iout=sscanf(strb,"%s.",dummy)) != 0){ |
|
month=99; |
|
year=9999; |
|
}else{ |
|
printf("Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a date of interview (mm/yyyy or .) at wave %d. Exiting.\n",strb, linei,i, line,j); |
|
fprintf(ficlog,"Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a date of interview (mm/yyyy or .) at wave %d. Exiting.\n",strb, linei,i, line,j);fflush(ficlog); |
|
return 1; |
|
} |
|
anint[j][i]= (double) year; |
|
mint[j][i]= (double)month; |
|
strcpy(line,stra); |
|
} /* ENd Waves */ |
|
|
|
cutv(stra, strb,line,' '); |
|
if( (iout=sscanf(strb,"%d/%d",&month, &year)) != 0){ |
|
} |
|
else if( (iout=sscanf(strb,"%s.",dummy)) != 0){ |
|
month=99; |
|
year=9999; |
|
}else{ |
|
printf("Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a date of death (mm/yyyy or .). Exiting.\n",strb, linei,i,line); |
|
fprintf(ficlog,"Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a date of death (mm/yyyy or .). Exiting.\n",strb, linei,i,line);fflush(ficlog); |
|
return 1; |
|
} |
|
andc[i]=(double) year; |
|
moisdc[i]=(double) month; |
|
strcpy(line,stra); |
|
|
|
cutv(stra, strb,line,' '); |
|
if( (iout=sscanf(strb,"%d/%d",&month, &year)) != 0){ |
|
} |
|
else if( (iout=sscanf(strb,"%s.", dummy)) != 0){ |
|
month=99; |
|
year=9999; |
|
}else{ |
|
printf("Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a date of birth (mm/yyyy or .). Exiting.\n",strb, linei,i,line); |
|
fprintf(ficlog,"Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a date of birth (mm/yyyy or .). Exiting.\n",strb, linei,i,line);fflush(ficlog); |
|
return 1; |
|
} |
|
if (year==9999) { |
|
printf("Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a date of birth (mm/yyyy) but at least the year of birth should be given. Exiting.\n",strb, linei,i,line); |
|
fprintf(ficlog,"Error reading data around '%s' at line number %d for individual %d, '%s'\nShould be a date of birth (mm/yyyy) but at least the year of birth should be given. Exiting.\n",strb, linei,i,line);fflush(ficlog); |
|
return 1; |
|
|
|
} |
|
annais[i]=(double)(year); |
|
moisnais[i]=(double)(month); |
|
strcpy(line,stra); |
|
|
|
cutv(stra, strb,line,' '); |
|
errno=0; |
|
dval=strtod(strb,&endptr); |
|
if( strb[0]=='\0' || (*endptr != '\0')){ |
|
printf("Error reading data around '%f' at line number %d, \"%s\" for individual %d\nShould be a weight. Exiting.\n",dval, i,line,linei); |
|
fprintf(ficlog,"Error reading data around '%f' at line number %d, \"%s\" for individual %d\nShould be a weight. Exiting.\n",dval, i,line,linei); |
|
fflush(ficlog); |
|
return 1; |
|
} |
|
weight[i]=dval; |
|
strcpy(line,stra); |
|
|
|
for (j=ncovcol;j>=1;j--){ |
|
cutv(stra, strb,line,' '); |
|
if(strb[0]=='.') { /* Missing status */ |
|
lval=-1; |
|
}else{ |
|
errno=0; |
|
lval=strtol(strb,&endptr,10); |
|
if( strb[0]=='\0' || (*endptr != '\0')){ |
|
printf("Error reading data around '%ld' at line number %d for individual %d, '%s'\nShould be a covariate value (=0 for the reference or 1 for alternative). Exiting.\n",lval, linei,i, line); |
|
fprintf(ficlog,"Error reading data around '%ld' at line number %d for individual %d, '%s'\nShould be a covariate value (=0 for the reference or 1 for alternative). Exiting.\n",lval, linei,i, line);fflush(ficlog); |
|
return 1; |
|
} |
|
} |
|
if(lval <-1 || lval >1){ |
|
printf("Error reading data around '%ld' at line number %d for individual %d, '%s'\n \ |
|
Should be a value of %d(nth) covariate (0 should be the value for the reference and 1\n \ |
|
for the alternative. IMaCh does not build design variables automatically, do it yourself.\n \ |
|
For example, for multinomial values like 1, 2 and 3,\n \ |
|
build V1=0 V2=0 for the reference value (1),\n \ |
|
V1=1 V2=0 for (2) \n \ |
|
and V1=0 V2=1 for (3). V1=1 V2=1 should not exist and the corresponding\n \ |
|
output of IMaCh is often meaningless.\n \ |
|
Exiting.\n",lval,linei, i,line,j); |
|
fprintf(ficlog,"Error reading data around '%ld' at line number %d for individual %d, '%s'\n \ |
|
Should be a value of %d(nth) covariate (0 should be the value for the reference and 1\n \ |
|
for the alternative. IMaCh does not build design variables automatically, do it yourself.\n \ |
|
For example, for multinomial values like 1, 2 and 3,\n \ |
|
build V1=0 V2=0 for the reference value (1),\n \ |
|
V1=1 V2=0 for (2) \n \ |
|
and V1=0 V2=1 for (3). V1=1 V2=1 should not exist and the corresponding\n \ |
|
output of IMaCh is often meaningless.\n \ |
|
Exiting.\n",lval,linei, i,line,j);fflush(ficlog); |
|
return 1; |
|
} |
|
covar[j][i]=(double)(lval); |
|
strcpy(line,stra); |
|
} |
|
lstra=strlen(stra); |
|
|
|
if(lstra > 9){ /* More than 2**32 or max of what printf can write with %ld */ |
|
stratrunc = &(stra[lstra-9]); |
|
num[i]=atol(stratrunc); |
|
} |
|
else |
|
num[i]=atol(stra); |
|
/*if((s[2][i]==2) && (s[3][i]==-1)&&(s[4][i]==9)){ |
|
printf("%ld %.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;}*/ |
|
|
|
i=i+1; |
|
} /* End loop reading data */ |
|
|
|
*imax=i-1; /* Number of individuals */ |
|
fclose(fic); |
|
|
|
return (0); |
|
/* endread: */ |
|
printf("Exiting readdata: "); |
|
fclose(fic); |
|
return (1); |
|
|
|
|
|
|
|
} |
|
void removespace(char *str) { |
|
char *p1 = str, *p2 = str; |
|
do |
|
while (*p2 == ' ') |
|
p2++; |
|
while (*p1++ == *p2++); |
|
} |
|
|
|
int decodemodel ( char model[], int lastobs) /**< This routine decode the model and returns: |
|
* Model V1+V2+V3+V8+V7*V8+V5*V6+V8*age+V3*age+age*age |
|
* - nagesqr = 1 if age*age in the model, otherwise 0. |
|
* - cptcovt total number of covariates of the model nbocc(+)+1 = 8 excepting constant and age and age*age |
|
* - cptcovn or number of covariates k of the models excluding age*products =6 and age*age |
|
* - cptcovage number of covariates with age*products =2 |
|
* - cptcovs number of simple covariates |
|
* - Tvar[k] is the id of the kth covariate Tvar[1]@12 {1, 2, 3, 8, 10, 11, 8, 3, 7, 8, 5, 6}, thus Tvar[5=V7*V8]=10 |
|
* which is a new column after the 9 (ncovcol) variables. |
|
* - if k is a product Vn*Vm covar[k][i] is filled with correct values for each individual |
|
* - Tprod[l] gives the kth covariates of the product Vn*Vm l=1 to cptcovprod-cptcovage |
|
* Tprod[1]@2 {5, 6}: position of first product V7*V8 is 5, and second V5*V6 is 6. |
|
* - Tvard[k] p Tvard[1][1]@4 {7, 8, 5, 6} for V7*V8 and V5*V6 . |
|
*/ |
|
{ |
|
int i, j, k, ks; |
|
int j1, k1, k2; |
|
char modelsav[80]; |
|
char stra[80], strb[80], strc[80], strd[80],stre[80]; |
|
char *strpt; |
|
|
|
/*removespace(model);*/ |
|
if (strlen(model) >1){ /* If there is at least 1 covariate */ |
|
j=0, j1=0, k1=0, k2=-1, ks=0, cptcovn=0; |
|
if (strstr(model,"AGE") !=0){ |
|
printf("Error. AGE must be in lower case 'age' model=1+age+%s. ",model); |
|
fprintf(ficlog,"Error. AGE must be in lower case model=1+age+%s. ",model);fflush(ficlog); |
|
return 1; |
|
} |
|
if (strstr(model,"v") !=0){ |
|
printf("Error. 'v' must be in upper case 'V' model=%s ",model); |
|
fprintf(ficlog,"Error. 'v' must be in upper case model=%s ",model);fflush(ficlog); |
|
return 1; |
|
} |
|
strcpy(modelsav,model); |
|
if ((strpt=strstr(model,"age*age")) !=0){ |
|
printf(" strpt=%s, model=%s\n",strpt, model); |
|
if(strpt != model){ |
|
printf("Error in model: 'model=%s'; 'age*age' should in first place before other covariates\n \ |
|
'model=1+age+age*age+V1.' or 'model=1+age+age*age+V1+V1*age.', please swap as well as \n \ |
|
corresponding column of parameters.\n",model); |
|
fprintf(ficlog,"Error in model: 'model=%s'; 'age*age' should in first place before other covariates\n \ |
|
'model=1+age+age*age+V1.' or 'model=1+age+age*age+V1+V1*age.', please swap as well as \n \ |
|
corresponding column of parameters.\n",model); fflush(ficlog); |
|
return 1; |
|
} |
|
|
|
nagesqr=1; |
|
if (strstr(model,"+age*age") !=0) |
|
substrchaine(modelsav, model, "+age*age"); |
|
else if (strstr(model,"age*age+") !=0) |
|
substrchaine(modelsav, model, "age*age+"); |
|
else |
|
substrchaine(modelsav, model, "age*age"); |
|
}else |
|
nagesqr=0; |
|
if (strlen(modelsav) >1){ |
|
j=nbocc(modelsav,'+'); /**< j=Number of '+' */ |
|
j1=nbocc(modelsav,'*'); /**< j1=Number of '*' */ |
|
cptcovs=j+1-j1; /**< Number of simple covariates V1+V1*age+V3 +V3*V4+age*age=> V1 + V3 =2 */ |
|
cptcovt= j+1; /* Number of total covariates in the model, not including |
|
* cst, age and age*age |
|
* V1+V1*age+ V3 + V3*V4+age*age=> 4*/ |
|
/* including age products which are counted in cptcovage. |
|
* but the covariates which are products must be treated |
|
* separately: ncovn=4- 2=2 (V1+V3). */ |
|
cptcovprod=j1; /**< Number of products V1*V2 +v3*age = 2 */ |
|
cptcovprodnoage=0; /**< Number of covariate products without age: V3*V4 =1 */ |
|
|
|
|
|
/* Design |
|
* V1 V2 V3 V4 V5 V6 V7 V8 V9 Weight |
|
* < ncovcol=8 > |
|
* Model V2 + V1 + V3*age + V3 + V5*V6 + V7*V8 + V8*age + V8 |
|
* k= 1 2 3 4 5 6 7 8 |
|
* cptcovn number of covariates (not including constant and age ) = # of + plus 1 = 7+1=8 |
|
* covar[k,i], value of kth covariate if not including age for individual i: |
|
* covar[1][i]= (V2), covar[4][i]=(V3), covar[8][i]=(V8) |
|
* Tvar[k] # of the kth covariate: Tvar[1]=2 Tvar[4]=3 Tvar[8]=8 |
|
* if multiplied by age: V3*age Tvar[3=V3*age]=3 (V3) Tvar[7]=8 and |
|
* Tage[++cptcovage]=k |
|
* if products, new covar are created after ncovcol with k1 |
|
* Tvar[k]=ncovcol+k1; # of the kth covariate product: Tvar[5]=ncovcol+1=10 Tvar[6]=ncovcol+1=11 |
|
* Tprod[k1]=k; Tprod[1]=5 Tprod[2]= 6; gives the position of the k1th product |
|
* Tvard[k1][1]=m Tvard[k1][2]=m; Tvard[1][1]=5 (V5) Tvard[1][2]=6 Tvard[2][1]=7 (V7) Tvard[2][2]=8 |
|
* Tvar[cptcovn+k2]=Tvard[k1][1];Tvar[cptcovn+k2+1]=Tvard[k1][2]; |
|
* Tvar[8+1]=5;Tvar[8+2]=6;Tvar[8+3]=7;Tvar[8+4]=8 inverted |
|
* V1 V2 V3 V4 V5 V6 V7 V8 V9 V10 V11 |
|
* < ncovcol=8 > |
|
* Model V2 + V1 + V3*age + V3 + V5*V6 + V7*V8 + V8*age + V8 d1 d1 d2 d2 |
|
* k= 1 2 3 4 5 6 7 8 9 10 11 12 |
|
* Tvar[k]= 2 1 3 3 10 11 8 8 5 6 7 8 |
|
* p Tvar[1]@12={2, 1, 3, 3, 11, 10, 8, 8, 7, 8, 5, 6} |
|
* p Tprod[1]@2={ 6, 5} |
|
*p Tvard[1][1]@4= {7, 8, 5, 6} |
|
* covar[k][i]= V2 V1 ? V3 V5*V6? V7*V8? ? V8 |
|
* cov[Tage[kk]+2]=covar[Tvar[Tage[kk]]][i]*cov[2]; |
|
*How to reorganize? |
|
* Model V1 + V2 + V3 + V8 + V5*V6 + V7*V8 + V3*age + V8*age |
|
* Tvars {2, 1, 3, 3, 11, 10, 8, 8, 7, 8, 5, 6} |
|
* {2, 1, 4, 8, 5, 6, 3, 7} |
|
* Struct [] |
|
*/ |
|
|
|
/* This loop fills the array Tvar from the string 'model'.*/ |
|
/* j is the number of + signs in the model V1+V2+V3 j=2 i=3 to 1 */ |
|
/* modelsav=V2+V1+V4+age*V3 strb=age*V3 stra=V2+V1+V4 */ |
|
/* k=4 (age*V3) Tvar[k=4]= 3 (from V3) Tage[cptcovage=1]=4 */ |
|
/* k=3 V4 Tvar[k=3]= 4 (from V4) */ |
|
/* k=2 V1 Tvar[k=2]= 1 (from V1) */ |
|
/* k=1 Tvar[1]=2 (from V2) */ |
|
/* k=5 Tvar[5] */ |
|
/* for (k=1; k<=cptcovn;k++) { */ |
|
/* cov[2+k]=nbcode[Tvar[k]][codtabm(ij,Tvar[k])]; */ |
|
/* } */ |
|
/* for (k=1; k<=cptcovage;k++) cov[2+Tage[k]]=nbcode[Tvar[Tage[k]]][codtabm(ij,Tvar[Tage[k])]]*cov[2]; */ |
|
/* |
|
* Treating invertedly V2+V1+V3*age+V2*V4 is as if written V2*V4 +V3*age + V1 + V2 */ |
|
for(k=cptcovt; k>=1;k--) /**< Number of covariates */ |
|
Tvar[k]=0; |
|
cptcovage=0; |
|
for(k=1; k<=cptcovt;k++){ /* Loop on total covariates of the model */ |
|
cutl(stra,strb,modelsav,'+'); /* keeps in strb after the first '+' |
|
modelsav==V2+V1+V4+V3*age strb=V3*age stra=V2+V1+V4 */ |
|
if (nbocc(modelsav,'+')==0) strcpy(strb,modelsav); /* and analyzes it */ |
|
/* printf("i=%d a=%s b=%s sav=%s\n",i, stra,strb,modelsav);*/ |
|
/*scanf("%d",i);*/ |
|
if (strchr(strb,'*')) { /**< Model includes a product V2+V1+V4+V3*age strb=V3*age */ |
|
cutl(strc,strd,strb,'*'); /**< strd*strc Vm*Vn: strb=V3*age(input) strc=age strd=V3 ; V3*V2 strc=V2, strd=V3 */ |
|
if (strcmp(strc,"age")==0) { /**< Model includes age: Vn*age */ |
|
/* covar is not filled and then is empty */ |
|
cptcovprod--; |
|
cutl(stre,strb,strd,'V'); /* strd=V3(input): stre="3" */ |
|
Tvar[k]=atoi(stre); /* V2+V1+V4+V3*age Tvar[4]=3 ; V1+V2*age Tvar[2]=2; V1+V1*age Tvar[2]=1 */ |
|
cptcovage++; /* Sums the number of covariates which include age as a product */ |
|
Tage[cptcovage]=k; /* Tvar[4]=3, Tage[1] = 4 or V1+V1*age Tvar[2]=1, Tage[1]=2 */ |
|
/*printf("stre=%s ", stre);*/ |
|
} else if (strcmp(strd,"age")==0) { /* or age*Vn */ |
|
cptcovprod--; |
|
cutl(stre,strb,strc,'V'); |
|
Tvar[k]=atoi(stre); |
|
cptcovage++; |
|
Tage[cptcovage]=k; |
|
} else { /* Age is not in the model product V2+V1+V1*V4+V3*age+V3*V2 strb=V3*V2*/ |
|
/* loops on k1=1 (V3*V2) and k1=2 V4*V3 */ |
|
cptcovn++; |
|
cptcovprodnoage++;k1++; |
|
cutl(stre,strb,strc,'V'); /* strc= Vn, stre is n; strb=V3*V2 stre=3 strc=*/ |
|
Tvar[k]=ncovcol+k1; /* For model-covariate k tells which data-covariate to use but |
|
because this model-covariate is a construction we invent a new column |
|
ncovcol + k1 |
|
If already ncovcol=4 and model=V2+V1+V1*V4+age*V3+V3*V2 |
|
Tvar[3=V1*V4]=4+1 Tvar[5=V3*V2]=4 + 2= 6, etc */ |
|
cutl(strc,strb,strd,'V'); /* strd was Vm, strc is m */ |
|
Tprod[k1]=k; /* Tprod[1]=3(=V1*V4) for V2+V1+V1*V4+age*V3+V3*V2 */ |
|
Tvard[k1][1] =atoi(strc); /* m 1 for V1*/ |
|
Tvard[k1][2] =atoi(stre); /* n 4 for V4*/ |
|
k2=k2+2; |
|
Tvar[cptcovt+k2]=Tvard[k1][1]; /* Tvar[(cptcovt=4+k2=1)=5]= 1 (V1) */ |
|
Tvar[cptcovt+k2+1]=Tvard[k1][2]; /* Tvar[(cptcovt=4+(k2=1)+1)=6]= 4 (V4) */ |
|
for (i=1; i<=lastobs;i++){ |
|
/* Computes the new covariate which is a product of |
|
covar[n][i]* covar[m][i] and stores it at ncovol+k1 May not be defined */ |
|
covar[ncovcol+k1][i]=covar[atoi(stre)][i]*covar[atoi(strc)][i]; |
|
} |
|
} /* End age is not in the model */ |
|
} /* End if model includes a product */ |
|
else { /* no more sum */ |
|
/*printf("d=%s c=%s b=%s\n", strd,strc,strb);*/ |
|
/* scanf("%d",i);*/ |
|
cutl(strd,strc,strb,'V'); |
|
ks++; /**< Number of simple covariates */ |
|
cptcovn++; |
|
Tvar[k]=atoi(strd); |
|
} |
|
strcpy(modelsav,stra); /* modelsav=V2+V1+V4 stra=V2+V1+V4 */ |
|
/*printf("a=%s b=%s sav=%s\n", stra,strb,modelsav); |
|
scanf("%d",i);*/ |
|
} /* end of loop + on total covariates */ |
|
} /* end if strlen(modelsave == 0) age*age might exist */ |
|
} /* end if strlen(model == 0) */ |
|
|
|
/*The number n of Vn is stored in Tvar. cptcovage =number of age covariate. Tage gives the position of age. cptcovprod= number of products. |
|
If model=V1+V1*age then Tvar[1]=1 Tvar[2]=1 cptcovage=1 Tage[1]=2 cptcovprod=0*/ |
|
|
|
/* printf("tvar1=%d tvar2=%d tvar3=%d cptcovage=%d Tage=%d",Tvar[1],Tvar[2],Tvar[3],cptcovage,Tage[1]); |
|
printf("cptcovprod=%d ", cptcovprod); |
|
fprintf(ficlog,"cptcovprod=%d ", cptcovprod); |
|
|
|
scanf("%d ",i);*/ |
|
|
|
|
|
return (0); /* with covar[new additional covariate if product] and Tage if age */ |
|
/*endread:*/ |
|
printf("Exiting decodemodel: "); |
|
return (1); |
|
} |
|
|
|
int calandcheckages(int imx, int maxwav, double *agemin, double *agemax, int *nberr, int *nbwarn ) |
|
{ |
|
int i, m; |
|
|
|
for (i=1; i<=imx; i++) { |
|
for(m=2; (m<= maxwav); m++) { |
|
if (((int)mint[m][i]== 99) && (s[m][i] <= nlstate)){ |
|
anint[m][i]=9999; |
|
if (s[m][i] != -2) /* Keeping initial status of unknown vital status */ |
|
s[m][i]=-1; |
|
} |
|
if((int)moisdc[i]==99 && (int)andc[i]==9999 && s[m][i]>nlstate){ |
|
*nberr = *nberr + 1; |
|
printf("Error! Date of death (month %2d and year %4d) of individual %ld on line %d was unknown, you must set an arbitrary year of death or he/she is skipped and results are biased (%d)\n",(int)moisdc[i],(int)andc[i],num[i],i, *nberr); |
|
fprintf(ficlog,"Error! Date of death (month %2d and year %4d) of individual %ld on line %d was unknown, you must set an arbitrary year of death or he/she is skipped and results are biased (%d)\n",(int)moisdc[i],(int)andc[i],num[i],i, *nberr); |
|
s[m][i]=-1; |
|
} |
|
if((int)moisdc[i]==99 && (int)andc[i]!=9999 && s[m][i]>nlstate){ |
|
(*nberr)++; |
|
printf("Error! Month of death of individual %ld on line %d was unknown %2d, you should set it otherwise the information on the death is skipped and results are biased.\n",num[i],i,(int)moisdc[i]); |
|
fprintf(ficlog,"Error! Month of death of individual %ld on line %d was unknown %f, you should set it otherwise the information on the death is skipped and results are biased.\n",num[i],i,moisdc[i]); |
|
s[m][i]=-1; /* We prefer to skip it (and to skip it in version 0.8a1 too */ |
|
} |
|
} |
|
} |
|
|
|
for (i=1; i<=imx; i++) { |
|
agedc[i]=(moisdc[i]/12.+andc[i])-(moisnais[i]/12.+annais[i]); |
|
for(m=firstpass; (m<= lastpass); m++){ |
|
if(s[m][i] >0 || s[m][i]==-1 || s[m][i]==-2 || s[m][i]==-4 || s[m][i]==-5){ /* What if s[m][i]=-1 */ |
|
if (s[m][i] >= nlstate+1) { |
|
if(agedc[i]>0){ |
|
if((int)moisdc[i]!=99 && (int)andc[i]!=9999){ |
|
agev[m][i]=agedc[i]; |
|
/*if(moisdc[i]==99 && andc[i]==9999) s[m][i]=-1;*/ |
|
}else { |
|
if ((int)andc[i]!=9999){ |
|
nbwarn++; |
|
printf("Warning negative age at death: %ld line:%d\n",num[i],i); |
|
fprintf(ficlog,"Warning negative age at death: %ld line:%d\n",num[i],i); |
|
agev[m][i]=-1; |
|
} |
|
} |
|
} /* agedc > 0 */ |
|
} /* end if */ |
|
else if(s[m][i] !=9){ /* Standard case, age in fractional |
|
years but with the precision of a month */ |
|
agev[m][i]=(mint[m][i]/12.+1./24.+anint[m][i])-(moisnais[i]/12.+1./24.+annais[i]); |
|
if((int)mint[m][i]==99 || (int)anint[m][i]==9999) |
|
agev[m][i]=1; |
|
else if(agev[m][i] < *agemin){ |
|
*agemin=agev[m][i]; |
|
printf(" Min anint[%d][%d]=%.2f annais[%d]=%.2f, agemin=%.2f\n",m,i,anint[m][i], i,annais[i], *agemin); |
|
} |
|
else if(agev[m][i] >*agemax){ |
|
*agemax=agev[m][i]; |
|
/* printf(" Max anint[%d][%d]=%.0f annais[%d]=%.0f, agemax=%.2f\n",m,i,anint[m][i], i,annais[i], *agemax);*/ |
|
} |
|
/*agev[m][i]=anint[m][i]-annais[i];*/ |
|
/* agev[m][i] = age[i]+2*m;*/ |
|
} /* en if 9*/ |
|
else { /* =9 */ |
|
/* printf("Debug num[%d]=%ld s[%d][%d]=%d\n",i,num[i], m,i, s[m][i]); */ |
|
agev[m][i]=1; |
|
s[m][i]=-1; |
|
} |
|
} |
|
else if(s[m][i]==0) /*= 0 Unknown */ |
|
agev[m][i]=1; |
|
else{ |
|
printf("Warning, num[%d]=%ld, s[%d][%d]=%d\n", i, num[i], m, i,s[m][i]); |
|
fprintf(ficlog, "Warning, num[%d]=%ld, s[%d][%d]=%d\n", i, num[i], m, i,s[m][i]); |
|
agev[m][i]=0; |
|
} |
|
} /* End for lastpass */ |
|
} |
|
|
|
for (i=1; i<=imx; i++) { |
|
for(m=firstpass; (m<=lastpass); m++){ |
|
if (s[m][i] > (nlstate+ndeath)) { |
|
(*nberr)++; |
|
printf("Error: on wave %d of individual %d status %d > (nlstate+ndeath)=(%d+%d)=%d\n",m,i,s[m][i],nlstate, ndeath, nlstate+ndeath); |
|
fprintf(ficlog,"Error: on wave %d of individual %d status %d > (nlstate+ndeath)=(%d+%d)=%d\n",m,i,s[m][i],nlstate, ndeath, nlstate+ndeath); |
|
return 1; |
|
} |
|
} |
|
} |
|
|
|
/*for (i=1; i<=imx; i++){ |
|
for (m=firstpass; (m<lastpass); m++){ |
|
printf("%ld %d %.lf %d %d\n", num[i],(covar[1][i]),agev[m][i],s[m][i],s[m+1][i]); |
|
} |
|
|
|
}*/ |
|
|
|
|
|
printf("Total number of individuals= %d, Agemin = %.2f, Agemax= %.2f\n\n", imx, *agemin, *agemax); |
|
fprintf(ficlog,"Total number of individuals= %d, Agemin = %.2f, Agemax= %.2f\n\n", imx, *agemin, *agemax); |
|
|
|
return (0); |
|
/* endread:*/ |
|
printf("Exiting calandcheckages: "); |
|
return (1); |
|
} |
|
|
|
#if defined(_MSC_VER) |
|
/*printf("Visual C++ compiler: %s \n;", _MSC_FULL_VER);*/ |
|
/*fprintf(ficlog, "Visual C++ compiler: %s \n;", _MSC_FULL_VER);*/ |
|
//#include "stdafx.h" |
|
//#include <stdio.h> |
|
//#include <tchar.h> |
|
//#include <windows.h> |
|
//#include <iostream> |
|
typedef BOOL(WINAPI *LPFN_ISWOW64PROCESS) (HANDLE, PBOOL); |
|
|
|
LPFN_ISWOW64PROCESS fnIsWow64Process; |
|
|
|
BOOL IsWow64() |
|
{ |
|
BOOL bIsWow64 = FALSE; |
|
|
|
//typedef BOOL (APIENTRY *LPFN_ISWOW64PROCESS) |
|
// (HANDLE, PBOOL); |
|
|
|
//LPFN_ISWOW64PROCESS fnIsWow64Process; |
|
|
|
HMODULE module = GetModuleHandle(_T("kernel32")); |
|
const char funcName[] = "IsWow64Process"; |
|
fnIsWow64Process = (LPFN_ISWOW64PROCESS) |
|
GetProcAddress(module, funcName); |
|
|
|
if (NULL != fnIsWow64Process) |
|
{ |
|
if (!fnIsWow64Process(GetCurrentProcess(), |
|
&bIsWow64)) |
|
//throw std::exception("Unknown error"); |
|
printf("Unknown error\n"); |
|
} |
|
return bIsWow64 != FALSE; |
|
} |
|
#endif |
|
|
|
void syscompilerinfo(int logged) |
|
{ |
|
/* #include "syscompilerinfo.h"*/ |
|
/* command line Intel compiler 32bit windows, XP compatible:*/ |
|
/* /GS /W3 /Gy |
|
/Zc:wchar_t /Zi /O2 /Fd"Release\vc120.pdb" /D "WIN32" /D "NDEBUG" /D |
|
"_CONSOLE" /D "_LIB" /D "_USING_V110_SDK71_" /D "_UNICODE" /D |
|
"UNICODE" /Qipo /Zc:forScope /Gd /Oi /MT /Fa"Release\" /EHsc /nologo |
|
/Fo"Release\" /Qprof-dir "Release\" /Fp"Release\IMaCh.pch" |
|
*/ |
|
/* 64 bits */ |
|
/* |
|
/GS /W3 /Gy |
|
/Zc:wchar_t /Zi /O2 /Fd"x64\Release\vc120.pdb" /D "WIN32" /D "NDEBUG" |
|
/D "_CONSOLE" /D "_LIB" /D "_UNICODE" /D "UNICODE" /Qipo /Zc:forScope |
|
/Oi /MD /Fa"x64\Release\" /EHsc /nologo /Fo"x64\Release\" /Qprof-dir |
|
"x64\Release\" /Fp"x64\Release\IMaCh.pch" */ |
|
/* Optimization are useless and O3 is slower than O2 */ |
|
/* |
|
/GS /W3 /Gy /Zc:wchar_t /Zi /O3 /Fd"x64\Release\vc120.pdb" /D "WIN32" |
|
/D "NDEBUG" /D "_CONSOLE" /D "_LIB" /D "_UNICODE" /D "UNICODE" /Qipo |
|
/Zc:forScope /Oi /MD /Fa"x64\Release\" /EHsc /nologo /Qparallel |
|
/Fo"x64\Release\" /Qprof-dir "x64\Release\" /Fp"x64\Release\IMaCh.pch" |
|
*/ |
|
/* Link is */ /* /OUT:"visual studio |
|
2013\Projects\IMaCh\Release\IMaCh.exe" /MANIFEST /NXCOMPAT |
|
/PDB:"visual studio |
|
2013\Projects\IMaCh\Release\IMaCh.pdb" /DYNAMICBASE |
|
"kernel32.lib" "user32.lib" "gdi32.lib" "winspool.lib" |
|
"comdlg32.lib" "advapi32.lib" "shell32.lib" "ole32.lib" |
|
"oleaut32.lib" "uuid.lib" "odbc32.lib" "odbccp32.lib" |
|
/MACHINE:X86 /OPT:REF /SAFESEH /INCREMENTAL:NO |
|
/SUBSYSTEM:CONSOLE",5.01" /MANIFESTUAC:"level='asInvoker' |
|
uiAccess='false'" |
|
/ManifestFile:"Release\IMaCh.exe.intermediate.manifest" /OPT:ICF |
|
/NOLOGO /TLBID:1 |
|
*/ |
|
#if defined __INTEL_COMPILER |
|
#if defined(__GNUC__) |
|
struct utsname sysInfo; /* For Intel on Linux and OS/X */ |
|
#endif |
|
#elif defined(__GNUC__) |
|
#ifndef __APPLE__ |
|
#include <gnu/libc-version.h> /* Only on gnu */ |
|
#endif |
|
struct utsname sysInfo; |
|
int cross = CROSS; |
|
if (cross){ |
|
printf("Cross-"); |
|
if(logged) fprintf(ficlog, "Cross-"); |
|
} |
|
#endif |
|
|
|
#include <stdint.h> |
|
|
|
printf("Compiled with:");if(logged)fprintf(ficlog,"Compiled with:"); |
|
#if defined(__clang__) |
|
printf(" Clang/LLVM");if(logged)fprintf(ficlog," Clang/LLVM"); /* Clang/LLVM. ---------------------------------------------- */ |
|
#endif |
|
#if defined(__ICC) || defined(__INTEL_COMPILER) |
|
printf(" Intel ICC/ICPC");if(logged)fprintf(ficlog," Intel ICC/ICPC");/* Intel ICC/ICPC. ------------------------------------------ */ |
|
#endif |
|
#if defined(__GNUC__) || defined(__GNUG__) |
|
printf(" GNU GCC/G++");if(logged)fprintf(ficlog," GNU GCC/G++");/* GNU GCC/G++. --------------------------------------------- */ |
|
#endif |
|
#if defined(__HP_cc) || defined(__HP_aCC) |
|
printf(" Hewlett-Packard C/aC++");if(logged)fprintf(fcilog," Hewlett-Packard C/aC++"); /* Hewlett-Packard C/aC++. ---------------------------------- */ |
|
#endif |
|
#if defined(__IBMC__) || defined(__IBMCPP__) |
|
printf(" IBM XL C/C++"); if(logged) fprintf(ficlog," IBM XL C/C++");/* IBM XL C/C++. -------------------------------------------- */ |
|
#endif |
|
#if defined(_MSC_VER) |
|
printf(" Microsoft Visual Studio");if(logged)fprintf(ficlog," Microsoft Visual Studio");/* Microsoft Visual Studio. --------------------------------- */ |
|
#endif |
|
#if defined(__PGI) |
|
printf(" Portland Group PGCC/PGCPP");if(logged) fprintf(ficlog," Portland Group PGCC/PGCPP");/* Portland Group PGCC/PGCPP. ------------------------------- */ |
|
#endif |
|
#if defined(__SUNPRO_C) || defined(__SUNPRO_CC) |
|
printf(" Oracle Solaris Studio");if(logged)fprintf(ficlog," Oracle Solaris Studio\n");/* Oracle Solaris Studio. ----------------------------------- */ |
|
#endif |
|
printf(" for "); if (logged) fprintf(ficlog, " for "); |
|
|
|
// http://stackoverflow.com/questions/4605842/how-to-identify-platform-compiler-from-preprocessor-macros |
|
#ifdef _WIN32 // note the underscore: without it, it's not msdn official! |
|
// Windows (x64 and x86) |
|
printf("Windows (x64 and x86) ");if(logged) fprintf(ficlog,"Windows (x64 and x86) "); |
|
#elif __unix__ // all unices, not all compilers |
|
// Unix |
|
printf("Unix ");if(logged) fprintf(ficlog,"Unix "); |
|
#elif __linux__ |
|
// linux |
|
printf("linux ");if(logged) fprintf(ficlog,"linux "); |
|
#elif __APPLE__ |
|
// Mac OS, not sure if this is covered by __posix__ and/or __unix__ though.. |
|
printf("Mac OS ");if(logged) fprintf(ficlog,"Mac OS "); |
|
#endif |
|
|
|
/* __MINGW32__ */ |
|
/* __CYGWIN__ */ |
|
/* __MINGW64__ */ |
|
// http://msdn.microsoft.com/en-us/library/b0084kay.aspx |
|
/* _MSC_VER //the Visual C++ compiler is 17.00.51106.1, the _MSC_VER macro evaluates to 1700. Type cl /? */ |
|
/* _MSC_FULL_VER //the Visual C++ compiler is 15.00.20706.01, the _MSC_FULL_VER macro evaluates to 150020706 */ |
|
/* _WIN64 // Defined for applications for Win64. */ |
|
/* _M_X64 // Defined for compilations that target x64 processors. */ |
|
/* _DEBUG // Defined when you compile with /LDd, /MDd, and /MTd. */ |
|
|
|
#if UINTPTR_MAX == 0xffffffff |
|
printf(" 32-bit"); if(logged) fprintf(ficlog," 32-bit");/* 32-bit */ |
|
#elif UINTPTR_MAX == 0xffffffffffffffff |
|
printf(" 64-bit"); if(logged) fprintf(ficlog," 64-bit");/* 64-bit */ |
|
#else |
|
printf(" wtf-bit"); if(logged) fprintf(ficlog," wtf-bit");/* wtf */ |
|
#endif |
|
|
|
#if defined(__GNUC__) |
|
# if defined(__GNUC_PATCHLEVEL__) |
|
# define __GNUC_VERSION__ (__GNUC__ * 10000 \ |
|
+ __GNUC_MINOR__ * 100 \ |
|
+ __GNUC_PATCHLEVEL__) |
|
# else |
|
# define __GNUC_VERSION__ (__GNUC__ * 10000 \ |
|
+ __GNUC_MINOR__ * 100) |
|
# endif |
|
printf(" using GNU C version %d.\n", __GNUC_VERSION__); |
|
if(logged) fprintf(ficlog, " using GNU C version %d.\n", __GNUC_VERSION__); |
|
|
|
if (uname(&sysInfo) != -1) { |
|
printf("Running on: %s %s %s %s %s\n",sysInfo.sysname, sysInfo.nodename, sysInfo.release, sysInfo.version, sysInfo.machine); |
|
if(logged) fprintf(ficlog,"Running on: %s %s %s %s %s\n ",sysInfo.sysname, sysInfo.nodename, sysInfo.release, sysInfo.version, sysInfo.machine); |
|
} |
|
else |
|
perror("uname() error"); |
|
//#ifndef __INTEL_COMPILER |
|
#if !defined (__INTEL_COMPILER) && !defined(__APPLE__) |
|
printf("GNU libc version: %s\n", gnu_get_libc_version()); |
|
if(logged) fprintf(ficlog,"GNU libc version: %s\n", gnu_get_libc_version()); |
|
#endif |
|
#endif |
|
|
|
// void main() |
|
// { |
|
#if defined(_MSC_VER) |
|
if (IsWow64()){ |
|
printf("\nThe program (probably compiled for 32bit) is running under WOW64 (64bit) emulation.\n"); |
|
if (logged) fprintf(ficlog, "\nThe program (probably compiled for 32bit) is running under WOW64 (64bit) emulation.\n"); |
|
} |
|
else{ |
|
printf("\nThe program is not running under WOW64 (i.e probably on a 64bit Windows).\n"); |
|
if (logged) fprintf(ficlog, "\nThe programm is not running under WOW64 (i.e probably on a 64bit Windows).\n"); |
|
} |
|
// printf("\nPress Enter to continue..."); |
|
// getchar(); |
|
// } |
|
|
|
#endif |
|
|
|
|
|
} |
|
|
|
int prevalence_limit(double *p, double **prlim, double ageminpar, double agemaxpar, double ftolpl, int *ncvyearp){ |
|
/*--------------- Prevalence limit (period or stable prevalence) --------------*/ |
|
int i, j, k, i1 ; |
|
/* double ftolpl = 1.e-10; */ |
|
double age, agebase, agelim; |
|
double tot; |
|
|
|
strcpy(filerespl,"PL_"); |
|
strcat(filerespl,fileresu); |
|
if((ficrespl=fopen(filerespl,"w"))==NULL) { |
|
printf("Problem with period (stable) prevalence resultfile: %s\n", filerespl);return 1; |
|
fprintf(ficlog,"Problem with period (stable) prevalence resultfile: %s\n", filerespl);return 1; |
|
} |
|
printf("Computing period (stable) prevalence: result on file '%s' \n", filerespl); |
|
fprintf(ficlog,"Computing period (stable) prevalence: result on file '%s' \n", filerespl); |
|
pstamp(ficrespl); |
|
fprintf(ficrespl,"# Period (stable) prevalence. Precision given by ftolpl=%g \n", ftolpl); |
|
fprintf(ficrespl,"#Age "); |
|
for(i=1; i<=nlstate;i++) fprintf(ficrespl,"%d-%d ",i,i); |
|
fprintf(ficrespl,"\n"); |
|
|
|
/* prlim=matrix(1,nlstate,1,nlstate);*/ /* back in main */ |
|
|
|
agebase=ageminpar; |
|
agelim=agemaxpar; |
|
|
|
i1=pow(2,cptcoveff); |
|
if (cptcovn < 1){i1=1;} |
|
|
|
for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
|
/* for(cptcov=1,k=0;cptcov<=1;cptcov++){ */ |
|
//for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){ |
|
k=k+1; |
|
/* to clean */ |
|
//printf("cptcov=%d cptcod=%d codtab=%d\n",cptcov, cptcod,codtabm(cptcod,cptcov)); |
|
fprintf(ficrespl,"#******"); |
|
printf("#******"); |
|
fprintf(ficlog,"#******"); |
|
for(j=1;j<=cptcoveff;j++) { |
|
fprintf(ficrespl," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
printf(" V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
fprintf(ficlog," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
} |
|
fprintf(ficrespl,"******\n"); |
|
printf("******\n"); |
|
fprintf(ficlog,"******\n"); |
|
|
|
fprintf(ficrespl,"#Age "); |
|
for(j=1;j<=cptcoveff;j++) { |
|
fprintf(ficrespl,"V%d %d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
} |
|
for(i=1; i<=nlstate;i++) fprintf(ficrespl," %d-%d ",i,i); |
|
fprintf(ficrespl,"Total Years_to_converge\n"); |
|
|
|
for (age=agebase; age<=agelim; age++){ |
|
/* for (age=agebase; age<=agebase; age++){ */ |
|
prevalim(prlim, nlstate, p, age, oldm, savm, ftolpl, ncvyearp, k); |
|
fprintf(ficrespl,"%.0f ",age ); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficrespl,"%d %d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
tot=0.; |
|
for(i=1; i<=nlstate;i++){ |
|
tot += prlim[i][i]; |
|
fprintf(ficrespl," %.5f", prlim[i][i]); |
|
} |
|
fprintf(ficrespl," %.3f %d\n", tot, *ncvyearp); |
|
} /* Age */ |
|
/* was end of cptcod */ |
|
} /* cptcov */ |
|
return 0; |
|
} |
|
|
|
int back_prevalence_limit(double *p, double **bprlim, double ageminpar, double agemaxpar, double ftolpl, int *ncvyearp){ |
|
/*--------------- Back Prevalence limit (period or stable prevalence) --------------*/ |
|
int i, j, k, i1 ; |
|
/* double ftolpl = 1.e-10; */ |
|
double age, agebase, agelim; |
|
double tot; |
|
|
|
strcpy(fileresplb,"PLB_"); |
|
strcat(fileresplb,fileresu); |
|
if((ficresplb=fopen(fileresplb,"w"))==NULL) { |
|
printf("Problem with period (stable) back prevalence resultfile: %s\n", fileresplb);return 1; |
|
fprintf(ficlog,"Problem with period (stable) back prevalence resultfile: %s\n", fileresplb);return 1; |
|
} |
|
printf("Computing period (stable) back prevalence: result on file '%s' \n", fileresplb); |
|
fprintf(ficlog,"Computing period (stable) back prevalence: result on file '%s' \n", fileresplb); |
|
pstamp(ficresplb); |
|
fprintf(ficresplb,"# Period (stable) back prevalence. Precision given by ftolpl=%g \n", ftolpl); |
|
fprintf(ficresplb,"#Age "); |
|
for(i=1; i<=nlstate;i++) fprintf(ficresplb,"%d-%d ",i,i); |
|
fprintf(ficresplb,"\n"); |
|
|
|
/* prlim=matrix(1,nlstate,1,nlstate);*/ /* back in main */ |
|
|
|
agebase=ageminpar; |
|
agelim=agemaxpar; |
|
|
|
i1=pow(2,cptcoveff); |
|
if (cptcovn < 1){i1=1;} |
|
|
|
for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
|
/* for(cptcov=1,k=0;cptcov<=1;cptcov++){ */ |
|
//for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){ |
|
k=k+1; |
|
/* to clean */ |
|
//printf("cptcov=%d cptcod=%d codtab=%d\n",cptcov, cptcod,codtabm(cptcod,cptcov)); |
|
fprintf(ficresplb,"#******"); |
|
printf("#******"); |
|
fprintf(ficlog,"#******"); |
|
for(j=1;j<=cptcoveff;j++) { |
|
fprintf(ficresplb," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
printf(" V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
fprintf(ficlog," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
} |
|
fprintf(ficresplb,"******\n"); |
|
printf("******\n"); |
|
fprintf(ficlog,"******\n"); |
|
|
|
fprintf(ficresplb,"#Age "); |
|
for(j=1;j<=cptcoveff;j++) { |
|
fprintf(ficresplb,"V%d %d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
} |
|
for(i=1; i<=nlstate;i++) fprintf(ficresplb," %d-%d ",i,i); |
|
fprintf(ficresplb,"Total Years_to_converge\n"); |
|
|
|
for (age=agebase; age<=agelim; age++){ |
|
/* for (age=agebase; age<=agebase; age++){ */ |
|
bprevalim(bprlim, nlstate, p, age, oldm, savm, ftolpl, ncvyearp, k); |
|
fprintf(ficresplb,"%.0f ",age ); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficresplb,"%d %d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
tot=0.; |
|
for(i=1; i<=nlstate;i++){ |
|
tot += bprlim[i][i]; |
|
fprintf(ficresplb," %.5f", bprlim[i][i]); |
|
} |
|
fprintf(ficresplb," %.3f %d\n", tot, *ncvyearp); |
|
} /* Age */ |
|
/* was end of cptcod */ |
|
} /* cptcov */ |
|
return 0; |
|
} |
|
|
|
int hPijx(double *p, int bage, int fage){ |
|
/*------------- h Pij x at various ages ------------*/ |
|
|
|
int stepsize; |
|
int agelim; |
|
int hstepm; |
|
int nhstepm; |
|
int h, i, i1, j, k; |
|
|
|
double agedeb; |
|
double ***p3mat; |
|
|
|
strcpy(filerespij,"PIJ_"); strcat(filerespij,fileresu); |
|
if((ficrespij=fopen(filerespij,"w"))==NULL) { |
|
printf("Problem with Pij resultfile: %s\n", filerespij); return 1; |
|
fprintf(ficlog,"Problem with Pij resultfile: %s\n", filerespij); return 1; |
|
} |
|
printf("Computing pij: result on file '%s' \n", filerespij); |
|
fprintf(ficlog,"Computing pij: result on file '%s' \n", filerespij); |
|
|
|
stepsize=(int) (stepm+YEARM-1)/YEARM; |
|
/*if (stepm<=24) stepsize=2;*/ |
|
|
|
agelim=AGESUP; |
|
hstepm=stepsize*YEARM; /* Every year of age */ |
|
hstepm=hstepm/stepm; /* Typically 2 years, = 2/6 months = 4 */ |
|
|
|
/* hstepm=1; aff par mois*/ |
|
pstamp(ficrespij); |
|
fprintf(ficrespij,"#****** h Pij x Probability to be in state j at age x+h being in i at x "); |
|
i1= pow(2,cptcoveff); |
|
/* for(cptcov=1,k=0;cptcov<=i1;cptcov++){ */ |
|
/* /\*for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){*\/ */ |
|
/* k=k+1; */ |
|
for (k=1; k <= (int) pow(2,cptcoveff); k++){ |
|
fprintf(ficrespij,"\n#****** "); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficrespij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
fprintf(ficrespij,"******\n"); |
|
|
|
for (agedeb=fage; agedeb>=bage; agedeb--){ /* If stepm=6 months */ |
|
nhstepm=(int) rint((agelim-agedeb)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */ |
|
nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */ |
|
|
|
/* nhstepm=nhstepm*YEARM; aff par mois*/ |
|
|
|
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
oldm=oldms;savm=savms; |
|
hpxij(p3mat,nhstepm,agedeb,hstepm,p,nlstate,stepm,oldm,savm, k); |
|
fprintf(ficrespij,"# Cov Agex agex+h hpijx with i,j="); |
|
for(i=1; i<=nlstate;i++) |
|
for(j=1; j<=nlstate+ndeath;j++) |
|
fprintf(ficrespij," %1d-%1d",i,j); |
|
fprintf(ficrespij,"\n"); |
|
for (h=0; h<=nhstepm; h++){ |
|
/*agedebphstep = agedeb + h*hstepm/YEARM*stepm;*/ |
|
fprintf(ficrespij,"%d %3.f %3.f",k, agedeb, agedeb + h*hstepm/YEARM*stepm ); |
|
for(i=1; i<=nlstate;i++) |
|
for(j=1; j<=nlstate+ndeath;j++) |
|
fprintf(ficrespij," %.5f", p3mat[i][j][h]); |
|
fprintf(ficrespij,"\n"); |
|
} |
|
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
fprintf(ficrespij,"\n"); |
|
} |
|
/*}*/ |
|
} |
|
return 0; |
|
} |
|
|
|
int hBijx(double *p, int bage, int fage){ |
|
/*------------- h Bij x at various ages ------------*/ |
|
|
|
int stepsize; |
|
int agelim; |
|
int hstepm; |
|
int nhstepm; |
|
int h, i, i1, j, k; |
|
|
|
double agedeb; |
|
double ***p3mat; |
|
|
|
strcpy(filerespijb,"PIJB_"); strcat(filerespijb,fileresu); |
|
if((ficrespijb=fopen(filerespijb,"w"))==NULL) { |
|
printf("Problem with Pij back resultfile: %s\n", filerespijb); return 1; |
|
fprintf(ficlog,"Problem with Pij back resultfile: %s\n", filerespijb); return 1; |
|
} |
|
printf("Computing pij back: result on file '%s' \n", filerespijb); |
|
fprintf(ficlog,"Computing pij back: result on file '%s' \n", filerespijb); |
|
|
|
stepsize=(int) (stepm+YEARM-1)/YEARM; |
|
/*if (stepm<=24) stepsize=2;*/ |
|
|
|
agelim=AGESUP; |
|
hstepm=stepsize*YEARM; /* Every year of age */ |
|
hstepm=hstepm/stepm; /* Typically 2 years, = 2/6 months = 4 */ |
|
|
|
/* hstepm=1; aff par mois*/ |
|
pstamp(ficrespijb); |
|
fprintf(ficrespijb,"#****** h Pij x Back Probability to be in state i at age x-h being in j at x "); |
|
i1= pow(2,cptcoveff); |
|
/* for(cptcov=1,k=0;cptcov<=i1;cptcov++){ */ |
|
/* /\*for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){*\/ */ |
|
/* k=k+1; */ |
|
for (k=1; k <= (int) pow(2,cptcoveff); k++){ |
|
fprintf(ficrespijb,"\n#****** "); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficrespijb,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
fprintf(ficrespijb,"******\n"); |
|
|
|
/* for (agedeb=fage; agedeb>=bage; agedeb--){ /\* If stepm=6 months *\/ */ |
|
for (agedeb=bage; agedeb<=fage; agedeb++){ /* If stepm=6 months */ |
|
nhstepm=(int) rint((agelim-agedeb)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */ |
|
nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */ |
|
|
|
/* nhstepm=nhstepm*YEARM; aff par mois*/ |
|
|
|
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
oldm=oldms;savm=savms; |
|
hbxij(p3mat,nhstepm,agedeb,hstepm,p,nlstate,stepm,oldm,savm, k); |
|
fprintf(ficrespijb,"# Cov Agex agex-h hpijx with i,j="); |
|
for(i=1; i<=nlstate;i++) |
|
for(j=1; j<=nlstate+ndeath;j++) |
|
fprintf(ficrespijb," %1d-%1d",i,j); |
|
fprintf(ficrespijb,"\n"); |
|
for (h=0; h<=nhstepm; h++){ |
|
/*agedebphstep = agedeb + h*hstepm/YEARM*stepm;*/ |
|
fprintf(ficrespijb,"%d %3.f %3.f",k, agedeb, agedeb - h*hstepm/YEARM*stepm ); |
|
/* fprintf(ficrespijb,"%d %3.f %3.f",k, agedeb, agedeb + h*hstepm/YEARM*stepm ); */ |
|
for(i=1; i<=nlstate;i++) |
|
for(j=1; j<=nlstate+ndeath;j++) |
|
fprintf(ficrespijb," %.5f", p3mat[i][j][h]); |
|
fprintf(ficrespijb,"\n"); |
|
} |
|
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
fprintf(ficrespijb,"\n"); |
|
} |
|
/*}*/ |
|
} |
|
return 0; |
|
} |
|
|
|
|
/***********************************************/ |
/***********************************************/ |
Line 3989 void printinggnuplotmort(char fileres[],
|
Line 7745 void printinggnuplotmort(char fileres[],
|
|
|
int main(int argc, char *argv[]) |
int main(int argc, char *argv[]) |
{ |
{ |
|
#ifdef GSL |
|
const gsl_multimin_fminimizer_type *T; |
|
size_t iteri = 0, it; |
|
int rval = GSL_CONTINUE; |
|
int status = GSL_SUCCESS; |
|
double ssval; |
|
#endif |
int movingaverage(double ***probs, double bage,double fage, double ***mobaverage, int mobilav); |
int movingaverage(double ***probs, double bage,double fage, double ***mobaverage, int mobilav); |
int i,j, k, n=MAXN,iter,m,size=100,cptcode, cptcod; |
int i,j, k, n=MAXN,iter=0,m,size=100, cptcod; |
int jj, ll, li, lj, lk, imk; |
int ncvyear=0; /* Number of years needed for the period prevalence to converge */ |
|
int jj, ll, li, lj, lk; |
int numlinepar=0; /* Current linenumber of parameter file */ |
int numlinepar=0; /* Current linenumber of parameter file */ |
|
int num_filled; |
int itimes; |
int itimes; |
int NDIM=2; |
int NDIM=2; |
|
int vpopbased=0; |
|
|
char ca[32], cb[32], cc[32]; |
char ca[32], cb[32]; |
/* FILE *fichtm; *//* Html File */ |
/* FILE *fichtm; *//* Html File */ |
/* FILE *ficgp;*/ /*Gnuplot File */ |
/* FILE *ficgp;*/ /*Gnuplot File */ |
double agedeb, agefin,hf; |
struct stat info; |
double ageminpar=1.e20,agemin=1.e20, agemaxpar=-1.e20, agemax=-1.e20; |
double agedeb=0.; |
|
|
double fret; |
double ageminpar=AGEOVERFLOW,agemin=AGEOVERFLOW, agemaxpar=-AGEOVERFLOW, agemax=-AGEOVERFLOW; |
double **xi,tmp,delta; |
|
|
|
double dum; /* Dummy variable */ |
double fret; |
|
double dum=0.; /* Dummy variable */ |
double ***p3mat; |
double ***p3mat; |
double ***mobaverage; |
double ***mobaverage; |
int *indx; |
|
char line[MAXLINE], linepar[MAXLINE]; |
char line[MAXLINE]; |
char path[MAXLINE],pathc[MAXLINE],pathcd[MAXLINE],pathtot[MAXLINE],model[MAXLINE]; |
char path[MAXLINE],pathc[MAXLINE],pathcd[MAXLINE],pathtot[MAXLINE]; |
|
|
|
char model[MAXLINE], modeltemp[MAXLINE]; |
char pathr[MAXLINE], pathimach[MAXLINE]; |
char pathr[MAXLINE], pathimach[MAXLINE]; |
|
char *tok, *val; /* pathtot */ |
int firstobs=1, lastobs=10; |
int firstobs=1, lastobs=10; |
int sdeb, sfin; /* Status at beginning and end */ |
int c, h , cpt, c2; |
int c, h , cpt,l; |
int jl=0; |
int ju,jl, mi; |
int i1, j1, jk, stepsize=0; |
int i1,j1, k1,k2,k3,jk,aa,bb, stepsize, ij; |
int count=0; |
int jnais,jdc,jint4,jint1,jint2,jint3,**outcome,*tab; |
|
|
int *tab; |
int mobilavproj=0 , prevfcast=0 ; /* moving average of prev, If prevfcast=1 prevalence projection */ |
int mobilavproj=0 , prevfcast=0 ; /* moving average of prev, If prevfcast=1 prevalence projection */ |
|
int backcast=0; |
int mobilav=0,popforecast=0; |
int mobilav=0,popforecast=0; |
int hstepm, nhstepm; |
int hstepm=0, nhstepm=0; |
|
int agemortsup; |
|
float sumlpop=0.; |
double jprev1=1, mprev1=1,anprev1=2000,jprev2=1, mprev2=1,anprev2=2000; |
double jprev1=1, mprev1=1,anprev1=2000,jprev2=1, mprev2=1,anprev2=2000; |
double jpyram=1, mpyram=1,anpyram=2000,jpyram1=1, mpyram1=1,anpyram1=2000; |
double jpyram=1, mpyram=1,anpyram=2000,jpyram1=1, mpyram1=1,anpyram1=2000; |
|
|
double bage, fage, age, agelim, agebase; |
double bage=0, fage=110., age, agelim=0., agebase=0.; |
double ftolpl=FTOL; |
double ftolpl=FTOL; |
double **prlim; |
double **prlim; |
double *severity; |
double **bprlim; |
double ***param; /* Matrix of parameters */ |
double ***param; /* Matrix of parameters */ |
double *p; |
double *p; |
double **matcov; /* Matrix of covariance */ |
double **matcov; /* Matrix of covariance */ |
|
double **hess; /* Hessian matrix */ |
double ***delti3; /* Scale */ |
double ***delti3; /* Scale */ |
double *delti; /* Scale */ |
double *delti; /* Scale */ |
double ***eij, ***vareij; |
double ***eij, ***vareij; |
double **varpl; /* Variances of prevalence limits by age */ |
double **varpl; /* Variances of prevalence limits by age */ |
double *epj, vepp; |
double *epj, vepp; |
double kk1, kk2; |
|
double dateprev1, dateprev2,jproj1=1,mproj1=1,anproj1=2000,jproj2=1,mproj2=1,anproj2=2000; |
double dateprev1, dateprev2,jproj1=1,mproj1=1,anproj1=2000,jproj2=1,mproj2=1,anproj2=2000; |
|
double jback1=1,mback1=1,anback1=2000,jback2=1,mback2=1,anback2=2000; |
|
|
double **ximort; |
double **ximort; |
char *alph[]={"a","a","b","c","d","e"}, str[4]; |
char *alph[]={"a","a","b","c","d","e"}, str[4]="1234"; |
int *dcwave; |
int *dcwave; |
|
|
char z[1]="c", occ; |
char z[1]="c"; |
|
|
|
/*char *strt;*/ |
|
char strtend[80]; |
|
|
char stra[80], strb[80], strc[80], strd[80],stre[80],modelsav[80]; |
|
char strstart[80], *strt, strtend[80]; |
|
char *stratrunc; |
|
int lstra; |
|
|
|
long total_usecs; |
|
|
|
/* setlocale (LC_ALL, ""); */ |
/* setlocale (LC_ALL, ""); */ |
/* bindtextdomain (PACKAGE, LOCALEDIR); */ |
/* bindtextdomain (PACKAGE, LOCALEDIR); */ |
/* textdomain (PACKAGE); */ |
/* textdomain (PACKAGE); */ |
Line 4058 int main(int argc, char *argv[])
|
Line 7831 int main(int argc, char *argv[])
|
/* setlocale (LC_MESSAGES, ""); */ |
/* setlocale (LC_MESSAGES, ""); */ |
|
|
/* gettimeofday(&start_time, (struct timezone*)0); */ /* at first time */ |
/* gettimeofday(&start_time, (struct timezone*)0); */ /* at first time */ |
(void) gettimeofday(&start_time,&tzp); |
rstart_time = time(NULL); |
|
/* (void) gettimeofday(&start_time,&tzp);*/ |
|
start_time = *localtime(&rstart_time); |
curr_time=start_time; |
curr_time=start_time; |
tm = *localtime(&start_time.tv_sec); |
/*tml = *localtime(&start_time.tm_sec);*/ |
tmg = *gmtime(&start_time.tv_sec); |
/* strcpy(strstart,asctime(&tml)); */ |
strcpy(strstart,asctime(&tm)); |
strcpy(strstart,asctime(&start_time)); |
|
|
/* printf("Localtime (at start)=%s",strstart); */ |
/* printf("Localtime (at start)=%s",strstart); */ |
/* tp.tv_sec = tp.tv_sec +86400; */ |
/* tp.tm_sec = tp.tm_sec +86400; */ |
/* tm = *localtime(&start_time.tv_sec); */ |
/* tm = *localtime(&start_time.tm_sec); */ |
/* tmg.tm_year=tmg.tm_year +dsign*dyear; */ |
/* tmg.tm_year=tmg.tm_year +dsign*dyear; */ |
/* tmg.tm_mon=tmg.tm_mon +dsign*dmonth; */ |
/* tmg.tm_mon=tmg.tm_mon +dsign*dmonth; */ |
/* tmg.tm_hour=tmg.tm_hour + 1; */ |
/* tmg.tm_hour=tmg.tm_hour + 1; */ |
/* tp.tv_sec = mktime(&tmg); */ |
/* tp.tm_sec = mktime(&tmg); */ |
/* strt=asctime(&tmg); */ |
/* strt=asctime(&tmg); */ |
/* printf("Time(after) =%s",strstart); */ |
/* printf("Time(after) =%s",strstart); */ |
/* (void) time (&time_value); |
/* (void) time (&time_value); |
Line 4082 int main(int argc, char *argv[])
|
Line 7857 int main(int argc, char *argv[])
|
|
|
nberr=0; /* Number of errors and warnings */ |
nberr=0; /* Number of errors and warnings */ |
nbwarn=0; |
nbwarn=0; |
|
#ifdef WIN32 |
|
_getcwd(pathcd, size); |
|
#else |
getcwd(pathcd, size); |
getcwd(pathcd, size); |
|
#endif |
printf("\n%s\n%s",version,fullversion); |
syscompilerinfo(0); |
|
printf("\nIMaCh version %s, %s\n%s",version, copyright, fullversion); |
if(argc <=1){ |
if(argc <=1){ |
printf("\nEnter the parameter file name: "); |
printf("\nEnter the parameter file name: "); |
scanf("%s",pathtot); |
if(!fgets(pathr,FILENAMELENGTH,stdin)){ |
|
printf("ERROR Empty parameter file name\n"); |
|
goto end; |
|
} |
|
i=strlen(pathr); |
|
if(pathr[i-1]=='\n') |
|
pathr[i-1]='\0'; |
|
i=strlen(pathr); |
|
if(i >= 1 && pathr[i-1]==' ') {/* This may happen when dragging on oS/X! */ |
|
pathr[i-1]='\0'; |
|
} |
|
i=strlen(pathr); |
|
if( i==0 ){ |
|
printf("ERROR Empty parameter file name\n"); |
|
goto end; |
|
} |
|
for (tok = pathr; tok != NULL; ){ |
|
printf("Pathr |%s|\n",pathr); |
|
while ((val = strsep(&tok, "\"" )) != NULL && *val == '\0'); |
|
printf("val= |%s| pathr=%s\n",val,pathr); |
|
strcpy (pathtot, val); |
|
if(pathr[0] == '\0') break; /* Dirty */ |
|
} |
} |
} |
else{ |
else{ |
strcpy(pathtot,argv[1]); |
strcpy(pathtot,argv[1]); |
Line 4097 int main(int argc, char *argv[])
|
Line 7898 int main(int argc, char *argv[])
|
printf("pathtot=%s, path=%s, optionfile=%s\n",pathtot,path,optionfile);*/ |
printf("pathtot=%s, path=%s, optionfile=%s\n",pathtot,path,optionfile);*/ |
/* cutv(path,optionfile,pathtot,'\\');*/ |
/* cutv(path,optionfile,pathtot,'\\');*/ |
|
|
|
/* Split argv[0], imach program to get pathimach */ |
|
printf("\nargv[0]=%s argv[1]=%s, \n",argv[0],argv[1]); |
split(argv[0],pathimach,optionfile,optionfilext,optionfilefiname); |
split(argv[0],pathimach,optionfile,optionfilext,optionfilefiname); |
|
printf("\nargv[0]=%s pathimach=%s, \noptionfile=%s \noptionfilext=%s \noptionfilefiname=%s\n",argv[0],pathimach,optionfile,optionfilext,optionfilefiname); |
/* strcpy(pathimach,argv[0]); */ |
/* strcpy(pathimach,argv[0]); */ |
|
/* Split argv[1]=pathtot, parameter file name to get path, optionfile, extension and name */ |
split(pathtot,path,optionfile,optionfilext,optionfilefiname); |
split(pathtot,path,optionfile,optionfilext,optionfilefiname); |
printf("pathimach=%s, pathtot=%s,\npath=%s,\noptionfile=%s \noptionfilext=%s \noptionfilefiname=%s\n",pathimach,pathtot,path,optionfile,optionfilext,optionfilefiname); |
printf("\npathtot=%s,\npath=%s,\noptionfile=%s \noptionfilext=%s \noptionfilefiname=%s\n",pathtot,path,optionfile,optionfilext,optionfilefiname); |
chdir(path); |
#ifdef WIN32 |
|
_chdir(path); /* Can be a relative path */ |
|
if(_getcwd(pathcd,MAXLINE) > 0) /* So pathcd is the full path */ |
|
#else |
|
chdir(path); /* Can be a relative path */ |
|
if (getcwd(pathcd, MAXLINE) > 0) /* So pathcd is the full path */ |
|
#endif |
|
printf("Current directory %s!\n",pathcd); |
strcpy(command,"mkdir "); |
strcpy(command,"mkdir "); |
strcat(command,optionfilefiname); |
strcat(command,optionfilefiname); |
if((outcmd=system(command)) != 0){ |
if((outcmd=system(command)) != 0){ |
printf("Problem creating directory or it already exists %s%s, err=%d\n",path,optionfilefiname,outcmd); |
printf("Directory already exists (or can't create it) %s%s, err=%d\n",path,optionfilefiname,outcmd); |
/* fprintf(ficlog,"Problem creating directory %s%s\n",path,optionfilefiname); */ |
/* fprintf(ficlog,"Problem creating directory %s%s\n",path,optionfilefiname); */ |
/* fclose(ficlog); */ |
/* fclose(ficlog); */ |
/* exit(1); */ |
/* exit(1); */ |
Line 4116 int main(int argc, char *argv[])
|
Line 7928 int main(int argc, char *argv[])
|
|
|
/*-------- arguments in the command line --------*/ |
/*-------- arguments in the command line --------*/ |
|
|
/* Log file */ |
/* Main Log file */ |
strcat(filelog, optionfilefiname); |
strcat(filelog, optionfilefiname); |
strcat(filelog,".log"); /* */ |
strcat(filelog,".log"); /* */ |
if((ficlog=fopen(filelog,"w"))==NULL) { |
if((ficlog=fopen(filelog,"w"))==NULL) { |
Line 4124 int main(int argc, char *argv[])
|
Line 7936 int main(int argc, char *argv[])
|
goto end; |
goto end; |
} |
} |
fprintf(ficlog,"Log filename:%s\n",filelog); |
fprintf(ficlog,"Log filename:%s\n",filelog); |
fprintf(ficlog,"\n%s\n%s",version,fullversion); |
fprintf(ficlog,"Version %s %s",version,fullversion); |
fprintf(ficlog,"\nEnter the parameter file name: \n"); |
fprintf(ficlog,"\nEnter the parameter file name: \n"); |
fprintf(ficlog,"pathimach=%s\npathtot=%s\n\ |
fprintf(ficlog,"pathimach=%s\npathtot=%s\n\ |
path=%s \n\ |
path=%s \n\ |
optionfile=%s\n\ |
optionfile=%s\n\ |
optionfilext=%s\n\ |
optionfilext=%s\n\ |
optionfilefiname=%s\n",pathimach,pathtot,path,optionfile,optionfilext,optionfilefiname); |
optionfilefiname='%s'\n",pathimach,pathtot,path,optionfile,optionfilext,optionfilefiname); |
|
|
|
syscompilerinfo(1); |
|
|
printf("Local time (at start):%s",strstart); |
printf("Local time (at start):%s",strstart); |
fprintf(ficlog,"Local time (at start): %s",strstart); |
fprintf(ficlog,"Local time (at start): %s",strstart); |
fflush(ficlog); |
fflush(ficlog); |
/* (void) gettimeofday(&curr_time,&tzp); */ |
/* (void) gettimeofday(&curr_time,&tzp); */ |
/* printf("Elapsed time %d\n", asc_diff_time(curr_time.tv_sec-start_time.tv_sec,tmpout)); */ |
/* printf("Elapsed time %d\n", asc_diff_time(curr_time.tm_sec-start_time.tm_sec,tmpout)); */ |
|
|
/* */ |
/* */ |
strcpy(fileres,"r"); |
strcpy(fileres,"r"); |
strcat(fileres, optionfilefiname); |
strcat(fileres, optionfilefiname); |
|
strcat(fileresu, optionfilefiname); /* Without r in front */ |
strcat(fileres,".txt"); /* Other files have txt extension */ |
strcat(fileres,".txt"); /* Other files have txt extension */ |
|
strcat(fileresu,".txt"); /* Other files have txt extension */ |
|
|
/*---------arguments file --------*/ |
/* Main ---------arguments file --------*/ |
|
|
if((ficpar=fopen(optionfile,"r"))==NULL) { |
if((ficpar=fopen(optionfile,"r"))==NULL) { |
printf("Problem with optionfile %s\n",optionfile); |
printf("Problem with optionfile '%s' with errno='%s'\n",optionfile,strerror(errno)); |
fprintf(ficlog,"Problem with optionfile %s\n",optionfile); |
fprintf(ficlog,"Problem with optionfile '%s' with errno='%s'\n",optionfile,strerror(errno)); |
fflush(ficlog); |
fflush(ficlog); |
goto end; |
/* goto end; */ |
|
exit(70); |
} |
} |
|
|
|
|
|
|
strcpy(filereso,"o"); |
strcpy(filereso,"o"); |
strcat(filereso,fileres); |
strcat(filereso,fileresu); |
if((ficparo=fopen(filereso,"w"))==NULL) { /* opened on subdirectory */ |
if((ficparo=fopen(filereso,"w"))==NULL) { /* opened on subdirectory */ |
printf("Problem with Output resultfile: %s\n", filereso); |
printf("Problem with Output resultfile: %s\n", filereso); |
fprintf(ficlog,"Problem with Output resultfile: %s\n", filereso); |
fprintf(ficlog,"Problem with Output resultfile: %s\n", filereso); |
Line 4165 int main(int argc, char *argv[])
|
Line 7982 int main(int argc, char *argv[])
|
|
|
/* Reads comments: lines beginning with '#' */ |
/* Reads comments: lines beginning with '#' */ |
numlinepar=0; |
numlinepar=0; |
while((c=getc(ficpar))=='#' && c!= EOF){ |
|
ungetc(c,ficpar); |
/* First parameter line */ |
fgets(line, MAXLINE, ficpar); |
while(fgets(line, MAXLINE, ficpar)) { |
|
/* If line starts with a # it is a comment */ |
|
if (line[0] == '#') { |
|
numlinepar++; |
|
fputs(line,stdout); |
|
fputs(line,ficparo); |
|
fputs(line,ficlog); |
|
continue; |
|
}else |
|
break; |
|
} |
|
if((num_filled=sscanf(line,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\n", \ |
|
title, datafile, &lastobs, &firstpass,&lastpass)) !=EOF){ |
|
if (num_filled != 5) { |
|
printf("Should be 5 parameters\n"); |
|
} |
numlinepar++; |
numlinepar++; |
puts(line); |
printf("title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\n", title, datafile, lastobs, firstpass,lastpass); |
fputs(line,ficparo); |
|
fputs(line,ficlog); |
|
} |
} |
ungetc(c,ficpar); |
/* Second parameter line */ |
|
while(fgets(line, MAXLINE, ficpar)) { |
fscanf(ficpar,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%lf stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d model=%s\n",title, datafile, &lastobs, &firstpass,&lastpass,&ftol, &stepm, &ncovcol, &nlstate,&ndeath, &maxwav, &mle, &weightopt,model); |
/* If line starts with a # it is a comment */ |
numlinepar++; |
if (line[0] == '#') { |
printf("title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncovcol, nlstate,ndeath, maxwav, mle, weightopt,model); |
numlinepar++; |
fprintf(ficparo,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol,stepm,ncovcol,nlstate,ndeath,maxwav, mle, weightopt,model); |
fputs(line,stdout); |
fprintf(ficlog,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol,stepm,ncovcol,nlstate,ndeath,maxwav, mle, weightopt,model); |
fputs(line,ficparo); |
|
fputs(line,ficlog); |
|
continue; |
|
}else |
|
break; |
|
} |
|
if((num_filled=sscanf(line,"ftol=%lf stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\n", \ |
|
&ftol, &stepm, &ncovcol, &nlstate, &ndeath, &maxwav, &mle, &weightopt)) !=EOF){ |
|
if (num_filled != 8) { |
|
printf("Not 8 parameters, for example:ftol=1.e-8 stepm=12 ncovcol=2 nlstate=2 ndeath=1 maxwav=3 mle=1 weight=1\n"); |
|
printf("but line=%s\n",line); |
|
} |
|
printf("ftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\n",ftol, stepm, ncovcol, nlstate,ndeath, maxwav, mle, weightopt); |
|
} |
|
/* ftolpl=6*ftol*1.e5; /\* 6.e-3 make convergences in less than 80 loops for the prevalence limit *\/ */ |
|
/*ftolpl=6.e-4; *//* 6.e-3 make convergences in less than 80 loops for the prevalence limit */ |
|
/* Third parameter line */ |
|
while(fgets(line, MAXLINE, ficpar)) { |
|
/* If line starts with a # it is a comment */ |
|
if (line[0] == '#') { |
|
numlinepar++; |
|
fputs(line,stdout); |
|
fputs(line,ficparo); |
|
fputs(line,ficlog); |
|
continue; |
|
}else |
|
break; |
|
} |
|
if((num_filled=sscanf(line,"model=1+age%[^.\n]", model)) !=EOF){ |
|
if (num_filled == 0) |
|
model[0]='\0'; |
|
else if (num_filled != 1){ |
|
printf("ERROR %d: Model should be at minimum 'model=1+age.' %s\n",num_filled, line); |
|
fprintf(ficlog,"ERROR %d: Model should be at minimum 'model=1+age.' %s\n",num_filled, line); |
|
model[0]='\0'; |
|
goto end; |
|
} |
|
else{ |
|
if (model[0]=='+'){ |
|
for(i=1; i<=strlen(model);i++) |
|
modeltemp[i-1]=model[i]; |
|
strcpy(model,modeltemp); |
|
} |
|
} |
|
/* printf(" model=1+age%s modeltemp= %s, model=%s\n",model, modeltemp, model);fflush(stdout); */ |
|
printf("model=1+age+%s\n",model);fflush(stdout); |
|
} |
|
/* fscanf(ficpar,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%lf stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d model=1+age+%s\n",title, datafile, &lastobs, &firstpass,&lastpass,&ftol, &stepm, &ncovcol, &nlstate,&ndeath, &maxwav, &mle, &weightopt,model); */ |
|
/* numlinepar=numlinepar+3; /\* In general *\/ */ |
|
/* printf("title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=1+age+%s\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncovcol, nlstate,ndeath, maxwav, mle, weightopt,model); */ |
|
fprintf(ficparo,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=1+age+%s.\n", title, datafile, lastobs, firstpass,lastpass,ftol,stepm,ncovcol,nlstate,ndeath,maxwav, mle, weightopt,model); |
|
fprintf(ficlog,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle=%d weight=%d\nmodel=1+age+%s.\n", title, datafile, lastobs, firstpass,lastpass,ftol,stepm,ncovcol,nlstate,ndeath,maxwav, mle, weightopt,model); |
fflush(ficlog); |
fflush(ficlog); |
|
/* if(model[0]=='#'|| model[0]== '\0'){ */ |
|
if(model[0]=='#'){ |
|
printf("Error in 'model' line: model should start with 'model=1+age+' and end with '.' \n \ |
|
'model=1+age+.' or 'model=1+age+V1.' or 'model=1+age+age*age+V1+V1*age.' or \n \ |
|
'model=1+age+V1+V2.' or 'model=1+age+V1+V2+V1*V2.' etc. \n"); \ |
|
if(mle != -1){ |
|
printf("Fix the model line and run imach with mle=-1 to get a correct template of the parameter file.\n"); |
|
exit(1); |
|
} |
|
} |
while((c=getc(ficpar))=='#' && c!= EOF){ |
while((c=getc(ficpar))=='#' && c!= EOF){ |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
fgets(line, MAXLINE, ficpar); |
fgets(line, MAXLINE, ficpar); |
numlinepar++; |
numlinepar++; |
puts(line); |
if(line[1]=='q'){ /* This #q will quit imach (the answer is q) */ |
|
z[0]=line[1]; |
|
} |
|
/* printf("****line [1] = %c \n",line[1]); */ |
|
fputs(line, stdout); |
|
//puts(line); |
fputs(line,ficparo); |
fputs(line,ficparo); |
fputs(line,ficlog); |
fputs(line,ficlog); |
} |
} |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
|
|
|
|
covar=matrix(0,NCOVMAX,1,n); |
covar=matrix(0,NCOVMAX,1,n); /**< used in readdata */ |
cptcovn=0; /*Number of covariates, i.e. number of '+' in model statement*/ |
cptcovn=0; /*Number of covariates, i.e. number of '+' in model statement plus one, indepently of n in Vn*/ |
if (strlen(model)>1) cptcovn=nbocc(model,'+')+1; |
/* v1+v2+v3+v2*v4+v5*age makes cptcovn = 5 |
|
v1+v2*age+v2*v3 makes cptcovn = 3 |
ncovmodel=2+cptcovn; /*Number of variables = cptcovn + intercept + age */ |
*/ |
nvar=ncovmodel-1; /* Suppressing age as a basic covariate */ |
if (strlen(model)>1) |
npar= (nlstate+ndeath-1)*nlstate*ncovmodel; /* Number of parameters*/ |
ncovmodel=2+nbocc(model,'+')+1; /*Number of variables including intercept and age = cptcovn + intercept + age : v1+v2+v3+v2*v4+v5*age makes 5+2=7,age*age makes 3*/ |
|
else |
|
ncovmodel=2; /* Constant and age */ |
|
nforce= (nlstate+ndeath-1)*nlstate; /* Number of forces ij from state i to j */ |
|
npar= nforce*ncovmodel; /* Number of parameters like aij*/ |
|
if(npar >MAXPARM || nlstate >NLSTATEMAX || ndeath >NDEATHMAX || ncovmodel>NCOVMAX){ |
|
printf("Too complex model for current IMaCh: npar=(nlstate+ndeath-1)*nlstate*ncovmodel=%d >= %d(MAXPARM) or nlstate=%d >= %d(NLSTATEMAX) or ndeath=%d >= %d(NDEATHMAX) or ncovmodel=(k+age+#of+signs)=%d(NCOVMAX) >= %d\n",npar, MAXPARM, nlstate, NLSTATEMAX, ndeath, NDEATHMAX, ncovmodel, NCOVMAX); |
|
fprintf(ficlog,"Too complex model for current IMaCh: %d >=%d(MAXPARM) or %d >=%d(NLSTATEMAX) or %d >=%d(NDEATHMAX) or %d(NCOVMAX) >=%d\n",npar, MAXPARM, nlstate, NLSTATEMAX, ndeath, NDEATHMAX, ncovmodel, NCOVMAX); |
|
fflush(stdout); |
|
fclose (ficlog); |
|
goto end; |
|
} |
delti3= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncovmodel); |
delti3= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncovmodel); |
delti=delti3[1][1]; |
delti=delti3[1][1]; |
/*delti=vector(1,npar); *//* Scale of each paramater (output from hesscov)*/ |
/*delti=vector(1,npar); *//* Scale of each paramater (output from hesscov)*/ |
if(mle==-1){ /* Print a wizard for help writing covariance matrix */ |
if(mle==-1){ /* Print a wizard for help writing covariance matrix */ |
prwizard(ncovmodel, nlstate, ndeath, model, ficparo); |
prwizard(ncovmodel, nlstate, ndeath, model, ficparo); |
printf(" You choose mle=-1, look at file %s for a template of covariance matrix \n",filereso); |
printf(" You chose mle=-1, look at file %s for a template of covariance matrix \n",filereso); |
fprintf(ficlog," You choose mle=-1, look at file %s for a template of covariance matrix \n",filereso); |
fprintf(ficlog," You chose mle=-1, look at file %s for a template of covariance matrix \n",filereso); |
free_ma3x(delti3,1,nlstate,1, nlstate+ndeath-1,1,ncovmodel); |
free_ma3x(delti3,1,nlstate,1, nlstate+ndeath-1,1,ncovmodel); |
fclose (ficparo); |
fclose (ficparo); |
fclose (ficlog); |
fclose (ficlog); |
|
goto end; |
exit(0); |
exit(0); |
} |
} |
else if(mle==-3) { |
else if(mle==-3) { /* Main Wizard */ |
prwizard(ncovmodel, nlstate, ndeath, model, ficparo); |
prwizard(ncovmodel, nlstate, ndeath, model, ficparo); |
printf(" You choose mle=-3, look at file %s for a template of covariance matrix \n",filereso); |
printf(" You chose mle=-3, look at file %s for a template of covariance matrix \n",filereso); |
fprintf(ficlog," You choose mle=-3, look at file %s for a template of covariance matrix \n",filereso); |
fprintf(ficlog," You chose mle=-3, look at file %s for a template of covariance matrix \n",filereso); |
param= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncovmodel); |
param= ma3x(1,nlstate,1,nlstate+ndeath-1,1,ncovmodel); |
matcov=matrix(1,npar,1,npar); |
matcov=matrix(1,npar,1,npar); |
|
hess=matrix(1,npar,1,npar); |
} |
} |
else{ |
else{ |
/* Read guess parameters */ |
/* Read guessed parameters */ |
/* Reads comments: lines beginning with '#' */ |
/* Reads comments: lines beginning with '#' */ |
while((c=getc(ficpar))=='#' && c!= EOF){ |
while((c=getc(ficpar))=='#' && c!= EOF){ |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
fgets(line, MAXLINE, ficpar); |
fgets(line, MAXLINE, ficpar); |
numlinepar++; |
numlinepar++; |
puts(line); |
fputs(line,stdout); |
fputs(line,ficparo); |
fputs(line,ficparo); |
fputs(line,ficlog); |
fputs(line,ficlog); |
} |
} |
Line 4239 int main(int argc, char *argv[])
|
Line 8147 int main(int argc, char *argv[])
|
if(jj==i) continue; |
if(jj==i) continue; |
j++; |
j++; |
fscanf(ficpar,"%1d%1d",&i1,&j1); |
fscanf(ficpar,"%1d%1d",&i1,&j1); |
if ((i1 != i) && (j1 != j)){ |
if ((i1 != i) || (j1 != jj)){ |
printf("Error in line parameters number %d, %1d%1d instead of %1d%1d \n",numlinepar, i,j, i1, j1); |
printf("Error in line parameters number %d, %1d%1d instead of %1d%1d \n \ |
|
It might be a problem of design; if ncovcol and the model are correct\n \ |
|
run imach with mle=-1 to get a correct template of the parameter file.\n",numlinepar, i,j, i1, j1); |
exit(1); |
exit(1); |
} |
} |
fprintf(ficparo,"%1d%1d",i1,j1); |
fprintf(ficparo,"%1d%1d",i1,j1); |
if(mle==1) |
if(mle==1) |
printf("%1d%1d",i,j); |
printf("%1d%1d",i,jj); |
fprintf(ficlog,"%1d%1d",i,j); |
fprintf(ficlog,"%1d%1d",i,jj); |
for(k=1; k<=ncovmodel;k++){ |
for(k=1; k<=ncovmodel;k++){ |
fscanf(ficpar," %lf",¶m[i][j][k]); |
fscanf(ficpar," %lf",¶m[i][j][k]); |
if(mle==1){ |
if(mle==1){ |
Line 4267 int main(int argc, char *argv[])
|
Line 8177 int main(int argc, char *argv[])
|
} |
} |
fflush(ficlog); |
fflush(ficlog); |
|
|
|
/* Reads scales values */ |
p=param[1][1]; |
p=param[1][1]; |
|
|
/* Reads comments: lines beginning with '#' */ |
/* Reads comments: lines beginning with '#' */ |
Line 4275 int main(int argc, char *argv[])
|
Line 8185 int main(int argc, char *argv[])
|
ungetc(c,ficpar); |
ungetc(c,ficpar); |
fgets(line, MAXLINE, ficpar); |
fgets(line, MAXLINE, ficpar); |
numlinepar++; |
numlinepar++; |
puts(line); |
fputs(line,stdout); |
fputs(line,ficparo); |
fputs(line,ficparo); |
fputs(line,ficlog); |
fputs(line,ficlog); |
} |
} |
Line 4284 int main(int argc, char *argv[])
|
Line 8194 int main(int argc, char *argv[])
|
for(i=1; i <=nlstate; i++){ |
for(i=1; i <=nlstate; i++){ |
for(j=1; j <=nlstate+ndeath-1; j++){ |
for(j=1; j <=nlstate+ndeath-1; j++){ |
fscanf(ficpar,"%1d%1d",&i1,&j1); |
fscanf(ficpar,"%1d%1d",&i1,&j1); |
if ((i1-i)*(j1-j)!=0){ |
if ( (i1-i) * (j1-j) != 0){ |
printf("Error in line parameters number %d, %1d%1d instead of %1d%1d \n",numlinepar, i,j, i1, j1); |
printf("Error in line parameters number %d, %1d%1d instead of %1d%1d \n",numlinepar, i,j, i1, j1); |
exit(1); |
exit(1); |
} |
} |
Line 4306 int main(int argc, char *argv[])
|
Line 8216 int main(int argc, char *argv[])
|
} |
} |
fflush(ficlog); |
fflush(ficlog); |
|
|
|
/* Reads covariance matrix */ |
delti=delti3[1][1]; |
delti=delti3[1][1]; |
|
|
|
|
Line 4316 int main(int argc, char *argv[])
|
Line 8227 int main(int argc, char *argv[])
|
ungetc(c,ficpar); |
ungetc(c,ficpar); |
fgets(line, MAXLINE, ficpar); |
fgets(line, MAXLINE, ficpar); |
numlinepar++; |
numlinepar++; |
puts(line); |
fputs(line,stdout); |
fputs(line,ficparo); |
fputs(line,ficparo); |
fputs(line,ficlog); |
fputs(line,ficlog); |
} |
} |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
|
|
matcov=matrix(1,npar,1,npar); |
matcov=matrix(1,npar,1,npar); |
|
hess=matrix(1,npar,1,npar); |
|
for(i=1; i <=npar; i++) |
|
for(j=1; j <=npar; j++) matcov[i][j]=0.; |
|
|
|
/* Scans npar lines */ |
for(i=1; i <=npar; i++){ |
for(i=1; i <=npar; i++){ |
fscanf(ficpar,"%s",&str); |
count=fscanf(ficpar,"%1d%1d%1d",&i1,&j1,&jk); |
|
if(count != 3){ |
|
printf("Error! Error in parameter file %s at line %d after line starting with %1d%1d%1d\n\ |
|
This is probably because your covariance matrix doesn't \n contain exactly %d lines corresponding to your model line '1+age+%s'.\n\ |
|
Please run with mle=-1 to get a correct covariance matrix.\n",optionfile,numlinepar, i1,j1,jk, npar, model); |
|
fprintf(ficlog,"Error! Error in parameter file %s at line %d after line starting with %1d%1d%1d\n\ |
|
This is probably because your covariance matrix doesn't \n contain exactly %d lines corresponding to your model line '1+age+%s'.\n\ |
|
Please run with mle=-1 to get a correct covariance matrix.\n",optionfile,numlinepar, i1,j1,jk, npar, model); |
|
exit(1); |
|
}else |
if(mle==1) |
if(mle==1) |
printf("%s",str); |
printf("%1d%1d%1d",i1,j1,jk); |
fprintf(ficlog,"%s",str); |
fprintf(ficlog,"%1d%1d%1d",i1,j1,jk); |
fprintf(ficparo,"%s",str); |
fprintf(ficparo,"%1d%1d%1d",i1,j1,jk); |
for(j=1; j <=i; j++){ |
for(j=1; j <=i; j++){ |
fscanf(ficpar," %le",&matcov[i][j]); |
fscanf(ficpar," %le",&matcov[i][j]); |
if(mle==1){ |
if(mle==1){ |
Line 4344 int main(int argc, char *argv[])
|
Line 8269 int main(int argc, char *argv[])
|
fprintf(ficlog,"\n"); |
fprintf(ficlog,"\n"); |
fprintf(ficparo,"\n"); |
fprintf(ficparo,"\n"); |
} |
} |
|
/* End of read covariance matrix npar lines */ |
for(i=1; i <=npar; i++) |
for(i=1; i <=npar; i++) |
for(j=i+1;j<=npar;j++) |
for(j=i+1;j<=npar;j++) |
matcov[i][j]=matcov[j][i]; |
matcov[i][j]=matcov[j][i]; |
Line 4360 int main(int argc, char *argv[])
|
Line 8286 int main(int argc, char *argv[])
|
strcat(rfileres,"."); /* */ |
strcat(rfileres,"."); /* */ |
strcat(rfileres,optionfilext); /* Other files have txt extension */ |
strcat(rfileres,optionfilext); /* Other files have txt extension */ |
if((ficres =fopen(rfileres,"w"))==NULL) { |
if((ficres =fopen(rfileres,"w"))==NULL) { |
printf("Problem writing new parameter file: %s\n", fileres);goto end; |
printf("Problem writing new parameter file: %s\n", rfileres);goto end; |
fprintf(ficlog,"Problem writing new parameter file: %s\n", fileres);goto end; |
fprintf(ficlog,"Problem writing new parameter file: %s\n", rfileres);goto end; |
} |
} |
fprintf(ficres,"#%s\n",version); |
fprintf(ficres,"#%s\n",version); |
} /* End of mle != -3 */ |
} /* End of mle != -3 */ |
|
|
/*-------- data file ----------*/ |
/* Main data |
if((fic=fopen(datafile,"r"))==NULL) { |
*/ |
printf("Problem with datafile: %s\n", datafile);goto end; |
|
fprintf(ficlog,"Problem with datafile: %s\n", datafile);goto end; |
|
} |
|
|
|
n= lastobs; |
n= lastobs; |
severity = vector(1,maxwav); |
|
outcome=imatrix(1,maxwav+1,1,n); |
|
num=lvector(1,n); |
num=lvector(1,n); |
moisnais=vector(1,n); |
moisnais=vector(1,n); |
annais=vector(1,n); |
annais=vector(1,n); |
Line 4386 int main(int argc, char *argv[])
|
Line 8306 int main(int argc, char *argv[])
|
for(i=1;i<=n;i++) weight[i]=1.0; /* Equal weights, 1 by default */ |
for(i=1;i<=n;i++) weight[i]=1.0; /* Equal weights, 1 by default */ |
mint=matrix(1,maxwav,1,n); |
mint=matrix(1,maxwav,1,n); |
anint=matrix(1,maxwav,1,n); |
anint=matrix(1,maxwav,1,n); |
s=imatrix(1,maxwav+1,1,n); |
s=imatrix(1,maxwav+1,1,n); /* s[i][j] health state for wave i and individual j */ |
tab=ivector(1,NCOVMAX); |
tab=ivector(1,NCOVMAX); |
ncodemax=ivector(1,8); |
ncodemax=ivector(1,NCOVMAX); /* Number of code per covariate; if O and 1 only, 2**ncov; V1+V2+V3+V4=>16 */ |
|
ncodemaxwundef=ivector(1,NCOVMAX); /* Number of code per covariate; if - 1 O and 1 only, 2**ncov; V1+V2+V3+V4=>16 */ |
i=1; |
|
while (fgets(line, MAXLINE, fic) != NULL) { |
|
if ((i >= firstobs) && (i <=lastobs)) { |
|
|
|
for (j=maxwav;j>=1;j--){ |
|
cutv(stra, strb,line,' '); s[j][i]=atoi(strb); |
|
strcpy(line,stra); |
|
cutv(stra, strb,line,'/'); anint[j][i]=(double)(atoi(strb)); strcpy(line,stra); |
|
cutv(stra, strb,line,' '); mint[j][i]=(double)(atoi(strb)); strcpy(line,stra); |
|
} |
|
|
|
cutv(stra, strb,line,'/'); andc[i]=(double)(atoi(strb)); strcpy(line,stra); |
|
cutv(stra, strb,line,' '); moisdc[i]=(double)(atoi(strb)); strcpy(line,stra); |
|
|
|
cutv(stra, strb,line,'/'); annais[i]=(double)(atoi(strb)); strcpy(line,stra); |
|
cutv(stra, strb,line,' '); moisnais[i]=(double)(atoi(strb)); strcpy(line,stra); |
|
|
|
cutv(stra, strb,line,' '); weight[i]=(double)(atoi(strb)); strcpy(line,stra); |
/* Reads data from file datafile */ |
for (j=ncovcol;j>=1;j--){ |
if (readdata(datafile, firstobs, lastobs, &imx)==1) |
cutv(stra, strb,line,' '); covar[j][i]=(double)(atoi(strb)); strcpy(line,stra); |
goto end; |
} |
|
lstra=strlen(stra); |
|
if(lstra > 9){ /* More than 2**32 or max of what printf can write with %ld */ |
|
stratrunc = &(stra[lstra-9]); |
|
num[i]=atol(stratrunc); |
|
} |
|
else |
|
num[i]=atol(stra); |
|
|
|
/*if((s[2][i]==2) && (s[3][i]==-1)&&(s[4][i]==9)){ |
|
printf("%ld %.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;}*/ |
|
|
|
i=i+1; |
|
} |
|
} |
|
/* printf("ii=%d", ij); |
|
scanf("%d",i);*/ |
|
imx=i-1; /* Number of individuals */ |
|
|
|
/* for (i=1; i<=imx; i++){ |
|
if ((s[1][i]==3) && (s[2][i]==2)) s[2][i]=3; |
|
if ((s[2][i]==3) && (s[3][i]==2)) s[3][i]=3; |
|
if ((s[3][i]==3) && (s[4][i]==2)) s[4][i]=3; |
|
}*/ |
|
/* for (i=1; i<=imx; i++){ |
|
if (s[4][i]==9) s[4][i]=-1; |
|
printf("%ld %.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]));}*/ |
|
|
|
for (i=1; i<=imx; i++) |
|
|
|
/*if ((s[3][i]==3) || (s[4][i]==3)) weight[i]=0.08; |
|
else weight[i]=1;*/ |
|
|
|
/* Calculation of the number of parameter from char model*/ |
/* Calculation of the number of parameters from char model */ |
Tvar=ivector(1,15); /* stores the number n of the covariates in Vm+Vn at 1 and m at 2 */ |
/* modelsav=V2+V1+V4+age*V3 strb=age*V3 stra=V2+V1+V4 |
Tprod=ivector(1,15); |
k=4 (age*V3) Tvar[k=4]= 3 (from V3) Tag[cptcovage=1]=4 |
Tvaraff=ivector(1,15); |
k=3 V4 Tvar[k=3]= 4 (from V4) |
Tvard=imatrix(1,15,1,2); |
k=2 V1 Tvar[k=2]= 1 (from V1) |
Tage=ivector(1,15); |
k=1 Tvar[1]=2 (from V2) |
|
*/ |
if (strlen(model) >1){ /* If there is at least 1 covariate */ |
Tvar=ivector(1,NCOVMAX); /* Was 15 changed to NCOVMAX. */ |
j=0, j1=0, k1=1, k2=1; |
/* V2+V1+V4+age*V3 is a model with 4 covariates (3 plus signs). |
j=nbocc(model,'+'); /* j=Number of '+' */ |
For each model-covariate stores the data-covariate id. Tvar[1]=2, Tvar[2]=1, Tvar[3]=4, |
j1=nbocc(model,'*'); /* j1=Number of '*' */ |
Tvar[4=age*V3] is 3 and 'age' is recorded in Tage. |
cptcovn=j+1; |
*/ |
cptcovprod=j1; /*Number of products */ |
/* For model-covariate k tells which data-covariate to use but |
|
because this model-covariate is a construction we invent a new column |
strcpy(modelsav,model); |
ncovcol + k1 |
if ((strcmp(model,"age")==0) || (strcmp(model,"age*age")==0)){ |
If already ncovcol=4 and model=V2+V1+V1*V4+age*V3 |
printf("Error. Non available option model=%s ",model); |
Tvar[3=V1*V4]=4+1 etc */ |
fprintf(ficlog,"Error. Non available option model=%s ",model); |
Tprod=ivector(1,NCOVMAX); /* Gives the position of a product */ |
goto end; |
/* Tprod[k1=1]=3(=V1*V4) for V2+V1+V1*V4+age*V3 |
} |
if V2+V1+V1*V4+age*V3+V3*V2 TProd[k1=2]=5 (V3*V2) |
|
*/ |
/* This loop fills the array Tvar from the string 'model'.*/ |
Tvaraff=ivector(1,NCOVMAX); /* Unclear */ |
|
Tvard=imatrix(1,NCOVMAX,1,2); /* n=Tvard[k1][1] and m=Tvard[k1][2] gives the couple n,m of the k1 th product Vn*Vm |
|
* For V3*V2 (in V2+V1+V1*V4+age*V3+V3*V2), V3*V2 position is 2nd. |
|
* Tvard[k1=2][1]=3 (V3) Tvard[k1=2][2]=2(V2) */ |
|
Tage=ivector(1,NCOVMAX); /* Gives the covariate id of covariates associated with age: V2 + V1 + age*V4 + V3*age |
|
4 covariates (3 plus signs) |
|
Tage[1=V3*age]= 4; Tage[2=age*V4] = 3 |
|
*/ |
|
|
for(i=(j+1); i>=1;i--){ |
/* Main decodemodel */ |
cutv(stra,strb,modelsav,'+'); /* keeps in strb after the last + */ |
|
if (nbocc(modelsav,'+')==0) strcpy(strb,modelsav); /* and analyzes it */ |
|
/* printf("i=%d a=%s b=%s sav=%s\n",i, stra,strb,modelsav);*/ |
|
/*scanf("%d",i);*/ |
|
if (strchr(strb,'*')) { /* Model includes a product */ |
|
cutv(strd,strc,strb,'*'); /* strd*strc Vm*Vn (if not *age)*/ |
|
if (strcmp(strc,"age")==0) { /* Vn*age */ |
|
cptcovprod--; |
|
cutv(strb,stre,strd,'V'); |
|
Tvar[i]=atoi(stre); /* computes n in Vn and stores in Tvar*/ |
|
cptcovage++; |
|
Tage[cptcovage]=i; |
|
/*printf("stre=%s ", stre);*/ |
|
} |
|
else if (strcmp(strd,"age")==0) { /* or age*Vn */ |
|
cptcovprod--; |
|
cutv(strb,stre,strc,'V'); |
|
Tvar[i]=atoi(stre); |
|
cptcovage++; |
|
Tage[cptcovage]=i; |
|
} |
|
else { /* Age is not in the model */ |
|
cutv(strb,stre,strc,'V'); /* strc= Vn, stre is n*/ |
|
Tvar[i]=ncovcol+k1; |
|
cutv(strb,strc,strd,'V'); /* strd was Vm, strc is m */ |
|
Tprod[k1]=i; |
|
Tvard[k1][1]=atoi(strc); /* m*/ |
|
Tvard[k1][2]=atoi(stre); /* n */ |
|
Tvar[cptcovn+k2]=Tvard[k1][1]; |
|
Tvar[cptcovn+k2+1]=Tvard[k1][2]; |
|
for (k=1; k<=lastobs;k++) |
|
covar[ncovcol+k1][k]=covar[atoi(stre)][k]*covar[atoi(strc)][k]; |
|
k1++; |
|
k2=k2+2; |
|
} |
|
} |
|
else { /* no more sum */ |
|
/*printf("d=%s c=%s b=%s\n", strd,strc,strb);*/ |
|
/* scanf("%d",i);*/ |
|
cutv(strd,strc,strb,'V'); |
|
Tvar[i]=atoi(strc); |
|
} |
|
strcpy(modelsav,stra); |
|
/*printf("a=%s b=%s sav=%s\n", stra,strb,modelsav); |
|
scanf("%d",i);*/ |
|
} /* end of loop + */ |
|
} /* end model */ |
|
|
|
/*The number n of Vn is stored in Tvar. cptcovage =number of age covariate. Tage gives the position of age. cptcovprod= number of products. |
|
If model=V1+V1*age then Tvar[1]=1 Tvar[2]=1 cptcovage=1 Tage[1]=2 cptcovprod=0*/ |
|
|
|
/* printf("tvar1=%d tvar2=%d tvar3=%d cptcovage=%d Tage=%d",Tvar[1],Tvar[2],Tvar[3],cptcovage,Tage[1]); |
|
printf("cptcovprod=%d ", cptcovprod); |
|
fprintf(ficlog,"cptcovprod=%d ", cptcovprod); |
|
|
|
scanf("%d ",i); |
if(decodemodel(model, lastobs) == 1) |
fclose(fic);*/ |
goto end; |
|
|
|
if((double)(lastobs-imx)/(double)imx > 1.10){ |
|
nbwarn++; |
|
printf("Warning: The value of parameter lastobs=%d is big compared to the \n effective number of cases imx=%d, please adjust, \n otherwise you are allocating more memory than necessary.\n",lastobs, imx); |
|
fprintf(ficlog,"Warning: The value of parameter lastobs=%d is big compared to the \n effective number of cases imx=%d, please adjust, \n otherwise you are allocating more memory than necessary.\n",lastobs, imx); |
|
} |
/* if(mle==1){*/ |
/* if(mle==1){*/ |
if (weightopt != 1) { /* Maximisation without weights*/ |
if (weightopt != 1) { /* Maximisation without weights. We can have weights different from 1 but want no weight*/ |
for(i=1;i<=n;i++) weight[i]=1.0; |
for(i=1;i<=imx;i++) weight[i]=1.0; /* changed to imx */ |
} |
} |
|
|
/*-calculation of age at interview from date of interview and age at death -*/ |
/*-calculation of age at interview from date of interview and age at death -*/ |
agev=matrix(1,maxwav,1,imx); |
agev=matrix(1,maxwav,1,imx); |
|
|
for (i=1; i<=imx; i++) { |
if(calandcheckages(imx, maxwav, &agemin, &agemax, &nberr, &nbwarn) == 1) |
for(m=2; (m<= maxwav); m++) { |
goto end; |
if (((int)mint[m][i]== 99) && (s[m][i] <= nlstate)){ |
|
anint[m][i]=9999; |
|
s[m][i]=-1; |
|
} |
|
if((int)moisdc[i]==99 && (int)andc[i]==9999 && s[m][i]>nlstate){ |
|
nberr++; |
|
printf("Error! Date of death (month %2d and year %4d) of individual %ld on line %d was unknown, you must set an arbitrary year of death or he/she is skipped and results are biased\n",(int)moisdc[i],(int)andc[i],num[i],i); |
|
fprintf(ficlog,"Error! Date of death (month %2d and year %4d) of individual %ld on line %d was unknown, you must set an arbitrary year of death or he/she is skipped and results are biased\n",(int)moisdc[i],(int)andc[i],num[i],i); |
|
s[m][i]=-1; |
|
} |
|
if((int)moisdc[i]==99 && (int)andc[i]!=9999 && s[m][i]>nlstate){ |
|
nberr++; |
|
printf("Error! Month of death of individual %ld on line %d was unknown %2d, you should set it otherwise the information on the death is skipped and results are biased.\n",num[i],i,(int)moisdc[i]); |
|
fprintf(ficlog,"Error! Month of death of individual %ld on line %d was unknown %f, you should set it otherwise the information on the death is skipped and results are biased.\n",num[i],i,moisdc[i]); |
|
s[m][i]=-1; /* We prefer to skip it (and to skip it in version 0.8a1 too */ |
|
} |
|
} |
|
} |
|
|
|
for (i=1; i<=imx; i++) { |
|
agedc[i]=(moisdc[i]/12.+andc[i])-(moisnais[i]/12.+annais[i]); |
|
for(m=firstpass; (m<= lastpass); m++){ |
|
if(s[m][i] >0){ |
|
if (s[m][i] >= nlstate+1) { |
|
if(agedc[i]>0) |
|
if((int)moisdc[i]!=99 && (int)andc[i]!=9999) |
|
agev[m][i]=agedc[i]; |
|
/*if(moisdc[i]==99 && andc[i]==9999) s[m][i]=-1;*/ |
|
else { |
|
if ((int)andc[i]!=9999){ |
|
nbwarn++; |
|
printf("Warning negative age at death: %ld line:%d\n",num[i],i); |
|
fprintf(ficlog,"Warning negative age at death: %ld line:%d\n",num[i],i); |
|
agev[m][i]=-1; |
|
} |
|
} |
|
} |
|
else if(s[m][i] !=9){ /* Standard case, age in fractional |
|
years but with the precision of a |
|
month */ |
|
agev[m][i]=(mint[m][i]/12.+1./24.+anint[m][i])-(moisnais[i]/12.+1./24.+annais[i]); |
|
if((int)mint[m][i]==99 || (int)anint[m][i]==9999) |
|
agev[m][i]=1; |
|
else if(agev[m][i] <agemin){ |
|
agemin=agev[m][i]; |
|
/*printf(" Min anint[%d][%d]=%.2f annais[%d]=%.2f, agemin=%.2f\n",m,i,anint[m][i], i,annais[i], agemin);*/ |
|
} |
|
else if(agev[m][i] >agemax){ |
|
agemax=agev[m][i]; |
|
/* printf(" anint[%d][%d]=%.0f annais[%d]=%.0f, agemax=%.0f\n",m,i,anint[m][i], i,annais[i], agemax);*/ |
|
} |
|
/*agev[m][i]=anint[m][i]-annais[i];*/ |
|
/* agev[m][i] = age[i]+2*m;*/ |
|
} |
|
else { /* =9 */ |
|
agev[m][i]=1; |
|
s[m][i]=-1; |
|
} |
|
} |
|
else /*= 0 Unknown */ |
|
agev[m][i]=1; |
|
} |
|
|
|
} |
|
for (i=1; i<=imx; i++) { |
|
for(m=firstpass; (m<=lastpass); m++){ |
|
if (s[m][i] > (nlstate+ndeath)) { |
|
nberr++; |
|
printf("Error: on wave %d of individual %d status %d > (nlstate+ndeath)=(%d+%d)=%d\n",m,i,s[m][i],nlstate, ndeath, nlstate+ndeath); |
|
fprintf(ficlog,"Error: on wave %d of individual %d status %d > (nlstate+ndeath)=(%d+%d)=%d\n",m,i,s[m][i],nlstate, ndeath, nlstate+ndeath); |
|
goto end; |
|
} |
|
} |
|
} |
|
|
|
/*for (i=1; i<=imx; i++){ |
|
for (m=firstpass; (m<lastpass); m++){ |
|
printf("%ld %d %.lf %d %d\n", num[i],(covar[1][i]),agev[m][i],s[m][i],s[m+1][i]); |
|
} |
|
|
|
}*/ |
|
|
|
|
|
printf("Total number of individuals= %d, Agemin = %.2f, Agemax= %.2f\n\n", imx, agemin, agemax); |
|
fprintf(ficlog,"Total number of individuals= %d, Agemin = %.2f, Agemax= %.2f\n\n", imx, agemin, agemax); |
|
|
|
agegomp=(int)agemin; |
agegomp=(int)agemin; |
free_vector(severity,1,maxwav); |
|
free_imatrix(outcome,1,maxwav+1,1,n); |
|
free_vector(moisnais,1,n); |
free_vector(moisnais,1,n); |
free_vector(annais,1,n); |
free_vector(annais,1,n); |
/* free_matrix(mint,1,maxwav,1,n); |
/* free_matrix(mint,1,maxwav,1,n); |
free_matrix(anint,1,maxwav,1,n);*/ |
free_matrix(anint,1,maxwav,1,n);*/ |
free_vector(moisdc,1,n); |
/* free_vector(moisdc,1,n); */ |
free_vector(andc,1,n); |
/* free_vector(andc,1,n); */ |
|
/* */ |
|
|
wav=ivector(1,imx); |
wav=ivector(1,imx); |
dh=imatrix(1,lastpass-firstpass+1,1,imx); |
/* dh=imatrix(1,lastpass-firstpass+1,1,imx); */ |
bh=imatrix(1,lastpass-firstpass+1,1,imx); |
/* bh=imatrix(1,lastpass-firstpass+1,1,imx); */ |
mw=imatrix(1,lastpass-firstpass+1,1,imx); |
/* mw=imatrix(1,lastpass-firstpass+1,1,imx); */ |
|
dh=imatrix(1,lastpass-firstpass+2,1,imx); /* We are adding a wave if status is unknown at last wave but death occurs after last wave.*/ |
|
bh=imatrix(1,lastpass-firstpass+2,1,imx); |
|
mw=imatrix(1,lastpass-firstpass+2,1,imx); |
|
|
/* Concatenates waves */ |
/* Concatenates waves */ |
|
/* Concatenates waves: wav[i] is the number of effective (useful waves) of individual i. |
|
Death is a valid wave (if date is known). |
|
mw[mi][i] is the number of (mi=1 to wav[i]) effective wave out of mi of individual i |
|
dh[m][i] or dh[mw[mi][i]][i] is the delay between two effective waves m=mw[mi][i] |
|
and mw[mi+1][i]. dh depends on stepm. |
|
*/ |
|
|
concatwav(wav, dh, bh, mw, s, agedc, agev, firstpass, lastpass, imx, nlstate, stepm); |
concatwav(wav, dh, bh, mw, s, agedc, agev, firstpass, lastpass, imx, nlstate, stepm); |
|
/* */ |
|
|
|
free_vector(moisdc,1,n); |
|
free_vector(andc,1,n); |
|
|
/* Routine tricode is to calculate cptcoveff (real number of unique covariates) and to associate covariable number and modality */ |
/* Routine tricode is to calculate cptcoveff (real number of unique covariates) and to associate covariable number and modality */ |
|
|
Tcode=ivector(1,100); |
|
nbcode=imatrix(0,NCOVMAX,0,NCOVMAX); |
nbcode=imatrix(0,NCOVMAX,0,NCOVMAX); |
ncodemax[1]=1; |
ncodemax[1]=1; |
if (cptcovn > 0) tricode(Tvar,nbcode,imx); |
Ndum =ivector(-1,NCOVMAX); |
|
if (ncovmodel-nagesqr > 2 ) /* That is if covariate other than cst, age and age*age */ |
codtab=imatrix(1,100,1,10); /* Cross tabulation to get the order of |
tricode(Tvar,nbcode,imx, Ndum); /**< Fills nbcode[Tvar[j]][l]; */ |
the estimations*/ |
/* Nbcode gives the value of the lth modality (currently 1 to 2) of jth covariate, in |
|
V2+V1*age, there are 3 covariates Tvar[2]=1 (V1).*/ |
|
/* 1 to ncodemax[j] which is the maximum value of this jth covariate */ |
|
|
|
/* codtab=imatrix(1,100,1,10);*/ /* codtab[h,k]=( (h-1) - mod(k-1,2**(k-1) )/2**(k-1) */ |
|
/*printf(" codtab[1,1],codtab[100,10]=%d,%d\n", codtab[1][1],codtabm(100,10));*/ |
|
/* codtab gives the value 1 or 2 of the hth combination of k covariates (1 or 2).*/ |
|
/* nbcode[Tvaraff[j]][codtabm(h,j)]) : if there are only 2 modalities for a covariate j, |
|
* codtabm(h,j) gives its value classified at position h and nbcode gives how it is coded |
|
* (currently 0 or 1) in the data. |
|
* In a loop on h=1 to 2**k, and a loop on j (=1 to k), we get the value of |
|
* corresponding modality (h,j). |
|
*/ |
|
|
h=0; |
h=0; |
|
|
|
|
|
/*if (cptcovn > 0) */ |
|
|
|
|
m=pow(2,cptcoveff); |
m=pow(2,cptcoveff); |
|
|
for(k=1;k<=cptcoveff; k++){ |
/**< codtab(h,k) k = codtab[h,k]=( (h-1) - mod(k-1,2**(k-1) )/2**(k-1) + 1 |
for(i=1; i <=(m/pow(2,k));i++){ |
* For k=4 covariates, h goes from 1 to m=2**k |
for(j=1; j <= ncodemax[k]; j++){ |
* codtabm(h,k)= (1 & (h-1) >> (k-1)) + 1; |
for(cpt=1; cpt <=(m/pow(2,cptcoveff+1-k)); cpt++){ |
* #define codtabm(h,k) (1 & (h-1) >> (k-1))+1 |
h++; |
* h\k 1 2 3 4 |
if (h>m) h=1;codtab[h][k]=j;codtab[h][Tvar[k]]=j; |
*______________________________ |
/* printf("h=%d k=%d j=%d codtab[h][k]=%d tvar[k]=%d \n",h, k,j,codtab[h][k],Tvar[k]);*/ |
* 1 i=1 1 i=1 1 i=1 1 i=1 1 |
} |
* 2 2 1 1 1 |
} |
* 3 i=2 1 2 1 1 |
} |
* 4 2 2 1 1 |
} |
* 5 i=3 1 i=2 1 2 1 |
|
* 6 2 1 2 1 |
|
* 7 i=4 1 2 2 1 |
|
* 8 2 2 2 1 |
|
* 9 i=5 1 i=3 1 i=2 1 2 |
|
* 10 2 1 1 2 |
|
* 11 i=6 1 2 1 2 |
|
* 12 2 2 1 2 |
|
* 13 i=7 1 i=4 1 2 2 |
|
* 14 2 1 2 2 |
|
* 15 i=8 1 2 2 2 |
|
* 16 2 2 2 2 |
|
*/ |
|
/* How to do the opposite? From combination h (=1 to 2**k) how to get the value on the covariates? */ |
|
/* from h=5 and m, we get then number of covariates k=log(m)/log(2)=4 |
|
* and the value of each covariate? |
|
* V1=1, V2=1, V3=2, V4=1 ? |
|
* h-1=4 and 4 is 0100 or reverse 0010, and +1 is 1121 ok. |
|
* h=6, 6-1=5, 5 is 0101, 1010, 2121, V1=2nd, V2=1st, V3=2nd, V4=1st. |
|
* In order to get the real value in the data, we use nbcode |
|
* nbcode[Tvar[3][2nd]]=1 and nbcode[Tvar[4][1]]=0 |
|
* We are keeping this crazy system in order to be able (in the future?) |
|
* to have more than 2 values (0 or 1) for a covariate. |
|
* #define codtabm(h,k) (1 & (h-1) >> (k-1))+1 |
|
* h=6, k=2? h-1=5=0101, reverse 1010, +1=2121, k=2nd position: value is 1: codtabm(6,2)=1 |
|
* bbbbbbbb |
|
* 76543210 |
|
* h-1 00000101 (6-1=5) |
|
*(h-1)>>(k-1)= 00000001 >> (2-1) = 1 right shift |
|
* & |
|
* 1 00000001 (1) |
|
* 00000001 = 1 & ((h-1) >> (k-1)) |
|
* +1= 00000010 =2 |
|
* |
|
* h=14, k=3 => h'=h-1=13, k'=k-1=2 |
|
* h' 1101 =2^3+2^2+0x2^1+2^0 |
|
* >>k' 11 |
|
* & 00000001 |
|
* = 00000001 |
|
* +1 = 00000010=2 = codtabm(14,3) |
|
* Reverse h=6 and m=16? |
|
* cptcoveff=log(16)/log(2)=4 covariate: 6-1=5=0101 reversed=1010 +1=2121 =>V1=2, V2=1, V3=2, V4=1. |
|
* for (j=1 to cptcoveff) Vj=decodtabm(j,h,cptcoveff) |
|
* decodtabm(h,j,cptcoveff)= (((h-1) >> (j-1)) & 1) +1 |
|
* decodtabm(h,j,cptcoveff)= (h <= (1<<cptcoveff)?(((h-1) >> (j-1)) & 1) +1 : -1) |
|
* V3=decodtabm(14,3,2**4)=2 |
|
* h'=13 1101 =2^3+2^2+0x2^1+2^0 |
|
*(h-1) >> (j-1) 0011 =13 >> 2 |
|
* &1 000000001 |
|
* = 000000001 |
|
* +1= 000000010 =2 |
|
* 2211 |
|
* V1=1+1, V2=0+1, V3=1+1, V4=1+1 |
|
* V3=2 |
|
*/ |
|
|
|
/* /\* for(h=1; h <=100 ;h++){ *\/ */ |
|
/* /\* printf("h=%2d ", h); *\/ */ |
|
/* /\* for(k=1; k <=10; k++){ *\/ */ |
|
/* /\* printf("k=%d %d ",k,codtabm(h,k)); *\/ */ |
|
/* /\* codtab[h][k]=codtabm(h,k); *\/ */ |
|
/* /\* } *\/ */ |
|
/* /\* printf("\n"); *\/ */ |
|
/* } */ |
|
/* for(k=1;k<=cptcoveff; k++){ /\* scans any effective covariate *\/ */ |
|
/* for(i=1; i <=pow(2,cptcoveff-k);i++){ /\* i=1 to 8/1=8; i=1 to 8/2=4; i=1 to 8/8=1 *\/ */ |
|
/* for(j=1; j <= ncodemax[k]; j++){ /\* For each modality of this covariate ncodemax=2*\/ */ |
|
/* for(cpt=1; cpt <=pow(2,k-1); cpt++){ /\* cpt=1 to 8/2**(3+1-1 or 3+1-3) =1 or 4 *\/ */ |
|
/* h++; */ |
|
/* if (h>m) */ |
|
/* h=1; */ |
|
/* codtab[h][k]=j; */ |
|
/* /\* codtab[12][3]=1; *\/ */ |
|
/* /\*codtab[h][Tvar[k]]=j;*\/ */ |
|
/* /\* printf("h=%d k=%d j=%d codtab[h][k]=%d Tvar[k]=%d codtab[h][Tvar[k]]=%d \n",h, k,j,codtab[h][k],Tvar[k],codtab[h][Tvar[k]]); *\/ */ |
|
/* } */ |
|
/* } */ |
|
/* } */ |
|
/* } */ |
/* printf("codtab[1][2]=%d codtab[2][2]=%d",codtab[1][2],codtab[2][2]); |
/* printf("codtab[1][2]=%d codtab[2][2]=%d",codtab[1][2],codtab[2][2]); |
codtab[1][2]=1;codtab[2][2]=2; */ |
codtab[1][2]=1;codtab[2][2]=2; */ |
/* for(i=1; i <=m ;i++){ |
/* for(i=1; i <=m ;i++){ */ |
for(k=1; k <=cptcovn; k++){ |
/* for(k=1; k <=cptcovn; k++){ */ |
printf("i=%d k=%d %d %d ",i,k,codtab[i][k], cptcoveff); |
/* printf("i=%d k=%d %d %d ",i,k,codtab[i][k], cptcoveff); */ |
} |
/* } */ |
printf("\n"); |
/* printf("\n"); */ |
} |
/* } */ |
scanf("%d",i);*/ |
/* scanf("%d",i);*/ |
|
|
|
free_ivector(Ndum,-1,NCOVMAX); |
|
|
|
|
|
|
/*------------ gnuplot -------------*/ |
/* Initialisation of ----------- gnuplot -------------*/ |
strcpy(optionfilegnuplot,optionfilefiname); |
strcpy(optionfilegnuplot,optionfilefiname); |
if(mle==-3) |
if(mle==-3) |
strcat(optionfilegnuplot,"-mort"); |
strcat(optionfilegnuplot,"-MORT_"); |
strcat(optionfilegnuplot,".gp"); |
strcat(optionfilegnuplot,".gp"); |
|
|
if((ficgp=fopen(optionfilegnuplot,"w"))==NULL) { |
if((ficgp=fopen(optionfilegnuplot,"w"))==NULL) { |
printf("Problem with file %s",optionfilegnuplot); |
printf("Problem with file %s",optionfilegnuplot); |
} |
} |
else{ |
else{ |
fprintf(ficgp,"\n# %s\n", version); |
fprintf(ficgp,"\n# IMaCh-%s\n", version); |
fprintf(ficgp,"# %s\n", optionfilegnuplot); |
fprintf(ficgp,"# %s\n", optionfilegnuplot); |
fprintf(ficgp,"set missing 'NaNq'\n"); |
//fprintf(ficgp,"set missing 'NaNq'\n"); |
|
fprintf(ficgp,"set datafile missing 'NaNq'\n"); |
} |
} |
/* fclose(ficgp);*/ |
/* fclose(ficgp);*/ |
/*--------- index.htm --------*/ |
|
|
|
|
/* Initialisation of --------- index.htm --------*/ |
|
|
strcpy(optionfilehtm,optionfilefiname); /* Main html file */ |
strcpy(optionfilehtm,optionfilefiname); /* Main html file */ |
if(mle==-3) |
if(mle==-3) |
strcat(optionfilehtm,"-mort"); |
strcat(optionfilehtm,"-MORT_"); |
strcat(optionfilehtm,".htm"); |
strcat(optionfilehtm,".htm"); |
if((fichtm=fopen(optionfilehtm,"w"))==NULL) { |
if((fichtm=fopen(optionfilehtm,"w"))==NULL) { |
printf("Problem with %s \n",optionfilehtm), exit(0); |
printf("Problem with %s \n",optionfilehtm); |
|
exit(0); |
} |
} |
|
|
strcpy(optionfilehtmcov,optionfilefiname); /* Only for matrix of covariance */ |
strcpy(optionfilehtmcov,optionfilefiname); /* Only for matrix of covariance */ |
Line 4703 int main(int argc, char *argv[])
|
Line 8566 int main(int argc, char *argv[])
|
printf("Problem with %s \n",optionfilehtmcov), exit(0); |
printf("Problem with %s \n",optionfilehtmcov), exit(0); |
} |
} |
else{ |
else{ |
fprintf(fichtmcov,"<body>\n<title>IMaCh Cov %s</title>\n <font size=\"2\">%s <br> %s</font> \ |
fprintf(fichtmcov,"<html><head>\n<title>IMaCh Cov %s</title></head>\n <body><font size=\"2\">%s <br> %s</font> \ |
<hr size=\"2\" color=\"#EC5E5E\"> \n\ |
<hr size=\"2\" color=\"#EC5E5E\"> \n\ |
Title=%s <br>Datafile=%s Firstpass=%d Lastpass=%d Stepm=%d Weight=%d Model=%s<br>\n",\ |
Title=%s <br>Datafile=%s Firstpass=%d Lastpass=%d Stepm=%d Weight=%d Model=1+age+%s<br>\n",\ |
fileres,version,fullversion,title,datafile,firstpass,lastpass,stepm, weightopt, model); |
optionfilehtmcov,version,fullversion,title,datafile,firstpass,lastpass,stepm, weightopt, model); |
} |
} |
|
|
fprintf(fichtm,"<body>\n<title>IMaCh %s</title>\n <font size=\"2\">%s <br> %s</font> \ |
fprintf(fichtm,"<html><head>\n<head>\n<meta charset=\"utf-8\"/><meta http-equiv=\"Content-Type\" content=\"text/html; charset=utf-8\" />\n<title>IMaCh %s</title></head>\n <body><font size=\"7\"><a href=http:/euroreves.ined.fr/imach>IMaCh for Interpolated Markov Chain</a> </font><br>\n<font size=\"3\">Sponsored by Copyright (C) 2002-2015 <a href=http://www.ined.fr>INED</a>-EUROREVES-Institut de longévité-2013-2016-Japan Society for the Promotion of Sciences 日本å¦è¡“振興会 (<a href=https://www.jsps.go.jp/english/e-grants/>Grant-in-Aid for Scientific Research 25293121</a>) - <a href=https://software.intel.com/en-us>Intel Software 2015-2018</a></font><br> \ |
<hr size=\"2\" color=\"#EC5E5E\"> \n\ |
<hr size=\"2\" color=\"#EC5E5E\"> \n\ |
Title=%s <br>Datafile=%s Firstpass=%d Lastpass=%d Stepm=%d Weight=%d Model=%s<br>\n\ |
<font size=\"2\">IMaCh-%s <br> %s</font> \ |
|
<hr size=\"2\" color=\"#EC5E5E\"> \n\ |
|
Title=%s <br>Datafile=%s Firstpass=%d Lastpass=%d Stepm=%d Weight=%d Model=1+age+%s<br>\n\ |
\n\ |
\n\ |
<hr size=\"2\" color=\"#EC5E5E\">\ |
<hr size=\"2\" color=\"#EC5E5E\">\ |
<ul><li><h4>Parameter files</h4>\n\ |
<ul><li><h4>Parameter files</h4>\n\ |
|
- Parameter file: <a href=\"%s.%s\">%s.%s</a><br>\n\ |
- Copy of the parameter file: <a href=\"o%s\">o%s</a><br>\n\ |
- Copy of the parameter file: <a href=\"o%s\">o%s</a><br>\n\ |
- Log file of the run: <a href=\"%s\">%s</a><br>\n\ |
- Log file of the run: <a href=\"%s\">%s</a><br>\n\ |
- Gnuplot file name: <a href=\"%s\">%s</a><br>\n\ |
- Gnuplot file name: <a href=\"%s\">%s</a><br>\n\ |
- Date and time at start: %s</ul>\n",\ |
- Date and time at start: %s</ul>\n",\ |
fileres,version,fullversion,title,datafile,firstpass,lastpass,stepm, weightopt, model,\ |
optionfilehtm,version,fullversion,title,datafile,firstpass,lastpass,stepm, weightopt, model,\ |
|
optionfilefiname,optionfilext,optionfilefiname,optionfilext,\ |
fileres,fileres,\ |
fileres,fileres,\ |
filelog,filelog,optionfilegnuplot,optionfilegnuplot,strstart); |
filelog,filelog,optionfilegnuplot,optionfilegnuplot,strstart); |
fflush(fichtm); |
fflush(fichtm); |
|
|
strcpy(pathr,path); |
strcpy(pathr,path); |
strcat(pathr,optionfilefiname); |
strcat(pathr,optionfilefiname); |
|
#ifdef WIN32 |
|
_chdir(optionfilefiname); /* Move to directory named optionfile */ |
|
#else |
chdir(optionfilefiname); /* Move to directory named optionfile */ |
chdir(optionfilefiname); /* Move to directory named optionfile */ |
|
#endif |
|
|
|
|
/* Calculates basic frequencies. Computes observed prevalence at single age |
/* Calculates basic frequencies. Computes observed prevalence at single age |
and prints on file fileres'p'. */ |
and prints on file fileres'p'. */ |
freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx,Tvaraff,nbcode, ncodemax,mint,anint); |
freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx,Tvaraff,nbcode, ncodemax,mint,anint,strstart,\ |
|
firstpass, lastpass, stepm, weightopt, model); |
|
|
fprintf(fichtm,"\n"); |
fprintf(fichtm,"\n"); |
fprintf(fichtm,"<br>Total number of observations=%d <br>\n\ |
fprintf(fichtm,"<br>Total number of observations=%d <br>\n\ |
Line 4749 Interval (in months) between two waves:
|
Line 8622 Interval (in months) between two waves:
|
p=param[1][1]; /* *(*(*(param +1)+1)+0) */ |
p=param[1][1]; /* *(*(*(param +1)+1)+0) */ |
|
|
globpr=0; /* To get the number ipmx of contributions and the sum of weights*/ |
globpr=0; /* To get the number ipmx of contributions and the sum of weights*/ |
|
/* For mortality only */ |
if (mle==-3){ |
if (mle==-3){ |
ximort=matrix(1,NDIM,1,NDIM); |
ximort=matrix(1,NDIM,1,NDIM); |
|
/* ximort=gsl_matrix_alloc(1,NDIM,1,NDIM); */ |
cens=ivector(1,n); |
cens=ivector(1,n); |
ageexmed=vector(1,n); |
ageexmed=vector(1,n); |
agecens=vector(1,n); |
agecens=vector(1,n); |
Line 4758 Interval (in months) between two waves:
|
Line 8633 Interval (in months) between two waves:
|
|
|
for (i=1; i<=imx; i++){ |
for (i=1; i<=imx; i++){ |
dcwave[i]=-1; |
dcwave[i]=-1; |
for (j=1; j<=lastpass; j++) |
for (m=firstpass; m<=lastpass; m++) |
if (s[j][i]>nlstate) { |
if (s[m][i]>nlstate) { |
dcwave[i]=j; |
dcwave[i]=m; |
/* printf("i=%d j=%d s=%d dcwave=%d\n",i,j, s[j][i],dcwave[i]);*/ |
/* printf("i=%d j=%d s=%d dcwave=%d\n",i,j, s[j][i],dcwave[i]);*/ |
break; |
break; |
} |
} |
Line 4769 Interval (in months) between two waves:
|
Line 8644 Interval (in months) between two waves:
|
for (i=1; i<=imx; i++) { |
for (i=1; i<=imx; i++) { |
if (wav[i]>0){ |
if (wav[i]>0){ |
ageexmed[i]=agev[mw[1][i]][i]; |
ageexmed[i]=agev[mw[1][i]][i]; |
j=wav[i];agecens[i]=1.; |
j=wav[i]; |
if (ageexmed[i]>1 & wav[i]>0) agecens[i]=agev[mw[j][i]][i]; |
agecens[i]=1.; |
cens[i]=1; |
|
|
if (ageexmed[i]> 1 && wav[i] > 0){ |
if (ageexmed[i]<1) cens[i]=-1; |
agecens[i]=agev[mw[j][i]][i]; |
if (agedc[i]< AGESUP & agedc[i]>1 & dcwave[i]>firstpass & dcwave[i]<=lastpass) cens[i]=0 ; |
cens[i]= 1; |
|
}else if (ageexmed[i]< 1) |
|
cens[i]= -1; |
|
if (agedc[i]< AGESUP && agedc[i]>1 && dcwave[i]>firstpass && dcwave[i]<=lastpass) |
|
cens[i]=0 ; |
} |
} |
else cens[i]=-1; |
else cens[i]=-1; |
} |
} |
Line 4783 Interval (in months) between two waves:
|
Line 8662 Interval (in months) between two waves:
|
for (j=1;j<=NDIM;j++) |
for (j=1;j<=NDIM;j++) |
ximort[i][j]=(i == j ? 1.0 : 0.0); |
ximort[i][j]=(i == j ? 1.0 : 0.0); |
} |
} |
|
|
p[1]=0.1; p[2]=0.1; |
/*p[1]=0.0268; p[NDIM]=0.083;*/ |
/*printf("%lf %lf", p[1], p[2]);*/ |
/*printf("%lf %lf", p[1], p[2]);*/ |
|
|
|
|
printf("Powell\n"); fprintf(ficlog,"Powell\n"); |
#ifdef GSL |
strcpy(filerespow,"pow-mort"); |
printf("GSL optimization\n"); fprintf(ficlog,"Powell\n"); |
strcat(filerespow,fileres); |
#else |
if((ficrespow=fopen(filerespow,"w"))==NULL) { |
printf("Powell\n"); fprintf(ficlog,"Powell\n"); |
printf("Problem with resultfile: %s\n", filerespow); |
#endif |
fprintf(ficlog,"Problem with resultfile: %s\n", filerespow); |
strcpy(filerespow,"POW-MORT_"); |
} |
strcat(filerespow,fileresu); |
fprintf(ficrespow,"# Powell\n# iter -2*LL"); |
if((ficrespow=fopen(filerespow,"w"))==NULL) { |
/* for (i=1;i<=nlstate;i++) |
printf("Problem with resultfile: %s\n", filerespow); |
for(j=1;j<=nlstate+ndeath;j++) |
fprintf(ficlog,"Problem with resultfile: %s\n", filerespow); |
if(j!=i)fprintf(ficrespow," p%1d%1d",i,j); |
} |
*/ |
#ifdef GSL |
fprintf(ficrespow,"\n"); |
fprintf(ficrespow,"# GSL optimization\n# iter -2*LL"); |
|
#else |
|
fprintf(ficrespow,"# Powell\n# iter -2*LL"); |
|
#endif |
|
/* for (i=1;i<=nlstate;i++) |
|
for(j=1;j<=nlstate+ndeath;j++) |
|
if(j!=i)fprintf(ficrespow," p%1d%1d",i,j); |
|
*/ |
|
fprintf(ficrespow,"\n"); |
|
#ifdef GSL |
|
/* gsl starts here */ |
|
T = gsl_multimin_fminimizer_nmsimplex; |
|
gsl_multimin_fminimizer *sfm = NULL; |
|
gsl_vector *ss, *x; |
|
gsl_multimin_function minex_func; |
|
|
|
/* Initial vertex size vector */ |
|
ss = gsl_vector_alloc (NDIM); |
|
|
|
if (ss == NULL){ |
|
GSL_ERROR_VAL ("failed to allocate space for ss", GSL_ENOMEM, 0); |
|
} |
|
/* Set all step sizes to 1 */ |
|
gsl_vector_set_all (ss, 0.001); |
|
|
|
/* Starting point */ |
|
|
|
x = gsl_vector_alloc (NDIM); |
|
|
|
if (x == NULL){ |
|
gsl_vector_free(ss); |
|
GSL_ERROR_VAL ("failed to allocate space for x", GSL_ENOMEM, 0); |
|
} |
|
|
|
/* Initialize method and iterate */ |
|
/* p[1]=0.0268; p[NDIM]=0.083; */ |
|
/* gsl_vector_set(x, 0, 0.0268); */ |
|
/* gsl_vector_set(x, 1, 0.083); */ |
|
gsl_vector_set(x, 0, p[1]); |
|
gsl_vector_set(x, 1, p[2]); |
|
|
powell(p,ximort,NDIM,ftol,&iter,&fret,gompertz); |
minex_func.f = &gompertz_f; |
|
minex_func.n = NDIM; |
|
minex_func.params = (void *)&p; /* ??? */ |
|
|
|
sfm = gsl_multimin_fminimizer_alloc (T, NDIM); |
|
gsl_multimin_fminimizer_set (sfm, &minex_func, x, ss); |
|
|
|
printf("Iterations beginning .....\n\n"); |
|
printf("Iter. # Intercept Slope -Log Likelihood Simplex size\n"); |
|
|
|
iteri=0; |
|
while (rval == GSL_CONTINUE){ |
|
iteri++; |
|
status = gsl_multimin_fminimizer_iterate(sfm); |
|
|
|
if (status) printf("error: %s\n", gsl_strerror (status)); |
|
fflush(0); |
|
|
|
if (status) |
|
break; |
|
|
|
rval = gsl_multimin_test_size (gsl_multimin_fminimizer_size (sfm), 1e-6); |
|
ssval = gsl_multimin_fminimizer_size (sfm); |
|
|
|
if (rval == GSL_SUCCESS) |
|
printf ("converged to a local maximum at\n"); |
|
|
|
printf("%5d ", iteri); |
|
for (it = 0; it < NDIM; it++){ |
|
printf ("%10.5f ", gsl_vector_get (sfm->x, it)); |
|
} |
|
printf("f() = %-10.5f ssize = %.7f\n", sfm->fval, ssval); |
|
} |
|
|
|
printf("\n\n Please note: Program should be run many times with varying starting points to detemine global maximum\n\n"); |
|
|
|
gsl_vector_free(x); /* initial values */ |
|
gsl_vector_free(ss); /* inital step size */ |
|
for (it=0; it<NDIM; it++){ |
|
p[it+1]=gsl_vector_get(sfm->x,it); |
|
fprintf(ficrespow," %.12lf", p[it]); |
|
} |
|
gsl_multimin_fminimizer_free (sfm); /* p *(sfm.x.data) et p *(sfm.x.data+1) */ |
|
#endif |
|
#ifdef POWELL |
|
powell(p,ximort,NDIM,ftol,&iter,&fret,gompertz); |
|
#endif |
fclose(ficrespow); |
fclose(ficrespow); |
|
|
hesscov(matcov, p, NDIM,delti, 1e-4, gompertz); |
hesscov(matcov, hess, p, NDIM, delti, 1e-4, gompertz); |
|
|
for(i=1; i <=NDIM; i++) |
for(i=1; i <=NDIM; i++) |
for(j=i+1;j<=NDIM;j++) |
for(j=i+1;j<=NDIM;j++) |
matcov[i][j]=matcov[j][i]; |
matcov[i][j]=matcov[j][i]; |
|
|
printf("\nCovariance matrix\n "); |
printf("\nCovariance matrix\n "); |
|
fprintf(ficlog,"\nCovariance matrix\n "); |
for(i=1; i <=NDIM; i++) { |
for(i=1; i <=NDIM; i++) { |
for(j=1;j<=NDIM;j++){ |
for(j=1;j<=NDIM;j++){ |
printf("%f ",matcov[i][j]); |
printf("%f ",matcov[i][j]); |
|
fprintf(ficlog,"%f ",matcov[i][j]); |
} |
} |
printf("\n "); |
printf("\n "); fprintf(ficlog,"\n "); |
} |
} |
|
|
printf("iter=%d MLE=%f Eq=%lf*exp(%lf*(age-%d))\n",iter,-gompertz(p),p[1],p[2],agegomp); |
printf("iter=%d MLE=%f Eq=%lf*exp(%lf*(age-%d))\n",iter,-gompertz(p),p[1],p[2],agegomp); |
for (i=1;i<=NDIM;i++) |
for (i=1;i<=NDIM;i++) { |
printf("%f [%f ; %f]\n",p[i],p[i]-2*sqrt(matcov[i][i]),p[i]+2*sqrt(matcov[i][i])); |
printf("%f [%f ; %f]\n",p[i],p[i]-2*sqrt(matcov[i][i]),p[i]+2*sqrt(matcov[i][i])); |
replace_back_to_slash(pathc,path); /* Even gnuplot wants a / */ |
fprintf(ficlog,"%f [%f ; %f]\n",p[i],p[i]-2*sqrt(matcov[i][i]),p[i]+2*sqrt(matcov[i][i])); |
printinggnuplotmort(fileres, optionfilefiname,ageminpar,agemaxpar,fage, pathc,p); |
} |
|
lsurv=vector(1,AGESUP); |
|
lpop=vector(1,AGESUP); |
|
tpop=vector(1,AGESUP); |
|
lsurv[agegomp]=100000; |
|
|
|
for (k=agegomp;k<=AGESUP;k++) { |
|
agemortsup=k; |
|
if (p[1]*exp(p[2]*(k-agegomp))>1) break; |
|
} |
|
|
|
for (k=agegomp;k<agemortsup;k++) |
|
lsurv[k+1]=lsurv[k]-lsurv[k]*(p[1]*exp(p[2]*(k-agegomp))); |
|
|
|
for (k=agegomp;k<agemortsup;k++){ |
|
lpop[k]=(lsurv[k]+lsurv[k+1])/2.; |
|
sumlpop=sumlpop+lpop[k]; |
|
} |
|
|
|
tpop[agegomp]=sumlpop; |
|
for (k=agegomp;k<(agemortsup-3);k++){ |
|
/* tpop[k+1]=2;*/ |
|
tpop[k+1]=tpop[k]-lpop[k]; |
|
} |
|
|
|
|
printinghtmlmort(fileres,title,datafile, firstpass, lastpass, \ |
printf("\nAge lx qx dx Lx Tx e(x)\n"); |
|
for (k=agegomp;k<(agemortsup-2);k++) |
|
printf("%d %.0lf %lf %.0lf %.0lf %.0lf %lf\n",k,lsurv[k],p[1]*exp(p[2]*(k-agegomp)),(p[1]*exp(p[2]*(k-agegomp)))*lsurv[k],lpop[k],tpop[k],tpop[k]/lsurv[k]); |
|
|
|
|
|
replace_back_to_slash(pathc,pathcd); /* Even gnuplot wants a / */ |
|
if(ageminpar == AGEOVERFLOW ||agemaxpar == AGEOVERFLOW){ |
|
printf("Warning! Error in gnuplot file with ageminpar %f or agemaxpar %f overflow\n\ |
|
This is probably because your parameter file doesn't \n contain the exact number of lines (or columns) corresponding to your model line.\n\ |
|
Please run with mle=-1 to get a correct covariance matrix.\n",ageminpar,agemaxpar); |
|
fprintf(ficlog,"Warning! Error in gnuplot file with ageminpar %f or agemaxpar %f overflow\n\ |
|
This is probably because your parameter file doesn't \n contain the exact number of lines (or columns) corresponding to your model line.\n\ |
|
Please run with mle=-1 to get a correct covariance matrix.\n",ageminpar,agemaxpar); |
|
}else |
|
printinggnuplotmort(fileresu, optionfilefiname,ageminpar,agemaxpar,fage, pathc,p); |
|
printinghtmlmort(fileresu,title,datafile, firstpass, lastpass, \ |
stepm, weightopt,\ |
stepm, weightopt,\ |
model,imx,p,matcov); |
model,imx,p,matcov,agemortsup); |
} /* Endof if mle==-3 */ |
|
|
free_vector(lsurv,1,AGESUP); |
else{ /* For mle >=1 */ |
free_vector(lpop,1,AGESUP); |
|
free_vector(tpop,1,AGESUP); |
|
#ifdef GSL |
|
free_ivector(cens,1,n); |
|
free_vector(agecens,1,n); |
|
free_ivector(dcwave,1,n); |
|
free_matrix(ximort,1,NDIM,1,NDIM); |
|
#endif |
|
} /* Endof if mle==-3 mortality only */ |
|
/* Standard */ |
|
else{ /* For mle !=- 3, could be 0 or 1 or 4 etc. */ |
|
globpr=0;/* Computes sum of likelihood for globpr=1 and funcone */ |
|
/* Computes likelihood for initial parameters, uses funcone to compute gpimx and gsw */ |
likelione(ficres, p, npar, nlstate, &globpr, &ipmx, &sw, &fretone, funcone); /* Prints the contributions to the likelihood */ |
likelione(ficres, p, npar, nlstate, &globpr, &ipmx, &sw, &fretone, funcone); /* Prints the contributions to the likelihood */ |
printf("First Likeli=%12.6f ipmx=%ld sw=%12.6f",fretone,ipmx,sw); |
printf("First Likeli=%12.6f ipmx=%ld sw=%12.6f",fretone,ipmx,sw); |
for (k=1; k<=npar;k++) |
for (k=1; k<=npar;k++) |
printf(" %d %8.5f",k,p[k]); |
printf(" %d %8.5f",k,p[k]); |
printf("\n"); |
printf("\n"); |
globpr=1; /* to print the contributions */ |
if(mle>=1){ /* Could be 1 or 2, Real Maximization */ |
|
/* mlikeli uses func not funcone */ |
|
mlikeli(ficres,p, npar, ncovmodel, nlstate, ftol, func); |
|
} |
|
if(mle==0) {/* No optimization, will print the likelihoods for the datafile */ |
|
globpr=0;/* Computes sum of likelihood for globpr=1 and funcone */ |
|
/* Computes likelihood for initial parameters, uses funcone to compute gpimx and gsw */ |
|
likelione(ficres, p, npar, nlstate, &globpr, &ipmx, &sw, &fretone, funcone); /* Prints the contributions to the likelihood */ |
|
} |
|
globpr=1; /* again, to print the individual contributions using computed gpimx and gsw */ |
likelione(ficres, p, npar, nlstate, &globpr, &ipmx, &sw, &fretone, funcone); /* Prints the contributions to the likelihood */ |
likelione(ficres, p, npar, nlstate, &globpr, &ipmx, &sw, &fretone, funcone); /* Prints the contributions to the likelihood */ |
printf("Second Likeli=%12.6f ipmx=%ld sw=%12.6f",fretone,ipmx,sw); |
printf("Second Likeli=%12.6f ipmx=%ld sw=%12.6f",fretone,ipmx,sw); |
for (k=1; k<=npar;k++) |
for (k=1; k<=npar;k++) |
printf(" %d %8.5f",k,p[k]); |
printf(" %d %8.5f",k,p[k]); |
printf("\n"); |
printf("\n"); |
if(mle>=1){ /* Could be 1 or 2 */ |
|
mlikeli(ficres,p, npar, ncovmodel, nlstate, ftol, func); |
|
} |
|
|
|
/*--------- results files --------------*/ |
/*--------- results files --------------*/ |
fprintf(ficres,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle= 0 weight=%d\nmodel=%s\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncovcol, nlstate, ndeath, maxwav, weightopt,model); |
fprintf(ficres,"title=%s datafile=%s lastobs=%d firstpass=%d lastpass=%d\nftol=%e stepm=%d ncovcol=%d nlstate=%d ndeath=%d maxwav=%d mle= 0 weight=%d\nmodel=1+age+%s.\n", title, datafile, lastobs, firstpass,lastpass,ftol, stepm, ncovcol, nlstate, ndeath, maxwav, weightopt,model); |
|
|
|
|
fprintf(ficres,"# Parameters nlstate*nlstate*ncov a12*1 + b12 * age + ...\n"); |
fprintf(ficres,"# Parameters nlstate*nlstate*ncov a12*1 + b12 * age + ...\n"); |
Line 4861 Interval (in months) between two waves:
|
Line 8883 Interval (in months) between two waves:
|
fprintf(ficlog,"%d%d ",i,k); |
fprintf(ficlog,"%d%d ",i,k); |
fprintf(ficres,"%1d%1d ",i,k); |
fprintf(ficres,"%1d%1d ",i,k); |
for(j=1; j <=ncovmodel; j++){ |
for(j=1; j <=ncovmodel; j++){ |
printf("%f ",p[jk]); |
printf("%12.7f ",p[jk]); |
fprintf(ficlog,"%f ",p[jk]); |
fprintf(ficlog,"%12.7f ",p[jk]); |
fprintf(ficres,"%f ",p[jk]); |
fprintf(ficres,"%12.7f ",p[jk]); |
jk++; |
jk++; |
} |
} |
printf("\n"); |
printf("\n"); |
Line 4872 Interval (in months) between two waves:
|
Line 8894 Interval (in months) between two waves:
|
} |
} |
} |
} |
} |
} |
if(mle!=0){ |
if(mle != 0){ |
/* Computing hessian and covariance matrix */ |
/* Computing hessian and covariance matrix only at a peak of the Likelihood, that is after optimization */ |
ftolhess=ftol; /* Usually correct */ |
ftolhess=ftol; /* Usually correct */ |
hesscov(matcov, p, npar, delti, ftolhess, func); |
hesscov(matcov, hess, p, npar, delti, ftolhess, func); |
} |
printf("Parameters and 95%% confidence intervals\n W is simply the result of the division of the parameter by the square root of covariance of the parameter.\n And Wald-based confidence intervals plus and minus 1.96 * W .\n But be careful that parameters are highly correlated because incidence of disability is highly correlated to incidence of recovery.\n It might be better to visualize the covariance matrix. See the page 'Matrix of variance-covariance of one-step probabilities' and its graphs.\n"); |
|
fprintf(ficlog, "Parameters, Wald tests and Wald-based confidence intervals\n W is simply the result of the division of the parameter by the square root of covariance of the parameter.\n And Wald-based confidence intervals plus and minus 1.96 * W \n It might be better to visualize the covariance matrix. See the page 'Matrix of variance-covariance of one-step probabilities' and its graphs.\n"); |
|
for(i=1,jk=1; i <=nlstate; i++){ |
|
for(k=1; k <=(nlstate+ndeath); k++){ |
|
if (k != i) { |
|
printf("%d%d ",i,k); |
|
fprintf(ficlog,"%d%d ",i,k); |
|
for(j=1; j <=ncovmodel; j++){ |
|
printf("%12.7f W=%8.3f CI=[%12.7f ; %12.7f] ",p[jk], p[jk]/sqrt(matcov[jk][jk]), p[jk]-1.96*sqrt(matcov[jk][jk]),p[jk]+1.96*sqrt(matcov[jk][jk])); |
|
fprintf(ficlog,"%12.7f W=%8.3f CI=[%12.7f ; %12.7f] ",p[jk], p[jk]/sqrt(matcov[jk][jk]), p[jk]-1.96*sqrt(matcov[jk][jk]),p[jk]+1.96*sqrt(matcov[jk][jk])); |
|
jk++; |
|
} |
|
printf("\n"); |
|
fprintf(ficlog,"\n"); |
|
} |
|
} |
|
} |
|
} /* end of hesscov and Wald tests */ |
|
|
|
/* */ |
fprintf(ficres,"# Scales (for hessian or gradient estimation)\n"); |
fprintf(ficres,"# Scales (for hessian or gradient estimation)\n"); |
printf("# Scales (for hessian or gradient estimation)\n"); |
printf("# Scales (for hessian or gradient estimation)\n"); |
fprintf(ficlog,"# Scales (for hessian or gradient estimation)\n"); |
fprintf(ficlog,"# Scales (for hessian or gradient estimation)\n"); |
Line 4900 Interval (in months) between two waves:
|
Line 8941 Interval (in months) between two waves:
|
} |
} |
|
|
fprintf(ficres,"# Covariance matrix \n# 121 Var(a12)\n# 122 Cov(b12,a12) Var(b12)\n# ...\n# 232 Cov(b23,a12) Cov(b23,b12) ... Var (b23)\n"); |
fprintf(ficres,"# Covariance matrix \n# 121 Var(a12)\n# 122 Cov(b12,a12) Var(b12)\n# ...\n# 232 Cov(b23,a12) Cov(b23,b12) ... Var (b23)\n"); |
if(mle>=1) |
if(mle >= 1) /* To big for the screen */ |
printf("# Covariance matrix \n# 121 Var(a12)\n# 122 Cov(b12,a12) Var(b12)\n# ...\n# 232 Cov(b23,a12) Cov(b23,b12) ... Var (b23)\n"); |
printf("# Covariance matrix \n# 121 Var(a12)\n# 122 Cov(b12,a12) Var(b12)\n# ...\n# 232 Cov(b23,a12) Cov(b23,b12) ... Var (b23)\n"); |
fprintf(ficlog,"# Covariance matrix \n# 121 Var(a12)\n# 122 Cov(b12,a12) Var(b12)\n# ...\n# 232 Cov(b23,a12) Cov(b23,b12) ... Var (b23)\n"); |
fprintf(ficlog,"# Covariance matrix \n# 121 Var(a12)\n# 122 Cov(b12,a12) Var(b12)\n# ...\n# 232 Cov(b23,a12) Cov(b23,b12) ... Var (b23)\n"); |
/* # 121 Var(a12)\n\ */ |
/* # 121 Var(a12)\n\ */ |
Line 4963 Interval (in months) between two waves:
|
Line 9004 Interval (in months) between two waves:
|
fprintf(ficres," Var(%s%1d%1d)",ca,i,j); |
fprintf(ficres," Var(%s%1d%1d)",ca,i,j); |
}else{ |
}else{ |
if(mle>=1) |
if(mle>=1) |
printf(" %.5e",matcov[jj][ll]); |
printf(" %.7e",matcov[jj][ll]); |
fprintf(ficlog," %.5e",matcov[jj][ll]); |
fprintf(ficlog," %.7e",matcov[jj][ll]); |
fprintf(ficres," %.5e",matcov[jj][ll]); |
fprintf(ficres," %.7e",matcov[jj][ll]); |
} |
} |
} |
} |
} |
} |
Line 4984 Interval (in months) between two waves:
|
Line 9025 Interval (in months) between two waves:
|
|
|
fflush(ficlog); |
fflush(ficlog); |
fflush(ficres); |
fflush(ficres); |
|
while(fgets(line, MAXLINE, ficpar)) { |
while((c=getc(ficpar))=='#' && c!= EOF){ |
/* If line starts with a # it is a comment */ |
ungetc(c,ficpar); |
if (line[0] == '#') { |
fgets(line, MAXLINE, ficpar); |
numlinepar++; |
puts(line); |
fputs(line,stdout); |
fputs(line,ficparo); |
fputs(line,ficparo); |
} |
fputs(line,ficlog); |
ungetc(c,ficpar); |
continue; |
|
}else |
|
break; |
|
} |
|
|
|
/* while((c=getc(ficpar))=='#' && c!= EOF){ */ |
|
/* ungetc(c,ficpar); */ |
|
/* fgets(line, MAXLINE, ficpar); */ |
|
/* fputs(line,stdout); */ |
|
/* fputs(line,ficparo); */ |
|
/* } */ |
|
/* ungetc(c,ficpar); */ |
|
|
estepm=0; |
estepm=0; |
fscanf(ficpar,"agemin=%lf agemax=%lf bage=%lf fage=%lf estepm=%d\n",&ageminpar,&agemaxpar, &bage, &fage, &estepm); |
if((num_filled=sscanf(line,"agemin=%lf agemax=%lf bage=%lf fage=%lf estepm=%d ftolpl=%lf\n",&ageminpar,&agemaxpar, &bage, &fage, &estepm, &ftolpl)) !=EOF){ |
|
|
|
if (num_filled != 6) { |
|
printf("Not 6 parameters in line, for example:agemin=60 agemax=95 bage=55 fage=95 estepm=24 ftolpl=6e-4\n"); |
|
printf("but line=%s\n",line); |
|
goto end; |
|
} |
|
printf("agemin=%lf agemax=%lf bage=%lf fage=%lf estepm=%d ftolpl=%lf\n",ageminpar,agemaxpar, bage, fage, estepm, ftolpl); |
|
} |
|
/* ftolpl=6*ftol*1.e5; /\* 6.e-3 make convergences in less than 80 loops for the prevalence limit *\/ */ |
|
/*ftolpl=6.e-4;*/ /* 6.e-3 make convergences in less than 80 loops for the prevalence limit */ |
|
|
|
/* fscanf(ficpar,"agemin=%lf agemax=%lf bage=%lf fage=%lf estepm=%d ftolpl=%\n",&ageminpar,&agemaxpar, &bage, &fage, &estepm); */ |
if (estepm==0 || estepm < stepm) estepm=stepm; |
if (estepm==0 || estepm < stepm) estepm=stepm; |
if (fage <= 2) { |
if (fage <= 2) { |
bage = ageminpar; |
bage = ageminpar; |
Line 5002 Interval (in months) between two waves:
|
Line 9066 Interval (in months) between two waves:
|
} |
} |
|
|
fprintf(ficres,"# agemin agemax for life expectancy, bage fage (if mle==0 ie no data nor Max likelihood).\n"); |
fprintf(ficres,"# agemin agemax for life expectancy, bage fage (if mle==0 ie no data nor Max likelihood).\n"); |
fprintf(ficres,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f estepm=%d\n",ageminpar,agemaxpar,bage,fage, estepm); |
fprintf(ficres,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f estepm=%d ftolpl=%e\n",ageminpar,agemaxpar,bage,fage, estepm, ftolpl); |
fprintf(ficparo,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f estepm=%d\n",ageminpar,agemaxpar,bage,fage, estepm); |
fprintf(ficparo,"agemin=%.0f agemax=%.0f bage=%.0f fage=%.0f estepm=%d, ftolpl=%e\n",ageminpar,agemaxpar,bage,fage, estepm, ftolpl); |
|
|
|
/* Other stuffs, more or less useful */ |
while((c=getc(ficpar))=='#' && c!= EOF){ |
while((c=getc(ficpar))=='#' && c!= EOF){ |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
fgets(line, MAXLINE, ficpar); |
fgets(line, MAXLINE, ficpar); |
puts(line); |
fputs(line,stdout); |
fputs(line,ficparo); |
fputs(line,ficparo); |
} |
} |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
Line 5022 Interval (in months) between two waves:
|
Line 9087 Interval (in months) between two waves:
|
while((c=getc(ficpar))=='#' && c!= EOF){ |
while((c=getc(ficpar))=='#' && c!= EOF){ |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
fgets(line, MAXLINE, ficpar); |
fgets(line, MAXLINE, ficpar); |
puts(line); |
fputs(line,stdout); |
fputs(line,ficparo); |
fputs(line,ficparo); |
} |
} |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
Line 5032 Interval (in months) between two waves:
|
Line 9097 Interval (in months) between two waves:
|
dateprev2=anprev2+(mprev2-1)/12.+(jprev2-1)/365.; |
dateprev2=anprev2+(mprev2-1)/12.+(jprev2-1)/365.; |
|
|
fscanf(ficpar,"pop_based=%d\n",&popbased); |
fscanf(ficpar,"pop_based=%d\n",&popbased); |
|
fprintf(ficlog,"pop_based=%d\n",popbased); |
fprintf(ficparo,"pop_based=%d\n",popbased); |
fprintf(ficparo,"pop_based=%d\n",popbased); |
fprintf(ficres,"pop_based=%d\n",popbased); |
fprintf(ficres,"pop_based=%d\n",popbased); |
|
|
while((c=getc(ficpar))=='#' && c!= EOF){ |
while((c=getc(ficpar))=='#' && c!= EOF){ |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
fgets(line, MAXLINE, ficpar); |
fgets(line, MAXLINE, ficpar); |
puts(line); |
fputs(line,stdout); |
fputs(line,ficparo); |
fputs(line,ficparo); |
} |
} |
ungetc(c,ficpar); |
ungetc(c,ficpar); |
Line 5050 Interval (in months) between two waves:
|
Line 9116 Interval (in months) between two waves:
|
fprintf(ficres,"prevforecast=%d starting-proj-date=%.lf/%.lf/%.lf final-proj-date=%.lf/%.lf/%.lf mobil_average=%d\n",prevfcast,jproj1,mproj1,anproj1,jproj2,mproj2,anproj2,mobilavproj); |
fprintf(ficres,"prevforecast=%d starting-proj-date=%.lf/%.lf/%.lf final-proj-date=%.lf/%.lf/%.lf mobil_average=%d\n",prevfcast,jproj1,mproj1,anproj1,jproj2,mproj2,anproj2,mobilavproj); |
/* day and month of proj2 are not used but only year anproj2.*/ |
/* day and month of proj2 are not used but only year anproj2.*/ |
|
|
|
while((c=getc(ficpar))=='#' && c!= EOF){ |
|
ungetc(c,ficpar); |
|
fgets(line, MAXLINE, ficpar); |
|
fputs(line,stdout); |
|
fputs(line,ficparo); |
|
} |
|
ungetc(c,ficpar); |
|
|
|
fscanf(ficpar,"backcast=%d starting-back-date=%lf/%lf/%lf final-back-date=%lf/%lf/%lf mobil_average=%d\n",&backcast,&jback1,&mback1,&anback1,&jback2,&mback2,&anback2,&mobilavproj); |
|
fscanf(ficparo,"backcast=%d starting-back-date=%lf/%lf/%lf final-back-date=%lf/%lf/%lf mobil_average=%d\n",&backcast,&jback1,&mback1,&anback1,&jback2,&mback2,&anback2,&mobilavproj); |
|
fscanf(ficlog,"backcast=%d starting-back-date=%lf/%lf/%lf final-back-date=%lf/%lf/%lf mobil_average=%d\n",&backcast,&jback1,&mback1,&anback1,&jback2,&mback2,&anback2,&mobilavproj); |
|
fscanf(ficres,"backcast=%d starting-back-date=%lf/%lf/%lf final-back-date=%lf/%lf/%lf mobil_average=%d\n",&backcast,&jback1,&mback1,&anback1,&jback2,&mback2,&anback2,&mobilavproj); |
|
/* day and month of proj2 are not used but only year anproj2.*/ |
|
|
/* freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx,Tvaraff,nbcode, ncodemax,mint,anint);*/ |
|
/*,dateprev1,dateprev2,jprev1, mprev1,anprev1,jprev2, mprev2,anprev2);*/ |
|
|
|
replace_back_to_slash(pathc,path); /* Even gnuplot wants a / */ |
/* freqsummary(fileres, agemin, agemax, s, agev, nlstate, imx,Tvaraff,nbcode, ncodemax,mint,anint); */ |
printinggnuplot(fileres, optionfilefiname,ageminpar,agemaxpar,fage, pathc,p); |
/* ,dateprev1,dateprev2,jprev1, mprev1,anprev1,jprev2, mprev2,anprev2); */ |
|
|
printinghtml(fileres,title,datafile, firstpass, lastpass, stepm, weightopt,\ |
replace_back_to_slash(pathc,pathcd); /* Even gnuplot wants a / */ |
model,imx,jmin,jmax,jmean,rfileres,popforecast,estepm,\ |
if(ageminpar == AGEOVERFLOW ||agemaxpar == -AGEOVERFLOW){ |
jprev1,mprev1,anprev1,jprev2,mprev2,anprev2); |
printf("Warning! Error in gnuplot file with ageminpar %f or agemaxpar %f overflow\n\ |
|
This is probably because your parameter file doesn't \n contain the exact number of lines (or columns) corresponding to your model line.\n\ |
|
Please run with mle=-1 to get a correct covariance matrix.\n",ageminpar,agemaxpar); |
|
fprintf(ficlog,"Warning! Error in gnuplot file with ageminpar %f or agemaxpar %f overflow\n\ |
|
This is probably because your parameter file doesn't \n contain the exact number of lines (or columns) corresponding to your model line.\n\ |
|
Please run with mle=-1 to get a correct covariance matrix.\n",ageminpar,agemaxpar); |
|
}else |
|
printinggnuplot(fileresu, optionfilefiname,ageminpar,agemaxpar,fage, prevfcast, pathc,p); |
|
|
|
printinghtml(fileresu,title,datafile, firstpass, lastpass, stepm, weightopt,\ |
|
model,imx,jmin,jmax,jmean,rfileres,popforecast,prevfcast,backcast, estepm, \ |
|
jprev1,mprev1,anprev1,dateprev1,jprev2,mprev2,anprev2,dateprev2); |
|
|
/*------------ free_vector -------------*/ |
/*------------ free_vector -------------*/ |
/* chdir(path); */ |
/* chdir(path); */ |
|
|
free_ivector(wav,1,imx); |
/* free_ivector(wav,1,imx); */ /* Moved after last prevalence call */ |
free_imatrix(dh,1,lastpass-firstpass+1,1,imx); |
/* free_imatrix(dh,1,lastpass-firstpass+2,1,imx); */ |
free_imatrix(bh,1,lastpass-firstpass+1,1,imx); |
/* free_imatrix(bh,1,lastpass-firstpass+2,1,imx); */ |
free_imatrix(mw,1,lastpass-firstpass+1,1,imx); |
/* free_imatrix(mw,1,lastpass-firstpass+2,1,imx); */ |
free_lvector(num,1,n); |
free_lvector(num,1,n); |
free_vector(agedc,1,n); |
free_vector(agedc,1,n); |
/*free_matrix(covar,0,NCOVMAX,1,n);*/ |
/*free_matrix(covar,0,NCOVMAX,1,n);*/ |
Line 5077 Interval (in months) between two waves:
|
Line 9164 Interval (in months) between two waves:
|
fclose(ficres); |
fclose(ficres); |
|
|
|
|
/*--------------- Prevalence limit (stable prevalence) --------------*/ |
/* Other results (useful)*/ |
|
|
strcpy(filerespl,"pl"); |
|
strcat(filerespl,fileres); |
|
if((ficrespl=fopen(filerespl,"w"))==NULL) { |
|
printf("Problem with stable prevalence resultfile: %s\n", filerespl);goto end; |
|
fprintf(ficlog,"Problem with stable prevalence resultfile: %s\n", filerespl);goto end; |
|
} |
|
printf("Computing stable prevalence: result on file '%s' \n", filerespl); |
|
fprintf(ficlog,"Computing stable prevalence: result on file '%s' \n", filerespl); |
|
fprintf(ficrespl,"#Stable prevalence \n"); |
|
fprintf(ficrespl,"#Age "); |
|
for(i=1; i<=nlstate;i++) fprintf(ficrespl,"%d-%d ",i,i); |
|
fprintf(ficrespl,"\n"); |
|
|
|
prlim=matrix(1,nlstate,1,nlstate); |
|
|
|
agebase=ageminpar; |
|
agelim=agemaxpar; |
|
ftolpl=1.e-10; |
|
i1=cptcoveff; |
|
if (cptcovn < 1){i1=1;} |
|
|
|
for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
/*--------------- Prevalence limit (period or stable prevalence) --------------*/ |
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){ |
/*#include "prevlim.h"*/ /* Use ficrespl, ficlog */ |
k=k+1; |
prlim=matrix(1,nlstate,1,nlstate); |
/*printf("cptcov=%d cptcod=%d codtab=%d nbcode=%d\n",cptcov, cptcod,Tcode[cptcode],codtab[cptcod][cptcov]);*/ |
prevalence_limit(p, prlim, ageminpar, agemaxpar, ftolpl, &ncvyear); |
fprintf(ficrespl,"\n#******"); |
|
printf("\n#******"); |
|
fprintf(ficlog,"\n#******"); |
|
for(j=1;j<=cptcoveff;j++) { |
|
fprintf(ficrespl," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
|
printf(" V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
|
fprintf(ficlog," V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
|
} |
|
fprintf(ficrespl,"******\n"); |
|
printf("******\n"); |
|
fprintf(ficlog,"******\n"); |
|
|
|
for (age=agebase; age<=agelim; age++){ |
|
prevalim(prlim, nlstate, p, age, oldm, savm,ftolpl,k); |
|
fprintf(ficrespl,"%.0f ",age ); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficrespl,"%d %d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
|
for(i=1; i<=nlstate;i++) |
|
fprintf(ficrespl," %.5f", prlim[i][i]); |
|
fprintf(ficrespl,"\n"); |
|
} |
|
} |
|
} |
|
fclose(ficrespl); |
fclose(ficrespl); |
|
|
/*------------- h Pij x at various ages ------------*/ |
/*--------------- Back Prevalence limit (period or stable prevalence) --------------*/ |
|
/*#include "prevlim.h"*/ /* Use ficresplb, ficlog */ |
strcpy(filerespij,"pij"); strcat(filerespij,fileres); |
bprlim=matrix(1,nlstate,1,nlstate); |
if((ficrespij=fopen(filerespij,"w"))==NULL) { |
back_prevalence_limit(p, bprlim, ageminpar, agemaxpar, ftolpl, &ncvyear); |
printf("Problem with Pij resultfile: %s\n", filerespij);goto end; |
fclose(ficresplb); |
fprintf(ficlog,"Problem with Pij resultfile: %s\n", filerespij);goto end; |
|
} |
|
printf("Computing pij: result on file '%s' \n", filerespij); |
|
fprintf(ficlog,"Computing pij: result on file '%s' \n", filerespij); |
|
|
|
stepsize=(int) (stepm+YEARM-1)/YEARM; |
|
/*if (stepm<=24) stepsize=2;*/ |
|
|
|
agelim=AGESUP; |
|
hstepm=stepsize*YEARM; /* Every year of age */ |
|
hstepm=hstepm/stepm; /* Typically 2 years, = 2/6 months = 4 */ |
|
|
|
/* hstepm=1; aff par mois*/ |
|
|
|
fprintf(ficrespij,"#****** h Pij x Probability to be in state j at age x+h being in i at x "); |
|
for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
#ifdef FREEEXIT2 |
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){ |
#include "freeexit2.h" |
k=k+1; |
#endif |
fprintf(ficrespij,"\n#****** "); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficrespij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
|
fprintf(ficrespij,"******\n"); |
|
|
|
for (agedeb=fage; agedeb>=bage; agedeb--){ /* If stepm=6 months */ |
|
nhstepm=(int) rint((agelim-agedeb)*YEARM/stepm); /* Typically 20 years = 20*12/6=40 */ |
|
nhstepm = nhstepm/hstepm; /* Typically 40/4=10 */ |
|
|
|
/* nhstepm=nhstepm*YEARM; aff par mois*/ |
/*------------- h Pij x at various ages ------------*/ |
|
/*#include "hpijx.h"*/ |
|
hPijx(p, bage, fage); |
|
fclose(ficrespij); |
|
|
p3mat=ma3x(1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
hBijx(p, bage, fage); |
oldm=oldms;savm=savms; |
fclose(ficrespijb); |
hpxij(p3mat,nhstepm,agedeb,hstepm,p,nlstate,stepm,oldm,savm, k); |
|
fprintf(ficrespij,"# Cov Agex agex+h hpijx with i,j="); |
|
for(i=1; i<=nlstate;i++) |
|
for(j=1; j<=nlstate+ndeath;j++) |
|
fprintf(ficrespij," %1d-%1d",i,j); |
|
fprintf(ficrespij,"\n"); |
|
for (h=0; h<=nhstepm; h++){ |
|
fprintf(ficrespij,"%d %3.f %3.f",k,agedeb, agedeb+ h*hstepm/YEARM*stepm ); |
|
for(i=1; i<=nlstate;i++) |
|
for(j=1; j<=nlstate+ndeath;j++) |
|
fprintf(ficrespij," %.5f", p3mat[i][j][h]); |
|
fprintf(ficrespij,"\n"); |
|
} |
|
free_ma3x(p3mat,1,nlstate+ndeath,1, nlstate+ndeath, 0,nhstepm); |
|
fprintf(ficrespij,"\n"); |
|
} |
|
} |
|
} |
|
|
|
varprob(optionfilefiname, matcov, p, delti, nlstate, bage, fage,k,Tvar,nbcode, ncodemax); |
/*-------------- Variance of one-step probabilities---*/ |
|
k=1; |
|
varprob(optionfilefiname, matcov, p, delti, nlstate, bage, fage,k,Tvar,nbcode, ncodemax,strstart); |
|
|
fclose(ficrespij); |
|
|
|
probs= ma3x(1,AGESUP,1,NCOVMAX, 1,NCOVMAX); |
probs= ma3x(1,AGESUP,1,NCOVMAX, 1,NCOVMAX); |
for(i=1;i<=AGESUP;i++) |
for(i=1;i<=AGESUP;i++) |
Line 5198 Interval (in months) between two waves:
|
Line 9207 Interval (in months) between two waves:
|
/*if((stepm == 1) && (strcmp(model,".")==0)){*/ |
/*if((stepm == 1) && (strcmp(model,".")==0)){*/ |
if(prevfcast==1){ |
if(prevfcast==1){ |
/* if(stepm ==1){*/ |
/* if(stepm ==1){*/ |
prevforecast(fileres, anproj1, mproj1, jproj1, agemin, agemax, dateprev1, dateprev2, mobilavproj, bage, fage, firstpass, lastpass, anproj2, p, cptcoveff); |
prevforecast(fileresu, anproj1, mproj1, jproj1, agemin, agemax, dateprev1, dateprev2, mobilavproj, bage, fage, firstpass, lastpass, anproj2, p, cptcoveff); |
/* (popforecast==1) populforecast(fileres, anpyram,mpyram,jpyram, agemin,agemax, dateprev1, dateprev2,mobilav, agedeb, fage, popforecast, popfile, anpyram1,p, i1);*/ |
|
/* } */ |
|
/* else{ */ |
|
/* erreur=108; */ |
|
/* printf("Warning %d!! You can only forecast the prevalences if the optimization\n has been performed with stepm = 1 (month) instead of %d or model=. instead of '%s'\n", erreur, stepm, model); */ |
|
/* fprintf(ficlog,"Warning %d!! You can only forecast the prevalences if the optimization\n has been performed with stepm = 1 (month) instead of %d or model=. instead of '%s'\n", erreur, stepm, model); */ |
|
/* } */ |
|
} |
|
|
|
|
|
/*---------- Health expectancies and variances ------------*/ |
|
|
|
strcpy(filerest,"t"); |
|
strcat(filerest,fileres); |
|
if((ficrest=fopen(filerest,"w"))==NULL) { |
|
printf("Problem with total LE resultfile: %s\n", filerest);goto end; |
|
fprintf(ficlog,"Problem with total LE resultfile: %s\n", filerest);goto end; |
|
} |
|
printf("Computing Total LEs with variances: file '%s' \n", filerest); |
|
fprintf(ficlog,"Computing Total LEs with variances: file '%s' \n", filerest); |
|
|
|
|
|
strcpy(filerese,"e"); |
|
strcat(filerese,fileres); |
|
if((ficreseij=fopen(filerese,"w"))==NULL) { |
|
printf("Problem with Health Exp. resultfile: %s\n", filerese); exit(0); |
|
fprintf(ficlog,"Problem with Health Exp. resultfile: %s\n", filerese); exit(0); |
|
} |
} |
printf("Computing Health Expectancies: result on file '%s' \n", filerese); |
if(backcast==1){ |
fprintf(ficlog,"Computing Health Expectancies: result on file '%s' \n", filerese); |
prevbackforecast(fileresu, anback1, mback1, jback1, agemin, agemax, dateprev1, dateprev2, mobilavproj, bage, fage, firstpass, lastpass, anback2, p, cptcoveff); |
|
|
strcpy(fileresv,"v"); |
|
strcat(fileresv,fileres); |
|
if((ficresvij=fopen(fileresv,"w"))==NULL) { |
|
printf("Problem with variance resultfile: %s\n", fileresv);exit(0); |
|
fprintf(ficlog,"Problem with variance resultfile: %s\n", fileresv);exit(0); |
|
} |
} |
printf("Computing Variance-covariance of DFLEs: file '%s' \n", fileresv); |
/* (popforecast==1) populforecast(fileres, anpyram,mpyram,jpyram, agemin,agemax, dateprev1, dateprev2,mobilav, agedeb, fage, popforecast, popfile, anpyram1,p, i1);*/ |
fprintf(ficlog,"Computing Variance-covariance of DFLEs: file '%s' \n", fileresv); |
/* } */ |
|
/* else{ */ |
|
/* erreur=108; */ |
|
/* printf("Warning %d!! You can only forecast the prevalences if the optimization\n has been performed with stepm = 1 (month) instead of %d or model=. instead of '%s'\n", erreur, stepm, model); */ |
|
/* fprintf(ficlog,"Warning %d!! You can only forecast the prevalences if the optimization\n has been performed with stepm = 1 (month) instead of %d or model=. instead of '%s'\n", erreur, stepm, model); */ |
|
/* } */ |
|
|
|
|
|
/* ------ Other prevalence ratios------------ */ |
|
|
/* Computes prevalence between agemin (i.e minimal age computed) and no more ageminpar */ |
/* Computes prevalence between agemin (i.e minimal age computed) and no more ageminpar */ |
|
|
prevalence(probs, agemin, agemax, s, agev, nlstate, imx, Tvar, nbcode, ncodemax, mint, anint, dateprev1, dateprev2, firstpass, lastpass); |
prevalence(probs, agemin, agemax, s, agev, nlstate, imx, Tvar, nbcode, ncodemax, mint, anint, dateprev1, dateprev2, firstpass, lastpass); |
/* printf("ageminpar=%f, agemax=%f, s[lastpass][imx]=%d, agev[lastpass][imx]=%f, nlstate=%d, imx=%d, mint[lastpass][imx]=%f, anint[lastpass][imx]=%f,dateprev1=%f, dateprev2=%f, firstpass=%d, lastpass=%d\n",\ |
/* printf("ageminpar=%f, agemax=%f, s[lastpass][imx]=%d, agev[lastpass][imx]=%f, nlstate=%d, imx=%d, mint[lastpass][imx]=%f, anint[lastpass][imx]=%f,dateprev1=%f, dateprev2=%f, firstpass=%d, lastpass=%d\n",\ |
ageminpar, agemax, s[lastpass][imx], agev[lastpass][imx], nlstate, imx, mint[lastpass][imx],anint[lastpass][imx], dateprev1, dateprev2, firstpass, lastpass); |
ageminpar, agemax, s[lastpass][imx], agev[lastpass][imx], nlstate, imx, mint[lastpass][imx],anint[lastpass][imx], dateprev1, dateprev2, firstpass, lastpass); |
*/ |
*/ |
|
free_ivector(wav,1,imx); |
|
free_imatrix(dh,1,lastpass-firstpass+2,1,imx); |
|
free_imatrix(bh,1,lastpass-firstpass+2,1,imx); |
|
free_imatrix(mw,1,lastpass-firstpass+2,1,imx); |
|
|
|
|
if (mobilav!=0) { |
if (mobilav!=0) { |
mobaverage= ma3x(1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
mobaverage= ma3x(1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
Line 5253 Interval (in months) between two waves:
|
Line 9243 Interval (in months) between two waves:
|
} |
} |
} |
} |
|
|
for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
|
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){ |
|
k=k+1; |
|
fprintf(ficrest,"\n#****** "); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficrest,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
|
fprintf(ficrest,"******\n"); |
|
|
|
|
/*---------- Health expectancies, no variances ------------*/ |
|
|
|
strcpy(filerese,"E_"); |
|
strcat(filerese,fileresu); |
|
if((ficreseij=fopen(filerese,"w"))==NULL) { |
|
printf("Problem with Health Exp. resultfile: %s\n", filerese); exit(0); |
|
fprintf(ficlog,"Problem with Health Exp. resultfile: %s\n", filerese); exit(0); |
|
} |
|
printf("Computing Health Expectancies: result on file '%s' ...", filerese);fflush(stdout); |
|
fprintf(ficlog,"Computing Health Expectancies: result on file '%s' ...", filerese);fflush(ficlog); |
|
/*for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
|
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){*/ |
|
|
|
for (k=1; k <= (int) pow(2,cptcoveff); k++){ |
fprintf(ficreseij,"\n#****** "); |
fprintf(ficreseij,"\n#****** "); |
for(j=1;j<=cptcoveff;j++) |
for(j=1;j<=cptcoveff;j++) { |
fprintf(ficreseij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
fprintf(ficreseij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
} |
fprintf(ficreseij,"******\n"); |
fprintf(ficreseij,"******\n"); |
|
|
fprintf(ficresvij,"\n#****** "); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficresvij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
|
fprintf(ficresvij,"******\n"); |
|
|
|
eij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage); |
eij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage); |
oldm=oldms;savm=savms; |
oldm=oldms;savm=savms; |
evsij(fileres, eij, p, nlstate, stepm, (int) bage, (int)fage, oldm, savm, k, estepm, delti, matcov); |
evsij(eij, p, nlstate, stepm, (int) bage, (int)fage, oldm, savm, k, estepm, strstart); |
|
|
vareij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage); |
free_ma3x(eij,1,nlstate,1,nlstate,(int) bage, (int)fage); |
oldm=oldms;savm=savms; |
/*}*/ |
varevsij(optionfilefiname, vareij, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl,k, estepm, cptcov,cptcod,0, mobilav); |
} |
if(popbased==1){ |
fclose(ficreseij); |
varevsij(optionfilefiname, vareij, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl,k, estepm, cptcov,cptcod,popbased,mobilav); |
printf("done evsij\n");fflush(stdout); |
} |
fprintf(ficlog,"done evsij\n");fflush(ficlog); |
|
|
|
/*---------- Health expectancies and variances ------------*/ |
fprintf(ficrest,"#Total LEs with variances: e.. (std) "); |
|
|
|
|
strcpy(filerest,"T_"); |
|
strcat(filerest,fileresu); |
|
if((ficrest=fopen(filerest,"w"))==NULL) { |
|
printf("Problem with total LE resultfile: %s\n", filerest);goto end; |
|
fprintf(ficlog,"Problem with total LE resultfile: %s\n", filerest);goto end; |
|
} |
|
printf("Computing Total Life expectancies with their standard errors: file '%s' ...\n", filerest); fflush(stdout); |
|
fprintf(ficlog,"Computing Total Life expectancies with their standard errors: file '%s' ...\n", filerest); fflush(ficlog); |
|
|
|
|
|
strcpy(fileresstde,"STDE_"); |
|
strcat(fileresstde,fileresu); |
|
if((ficresstdeij=fopen(fileresstde,"w"))==NULL) { |
|
printf("Problem with Health Exp. and std errors resultfile: %s\n", fileresstde); exit(0); |
|
fprintf(ficlog,"Problem with Health Exp. and std errors resultfile: %s\n", fileresstde); exit(0); |
|
} |
|
printf(" Computing Health Expectancies and standard errors: result on file '%s' \n", fileresstde); |
|
fprintf(ficlog," Computing Health Expectancies and standard errors: result on file '%s' \n", fileresstde); |
|
|
|
strcpy(filerescve,"CVE_"); |
|
strcat(filerescve,fileresu); |
|
if((ficrescveij=fopen(filerescve,"w"))==NULL) { |
|
printf("Problem with Covar. Health Exp. resultfile: %s\n", filerescve); exit(0); |
|
fprintf(ficlog,"Problem with Covar. Health Exp. resultfile: %s\n", filerescve); exit(0); |
|
} |
|
printf(" Computing Covar. of Health Expectancies: result on file '%s' \n", filerescve); |
|
fprintf(ficlog," Computing Covar. of Health Expectancies: result on file '%s' \n", filerescve); |
|
|
|
strcpy(fileresv,"V_"); |
|
strcat(fileresv,fileresu); |
|
if((ficresvij=fopen(fileresv,"w"))==NULL) { |
|
printf("Problem with variance resultfile: %s\n", fileresv);exit(0); |
|
fprintf(ficlog,"Problem with variance resultfile: %s\n", fileresv);exit(0); |
|
} |
|
printf(" Computing Variance-covariance of DFLEs: file '%s' ... ", fileresv);fflush(stdout); |
|
fprintf(ficlog," Computing Variance-covariance of DFLEs: file '%s' ... ", fileresv);fflush(ficlog); |
|
|
|
/*for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
|
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){*/ |
|
|
|
for (k=1; k <= (int) pow(2,cptcoveff); k++){ |
|
fprintf(ficrest,"\n#****** "); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficrest,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
fprintf(ficrest,"******\n"); |
|
|
|
fprintf(ficresstdeij,"\n#****** "); |
|
fprintf(ficrescveij,"\n#****** "); |
|
for(j=1;j<=cptcoveff;j++) { |
|
fprintf(ficresstdeij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
fprintf(ficrescveij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
} |
|
fprintf(ficresstdeij,"******\n"); |
|
fprintf(ficrescveij,"******\n"); |
|
|
|
fprintf(ficresvij,"\n#****** "); |
|
for(j=1;j<=cptcoveff;j++) |
|
fprintf(ficresvij,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
|
fprintf(ficresvij,"******\n"); |
|
|
|
eij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage); |
|
oldm=oldms;savm=savms; |
|
printf(" cvevsij %d, ",k); |
|
fprintf(ficlog, " cvevsij %d, ",k); |
|
cvevsij(eij, p, nlstate, stepm, (int) bage, (int)fage, oldm, savm, k, estepm, delti, matcov, strstart); |
|
printf(" end cvevsij \n "); |
|
fprintf(ficlog, " end cvevsij \n "); |
|
|
|
/* |
|
*/ |
|
/* goto endfree; */ |
|
|
|
vareij=ma3x(1,nlstate,1,nlstate,(int) bage, (int) fage); |
|
pstamp(ficrest); |
|
|
|
|
|
for(vpopbased=0; vpopbased <= popbased; vpopbased++){ /* Done for vpopbased=0 and vpopbased=1 if popbased==1*/ |
|
oldm=oldms;savm=savms; /* ZZ Segmentation fault */ |
|
cptcod= 0; /* To be deleted */ |
|
printf("varevsij %d \n",vpopbased); |
|
fprintf(ficlog, "varevsij %d \n",vpopbased); |
|
varevsij(optionfilefiname, vareij, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl, &ncvyear, k, estepm, cptcov,cptcod,vpopbased,mobilav, strstart); /* cptcod not initialized Intel */ |
|
fprintf(ficrest,"# Total life expectancy with std error and decomposition into time to be expected in each health state\n# (weighted average of eij where weights are "); |
|
if(vpopbased==1) |
|
fprintf(ficrest,"the age specific prevalence observed (cross-sectionally) in the population i.e cross-sectionally\n in each health state (popbased=1) (mobilav=%d)\n",mobilav); |
|
else |
|
fprintf(ficrest,"the age specific period (stable) prevalences in each health state \n"); |
|
fprintf(ficrest,"# Age popbased mobilav e.. (std) "); |
for (i=1;i<=nlstate;i++) fprintf(ficrest,"e.%d (std) ",i); |
for (i=1;i<=nlstate;i++) fprintf(ficrest,"e.%d (std) ",i); |
fprintf(ficrest,"\n"); |
fprintf(ficrest,"\n"); |
|
/* printf("Which p?\n"); for(i=1;i<=npar;i++)printf("p[i=%d]=%lf,",i,p[i]);printf("\n"); */ |
epj=vector(1,nlstate+1); |
epj=vector(1,nlstate+1); |
|
printf("Computing age specific period (stable) prevalences in each health state \n"); |
|
fprintf(ficlog,"Computing age specific period (stable) prevalences in each health state \n"); |
for(age=bage; age <=fage ;age++){ |
for(age=bage; age <=fage ;age++){ |
prevalim(prlim, nlstate, p, age, oldm, savm,ftolpl,k); |
prevalim(prlim, nlstate, p, age, oldm, savm, ftolpl, &ncvyear, k); /*ZZ Is it the correct prevalim */ |
if (popbased==1) { |
if (vpopbased==1) { |
if(mobilav ==0){ |
if(mobilav ==0){ |
for(i=1; i<=nlstate;i++) |
for(i=1; i<=nlstate;i++) |
prlim[i][i]=probs[(int)age][i][k]; |
prlim[i][i]=probs[(int)age][i][k]; |
Line 5299 Interval (in months) between two waves:
|
Line 9383 Interval (in months) between two waves:
|
prlim[i][i]=mobaverage[(int)age][i][k]; |
prlim[i][i]=mobaverage[(int)age][i][k]; |
} |
} |
} |
} |
|
|
fprintf(ficrest," %4.0f",age); |
fprintf(ficrest," %4.0f %d %d",age, vpopbased, mobilav); |
|
/* fprintf(ficrest," %4.0f %d %d %d %d",age, vpopbased, mobilav,Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); */ /* to be done */ |
|
/* printf(" age %4.0f ",age); */ |
for(j=1, epj[nlstate+1]=0.;j <=nlstate;j++){ |
for(j=1, epj[nlstate+1]=0.;j <=nlstate;j++){ |
for(i=1, epj[j]=0.;i <=nlstate;i++) { |
for(i=1, epj[j]=0.;i <=nlstate;i++) { |
epj[j] += prlim[i][i]*eij[i][j][(int)age]; |
epj[j] += prlim[i][i]*eij[i][j][(int)age]; |
/* printf("%lf %lf ", prlim[i][i] ,eij[i][j][(int)age]);*/ |
/*ZZZ printf("%lf %lf ", prlim[i][i] ,eij[i][j][(int)age]);*/ |
|
/* printf("%lf %lf ", prlim[i][i] ,eij[i][j][(int)age]); */ |
} |
} |
epj[nlstate+1] +=epj[j]; |
epj[nlstate+1] +=epj[j]; |
} |
} |
|
/* printf(" age %4.0f \n",age); */ |
|
|
for(i=1, vepp=0.;i <=nlstate;i++) |
for(i=1, vepp=0.;i <=nlstate;i++) |
for(j=1;j <=nlstate;j++) |
for(j=1;j <=nlstate;j++) |
vepp += vareij[i][j][(int)age]; |
vepp += vareij[i][j][(int)age]; |
Line 5318 Interval (in months) between two waves:
|
Line 9406 Interval (in months) between two waves:
|
} |
} |
fprintf(ficrest,"\n"); |
fprintf(ficrest,"\n"); |
} |
} |
free_ma3x(eij,1,nlstate,1,nlstate,(int) bage, (int)fage); |
} /* End vpopbased */ |
free_ma3x(vareij,1,nlstate,1,nlstate,(int) bage, (int)fage); |
free_ma3x(eij,1,nlstate,1,nlstate,(int) bage, (int)fage); |
free_vector(epj,1,nlstate+1); |
free_ma3x(vareij,1,nlstate,1,nlstate,(int) bage, (int)fage); |
} |
free_vector(epj,1,nlstate+1); |
} |
printf("done \n");fflush(stdout); |
|
fprintf(ficlog,"done\n");fflush(ficlog); |
|
|
|
/*}*/ |
|
} /* End k */ |
free_vector(weight,1,n); |
free_vector(weight,1,n); |
free_imatrix(Tvard,1,15,1,2); |
free_imatrix(Tvard,1,NCOVMAX,1,2); |
free_imatrix(s,1,maxwav+1,1,n); |
free_imatrix(s,1,maxwav+1,1,n); |
free_matrix(anint,1,maxwav,1,n); |
free_matrix(anint,1,maxwav,1,n); |
free_matrix(mint,1,maxwav,1,n); |
free_matrix(mint,1,maxwav,1,n); |
free_ivector(cod,1,n); |
free_ivector(cod,1,n); |
free_ivector(tab,1,NCOVMAX); |
free_ivector(tab,1,NCOVMAX); |
fclose(ficreseij); |
fclose(ficresstdeij); |
|
fclose(ficrescveij); |
fclose(ficresvij); |
fclose(ficresvij); |
fclose(ficrest); |
fclose(ficrest); |
|
printf("done Health expectancies\n");fflush(stdout); |
|
fprintf(ficlog,"done Health expectancies\n");fflush(ficlog); |
fclose(ficpar); |
fclose(ficpar); |
|
|
/*------- Variance of stable prevalence------*/ |
/*------- Variance of period (stable) prevalence------*/ |
|
|
strcpy(fileresvpl,"vpl"); |
strcpy(fileresvpl,"VPL_"); |
strcat(fileresvpl,fileres); |
strcat(fileresvpl,fileresu); |
if((ficresvpl=fopen(fileresvpl,"w"))==NULL) { |
if((ficresvpl=fopen(fileresvpl,"w"))==NULL) { |
printf("Problem with variance of stable prevalence resultfile: %s\n", fileresvpl); |
printf("Problem with variance of period (stable) prevalence resultfile: %s\n", fileresvpl); |
exit(0); |
exit(0); |
} |
} |
printf("Computing Variance-covariance of stable prevalence: file '%s' \n", fileresvpl); |
printf("Computing Variance-covariance of period (stable) prevalence: file '%s' ...", fileresvpl);fflush(stdout); |
|
fprintf(ficlog, "Computing Variance-covariance of period (stable) prevalence: file '%s' ...", fileresvpl);fflush(ficlog); |
|
|
for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
/*for(cptcov=1,k=0;cptcov<=i1;cptcov++){ |
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){ |
for(cptcod=1;cptcod<=ncodemax[cptcov];cptcod++){*/ |
k=k+1; |
|
fprintf(ficresvpl,"\n#****** "); |
for (k=1; k <= (int) pow(2,cptcoveff); k++){ |
|
fprintf(ficresvpl,"\n#****** "); |
for(j=1;j<=cptcoveff;j++) |
for(j=1;j<=cptcoveff;j++) |
fprintf(ficresvpl,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtab[k][j]]); |
fprintf(ficresvpl,"V%d=%d ",Tvaraff[j],nbcode[Tvaraff[j]][codtabm(k,j)]); |
fprintf(ficresvpl,"******\n"); |
fprintf(ficresvpl,"******\n"); |
|
|
varpl=matrix(1,nlstate,(int) bage, (int) fage); |
varpl=matrix(1,nlstate,(int) bage, (int) fage); |
oldm=oldms;savm=savms; |
oldm=oldms;savm=savms; |
varprevlim(fileres, varpl, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl,k); |
varprevlim(fileres, varpl, matcov, p, delti, nlstate, stepm, (int) bage, (int) fage, oldm, savm, prlim, ftolpl, &ncvyear, k, strstart); |
free_matrix(varpl,1,nlstate,(int) bage, (int)fage); |
free_matrix(varpl,1,nlstate,(int) bage, (int)fage); |
} |
/*}*/ |
} |
} |
|
|
fclose(ficresvpl); |
fclose(ficresvpl); |
|
printf("done variance-covariance of period prevalence\n");fflush(stdout); |
|
fprintf(ficlog,"done variance-covariance of period prevalence\n");fflush(ficlog); |
|
|
/*---------- End : free ----------------*/ |
/*---------- End : free ----------------*/ |
if (mobilav!=0) free_ma3x(mobaverage,1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
if (mobilav!=0) free_ma3x(mobaverage,1, AGESUP,1,NCOVMAX, 1,NCOVMAX); |
free_ma3x(probs,1,AGESUP,1,NCOVMAX, 1,NCOVMAX); |
free_ma3x(probs,1,AGESUP,1,NCOVMAX, 1,NCOVMAX); |
|
|
} /* mle==-3 arrives here for freeing */ |
} /* mle==-3 arrives here for freeing */ |
|
/* endfree:*/ |
|
free_matrix(prlim,1,nlstate,1,nlstate); /*here or after loop ? */ |
free_matrix(pmmij,1,nlstate+ndeath,1,nlstate+ndeath); |
free_matrix(pmmij,1,nlstate+ndeath,1,nlstate+ndeath); |
free_matrix(oldms, 1,nlstate+ndeath,1,nlstate+ndeath); |
free_matrix(oldms, 1,nlstate+ndeath,1,nlstate+ndeath); |
free_matrix(newms, 1,nlstate+ndeath,1,nlstate+ndeath); |
free_matrix(newms, 1,nlstate+ndeath,1,nlstate+ndeath); |
free_matrix(savms, 1,nlstate+ndeath,1,nlstate+ndeath); |
free_matrix(savms, 1,nlstate+ndeath,1,nlstate+ndeath); |
|
|
free_matrix(covar,0,NCOVMAX,1,n); |
free_matrix(covar,0,NCOVMAX,1,n); |
free_matrix(matcov,1,npar,1,npar); |
free_matrix(matcov,1,npar,1,npar); |
|
free_matrix(hess,1,npar,1,npar); |
/*free_vector(delti,1,npar);*/ |
/*free_vector(delti,1,npar);*/ |
free_ma3x(delti3,1,nlstate,1, nlstate+ndeath-1,1,ncovmodel); |
free_ma3x(delti3,1,nlstate,1, nlstate+ndeath-1,1,ncovmodel); |
free_matrix(agev,1,maxwav,1,imx); |
free_matrix(agev,1,maxwav,1,imx); |
free_ma3x(param,1,nlstate,1, nlstate+ndeath-1,1,ncovmodel); |
free_ma3x(param,1,nlstate,1, nlstate+ndeath-1,1,ncovmodel); |
|
|
free_ivector(ncodemax,1,8); |
free_ivector(ncodemax,1,NCOVMAX); |
free_ivector(Tvar,1,15); |
free_ivector(ncodemaxwundef,1,NCOVMAX); |
free_ivector(Tprod,1,15); |
free_ivector(Tvar,1,NCOVMAX); |
free_ivector(Tvaraff,1,15); |
free_ivector(Tprod,1,NCOVMAX); |
free_ivector(Tage,1,15); |
free_ivector(Tvaraff,1,NCOVMAX); |
free_ivector(Tcode,1,100); |
free_ivector(Tage,1,NCOVMAX); |
|
|
|
|
|
free_imatrix(nbcode,0,NCOVMAX,0,NCOVMAX); |
|
/* free_imatrix(codtab,1,100,1,10); */ |
fflush(fichtm); |
fflush(fichtm); |
fflush(ficgp); |
fflush(ficgp); |
|
|
|
|
if((nberr >0) || (nbwarn>0)){ |
if((nberr >0) || (nbwarn>0)){ |
printf("End of Imach with %d errors and/or %d warnings\n",nberr,nbwarn); |
printf("End of Imach with %d errors and/or %d warnings. Please look at the log file for details.\n",nberr,nbwarn); |
fprintf(ficlog,"End of Imach with %d errors and/or warnings %d\n",nberr,nbwarn); |
fprintf(ficlog,"End of Imach with %d errors and/or warnings %d. Please look at the log file for details.\n",nberr,nbwarn); |
}else{ |
}else{ |
printf("End of Imach\n"); |
printf("End of Imach\n"); |
fprintf(ficlog,"End of Imach\n"); |
fprintf(ficlog,"End of Imach\n"); |
} |
} |
printf("See log file on %s\n",filelog); |
printf("See log file on %s\n",filelog); |
/* gettimeofday(&end_time, (struct timezone*)0);*/ /* after time */ |
/* gettimeofday(&end_time, (struct timezone*)0);*/ /* after time */ |
(void) gettimeofday(&end_time,&tzp); |
/*(void) gettimeofday(&end_time,&tzp);*/ |
tm = *localtime(&end_time.tv_sec); |
rend_time = time(NULL); |
tmg = *gmtime(&end_time.tv_sec); |
end_time = *localtime(&rend_time); |
strcpy(strtend,asctime(&tm)); |
/* tml = *localtime(&end_time.tm_sec); */ |
printf("Local time at start %s\nLocaltime at end %s",strstart, strtend); |
strcpy(strtend,asctime(&end_time)); |
|
printf("Local time at start %s\nLocal time at end %s",strstart, strtend); |
fprintf(ficlog,"Local time at start %s\nLocal time at end %s\n",strstart, strtend); |
fprintf(ficlog,"Local time at start %s\nLocal time at end %s\n",strstart, strtend); |
printf("Total time used %s\n", asc_diff_time(end_time.tv_sec -start_time.tv_sec,tmpout)); |
printf("Total time used %s\n", asc_diff_time(rend_time -rstart_time,tmpout)); |
|
|
printf("Total time was %d Sec.\n", end_time.tv_sec -start_time.tv_sec); |
printf("Total time was %.0lf Sec.\n", difftime(rend_time,rstart_time)); |
fprintf(ficlog,"Total time used %s\n", asc_diff_time(end_time.tv_sec -start_time.tv_sec,tmpout)); |
fprintf(ficlog,"Total time used %s\n", asc_diff_time(rend_time -rstart_time,tmpout)); |
fprintf(ficlog,"Total time was %d Sec.\n", end_time.tv_sec -start_time.tv_sec); |
fprintf(ficlog,"Total time was %.0lf Sec.\n", difftime(rend_time,rstart_time)); |
/* printf("Total time was %d uSec.\n", total_usecs);*/ |
/* printf("Total time was %d uSec.\n", total_usecs);*/ |
/* if(fileappend(fichtm,optionfilehtm)){ */ |
/* if(fileappend(fichtm,optionfilehtm)){ */ |
fprintf(fichtm,"<br>Local time at start %s<br>Local time at end %s<br>",strstart, strtend); |
fprintf(fichtm,"<br>Local time at start %s<br>Local time at end %s<br>\n</body></html>",strstart, strtend); |
fclose(fichtm); |
fclose(fichtm); |
|
fprintf(fichtmcov,"<br>Local time at start %s<br>Local time at end %s<br>\n</body></html>",strstart, strtend); |
fclose(fichtmcov); |
fclose(fichtmcov); |
fclose(ficgp); |
fclose(ficgp); |
fclose(ficlog); |
fclose(ficlog); |
/*------ End -----------*/ |
/*------ End -----------*/ |
|
|
chdir(path); |
|
strcpy(plotcmd,"\""); |
printf("Before Current directory %s!\n",pathcd); |
strcat(plotcmd,pathimach); |
#ifdef WIN32 |
strcat(plotcmd,GNUPLOTPROGRAM); |
if (_chdir(pathcd) != 0) |
strcat(plotcmd,"\""); |
printf("Can't move to directory %s!\n",path); |
strcat(plotcmd," "); |
if(_getcwd(pathcd,MAXLINE) > 0) |
strcat(plotcmd,optionfilegnuplot); |
#else |
printf("Starting graphs with: %s",plotcmd);fflush(stdout); |
if(chdir(pathcd) != 0) |
|
printf("Can't move to directory %s!\n", path); |
|
if (getcwd(pathcd, MAXLINE) > 0) |
|
#endif |
|
printf("Current directory %s!\n",pathcd); |
|
/*strcat(plotcmd,CHARSEPARATOR);*/ |
|
sprintf(plotcmd,"gnuplot"); |
|
#ifdef _WIN32 |
|
sprintf(plotcmd,"\"%sgnuplot.exe\"",pathimach); |
|
#endif |
|
if(!stat(plotcmd,&info)){ |
|
printf("Error or gnuplot program not found: '%s'\n",plotcmd);fflush(stdout); |
|
if(!stat(getenv("GNUPLOTBIN"),&info)){ |
|
printf("Error or gnuplot program not found: '%s' Environment GNUPLOTBIN not set.\n",plotcmd);fflush(stdout); |
|
}else |
|
strcpy(pplotcmd,plotcmd); |
|
#ifdef __unix |
|
strcpy(plotcmd,GNUPLOTPROGRAM); |
|
if(!stat(plotcmd,&info)){ |
|
printf("Error gnuplot program not found: '%s'\n",plotcmd);fflush(stdout); |
|
}else |
|
strcpy(pplotcmd,plotcmd); |
|
#endif |
|
}else |
|
strcpy(pplotcmd,plotcmd); |
|
|
|
sprintf(plotcmd,"%s %s",pplotcmd, optionfilegnuplot); |
|
printf("Starting graphs with: '%s'\n",plotcmd);fflush(stdout); |
|
|
if((outcmd=system(plotcmd)) != 0){ |
if((outcmd=system(plotcmd)) != 0){ |
printf(" Problem with gnuplot\n"); |
printf("gnuplot command might not be in your path: '%s', err=%d\n", plotcmd, outcmd); |
|
printf("\n Trying if gnuplot resides on the same directory that IMaCh\n"); |
|
sprintf(plotcmd,"%sgnuplot %s", pathimach, optionfilegnuplot); |
|
if((outcmd=system(plotcmd)) != 0) |
|
printf("\n Still a problem with gnuplot command %s, err=%d\n", plotcmd, outcmd); |
} |
} |
printf(" Wait..."); |
printf(" Successful, please wait..."); |
while (z[0] != 'q') { |
while (z[0] != 'q') { |
/* chdir(path); */ |
/* chdir(path); */ |
printf("\nType e to edit output files, g to graph again and q for exiting: "); |
printf("\nType e to edit results with your browser, g to graph again and q for exit: "); |
scanf("%s",z); |
scanf("%s",z); |
/* if (z[0] == 'c') system("./imach"); */ |
/* if (z[0] == 'c') system("./imach"); */ |
if (z[0] == 'e') { |
if (z[0] == 'e') { |
printf("Starting browser with: %s",optionfilehtm);fflush(stdout); |
#ifdef __APPLE__ |
system(optionfilehtm); |
sprintf(pplotcmd, "open %s", optionfilehtm); |
|
#elif __linux |
|
sprintf(pplotcmd, "xdg-open %s", optionfilehtm); |
|
#else |
|
sprintf(pplotcmd, "%s", optionfilehtm); |
|
#endif |
|
printf("Starting browser with: %s",pplotcmd);fflush(stdout); |
|
system(pplotcmd); |
} |
} |
else if (z[0] == 'g') system(plotcmd); |
else if (z[0] == 'g') system(plotcmd); |
else if (z[0] == 'q') exit(0); |
else if (z[0] == 'q') exit(0); |
} |
} |
end: |
end: |
while (z[0] != 'q') { |
while (z[0] != 'q') { |
printf("\nType q for exiting: "); |
printf("\nType q for exiting: "); fflush(stdout); |
scanf("%s",z); |
scanf("%s",z); |
} |
} |
} |
} |
|
|
|
|
|
|