similar to: Finding a basis in a set of vectors

Hi, Is there any way to load workspaces (e.g. stuff from save.image) from the command line? I'm on Linux, and would find this very helpful. I'm guessing this functionality can be duplicated with a skillful bash script to rename the particular file to .RData (and then back once R terminates), but I'm wondering if there's a better way. Zhou Fang

Okay, someone explain this behaviour to me: Browse[1]> replace(rep(0, 4000), temp1[12] , temp2[12])[3925] [1] 0.4462404 Browse[1]> temp1[12] [1] 3926 Browse[1]> temp2[12] [1] 0.4462404 Browse[1]> replace(rep(0, 4000), 3926 , temp2[12])[3925] [1] 0 For some reason, R seems to shift indices along when doing this replacement. Has anyone encountered this bug before? It seems to crop up

Hi, This is probably really obvious, by I can't seem to find anything on it. Is there a fast version of ave for when the data is already sorted in terms of the factor, or if the breaks are already known? Basically, I have: X = 0.1, 0.2, 0.32, 0.32, 0.4, 0.56, 0.56, 0.7... Y = 223, 434, 343, 544, 231.... etc of the same, admittedly large length. Now note that some of the values of X are

Hi, Possibly a dumb question, but I wonder if anyone can help me with this. What I want to do, essentially, is to loop over all ordered subsets of a given size of a certain set. Ultimately, the idea is to find the subset that maximises a certain value. The set in question is likely large (the subset size is likely small, though), so things like combn don't seem to be a good solution. The

Hi all, Basically, I have data in the format of (up to 1 gig in size) text files containing stuff like: F34060F81000F28055F8A000F2E05EF8F000F34 (...) The data is basically strings denoting hex values (9 = 9, A = 10, B = 11, ...) organised in fixed, small blocks. What I want to do is to read in a specified segment of the string, break it up into blocks, and convert it into a vector of integers

Hi all, I wonder if this kind of questions are ok in this list... Quick question: What does it mean than the rank of the QR decomposition of a NxN matrix is N-1 ? m: NxN matrix qr(m)$rank equal to (N-1) Long version: I'm doing a manova on a matrix of 10 variables and 16 observations. > dim(tmp) [1] 16 10 > fit <- manova( tmp ~ treatment*mouse ) >results <-

Le 22/01/2018 ? 17:40, Keith O'Hara a ?crit?: > This behavior is noted in the qr documentation, no? > > rank - the rank of x as computed by the decomposition(*): always full rank in the LAPACK case. For a me a "full rank matrix" is a matrix the rank of which is indeed min(nrow(A), ncol(A)) but here the meaning of "always is full rank" is somewhat confusing. Does it

Hi, Should be a quickie: I want to make a datafile in R for plotting in gnuplot (which has friendlier 3D plotting options, as far as I can tell). So, I want to create a file with contents along the lines of #File begins 0 0 10 0 13 10 0.2 2 10 1 0 10.12 1 1 5 1 2 10 2 0 10 2 1 1 2 2 10 It's probably fairly easy to write the space-separated numbers with write.table, sink, or similar. But

Le 23/01/2018 ? 08:47, Martin Maechler a ?crit?: >>>>>> Serguei Sokol <sokol at insa-toulouse.fr> >>>>>> on Mon, 22 Jan 2018 17:57:47 +0100 writes: > > Le 22/01/2018 ? 17:40, Keith O'Hara a ?crit?: > >> This behavior is noted in the qr documentation, no? > >> > >> rank - the rank of x as

I think one needs an LU decomposition rather than QR. However, I couldn't find anything off the shelf to do an LU, other than learning that determinant() now uses LU instead of QR or SVD, so the code to do it must be in there for those that want it. You'll probably need to divide rows of U by the first entry if you insist on the unique reduced REF. However, I can't see any reason

Hi, > ----- Original Message ----- >>> ----- Original Message ----- >>>> Hi all, >>>> My recent commit r187027 fixed a simple oversight of forgetting >>>> to >>>> check for __ppc__ (only checking __powerpc__), which broke my >>>> powerpc-apple-darwin8 stage1 tests, since the system gcc only >>>> provided

Hello, Like QR decomposition, I am looking for decomposition to get U and V matrix of SVD decomposition (according to LINPACK, X = UDV'). Do you know if there is a function which could calculate this decomposition? Look forward to your reply, Haleh

Hey, R-listers, I have a question about determining the orthogonal basis vectors. In the d-dimensinonal space, if I already know the first r orthogonal basis vectors, should I be able to determine the remaining d-r orthognal basis vectors automatically? Or the answer is not unique? Thanks for your attention. Fred

Hi, For anyone who might be interested, I've thrown together a little page to track my builds of llvm and clang, both release 3.0 and svn-trunk, on powerpc-darwin8. http://www.csl.cornell.edu/~fang/sw/llvm/ I'll update the list of logs each time I svn-update and build. It's nowhere as nice as a real buildbot page, but it's better than nothing. 3.0 still has over 20 test

> ----- Original Message ----- >> Hi all, >> My recent commit r187027 fixed a simple oversight of forgetting to >> check for __ppc__ (only checking __powerpc__), which broke my >> powerpc-apple-darwin8 stage1 tests, since the system gcc only >> provided >> __ppc__. I was wondering if this justifies using simpler macros like >> >> #define

----- Original Message ----- > > ----- Original Message ----- > >> Hi all, > >> My recent commit r187027 fixed a simple oversight of forgetting > >> to > >> check for __ppc__ (only checking __powerpc__), which broke my > >> powerpc-apple-darwin8 stage1 tests, since the system gcc only > >> provided > >> __ppc__. I was

Hi, Thanks for the quick reply again. > On Thu, Dec 15, 2011 at 1:17 PM, David Fang <fang at csl.cornell.edu> wrote: >> Hi, >> >> I've bootstrapped llvm/clang from svn-trunk on powerpc-darwin8 (g++-4.0.1), and >> have the following test results to share. >> Summary below, full log at: >>

18.01.2012, 02:46, "David Fang" <fang at csl.cornell.edu>: > Hi, >          For anyone who might be interested, I've thrown together a little > page to track my builds of llvm and clang, both release 3.0 and > svn-trunk, on powerpc-darwin8. > > http://www.csl.cornell.edu/~fang/sw/llvm/ > > I'll update the list of logs each time I svn-update and

On Wed, Jan 18, 2012 at 10:51:38PM +0400, Konstantin Tokarev wrote: > > > 18.01.2012, 02:46, "David Fang" <fang at csl.cornell.edu>: > > Hi, > > ?????????For anyone who might be interested, I've thrown together a little > > page to track my builds of llvm and clang, both release 3.0 and > > svn-trunk, on powerpc-darwin8. > > > >

Hello Tobias, Thank you for the suggestion! Aditya also mentioned this. I will look into it. Best regards, Ruijie Ruijie Fang Email: ruijief at princeton.edu On Tue, Jun 2, 2020 at 12:48 PM Tobias Hieta <tobias at plexapp.com> wrote: > Hello Ruijie, > > One other workload that would be interesting to test might be clang > itself. Building clang with PGO information is a