search for: theoretically

http://r.789695.n4.nabble.com/file/n3567636/ecdfs.jpg ecdfs.jpg http://r.789695.n4.nabble.com/file/n3567636/ecdf_curve.gif ecdf_curve.gif Hello, I have generated a plot of two empirical CDFs (attachment 1). As a result, they are stepwise when plotted. The following code was used: > plot(ecdf(mut), do.points=FALSE, verticals=TRUE, xlim=range(mut, non), > col="red") >

Hello, I have a doubt about the plotting position of the theoretical quantile for the qqnorm command in R. Let F be the theoretical distribution of Y, we observed a sample of size n, y1,y2, ..., yn. We then sort it and comspare these empirical quantiles to the expected ones from F. For the plotting poition, there are several options: 1. i/(n+1) 2. (i-.375)/(n+.25) 3. (i- .3175)/ (n + .365) etc.

Respected R Users, I looking for help with generating theoretical confidence regions for any of non-symmetric bivariate statistical distributions (bivariate Chi-squared distribution<Wishart distribution>, bivariate F-distribution, or any of the others). I want to to used it as a benchmark to compare a few strategies constructing confidence regions for non-symmetric bivariate data. There is

Dear List Members, I need a bit help about fitting some theoretical distributions (such as geometric, exponential, lognormal or weibull distribution) to the following *dry spell*, *wet spell*, *cycles (Wet-Dry or Dry-Wet)* from my meteorological (daily rainfall) data http://www.angelfire.com/ab5/get5/R.rainfall.txt only for rainy seasen (july - september) of 14 years only:

...code. >> Yup. If you use the sys::Path class to do the "unlink" >> (removeFromDisk) then the platform differences should be accounted >> for. Please don't put the direct unlink call into ArchiveWriter.cpp. > > So this comment means that I should attempt to theoretically support > Windows, and close the current archive file before updating it? If you use sys::Path, it is not "theoretically" supported, it is supported. To remove a file, use sys::Path::removeFromDisk, not unlink(2). > I'll remove the stringstream, but this means that I need t...

On Nov 23, 2005, at 18:17, Reid Spencer wrote: >> So this comment means that I should attempt to theoretically support >> Windows, and close the current archive file before updating it? > If you use sys::Path, it is not "theoretically" supported, it is > supported. Well, except of course that it isn't currently possible to build LLVM on Windows. Hence this is a somewhat theoret...

> x <- runif(100) > y <- runif(100) > ks.test(x,y) Two-sample Kolmogorov-Smirnov test data: x and y D = 0.11, p-value = 0.5806 alternative hypothesis: two-sided ok I expected that, but: > ks.test(runif(100), "runif") One-sample Kolmogorov-Smirnov test data: runif(100) D = 0.9106, p-value < 2.2e-16 alternative hypothesis: two-sided How

This is mostly theoretical, but ... I''m starting to use lighthouse (http://llighthouseapp.com) for my projects at work. I''m organizing iterations as milestones and stories as tickets tagged to a milestone. Lighthouse offers an API so that you can write access the data in your account and write apps to process that data. I think you see where this is going. It seems to me that

Hi all, How does this look as a potential FFI for our theoretical Ruby++ ? I''m not sure how to do mixins, though. Some sort of special directive? Or just add it to inheritance chain? Anyway, this is just a rough prototype. No attempt at an actual implementation yet. Regards, Dan // foo.h - Function prototypes #define _FOO_H_ using namespace ruby; // Subclass Object class Foo :

vhost_zerocopy_callback accesses VQ right after it drops a ubuf reference. In theory, this could race with device removal which waits on the ubuf kref, and crash on use after free. Do all accesses within rcu read side critical section, and synchronize on release. Since callbacks are always invoked from bh, synchronize_rcu_bh seems enough and will help release complete a bit faster.

vhost_zerocopy_callback accesses VQ right after it drops a ubuf reference. In theory, this could race with device removal which waits on the ubuf kref, and crash on use after free. Do all accesses within rcu read side critical section, and synchronize on release. Since callbacks are always invoked from bh, synchronize_rcu_bh seems enough and will help release complete a bit faster.

Hi, Don't have a clue what teh following error message generated by this function call: qqmath( ~val|ind,data = xx ,distribution = function(p){ qt(p,df=20)} ,ylab="Sample Quatinles" ,xlab="Theoretical Quantiles" ,panel=function(x,y) { panel.qqmathline(y , distribution=function(p) qt(p,df=20)

Hello all, I've been trying to figure out some "questions" related to LLVM IR (not specifically LLVM's, but LLVM's IR does appear to be the best on this planet!) since some time. It'd be great if some one could give some pointers. Given a specific target, and a set of rules that define what is optimal code for that target, can it be proven that the LLVM IR provides the

Dear R experts: Can you help me to overlap a histogram and theoretical density curve of poison distribution? for example data like this: The numbers of sanils found in each of 100 sampling quadrats in an area were as follows: number of snails, r 0 1 2 3 4 5 8 15 f=frequency of r 69 18 7 2 1 1 1 1 apparently this is not Poison but near to Poison, How to overlap the theoretical desity curve to

Dear all I have a question about quantiles standard error, partly practical partly theoretical. I know that x<-rlnorm(100000, log(200), log(2)) quantile(x, c(.10,.5,.99)) computes quantiles but I would like to know if there is any function to find standard error (or any dispersion measure) of these estimated values. And here is a theoretical one. I feel that when I compute median from given

...ust face on a daily basis. If you change everything to signed integers, you may catch a real problem with it a couple of times a year. And by "real problem" here, I'm talking about a miscompile or an actual bug that surfaces in production somewhere, rather than a "yes, it seems theoretically possible for this to overflow". Doesn't it make it already worth it? > On the other hand, a large number of people need to work in this codebase every day, and multiplied over the same time period, my belief is that having the code make sense and be simple has a higher net value. &gt...

Dear all I am a PhD student of Computer Scince at Simon Fraser University ( http://www.cs.sfu.ca) interested in applying to GSoC. My PhD is focused on theoretical computer science, but since Sep. 2008 I have started working on Software projects again. Currently I am working in COSTAR lab on a high performance regular expression engine based on Parallel bit streams technology. A considerable part

...act that AddModifiedNodeToCSEMaps can recursively call > ReplaceAllUsesOf means that we can potentially delete the node > out from under UI. Ok, I think I've finally managed to draw on my whiteboard a theoretical situation which could have a problem like this. The attached patch should theoretically fix this bug, though I have no way to confirm this right now. Does it fix the bug you're seeing? Dan -------------- next part -------------- A non-text attachment was scrubbed... Name: rauw.patch Type: application/octet-stream Size: 3853 bytes Desc: not available URL: <http://lists.llvm.or...

I had an academic question for the list. What is the theoretical limit of the number of simultaneous sources in Icecast? What limits the number of sources that can run? Is it purely a function of the resources on the server or is there any inherit limitations? And given enough resources would extreme number of sources like 10,000 - 100,000 be expected to be supported? Cheers

Hi, What I'm trying to achieve is very fast algorithm for fitting logistic regression model. I have to estimate regression coeficients using about 10k observations. Once I have coefficients estimated, new 100 rows of data becomes available.... Now I need to reestimate coeficients using 100 newly arrived observations and removing 100 oldest observations. So, my question is would it be