search for: accs

Interestingly, the <<- operator is also a lot faster than using a namespace explicitly, and only slightly slower than using <- with local variables, see below. But, surely, both must at some point insert values in a given environment ? either the local one, for <-, or an enclosing one, for <<- ? so I guess I am asking if there is a more low-level assignment operation I can get my

No clue, but see ?assign perhaps if you have not done so already. -- Bert Bert Gunter "The trouble with having an open mind is that people keep coming along and sticking things into it." -- Opus (aka Berkeley Breathed in his "Bloom County" comic strip ) On Tue, Feb 27, 2018 at 6:51 AM, Thomas Mailund <thomas.mailund at gmail.com> wrote: > Interestingly, the

Hi guys, I am working on some code for automatically translating recursive functions into looping functions to implemented tail-recursion optimisations. See https://github.com/mailund/tailr As a toy-example, consider the factorial function factorial <- function(n, acc = 1) { if (n <= 1) acc else factorial(n - 1, acc * n) } I can automatically translate this into the loop-version

Following up on this attempt of implementing the tail-recursion optimisation ? now that I?ve finally had the chance to look at it again ? I find that non-local return implemented with callCC doesn?t actually incur much overhead once I do it more sensibly. I haven?t found a good way to handle parallel assignments that isn?t vastly slower than simply introducing extra variables, so I am going with

It looks like rsync 2.5.4 vs 26 has a bug when the target file is backed up with a suffix. For a large 1 GB file transfer, an error "redoing" appeared in the debug. In other words, when you see redoing in your debug expect the backup not to have worked correctly. I didn't see this problem btwn naxpap01 and rwxp25l1 just btwn rwxp25l1 and naxp18l1. I'm pulling the code from

Hi I never seen this before, and dont understand where too look for Please share some light on this. the host output is adding a extra domain. example bellow, its showing right IPs followed by NXDOMAIN !!! [root at 171-SYSLOG ~]# host 171-dc-a.xxxx.acc 171-dc-a.test.acc has address 10.254.228.226 171-dc-a.test.acc has address 10.254.225.45 Host 171-dc-a.test.acc not found: 3(NXDOMAIN) Host

