similar to: Loop avoidance and logical subscripts

Displaying 20 results from an estimated 200 matches similar to: "Loop avoidance and logical subscripts"

2009 Jan 08
1
Letter-based representation of pairwise comparisons
Hi! I have been working several years with R but it's my first public question. I hope I'll be clear :) . This question is related to obtaining letter-based representation of non-parametric pairwise comparisons. I have a dataframe with this structure (but with quite more rows and cols): A B C factor 1 2 2 one 2 1 2 one 2 2 3 two 2 3 2 two 1 4 2 three 9 8 1 three I have no normality,
2013 Apr 18
0
Splitting vector
Hi, Try: vec1<- "mue#d/sjbijk at ruepvnvbnceiicrpgxkgcyl@keduhqvqi/ubudvxopddpfddgitrynzshzdcwgneyffrkpbxwilwqngrsals#geqmtkcpkp/qecgdfa#uag" library(seqinr) ?res<-lapply(0:4,function(i) lapply(2:5,function(j) splitseq(s2c(gsub("[#@/]","",vec1)),word=j,frame=i))) #or library(stringr) res1<-lapply(0:4,function(i) lapply(2:5,function(j)
2010 Sep 25
1
why the weird avoidance of the name "red hat"?
i'm reading the FAQ: http://wiki.centos.org/FAQ/General and i'm familiar with the deliberate avoidance of using the name "red hat", but it seems a bit weird given that point 1 clearly avoids it while point 2 boldly uses the name right in the question. so what's the point of being so coy, but not all the time? rday --
2008 Oct 16
1
Loop avoidance in simulating a vector
All, I'd like to simulate a vector that is formed from many distinct distributions and avoid a loop if possible. E.g, consider: mu = c(1, 2, 3) sigma = c(1, 2, 3) n = c(10, 10, 10) And we simulate a vector of length 30 that consists of N(mu[i], sigma[i]) distributed data, each of length n[i]. Of course for just three groups we can simply write it out as: DV = c(rnorm(n[1], mu[1],
2007 Jun 27
1
Another loop avoidance question.
Hi I want to sum over one of the dimensions of a n x k1 x k2 array in which each column is the product of the corresponding columns from two matrices with dimensions n x k1 and n x k2. I can see two approaches: a loop on k1 and a loop on k2. But I cannot figure a solution that avoids the loop? Is it possible? (I don't refer to apply or lapply etc either as they are just hidden loops so,
2007 Jul 30
0
[LLVMdev] For the avoidance of doubt...
On Mon, 30 Jul 2007, Sarah Thompson wrote: > ... can *any* instruction(s) other than load and store cause memory > reads or writes? Functions calls can (transitively), intrinsics can, and the vaarg instruction can (it updates the pointed to list to point to the next argument). -Chris -- http://nondot.org/sabre/ http://llvm.org/
2007 Jul 30
1
[LLVMdev] For the avoidance of doubt...
Chris Lattner wrote: > On Mon, 30 Jul 2007, Sarah Thompson wrote: > >> ... can *any* instruction(s) other than load and store cause memory >> reads or writes? >> > > Functions calls can (transitively), This isn't a problem because I'll be picking up those reads and writes as the function executes anyway. > intrinsics can, Would it be feasible to
2007 Jul 30
0
[LLVMdev] For the avoidance of doubt...
Sarah Thompson wrote: > ... can *any* instruction(s) other than load and store cause memory > reads or writes? Not that I know of, but some intrinsic functions do. > > This is pretty important, because I need to be able to track (at least) > writes, and ideally also reads in order to be able to make > explicit-state model checking work efficiently. I specifically know that
2004 Oct 22
1
IAXy echo avoidance/cancellation
Ok, I searched the lists and found no definitive answer. I'm assuming the IAXy has some primitive form of echo cancel, is there anyway to adjust this? Or any ideas on what to do instead. Here's the setup, this will not be a typical setup for our company however, well whatever. Anyway it looks like this: IAXy --> Netgear router --> Charter --> Level3 --> Asterisk --> VOIP or
2007 Jul 30
4
[LLVMdev] For the avoidance of doubt...
... can *any* instruction(s) other than load and store cause memory reads or writes? This is pretty important, because I need to be able to track (at least) writes, and ideally also reads in order to be able to make explicit-state model checking work efficiently. (I don't really care about reads or writes to spilled registers added by the code generator). Sarah
2013 Apr 19
1
Sequence analysis
Hiya, I am trying to look at the similarities between a number of sequences, for example i am trying to see how similar "ababbbassdaa" is to "addffggssbbsbbs" I was wondering is the some way for me to see how similar they are in terms of, for example, number of a's, number of b's, how often a and ab are consecutive, how often abab is together etc. Any advice
2014 Jun 24
3
[PATCH 1/2] Drop dosutil/mdiskchk.com
A prebuilt binary. Needs non-free Watcom compiler to build. Signed-off-by: Lubomir Rintel <lkundrak at v3.sk> --- dosutil/mdiskchk.com | Bin 8106 -> 0 bytes 1 file changed, 0 insertions(+), 0 deletions(-) delete mode 100644 dosutil/mdiskchk.com diff --git a/dosutil/mdiskchk.com b/dosutil/mdiskchk.com deleted file mode 100644 index
2009 Aug 17
1
two more warning-avoidance patches
>From 9e99a1c6cb655a56d7f09dabd10a77a3802bf96d Mon Sep 17 00:00:00 2001 From: Jim Meyering <meyering at redhat.com> Date: Mon, 17 Aug 2009 18:44:37 +0200 Subject: [PATCH libguestfs 1/2] avoid compiler warnings about unused vars in generated code * src/Makefile.am: Compile protocol.c into a convenience library, so it can have its own CFLAGS, and link that with the destination one. ---
2007 Nov 26
1
visualizing nucleotide sequence properties
Hi there, I am looking for R-packages that can help me visualize properties on nucleotide sequences. I want to display sequences in the 1-100K base range as lines and plot features above and below those lines. Any ideas would be welcome. Thanks, Bernd [[alternative HTML version deleted]]
2010 Aug 14
1
incrementing matrix elements more efficiently
I need to increment cells of a matrix (collusionM). The indexes to increment are in an index (matchIndex). This is some of the code for (j in 1:(rows-1)) matchIndex[[j]] <- which(mx[j]==mx) for (j in 1:(rows-1)) collisionM[j,matchIndex[[j]]] <- collisionM[j,matchIndex[[j]]] + 1 I could put them in the same loop but this is slower. The first for statement is fine. It finds the matches
2006 Jun 18
2
analyze amino acid sequence (composition)of proteins
Dear R-helpers: thank your for your attention. i am a newer to R and i am doing some protein category classification based on the amino acid sequence.while i have some questions urgently. 1. any packages for analysis amino acid sequence 2. given two sequences "AAA" and "BBB",how can i combine them into "AAABBB" 3. based on "AAABBB",how can i get some
2009 Jun 01
1
installing sn package
Hi r-users, I want to use the sn package but I got the following message: > install.packages(repos=NULL,pkgs="c:\\Tinn-R\\sn_0.4-12.zip") Warning: package 'sn' is in use and will not be installed updating HTML package descriptions I did tried to do it a few times but it gives the same message.  ________________________________ From:
2013 Apr 18
5
Subsetting a large number into smaller numbers and find the largest product
Hello, I have a big number lets say of around hundred digits. I want to subset that big number into consecutive number of 5 digits and find the product of those 5 digits. For example my first 5 digit number would be 73167. I need to check the product of the individual numbers in 73167 and so on. The sample number is as follows:
2008 Sep 18
2
Writing greek letters and subscripts in graph
Dear R-users, I would like to write Greek letters followed by subscripts in a graph (on the X-axis and in a legend). I would appreciate any help. thank you, delphine courvoisier ************************************ Delphine Courvoisier Clinical Epidemiology Division University of Geneva Hospital +4122 37 29029
1999 Feb 10
1
Creating subscripts in text()
Hello! Help! How to create subscripts in text() ? Could not find an example nor could I guess it. Thank you! Detlef Detlef Steuer Universitaet Dortmund /////// LS Computergestuetzte Statistik U N I D O /// steuer at gigamain.statistik.uni-dortmund.de ______/////// Tel: ++49 +231 755 4353 Fax: ++49 +231 755 4387