search for: combinatoric

I have a problem where I need to loop over the total combinations of vectors (combined once chosen via combinatorics). Here is a simplification of the problem: STEP 1: Define three vectors a, b, c. STEP 2: Combine all possible pairwise vectors (i.e., 3 choose 2 = 3 possible pairs of vectors: ab,ac, bc) NOTE: the actual problem has 8 choose 4, 8 choose 5 and 8 choose 6 combinations. STEP 3: Do the same m...

For some small sample sizes I would like to exemplify the combinatorics underlying certain nonparametric tests like Mann-Whitney-Wilcoxon, Kruskal-Wallis and Spearman's rank correlation. I have written a function all.perm which delivers all permutations of 1,2,...,n and which works reasonably well. This can be used to generate P(R=r) of Spearman's rank corre...

Hi I want to enumerate all vectors of length "J", whose elements are integers in the range 1 to S, without regard to ordering. With J=S=3, the combinations are as follows: [,1] [,2] [,3] [1,] 1 1 1 [2,] 1 1 2 [3,] 1 1 3 [4,] 1 2 2 [5,] 1 2 3 [6,] 1 3 3 [7,] 2 2 2 [8,] 2 2 3 [9,] 2

Hi How do I generate all ways of ordering sets of indistinguishable items? suppose I have two A's, two B's and a C. Then I want AABBC AABCB AACBC ABABC . . .snip... BBAAC . . .snip... CBBAA [there are 5!/(2!*2!) = 30 arrangements. Note AABBC != BBAAC] How do I do this? -- Robin Hankin Uncertainty Analyst National Oceanography Centre, Southampton European Way, Southampton SO14

As we all know, in R indices for vectors start with 1, i.e, x[0] is not a correct expression. Some algorithms, e.g. in graph theory or combinatorics, are much easier to formulate and code if 0 is an allowed index pointing to the first element of the vector. Some programming languages, for instance Julia (where the index for normal vectors also starts with 1), provide libraries/packages that allow the user to define an index range for its vect...

Hi I have a little vector function that takes a vector A of strictly positive integers and outputs a matrix M each of whose columns is the vector, modified in a complicated combinatorical way. Now I want to generalize the function so that A can include zeroes. Given A, I want to strip out the zeroes, pass it to my function, and pad M with rows at positions corresponding to the zeroes of A. Commented, minimal, self-contained, reproducible toy example follows. f <- func...

...combinations(5,2,c(1,2,3,4,5),repeats.allowed=T) from the 'gtools' package would do something like this. I'm stuck on a clean solution for enumerating all the non-overlapping sets without some elaborate looping and checking scheme. No doubt this is a lapse in my understanding of combinatorics. Any help would be greatly appreciated cheers, a.

...hanks Eli, Jaffrey for the pointer! > > A couple of further questions if I may > 1. Isnt this assuming that register being pinned to is always esi when > it comes to using a calling convention. You'd need a separate calling convention for each possible set of registers pinned. The combinatoric possibilities can get ugly, but you probably only need a small fraction of the possibilities. > 2. I would also like to allocate some small aggregates into registers. > I understand that the code generation would need to be non trivially > modified to do this. You can always just split t...

