similar to: [Q] Sparse Matrices in R?

Consider the following little "benchmark" > require(Matrix) > tmp <- Matrix(c(rep(1,1000),rep(0,9000)),ncol=1) > ind <- sample(1:10000,10000) > system.time(tmp[ind,]) user system elapsed 0.004 0.001 0.005 > ind <- sample(1:1000,10000,replace=TRUE) > system.time(tmp[ind,]) user system elapsed 0.654 0.006 0.703 >

Hi. I have an old Xen para virt vm which I created using sparse file. Is there any way to convert this vm image to non-sparse without shutting down the vm?. Thanks Paras.

tree: https://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git vhost head: 84d40e4b4bc64456abf5ef5663871053b40e84ac commit: fee8fe6bd8ccacd27e963b71b4f943be3721779e [38/45] vdpa: make sure set_features in invoked for legacy :::::: branch date: 5 hours ago :::::: commit date: 6 hours ago config: x86_64-randconfig-s021-20200727 (attached as .config) compiler: gcc-9 (Debian 9.3.0-14) 9.3.0

https://bugzilla.samba.org/show_bug.cgi?id=7337 Summary: sparse files not equally sparse on destination Product: rsync Version: 3.0.7 Platform: Other OS/Version: Linux Status: NEW Severity: normal Priority: P3 Component: core AssignedTo: wayned at samba.org ReportedBy: brian at

Hello, I am working with a sparse matrix that is approx. 13,900 by 14,100. My goal is to select a row out of the matrix and create a new matrix with that row repeated 13,900 times without having to do any looping. Example: Starting Matrix: exampleMatrix 3 x 4 sparse Matrix of class "dgCMatrix" [1,] 1 . . . [2,] . 1 . 0.5 [3,] . . 1 .. New Matrix:.. newExampleMatrix 3 x 4 sparse

tree: https://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git config-endian head: 6aef2378a564fea8e69c0419d94dc3ad9b4b7a99 commit: 0cf222ef876b95893406eebe685e595d88de0950 [33/36] virtio_net: correct tags for config space fields config: parisc-randconfig-s032-20200710 (attached as .config) compiler: hppa-linux-gcc (GCC) 9.3.0 reproduce: wget

Rusers: I am trying to apply a quadratic discriminant function to find the best classification outcomes. 1 is assigned to the values greater than a threshold value; and 0 otherwise. I would like to see how the apparent error rates and the optimal error rate change with increasing threshold values. I have a 1000*10 data matrix: n=1000 and p=10. Here is what I wrote so far, but seems to be

An embedded and charset-unspecified text was scrubbed... Name: sparse-fs_ext3_super.patch URL: <http://listman.redhat.com/archives/ext3-users/attachments/20050620/af49961a/attachment.ksh>

Can ext2 or ext3 filesystem manage sparse files? And so, in which way? Does it use extents? Thanks in advance. Daniele

Hi, I noticed that using a sparse file as a loop device leads to non journaled block allocation in Ext3. Is this something that should be fixed? - Peter -

We need to use le32_to_cpu to test rec->e_cpos in ocfs2_dinode_insert_check. Signed-off-by: Tao Ma <tao.ma at oracle.com> --- fs/ocfs2/alloc.c | 3 ++- 1 files changed, 2 insertions(+), 1 deletions(-) diff --git a/fs/ocfs2/alloc.c b/fs/ocfs2/alloc.c index 3a9e5de..19e3a96 100644 --- a/fs/ocfs2/alloc.c +++ b/fs/ocfs2/alloc.c @@ -176,7 +176,8 @@ static int

Looks like the subarch tree has been checked in. Does this mean 3.0.1 has been pushed out to include more? Or do we release 3.0.1 once the new tree is fully tested? Jun --- Intel Open Source Technology Center ---- From: xen-changelog-bounces@lists.xensource.com [mailto:xen-changelog-bounces@lists.xensource.com] On Behalf Of Xen patchbot -unstable Sent: Monday, January 30, 2006 4:08 PM To:

An embedded and charset-unspecified text was scrubbed... Name: not available Url: http://lists.linux-foundation.org/pipermail/virtualization/attachments/20080423/f5baa8b7/attachment.txt

Hi, I am trying to read in a large and highly sparse ARFF file into R which was produced by WEKA. However the package 'RWeka' just chokes on this file. The data set has about 40k observations and about 20k dimensions. Even after 1hr read.arff method of RWeka is still trying to read in the file, whereas WEKA is able to read it in in less than 20seconds. What are my options at this

vm_normal_page() @ linux-2.6-xen-sparse/mm/memory.c ... if (!vma->vm_flags & VM_RESERVED) print_bad_pte(vma, pte, addr); note:VM_RESERVED=0x00080000 This if clause is always false. Should it be "if (!(vma->vm_flags & VM_RESERVED))" ? -- yamahata _______________________________________________ Xen-devel mailing list

I have data on ~340000 cases where it is desired to predict binary outcome, Withdrawn, using up to 8, A:H, predictors in a 3 x 2^7 design, but where the frequencies in these 168 cells vary enormously (1--108000). As well, there are two additional variables, Agency and Office, and it is desired, among other things, to determine if the rates vary with Agency and Office controlling for A - H. I fit

-------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.samba.org/pipermail/rsync/attachments/20120906/95019970/attachment.html>

I started playing with btrfs last night, and I must say that I am very excited! I do have one question so far. Since I was learning, I created a sparse file, and then used mkfs to get a btrfs filesystem. I entertained myself with that for a while, and then decided that I wanted to try out the multi device support. I found that the device add command requires the device to be a block device, and

We have put a new package sparsenet on CRAN. Sparsenet fits regularization paths for sparse model selection via coordinate descent, using a penalized least-squares framework and a non-convex penalty. The package is based on our JASA paper Rahul Mazumder, Jerome Friedman and Trevor Hastie: SparseNet : Coordinate Descent with Non-Convex Penalties. (JASA 2011)

We have put a new package sparsenet on CRAN. Sparsenet fits regularization paths for sparse model selection via coordinate descent, using a penalized least-squares framework and a non-convex penalty. The package is based on our JASA paper Rahul Mazumder, Jerome Friedman and Trevor Hastie: SparseNet : Coordinate Descent with Non-Convex Penalties. (JASA 2011)