search for: instantaneous

...PH.SURVFIT.PROP.FAIL <- MODEL.COXPH.SURVFIT$n.event/MODEL.COXPH.SURVFIT$n.risk # Length of time over which these failure occurs ## MODEL.COXPH.SURVFIT.TIME <- MODEL.COXPH.SURVFIT$time MODEL.COXPH.SURVFIT.TIME.0 <- c(0,MODEL.COXPH.SURVFIT.TIME[-length(MODEL.COXPH.SURVFIT.TIME)]) # Instantaneous Hazard rate ## MODEL.COXPH.SURVFIT.INSTANTANEOUS.HAZARD <- MODEL.COXPH.SURVFIT.PROP.FAIL/(MODEL.COXPH.SURVFIT.TIME - MODEL.COXPH.SURVFIT.TIME.0) ########################################################################################## #########################################################...

Hi all I am trying to calculate the instantaneous hazard (rather than cumulative hazard) for an event "bird death". Some sample data is as follows: year<-c(rep(2003,10),rep(2004,10)) time<-c(5,10,5,15,20,10,15,15,25,25,5,15,15,5,25,10,25,15,35,25) event<-c(1,0,1,1,0,1,1,0,1,0,1,0,0,1,0,0,0,0,1,0) Ideally I would like to know...

Hello, just installed build 50, and typed ''zfs'' in a shell. I got the help message, and was surprised with it : -------------------- bash-3.00# zfs commande manquante syntaxe : zfs command args ... o? ''command'' est l''une des possibilit?s suivantes : create [[-o property=value] ... ] <filesystem> create [-s] [-b blocksize] [[-o

Contained in tonight's last commit: Fixed a link-crossing bug in libvorbis (total time was reset to -1 at the link boundary until the next packet with a frame number arrived) Implemented instantaneous bitrate capability in libvorbis; added ov_bitrate_instant() to interface. I know I talked about a different interface to this with the Sonique folks a few months ago... I couldn't remember exactly what we'd hammered out (but I do remember it involved overloading the ov_bitrate interface) s...

Dear All As far as I know , to check for the amount of installed RAM on my centos server I checked it as: #more /proc/meminfo Can you please let me know how can I check for the instantaneous occupied amount of my RAM the similar way the task manager shows it on my Win server ? Thank you in advance

...king on functionality to match on certain nodes of a largish (65mb) xml file. I implemented this with REXML and was 2 minutes and counting before I killed the process. After this, I just opened the console and loaded the file into a string and did a regex search for my data -- the result was almost instantaneous. The question is, if I can get away with it, am I better off just going the regex route, or is it really worth my while to investigate a faster XML parser (I know REXML is notorious for being slow, but given how fast it was to call a regex on the file, I am thinking that this will still be faster...

While reading about NILFS here: http://www.linux-mag.com/cache/7345/1.html I saw this: *One of the most noticeable features of NILFS is that it can "continuously > and automatically save instantaneous states of the file system without > interrupting service". NILFS refers to these as checkpoints. In contrast, > other file systems such as ZFS, can provide snapshots but they have to suspend > operation to perform the snapshot operation. NILFS doesn?t have to do > this. The snapsho...

I just ran into this strange behavior. y <- rnorm(1000) x <- seq(0, length=length(y)) plot(x, y, type='l', lty=1) - instantaneous plot(x, y, type='l', lty=2) - 18s plotting lines + 15s plotting axes = 33s plot(x, y, type='l', lty=3) - 76s ,, + 75s ,, = 151s plot(x, y, type='l', lty=4) - 40s ,, + 38s ,, = 78s A cou...

Dear all, Is there a way to calculate the non-cumulative hazard (instantaneous hazard), which is the product of baseline hazard and exp{beta*covariate} ? I knew in survfit, we can get the estimator of cumulative baseline hazard, but how can we get the non-cumulative one? Thank you very much! Koshihaku -- View this message in context: http://r.789695.n4.nabble.com/non-cumul...

...are required to decode vorbis? * I know vorbis uses MDCT's, but I need to know how math-intensive the op is (having never studied MDCT's) * how much additional complexity is required to handle the various mixed-stereo modes (from a decoder standpoint). * what is the (maximum instantaneous) amount of memory required to decode stereo vorbis (quality 0-10 ) * what is the (maximum instantaneous) number of FLOPS required to decode stereo vorbis (quality 0-10 ) * how much 'buffer' memory would be required to maintain a continuous flow of data? (all qualities) Thanks fo...

