search for: ni

I'm observing odd behavior of the rep(...) procedure when using variables as parameters in a loop. Here's a simple loop on a vector 'branches' that is c(5,6,5,5,5). The statement in question is print(c(ni,rep(i,times=ni))) that works properly first time through the loop but the second time, when branches[2] = 6, only prints 5 values of i. Any ideas, anyone? iInd = 1 for(i in 1:length(branches)) { print((1:branches[i])+iInd-1) # iInd is a position shift of the index ni = branches[i]...

Hi list, For a client I am setting up a system which will use T1 PRI from Primus, who offer only NI-1 and NI-2 protocols for D-Channels. Previousely I have only used switchtypes euroISDN and National. Although the documentation says Asterisk does support NI-1 ans NI-2, but wanted to get your opinion if you have used these protocols on an Asterisk box and if there were any things to consider. If a...

Dear R-list members, I have a problem with translating a mathematica script into R. The whole script is at the end of the email (with initial values for easy reproduction) and can be pasted directly into R. The problematic part (which is included below of course) is <--- Original Mathematica ---> (* p_svbar *) UiA = Ni (Dsi - 2Di A + A^2)/2; UiiA = Nii (Dsii - 2Dii A + A^2)/2; psvbar = NIntegrate[1/(UiA^(Ni/2)) 1/(UiiA^(Nii...

...the IR you're giving to opt or at least a complete C function and your clang command line. ~Craig On Wed, Mar 14, 2018 at 3:05 PM, hameeza ahmed <hahmed2305 at gmail.com> wrote: > Hello, > > I m unable to vectorize following kernel by opt tool; > > for (i = 0; i < _PB_NI; i++) > for (j = 0; j < _PB_NJ; j++) > { > tmp[i][j] = 0; > for (k = 0; k < _PB_NK; ++k) > tmp[i][j] += alpha * A[i][k] * B[k][j]; > } > for (i = 0; i < _PB_NI; i++) > for (j = 0; j < _PB_NL; j++) > { > D[i][j]...

Hello, I m unable to vectorize following kernel by opt tool; for (i = 0; i < _PB_NI; i++) for (j = 0; j < _PB_NJ; j++) { tmp[i][j] = 0; for (k = 0; k < _PB_NK; ++k) tmp[i][j] += alpha * A[i][k] * B[k][j]; } for (i = 0; i < _PB_NI; i++) for (j = 0; j < _PB_NL; j++) { D[i][j] *= beta; for (k = 0; k < _PB_NJ; ++k)...

Dear sir, Dear Madam I begin with R and I couldn't find in the manuels how I can solve this this problem find n such as |1/ni*sum(Wi)|<0.2 with Wi<-c(rnorm(200,0,1)) Thanks for helping Best regards ------------------------------------------ [[alternative HTML version deleted]]

...gt; Crumbs. > > I think that the analysis I told you before wasn't fully correct. I > think I mentioned something about "n = 4" and that could cause the > SmallVector to reallocate things. But that was in error. The analysis seems to be right after all. The node iterator (NI) is clobbered when node 5 is added. The reason it sometimes causes a failure may be related to whether NI is dereferenced after it's being clobbered. This is highly platform specific, as well as optimization specific. The problem exists on all platforms that I've seen so far. In short: Th...

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, I have a 6.3 guest running on a 6.3 host and the output from top seems strange to me. At least I did not expect this. While in the guest on core is busy with i/o the host seems idle. Does anyone know why it is this way? See the output from top below, first the one from guest, then host. top - 14:12:35 up 12 min, 1 user...

...s between sample's result when samples consist of full elements and consist of only distinct elements. When sample consist of full elements it take about 120 sec., but when consist of only distinct elements it take about 4.5 or 5 times more sec. I expected that opposite of this result, because unique(sample) has less elements than full sample. Code as follows; e <- rnorm(n=50, mean=0, sd=sqrt(0.5625)) x0 <- c(rep(1,50)) x1 <- rnorm(n=50,mean=2,sd=1) x2 <- rnorm(n=50,mean=2,sd=1) x3 <- rnorm(n=50,mean=2,sd=1) x4 <- rnorm(n=50,mean=2,sd=1) y <- 1+ 2*x1+4*x2+3*x3+2*x4+e x2...

...Sebastian Pop" <sebpop.llvm at gmail.com> >> To: "Hal Finkel" <hfinkel at anl.gov> >> Cc: "Sebastian Paul Pop" <s.pop at samsung.com>, "llvm-dev" <llvm-dev at lists.llvm.org>, "Matthias Braun" >> <matze at braunis.de>, "Clang Dev" <cfe-dev at lists.llvm.org>, "nd" <nd at arm.com>, "Abe Skolnik" <a.skolnik at samsung.com>, >> "Renato Golin" <renato.golin at linaro.org> >> Sent: Monday, October 10, 2016 9:10:01 AM >> Subject:...

Hi @ all, I have question how to mark significant outliers in R. This is my very simple script to plot a regression: TOC_NI<-read.csv2("C:/Users/XYZ/Desktop/Master/Daten/Statistik/TOC-NI.csv", sep=";", dec=",", encoding="UTF-8") plot(NI~TOC,data=TOC_NI,col="blue", pch=16, xlim=c(0,4500000...

...) { iterator E = end(); for (iterator I = std::lower_bound(begin(), E, n); @@ -1599,18 +1608,23 @@ for (SetVector<unsigned>::iterator I = Remove.begin(), E = Remove.end(); I != E; ++I) { unsigned n = *I; - for (Node::iterator NI = IG.node(n)->begin(), NE = IG.node(n)->end(); - NI != NE; ++NI) { - if (NI->Subtree->DominatedBy(Top)) { - if (NI->To == n1) { - assert((NI->LV & EQ_BIT) && "Node inequal to itself."); + Node *N...

...ar group I had a R ? program that was to slow, I mad it multi core prog..to speed up, its a simulation when the runs are 100 its very fast..raising the runs to 10k mad it in the first fast then it slow down I checked the HW usafe and here is the top command results %Cpu0 ?:100.0 us, ?0.0 sy, ?0.0 ni, ?0.0 id, ?0.0 wa, ?0.0 hi, ?0.0 si, ?0.0 st %Cpu1 ?:100.0 us, ?0.0 sy, ?0.0 ni, ?0.0 id, ?0.0 wa, ?0.0 hi, ?0.0 si, ?0.0 st %Cpu2 ?:100.0 us, ?0.0 sy, ?0.0 ni, ?0.0 id, ?0.0 wa, ?0.0 hi, ?0.0 si, ?0.0 st %Cpu3 ?:100.0 us, ?0.0 sy, ?0.0 ni, ?0.0 id, ?0.0 wa, ?0.0 hi, ?0.0 si, ?0.0 st %Cpu4 ?:100.0...

Hi, I would need some help to fix polybench/symm: void kernel_symm(int ni, int nj, DATA_TYPE alpha, DATA_TYPE beta, DATA_TYPE POLYBENCH_2D(C,NI,NJ,ni,nj), DATA_TYPE POLYBENCH_2D(A,NJ,NJ,nj,nj), DATA_TYPE POLYBENCH_2D(B,NI,NJ,ni,nj)) { int i, j, k; DATA_TYPE acc; /* C := alpha*A*B + beta*C, A is symetric */ for (i = 0; i < _PB_NI; i++) for (j = 0; j <...

The following C code : #include <stdio.h> #include <stdlib.h> int TESTE2( int parami , int paraml ,double paramd ) { int varx=0,vary; int nI =0; //varx= parami; if( parami > 0 ) { varx = parami; vary = varx + 1; } else { varx = vary + 1; vary = paraml; } varx = varx + parami + paraml; for( nI = 1 ; nI <= paraml; nI++) { varx = varx + parami + 1 ; vary = varx + nI; } vary = varx + 5;...

Thanks for tracking this down! I can't seem to reproduce it on Linux, even with valgrind. Can you try out this patch and let me know whether it works? Nick Marcel Moolenaar wrote: > On May 26, 2008, at 1:25 AM, Bill Wendling wrote: > >> On May 25, 2008, at 1:39 PM, Marcel Moolenaar wrote: >>> On May 25, 2008, at 12:58 AM, Bill Wendling wrote: >>> >>>> Could you try this (massively hacky) patch out to see i...

...roblem Mark Bravington mark.bravington at csiro.au mvbutils:::assign.to.base( 'rbind.data.frame', function (..., deparse.level = 1) { match.names <- function(clabs, nmi) { if (all(clabs == nmi)) NULL else if (length(nmi) == length(clabs) && all(nii <- match(nmi, clabs, 0))) { m <- pmatch(nmi, clabs, 0) if (any(m == 0)) stop("names do not match previous names") m } else stop("names do not match previous names:\n\t", paste(nmi[nii ==...

...di-tools-2.1.0.2 libpri-1.4.10.1 asterisk-1.4.25.1 2 X TE412P Digium cards on ISDN PRI Im using the system as an IVR without any transcoding or bridging ************************************** top - 10:27:57 up 199 days, 5:18, 2 users, load average: 67.75, 62.55, 55.75 Tasks: 149 total, 1 running, 148 sleeping, 0 stopped, 0 zombie Cpu0 : 10.3%us, 32.0%sy, 0.0%ni, 57.3%id, 0.0%wa, 0.0%hi, 0.3%si, 0.0%st Cpu1 : 10.6%us, 34.6%sy, 0.0%ni, 54.8%id, 0.0%wa, 0.0%hi, 0.0%si, 0.0%st Cpu2 : 13.3%us, 36.5%sy, 0.0%ni, 49.8%id, 0.0%wa, 0.0%hi, 0.3%si, 0.0%st Cpu3 : 8.6%us, 39.5...

...d(); > for (iterator I = std::lower_bound(begin(), E, n); > @@ -1599,18 +1608,23 @@ > for (SetVector<unsigned>::iterator I = Remove.begin(), E = > Remove.end(); > I != E; ++I) { > unsigned n = *I; > - for (Node::iterator NI = IG.node(n)->begin(), NE = > IG.node(n)->end(); > - NI != NE; ++NI) { > - if (NI->Subtree->DominatedBy(Top)) { > - if (NI->To == n1) { > - assert((NI->LV & EQ_BIT) && "Node inequal to > itse...

...d not install R to the computer. Thank you. Jinbo __________________________________________________ Faith Hill - Exclusive Performances, Videos & More -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !) To: r-help-request at stat.math.ethz.ch _._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._