search for: densely

Hi I have just dwonloaded QCA3 onto this machine (ubuntu, karmic, amd64) and a mac. The examples run fine on teh mac, but crashed R on ubuntu. Any help much apprecia\ted. Thanks Richard ------------------------------------------------------------------------------ Terminal log: > conditions <- >

I have recently converted from S-Plus (Dec Alpha) to R (Mandrake 10.0). The differences are subtle but in some cases not easily converted. My Splus Command plotting deck was over 1200 lines and R has simplified this down to 900 lines so far. I do a lot of mapping with polygons and I am trying to figure out how to increase the default size of the fill boxes in the legend call. Splus had a

Dear all, I've been getting different results from the sparse and dense version of model.Matrix when used with sparse contrasts and interactions between factors. The same happens when using model.matrix and sparse.model.matrix. When calculating list.contrasts I get the same results for sparse and dense contrasts (except the type of the matrix is different of course). However, when I use these

Dear all, I am including in a plot 6 different lines (?lines) with 6 different line types. The problem is that I have so dense information that the line types are not visible any more.   In the code below myLength<-length(currentSet) plot(seq(from=1,to=myMax,length.out=myLength),currentSet, type="l",xlim=c(1,myMax),axes=F,...) the myLength is 100.000+ elements. I would like to ask

I have not been able to find a way to do dense rank in R Here is an example of what I need rank() gives the following 5 rank 1 7 rank 2 7 rank 2 9 *rank 4* but I want 5 rank 1 7 rank 2 7 rank 2 9 *rank 3* * * thanks SS [[alternative HTML version deleted]]

Hi, I'm trying to write an extremely dense tinc-mini-howto. You can see it at: http://keetweej.vanheusden.com/~folkert/tinc_mini_howto.html Please send me suggestions on how I can make things better and such. Oh, and if someone could tell me how to configure tinc so that it authenticates against the host on the other side, please tell me! (couldn't figure that one out) Folkert. Tinc:

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".

On Tue, Nov 12, 2013 at 4:14 PM, Chris Lattner <clattner at apple.com> wrote: > I'm moderately opposed to just encoding these in a string format. I think > we can do something substantially better both for space, time, and > readability. Fundamentally, there is no reason for the original metadata > node you describe to not *encode* its operands into a dense bit-packed blob

On Nov 12, 2013, at 1:28 PM, Chandler Carruth <chandlerc at google.com> wrote: > On Mon, Nov 11, 2013 at 11:29 PM, Chris Lattner <clattner at apple.com> wrote: > Hi Manman (and llvmdev), > > I filed these two bugs to track the ideas that I was cooking: > > http://llvm.org/bugs/show_bug.cgi?id=17891 > http://llvm.org/bugs/show_bug.cgi?id=17892 > > TL;DR:

Hey Parth, Thanks for the reply. I am considering implementing a cosine distance metric too, along with euclidian distance because of the dimensionality issue that comes in with K-Means and euclidian distance metric. That does help when we deal with sparse vectors for documents. The particular problem I'm having is representing centroids in an efficient way. For example, when we find the mean

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, I'm doing some basic operations on large sparse matrices, for example getting a row. it takes close to 30 seconds on a 3Ghz machine, and shots the memory usage up to the sky. I suspect there are dense intermediary steps (which, if true would defeat the purpose of trying to use sparse representaitons). As much as I try understanding the

Dear list, The help page for library/require contains the following paragraph in the section "Packages that require other packages": The source code for a package that requires one or more other packages should have a call to 'require', preferably near the beginning of the source, and of course before any code that uses functions, classes or methods from the

Hello, everyone, I created a dense map like this: DenseMap<Loop *, int> ls; And I have a module which contains 3 functions: function F and it has a loop which is " Loop at depth 1 containing: %1<header><exiting>,%3,%5<latch> " function G and it has two loops which are " Loop at depth 1 containing: %8<header><exiting>,%10,%14<latch>

hi all, i have a file of the following format that i want to read into a matrix: 010101001110101 101010010111110 010010100100000 ... it has no headers or row names. I tried to use read.table(), but it doesn't allow me to specify nothing as the column separator (specifying sep='' means whitespace for that function). read.fwf doesn't seem appropriate either. [[alternative HTML

Call me dense, but now I am more confused. I have tried with and without quotes ... all over the place (i.e. in the smb.config and on the command line) and everything still results in errors, although not always exactly the same. Messing with the command line results in things like this: ERROR(runtime): uncaught exception - (9711, 'WERR_DNS_ERROR_RECORD_ALREADY_EXISTS')   File

I'm seeking some advice on effectively using the new Matrix library in R1.9.0 for operations with large dense matrices. I'm working on integral operator models (implemented numerically via matrix operations) and except for the way entries are generated, the examples below really are representative of my problem sizes. My main concern is speed of large dense matrix multiplication. In R

Dear John, First thing, the 3 loops in Densemap are all " Loop at depth 1 containing: %1<header><exiting>,%3,%5<latch> " in the 3 functions. The dense map is in a ImmutablePass. I got it in FunctionPass and tried insert the information in this FunctionPass. So to turn the FunctionPass to ModulePass may be a better idea? Another interesting thing: if just before

On Tue, Nov 12, 2013 at 4:19 PM, Chandler Carruth <chandlerc at google.com>wrote: > > On Tue, Nov 12, 2013 at 4:14 PM, Chris Lattner <clattner at apple.com> wrote: > >> I'm moderately opposed to just encoding these in a string format. I think >> we can do something substantially better both for space, time, and >> readability. Fundamentally, there is no

I have data set that I wish to solve with the Matrix package's sparse matrix functionality. The speed improvements that it has achieved are amazing, with my dense matrix solutions never taking really long enough to time in what I've been able to time so far. However, before I can solve my full linear model, I need to be able to read in all the data, and therein lies the rub.

How would I parse the area code from this variable? Number=2515551212 Sorry for the dense question, I don't seem to be able to find an appropriate function for parsing left to right.