Hi, I use asterisk for a phone quiz game. I need to store data in a database (MySql, postgres) : telephone number, name (voice), ... and of course the answers at the quetions. What's the best way to store my data ? - script with system() command ? - AGI script - CDR - others ... Thanks Jerome Vous manquez d?espace pour stocker vos mails ? Yahoo! Mail vous offre

This patch series sets dev->vblank_disable_immediate = true on radeon/amdgpu-kms, nouveau-kms for nv50+, and vc4 for the real kms driver (as opposed to dispmanx firmware backed kms). All the drivers should be ready in theory, given their implementation, for fast vblank disable/enable. In practice, i have performed timing tests with my measurement equipment for all those drivers with the

...main executable is really just another shared library. Yes, but does gdb reload everything on each execution? Every time I execute "run" I see the same slow behavior. Loading the symbols for small tools like llvm-rc takes hardly any time at all (i.e. "file llvm-rc" is almost instantaneous). But executing it causes gdb to chew up CPU cycles for a while. Every time. -David

...t's a simple: > > scopy source dest Thanks but I just tested and it doesn't trigger BTRFS_IOC_CLONE_RANGE. The server-side copy is working all right, but the file is not copied through BTRFS reflink (cp --reflink=auto). It is quite noticeable on large file, where it should be nearly instantaneous. My configuration: - client: Debian Stable + smbclient 4.4.6 (coming from Testing) + kernel 4.7 (amd64) - server: Debian Stable + samba 4.2.10 + kernel 4.7 (amd64)

...o discard unused blocks: if I execute a `fstrim -v /` twice, the amount trimmed does not change on the 2nd invocation AND it takes just as long as the first.  Why do I think this is a bug?  When I do the same on an ext4 partition I get different behavior: the output shows 0 B trimmed and it does is instantaneously when I run it a 2nd time.  After contacting the fstrim developer, he stated that the userspace part (fstrim) does only one thing and it is invoke an ioctl (FITRIM); it is the job of the filesystem to properly implement this. Supporting data ---------------- Example on a btrfs partition: The 1st...

...are written both on a tdb and on the filesystem. What's the behaviour of the module then? When I use a software like icacls, to backup ACL, it looks like samba is reading from the filesystem, because it takes a long time. But when I try to browse a directory with thousands of files, access is instantaneous. This makes me suppose samba is using the tdb. Am I correct? Thanks in advance for any help. Si segnala che il presente messaggio non e' a carattere personale e le risposte allo stesso potranno essere conosciute dall'organizzazione lavorativa di appartenenza del mittente secondo le moda...

...r for another bug, I = took a look at this. 2.6.22 switches it to be 64-bit code. VT is very = picky about what state it can run in. Not using VT on Intel 64-bit = hardware cripples performance, running at far below normal speed, and = taking minutes to decompress the kernel, which is nearly instantaneous = otherwise. To get back into VT in this case, not only do we need to load FS and GS, = we also need to setup an initial LDT and task. Can you try the attached = patch and see that it does the right thing? I've also cc'd the KVM developers, as the same problem will affect them, = and...

...r for another bug, I = took a look at this. 2.6.22 switches it to be 64-bit code. VT is very = picky about what state it can run in. Not using VT on Intel 64-bit = hardware cripples performance, running at far below normal speed, and = taking minutes to decompress the kernel, which is nearly instantaneous = otherwise. To get back into VT in this case, not only do we need to load FS and GS, = we also need to setup an initial LDT and task. Can you try the attached = patch and see that it does the right thing? I've also cc'd the KVM developers, as the same problem will affect them, = and...

...nothing refers to it from the user's code > > I'm actually not using C bindings; I'm using the C++ API directly. I > have no idea why I have to link that object file. This is very strange. Can you test if the Fibonacci.exe example runs quick? (It should show the result almost instantaneously. Discard the first run: most of that time is the OS loading the executable from disk) If the Fibonacci example works, please compare its link command options with your compiler's. -- Oscar

...e that slow, or if there''s something wrong with my configuration. At present any request to the server (i.e. page refresh) takes 2 or 3 seconds. Again, I''m talking about a decent server on a Gigabit local area network. Also the PHP web sites I run on this very same server are instantaneous, so the server couldn''t be the problem. But anything I''ve tried with Rails is incredibly slow. Does that sound right to everyone? Is normal CGI usually so unacceptably slow? -- Posted via http://www.ruby-forum.com/.