search for: renorm

...tegrate 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: nctspa(a=1:10, n=5, mu=2, theta=3, renorm=1) Many thanks in advance for your help! please, send reply also to sergeyg at gmail.com /Sergey Here is the function: #Computes the s.p.a. to the doubly noncentral t at value x. #degrees of freedom n, noncentrality parameters mu...

...tegrate 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: nctspa(a=1:10, n=5, mu=2, theta=3, renorm=1) Many thanks in advance for your help! /Sergey Here is the function: #Computes the s.p.a. to the doubly noncentral t at value x. #degrees of freedom n, noncentrality parameters mu and theta. #====================================...

...i+1]; work[i]=sqrt(acc); acc-=prev*prev; prev=this; } work[n-1]=sqrt(acc); } If this is intended to be a simple smoothing operation, I would expect that work[0] and work[n-1] must be divided by sqrt(2) and all other entries in work must be divided by sqrt(3) in order to renormalize work[]. Is there something I overlooked? Cheers, Martin --- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage: http://www.xiph.org/ogg/

...in > > your AEC module? > > Sure, use the right ordering (and be careful with scaling!) and it'll work. In the FIX_POINT version of the spx_fft function, where is the actual code that do the forward FFT normaliaztion by 1/N? I saw the code first maxmize the input before the FFT and renormalize it back afterwards. Isn't this making the signal bigger and easy to overflow? If I am not mistaking, the input to the kiss_fft is the 2's complement value. I use the Xilinx Logicore FFT IP which also supports the 16bit fixed point FFT and it has some internal scaling for each stage. D...

...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 -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-...

...t 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 plenty > good results out of inline functions and intrinsics or something > (as it so happens, my compiler is not so smart here, so I made > these features builtin, and fell back to functions for mo...

...d 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% original. My tests are the following. source file WAV. 1 hour 440HTZ tone. 600MB. volume at 100. FLAC file size is 184MB. volume at 75. FLAC file size is 166MB. volume at 50. FLAC file size is 143MB. volume at 25. FLAC file size i...

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

...gt; you > could then go back to and compare ordered rice or range to I thought > would be ideal. I think it's patented by IBM. range coding gets very close to arithmetic and is much faster. maybe range coding was done earlier and later turned out to be a variation of arith coding, with renormalization is done in larger chunks. Josh __________________________________ Do you Yahoo!? Yahoo! Hotjobs: Enter the "Signing Bonus" Sweepstakes http://hotjobs.sweepstakes.yahoo.com/signingbonus

...tion 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 <- locfit(~imposter, kern="gauss", renorm=T, xlim=c(1e-20,100), ev=vec) This works good but when I tried to get the density points I get an error, this happens also when I use the matrix (mat) for ev: > fhat <- fitted(fit) Error in fitted.locfit(fit) : NA/NaN/Inf in foreign function call (arg 10) I think arg 10 means "dp&...

...t; > nonsense (and, if possible, tell me where I'm wrong). > > If this is intended to be a simple smoothing operation, I would expect > that > > work[0] and work[n-1] must be divided by sqrt(2) and all other entries > in work > > must be divided by sqrt(3) in order to renormalize work[]. > > it computes 'sqrt(work[i-1]^2+work[i]^2+work[i+1]^2)' as intended. > [Roman Razilov] but not for first and last sample... for first sqrt(work[0]^2 + work[1]^2) and for last sqrt( work[n-2]^2 + work[n-1]^2 ), I don't know if...

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

...ased upon unconditional density objects defined over categorical variables that lie outside the support of the training data may no longer be true probabilities (i.e., as defined over the training data and the extended/augmented support -- their sum may exceed one) and may therefore require renormalization by the user * Fixed a numerical issue which could hinder npregbw()'s cross validation with higher-order kernels * Default nmulti in npplregbw() is now set correctly * Fixed a bug with the ridging routine in npscoefbw(), added ridging to npscoef * Fixed trivial i/o issue with...

...ased upon unconditional density objects defined over categorical variables that lie outside the support of the training data may no longer be true probabilities (i.e., as defined over the training data and the extended/augmented support -- their sum may exceed one) and may therefore require renormalization by the user * Fixed a numerical issue which could hinder npregbw()'s cross validation with higher-order kernels * Default nmulti in npplregbw() is now set correctly * Fixed a bug with the ridging routine in npscoefbw(), added ridging to npscoef * Fixed trivial i/o issue with...

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

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

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

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

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]]))

..._enc_bits(ec_enc *_this,celt_uint32 _fl,unsigned _bits){ ec_window window; int used; window=_this->end_window; @@ -231,14 +231,14 @@ void ec_enc_patch_initial_bits(ec_enc *_this,unsigned _val,unsigned _nbits){ } else if(_this->rng<=EC_CODE_TOP>>shift){ /*The renormalization loop has never been run.*/ - _this->val=_this->val&~((ec_uint32)mask<<EC_CODE_SHIFT)| - (ec_uint32)_val<<EC_CODE_SHIFT+shift; + _this->val=_this->val&~((celt_uint32)mask<<EC_CODE_SHIFT)| + (celt_uint32)_val<<EC_CODE_SHIFT+shift;...