search for: all1s

Dear All, I´m using the following code: all1<-gg2[[1]][[1]]; for(i in 1:48){ all1 <- rbind(all1,gg2[[i]][[1]]) } to create a new matrix that contains all the matrices in a list called gg2. gg2 is a list that looks like >> gg2 [[1]] [[1]][[1]] <matrix one> [[2]] [[2]][[1]] <matrix two> . . . [[48]] [[48]][[1]] <matrix 48> Is there a faster way to do the rbind?

Hi all, I have this microarray large microarray data set (ALL) from which I would like to subset or extract a set of data based on a factor ($mol.biol). I looked up some example of subsetting in, picked up two commands and tried both but I got error messages as follows > testset <- subset(ALL, ALL$mol.biol %in% c("BCR/ABL","ALL1/AF4")) >> Error in

I am trying to replicate the SAS proc univariate in R. I got most of the stats I needed for a by grouping in a data frame using: all1 <- ddply(all,"ACT_NAME", summarise, mean=mean(COUNTS), sd=sd(COUNTS), q25=quantile(COUNTS,.25),median=quantile(COUNTS,.50), q75=quantile(COUNTS,.75), q90=quantile(COUNTS,.90), q95=quantile(COUNTS,.95), q99=quantile(COUNTS,.99) )

1)I am wandering how the following SQL statement can be written in R language w/o using sqldf: create table detail2 as select a.* from detail a, pdetail b where a.TDATE=b.TDATE and (a.STIM >= b.STIM and a.STIM <=b.MAXTIM) 2) when try if then in R it only applies to the 1st row & not to whole dataset like in SAS. How do you get round that? in SAS: data summary; set all1;

...type is also 4b, but it's not. The smallest mask register on SKX is 8b. This also implies that the smallest load/store moves 8b. We run into problems when we try to optimize ANDs (full test case attached): %r1 = and <4 x i1> %r0, <i1 -1, i1 -1, i1 -1, i1 -1> At the IR level the all1s mask looks like the Identity for this operation, so LLVM will remove it. But it is not the Identity since this operation should clear the top 4 bits of the 8 bit hardware register in play. E.g. kmovb -4(%rsp), %k0 kandb %k0, %k1, %k0 kmovb %k0, -4(%rsp) I began track...

Dear, I am using the solnp command (package Rsolnp) for a problem with equality and inequality constraints. I am not getting convergence for my problem but apart that I get 1 warning per iteration saying: ?In cbind(temp, funv) : number of rows of result is not a multiple of vector length (arg 1)?. I checked for equality and inequality functions and they seem fine to me. Where this

Hello. I'm running a generalized linear model and am interested in using the random effects that are output for further analysis. My random effect is interacting with two different fixed effects (which which are factors with two levels each). When I retrieve the random effects I get something like this: (Intercept) nutrient (Intercept) light (Intercept) Aa-0 0.59679192

Hello all useRs, I am tring make a simple surface plot ( 2 by 2 terms of a MARS model (with earth package) but I get the follow error message: > plotmo( mars ) Error: bad index (missing column in x?) I don't no how to workround this... :-( I thanks in advanced by some help! Thanks. Cleber ############### > > ### example code: > library( earth ) > data( gasoline,

...er on SKX is 8b. This also implies that the >> smallest load/store moves 8b. >> >> We run into problems when we try to optimize ANDs (full test case attached): >> >> %r1 = and <4 x i1> %r0, <i1 -1, i1 -1, i1 -1, i1 -1> >> >> At the IR level the all1s mask looks like the Identity for this >> operation, so LLVM will remove it. But it is not the Identity since >> this operation should clear the top 4 bits of the 8 bit hardware >> register in play. E.g. > > No, this operation alone does not need to clear the upper bit, they...

...gt; smallest load/store moves 8b. >>>> >>>> We run into problems when we try to optimize ANDs (full test case attached): >>>> >>>> %r1 = and <4 x i1> %r0, <i1 -1, i1 -1, i1 -1, i1 -1> >>>> >>>> At the IR level the all1s mask looks like the Identity for this >>>> operation, so LLVM will remove it. But it is not the Identity since >>>> this operation should clear the top 4 bits of the 8 bit hardware >>>> register in play. E.g. >>> No, this operation alone does not need to...

Hola de nuevo, ya empiezo a ser pesado ¿no? bueno, no importa porque aprendemos todos. Eso, al menos, me parece. Hoy estuve estudiando en R el tema de la aleatoriedad. Veo que hay múltiples posibilidades pero me están chocando mucho. Encuentro que el generador de números pseudo aleatorios es más pseudo de lo que debería. Me explico, quiero generar 0 y 1 aleatorios. Estoy trabajando con una

Hello All, I need your help. I am analysing affymetrix data and have to select the probe-set that has median expression among all the probe-sets for same gene. This way I want to remove the redundancy by keeping the analysis to single gene entry level. I am fully aware that it is not a nice thing to do but I just have to do it. To do so, I came across 'findLargest' function of

Dear List-members, I found a strange behaviour in the lqs function. Suppose I have the following data: y <- c(7.6, 7.7, 4.3, 5.9, 5.0, 6.5, 8.3, 8.2, 13.2, 12.6, 10.4, 10.8, 13.1, 12.3, 10.4, 10.5, 7.7, 9.5, 12.0, 12.6, 13.6, 14.1, 13.5, 11.5, 12.0, 13.0, 14.1, 15.1) x1 <- c(8.2, 7.6,, 4.6, 4.3, 5.9, 5.0, 6.5, 8.3, 10.1, 13.2, 12.6, 10.4, 10.8, 13.1, 13.3, 10.4, 10.5, 7.7, 10.0, 12.0,

https://bugzilla.samba.org/show_bug.cgi?id=8666 Summary: --debug=all9 fail Product: rsync Version: 3.1.0 Platform: All OS/Version: All Status: NEW Severity: normal Priority: P5 Component: core AssignedTo: wayned at samba.org ReportedBy: chris at onthe.net.au QAContact: rsync-qa at