similar to: fitting curve to data

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm generating a symmetric correlation matrix using a data matrix as input: mat <- cor(data.mat) My question is: Is there a more memory efficient way to store this data? For instance, since: all(mat == t(mat)) every value is duplicated, and I should be able to almost half the memory usage for large matrices. Any thoughts/comments? Cheers,

Are there any particular licences under which R packages must be released or is it the discretion of the author? The same question if the package is to be destined for CRAN? Kind regards, Nathan -- -------------------------------------------------------- Dr. Nathan S. Watson-Haigh OCE Post Doctoral Fellow CSIRO Livestock Industries Queensland Bioscience Precinct St Lucia, QLD 4067 Australia

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have a rectangular matrix of size 920 by 85. I'd like to coerce it into a square matrix such that all row/col names are present in the new matrix and the additional values are zero. As an example: A B C D A 1 2 3 4 E 5 6 7 8 F 9 10 11 12 Would be coerced to: A B C D E F A 1 2 3 4 5 9 B 2 0 0 0 6 10 C 3 0 0

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've written a function in R which takes a symmetrical matrix as input and processes all triplicate combinations of values from the matrix. The function looks something like: my_fun <- function(m) { if( nrow(mat) != ncol(mat) ) { stop("'m' must be a square matrix") } size <- nrow(m) for(x in 1:(size -2)) {

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm trying to add some Fortran 90 code to an existing package. When I compile and load the file manually like: SHELL> R CMD SHLIB file.f90 R> dyn.load("file.so") I can use the .Fortran() fine. However, when I try to build, install and load the library I seem to be missing something. I do a: SHELL> R CMD build dir SHELL> R

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I was wondering if anyone could point me in the right direction for reading up on writing tests in R. I'm writing some functions for inclusion into a package and would like to test them to ensure they're doing what I expect them to do. Are these approaches used for testing packages in CRAN? Cheers, Nathan - -- -

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'd like to be able to colour histograms along the diagonal using the colours stored in colnames(d): > d black blue brown cyan 1 0.96405751 -0.02964390 -0.060147424 -0.06460070 2 -0.03614607 0.95475444 -0.152382053 -0.07767974 3 -0.07095613 -0.05884884 -0.061289399 -0.06445973 4 -0.03708223 -0.05997624

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm trying to understand some C code in an R package I'm using. I'm address this question here as it's matrix algebra...and I'm no pro at that! the C command reads: double alpha = 1.0, beta = 0.0; dsyrk_("L", "N", nGenes, nGenes, & alpha, mat1, nGenes, & beta, mat2, nGenes); - From google,

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have some data generated as follows: <code> n <- 2000 work <- vector() for(x in 1:n) { work[x] <- sum(1:(n-x+1)) } plot(work) </code> What I want to do - ----------------- I want to split work into a number of unequal chunks such that the sum of the values in each chunk is approximately equal. The numbers in

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I'm trying to calculate Pearson correlation coefficients for a large matrix of size 18563 x 18563. The following function takes about XX minutes to complete, and I'd like to do this calculation about 15 times and so speed is some what of an issue. Does anyone have any suggestions on ways to speed this up? I'd wondered if using C++ code to

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Is there a library which is capable of identifying distinct clusters of size n from a series of XY coordinates? Failing this, I'd like to be able to to something like: Using a sliding window of size n along the x-axis I'd like to determine the distance between the center of the points in the window and the closest point outside the window. I

Dear All, I'm preparing a simple algorithm for matrix multiplication for a specific purpose, but I'm getting some unexpected results. If anyone could give a clue, I would really appreciate. Basically what I want to do is a simple matrix multiplication: (WB) %*% t(WB). The WB is in the disk so I compared to approaches: - Load 'WB' using 'read.table' (put it in WB.tmp) and

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I have two matrices: > m1 <- matrix(1,4,4) > m1 [,1] [,2] [,3] [,4] [1,] 1 1 1 1 [2,] 1 1 1 1 [3,] 1 1 1 1 [4,] 1 1 1 1 > m2 <- matrix(0,3,3) > diag(m2) <- 1 > m2 [,1] [,2] [,3] [1,] 1 0 0 [2,] 0 1 0 [3,] 0 0 1 I want to get indicies from m2

Hi r-users,   I would like to extract the data that match.  Attached is my data: I'm interested in matchind the value in column 'intg' with value in column 'rand_no' > cbind(z=z,intg=dd,rand_no = rr)             z  intg rand_no    [1,]  0.00 0.000   0.001    [2,]  0.01 0.000   0.002    [3,]  0.02 0.000   0.002    [4,]  0.03 0.000   0.003    [5,]  0.04 0.000   0.003    [6,] 

This must be easy to do..... I have a vector and a lookup data.frame: > v [1] "5" "234" "234" "42-43" "234" "42-43" "234" "234" "42-43" "234" "5" "234" "234" "5" "234" "234" "5"

Hi I apologise for this question as it really must be a FAQ. Unfortunately, I can't find the answer and I'm tired of looking at endless google results A colleague of mine works for a state government department that has a policy against open source software or software tainted by open source. Other government departments in the same state use R but this particular department is driven

Hi all, I'm in the middle of setting up a build environment for OpenWRT and it looks like the packages need flex. Looking at the CentOS repositories, it looks as though the flex package is tagged as fc6 - it also looks like there is no flex-devel package at all. Does anyone know what the go is here? Available Packages Name : flex Arch : i386 Version: 2.5.4a Release: 41.fc6 Size : 124

Perhaps update the codec to handle 32 bit files while remaining the same otherwise? Dennis Brunnenmeyer FULL FIDELITY MUSIC ------------------------------------------------------------------------ On 6/19/2012 12:00 PM, flac-dev-request at xiph.org wrote: > Send flac-dev mailing list submissions to > flac-dev at xiph.org > > To subscribe or unsubscribe via the World Wide Web, visit

Hi all, I''ve had a report of a host starting to give this output: Oct 7 19:36:37 kernel: INFO: rcu_sched self-detected stall on CPU { 2} (t=273561 jiffies g=17919 c=17918 q=9688) Oct 7 19:36:37 kernel: sending NMI to all CPUs: Oct 7 19:36:37 kernel: xen: vector 0x2 is not implemented Kernel is 3.11.2. Xen is 4.2.3. I''ve seen various random reports of this, but never a follow

On 2019-12-13 04:54, Kevin Stange wrote: > I don't want to burden Steven Haigh any, but I wonder if there's a way > we could combine some of our efforts to make both "Xen made easy!" and > the Virt SIG Xen easier to manage. I've been thinking about this for a while. The problem has been the workflows between myself and the SIG are so far apart, its hard to look at