search for: calucul

...ect <- boot (....))I can call it and will get an output with t, bias and standarderror as follows: Bootstrap Statistics : original bias std. error t1* 5.65 0.01 0.9134185 My question is now, where is the value of the bias stored? How can I get access to this value to do further caluculations? Thanks, K. St.

Hi, suppose I have a matrix (or dataframe) as a result from subsetting. mat <- matrix(1:20,ncol=2) mat[c(3,6,9),] <- NA cc <- complete.cases(mat) sub <- mat[cc,,drop=FALSE] sub <- sub * 2 #some caluculations with sub. now I would like to expand sub somehow so row 3,6, and 9 would be filled with NAs but the rest should be in place again. Is there a simple function for this? merge is not an option. Thank you very much for your help. Ido [,1] [,2] [1,] 2 22 [2,] 4 24 [3,]...

...s how much of this correlation is due to the fact that the X's are related, and how much to the fact that the two VARs are similarly constructed What I want to do is simulate this with normally distributed data for the X's. That is, generate (say) 1000 sets of X1 through X4, use those to caluculate 1000 var1 and var2, and then 1000 correlations between var1 and var2, and then plot those results. Any help appreciated Peter Flom Peter L. Flom, PhD Assistant Director, Statistics and Data Analysis Core Center for Drug Use and HIV Research National Development and Research Institutes 71 W. 2...

...00 elements. Each element is a data frame with 2 columns. As an example, see element 1999 below. [[1999]] H N 6 0.54 26 10 0.31 13 11 0.12 34 13 0.00 38 4 0.59 37 16 0.44 9 19 0.08 13 14 0.64 39 8 0.75 12 24 0.42 26 9 0.61 111 20 0.22 9 Now, I want to caluculate the weighted mean for H in each list element, with N providing the weights. I can do this fine for an individual list element: > weighted.mean(list[[1999]]$H,list[[1999]]$N) [1] 0.4456403 or even: > weighted.mean(list[[i]]$H,list[[i]]$N) [1] 0.5992683 but when I try and apply it in a lo...

...calls both sid_to_gid() and sid_to_uid() in turn with the same SID just to try if it matches in one case or the other. Unfortunately, sid_to_gid() falls back to algorithmic mapping and in the case shown above it succeeds to calculate a gid out of the migrated users RID. Turning off algorithmic rid caluculation in general would solve the problem. However, I doubt that this is the correct solution at this time. For example, I would like to keep this algorithmic thing for automatic creation of new (machine) accounts. One possible solution might be, to use the algorithmic rid base to open a window of f...

...eadonly share without the extra click. And it is that extra click that is our show-stopper: our users have sadly over many many years used a paricular server name in their office documents & co., of course also with lots and lots of links in the documents themselves. Presentations, speadsheet caluculations, links to other docs, etc. will all fail. The general managment then, understandably, forbade us from forcing everyone (1000+ people) to update their documents etc. overnight such that we had to find another solution. Ours is to provide the orginal path (URL with old server name, redirecte...

...e . ( that is not the case in ac3 , mp3 ) . The problems are ----> 1. How physcoacoustic model is generated . I was reading noise masking . I have understood that FFT of 2048 samples is used for finding tone masking . And MDCT of same samples is used for noise masking . Now while caluculating noise masking , logmdct input is used . And function bark_noise_hybridmp is called . In that function some mathematical computation is done and noise is calculate . ( noise[i] = R - offset ) Can anyone explain me what is the funda behind it . <p>2. NOw about overlap and...

...ut the extra click. And it is that extra > click that is our show-stopper: our users have sadly over many many years > used a paricular server name in their office documents & co., of course > also with lots and lots of links in the documents themselves. > Presentations, speadsheet caluculations, links to other docs, etc. will > all fail. The general managment then, understandably, forbade us from > forcing everyone (1000+ people) to update their documents etc. overnight > such that we had to find another solution. Ours is to provide the orginal > path (URL with old se...

...ut the extra click. And it is that extra > click that is our show-stopper: our users have sadly over many many years > used a paricular server name in their office documents & co., of course > also with lots and lots of links in the documents themselves. > Presentations, speadsheet caluculations, links to other docs, etc. will > all fail. The general managment then, understandably, forbade us from > forcing everyone (1000+ people) to update their documents etc. overnight > such that we had to find another solution. Ours is to provide the orginal > path (URL with old se...

Hi, I've got a problem with packed OGG files taking a long time to open before they start playing. I have about 30+ OGG files that I have joined together, now the engine I am working on has its own file management and when I use the OV open_callbaks it spends a long time constantly seeking and reading in different sets of 8500 bytes inside the open_callbacks function, some time for as

On Mon, May 18, 2015 at 03:31:55PM +0200, Greg Enlow wrote: > Hi, > > The Server to which the msdfs is pointing is a netapp. Though we theoretically can access the shell on it then begin to mess around there, we would really like to avoid that. Warranty and such make it a bit of a legal issue. That is the reason we went with a separate instance in the first place and now wonder why the