search for: a_n

Hi all, I have n independent variables A_1, A_2, A_3,......,A_n, and each with known variances var(A_1), var(A_2),..., but unknown mean. How can I get the approximation of the variance of the product of the variables using numerical computation, i.e. var(A_1*A_2*A_3*.....*A_n)? Thanks. Sincerely, Yanwei Zhang Department of Actuarial Research and Modeling Munic...

Hello to all, I am having trouble with intregrating a complicated uni-dimensional function of the following form Phi(x-a_1)*Phi(x-a_2)*...*Phi(x-a_{n-1})*phi(x-a_n). Here n is about 5000, Phi is the cumulative distribution function of standard normal, phi is the density function of standard normal, and x ranges over (-infty,infty). My idea is to to use quadrature to handle this integral. But since Phi has not cloaed form, I don't know how to do this ef...

Hi, could anyone tell me how predict() predicts the new value(s), of a MA(1) arima-modell. its really easy to make it with an AR(1), knowing the last term, but how can i or R know the last error? It would also help if somebody could tell me how to find the "open" source of the function predict(). Thanks and sorry for my poor english. -- View this message in context:

Hi all, I have a problem using rdirichlet{gtools}. For Dir( a1, a2, ..., a_n), its mode can be found at $( a_i -1)/ ( \sum_{i}a_i - n)$; The means are $a_i / (\sum_{i} a_i ) $; I tried to study the above properties using rdirichlet from gtools. The code are: ############## library(gtools) alpha = c(1,3,9) #totoal=13 mean.expect = c(1/13, 3/13, 9/13) mode.expect = c(0...

Ein eingebundener Text mit undefiniertem Zeichensatz wurde abgetrennt. Name: nicht verf?gbar URL: <https://stat.ethz.ch/pipermail/r-help/attachments/20120130/080e7142/attachment.pl>

...ne expressions used as GEP indices. I assume, GEP indices (except indexing into struct) are interpreted as signed integers. It isn't explicitly stated in the LangRef, but the code seems to treat them this way. Am I correct? If the result of an affine expression: a_1*i_1 + a_2*i_2 + ... + a_n*i_n is interpreted as signed value during the program run, it should be safe to assume during the program analysis that all operations (coefficients) are signed - signed evaluation of such an expression will bring the same result as evaluation of the expression using original signedness and int...

Hi all, Best wishes for the new year! :'') I''m very new to Ruby and Rails, and I ran into a problem with the "paginate" function. When I use the following method to get a number of forum topics based on a category name passed via the URI: @topic_pages, @topics = paginate :topics, :joins => "INNER JOIN categories ON

When you say that distribution shouldn't be used, do you mean within instcombine rather than some other pass? Or not all as an IR optimization? A dedicated optimization pass that looks for and makes factoring/distribution folds to eliminate instructions seems like it would solve the problems that I'm seeing. Ie, I'm leaning towards the proposal here: https://reviews.llvm.org/D41574

>However, there is one issue I have ignored - possibility of overflow in >the index expression. Suppose, we have such a loop: > for (i8 i = 0; i != 200; ++i) { > A[2 * i + 5] = ... > ... = A[2 * i + 3] > } >If both index expressions are evaluated in 8-bit arithmetic, >then the dependence equation should be solved in modular arithmetic: > 2 * i + 5 == 2 * (i +

...ommunity, Confused by some of my lab results I ask for the definition of the null hypothesis of a two-way analysis of variance in R (anova() and aov()). Starting with the following model y = a_i + b_j , i in A and j in B is the tested null hypothesis H_0: a_i = 0 for all i in A or H_0: a_m = a_n for any m and n in A? Consequently the same questions for interaction effects. Starting with the model y = a_i + b_j + f_ij , i in A and j in B is the tested null hypothesis H_0: f_ij = 0 for all i in A and j in B or H_0: f_ij = f_mn for any i and m in A and j and n in B? More specific to...

Greetings. I try to set up cross subnet browsing but I've encountered some difficulties. Let me introduce my situation 10.1.2.0 10.1.1.0 A_N1 -+ +- A_N1 | | B_N1 -+--[R1]=======[R2]--+- B_N2 . | VPN accross | . . | the Internet | . Z_N1 -+ +- Z_N A_N1 is 10.1.2.4, PDC A_N2 is 10.1.1.1, BDC the vpn makes everything look as if there was only one router...

> On May 8, 2018, at 9:50 AM, Daniel Berlin via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > 1. The reassociate pass that exists right now was *originally* (AFAIK) written to enable CSE/GVN to do better. Agreed. The original mindset included a (naive) belief that going with a canonical form was better than teaching redundancy elimination to handle abstractions (as a matter

Mirando los comentarios, realmente lo que deseo es encontrar la raíz real de (-0.5)^(1/5) la cual debería ser -0.87055056329. José me hace caer en cuenta que además de no encontrar la raiz real, tampoco da todas las raiz complejas. Habría alguna manera de que tuviera en cuenta? > ------------------------------ > > Message: 6 > Date: Thu, 15 Oct 2015 11:25:39 +0200 > From: José

...il.com> Cc: r-help-bounces@r-project.org, r-help@stat.math.ethz..ch Message-ID:     <OF1B1EC7AC.48E181F7-ON802575C3.00493966-802575C3.00497E7B@justice.ie> Content-Type: text/plain; charset="ISO-8859-1" My thoughts exactly. ?FFT should do the job. And define the dominant term - a_n**2 + b_n**2 - the Parseval Relation.                                                                                       stephen sefick                                                            <ssefick@gmail.co                                                        m>               ...

Hello list. I'm trying to rebuild the 2.6.9.67.0.20.EL kernel, but it fails even without modifications. How did I try it? Created a (non-root) build environment (not a mock ) Installed the kernel.scr.rpm and did a rpmbuild -ba --target=`uname -m` kernel-2.6.spec 2> prep-err.log | tee prep-out.log The build failed at the end: Processing files: kernel-xenU-devel-2.6.9-67.0.20.EL Checking