Search String: Display: Description: Sort:

Results:

References: [ +from:longhow.lam@nl.abnamro.com: 5 ]

Total 5 documents matching your query.

1. Re: How to write out lower triangle matrix to file? (score: 1)
Author: longhow.lam@nl.abnamro.com
Date: Tue, 24 Jul 2001 09:56:42 +0200
One way to do it is to transform the matrix to a character matrix, replace the upper (or lower) triangle with spaces or tabs and write out using write.table. So that would look like: x <- matrix(rnor
/archives/html/s-news/2001-07/msg00166.html (8,206 bytes)

2. Re: Simple task, but a hard time doing it (score: 1)
Author: longhow.lam@nl.abnamro.com
Date: Wed, 13 Jun 2001 09:50:44 +0200
You can use the function tapply to do what you want. Look at the help for the syntax. Cheers, Longhow
/archives/html/s-news/2001-06/msg00154.html (6,637 bytes)

3. parametric survival models with time varying covariates (score: 1)
Author: longhow.lam@nl.abnamro.com
Date: Wed, 11 Apr 2001 13:52:49 +0200
Hi S-news, I am analyzing survival data with time varying covariates. I am using the coxph function with counting process format for the data. I have quit a lot of data, fitting the model is not a pr
/archives/html/s-news/2001-04/msg00127.html (6,958 bytes)

4. Summary: Parametric survival analysis with time varying covariates (score: 1)
Author: longhow.lam@nl.abnamro.com
Date: Tue, 17 Apr 2001 09:22:54 +0200
My original question: I am analyzing survival data with time varying covariates. I am using the coxph function with counting process format for the data. I have quit a lot of data, fitting the model
/archives/html/s-news/2001-04/msg00162.html (10,064 bytes)

5. Re: minimizing a fit using non-differentiable nonlinear function (score: 1)
Author: longhow.lam@nl.abnamro.com
Date: Thu, 1 Feb 2001 10:01:21 +0100
It is still available. But since it makes use of numerical recipes code, it is only available to those who have a license of numerical recipes. So you must have either the book or a screen license. I
/archives/html/s-news/2001-02/msg00008.html (7,020 bytes)


This search system is powered by Namazu