search for: cond

Displaying 20 results from an estimated 1417 matches for "cond".

Did you mean: con
2012 May 04
0
oddsratio epitool and chi-square
Here is a working snippet. library(epitools) mat <- matrix(c(10,15,60,25,98, 12,10,70,28,14, 9,11,68,10,12 ,8,13,20,11,58) ,ncol=2) colnames(mat) <- c("treatmentA","treatmentB") row.names(mat) <- paste("Cond",rep(1:10,1)) dimnames(mat) <- list("Condition" = row.names(mat), "instrument" = colnames(mat)) > mat instrument Condition treatmentA treatmentB Cond 1 10 9 Cond 2 15 11 Cond 3 60 68 Cond 4...
2012 May 04
0
oddsratio and some basic help on epitools
Here is a working snippet. library(epitools) mat <- matrix(c(10,15,60,25,98, 12,10,70,28,14, 9,11,68,10,12 ,8,13,20,11,58) ,ncol=2) colnames(mat) <- c("treatmentA","treatmentB") row.names(mat) <- paste("Cond",rep(1:10,1)) dimnames(mat) <- list("Condition" = row.names(mat), "instrument" = colnames(mat)) > mat instrument Condition treatmentA treatmentB Cond 1 10 9 Cond 2 15 11 Cond 3 60 68 Cond 4...
2012 May 04
0
epitools question
Here is a working snippet. library(epitools) mat <- matrix(c(10,15,60,25,98, 12,10,70,28,14, 9,11,68,10,12 ,8,13,20,11,58) ,ncol=2) colnames(mat) <- c("treatmentA","treatmentB") row.names(mat) <- paste("Cond",rep(1:10,1)) dimnames(mat) <- list("Condition" = row.names(mat), "instrument" = colnames(mat)) > mat instrument Condition treatmentA treatmentB Cond 1 10 9 Cond 2 15 11 Cond 3 60 68 Cond 4...
2013 Aug 16
0
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
On 08/16/2013 02:42 AM, Star Tan wrote: > At 2013-08-16 12:44:02,"Tobias Grosser" <tobias at grosser.es> wrote: >> Hi, >> >> I tried to reproduce your findings, but could not do so. > > > Sorry, I did not put all code in my previous email because the code seems a little too long and complicated. > You can refer to the detailed C code and LLVM IR
2017 Jul 24
5
Ifelse statements and combining columns
Hi everyone, I'm having some trouble with my ifelse statements. I'm trying to put 12 conditions within 3 groups. Here is the code I have so far: dat$cond <- ifelse(test = dat$cond == "cond1" | dat$cond == "cond2" | dat$cond == "cond3" dat$cond == "cond4" yes = "Uniform" no = ifelse(test = dat$co...
2013 Aug 17
2
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...ll -S # Print the scop info: $ polly-opt -basicaa -polly-prepare -polly-scops SingleAcc.preopt.ll -analyze (*Note: you can download SingleAcc.preopt.ll on http://llvm.org/bugs/attachment.cgi?id=11059) Printing analysis 'Polly - Create polyhedral description of Scops' for region: 'for.cond2.preheader => for.end32' in function 'main': Context: [cond.reload] -> { : cond.reload >= -2147483648 and cond.reload <= 2147483647 } p0: %cond.reload Statements { Stmt_for_body16 Domain := [cond.reload] -> { Stmt_for_body1...
2015 Sep 03
2
[RFC] New pass: LoopExitValues
...on. I understand the mechanics, but I still can't quite see what > patterns it would be useful on. You've mentioned matrix multiply - how does > this pass alter the IR? Here's before and after IR for the matrix_mul example. Notice the two bitcasts %1 and %2 generated in the for.cond.cleanup block. The L.E.V pass converts these to scevgep values that already exist. *** Code after LSR *** ; Function Attrs: nounwind optsize define void @matrix_mul(i32 %Size, i32* nocapture %Dst, i32* nocapture readonly %Src, i32 %Val) #0 { entry: %cmp.25 = icmp eq i32 %Size, 0 br i1 %cmp.2...
2017 Dec 19
2
A code layout related side-effect introduced by rL318299
On Mon, Dec 18, 2017 at 5:46 PM Xinliang David Li <davidxl at google.com> wrote: > The introduction of cleanup.cond block in b.ll without loop-rotation > already makes the layout worse than a.ll. > > > Without introducing cleanup.cond block, the layout out is > > entry->while.cond -> while.body->ret > > All the arrows are hot fall through edges which is good. > > With clean...
2005 Sep 09
2
Discrepancy between R and SPSS in 2-way, repeated measures ANOVA
...se states 1, 2 and 3). Each group contained five subjects. An experimental measurement was performed on each sample to yield a "signal". The before and after treatment signals for each subject were treated as repeated measures. We desire to obtain P values for disease state ("CONDITION"), and the interaction between signal over time and disease state ("CONDITION*TIME"). Using SPSS, the following output was obtained: DF SumSq (Type 3) Mean Sq F value P= COND 3 42861 14287 3....
2013 Apr 23
2
[LLVMdev] 'loop invariant code motion' and 'Reassociate Expression'
...-LLVM-3.1 converts this into: --after Reassociate expressions: %add = add i32 %next.0, 1 %add1 = add i32 %add, %total.0 -- after Canonicalize natural loops: %add = add i32 %next.0.ph, 1 %add1 = add i32 %add, %total.0 -- and during 'loop invariant code motion': LICM hoisting to while.cond.outer: %add = add i32 %next.0.ph, 1 - LLVM-3.2 converts it into: (Notice the reversion of %total.0 and %next.0) --after Reassociate expressions: %add = add i32 %total.0, 1 %add1 = add i32 %add, %next.0 -- after Canonicalize natural loops: %add = add i32 %total.0, 1 %add1 = add i32 %add,...
2012 Aug 20
3
[LLVMdev] Problem with "Does not dominate all uses"
...s code (see safer.phi.ll). If I run the rest of my pass, I obtain this code (see safer.phi.obfu.ll) And I got this error for the file safer.phi.obfu.ll: Instruction does not dominate all uses! %18 = load i8** %key.addr, align 8, !dbg !322 call void @Safer_Expand_Userkey(i8* %18, i8* %19, i32 %cond.reload, i32 0, i8* %arraydecay), !dbg !322 Instruction does not dominate all uses! %19 = load i8** %key.addr, align 8, !dbg !322 call void @Safer_Expand_Userkey(i8* %18, i8* %19, i32 %cond.reload, i32 0, i8* %arraydecay), !dbg !322 Broken module found, compilation aborted! 0 opt 0x...
2012 Aug 20
0
[LLVMdev] Problem with "Does not dominate all uses"
In your original file, %6 is defined in if.end11 and is used in cond.end. if.end11 branches to cond.true and cond.false, both of which branch unconditionally to cond.end. Therefore %6 dominates its use. In your second file %18 is defined in end.11 and used in cond.end. However, end.11 no longer dominates cond.end because you have rewritten all branches to go throug...
2011 Oct 24
2
Syntax Help for xyplot()
...tds.anal) 'data.frame': 718 obs. of 4 variables: $ site : Factor w/ 143 levels "BC-0.5","BC-1",..: 1 1 4 6 4 4 4 5 5 5 $ sampdate: Date, format: "1996-06-02" "1996-06-02" ... $ param : Factor w/ 7 levels "Ca","Cl","Cond",..: 6 7 3 6 3 3 3 3 3 3 $ quant : num 194 530 826 36 848 ... and a summary of it shows: summary(burns.tds.anal) site sampdate param quant BC-3 :460 Min. :1992-03-27 Ca : 65 Min. : 1.00 BC-2 :107 1st Qu.:1994-09-21 Cl :148 1st...
2017 Dec 19
4
A code layout related side-effect introduced by rL318299
...b.ll was generated by rL318299. -------------------------- a.ll ---------------------------- declare void @_Z1fv() local_unnamed_addr #2 @i = global i8 0, align 1 define i8* @_Z1gPcS_S_(i8* nocapture readonly %d, i8* %h, i8* readnone returned %p3) local_unnamed_addr #3 { entry: br label %while.cond while.cond: ; preds = %while.body, %entry %h.addr.0 = phi i8* [ %h, %entry ], [ %add.ptr4, %while.body ] %d.addr.0 = phi i8* [ %d, %entry ], [ %add.ptr3, %while.body ] %cmp = icmp ugt i8* %h.addr.0, @i br i1 %cmp, label %while.end, label %while.body w...
2018 Jun 29
2
Cleaning up ‘br i1 false’ cases in CodeGenPrepare
Hi, I have come across a couple of cases where the code generated after CodeGenPrepare pass has "br i1 false .." with both true and false conditions preserved and this propagates further and remains the same in the final assembly code/executable. In CodeGenPrepare::runOnFunction, ConstantFoldTerminator (which handles the br i1 false condition) is called only once and if after the transformation of code by ConstantFoldTerminator() and Del...
2013 Apr 23
0
[LLVMdev] 'loop invariant code motion' and 'Reassociate Expression'
...eassociate expressions: > %add = add i32 %next.0, 1 > %add1 = add i32 %add, %total.0 > -- after Canonicalize natural loops: > %add = add i32 %next.0.ph, 1 > %add1 = add i32 %add, %total.0 > -- and during 'loop invariant code motion': > LICM hoisting to while.cond.outer: %add = add i32 %next.0.ph, 1 > > - LLVM-3.2 converts it into: (Notice the reversion of %total.0 and %next.0) > --after Reassociate expressions: > %add = add i32 %total.0, 1 > %add1 = add i32 %add, %next.0 > -- after Canonicalize natural loops: > %add = add i3...
2013 Apr 25
2
[LLVMdev] 'loop invariant code motion' and 'Reassociate Expression'
...t.0, 1 > >> %add1 = add i32 %add, %total.0 > >> -- after Canonicalize natural loops: > >> %add = add i32 %next.0.ph, 1 > >> %add1 = add i32 %add, %total.0 > >> -- and during 'loop invariant code motion': > >> LICM hoisting to while.cond.outer: %add = add i32 %next.0.ph, 1 > >> > >> - LLVM-3.2 converts it into: (Notice the reversion of %total.0 and %next.0) > >> --after Reassociate expressions: > >> %add = add i32 %total.0, 1 > >> %add1 = add i32 %add, %next.0 > >> -- aft...
2006 Aug 10
2
index.cond in xyplot
Dear R-users I have 5 dependent variables (y1 to y5) and one independent variable (x) and 3 conditioning variables (m, n, and 0). Each of the conditioning variables has 2 levels. I created 2*4 panel plots. xyplot(y1+y2+y3+y4+y5 ~ x | m*n*o,layout = c(4,2)) I would like to reorder the 8 panels. I tried to use index.cond (e.g., index.cond = list(c(1,3,2,4,5,7,6,8)) but it didn't work ou...
2012 May 07
2
how to deduplicate records, e.g. using melt() and cast()
Esteemed UseRs, This must be embarrassingly trivial to achieve with e.g., melt() and cast(): deduplicating records ("pw.X" in example) for a given set of responses ("cond.Y" in example). Hopefully the runnable example shows clearly what i have and what i'm trying to convert it to. But i'm just not getting it, ?cast that is! So i'd really appreciate some ones patience to clarify this, using the reshape package, or any other approach. With sincer...
2013 Aug 16
2
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...lly-opt -basicaa -polly-prepare -polly-scops out.preopt.ll -analyze Scop info varies in the two cases (with/without -polly-scops). No valid scops are detected if we run polly without -polly-prepare: $ polly-opt -basicaa -polly-scops out.preopt.ll -analyze However, a very large region "for.cond2.preheader => for.end31" is detected as valid region if we run Polly with -polly-prepare: $ polly-opt -basicaa -polly-prepare -polly-scops nestedloop.preopt.ll -analyze Note that the region "for.cond2.preheader => for.end31" is reported as invalid as the exit BasicBlock has...