similar to: Firewall ports with v 3.5.2 grumble time

Dear all. RE how to estimate parameters of multimodal distribution Thank to prof.Ripley for pointing me to mclust package, although I am not sure I can apply it to my problem. I have another question. I need to change some of my values in data frame to NA. I use something like df[df$v1 < 5, 5:10] <- NA which is OK if there are no NA values in v1. here are some foo attempts >

--- Hod McWuff <hod@wuff.dhs.org> wrote: > On Fri, 2002-10-04 at 10:26, Marco "elcabesa" Belli wrote: > > oversampling.. i maean digitally change the wave file rate form > 44khz to 440 > > khz > > > > it make next sample easyer predictable > > OK, IANASPE (signal processing engineer) but it seems to me that if a > simple shift like that can

On Sat, Oct 05, 2002 at 12:26:12PM -0400, Hod McWuff wrote: > On Sat, 2002-10-05 at 03:19, Miroslav Lichvar wrote: > > On Fri, Oct 04, 2002 at 01:57:03PM -0400, Hod McWuff wrote: > > > Agreed that the oversampling isn't useful in the long term. I'm not sure > > > what you mean by 'dictioniary overhead'. > > > > > > I'd like to see

Agreed that the oversampling isn't useful in the long term. I'm not sure what you mean by 'dictioniary overhead'. I'd like to see an easy-to-invoke set of parameters that will spare no cpu expense and produce the tightest theoretically possible output. I'm guessing the best of Marco's idea can be achieved by adding heuristics to dynamically determine optimal frame

OK, then how about a speculative approach? I'm going to go on these assumptions: * linear predictive coding * exhaustive search option * lpc coding is capable of producing zero residual * doing so is practical with a tiny block size Start with say, 64 samples (arbitrary), and compute a zero-residual LPC coding. Then use that coding to try and "predict" ahead into the

On Fri, Oct 04, 2002 at 01:57:03PM -0400, Hod McWuff wrote: > Agreed that the oversampling isn't useful in the long term. I'm not sure > what you mean by 'dictioniary overhead'. > > I'd like to see an easy-to-invoke set of parameters that will spare no > cpu expense and produce the tightest theoretically possible output. > > I'm guessing the best of

On 11/13/2013 04:19 PM, Eric Dumazet wrote: > On Wed, 2013-11-13 at 10:47 +0200, Ronen Hod wrote: > >> I looked at how ewma works, and although it is computationally efficient, >> and it does what it is supposed to do, initially (at the first samples) it is strongly >> biased towards the value that was added at the first ewma_add. >> I suggest that you print the

On 11/13/2013 04:19 PM, Eric Dumazet wrote: > On Wed, 2013-11-13 at 10:47 +0200, Ronen Hod wrote: > >> I looked at how ewma works, and although it is computationally efficient, >> and it does what it is supposed to do, initially (at the first samples) it is strongly >> biased towards the value that was added at the first ewma_add. >> I suggest that you print the

Dear List the other day, I had my yearly staff interview with my Head of Department. Under my list of publications, I included a document which I wrote (R-and-octave.txt) that ended up in the "contributed docs" section of CRAN. Unfortunately, neither my HoD nor the personnel person were terribly impressed with it, even though its preparation time was commensurate with many of my (co

On Sun, Oct 06, 2002 at 04:41:02PM -0400, Hod McWuff wrote: > > OK, then how about a speculative approach? > > I'm going to go on these assumptions: > * linear predictive coding > * exhaustive search option > * lpc coding is capable of producing zero residual > * doing so is practical with a tiny block size > > Start with say, 64 samples (arbitrary),

On Wed, 2013-11-13 at 10:47 +0200, Ronen Hod wrote: > I looked at how ewma works, and although it is computationally efficient, > and it does what it is supposed to do, initially (at the first samples) it is strongly > biased towards the value that was added at the first ewma_add. > I suggest that you print the values of ewma_add() and ewma_read(). If you are > happy with the

Hmm... when using variable bitrate with MP3, the bitrate clearly follows complexity. I've no idea how that algorithm works, but maybe it can be adapted. When it decides to change the bitrate, that's where you want a frame break. On Sat, 2002-10-05 at 03:19, Miroslav Lichvar wrote: > On Fri, Oct 04, 2002 at 01:57:03PM -0400, Hod McWuff wrote: > > Agreed that the oversampling

Hi - I have samba 2.0.6 running on solaris 2.5.1 I am trying to access it from an NT box with the username 'test.clearcase' My home section of smb.conf is defined as follows: [homes] read only = no comment = Unix home directories create mode = 0750 path = %H/pchome browseable = no writeable = yes If I do finger test.clearcase I get the answer: finger test.clearcase

Sounds like a good start. However, think what it would mean if we could get rid of any residual. In the best case scenario, the output would be a series of function coefficients describing a wave, and a length parameter. In the case of music, you can reasonably expect an unforseeable attack and a consistent decay for each sound component. That means if you can totally describe the first wave to

Well, Robert, at least you're to a consistent state from which maybe the more capable people on this list may be able to help you. I'm ccing the list, as I don't see anything I can help with. You might try it again with -vvv on the client side, to generate more detail. As it looks like it's dying in connection setup, the output shouldn't be cluttered with a mass of

Hi All, I have an extremely frustrating problem and I kind of think this is an error in rails, but you never know. I have a hash of objects that I am iterating through in order to display the needed info. As I am doing that and displaying half a dozen values, one value is being interrupted by rails as a hash and giving me this error: --- !map:HashWithIndifferentAccess comm: "1"

I've got two DL385s and a DL320, and they all rock. iLO especially rocks, but to leverage the full functionality, you'll need to get the "Advanced License", which opens up full blown remote console capabilities (via Java). It's a separate piece of hardware that, as long as the server PSUs have power flowing into them, lets you do things like remotely power on/off/reset the

On 15 Jun 2004 at 13:52, Vito Muggeo wrote: > Dear Petr, > Probably I don't understand exactly what you are looking for. > > However your "plot(x,c(y,z))" suggests a broken-line model for the > response "c(y,x)" versus the variables x. Therefore you could estimate > a segmented model to obtain (different) slope (and breakpoint) > estimates. See

Below is a kernel dump that I just got. This is a fresh new install of centos 5.1 on NVIDIA gigabyte MB-GA-M61P-S3. nothing extra has been added. I have not tried the irqpoll but I am surprised to get this. Also the machine keeps running just hod this show on the console... Any ideas??? Jerry Jan 8 05:20:00 localhost kernel: irq 169: nobody cared (try booting with the "irqpoll"

Twice now with v4.15-rc6, my display has gone belly up. Note: swiotlb: suppress warning when __GFP_NOWARN is set v2 is applied, but I don't _think_ it was the first time it happened. [ 3729.558261] nouveau 0000:01:00.0: gr: TRAP ch 2 [00ff842000 Xorg[3413]] [ 3729.558269] nouveau 0000:01:00.0: gr: GPC0/TPC0/TEX: 80000041 [ 3729.558273] nouveau 0000:01:00.0: gr: GPC0/TPC1/TEX: 80000041 [