search for: permuations

Dear friends, I would like to get all possible arrangements of n objects listed 1:n on a circle. Now this is easy to do in R. Keep the last spot fixed at n and fill in the rest using permuations(n-1, n-1) from the gtools package. However, what if clockwise or counterclockwise arrangements are the same? I know that half of the above (n - 1)! arrangements are redundant. Is there an easy way to list these (n-1)!/2 arrangements? I thought of only listing the first half from a call to permu...

...1 1 5 1 2 5 1 2 6 2 1 7 2 2 7 2 2 8 3 1 9 3 2 9 3 1 10 1 1 5 1 2 5 1 2 6 2 1 7 2 2 7 2 2 8 3 1 9 3 2 9 3 1 10 my factor matrix is called Z, so the call to adonis is adonis (Z~ecomorph+diet+family(ecomorph) + ecomorph*diet+ecomorph*family(ecomorph)+ecomorph*diet*family(ecomorph), data =b, permuations =999) However, I'm not confident this is the correct way as I would like time to be incorporated as a factor. I have seen the strata command, would this allow me to incorporate time by including a column for time in my matrix? I'm guessing this is how it would go? adonis (Z~ecomorph+diet+...

...> On Mar 29, 2018, at 9:48 PM, Ranjan Maitra <maitra at email.com> wrote: > > Dear friends, > > I would like to get all possible arrangements of n objects listed 1:n on a circle. > > Now this is easy to do in R. Keep the last spot fixed at n and fill in the rest using permuations(n-1, n-1) from the gtools package. > > However, what if clockwise or counterclockwise arrangements are the same? I know that half of the above (n - 1)! arrangements are redundant. > > Is there an easy way to list these (n-1)!/2 arrangements? > > I thought of only listing the f...

...PM, Ranjan Maitra <maitra at email.com> wrote: > > > > Dear friends, > > > > I would like to get all possible arrangements of n objects listed 1:n on a circle. > > > > Now this is easy to do in R. Keep the last spot fixed at n and fill in the rest using permuations(n-1, n-1) from the gtools package. > > > > However, what if clockwise or counterclockwise arrangements are the same? I know that half of the above (n - 1)! arrangements are redundant. > > > > Is there an easy way to list these (n-1)!/2 arrangements? > > > > I...

Dear all: To write a compiler for Microsoft Direct3D shaders from our hardware, I have a program which translates the Direct3D shader assembly to LLVM assembly. I added several intrinsics for this purpose. It's a vector ISA and has some special instructions like: * rcp (reciprocal) * frc (the fractional portion of each input component) * dp4 (dot product) * exp (exponential) * max, min These

...tra <maitra at email.com> wrote: >>> >>> Dear friends, >>> >>> I would like to get all possible arrangements of n objects listed 1:n on a circle. >>> >>> Now this is easy to do in R. Keep the last spot fixed at n and fill in the rest using permuations(n-1, n-1) from the gtools package. >>> >>> However, what if clockwise or counterclockwise arrangements are the same? I know that half of the above (n - 1)! arrangements are redundant. >>> >>> Is there an easy way to list these (n-1)!/2 arrangements? >>>...

...2 [3,] 1 3 [4,] 2 2 [5,] 2 3 [6,] 3 3 subsets(set, 2, allow.repeat=T) should work, but I can't get the multic package to install, t(combn(set,2)) was suggested but it doesn't produce repetitions; expand.grid(rep(list(1:3), 2)) was also suggested, but it produces permuations, not combinations. Additionally, I would like to iterate through each resultant set for large n (similar to the description for getNextSet {pcalg}). Any suggestions? Reuben Cummings

...; wrote: > >>> > >>> Dear friends, > >>> > >>> I would like to get all possible arrangements of n objects listed 1:n on a circle. > >>> > >>> Now this is easy to do in R. Keep the last spot fixed at n and fill in the rest using permuations(n-1, n-1) from the gtools package. > >>> > >>> However, what if clockwise or counterclockwise arrangements are the same? I know that half of the above (n - 1)! arrangements are redundant. > >>> > >>> Is there an easy way to list these (n-1)!/2 arrange...

On Thu, 15 Dec 2005, Tzu-Chien Chiu wrote: > To write a compiler for Microsoft Direct3D shaders from our hardware, > I have a program which translates the Direct3D shader assembly to LLVM > assembly. I added several intrinsics for this purpose. > It's a vector ISA and has some special instructions like: > * rcp (reciprocal) > * frc (the fractional portion of each input

Way back on Wed Dec 14, 2005, Tzu-Chien Chiu wrote: > To write a compiler for Microsoft Direct3D shaders from our hardware, > I have a program which translates the Direct3D shader assembly to LLVM > assembly. I added several intrinsics for this purpose. > It's a vector ISA and has some special instructions like: > * rcp (reciprocal) > ... > These operations are very

...gt;>> >>>>> Dear friends, >>>>> >>>>> I would like to get all possible arrangements of n objects listed 1:n on a circle. >>>>> >>>>> Now this is easy to do in R. Keep the last spot fixed at n and fill in the rest using permuations(n-1, n-1) from the gtools package. >>>>> >>>>> However, what if clockwise or counterclockwise arrangements are the same? I know that half of the above (n - 1)! arrangements are redundant. >>>>> >>>>> Is there an easy way to list these (n-1...

I wonder if someone could explain how the following R idiom works (it's used in glm.fit). start <- coef start[fit$pivot] <- coef coef is a vector of coefficients, set by .Fortran("dqrls", ...). fit$pivot is a vector of integer indexes (indicating how dqrls permuted the columns of x). If coef has n elements, fit$pivot is a permutation of seq(1,5). start[fit$pivot]

Buenas tardes amigos, De nuevo por aqui con un incoveniente, tengo el siguiente arreglo: > MuestraS [1] 1 0 0 0 1 0 1 1 1 1 1 0 Deseo realizar todas las permutaciones posibles para luego tomar una muestra aleatoria pequeña, esto lo debo hacer varias veces incrementando el largo del arreglo "MuestraS". El inconveniente esta en que al hacer las permutaciones con este arreglo de 12

...ing to implement Blair & Karniski's (1993) permutation test. I've included a sample data frame below. This data frame represents the conditional means (C1, C2) for 3 subjects in 2 consecutive samples of a continuous data set (e.g. ERP waveform). Each sample includes all possible permuations of the subject means (2^N), which is 8 in this case. The problem: I need to run a paired t-test on each SampleXPermutation set and save the maximum t-value obtained for each sample. The real data set has 16 subjects (2^16 permutations) and 500 samples, which leads to more than 32 million t-tes...

...I am more interested in how to have the "x <<- Y+1" part of the function to change x in place for purposes of a much larger function. I have been wrestling with various forms of the assign, as.name, deparse, substitute (by now you probably sense a air of desperation) commands, and permuations thereof. These variables will be in a detached data.frame (not shown here). Thanks for your time. Michaell -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "he...

...l.c:1957 ast_request: No channel type registered for '' May 18 10:20:26 NOTICE[24416]: app_dial.c:927 dial_exec_full: Unable to create channel of type '' (cause 66) == Everyone is busy/congested at this time (1:0/0/1) The call then drops into voicemail... I've tried various permuations but still no call is made to the mobile number. Any ideas? Cheers, Mark I should mention that I have tried using the call forward function of the sip phones, but a) this means configuring the phones and some are remote and behind firewalls and b) It doesn't work...

Hello, I was wondering if anyone knew how to fit a series using a Garch-M (Garch in the mean) model. From what I gathered from the documentation, it does not seem to be implemented in either fGarch, fSeries, or tSeries. Perhaps there is an option that allows this functionality. Otherwise, if it's possible to modify an existing function I would appreciate any guidance on how to go about

Yes, you're right. In fact, it's just an adaptation of a matlab command and the author advises using N^4 replications that's why it's the default in the function. The bistochastic matrix is not my subject of interest, but I need it to perform some random tranformation of a vector of incomes. Florent Bresson ----- Message d'origine ---- De : Richard M. Heiberger <rmh at

Thanks, I tried someting like this, but computation takes times for large matrices btransf <- function(y,X=length(y)^4) { N <- length(y) bm <- matrix(rep(1/N,N^2),N,N) for(j in 1:X){ coord <- sample(1:N,4,replace=T) d <- runif(1,0,min(bm[coord[1],coord[2]],bm[coord[3],coord[4]]))

Machine is running x86 snv_94 after recent upgrade from opensolaris 2008.05. ZFS and zpool reported no troubles except suggesting upgrade for from ver.10 to ver.11. seemed like a good idea at the time. system up for several days after that point then took down for some unrelated maintenance. now will not boot the opensol, drops to grub prompt, no menus. zfs was mirrored on two disks c6d0s0 and