search for: fastest

Dear all, Newbie: What is the fastest way to combine all columns of a matrix to one column? -- View this message in context: http://r.789695.n4.nabble.com/What-is-the-fastest-way-to-combine-all-columns-of-a-matrix-to-one-column-tp4423882p4423882.html Sent from the R help mailing list archive at Nabble.com.

Hi, I am trying to find the fastest way to "find the last index k such that x[k] < y in a *sorted* vector x" These are my two alternatives: x <- sort(rnorm(1e4)) y <- 0.2 # Alt 1 k <- max(1, sum(x < y)) # Alt 2 "divide and conquer" lastIndexLessThan <- function(x, y) { k0 &...

Hello, what is causing the following, and can someone give the solution which is mentioned at https://access.redhat.com/articles/1320623 by the way: why are the "fastest" mirrors from other continent? [root at host sysconfig]# yum clean all Loaded plugins: fastestmirror, security Cleaning repos: base epel extras updates Cleaning up Everything Cleaning up list of fastest mirrors [root at host sysconfig]# yum clean all Loaded plugins: fastestmirror, security C...

Hi dear R help group. I was wondering how can I find out which CRAN mirror would be the fastest for me (I leave in Israel and therefore don't have a CRAN mirror for our country to go to by default) Thanks, Tal -- ---------------------------------------------- My contact information: Tal Galili Phone number: 972-50-3373767 FaceBook: Tal Galili My Blogs: http://www.r-statistics....

On 13 Dec 2016, at 19:02, Mehdi Amini via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > I’m totally willing to believe you that it is not possible to write the fastest ELF linker on earth (or in the universe) with a library based and reusable components approach. But clang is not the fastest C/C++ compiler available, and LLVM is not the fastest compiler framework either! I’m not how it compares now, but at least when I started contributing and for a year or two...

...o pass a map from filename to MemoryBuffer objects makes sense, too. That would be done without affecting the overall linker architecture. I don't oppose to that idea, and if someone wrote a patch, I'm fine with that. I’m totally willing to believe you that it is not possible to write the fastest ELF linker on earth (or in the universe) with a library based and reusable components approach. But clang is not the fastest C/C++ compiler available, and LLVM is not the fastest compiler framework either! So as a project, it seems to me that LLVM has not put the tradeoff on the speed/efficiency h...

Is there any benchmark or does anyone have tried which one is fastest? Regards, -- Thiago Vinhas de Moraes ________________________________________________________ SimpleWeb Tecnologia Inovativa Soluções em cloud computing e gerenciamento de TI Av. das Américas, 500 - Bloco 23 / Sala 215 - Rio de Janeiro - RJ Tel/Fax: 0800-8880-WEB / (21) 3...

Folks: Say I have a matrix: test=matrix(c(1,2,3),nrow=10,ncol=3) I would like to have an output character vector where each line is row's values delimited by commas, e.g.: "1,2,3" "2,3,1" "3,1,2" ... "1,2,3" What is the fastest way of doing this? I can paste() row-by-row but this seems an inefficient approach to doing this. Thanks! I'm not asking how to write a CSV file, mind you, I want the array as an R data.frame or vector. --j

Hi All, What is the fastest way of finding if any members of vector x fall in the range of the rows of matrix y? I do not want to use two for loops as this will take forever. Any help will be appreciated, best, salih [[alternative HTML version deleted]]

what is the fastest way to fetch results which are sorted by timestamp ? i want to use xapian as my search engine , use add_boolean_term(something) and add_value(0,sortable_serialise(get_timestamp())) to a doc. search through enquire.set_weighting_scheme(xapian.BoolWeight()) and enquire.set_sort_by_value(0,True)...

...of all the values in x$a. If it is, I want y to replace the whole row in x that has the lowest value in column a. This is how I'd do it. if(y$a>min(x$a)){ whichmin<-which(x$a==min(x$a)) x[whichmin,]<-y[1,] } I am wondering if there is a faster way of doing it. What would be the fastest possible way? I'd have to do it, unfortunately, many-many times. Thank you very much! -- Dimitri Liakhovitski gfk.com <http://marketfusionanalytics.com/> [[alternative HTML version deleted]]

Hi, I am a bit confused about what is the fastest way to run a rails application. I have seen examples which use Apache, mongrel, lighthttpd, fastcgi etc. Is there a correct way to do it? Or is it just a personal choice? Thanks, Keith --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to...

Let A be a m by n matrix and b a length n vector. What is the fastest vectorized code for doing for(j in 1:n) A[, j] <- A[, j]/b[j] ? solution 1: t(t(A)/b) solution 2: B <- matrix( rep(b, m), byrow=T, nrow=m ) A/B anything else? I have a program that uses this kind of operation million of times and I appreciate your input. Thanks. Jason Liao ====...

...2 according to a reclassification matrix such > pares [,1] [,2] [1,] 1 2 [2,] 5 6 [3,] 8 7 to get > b [,1] [,2] [,3] [1,] 1 2 3 [2,] 4 5 6 [3,] 7 8 9 [4,] 10 11 12 As both a and pares can be very large, I'd like to know the fastest way for this operation in R. I'm using: a[which(a%in%pares[,1])]<-pares[,2] and replace(a,which(ima%in%pares[,1]),pares[,2]) Is there any preference in terms of speed and/or R style? Is there another, better way? Thanks Agus Dr. Agustin Lobo Instituto de Ciencias de la Tierra (CSIC...

David Chisnall via llvm-dev <llvm-dev at lists.llvm.org> writes: > On 13 Dec 2016, at 19:02, Mehdi Amini via llvm-dev <llvm-dev at lists.llvm.org> wrote: >> >> I’m totally willing to believe you that it is not possible to write the fastest ELF linker on earth (or in the universe) with a library based and reusable components approach. But clang is not the fastest C/C++ compiler available, and LLVM is not the fastest compiler framework either! > > I’m not how it compares now, but at least when I started contributing and for a yea...

Dear useRs? I have the following problem! I have a function that calls one or more functions, depending on the input parameters. I am searching for the fastest way to select and execute the selected functions and return their results in a list. The number of possible functions is 10, however usually only 2 are selected (although sometimes more, even all). For examples, if I have function "myf" and the possible functions that I want to cal...

...he coefficients, but I wonder whether there is a *FAST* way to obtain the standard error of b. (I do know slow ways, but this would defeat the purpose.) is this the right idea? or will I just end up with more code but not more speed than I would with summary(lm())? can someone tell me the "fastest" way to generate b and se(b)? is there anything else that comes to mind as a recommended way to speed this up in R, short of writing everything in C? as always, advice highly appreciated. /iaw -- Ivo Welch (ivo.welch@brown.edu, ivo.welch@gmail.com) [[alternative HTML version deleted]]

...nit: #!/bin/sh echo '/var/core/%p' > /proc/sys/kernel/core_pattern ulimit -n 8096 ulimit -c unlimited exec /usr/local/sbin/dovecot -F (that way, together with incron, I can automatically generate the coredumps I'm posting all the time) If I apply a patch and recompile, what is the fastest way of restarting dovecot? Which part of the process structure can be killed and takes all it's children with it? ??runsvdir???runsv???ntpd ? ??runsv???dovecot???2*[dovecot-auth] ? ? ? ??1203*[imap] ? ? ? ??64*[imap-lo...

...Tampa, FL Office -----Original Message----- From: asterisk-users-bounces@lists.digium.com [mailto:asterisk-users-bounces@lists.digium.com] On Behalf Of Asterisk Sent: Thursday, August 18, 2005 4:02 PM To: asterisk-users@lists.digium.com Subject: [Asterisk-Users] Which AGI Development Software is fastest onAsterisk? I'm looking to develop some custom AGI that will be MySQL intensive. It appears Asterisk supports many different development environments. Which would be best suited for Asterisk and MySQL? Bart _______________________________________________ Asterisk-Users mailing list Asteri...

Is there a way to configure yum fastest mirror to only look for http mirrors not ftp? I have tried adding ftp and ftp:// to the exclude section in the config file with no luck. Any info would be much appreciated. Thank you -- Bo Lynch