I have load / store instructions that require accumulator. So a store looks like.. mov 3, acc st acc, addr I have specified "acc" as a separate register class containing only one register which is the "acc". The instr patterns are then splitted into: set imm:$src, ACCClass:$dst (generating the "mov" above) set ACCClass:$src, mem:$dst (generating the

...tar = runif(1,s-ds,s+ds) while(sstar <= 0){ sstar = runif(1,s-ds,s+ds) } logalpha = sum( dcauchy(y,location=fn(x,a,b),scale=sstar,log=T) - dcauchy(y,location=fn(x,a,b),scale=s,log=T)) - log(sstar/s) logu = log(runif(1,0,1)) acc = (logu < logalpha) s = acc*sstar + (1-acc)*s list(s=s,accs=acc) } sample.abs<-function(n=10000,x,y,a=0,b=1,s=2,da=.2,db =.2,ds=1) { accab <- 0 accs <- 0 A = B = S = rep(NaN,n) for(i in 1:n){ z = sampleab(x,y,a,b,s,da,db) q <- samples(x,y,a,b,s,ds) A[i] = a = z$a B[i] = b = z$b S[i]=s=q$s accab = accab + z$acc accs <- accs +q$accs } invis...

> On Feb 11, 2018, at 7:48 AM, Thomas Mailund <thomas.mailund at gmail.com> wrote: > > Hi guys, > > I am working on some code for automatically translating recursive functions into looping functions to implemented tail-recursion optimisations. See https://github.com/mailund/tailr > > As a toy-example, consider the factorial function > > factorial <-

Hi, i have a problem in assigning 2 conditions to grep() , my data look like this: DA 24 N7 Rad= 3.4 20 Sac= 0.93 Acc= 4.76 DA 24 N7 Rad= 3.4 14 Sac= 0.65 Acc= 3.33 DA 24 N7 Rad= 3.4 3 Sac= 0.14 Acc= 0.71 DA 24 N7 Rad= 3.4 11 Sac= 0.51 Acc= 2.62 DG 23 N7 Rad= 3.4 8 Sac= 0.37 Acc= 1.91 DG 23 N7 Rad= 3.4 5 Sac= 0.23 Acc= 1.19 DG 23 N7 Rad= 3.4 0 Sac= 0.00 Acc= 0.00 DG 23 N7 Rad= 3.4 3 Sac=

On Jan 17, 2008, at 4:12 AM, Sanjiv Gupta wrote: > I have load / store instructions that require accumulator. > So a store looks like.. > > mov 3, acc > st acc, addr > > I have specified "acc" as a separate register class containing only > one register which is the "acc". > The instr patterns are then splitted into: > > set imm:$src,

Dear Thomas, This looks like a really interesting project, and I don't think that anyone responded to your message, though I may be mistaken. I took at a look at implementing parallel assignment, and came up with: passign <- function(..., envir=parent.frame()){ exprs <- list(...) vars <- names(exprs) exprs <- lapply(exprs, FUN=eval, envir=envir) for (i in

Dear all, I installed "dovecot dovecoot-mysql postfix and postfix-mysql" from debian repository 7. I start them with "/etc/init.d/postfix start" and "/etc/init.d/dovecot start" but When i use nmap localhost I see the following output: root at sito:/etc/dovecot# nmap localhost Starting Nmap 6.00 ( http://nmap.org ) at 2013-09-12 07:35 IRDT Nmap scan report for

If we use the ROCR package to find the accuracy of a classifier pred <- prediction(svm.pred, testset[,2]) perf.acc <- performance(pred,"acc") Do we?find the maximum accuracy?as follows?(is there a simplier way?): > max(perf.acc at x.values[[1]]) Then to find the cutoff point that maximizes the accuracy?do we do the following?(is there a simpler way): > cutoff.list <-

Forgive the newbie question, I want to select random rows from my data.frame to create a test set (which I can do) but then I want to create a training set using whats left over. Example code: acc <- read.table("accOUT.txt", header=T, sep = ",", row.names=1) #select 400 random rows in data training <- acc[sample(1:nrow(acc), 400, replace=TRUE),] #try to get whats left

I have a list of data frames like this: a<- data.frame(x=runif(10), y = runif(10), Acc = 1) b<- data.frame(x=runif(10), y = runif(10), Acc = 0) ls<- list(a,b) and I want to remove the data frames from ls that have Acc values other than 1. How do I do that? Thanks for any help! Matthew

Hi Freinds, I have two data frames X,Y. I want to append both the data frames into one, along with the columns names from both the data frames (it should look like Z). X: Summary G Y R Acc 12 12 13 Bcc 11 14 15 Ccc 13 15 16 Y: Summary G Y R Acc 10 11 12 Bcc

Hello, The last weekend, the VM with CentOS 7 (kernel-3.10.0-327.28.2.el7.x86_64) was running with 2.5GB of used memory, but without users connected, and heavy services running. Three minutes after reboot, the o.s. is running with 114MB used. ?Why the 62% of memory is used if the o.s. does not have an intensive load? top sorted by memory: top - 12:55:34 up 8 days, 21:41, 1 user, load

...orary storage. Instead, we must spill to the stack. When spilling a reg to the stack, the RA needs two virtual regs, one to store and one to load. Currently, the loaded reg always has the same class as the stored reg. Because of this limitation, I ran into a problem: the RA would try to assign two Accs to physical regs, but only one is available, and the RA would fail. Line 1290 of InlineSpiller.cpp, inside the function spillAroundUses, says: "// FIXME: Infer regclass from instruction alone" (As opposed to the current behavior of always using the same class as the reg being spilled.) T...

Here's the output: Feb 9 15:51:26 SSI001 kernel: SFW2-INext-ACC-TCP IN=eth0 OUT= MAC=00:0f:ea:73:88:12:00:40:2b:67:5b:a7:08:00 SRC=192.168.1.54 DST=192.168.1.2 LEN=48 TOS=0x00 PREC=0x00 TTL=128 ID=51248 DF PROTO=TCP SPT=1964 DPT=139 WINDOW=65535 RES=0x00 SYN URGP=0 OPT (020405B401010402) Feb 9 15:51:28 SSI001 kernel: SFW2-INext-ACC-TCP IN=eth0 OUT=