Hello List I'm working on a combinatoric problem in which the object is to minimize the badness() of a vector. I think this class of problem is only soluble by optim() using method=SANN. The badness() of anything is >= 0, and when I've found a solution with zero badness, I want optim() to stop (carrying on beyond zero badness can...

Also https://cran.r-project.org/package=Oarray (which is older and hence possibly more stable) On 2024-04-21 3:55 a.m., Hans W wrote: > As we all know, in R indices for vectors start with 1, i.e, x[0] is not a > correct expression. Some algorithms, e.g. in graph theory or combinatorics, > are much easier to formulate and code if 0 is an allowed index pointing to > the first element of the vector. > > Some programming languages, for instance Julia (where the index for normal > vectors also starts with 1), provide libraries/packages that allow the user > to defi...

https://cran.r-project.org/package=index0 On Sun, Apr 21, 2024, 3:56 AM Hans W <hwborchers at gmail.com> wrote: > As we all know, in R indices for vectors start with 1, i.e, x[0] is not a > correct expression. Some algorithms, e.g. in graph theory or combinatorics, > are much easier to formulate and code if 0 is an allowed index pointing to > the first element of the vector. > > Some programming languages, for instance Julia (where the index for normal > vectors also starts with 1), provide libraries/packages that allow the user > to defin...

...h is then used for calling the real function. This is not doable with MCJIT, at least not easily. I could do what you describe: get the pointer to the function and implement all the handling for my language's supported types and a reasonably large number of parameters. That sort of exercise on combinatorics could work for me, but others would be forced to replicate the work for they own projects and that's precisely what a library should avoid. And, possibly, on some cases a user might need a truly generic method: think on a paremeter or return value with user-defined type (`user' here means...

?s 08:55 de 21/04/2024, Hans W escreveu: > As we all know, in R indices for vectors start with 1, i.e, x[0] is not a > correct expression. Some algorithms, e.g. in graph theory or combinatorics, > are much easier to formulate and code if 0 is an allowed index pointing to > the first element of the vector. > > Some programming languages, for instance Julia (where the index for normal > vectors also starts with 1), provide libraries/packages that allow the user > to defi...

...ood measure, or is that redundant? Does inlining go best in function or global? Does the strategy change if I really only need to directly call a few functions in the module, the others existing only in case they are needed by the dynamically-generated code that I'm JITing? It seems that the combinatorics of which passes to apply, and in which order (including doing some multiple times), are pretty daunting. Other than the Kaleidescope tutorial (too simple) and the StandardPasses.h (too complex?) I can't find any other examples, much less pro/con discussion or guidance. Does anybody have any...

Thanks Eli, Jaffrey for the pointer! A couple of further questions if I may 1. Isnt this assuming that register being pinned to is always esi when it comes to using a calling convention. I would like to pin the register through a pass and so I dont know which registers ends up being used for a particular value before hand 2. I would also like to allocate some small aggregates into registers. I

...full bayesian toolbox for commonly encountered problems in psychology and social sciences, for comparing proportions, variances and means, and discusses the advantages. But all foundations of the frequentist approach are also provided, from data description to probability and density, through combinatorics and set algebra. A special emphasis has been put on the analysis of categorical data and contingency tables. Binomial and multinomial models with beta and Dirichlet priors are presented, and their use for making (between rows or between cells) contrasts in contingency tables is detailed on rea...

I guess we'll have to add that to the list of things that needs to be done to replace the old JIT. In the projects I've worked on that use MCJIT, we've been using getPointerToFunction and then calling it from outside the MCJIT engine, but I suppose that the generic handling in runFunction would be useful in some cases. -Andy -----Original Message----- From: llvmdev-bounces at

...an hold multiple STO_xxx flags stored in the > st_other field (STO_MIPS_PIC, STO_MIPS_MICROMIPS, STO_MIPS_MIPS16 > ...). Sometimes these flags can be even combined. If we use the > contentTypes field, we have to define a separate ContentType flag for > each such combination. So we get a combinatorics explosion. > > 2. If we handle MIPS specific ContentType flags together with other > flags, it is pollute the common ELF code. If we factor out the > processing of MIPS specific flags, we have to duplicate code because a > symbol with say STO_MICROMIPS flag should be processed (set...

Ein eingebundener Text mit undefiniertem Zeichensatz wurde abgetrennt. Name: nicht verf?gbar URL: https://stat.ethz.ch/pipermail/r-help/attachments/20061008/19f386e1/attachment.pl

Hello group, I am learning R and I am new to many concepts.I face the following errors when I am trying to execute the following. I have 4 text files with protein accession numbers. I wanted to represent them in a venn diagram and for that I using intersect and setdiff functions. My data looks like this: file1.txt (c): NP_000005 NP_000020 NP_000030 NP_000053 file2.txt(e): NP_000005 NP_000020