similar to: bitwise addition

Hello all, I am trying to create a matrix of 1s and -1s without any repetitions for a specified number of columns. e.g. 1s and -1s for 3 columns can be done uniquely in 2^3 ways. -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 and for 4 columns in 2^4 ways and so on. I finally used the function combn([0 1],3) that I found at the following link

hello all thanks a lot for the info, I just actually needed to remove that comma in my command line what i had typed in was t.test(temp.matrix[,1:11],temp.matrix[,12:22],paired=TRUE) what i needed to do was t.test(temp.matrix[1:11],temp.matrix[12:22],paired=TRUE) thanks Petr, saw your comment later. nameeta

Hello all, I am trying to run a two sample t-test on a matrix which is a 196002*22 matrix. I want to run the t-test, row-wise, with the first 11 columns being a part of the first group and columns 12-22 being a part of the second group. I tried running something like (temp.matrix being my 196002*22 matrix) t.test(temp.matrix[,1:11],temp.matrix[,12:22],paired=TRUE) or somthing like

I have a Samba-LDAP PDC at an office and 5 BDC's at other offices. At corporate HQ I have a W2k Server and domain. I have properly configured an interdomain trust and Users in the Samba domain can get to sections on the W2k machine regardless of location. However, members in the W2K domain can only access shares on the PDC. Attempts to access shares on a BDC cause a user name

What is the necessary syntax to exclude a file named #notes# from an action? I've tried these without success: #* "#*" #notes# "#notes#" \#notes\#

hi, i have installded samba 4 oncentos 7 and started to use as part of active directory. But i have a problemabout sharing files between samba and windows 7. i can browse and edit sharedfiles and folders on windows 7. But when i create a new folder, the owner of the folder is seen as ?#User300012?instead of the real samba user. My sharing steps 1-?????i have add a user named ?ege? on centos

Hey, This is the debug information: auth(default): client in: AUTH 1 PLAIN service=IMAP secured lip=127.0.0.1 rip=127.0.0.1 resp=AG1hcmsAbWFyaw==auth(default): passwd(mark,127.0.0.1): password mismatchauth(default): client out: FAIL 1 user=markimap-login: Disconnected: user=<mark>, method=PLAIN, rip=127.0.0.1, lip=127.0.0.1, secured The strange thing is that i

Hi Folks, Apologies to anyone who'd prefer not to see this query on this list; but I'm asking because it is probably the forum where I'm most likely to get a good answer! I'm interested in the provenance of the name "normal distribution" (for what I'd really prefer to call the "Gaussian" distribution). According to Wikipedia, "The name "normal

I am getting "Error: cannot allocate vector of size 197 MB". I know that similar problems were discussed a lot already, but I didn't find any satisfactory answers so far! Details: *** I have XP (32bit) with 4GB ram. At the time when the problem appeared I had 1.5GB of available physical memory. *** I increased R memory limit to 3GB via memory.limit(3000) *** I did gs() and got

I came across this in a simulation I ran under 1.6.0: If I do something like R> x <- rnorm(10) R> rval <- NULL R> for(i in 1:100000) rval <- t.test(x)$p.value then the process size remains at about 14M under 1.5.1, but it seems to be almost linearly growing up to more than 100M under 1.6.0. I know that the above simulation is nonsense, but it was the simplest I could come up

Hi, in my person model, I have a enumeration field "role" that take bits like 1, 2, 4, 8, 16, ..... they represent person roles(eg: admin(1), QA(2), manager(4) .... ). Each person can take on multiple roles. say there''s person A that''s both a admin and QA(the role value is "3") so if I search like "Person.find_by_content(''role:(1))", I

Hello, How can I do bitwise AND operations on a variable? I want to check the bits set in the HANGUPCAUSE, but can't find a way to do it. -- Alex Hermann

On 2/7/08, Ralph Giles <ralph.giles@artifex.com> wrote: > And theora, remember. Actually, I thought I remember derf doing that. And there it was on Trac's timeline. Look at changeset 14369: "Copy the libogg bitpacker directly into libtheoradec. Due to the vagaries of -fPIC and dynamic linking, we wasting a _huge_ amount of time on function call overhead. We also take the

It's very small, maybe it could be made a separate statically linked lib ? Or some of it inlined. That said, libogg is small too, and some of the routines in there are quite small as well.

On 09/02/2008, Ralph Giles <giles@xiph.org> wrote: > Yes, all that is reasonable. The original argument was that we need a > library anyway, no one noticed the function call overhead, and using > libogg simplified the embedding. > > Now, we'd like to remove libogg entirely as a dependency to avoid > confusion when using other containers, but that's an api change...

Ivo Emanuel Gon?alves wrote: > And IF that kind of performance can be gained in libvorbis too, the > question is, what are we waiting for? I doubt the performance gain would be that large. Theora had the fun little situation where it was thunking into the big endian version of some bitpacker functions which were one-line calls to the little endian version. Because gcc seemed to be

Please, I have a 2GB computer and a huge time-series to embedd, and i tried increasing memory.limit() and memory.size(max=TRUE), but nothing. Just before the command: > memory.size(max=TRUE) [1] 13.4375 > memory.limit() [1] 1535.875 > gc() used (Mb) gc trigger (Mb) max used (Mb) Ncells 209552 5.6 407500 10.9 350000 9.4 Vcells 125966 1.0 786432 6.0 496686 3.8

Hi, I would like to xor (bitwise) two matrices filled with binary values (0,1). The result of such XOR is expected to be 0,1. But apparently neither of xor nor bitXor is working in this case. I got ": binary operation on non-conformable arrays" error message when I used xor (M1,M2) . The problem with bitXor(M1,M2) is that it just truncates the result into a vector rather than a

Hi, I want to compute the bitwise 'and' between two values of type int1:  %x = and %a, %b  . Which is the LLVM instruction that creates this? I only found the APInt class, whose constructor is:  APInt(unsigned numBits, uint64_t val, bool isSigned = false) and which provides the bitwise AND operation: APInt  llvm::APIntOps::And (const APInt &LHS, const APInt &RHS)   Bitwise

Hi, I have a question about unsigned bitwise shift. According the C99 6.5.7.4 The result of E1 << E2 is E1 left-shifted E2 bit positions; vacated bits are filled with zeros. If E1 has an unsigned type, the value of the result is E1 × 2^E2, reduced modulo one more than the maximum value representable in the result type. So if unsigned b = 0x80000000; unsigned a = b << 1; a will