similar to: Exponential Fitting to Credit default data - A theoretical query

Target: FreeBSD 6.2-STABLE on i386 autoconf says: configure:2122: checking build system type configure:2140: result: i386-unknown-freebsd6.2 [...] configure:2721: gcc -v >&5 Using built-in specs. Configured with: FreeBSD/i386 system compiler Thread model: posix gcc version 3.4.6 [FreeBSD] 20060305 [...] objdir != srcdir, for both llvm and gcc. Release build. llvm-gcc 4.2 from source.

On Fri, Sep 14, 2007 at 11:42:18PM -0700, Tanya Lattner wrote: > The 2.1 pre-release (version 1) is available for testing: > http://llvm.org/prereleases/2.1/version1/ > > [...] > > 2) Download llvm-2.1, llvm-test-2.1, and the llvm-gcc4.0 source. > Compile everything. Run "make check" and the full llvm-test suite > (make TEST=nightly report). > > Send

I have some code in Fortran-90 that outperforms my R implementation of the same algorithm (in terms of speed). I wonder whether it is possible to interface R with Fortran-90. that is would like to call a Fortran routine from my R script, passing to the Fortran routine some real numbers array, some scalar real numbers, and an integer number . I have no idea how to do that because Fortran is a

Hi,   I am working in different formula substitutions using R i have applied linear[lm(y~x)], Quadratic[lm(y~x+I(x^2))] and Cubic[lm(y~x+I(x^2)+I(x^3))] How to use/apply One Term Exponential, Two Term Exponential, Three Term Exponential formulas in R Stat. Regards, Guru [[alternative HTML version deleted]]

Hola a todos, Estoy coordinando un grupo para la traduccion de Samba en Espa?ol. Si quereis colaborar ya sabeis, escribidme. Firmado, Jos? Luis Rivas L?pez Administrador de la red -- Jos? Luis Rivas L?pez Area Ingenieria de los Procesos de Fabricaci?n Dpto. de Dise?o en Ingenieria E.T.S. Ingenieros Industriales. UNIVERSIDAD DE VIGO Campus Universitario s/n, 36200

Sometimes the following function call causes a database exception: > gene.seq <- getSequence (id=gene.map[,"ensembl_transcript_id"], type="ensembl_transcript_id", + seqType="3utr", mart=hmart) I understand the above function must be called by try to capture the eventual error. WHat is not clear to me is how to realize that an

Dear R-tisans, I am trying to calculate the 12th root of a transition (square) matrix, but can't seem to obtain an accurate result. I realize that this post is laced with intimations of quantitative finance, but the question is both R-related and broadly mathematical. That said, I'm happy to post this to R-SIG-Finance if I've erred in posting this to the general list. I've

Dear all, I'm using R 2.8.1 under Windows Vista on a dual core 2,4 GhZ with 4 GB of RAM. I'm trying to reproduce a result out of "Analysis of Financial Time Series" by Ruey Tsay. In R I'm using the fGarch library. After fitting a ar(3)-garch(1,1)-model > model<-garchFit(~arma(3,0)+garch(1,1), analyse) I'm saving the results via > result<-model

Target: FreeBSD 7.0-RC1 on amd64. autoconf says: configure:2122: checking build system type configure:2140: result: x86_64-unknown-freebsd7.0 [...] configure:2721: gcc -v >&5 Using built-in specs. Target: amd64-undermydesk-freebsd Configured with: FreeBSD/amd64 system compiler Thread model: posix gcc version 4.2.1 20070719 [FreeBSD] [...] objdir != srcdir, for both llvm and gcc. Release

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 the last 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 all synchronize on release. Since callbacks are always invoked from bh, synchronize_rcu_bh seems enough and will help release complete a bit faster.

Dear Experts, Can anybody please direct me to proper MDCT theory reference which will help me understand the code better? I'm trying to optimize MDCT for a embedded platform. So need good understanding about theory behind & implementation. Thanks in advance for your time. Warm Regards, Mahantesh -------------- next part -------------- An HTML attachment was scrubbed... URL:

http://en.wikipedia.org/wiki/Modified_discrete_cosine_transform is an OK place to start. On Mon, Jul 8, 2013 at 7:33 AM, Mahantesh Belakhindi <girishec28 at gmail.com>wrote: > Dear Experts, > > Can anybody please direct me to proper MDCT theory reference which will > help me understand the code better? > > I'm trying to optimize MDCT for a embedded platform. So need

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

On Tue, Jul 30, 2019 at 11:51:40AM +0100, Richard W.M. Jones wrote: > Previously discussed here: > https://www.redhat.com/archives/libguestfs/2019-July/msg00213.html > > It turns out that deferring callbacks is a PITA. (It would be a bit > easier if C has closures.) However by rewriting the example we can > avoid the need to use the cookie at all and make it run a bit more

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

I feel like a dope for asking this, but after reading various articles I'm still not quite sure I get it. What is the relationship or similarity between a "probability" prediction from a classfication random forest and a Bayesian posterior probability? Can they be considered similar, or would I need to take that probability and project it through a likelihood (I'm thinking,

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.

Hi Folks, This is not (well, not yet) an R question as such, though it is preparatory to embarking on an R-based study. Scenario: X has a lognormal distribution. Jointly distributed with X is a "tag" Y: Y = 0 or 1, with Prob(Y=1|X) = exp(L)/(1+exp(L)), L = a + b*X I am interested in the distribution of X conditional on Y, which is proportional to f(x,Y) =

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