Displaying 20 results from an estimated 1000 matches similar to: "Obtaining the adjusted r-square given the regression coefficients"
2006 Jan 11
0
Obtaining the adjusted r-square given the regression coef ficients
Hello Alexandra,
R2 is only defined for regressions with intercept. See a decent econometrics
textbook for its derivation.
HTH,
Bernhard
-----Urspr??ngliche Nachricht-----
Von: Alexandra R. M. de Almeida [mailto:alexandrarma at yahoo.com.br]
Gesendet: Mittwoch, 11. Januar 2006 03:48
An: r-help at stat.math.ethz.ch
Betreff: [R] Obtaining the adjusted r-square given the regression
coefficients
2012 Jul 20
1
fitting Ornstein-Uhlenbeck process by MAXIMUM LIKELYHOOD
Dear friends
i am trying to fit an Ornstein-Uhlenbeck process by MAXIMUM LIKELYHOOD
method.
i found these formulas on
http://www.sitmo.com/article/calibrating-the-ornstein-uhlenbeck-model/
this is the mean-reverting process
http://r.789695.n4.nabble.com/file/n4637271/process.txt process.txt
and this is the script that i am using.......
ouFit.ML=function(spread) {
n=length(spread)
2002 Jun 06
2
R correlations.
Hi, anybody have any ideas on this ?
I have two sequences of proportions. Due to
conventions in my field, I need to produce a linear
correlation between the two. Each sequence of
proportions are based upon differing numbers of
observations (although within a sequence the number of
observations may not fluctuate too much) so it may be
necessary/advisable to variance stabilize. Is their a
best
2009 Feb 19
1
matrix computation???
Hello
Can anyone tell me what I am doing wrong below? My Y and y_hat are the same.
A<-scale(stackloss)
n1<- dim(A)[1];n2<-dim(A)[2]
X<-svd(A)
Y<- matrix(A[,"stack.loss"],nrow=n1)
Y
y_hat <-matrix((X$u%*% t(X$u))%*%Y,nrow=n1,byrow=T)
y_hat
[[alternative HTML version deleted]]
2023 Jan 26
1
Failing to install the rgl package
Hi,
I try to execute the seven lines of code below to plot a graph. But I
am failing as the messages below show. Where am I going wrong?
install.packages("rgl")
library(rgl)
y_hat = X%*%B_hat
open3d(windowRect = c(100,100,900,900),family = "serif")
color = rainbow(length(y_hat))[rank(y_hat)]
plot3d(educ,exper,wage,col = color,type = "s",size = 0.5,xlim =
2010 Jun 23
1
Estimate of variance and prediction for multiple linear regression
Hi, everyone,
Night. I have three questions about multiple linear regression in R.
Q1:
y=rnorm(10,mean=5)
x1=rnorm(10,mean=2)
x2=rnorm(10)
lin=lm(y~x1+x2)
summary(lin)
## In the summary, 'Residual standard error: 1.017 on 7 degrees of freedom',
1.017 is the estimate of the constance variance?
Q2:
beta0=lin$coefficients[1]
beta1=lin$coefficients[2]
beta2=lin$coefficients[3]
2007 Oct 17
1
y_hat
Hello,
suppose one has the following values
x1 <- rnorm(10,5,1)
x2 <- rgamma(10,5,1)
y <- rnorm(10,4,1)
mydat <- data.frame(y,x1,x2)
then one can use glm like
mod <- glm(y~x1+x2, data=mydat, family=gaussian)
But how could I estimate y_hat?
Thanks alot!
Sam
---------------------------------
[[alternative HTML version deleted]]
2013 Apr 10
2
[LLVMdev] How to call the llvm.prefetch intrinsic ?
Hello,
Can anyone please guide me how can I replace a load instruction with a prefetch. I was looking at the intrinsic creation methods of the IRBuilder, but I can only find functions corresponding to memset, memcpy and memmove intrinsics, not for prefetching.
Also, I target x86-64 architectures. Is it sufficient to insert a call to the intrinsic in the LLVM IR to have the corresponding prefetch
2011 Jul 27
3
[LLVMdev] scalar evolution to determine access functions in arays
Hello,
How can I compute the functions on the loop iterators used as array indices?
For example:
for i = 0, N
for j = 0, M
A[2*i + j - 10] = ...
Can I obtain that this instruction A[2*i + j - 10]= .. always accesses memory using a function f(i,j) = 2*i + j - 10 + base_address_of_A
If I run the scalar evolution pass on this code I obtain:
%arrayidx =
2012 Nov 22
2
[LLVMdev] Set the minimum number of allocated bits for a variable
Hi,
I would like to force the minimum number of bits allocated for a variable in memory to be 16. From what I have seen, i1 is already represented on 8 bits. So, the only change would be to represent i1 and i8 on 16 bits, as all other types already fulfill this condition.
TargetData can help by setting a higher alignment, thus although the type is i1 or i8, the number of allocated bits is 16.
2013 Apr 10
0
[LLVMdev] How to call the llvm.prefetch intrinsic ?
Alexandra,
I'm not sure what you mean by "replace", but I have code that does this to insert prefetches:
Type *I8Ptr = Type::getInt8PtrTy((*I)->getContext(), PtrAddrSpace);
Value *PrefPtrValue = ...
IRBuilder<> Builder(MemI);
Module *M = (*I)->getParent()->getParent();
Type *I32 = Type::getInt32Ty((*I)->getContext());
Value
2008 May 23
3
IDE
People,
I'm a ubunto user and I used to write my scipts in "Java Gui for R", but it
is a very slow tool to run my scripts...
Do you know some efficient IDE for R?
Thankssss!!!
Alexandra Almeida
--
Alexandra R M de Almeida
[[alternative HTML version deleted]]
2011 Aug 25
2
How to store the output of a loop into a matrix??
Hello,
I want to create a matrix of N random numbers with a uniform distributions. Later, I want to repeat T times each row of this matrix. For this I do the following loop:
N<-45
T<-10
n<-N*T
a<-matrix(runif(N,min=-1,max=1),nr=N)
mymat<-matrix(rep(NA,n),nr=n,nc=1)
for(i in i:N){
b<-rep(a[i,],T)
mymat[i,]<-b
}
Mi problem is that with this loop I can see the output of the
2011 Jul 19
4
[LLVMdev] speculative parallelization in LLVM
Hi Tobi,
Thank you for your reply :).
I know that array accesses are handled as pointers in LLVM, but as I understood
Polly is focused on statically analysable code. As you mentioned: proving that
pointer accesses actually represent virtual array accesses.
In the case of a linked list for example, parsed with a pointer p = p->next, I
expect that Polly will not handle this code. So I
2001 Jun 27
4
Priotizing Bandwith but without Shaping the Bandwith
Hello, I''m Alexandra
Well, i have been working with cbq around 3 month ago without any
problems, what i do is control the bandwith to 64Kbit for input and
output and it works well.
But now I don''t want control the Bandwith, i only need prioritize udp
trafic over tcp trafic
Can somebody to help me with my requirement?
Thanks
Alexandra
2011 Jul 19
3
[LLVMdev] speculative parallelization in LLVM
Hi Renato,
No, I cannot, but in case it is, I want to take advantage of this. In case it is
not, the instrumentation code will detect this at runtime and simply roll back
to the original version. I will always keep an original version available, in
addition to the ones I modify with Polly. However, initially I will speculate
that it is allocated contiguously.
Thanks,
Alexandra
2011 Jul 20
3
[LLVMdev] print the memory address computed by getelementptr
Hi,
I want to print the memory locations computed by getelementptr. As I understood,
getelementptr does not access the memory, but it contains the address it
computes. I want to print these addresses at runtime (or process them). So, I
try to build a function that takes as argument a pointer and prints its value.
And to call this function, by sending the gep instruction as a parameter.
2012 Nov 22
0
[LLVMdev] Set the minimum number of allocated bits for a variable
Hi Alexandra,
I'm not sure want you want to do. Is the data layout string (http://llvm.org/docs/LangRef.html#datalayout, also usually set by each target specific *TargetMachine constructor), for setting the alignment good enough for you?
Or is it more than the alignment you want to control? Do you have a target with 16-bit bytes? In that case, there is quite a lot of changes that needs to be
2011 Sep 08
4
[LLVMdev] multi-threading in llvm
Hi,
I want to execute the iterations of a loop in parallel, by inserting calls either to pthreads or to the gomp library at the LLVM IR level. As a first step, I inserted an omp pragma in a C file and compiled it with llvm-gcc to check the generated LLVM code. If I understand correctly, to parallelize the loop in LLVM IR, I have to separate the loop in a new function, put all required parameters
2011 Jul 19
0
[LLVMdev] speculative parallelization in LLVM
On 19 July 2011 10:12, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote:
> %curr_array = alloca [10 x %struct.linked], align 8
>
> while..
> %tmp16 = getelementptr inbounds [10 x %struct.linked]* %curr_array, i32 0,
> i32 1
Hi Alexandra,
Can you guarantee that the linked list will be allocated in contiguous memory?
cheers,
--renato