Displaying 20 results from an estimated 198 matches for "overestimated".
2006 Jun 14
2
lmer binomial model overestimating data?
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:
2015 Jan 19
2
[LLVMdev] Vectorization Cost Models and Multi-Instruction Patterns?
...), 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 biggest one.
Note that AFAICT, costs for min/max patterns (icmp+iselect) are also
overestimated, but not as much as saturate.
Proposal:
Add a method, part of the vector API of TargetTransformInfo, for
multi-instruction cost computation. It would take a scalar
Instruction, and a reference to a set of Instruction. If it's able to
match a min/max/saturate/.., it adds all the matched ins...
2009 Nov 09
1
persp function question
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
2010 Jul 26
2
chan_skinny still maintained?
..._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 the SI...
2016 Mar 15
7
RFC: DenseMap grow() slowness
There’s a few passes in LLVM that make heavy use of a big DenseMap, one that potentially gets filled with up to 1 entry for each instruction in the function. EarlyCSE is the best example, but Reassociate and MachineCSE have this to some degree as well (there might be others?). To put it simply: at least in my profile, EarlyCSE spends ~1/5 of its time growing DenseMaps. This is kind of… bad.
2012 Sep 28
1
High memory needs [SOLVED]
...mall subsets of languages, for instance
on my Ubuntu 12.04, this file is only ~3MB.
I still don't get the reason, but CentOS x86_64 6.2 (and 6.3) mmappes
the *entire* file:
$ pmap $$
00007f217fae4000 96836K r---- /usr/lib/locale/locale-archive
Consequence: every processes that use glibc is overestimated by ~100MB
(according to the virtual memory).
That, alone, is not a problem at all. It is known that the virtual
memory is a bad estimation of the actual memory used, the fact that it
is largely overestimated does not matter much in most cases.
The problem, however, is that if you deal with a comp...
2010 Jul 07
3
[LLVMdev] simple way to print disassembly of final code from jit?
Thanks Reid - I'm on Windows. I guess I just assumed I was missing
something obvious in how to hook up the JIT and disassembler! Given
the nice looking disassembly code I found, I thought people would be
doing it all the time :-)
b.
On Tue, Jul 6, 2010 at 8:41 PM, Reid Kleckner <reid.kleckner at gmail.com> wrote:
> If you're on a recent flavor of Linux, you may be able to just
2019 Nov 05
3
RFC: [MC] Calculate difference of symbols in two consecutive MCDataFragments
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
2010 Jul 16
0
[LLVMdev] help
> In the insrtuction
> %1 = load i32** %y_addr, align 4
> what is the meaning of align 4??
> Can anyone explain?
>From http://llvm.org/docs/LangRef.html#i_load :
"The optional constant align argument specifies 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
2010 Jul 16
1
[LLVMdev] help
Anton Korobeynikov wrote:
>> In the insrtuction
>> %1 = load i32** %y_addr, align 4
>> what is the meaning of align 4??
>> Can anyone explain?
>>
> >From http://llvm.org/docs/LangRef.html#i_load :
>
> "The optional constant align argument specifies the alignment of the
> operation (that is, the alignment of the memory address). A value of 0
2011 Nov 01
1
reducing a too-large matrix obtained with allocMatrix()
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
2010 Jul 07
0
[LLVMdev] simple way to print disassembly of final code from jit?
If you're on a recent flavor 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
2010 Jul 16
3
[LLVMdev] help
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>
2016 Mar 15
2
RFC: DenseMap grow() slowness
What should we use instead of DenseMap?
—escha
> On Mar 15, 2016, at 3:30 PM, Xinliang David Li <xinliangli at gmail.com> wrote:
>
> yes it makes sense. Avoid using DenseMap when the size of the map is expected to be large but can not be pre-determined.
>
> David
>
> On Tue, Mar 15, 2016 at 3:07 PM, via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at
2010 Sep 25
2
Uncertainty propagation
I have a small model running under R. This is basically running various
power-law relations on a variable (in this case water level in a river)
changing spatially and through time. I'd like to include some kind of error
propagation to this.
My first intention was to use a kind of monte carlo routine and run the
model many times by changing the power law parameters. These power laws were
2010 Jul 06
2
[LLVMdev] simple way to print disassembly of final code from jit?
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.
2020 Oct 10
1
which() vs. just logical selection in df
Hi R-helpers,
Does anyone know why adding which() makes the select call more
efficient than just using logical selection in a dataframe? Doesn't
which() technically add another conversion/function call on top of the
logical selection? Here is a reproducible example with a slight
difference in timing.
# Surrogate data - the timing here isn't interesting
urltext <-
2012 Aug 29
2
Estimation parameters of lognormal censored data
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
2006 May 16
2
Determining length of speex file speech
...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 wit...
2019 Dec 18
2
RFC: Safe Whole Program Devirtualization Enablement
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