similar to: qt(p,df) discontinuous in p for df in 1.01->1.7 (PR#2991)

Hello, The function qt returns NaN for degrees of freedom <1. For example: > qt(0.5,0.5) [1] NaN Warning message: In qt(p, df, lower.tail, log.p) : NaNs produced But qt(0.5,0.5) should be 0, since the distribution is symmetric. > pt(0,0.5) [1] 0.5 It actually fails with any value, as long as df<1. Is this a bug, or is there some fundamental reason why this cannot be computed?

Sorry about the html-formatted message. Here it is again in plain text. Hello, The function qt returns NaN for degrees of freedom <1. For example: > qt(0.5,0.5) [1] NaN Warning message: In qt(p, df, lower.tail, log.p) : NaNs produced But qt(0.5,0.5) should be 0, since the distribution is symmetric. > pt(0,0.5) [1] 0.5 It actually fails with any value, as long as df<1. Is this a

I was experimenting yesterday with a binomial make.link option for estimating student t binary response models, tentatively called gossit, and I noticed eventually that the R qt function doesn't like df < 1. Vaguely recalling that Splus didn't seem to mind such weirdness, I checked on our soon to be defunct Splus6.2 and sure enough, it produced plausible answers instead of R's

I am putting together an ogg mux/demux application which uses two logical streams. One is a vorbis stream, the other is some application specific data. This came together really quickly, following the ogg/vorbis documentation it took only a few hours to get it up and running. Just a small question... My application stream is currently running as a continuous stream but really I want it to be

Hello, I recently added discontinuous stream support to libogg1. The patch is attached. I also wrote Writ codec for libogg1 (based on original code by Arc), and sample Writ encoder (SubRip to Writ converter) and decoder. Is anybody interested? WBR, Roman. -------------- next part -------------- Index: include/ogg/ogg.h =================================================================== ---

I'm writing a voice communication application, and I've got a few issues that I'd like to get ironed out, but I don't know enough about the speex implementation. First of all, this application is mainly used for conferencing - many people are in a room and only 1-2 are ever talking at a time. So, always encoding and transmitting everyone's audio stream would be rather

On 06/02/2008, ogg.k.ogg.k@googlemail.com <ogg.k.ogg.k@googlemail.com> wrote: > Hi, > > I have a question about seeking. In fact, it's more or less a kind > of rambling and thinking aloud, circling around a question. Hi, No particular answers, but I can at least point out that the way things were designed for CMML was to work with the existing Ogg seeking algorithm. The

On Feb 11, 2008 9:46 PM, ogg.k.ogg.k@googlemail.com < ogg.k.ogg.k@googlemail.com> wrote: > Following on your point about a lower bound on the frequency, maybe one > could add "keepalive" packets when no data packets have been issued for > a long enough time, and such packets would carry no data but the backlink > itself. Hmm, I like the idea. The packets would be very

On 12-Feb-08, at 2:02 AM, ogg.k.ogg.k@googlemail.com wrote: >> It is more complex, because the granulepos is available at the page >> level. > > Ah. Good point, I always forget about the partial page problem :( > I conveniently flush pages after each data packet in my case (due to > unknown/arbitrary latency), so I tend to forget easily about those. Ah, right. So it might

On 13/02/2008, Ralph Giles <giles@xiph.org> wrote: > > The hypothetical seeking algorithm. We should be writing it down, I > suppose This is about the closest we have to a source document on that: http://web.archive.org/web/20031201054855/http://www.xiph.org/archives/theora-dev/200209/0040.html K.

On 12-Feb-08, at 2:54 PM, Silvia Pfeiffer wrote: > I've added Monty's email to the wiki at http://wiki.xiph.org/ > index.php/GranulePosAndSeeking , but I was unable to edit the wiki > entry page and add a "Granulepos and Seeking" link under the > "developer resources" section. Maybe somebody with more rights on > the wiki could add this. I'm

Some more thinking about this whole granulepos splitting. Sorry for the badgering :) The CMML way was presented as a similar way as the Theora way, which I didn't see (I actually use such a system to allow multiple events to start at the same time, and this feels like the Theora way). Theora can find any frame's previous keyframe granulepos by clearing the low bits of the frame's

> Leaving aside what the hypothetical seek algorithm would or wouldn't > do, I believe that would work. It's still different from existing > schemes though. Yes, it is different technically. However, I was trying to find something sufficiently close to the system of granuleshift, which you seem to want to become the "standard" way of mapping time to granules, despite

Hi all, I have two vectors of data: The first vector contains timestamps (as integers), however the difference between these dates varies. For instance, the vector can be c(0, 5 , 10, 20, 25, 30) so that there is a "jump" between the third and the fourth element. The second vector contains the associated values that I want to plot against these timestamps. My problem is that I

Hi, I wanted to make a graph with the following table (2 rows, 3 columns): a b c x 1 3 5 y 5 8 6 The first column represents the start cordinate, and the second column contains the end cordinate for the x-axis. The third column contains the y-axis co-ordinate. For example, the first row in the matrix above represents the points (1,5),(2,5), (3,5). How would I go about making a discontinuous graph

Hello All, I have a discontinuous dataset and I used spplot to plot the points. I was wondering whether it is possible to show the legend of the plot as color ramp. I saw that on continuous data. If anyone could tell me that would be great. Another thing I would like to know is how can we create the horizontal legend. By default, the legend is vertical. I was able to shift the legend inside

On 11-Feb-08, at 2:46 AM, ogg.k.ogg.k@googlemail.com wrote: > For reference, my data packets start with start granule, end > granule, backlink > granule, all 64 bits, so picking the granule is just a simple > constant offset > lookup into the data packet, eg, you replace: > > backlink = granulepos<<32; > > by > > backlink =

On 2/7/08, ogg.k.ogg.k@googlemail.com <ogg.k.ogg.k@googlemail.com> wrote: > And this is the crux of the problem, as far as I understand how it works: > you'll have to do a first bisection to find the page that maps to that > granulepos, > then, and only then, you get to know the low bits of the actual granulepos, > and then you have to do another bisection to find it.

Hi, I have a simple question that I just cannot figure out. I have 2 corresponding columns of data, one column (X-axis) for time (formatted thus: 8:30:01am = 830.1, 12:30:05pm = 1230.5, and one column (Y-axis) for values. When I attempt to plot the data using something like plot(inputdata[,1],inputdata[,2],type="l"); I get breaks in the plot (since the time essentially jumps from

After some more thought on this, I'm trying to work out whether the back link offset needs precision. Semantically, the only need we have for this is to be able to seek back to a point before the start of the earliest event still active at the time of the original seek. As far as I know, and please correct me if I'm wrong, nothing in Ogg mandates that this backlink actually resolves to a