search for: quickers

dear all, i have a quite simple question, i want to fill up a Matrix like done in the following function, but the performance is very bad for large dimensions is there a way to do this like with apply or something similar? makeMatrix <- function(a, b,dim) { X=matrix(0,ncol=dim,nrow=dim) for (i in c(1:dim)){ for (j in c(1:dim)) { if (i==j) {X[i,j]<-a} else { X[i,j]<- exp((

Hi all, i was thinking that this question was not good right after relese 1.0, but now perhaps it is OK... if not, then I am sorry. So, what about current status of benchmarks? I mean comparison to gcc. I have looked at http://llvm.cs.uiuc.edu/testresults/X86/ Unfortunatelly graphs lines are hardly for human eye, but tables are OK. I give my own interpretation for April 26, 2004

If I want to drop columns x, y, z from dataframe df, is there a better alternative to df$x = NULL df$y = NULL df$z = NULL There are sufficiently many columns remaining to make df = subset(df, select = c(a,b,c,d[etc])) cumbersome. Thank you. -- View this message in context: http://n4.nabble.com/Is-there-a-quicker-way-to-drop-a-data-frame-column-than-setting-it-to-NULL-tp1288617p1288617.html

Hi all, myint=function(mu,sigma){ integrate(function(x) dnorm(x,mu,sigma)/(1+exp(-x)),-Inf,Inf)$value } mymu=seq(-3,3,length(1000)) mysigma=seq(0,1,length(500))[-1] k=1 v=c() for (j in 1:length(mymu)) { for (i in 1:length(mysigma)) { v[k]=myint(mymu[j],mysigma[i]) k=k+1 } } Basically, I want to investigate for what values of mu and sigma, the integral is divergent. Is there another way

Greetings from the day of rest after a week of Where. It was a great time out here - and there is a lot of interest in the community around Mapstraction. The new Sandbox (http://mapstraction.appspot.com) made surprisingly quick rounds and lots of kudos. It will be a great place to demo Mapstraction and encourage developers. We had a very good discussion about Mapstraction at WhereCamp. Pamela

Dear R-help, I have a loop, which is set to take about 26 hours to run at the rate it's going - this is ridiculous and I really need your help to find a more efficient way of loading up my array gpcc.array: #My data is stored in a table format with all the data in one long column #running though every longitute, for every latitude, for every year. The #original data is sotred as

On 7/4/19 8:43 AM, Jobst Schmalenbach wrote: > Clearly the development server is hardware wise way below the specs of the Dell but > software wise they are identical (they get upgraded at the same time). As a first step, you have to test subsystems one by one. Try this to see how fast the CPU and kernel are (including meltdown/spectre slowdowns): time dd 2>/dev/null if=/dev/zero

On 7/3/19 11:43 PM, Jobst Schmalenbach wrote: > - How can it be that the DELL takes so much longer alltough on the far better hardware? It looks like the DIY system has a CPU that's nearly twice as fast as the Dell's.? The additional CPU in the Dell will run more tasks concurrently, but it won't make a single process faster. You might also think that the SSD RAID would make

On Thu, Jul 04, 2019 at 10:46:19AM -0700, Gordon Messmer (gordon.messmer at gmail.com) wrote: > On 7/3/19 11:43 PM, Jobst Schmalenbach wrote: > > - How can it be that the DELL takes so much longer alltough on the far better hardware? > It looks like the DIY system has a CPU that's nearly twice as fast > as the Dell's.? The additional CPU in the Dell will run more tasks >

Hi, I don't know if this is possible - but can I set up asterisk to answer the FSO line after one or two rings rather than four? I haven't (yet) found a configuration variable to let me do this... Thanks in advance, Andrew _________________________ Andrew Yager Real World Technology Solutions Real People, Real SolUtions (tm) ph: (02) 9945 2567 fax: (02) 9945 2566 mob: 0405 15 2568

Motivated by Deepayan's recent inquiries about the efficiency of the R 'quantile' function: http://tolstoy.newcastle.edu.au/R/devel/05/11/3305.html http://tolstoy.newcastle.edu.au/R/devel/06/03/4358.html I decided to try to revive an old project to implement a version of the Floyd and Rivest (1975) algorithm for finding quantiles with O(n) comparisons. I used

Hi all, I keep on hitting this problem when migrating new clients from POP or local IMAP servers (hosted on their LAN's) to my Dovecot setup, which is hosted properly in a data center. People usually complain that it's slower and although they're getting a kick ass mail setup it doesn't look good from their point of view. I'm wondering if there is anything I could do to

On Thu, Jul 4, 2019 at 2:43 AM Jobst Schmalenbach <jobst at barrett.com.au> wrote: > the development and life server in question run the same software setup: > - CentOS Linux release 7.6.1810 > - bind 32:9.9.4-74.el7_6.1 > - Apache/2.4.6 (CentOS) > - PHP 7.1.29 > - mysqld Ver 5.7.26 > - wordpress, woocommerce, wishlistmember, Sensei etc > - software

> Hi > > I need some advice what to do next, even if someone tells me to > check out (an)other mailing list(s), tuning site or point me in a better > direction how to solve my annoying problem: one server is much faster > for certain tasks although on "shitty" hardware. > > I have tried many things to solve my issue > - changed buffer/pool/cache/etc mysqld

Sometimes I print out a package and read about it and there are sometimes nice examples that I would like to run myself. Is there a way to bring them into R from the package or are they only meant to be typed in manually ? If manual is the only way, that's fine. I was just checking whether there was a quicker way. Thanks. Mark

Hi, I''m looking into write scaffold generators that will, amoung other things, scaffold active record associations (eg. generate select boxes for belongs_to where you can choose a parent object) for quicker prototyping. But... My question is: Is there anyway of finding out what associations exist from examining the lodel classes themselves or indeed any other way of finding out this

J.B. Nicholson-Owens: > I'm not sure what you're asking for I have a huge archive of FLAC files and want auto- matically to check the integrity thereof, so as if some file be reported as corrupted I can restore it from a mirror backup. > I should have mentioned before that apparently the > MD5 hash is computed on the uncompressed raw sam- > ple data and the easiest way

Hi, I have a 7000x7000 matrix, and each element is an integer. For each element, I want to apply the function : wt <- 0 for(q in 1:count){ wt <- wt + 0.5^(q-1) } I get the value of 'count' from the elements in the matrix , and want to store the corresponding 'wt' value for that element. I suppose I could loop through the matrix, and apply the function to each

I'm learning R from scratch on my linux box, being deeply biased at work by those graphical programs, nice to look but often poor in content and almost generally limited, running under M$ Windows. I wonder if someone out there can suggest to an absolute beginner as I am where to find a collection of examples of R-code (or Splus, as I understand) to play with in order to learn R quicker. The

The day I switch our user to dovecot and it goes into production, there will be a few thousand people all generating their indices for the first time (we have a legacy requirement for procmail, at least for now), so I wondered: 1) Is there is anyway to pre-emptively force indexing? 2) Is there any value in doing so? That is, will I gain much in terms of making the first time everyone connects