search for: overestim

Hi folks, Warning: I don't know if the result I am getting makes sense, so this may be a statistics question. The fitted values from my binomial lmer mixed model seem to consistently overestimate the cell means, and I don't know why. I assume I am doing something stupid. Below I include code, and a binary image of the data is available at this link: http://www.cas.muohio.edu/~stevenmh/tf.RdataBin This was done with `Matrix' version 0.995-10 and `lme4' version 0.995-2....

Hi all, While tinkering with saturation instructions, I hit problems with the cost model calculations. The loop vectorizer cost model accumulates the individual TTI cost model of each instruction. For saturating arithmetic, this is a gross overestimate, since you have 2 sexts (inputs), 2 icmps + 2 selects (for the saturation), and a truncate (output); these all fold alway. With an intrinsic, you'd end up with a better estimate; however, I'm trying to see what problems we would encounter without intrinsics, and I think this is the bigge...

Hello, I have a question about persp function: I made my classical matrix with x, y and z variables and I dont know why I obtain a 3D image with overestimate heights. Here is my script: microtopo = read.csv2("topo2.csv", dec=".") attach(microtopo) require(akima) # for persp or zz <-interp (x, y, z) persp(zz) See also my attach file Thanks, Best regards JS -------------- next part -------------- A non-text attachme...

