similar to: Bhattacharyya distance metric

I have been lurking in this list a while and searching in the archives to find out how one learns to write fast R code. One solution seems to be to write part of the code not in R but in C. However after finding a benchmark article (http://www.sciviews.org/other/benchmark.htm) I have been more interested in making the R code itself more efficient. I would like to find more info about this. I have

The division part of the following code is not executing - (seq(n-1)*mean(XS)-cumsum(XS[seq(n-1)]))*diff(XS)/((n-1)*var(XS)) Note: Prof Yatracos: Would you please send them one example ? Thanks, Kaushik -----Original Message----- From: ripley@stats.ox.ac.uk [mailto:ripley@stats.ox.ac.uk] Sent: Friday, August 30, 2002 4:27 PM To: Kaushik Bhattacharyya Cc: r-devel@stat.math.ethz.ch;

Hello; I wrote this simple loop pass to collect the number of instructions in each loop of the program. The code is as follows- #define DEBUG_TYPE "loopinst" #include "llvm/Pass.h" #include "llvm/Analysis/LoopPass.h" #include "llvm/Support/raw_ostream.h" #include "llvm/ADT/Statistic.h" #include "llvm/Instructions.h" #include

Hi; I was playing with the -lda pass of LLVM on the following program- #include <stdio.h> void main() { int a[10]; int i; for(i = 0; i < 4; i ++) { a[i] = a[i-1]+1; } } I run the following commands - clang a.c -emit-llvm -S opt -analyze -stats -lda a.s The output is - Printing analysis 'Loop Dependence Analysis': Loop at depth 1, header block: %for.cond Load/store

Hello; I was planning to add a new instruction to the LLVM IR (and later to MIPS backend) for TLS(Thread level speculation) support. For this I tried to follow the steps described in http://llvm.org/docs/ExtendingLLVM dot html#instruction. But I could not find any llvm/lib/AsmParser/Lexer.l and llvm/lib/AsmParser/llvmAsmParser.y file in both the svn repository and the source code downloaded

Hello; I am working on porting a tool written for LLVM3.5 to LLVM10. There used to be a call instruction with the signature static CallInst * Create (Value *F, Value *Actual, const Twine &NameStr="", Instruction *InsertBefore=0) Can anyone please explain what it supposed to do? What was F and Actual? Thank you so much. -- Dr. Arnamoy Bhattacharyya R&D Compiler Engineer

Hi all, I'd like to add the Bhattacharyya method to the dist function. What is the best way to do this? I'm using R 1.9.0 and I was looking for the code that defines the already existing distances, but I didn't manage. As far as I understand, dist is defined in mva that is part of the stats package now, but where is the code? Thank you very much, Giampiero

Hello all; So here is my goal: *** If there is a Call instruction to myFunction(int * val), I need to identify all the instructions that uses val in the IR and replace the uses with a newly created pointer. I will also be changing the argument of myFunction to the new pointer. int * val = malloc/calloc; ... myFunction(val); .... *val = 45; becomes== int * val = malloc/calloc; int * val1 =

Hi, > Problem solved. I was building llvm in a separate llvm-build directory. I > built it within the llvm-src directory (which kept all the llvm .so and my > pass' .so in the llvm-src/Release+Asserts/lib directory) to solve the > problem. I do not fully understand what you mean, there should be no difference on building out of source AFAIK. > Can anyone tell me what's

Thanks for the reply. For the source code: int main() { int a = 0; int *p; p = &a; call_arnamoy(p); int *p1; p1 = p; return 1; } The bit code: %retval = alloca i32, align 4 %a = alloca i32, align 4 %p = alloca i32*, align 8 %p1 = alloca i32*, align 8 store i32 0, i32* %retval store i32 0, i32* %a, align 4 store i32* %a, i32** %p, align 8 %0 = load i32** %p, align 8 %call = call i32

Problem solved. I was building llvm in a separate llvm-build directory. I built it within the llvm-src directory (which kept all the llvm .so and my pass' .so in the llvm-src/Release+Asserts/lib directory) to solve the problem. Can anyone tell me what's the difference between writing a pass as a "struct" (as in the tutorial) and as a "class" (as most developers do)?

Hello; I wanted to insert two new terminator instructions in LLVM IR. I modified the necessary files (as mentioned in the tutorial in LLVM site and some more to meet the new structure of LLVM, (e.g no Lexer.l now, we have LLLexer.cpp. Again in the tutorial, files like LLVMBitCodes.h, include/llvm-c/core.h that need to be modified are not mentioned) But I am getting the error while building

i know it''s probably really simple, how do i work out someone''s age if i have their d.o.b. stored as a date in my db. cheers -- Posted via http://www.ruby-forum.com/.

Hi; I was wondering how can I get the name of the bitcode file on which I am running the pass. I am making my pass as a loadable module. And if I run my pass like this - opt -S -loops -load /home/arnie/llvm-clang/llvm/Release+Asserts/lib/XYZ.so -xyz <b.bc> b1.bc I want to get b.bc in the pass. Thank you; -- Arnamoy Bhattacharyya Athabasca Hall 143 Department of Computing Science -

> From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Arnamoy Bhattacharyya > Subject: [LLVMdev] Is Loop Dependence Analysis Printing Correct Stats? > for(i = 0; i < 4; i ++) > { > a[i] = a[i-1]+1; > } > Am I doing anything wrong or the code seems buggy? Your code is buggy. The first time through the loop, you're referencing

I am trying to compile R-1.5.1 source code in my two Alpha servers. But after doing ./configure when I am running ./make it is giving me the following error messages in both of the alpha servers. But no problem in compiling the same source code in my solaris m/c. I am using the "root" account for compilation . OS: Tru64 ver 4.0F " Make: Cannot open

I think I understood the problem you're trying to solve. I didn't, however, understand the problems you are having (maybe you're not running mem2reg?). I do have a little piece of code that I think does (more or less) what you want. Take a look at it, try understanding it, and see if it helps you out. You might have to change it a bit since you're replacing uses after an

Hi all; I have been trying to use the llvm::ConstantArray::get(llvm::LLVMContext&, llvm::StringRef, bool) function but seems it has been deprecated. ProfileDependence.cpp:68:73: error: no matching function for call to ‘llvm::ConstantArray::get(llvm::LLVMContext&, llvm::StringRef, bool)’ ProfileDependence.cpp:68:73: note: candidate is:

Hi all; Problem: Running a bitcode file produced by llvm-gcc (gcc 4.6.3 + dragonegg 3.1 + llvm 3.1) with lli (Ubuntu 12.04) *llvm-gcc:* llvm-gcc -c hello.c -emit-llvm -o hello.bc lli hello.bc output: lli: hello.bc:1:1: error: expected top-level entity ELF@4( *clang:* clang -c hello.c -emit-llvm -o hello.bc lli hello.bc output: hello world hello.c: #include <stdio.h> int main() {

I am looking for packages that can run a branch-and-bound algorithm to maximize a distance measure (such as Bhattacharyya or Mahalanobis) on a set of features. I would like this to be learning algorithm independent, so that the method just looks at the features, and selects the subset of a user-defined size that maximizes a distance criteria such as those stated above. Can anyone give some