search for: 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/../../.. /libstdc++.so：undefined reference to 'A_::LTHUNK8' /developer/zsth/llvm-gcc/install/bin/../lib/gcc/i686-pc-linux-gnu/4.0.1/../../.. /libstdc++.so：undefined reference to 'A_::LTHUNK11' /developer/zsth/llvm-gcc/install/bin/../lib/gcc/i686-pc-linux-gnu/4.0.1/../../.. /libstdc++.so：undefined reference to 'A_::LTHUNK0' /dev...

On Mon, 2020-09-14 at 16:44 +0200, Christoph Hellwig wrote: > @@ -429,7 +430,7 @@ struct NCR_700_Host_Parameters { > for(i=0; i< (sizeof(A_##symbol##_used) / sizeof(__u32)); > i++) { \ > __u32 val = > bS_to_cpu((script)[A_##symbol##_used[i]]) + da; \ > (script)[A_##symbol##_used[i]] = bS_to_host(val); \ > - dma_cache_sync((dev), > &(script)[A_##symbol##_used[i]], 4, DMA_TO_DEVICE); \ > + dma_sync_to_dev...

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...

On Wed, 2020-08-19 at 08:55 +0200, Christoph Hellwig wrote: > 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 t...

...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 #{ X_t=a_t, X_{t-l_1}=a_{t-l_1}, X_{t-l_2}=a_{t-l_2}, ..., X_{t-l_k}=a_{t-l_k} } ---------------------------------------------------------------------------------- #{ X_{t-l_1}=a_{t-l_1}, X_{t-l_2}=a_{t-l_2}, ..., X_{t-l_k}=a_{t-l_k} } for any given sequence of a_t, a_{t-l_1}, a_{t-l_2}, ..., a_{...

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 Economics and Commercial Law Gothenburg University, Sweden E-mail: Florin.Ma...

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, 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 resulting matrix...

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...

...106143] [glusterd-pmap.c:231:pmap_registry_bind] 0-pmap: adding brick /data/gluster/dfd7e810-d4f8-4b4b-b5d1-53e5652f1a8f/OTZ on port 49210 [2018-02-03 13:55:09.207655] I [MSGID: 106143] [glusterd-pmap.c:231:pmap_registry_bind] 0-pmap: adding brick /data/gluster/c26580f1-e879-4225-8b3b-e3a3738130a0/A_s on port 49219 [2018-02-03 13:55:09.209824] I [MSGID: 106143] [glusterd-pmap.c:231:pmap_registry_bind] 0-pmap: adding brick /data/gluster/d60a681a-af2a-40ae-9732-9902bd2be614/v_v on port 49172 [2018-02-03 13:55:09.212030] I [MSGID: 106143] [glusterd-pmap.c:231:pmap_registry_bind] 0-pmap: adding bri...

...e n represents independent row-vectors and p correlated col vectors. Let the row representation be X = (X’_1, . . ., X’_n)’. I generate the differences of these vectors as D_{ab} = X_a – X_b, with different indices a and b, and similarly D_{cd} = X_c – X_d, and make a quadratic form D’_{ab}D_{cd} = A_{abcd}, say. Please note that, here a is unequal b, c is unequal d, a is unequal c, b is unequal d. By slightly shuffling the same set of vectors, I generate two other similar quadratic forms, say A_{acbd} and A_{adcb}, where the indices are again as unequal as stated above. In the R-code (a pa...

...map.c:231:pmap_registry_bind] > 0-pmap: adding brick /data/gluster/dfd7e810-d4f8-4b4b-b5d1-53e5652f1a8f/OTZ > on port 49210 > [2018-02-03 13:55:09.207655] I [MSGID: 106143] [glusterd-pmap.c:231:pmap_registry_bind] > 0-pmap: adding brick /data/gluster/c26580f1-e879-4225-8b3b-e3a3738130a0/A_s > on port 49219 > [2018-02-03 13:55:09.209824] I [MSGID: 106143] [glusterd-pmap.c:231:pmap_registry_bind] > 0-pmap: adding brick /data/gluster/d60a681a-af2a-40ae-9732-9902bd2be614/v_v > on port 49172 > [2018-02-03 13:55:09.212030] I [MSGID: 106143] [glusterd-pmap.c:231:pmap_registry...

...ov /home/rkotler/caviumllvm/build/Debug+Asserts/bin/llvm-cov test.c -a | diff -u test_no_options.output - diff -aub test_-a.cpp.gcov test.cpp.gcov diff -aub test_-a.h.gcov test.h.gcov /home/rkotler/caviumllvm/build/Debug+Asserts/bin/llvm-cov test.c -a -b | diff -u test_-b.output - diff -aub test_-a_-b.cpp.gcov test.cpp.gcov diff -aub test_-a_-b.h.gcov test.h.gcov On a native mips linux machine, we are failing a make check test which seems like it is supposed to already xfail. For one, the file test.c does not even exist (it is called test.cpp) And in the test file there is a line: XFAIL: po...

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 perform such tasks, but probably there is a more straigth forward solution...

Hi, I want to find a value of n1. I used the following code but I am getting the error - Error in as.vector(x, mode) : cannot coerce type 'closure' to vector of type 'any' n=10 a_g<-(1/(n*(n-1)))*((pi/3)*(n+1)+(2*sqrt(3)*(n-2))-4*n+6) a_s<-function(n1) { t1=(n1-1)/2; (t1*(gamma(t1)/gamma(n1/2))^2)/2-1-a_g } xm<-solve(a_s) Can anyone help me out. Thanks in advance for your help. Shant [[alternative HTML version deleted]]

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 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 the result. Does a...

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 b_k with the archive directory. But using the a_<i> dir...

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 there a similar operator in R, or is there another/better way? -.-.-.-.-.-.-.-.-.-...

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 $A_{i,j}$, $1\leq i,j\leq 5$, numerically and check against the known analytic values. When I run this code most components of A are correct, but some are zero. I ge...