Displaying 20 results from an estimated 21 matches for "renormalizes".
Did you mean:
renormalize
2007 Sep 12
1
Integrate() error message, I am at a loss
Hello!
I have a problem with integrate() in my function nctspa(). Integrate
produces an error message "evaluation of function gave a result of
wrong length". I don't know what that means. Could anyone suggest me
what is wrong with my function?
These are the examples of function calls that work OK:
nctspa(a=1:10,n=5)
nctspa(a=1:10, n=5, mu=2, theta=3, renorm=0)
This does not work:
2007 Sep 12
0
Problem with integrate()
Hello!
I have a problem with integrate() in my function nctspa(). Integrate
produces an error message "evaluation of function gave a result of
wrong length". I don't know what that means. Could anyone suggest me
what is wrong with my function?
These are the examples of function calls that work OK:
nctspa(a=1:10,n=5)
nctspa(a=1:10, n=5, mu=2, theta=3, renorm=0)
This does not work:
2000 Jul 03
2
Possible bug in psy.c
Hi all,
I'm quite new to Vorbis, so please excuse me if I'm writing complete
nonsense (and, if possible, tell me where I'm wrong).
While searching for optimization possibilities in lib/psy.c, I found the following
piece of code in _vp_compute_mask():
if(p->vi->smoothp){
/* compute power^.5 of three neighboring bins to smooth for peaks
that get split twixt
2007 Apr 17
1
question about spx_fft
Thanks for the explaination. Please see my questions and comment in lines.
On 4/16/07, Jean-Marc Valin <jean-marc.valin@usherbrooke.ca> wrote:
> (keeping this on the list)
>
> William Zhang wrote:
> > I read the mdf.c an my understanding is that N is actually window size
for
> > the FFT. The actual length L = N/2 which is the frame length. The
> > second part
2000 Feb 03
1
Re: your mail
...to perform a box-cox transformation to a data set and also plot
> > lambda versus L(lambda) using R. Does anybody knows how can I do such a
> > thing?
gnlr3 in my gnlm library does both linear and nonlinear models with
Box-Cox transformation. However, it is somewhat nonstandard as it
renormalizes to obtain a true density whereas the standard
transformation creates a function that is not a density because of the
constraint that only positive values can be transformed but the normal
distribution is on the whole real line. Jim
-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-...
2007 Oct 22
0
[LLVMdev] OT: new here, dynamic/runtime compilation (in general)
On Oct 21, 2007, at 6:23 PM, BGB wrote:
> ok, just in my case, I guess I am a little fussy/weird, wanting
> efficient dot and cross products (if at all possible, though these
> operations at present don't exist natively within SSE...), among
> many other operations (length, lerp, renormalization, ..).
>
> then again, probably a fairly smart compiler could still get
2017 Aug 19
4
FLAC compression experiment
Hi FLAC team.
I feel I have found a super high compression way of FLAC. I have tested a 1 hour WAV file of 440HTZ with a 5,25,50,75,100 normalize volume preset. This dramatically changes the compression size of the end FLAC file even though the WAV file size is identical for all 5 WAV files. Only the volume is different. When you renormalize the WAV to its original volume the file is still 100%
2007 Oct 22
4
[LLVMdev] OT: new here, dynamic/runtime compilation (in general)
well, sadly, I am not sure how people are on this list...
in any case, LLVM is an interesting project, and may well continue being interesting.
but, in my case, I have done my own compilation framework...
ok, I didn't really hear about the really interesting bits of LLVM until after I had (more or less) wrote mine...
ok, my point is to maybe to have something interesting to talk about, not
2004 Sep 10
0
Blocking and compression.
--- Wayde Milas <wmilas@rarcoa.com> wrote:
> On Tue, 2004-01-20 at 23:44, Josh Coalson wrote:
> > Miroslav did some experiments with searching for optimum blocksize.
> > from what I remember it made at best a couple percent difference.
> > there was a thread about it here a while back.
> >
> Did his changes make it in? I can think of a coupla ways to approach
2002 Apr 03
0
Another question on locfit
Hello!!!
Thank you all for your suggestion on my last question about locfit.
Now I have another question:
I would like to change the evalution structure ev in locfit() to a vector/matrix.
I created a vector and a matrix:
> vec <- mat.or.vec(101, 1)
> vec <- c(0:100)
> mat <- matrix(data = vec, nrow = 101, ncol = 1)
and I tried to change the ev parameter:
> fit <-
2000 Jul 06
0
AW: Possible bug in psy.c
> -----Ursprüngliche Nachricht-----
> Von: Monty [SMTP:xiphmont@xiph.org]
> Gesendet am: Donnerstag, 6. Juli 2000 01:30
> An: vorbis-dev@xiph.org
> Betreff: Re: [vorbis-dev] Possible bug in psy.c
>
> > Hi all,
> >
> > I'm quite new to Vorbis, so please excuse me if I'm writing complete
> > nonsense (and, if possible, tell me where I'm
2004 Dec 01
2
chisq.test probabilities method unclear
Hi list,
i've got a question about the chisq.test function.
in the use of the "given probabilities" method (p= ...), normally
there should be typed in probabilities in the range of 0 to 1 with the
absolute sum of 1.0 (r-help)
But it is possible to use probabilities > than 1. or the sum <1.!
without any warning message
Ok, now the question, what does r calcutate in these
2009 Jan 29
0
np 0.30-1 (nonparametric kernel smoothing methods for mixed data types) is available on CRAN...
Dear R users,
Version 0.30-1 of the np package has been released and uploaded to CRAN.
The np package provides nonparametric kernel smoothing methods for mixed
data types. We encourage anyone using the package to upgrade to the
latest version.
Description: This package provides a variety of nonparametric (and
semiparametric) kernel methods that seamlessly handle a mix of
continuous, unordered,
2009 Jan 29
0
np 0.30-1 (nonparametric kernel smoothing methods for mixed data types) is available on CRAN...
Dear R users,
Version 0.30-1 of the np package has been released and uploaded to CRAN.
The np package provides nonparametric kernel smoothing methods for mixed
data types. We encourage anyone using the package to upgrade to the
latest version.
Description: This package provides a variety of nonparametric (and
semiparametric) kernel methods that seamlessly handle a mix of
continuous, unordered,
2006 Oct 16
2
Re : Re : Generate a random bistochastic matrix
Yes, you're right. In fact, it's just an adaptation of a matlab command and the author advises using N^4 replications that's why it's the default in the function. The bistochastic matrix is not my subject of interest, but I need it to perform some random tranformation of a vector of incomes.
Florent Bresson
----- Message d'origine ----
De : Richard M. Heiberger <rmh at
2007 Oct 22
0
[LLVMdev] OT: new here, dynamic/runtime compilation (in general)
On Oct 21, 2007, at 5:27 PM, BGB wrote:
> well, sadly, I am not sure how people are on this list...
I'd suggest browsing through the llvmdev mailing list archive.
> now, what I do with it is this:
> I use C as a scripting language...
>
Sounds like a fun project. Note that the clang C front-end also
supports use in a JIT environment: this will allow you to JIT the
full
2007 Apr 15
3
question about spx_fft
Hi Jean-Marc and list,
Is the spx_fft function in fftwrap.c a standard fft function?
void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out)
When I say standard, I mean the input "in" is 128 point short data for
example and
the output "out" is 128 short complex value which is stored in 256
short array with real and
image part. Looks like the function did some
2004 Sep 10
2
Blocking and compression.
On Tue, 2004-01-20 at 23:44, Josh Coalson wrote:
> Miroslav did some experiments with searching for optimum blocksize.
> from what I remember it made at best a couple percent difference.
> there was a thread about it here a while back.
>
Did his changes make it in? I can think of a coupla ways to approach
this and I'd like to hear about what he tried.
A couple of % doesnt seem
2006 Oct 16
5
Re : Generate a random bistochastic matrix
Thanks, I tried someting like this, but computation takes times for large matrices
btransf <- function(y,X=length(y)^4) {
N <- length(y)
bm <- matrix(rep(1/N,N^2),N,N)
for(j in 1:X){
coord <- sample(1:N,4,replace=T)
d <- runif(1,0,min(bm[coord[1],coord[2]],bm[coord[3],coord[4]]))
2011 Mar 03
0
[PATCH] Eliminate the ec_int32 and ec_uint32 typedefs.
These were used because the entropy coder originally came from
outside libcelt, and thus did not have a common type system.
It's now undergone enough modification that it's not ever likely to
be used as-is in another codec without some porting effort, so
there's no real reason to maintain the typedefs separately.
Hopefully we'll replace these all again somedate with a common set