similar to: How do you test for "consecutivity"?

I need to repeat an experiment 1000 times. Each experiment involves randomly selecting one ball each from two separate bags. Each bag contains 10 balls, numbered 1, 2, 3, ... , 10. So the probability of selecting any one pair of balls is equal to all others. For each experiment, what I need to do is assign a variable A which represents the maximum number out of the two balls selected; and a

Hi, I have a data frame and want to merge adjacent rows if some condition is met. There's an obvious solution using a loop but it is prohibitively slow because my data frame is large. Is there an efficient canonical solution for that? > head(d) rt dur tid mood roi x 55 5523 200 4 subj 9 5 56 5523 52 4 subj 7 31 57 5523 209 4 subj 4 9 58 5523 188 4 subj 4 7

> On Apr 17, 2019, at 5:02 AM, Arsenault, Matthew via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > This won’t happen with volatile load/store This is mostly true today, but AFAICT the LLVM memory model doesn’t actually offer this guarantee. It merely says that LLVM treats volatile like C / C++ treats volatile… which isn’t much of a guarantee because C / C++ volatile doesn’t

J?r?me, As a first attempt, how about the function below. It works (or not) by randomly sorting the rows and columns, then searching the table for "squares" with the corners = matrix(c(1,0,0,1),ncol=2) and subtracting them from 1 to give matrix(c(0,1,1,0),ncol=2) (and vice versa). Randomized matrices can be produced as a chain where each permutation is seeded with the previous one.

you guys sure get your panties in a bunch over something as silly as the iso file name. if you don't like the name, rename it... sheesh. -- john r pierce, recycling bits in santa cruz

On Thu, April 2, 2015 9:52 am, Always Learning wrote: > > On Wed, 2015-04-01 at 22:54 -0700, John R Pierce wrote: > >> you guys sure get your panties in a bunch over something as silly as the >> iso file name. > > You may wear them, many of us don't :-) > >> if you don't like the name, rename it... sheesh. > > Its about a consistent and logical

Please reference the prior RFC on EfficiencySanitizer. This is one of the performance analysis tools we would like to build under the EfficiencySanitizer umbrella. ==================== Motivation ==================== Knowing the working set size at periodic points during a given application's execution helps to understand its cache behavior, how its behavior changes over time, how its

Hi all, I have created a patch (up for review at: http://reviews.llvm.org/D17386) that does Loop Fusion implementation. Approach: Legality: Currently it can fuse two adjacent loops whose iteration spaces are same and are at same depth. Dependence legality: Currently, dependence legality cannot be checked across loops. Hence the loops are cloned along a versioned path, unconditionally fused

Dear list members, I want to perform in R the analysis "simultaneous confidence interval for multiple proportions", as illustrated in the article of Agresti et al. (2008) "Simultaneous confidence intervals for comparing binomial parameter", Biometrics 64, 1270-1275. If I am not wrong the R function implementing the Agresti et al. method is prop.test(). I ask an help because I

Dear R users, I have a dataframe (main.table) with ~30,000 rows and 6 columns, of which here are a few rows: id chr window gene xp.norm xp.top 129 1_32 1 32 TAS1R1 1.28882115 FALSE 130 1_32 1 32 ZBTB48 1.28882115 FALSE 131 1_32 1 32 KLHL21 1.28882115 FALSE 132 1_32 1 32 PHF13 1.28882115 FALSE 133 1_33 1

Hi, can someone explain whats the meaning of the two blocksizes in the first header of Vorbis, please? So far I assumed that they meant that 2^b0 and 2^b1 were the only two blocksizes used during the whole encode, but something makes me believe they are not: if b0 and b1 are 0xb8 respectively (that I interpeted as 2^11 = 2048 and 2^8 = 256) I observe 3 different deltas between each couple of

Hi devs, Recently I came across an interesting testcase that LLVM failed to optimize well. The test does some image processing, and as a part of it, it traverses all the pixels and computes some value basing on the adjacent pixels. So, the hot part looks like this: for(y = 0..height) { for (x = 0..width) { val = 0 for (j = 0..5) { for (i = 0..5) { val += img[x+i,y+j] *

 LLVM's optimizer combines stores to consecutive characters into a write of a single word.  For instance, if I have char A[4] and I write some static value to each element, these writes would be combined into a single 32-bit word write. I found this thread from 2009 -- it seems like it wasn't possible then. Has anything changed since? Neil -------------- next part -------------- An HTML

Hi, I am trying to use dunif and runif however, I have two problems: if I do dunif(1:10, min=1, max=10) I get 10 values, which summed give me 1.1111 I understand that the probability is computed as f(x) = 1 / (max-min) but in this case it looks wrong: I have 10 values, each one equiprobable, and the probability for each one should be 0.1 and not 0.11111 (which is, consistently with the

> Why do you want this? The goal is to share arrays between multiple tiles on a manycore architecture by splitting arrays between tiles. With a DRF memory model, it makes sense to elide multiple loads to the same memory location between barriers.; IIRC the semantics for volatile don’t allow this eliding. -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi, Thanks for the reply. Few thoughts inlined. On Fri, Feb 19, 2016 at 8:00 AM, Adam Nemet <anemet at apple.com> wrote: > Hi Vikram, > > On Feb 18, 2016, at 9:21 AM, Vikram TV via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > Hi all, > > I have created a patch (up for review at: http://reviews.llvm.org/D17386) > that does Loop Fusion implementation.

> But why is it desirable to avoid combining adjacent stores? If you’ve got DRF code then the combination can’t be observed. It’s more that the consecutive stores would be going to different tiles. If multiple stores are combined in IR, I don’t think they’d be able to decoupled in IR, unless there’s a way to always determine which global object an arbitrary GEP is pointing to. --------------

Hi. I'm very new to LLVM. For reasons to do with custom exception handling, we have a need to check IP/PC at runtime against code ranges. This can encompass multiple logically adjacent blocks. How to do this? I'm guessing:   insert a label at end of every block, takes it address, store that somewhere in our data; preferably as an offset from module or function start, but full address

Hi all I see the rsync source and rsync makes hashing table and search hashing table tag_table to find the index of array struct sum_buf , which is a element of struct sum_struct. According to the source code, variable last_i is used to encourage adjacent matches allowing the RLL coding of the output to work more efficiently. Why last_i makes more efficiency? I can't understanding what

Jean-Marc Valin <Jean-Marc.Valin@USherbrooke.ca> wrote: > > > I would think you might also do better if you interleaved packets when > > you did this: instead of sending packets like this: [0,1] [2,3] [4,5] > > [6,7], send them like this: [0,2] [1,3] [4,6] [5,7] In this way, if one > > packet is dropped you don't lose two consecutive voice frames. >