similar to: Fox's algorithm?

I need to multiply to very large, nonsparse matrices, and so get the error "allocMatrix: too many elements specified". Is there a way to set the limit for allocMatrix? In my case, the two matrices, A and B, are nxm and mxp where m is small, so I could subdivide each into blocks of submatrices A=rbind(A1,A2,...) and B=cbind(B1,B2,...) then multiply each pair of submatrices, but I was

I''m writing my own plugin and all the plugins I''ve seen use class_eval in the method that is called in the including module. For example: http://wiki.rubyonrails.com/rails/pages/HowToWriteAnActsAsFoxPlugin module Foo module Acts #:nodoc: module Fox #:nodoc: def self.included(base) base.extend(ClassMethods) end # declare the class level

Yes you are right ... an example is mandatory. So ... I have a matrix of 0 with just a single 1 per row and per column I need to extract all maximal 'diagonal' submatrices Let's say I have the following matrix A B C D E a 0 1 0 0 0 b 1 0 0 0 0 c 0 0 1 0 0 d 0 0 0 1 0 e 0 0 0 0 1 well I would like to get, for this example, the two following submatrices A B C D E

Hi all, I'm working with a large data set (on the order of 300X300) and trying to apply a function which compares the elements of all possible 2x2 submatrices. There are rc(r-1)(c-1) such submatrices, so obviously the naive method of looping through the rows and columns is computationally unfeasible for my data set: for(i in 1:(nrow(data)-1)) { for(j in (i+1):nrow(data)) { for (m

Hello, I'm running an Debian etch box with unstable and ever since the last upgrade to dovecot, I've seen odd things. At times, I would see emails would go missing from the Inbox or other folders, and I couldn't move emails that were moved from the Inbox to another folder back into the Inbox. These have seen gone away since I removed all dovecot.* files and .index* files from my

Hello. I am trying to optimize a set of parameters using /optim/ in which the actual function to be minimized contains matrix multiplication and is of the form: SUM ((A%*%X - B)^2) where A is a matrix and X and B are vectors, with X as parameter vector. This has worked well so far. Recently, I was given a data set A of size 360440 x 1173, which could not be handled as a normal matrix. I

Hi everybody, I'm looking for an optimal way to split a big matrix (e.g. ncol = 8, nrow=8) into small square submatrices (e.g. ncol=2, nrow=2) For example If I have > h [,1] [,2] [,3] [,4] [,5] [,6] [,7] [,8] [1,] 1 9 17 25 33 41 49 57 [2,] 2 10 18 26 34 42 50 58 [3,] 3 11 19 27 35 43 51 59 [4,] 4 12 20 28 36

Hi, I have a matrix of say 1024x1024 and I want to look at it in chunks. That is I'd like to divide into a series of submatrices of order 2x2. | 1 2 3 4 5 6 7 8 ... | | 1 2 3 4 5 6 7 8 ... | | 1 2 3 4 5 6 7 8 ... | | 1 2 3 4 5 6 7 8 ... | ... So the first submatrix would be | 1 2 | | 1 2 | the second one would be | 3 4 | | 3 4 | and so on. That is I want the matrix to be evenly divided

Dear R community, I have trouble implementing a nested variance-covariance matrix in the lme function. The model has two fixed effects called End and logpgc, the response variable is the logarithm to base 2 of Intensity ( log2(Intensity) ) and the random effects are called Probe and ProbeNo. The model has the following nesting structure: A Pixel is nested within the ProbeNo,the ProbeNo is

I tried to use gpuCor function in the gputools package of R to calcuate the pairwise correlations of a matrix of 40,000 columns. Becuase there would be memory issues if I use the whole matrix at a time, I splitted the matrix into submatrix of 10,000 columns and then calculate the pairwise correlation of different submatrices. There are altogether 4 submatrices, so I need to calculate the pearson

Greetings list, I've just swapped from the "neural" package to the "nnet" package and I've noticed that the training is orders of magnitude faster, and the results are way more accurate. This leads me to wonder, what training algorithm is "nnet" using? Is it a modification on the standard backpropagation? Or a completely different algorithm? I'm

El código que me olvide pegar input m <- structure(c(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 5, 5, 5), .Dim = c(10L, 5L)) m ## output output <- c(1:3, 1:5, 1:2) output nfilas <- nrow(m) while(nfilas > 0) { diagonal <- diag(m)

Hello, I'm seeing this in my dovecot log file: imap(blair): Dec 16 13:53:06 Panic: file istream.c: line 93 (i_stream_set_read_limit): assertion failed: (stream->v_size == 0 || v_offset <= stream->v_size) I get this consistently when I search for the string "unknown C primitive" across 10 mailboxes using the Windows Netscape 4.80 client. If there's any more

Dear R users, I have a Hadamard matrix 16x15 and i want to put 16x5 submatrices in an array put i have an error. > A1<-matrix(c(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, + 1,0,1,0,1,0,1,0,1,0,1,0,1,0,1, + 0,1,1,0,0,1,1,0,0,1,1,0,0,1,1, + 1,1,0,0,1,1,0,0,1,1,0,0,1,1,0, + 0,0,0,1,1,1,1,0,0,0,0,1,1,1,1, + 1,0,1,1,0,1,0,0,1,0,1,1,0,1,0, + 0,1,1,1,1,0,0,0,0,1,1,1,1,0,0, + 1,1,0,1,0,0,1,0,1,1,0,1,0,0,1, +

https://bugzilla.samba.org/show_bug.cgi?id=6816 Summary: Delta-transfer algorithm does not reuse already transmitted identical blocks Product: rsync Version: 3.0.5 Platform: Other OS/Version: All Status: NEW Severity: enhancement Priority: P3 Component: core AssignedTo: wayned

Since the number of responses to my query was large, Roger has asked me to summarise the information. The summary is listed below Thanks to all the people who bothered to help me out: Alan Mead <adm@ipat.com> Beattie, Jay <JBeattie@accdir.com> Bruce Elrick <bruce.elrick@saltus.ab.ca> Christian Hammers <ch@lathspell.westend.com> David J. M. Karlsen

I''m setting up a new Rails project that is a nice front end for a company''s personnel database with a legacy schema. Unfortunately, the table that contains all the standard information (first name, last name, email address) has some 20+ columns, one of which is a BLOB of a picture of the person. Loading all this takes a while, when the application really only needs the

Estimado Javier, Gracias por tu mensaje. No, lo unico que requiero es la lista de números (i1, 2, 3, 1, 2, 3, 4, 5, 1, 2). Saludos cordiales, Jorge.- 2015-10-28 14:35 GMT-05:00 Javier Rubén Marcuzzi < javier.ruben.marcuzzi en gmail.com>: > Estimado Jorge I Velez > > > > No comprendo un punto, dices que deseas construir sub matrices y extraer > elementos de sub

(Hi, I tried sending this to ess-bugs, but got it bounced back: "user unknown". Hope this isn't too off-topic for ess-help. Scot) I'm using Xemacs 21.4, ess 5.1.24, on Windows 98 SE, with John Fox's configuration files: (http://socserv.mcmaster.ca/jfox/Books/Companion/ESS/index.html) and am getting the end-of-loop-timeout warning message I've seen reported to

Hi, I have a sparse Matrix (kronecker product of spline design matrices), and I need to multiply each row by a number to get another matrix. If the matrix is A and the numbers are stored in a vector k, with plain vanilla matrices I would do A*k But when using the Matrix package (class of A is "dgCMatrix"), I get the warning "coercing sparse to dense matrix for arithmetic".