..._skinny as it seems to be generally underused. (Is functionality identical across both firmwares?) However, I've come across a couple of showstoppers and am not really sure where to go from here. I've raised bugs for both of them (#17680, #17692) and had no response so far - have I perhaps overestimated how much chan_skinny is in use these days, or do I need to follow another route? I'm not an Asterisk developer but am happy to spend some time this week resolving the problems. Unfortunately I need the phones next week, so may have to end up taking the defeatist approach of switching to th...

...Include the hash code in the map so that we don’t have to rehash. 32 bits more per entry (or whatever), and it might not help that much, since we still have to do the whole reinsertion routine. 3. Pre-calculate an estimate as to the map size we need. For example, in EarlyCSE, this is possibly gross overestimate of size needed: unsigned InstCount = 0; unsigned LoadCount = 0; unsigned CallCount = 0; for (inst_iterator FI = inst_begin(F), FE = inst_end(F); FI != FE; ++FI) { if (FI->mayReadOrWriteMemory()) ++LoadCount; else if (isa<CallInst>(*FI)) ++CallCount; else...

...uot; command, "VIRT" field). Therefore, the part of the locale-archive file mapped to memory adds up to the virtual memory of every processes that makes use of glibc (basically everything), while this is actually only once in memory. In other words, for every processes, the virtual memory overestimates the real memory of the process by, at least, the part of the locale-archive file which is memory-mapped. Apparently, on 32bits distros, and on most 64bits distros, only a part of the locale-archive file is mmapped: for instance on CentOS 32 bits: $ pmap $$ b7689000 2048K r---- /usr/lib/lo...

...just go into > gdb and type "disas <pointer-to-JITed-code>".  More detail here: > http://llvm.org/docs/DebuggingJITedCode.html > > If you still want to do it programmatically, I think you might be > stuck.  IIRC the length known by the JIT memory allocator is an > overestimate (it's rounded up for alignment), so the disassembler will > hit garbage at the end. > > Reid > > On Tue, Jul 6, 2010 at 3:07 PM, Bill O'Hara <billtohara at gmail.com> wrote: >> Hi, >> >> With the new llvm-mc code for disassembling, what is the recom...

Hello, I've been trying to add support to the integrated assembler to handle cases like below foo:instr; .if . - foo; instr; .endif when the dot symbol and foo are assigned to consecutive MCDataFragments <https://github.com/ClangBuiltLinux/linux/issues/744>. I have a patch <https://reviews.llvm.org/D6941> under review. And even though it seems to solve the problem, the concern

...pecifies the alignment of the operation (that is, the alignment of the memory address). A value of 0 or an omitted align argument means that the operation has the preferential alignment for the target. It is the responsibility of the code emitter to ensure that the alignment information is correct. Overestimating the alignment results in undefined behavior. Underestimating the alignment may produce less efficient code. An alignment of 1 is always safe." -- With best regards, Anton Korobeynikov Faculty of Mathematics and Mechanics, Saint Petersburg State University

...the > operation (that is, the alignment of the memory address). A value of 0 > or an omitted align argument means that the operation has the > preferential alignment for the target. It is the responsibility of the > code emitter to ensure that the alignment information is correct. > Overestimating the alignment results in undefined behavior. > Underestimating the alignment may produce less efficient code. An > alignment of 1 is always safe." > > After reading the description, I am left wondering why LLVM has this feature and for what it is intended to be used. My...

Hello, I have some C code (for a shared lib called via .External) that uses PROTECT(w= allocMatrix(REALSXP, m, n)); mostly successfully. In rare cases, though, the row count m will be an overestimate. Is there a way to reallocate the matrix in-place, something like reAllocMatrix (w,m-excess,n) /* where excess is > 0 */ to chop off the last excess rows of w? I only find out about the excess rows during the single pass over the data made to copy it from its source to w. Short of thi...

...of Linux, you may be able to just go into gdb and type "disas <pointer-to-JITed-code>". More detail here: http://llvm.org/docs/DebuggingJITedCode.html If you still want to do it programmatically, I think you might be stuck. IIRC the length known by the JIT memory allocator is an overestimate (it's rounded up for alignment), so the disassembler will hit garbage at the end. Reid On Tue, Jul 6, 2010 at 3:07 PM, Bill O'Hara <billtohara at gmail.com> wrote: > Hi, > > With the new llvm-mc code for disassembling, what is the recommended > way to disassemble the...

In the insrtuction %1 = load i32** %y_addr, align 4 what is the meaning of align 4?? Can anyone explain? -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100716/ef433d43/attachment.html>

...de the hash code in the map so that we don’t have to rehash. 32 bits more per entry (or whatever), and it might not help that much, since we still have to do the whole reinsertion routine. > 3. Pre-calculate an estimate as to the map size we need. For example, in EarlyCSE, this is possibly gross overestimate of size needed: > > unsigned InstCount = 0; > unsigned LoadCount = 0; > unsigned CallCount = 0; > for (inst_iterator FI = inst_begin(F), FE = inst_end(F); FI != FE; ++FI) { > if (FI->mayReadOrWriteMemory()) > ++LoadCount; > else if (isa<CallIn...

...from a normal distribution centered on alpha (resp. beta) with a standard deviation of da (resp. db) and to perform my statistics (mean and standrad edviation of the model result) on the model output? It seems to me that da and db are correlated in some way and by doing what I entended to, I would overestimate the final error of my model... My statistical skills are rather weak, is there a way people usually deal with this kind of problems? Thanks -- View this message in context: http://r.789695.n4.nabble.com/Uncertainty-propagation-tp2713499p2713499.html Sent from the R help mailing list archive a...

Hi, With the new llvm-mc code for disassembling, what is the recommended way to disassemble the final code produced by a JIT compiler backend? (Eg. in the toy.cpp example from the tutorial). I can get the void* for the final code, but I don't know its length - superficially at least it appears I need to know the length to disassemble it as a buffer? Thanks b.

...quot;") download.file(url=urltext, destfile="tempfile.csv") # download file first dat <- read.csv("tempfile.csv", stringsAsFactors = FALSE, header=TRUE, nrows=2.5e6) # read the file; 'nrows' is a slight # overestimate dat <- dat[,1:3] # select just the first 3 columns head(dat, 10) # print the first 10 rows # Select using which() as the final step ~ 90ms total time on my macbook air system.time( head( dat[which(dat$gender2=="other"),],), gcFirst=TRUE) # Select skipping which() ~130ms to...

Hi, I am trying to get the maximum likelihood estimator for lognormal distribution with censored data;when we have left, interval and right censord. I built my code in R, by writing the deriving of log likelihood function and using newton raphson method but my estimators were too high " overestimation", where the values exceed the 1000 in some runing of my code. is there any one can tell me where the error can be and help me in how I can get the estimators with right way?.  kind regards [[alternative HTML version deleted]]

...ra_headers:0 Page #2: 1 packets. Page #3: 45 packets. Page #4: 45 packets. Page #5: 45 packets. Page #6: 45 packets. Page #7: 45 packets. Page #8: 45 packets. Pages: 8 Packets: 272 Calculating things per hand here 6*45 speex frames, so the speech length should be 5.4 seconds. Unfortunately this is overestimated: $ time speexdec spfe49_1-small.spx Decoding 44100 Hz audio using ultra-wideband (sub-band CELP) mode (stereo) Encoded with Speex 1.1.12 real 0m3.992s user 0m0.112s sys 0m0.020s So my questions are: What does the "frame_size: 640" mean (the information was simply read out...

On Wed, Dec 18, 2019 at 3:38 AM Iurii Gribov via llvm-dev < llvm-dev at lists.llvm.org> wrote: > (Readding Hal) > > > Are you suggesting that we should be more aggressive by default (i.e. > without -fvisibility=hidden or any new options)? > > I believe that will be too aggressive for class LTO visibility. > > It is common to override a virtual functions across