search for: reshuffle

Displaying 20 results from an estimated 97 matches for "reshuffle".

2009 Sep 01
1
permutation and reshuffling
Hi, I'm looking for an efficient code that will enable me to reshuffle data (phenotype) for certain number of individuals and creating a loop that will randomly simulate it for 10000 times *(permutation)*. I also need to find how I keep the information (p value for each SNP) gathered for all the 10000 iterations. My data set looks like this (n=500): Individual # Ph...
2009 Mar 14
1
Any ideas for the most efficient algoritm to reshuffle tiles based on this description.
This was exactracted from a 8192x4 texture, with 32x4 tiles. 4 patterns appears, each 8x128 bytes long. these patterns are repeated, and one is always left out. So 123, 234, 134, 124. The repetetive cycle is therefore 4x3x8x128 = 12288 bytes long. I've included the color code ods file, which contains the normal -> actual position. I have no idea how this goes for larger tiles (is the
2010 Jun 21
0
EXTLINUX gone, branch reshuffling
In preparation for 4.00 product release, I have implemented the following changes: a) EXTLINUX is now finally removed as a separate derivative. SYSLINUX and EXTLINUX are fully merged as a single entity. The program extlinux(8) remains as an online nstaller for the SYSLINUX bootloader (ldlinux.sys), since the syslinux program (on Unix) is an offline installer. -> These may get
2009 Apr 15
2
How to Reshuffle a distance object
I would like to randomly shuffle a distance object, such as the one created by ade4{dist.binary} below. My first attempt, using sample(jc.dist) creates a shuffled vector, losing the lower triangular structure of the distance object. How can I Ishuffle the lower triangular part of a distance matrix without losing the structure? Thanks. --Dale x1 <- c(rep(0,4),1) x2 <- c(rep(0,2),rep(1,3))
2023 May 23
1
[PATCH vhost v9 04/12] virtio_ring: virtqueue_add() support premapped
On Mon, May 22, 2023 at 11:03:26PM -0700, Christoph Hellwig wrote: > On Wed, May 17, 2023 at 10:22:41AM +0800, Xuan Zhuo wrote: > > virtuque_add() adds parameter premapped. > > Well, I can see that. But why? Assuming it's intentional, it should say something along the lines of "The parameter is unused for now, and all callers just pass false. It will be used by a
2009 Aug 31
1
permutation test - query
Hi, My query is regarding permutation test and reshuffling of genotype/phenotype data I have been using the haplo.stats package of R. for haplotype analysis and I would like to perform an analysis which I'm requesting your advice. I have a data set of individuals genotyped for 12 SNP and a dichotomous phenotype. At first, I have tested each of those SNP independently in order to bypass
2009 Aug 10
1
Sorting text docs based on document meta values in tm()
Hi all, I wonder if there's any way to reshuffle the text collection by the document meta values. For instance, if I have 5 documents that correspond to the following meta data: MetaID Sex Age 0 M 38 0 M 46 0 F 24 0 F 49 0 F 33 Can I reorder the text documents based on the ascending ord...
2012 Jul 31
3
[LLVMdev] mcjit
Thu Jul 12 03:42:12 CDT 2012, Verena Beckham verena at codeplay.com : > I would not say it is trivial, having done it myself. > > MCJIT also doesn't support multiple modules, and it does not do JITing > on demand, instead, it does all of it at the same time in the > constructor (unless that is what you call "not lazy"). > So depending on how you've written your
2011 Sep 22
10
data recovery
Hi, Need help on data recovery. Suddenly my disk device's geometry has been changed to something that doesnot make any sense. Its a 1.8TB in size and had only one single partition. Now I can see 3 partitions sde1, sde2 and sde2 of sizes 130M, 140GB and 10GB. Is there any way to recover data from these newly created disk devices? Thanks Paras.
2019 Aug 07
2
Win 10 and C 6 CUPS
...and a >> USB laserjet? >> > Since forever (ah, about Win 2000) Windows knows UNIX printing. Making > windows box talking to UNIX print server its native language makes the > most robust setup. It is, however not turned on by default. So (adjust to > your version as Microsoft reshuffles location of all the same tools with > ever release): > > Control Panel ?> Programs and Features ?> Enable/disable features > > In the long list there is Printing, click on it to expand, and enable LPR > and LPD AHHHH!!! That I had no clue about (I do *not* do Windows). &gt...
2017 Jul 29
2
ISelDAGToDAG breaks node ordering
..., but other memory // accessing instructions have something similar... MachineSDNode::mmo_iterator MemOp = MF->allocateMemRefsArray(1); MemOp[0] = cast<MemSDNode>(N)->getMemOperand(); cast<MachineSDNode>(LDW)->setMemRefs(MemOp, MemOp + 1); // Reshuffle LDW's results so that the first two match LOAD's result // type SDValue Unpack[] = { SDValue(LDW, 0), SDValue(LDW, 2), SDValue(LDW, 1) }; SDNode* NN = CurDAG->getMergeValues(Unpack, SDLoc(N)).getNode(); ReplaceUses(N, NN); CurDAG->RemoveDeadNode(N);...
2020 Sep 09
1
[PATCH v2 2/7] kernel/resource: move and rename IORESOURCE_MEM_DRIVER_MANAGED
...ar from beautiful (and confusing), > and the bit only applies to SYSRAM. So let's move it out of the > bus-specific (PnP) defined bits. > > We'll add another SYSRAM specific bit soon. If we ever need more bits for > other purposes, we can steal some from "desc", or reshuffle/regroup what we > have. > > Cc: Andrew Morton <akpm at linux-foundation.org> > Cc: Michal Hocko <mhocko at suse.com> > Cc: Dan Williams <dan.j.williams at intel.com> > Cc: Jason Gunthorpe <jgg at ziepe.ca> > Cc: Kees Cook <keescook at chromium.org&gt...
2012 Jul 31
0
[LLVMdev] mcjit
Hi Pawel, Some of the issues I have come across (from memory!) are * MCJIT doesn't work on Windows, because it doesn't support COFF. If you want to use it on Windows you have to either target Mach-O (not clear whether that will work in general) or ELF (need to get a patch from Intel to be able to use this). * Make sure you include MCJIT.h and link in MCJIT.lib, otherwise (even if
2010 Jul 27
4
re-sampling of large sacle data
...8330689 -0.168225938 per the dataframe above, step 1: do the following doit=function(x)c(sum_positive=sum(x[-1][x[-1]>0]),sum_negative=sum(x[-1][x[-1]<0])) pos_neg_pool<-t(apply(myDF,1,doit)) if not first run then append the data to the pos_neg_pool step2: reshuffle the data by columns then do step1, this step need to run 10000 times; output will be 23*10000=230,000 rows. Can anyone point out how to automate this 10000 runs in R? Thanks, -- View this message in context: http://r.789695.n4.nabble.com/re-sampling-of-large-sacle-data-tp2304165...
2019 Aug 06
4
Win 10 and C 6 CUPS
Is there any way, other than installing CUPS on windows, to get the damn Win laptop to print to my C 6 box, which has CUPS running and a USB laserjet? mark
2020 May 07
2
[PATCH v3 07/15] mm/memory_hotplug: Introduce offline_and_remove_memory()
On 07.05.20 13:34, Michael S. Tsirkin wrote: > On Thu, May 07, 2020 at 01:33:23PM +0200, David Hildenbrand wrote: >>>> I get: >>>> >>>> error: sha1 information is lacking or useless (mm/memory_hotplug.c). >>>> error: could not build fake ancestor >>>> >>>> which version is this against? Pls post patches on top of some tag
2020 May 07
2
[PATCH v3 07/15] mm/memory_hotplug: Introduce offline_and_remove_memory()
On 07.05.20 13:34, Michael S. Tsirkin wrote: > On Thu, May 07, 2020 at 01:33:23PM +0200, David Hildenbrand wrote: >>>> I get: >>>> >>>> error: sha1 information is lacking or useless (mm/memory_hotplug.c). >>>> error: could not build fake ancestor >>>> >>>> which version is this against? Pls post patches on top of some tag
2010 Oct 18
2
Randomly shuffle an array 1000 times
Dear List, I have a table i have read into R: Name Yes/No John 0 Frank 1 Ann 0 James 1 Alex 1 etc - 800 different times. What i want to do is shuffle yes/no and randomly re-assign them to the name. I have used sample() and permute(), however there is no way to do this 1000 times. Furthermore, i want to copy the data into a excel spreadsheet in the same order as the data was input so i can
2017 May 23
2
Odd Virsh Capabilities response
Tried to migrate a few VMs from existing system to an older host that we threw in the rack to facilitate some server reshuffling. Migration complained about lack of capabilities (which I expected its an older server) but when I looked at what I should throw into the xml file I got a core2duo when it should have been at least Penryn or something (Xeon E5345) Of course the VMs work fine with
2002 Mar 28
3
Vectorizing closest match
If anyone has a very fast vectorized method for doing the following I would appreciate some help. I want to avoid outer() to limit memory problems for very large n. Let x = real vector of length n y = real vector of length n w = real vector of length m, m typically less than n/2 but can be > n z = real vector of length m For w[i], i=1,,,m, find the value of x that is closest to w[i]. In