Displaying 20 results from an estimated 97 matches for "reshuffling".
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 #
Phenotype
SNP1
SNP2
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
...tional, 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 follow-up patch".
It's not a bad way to split patches, this way actual logic in
the next patch stands out as opposed to being masked by
the code reshuffling following the extra parameter.
--
MST
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 SN...
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 order of age? Thank
you very much!!
--
View
2012 Jul 31
3
[LLVMdev] mcjit
...t; 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 code there is some significant
> reshuffling to do to, to move the creation of the ExecutionEngine to the
> end, and possibly add ExecutionEngines.
>
> Verena
Can you share any information how to do it?
>
>
> On 11/07/2012 17:14, Jim Grosbach wrote:
>>
>> On Jul 11, 2012, at 6:04 AM, Benjamin Kramer wrote:
&g...
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
Valeri Galtsev wrote:
>> On Aug 6, 2019, at 5:41 PM, mark <m.roth at 5-cent.us> wrote:
>>
>> 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?
>>
> Since forever (ah, about Win 2000) Windows knows UNIX printing. Making
> windows box talking to
2017 Jul 29
2
ISelDAGToDAG breaks node ordering
Hi,
During instruction selection, I have the following code for certain LOAD
instructions:
const LoadSDNode *LD = cast<LoadSDNode>(N);
SDNode* LDW = CurDAG->getMachineNode(AVR::LDWRdPtr, SDLoc(N), VT,
PtrVT, MVT::Other,
LD->getBasePtr(), LD->getChain());
// Honestly, I have no idea what this does, but other memory
// accessing instructions
2020 Sep 09
1
[PATCH v2 2/7] kernel/resource: move and rename IORESOURCE_MEM_DRIVER_MANAGED
On Tue, Sep 08, 2020 at 10:10:07PM +0200, David Hildenbrand wrote:
> IORESOURCE_MEM_DRIVER_MANAGED currently uses an unused PnP bit, which is
> always set to 0 by hardware. This is far 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
2012 Jul 31
0
[LLVMdev] mcjit
...esn'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 code there is some significant
>> reshuffling to do to, to move the creation of the ExecutionEngine to the
>> end, and possibly add ExecutionEngines.
>>
>> Verena
>
> Can you share any information how to do it?
>
>>
>>
>> On 11/07/2012 17:14, Jim Grosbach wrote:
>>>
>>> On Jul 1...
2010 Jul 27
4
re-sampling of large sacle data
myDF:
d1 d2 d3 d4 d5
-0.166910351 0.022304377 -0.00825924 0.008330689 -0.000925938
-0.166910351 0.022304377 -0.00825924 0.008330689 -0.000925938
-0.166910351 0.022304377 -0.00825924 0.008330689 -0.168225938
-0.166910351 0.022304377 -0.00825924 0.008330689 -0.168225938
-0.166910351 0.022304377 -0.00825924 0.008330689 -0.168225938
-0.166910351
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()
...r git tree not pruned yet.
> Do a new clone and they won't apply.
>
Yeah, most probably, it knows how to merge. I'm used to sending all my
-mm stuff based on -next, so this here is different.
I'll wait a bit and then send v4 based on latest linus/master, adding
the two acks and reshuffling the MAINTAINERS patch. Thanks.
--
Thanks,
David / dhildenb
2020 May 07
2
[PATCH v3 07/15] mm/memory_hotplug: Introduce offline_and_remove_memory()
...r git tree not pruned yet.
> Do a new clone and they won't apply.
>
Yeah, most probably, it knows how to merge. I'm used to sending all my
-mm stuff based on -next, so this here is different.
I'll wait a bit and then send v4 based on latest linus/master, adding
the two acks and reshuffling the MAINTAINERS patch. Thanks.
--
Thanks,
David / dhildenb
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 that cpu def so its not a bit...
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