search for: functoins

I plan on analyzing some bird point count data. I need to develop a re-sampling regime for data like this. I used scan(file="Sample.txt",what=list(0,0,0,0,0,0),sep="\t") [[1]] [1] 1 2 3 4 5 [[2]] [1] 6 7 8 9 NA [[3]] [1] 10 11 12 13 NA [[4]] [1] 14 15 16 NA NA [[5]] [1] 17 18 19 20 21 Each row represents one site and the numbers (1-21) are visits to that site.

Hi R users I am trying to get cross-tabulation tables using tables. All variables used are binary ones (0 and 1). Each time I constructed cross-tabluation table using a different variable pair (e.g., variable 1 and variable 2, variable 1 and variable 3 etc) In doing so, I ran into some problems i.V2 i.V1 1 0 17 1 33 For variable 2 (i.V2) there was no one belonging to ZERO

Hello r-help, I'm trying to fit birds counts over years using glm. In fact I'm trying to reproduce an analysis already perform with genstat (attach document). I have done (with Estate and year as factors): Model1 <- glm(Females~Estate+Year+offset = log(area)), family = quasipoisson(link = log), na.action = "na.exclude") After I have calculated the prediction using: Pred1

hi every one, i want to make the dovecot mail server consistent and flush its caches for backup purpose. can anybody tell mehow to make that? (i've written a signal handler to call the functoins from my code. The server caches should be flushed before the function call.) any reply ? --------------------------------- Yahoo! Mail Bring photos to life! New PhotoMail makes sharing a breeze. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://do...

Qemu was able to demonstrate that knowing whether a zero operation is fast is useful when copying from one image to another: there is a choice between bulk pre-zeroing and then revisiting the data sections (fewer transactions, but depends on the zeroing to be fast), vs. visiting every portion of the disk only once (more transactions, but no time lost to duplicated I/O due to slow zeroes). As

I've written a series of functions that evaluates an integral from -inf to a or b to +inf using equally spaced quadrature points along a normal distribution from -10 to +10 moving in increments of .01. These functions are working and give very good approximations, but I think they are computationally wasteful as I am evaluating the function at *many* points. Instead, I would prefer to use

Now the discussion moves to kernel space, I move the email from ocfs2-tools-devel to ocfs2-devel. The original discussion can be found from http://oss.oracle.com/pipermail/ocfs2-tools-devel/2009-June/001891.html Joel Becker Wrote: > On Sat, Jun 27, 2009 at 03:46:04AM +0800, Coly Li wrote: >> Joel Becker Wrote: >>> On Sat, Jun 27, 2009 at 03:00:05AM +0800, Coly Li wrote: >>

This is a cover letter to a series of patches being proposed in tandem to four different projects: - nbd: Document a new NBD_CMD_FLAG_FAST_ZERO command flag - qemu: Implement the flag for both clients and server - libnbd: Implement the flag for clients - nbdkit: Implement the flag for servers, including the nbd passthrough client If you want to test the patches together, I've pushed a