similar to: How to do survival analysis with time-related IVs?

Displaying 20 results from an estimated 300 matches similar to: "How to do survival analysis with time-related IVs?"

2005 Jul 08
4
Can Asterisk ring a specific extension based on the number the outside caller dialed?
I am thinking of having a pots line with multiple numbers on it, and having Asterisk dial my desk if the outside caller dials xxx-xxx-xxx1, and ring another desk if the person called xxx-xxx-xxx2, etc. Can Asterisk do this? -- Jeff Ramsey MIS Administrator Tubafor Mill, Inc.
2001 May 07
17
Printer
Hi guys, I've installed Samba but can't get the printer to work. I've done magicfilterconfig --force and configured the Printer. E Furthermore when I print a file on my Windows machine it creates a file on the server but it just doesn't print. I can ma Do you guys have the answer for me??? Thnx, ? Jeroen ? Following is the config file: ? # Samba config file created using
2015 Apr 24
1
Centos7 Samba 4.1.12 -> Centos 5.11 Samba 3.5.2 = Rejecting auth request
Dear Sirs/Madams, I have the following problem, for which the internet does not have a solution yet: I am trying to have a Centos7 server with Samba 4.1.12 authenticate his users (security=domain) with a DC samba version 3.5.2 on a Centos5.11 machine (which has an LDAP Backend). This works for other servers (OpenSuse 13.2 with samba 4.1.17) and for a bunch of Windows7 clients. I can join the
2010 Oct 05
1
[LLVMdev] how to output the single bitcode file using gold plugin?
Hi, all. I want to get the single bitcode file after link-time optimizations. After doing some searching, I get commands as follows: *llvm-gcc -O4 -c xxx.c -o xxx.o llvm-gcc xxx.o -use-gold-plugin -Wl,-debug -Wl,-plugin-opt=also-emit-llvm -lm -o xxx* But these command don't give me the wanted bitcode file. The used version of llvm is 2.7. Do you have any idea of this problem or any other
2013 Jul 22
4
How to split two levels several times?
Hi, I have a small problem with the function split() and would appreciate your help. I have a table called ?XXX? with 2 columns and 49 rows. The 49 rows belong to 8 different levels (electrode1, ...,electrode8). I want to split the table always at the row where ?electrode1? starts again so that I can export 7 individual dataframes (numbered ?dataframe1? to ?dataframe7?) which contain always
2014 Feb 05
1
Make SSH_ORIGINAL_COMMAND available in AuthorizedKeysCommand context
Hi Using SSH_ORIGINAL_COMMAND in AuthorizedKeys is so helpful, I'd like to know if it might be possible to access it in the AuthorizedKeysCommand context (via env ?). Is this possible ? can anybody give me advice on going into this ? If possible, I'll use this SSH_ORIGINAL_COMMAND to send client specifics information to the AuthorizedKeysCommand script. Currently, the only alternative
2008 Jan 12
2
Factor Analysis
Good Morning, Is it possible to use the R program for a CFA with dichotomous data? Thank you, Kathleen Kathleen Kemp, M.A. Doctoral Clinical Psychology Student, Concentration: Forensic Psychology Drexel University Philadelphia, PA 19104 kk354@drexel.edu [[alternative HTML version deleted]]
2011 Jul 26
4
[Bug 730] New: DHCP request (and other?) traffic bypasses iptables/netfilter
http://bugzilla.netfilter.org/show_bug.cgi?id=730 Summary: DHCP request (and other?) traffic bypasses iptables/netfilter Product: netfilter/iptables Version: linux-2.6.x Platform: x86_64 OS/Version: Ubuntu Status: NEW Severity: major Priority: P5 Component: unknown AssignedTo:
2009 Dec 30
1
Bug query (PR#14173)
I'm seeing a probable error in the way R boot.ci calculates certain confidence intervals. Not sure where to submit it. Should this go to the package maintainer? If so, how would I identify that person? =20 Thanks...Ed =20 Ed J. Gracely, Ph.D. Drexel University College of Medicine & Drexel University School of Public Health Mail to: Family, Community, and Preventive Medicine Drexel
2005 Oct 20
3
IPP2P version 0.8.0 released
Hi, The new version ipp2p 0.8.0 is released. Klaus -- www.ipp2p.com
2019 Jun 18
0
[libnbd RFC PATCH 9/8] wip: generator: Add ReadStatus enum type
Exploration of what it would take to treat the nbd_pread_callback status parameter as a language-appropriate enum rather than a bare integer. While I've identified a rough set of the places to change, I have not actually got it working with Python or OCaml bindings. --- Posting this more for an idea of whether we want to pursue it further. I have no hard feelings if we decide to ditch it;
2012 Nov 05
1
Copying a file to a usb stick
Hello list, I formatted a 64MB usb stick with this command 'mkfs.ext2 -b 1024 /dev/XXX1' , to copy a file of 9230653440, but when it reached 7921295360, it gave input/ output error and the file is not copied. How should this be done?
2014 Jul 15
8
[Bug 2255] New: tunneling with -W does not report non 0 exit codes on failure even with ExitOnForwardFailure=yes
https://bugzilla.mindrot.org/show_bug.cgi?id=2255 Bug ID: 2255 Summary: tunneling with -W does not report non 0 exit codes on failure even with ExitOnForwardFailure=yes Product: Portable OpenSSH Version: 6.6p1 Hardware: amd64 OS: Linux Status: NEW Severity: normal Priority:
2009 Jan 04
0
"xm migrate VM_ID dest_IP_addr --kemari" fails
Hi I have a setup where I have an eth2 10GB interface setup a loop back between two dell 1950 servers. I have enabled VT in the bios. The eth0 interface is on a 1GB network. I am using an iscsi shared drive for the HVM image. I have followed the instruction provided in http://www.osrg.net/kemari/usage.html Now once everything is setup: After launching the HVM, I execute the following
2007 Feb 21
2
how much performance penalty does this incur, scalar as a vector of one element?
I have been comparing R with other languages and systems. One peculiar feature of R is there is no scalar. Instead, it is just a vector of length one. I wondered how much performance penalty this deign cause, particular in situations with many scalars in a program. Thanks. Jason Liao, http://www.geocities.com/jg_liao Associate Professor of Biostatistics Drexel University School of Public
2008 Jan 31
3
fastest way to compute the squared Euclidean distance between two vectors in R
I have a program which needs to compute squared Euclidean distance between two vectors million of times, which the Rprof shows is the bottleneck. I wondered if there is any faster way than my own simple function distance2 = function(x1, x2) { temp = x1-x2 sum(temp*temp) } I have searched the R-help archives and can not find anything except when the arguments are matrices. Thanks for any
2019 Jun 20
1
Re: [libnbd RFC PATCH 9/8] wip: generator: Add ReadStatus enum type
On Mon, Jun 17, 2019 at 08:39:43PM -0500, Eric Blake wrote: > Exploration of what it would take to treat the nbd_pread_callback > status parameter as a language-appropriate enum rather than a bare > integer. While I've identified a rough set of the places to change, I > have not actually got it working with Python or OCaml bindings. > --- > > Posting this more for an
2008 Dec 09
21
Selective Compression/Encryption
Currently compression and I assume if encryption is implemented it is turned on or off during mount. There are however many times when a user may want to select which files/directories they want to compress or encrypt. This will also be helpful when implementing btrfs support in grub for example. We can say the disk can be compressed/encrypted except for /boot so compression/encryption
2006 Oct 03
3
Linking R with Fortran 90: make: m2c: Command not found
Following the setup in Prof.Duncan Murdoch's page, I have successfully compiled the DLL for one Fortran 95 program using Gfortran and got 300 times speed boost. For the second set of fortran programs, However, I have this error message R CMD SHLIB -o jiangang kdtree2.f90 jian.f90 gang.f90 m2c -o jian.o jian.mod make: m2c: Command not found make: *** [jian.o] Error 127 Can anyone
2006 Aug 24
4
extremely slow recursion in R?
I recently coded a recursion algorithm in R and ir ran a few days without returning any result. So I decided to try a simple case of computing binomial coefficient using recusrive relationship choose(n,k) = choose(n-1, k)+choose(n-1,k-1) I implemented in R and Fortran 90 the same algorithm (code follows). The R code finishes 31 minutes and the Fortran 90 program finishes in 6 seconds. So the