similar to: Do we need WINS Replication?

My laboratory is measuring the abundance of various proteins in the blood from either healthy individuals or from individuals with various diseases. I would like to determine which proteins, if any, have significantly different abundances between the healthy and diseased individuals. Currently, one of my colleagues is performing an ANOVA on each protein with MS Excel. I would like to analyze

Hi, i have compile and built the llvm-gcc4 and llvm 1.8a in my machine, but there is some problem about llvm-gcc4. It can not compile a cpp code like this: #include <iostream> using std::cout; using std::endl; int main() { cout << "Hello" << endl; } $llvm-g++ hello.cc -o hello /developer/zsth/llvm-gcc/install/bin/../lib/gcc/i686-pc-linux-gnu/4.0.1/../../..

Switch the 53c700 driver to only use non-coherent descriptor memory if it really has to because dma_alloc_coherent fails. This doesn't matter for any of the platforms it runs on currently, but that will change soon. To help with this two new helpers to transfer ownership to and from the device are added that abstract the syncing of the non-coherent memory. The two current bidirectional cases

Hi all, I'm new with R (and S), and relatively new to statistics (I'm a computer scientist), so I ask sorry in advance if my question is silly. My problem is this: I have a (sample of a) discrete time stochastic process {X_t} and I want to estimate Pr{ X_t | X_{t-l_1}, X_{t-l_2}, ..., X_{t-l_k} } where l_1, l_2, ..., l_k are some fixed time lags. It will be enough for me to compute

Hello, How I can compute in R the orthogonal complement of one matrix? If A (n x m ) matrix of full column rank (n>m), its orthogonal complement is denoted by A_ . A_ is n X (n-m) matrix of full column rank and such that A'A_=0. I need to compute A_. How I can compute A_ in R? Best Regards, /Florin -- Florin G. Maican Ph.D. candidate, Department of Economics School of

Hi, I would like to generate a correlation matrix with a particular structure. For example, a 3n x 3n matrix : A_(nxn) aI_(nxn) bI_(nxn) aI_(nxn) A_(nxn) cI_(nxn) aI_(nxn) cI_(nxn) A_(nxn) where - A_(nxn) is a *specified* symmetric, positive definite nxn matrix. - I_(nxn) is an identity matrix of order n - a, b, c are (any) real numbers Many attempts have been unsuccessful because a

Dear All I am kind of stuck up with a code a part of which seems to be causing a problem, or at least I think so. May be the community can help me. It’s simple but I suppose I am missing something. I generate a data matrix X, say of order n*p, where n represents independent row-vectors and p correlated col vectors. Let the row representation be X = (X’_1, . . ., X’_n)’. I generate the

rkotler at mipsswbrd006-le:~/caviumllvm/build/test$ make Making LLVM 'lit.site.cfg' file... Making LLVM unittest 'lit.site.cfg' file... ( ulimit -t 600 ; ulimit -d 512000 ; ulimit -m 512000 ; ulimit -s 8192 ; \ /usr/bin/python /home/rkotler/workspace/llvm/utils/lit/lit.py -s -v . ) XPASS: LLVM :: tools/llvm-cov/llvm-cov.test (8916 of 9784) ******************** TEST

Hi, I'd like to know if it is possible to use wildcards * for indexing... E.g. I have a vector of strings. Now I'd like to select all elements which start with A_*? I'd also need to combine that with logical operators: "Select all elements of a vector that start with A (A*) OR that start with B (B*)" Probably that is quite easy. I looked into grep() which I think might

Hi, It is my understanding that the eigenvectors of a circulant matrix are given as follows: 1,omega,omega^2,....,omega^{p-1} where the matrix has dimension given by p x p and omega is one of p complex roots of unity. (See Bellman for an excellent discussion on this). The matrix created by the attached row and obtained using the following commands indicates no imaginary parts for the

Hi, There may be a simple mistake of mine, but i just can't figure it out: I tryed to play around with options but with no success. If you could help me i'll be grateful, so that's is my environment: - there are 2 networks: 172.16.0.0/255.255.255.0 and 172.16.1.0/255.255.255.0 - i've setup up a Linux box with 2 cards : eth0 172.16.0.2 and eth1 172.16.1.2 - i have Win9x clients

Given an nxm matrix A I want to compute the nxm matrix B whose ij-th element is the sum of the elements of A lying on the diagonal that ends with element ij, i.e., b_ij = a_ij + a_(i-1)(j-1) + a_(i-2)(j-2) + ... In APL (which I no longer use), I would use the 'rotate' operator to derive an array whose columns are diagonals of the given array and then cumulate down columns. Is

Hello, Say one starts with creating an archive rsync work -> archive and periodically (below, i = 1 to N) does rsync --backup-dir=a_<i> work -> archive and rsync --compare-dest=archive work -> b_<i> Then suppose one wants to recover the work directory as it was at time k. Using the b_<i> directories, one would merely merge

Hi all, I am trying to minimize the quardratic form w'Aw, with certain constraints. In particular, (1) A=(a_{ij}) is n by n matrix and it is symmetric positive definite, a_{ii}=1 for all i; and 0<a_{ij}<1 for i not equal j. (2) w'1=n; (3) w_{i}>=0 Analytically, for n=2, it is easy to come up with a result. For larger n, it seems difficult to obtain

I have tried hunting through docs/lists/Google but no joy. I am sure I saw something about running multiple Samba's on different ports but I want to use different interfaces all on port 139. So: Can I run multiple s/nmbd's on the same machine? I have nine main VLANs and somewher in the region of 30 odd worgroups (don't ask !) of which 10 are of interest. 3,500 odd PCs. I have a

Hello, Guys: I'm from China, my English is poor and I'm new to R. The first message I sent to R help meets some problems, so I send again. Hope that I can get useful suggestions from you warm-hearted guys. Thanks. I builded a multiplicative seasonal ARMA model to a series named "cDownRange". And the order is (1,1)*(0,1)45 The regular AR=1; regular MA=1; seasonal AR=0; seasonal

On Thu, 12 Apr 2007, Fernando Magno Quintao Pereira wrote: >> I'm definitely interested in improving coalescing and it sounds like >> this would fall under that work. Do you have references to papers >> that talk about the various algorithms? > > Some suggestions: > > @InProceedings{Budimlic02, > AUTHOR = {Zoran Budimlic and Keith D. Cooper and Timothy

Hi, when saving a file to this share the permissions (0777) are being ignored under OS X 10.11.5. All files will get these permissions: 0755. I don't know why? Samaba Version 4.2.7-SerNet-RedHat-19.el6 CentOS release 6.7 [global] workgroup = BAVARIA server string = Samba Server %m netbios name = NASBAV1 log file = /var/log/samba/%m_%a_%R.log

Greetings, Sorry, the last message was sent by mistake! Here it is again: I encounter a strange problem computing some numerical integrals on [0,oo). Define $$ M_j(x)=exp(-jax) $$ where $a=0.08$. We want to compute the $L^2([0,\infty))$-inner products $$ A_{ij}:=(M_i,M_j)=\int_0^\infty M_i(x)M_j(x)dx $$ Analytically we have $$ A_{ij}=1/(a(i+j)). $$ In the code below we compute the matrix

Hi all, this series replaced the DMA_ATTR_NON_CONSISTENT flag to dma_alloc_attrs with a separate new dma_alloc_pages API, which is available on all platforms. In addition to cleaning up the convoluted code path, this ensures that other drivers that have asked for better support for non-coherent DMA to pages with incurring bounce buffering over can finally be properly supported. I'm still a