similar to: linux - win me

----- Forwarded message from ANIL C JOHN <anilcjohn at sify.com> ----- To: brg at dgate.org Subject: CS student from India Date: Mon, 11 Oct 2004 22:07:56 +0600 (IST) From: ANIL C JOHN <anilcjohn at sify.com> Dear Sir, I am a computer science undergrad student doing my 7th semester B.Tech in computer science (equivalent to BS). I want to do a project using LLVM compiler

Anil, There are lots of interesting projects waiting in the wings. You should check Chris', Misha's, and my "developer pages". You can access all of them from here: http://llvm.cs.uiuc.edu/Developers.html by just clicking on the name. If any of these projects interest you, please let us know. Otherwise you can also find us on the IRC channel (irc.oftc.net#llvm) so we can

Hi, we r using HTB algorithm,for traffic shaping, we are facing a problem. we are able to create multiple classes,filters. But when we delete 1 filter all filter gets deleted. how do we avoid that. waiting for you reply Regards Jayesh ------------------------------------------------- Shop & Save at Sifymall.com! Special Festive Offers - up to 60% off on DVD players, MP3 Players. Mobile

I have a multiple text files, separated by a single space, that I need to combine into a single data.frame. Below is the track I'm on using list.files to capture the names of the files and then lapply with read.table. But I run into problems making a usable dataframe out of the data. #Creating example data in similar format to data I have sub <- rep(1,10) trial <- seq(1,10,1) size

I have a table with some data structured something like this: book ---- title (varchar) pages (int) completed_on (date) While I can find the shortest book completed in each year with something like this: select min( pages ), year from book group by year I would also like to get the title of the shortest book in each year. Is there any way to do this by modifying the previous query to pull

Using Igraph, I create shortest paths, then convert the matrix into three column vectors - "vertex1", "vertex2", "shortestpath" - as the code below shows. #code for generating shortest path matrix and creating a 3 columns from an igraph graph object "y" y_s<-shortest.paths(y, weights = NULL) y_s <- melt(y_s)[melt(upper.tri(y_s))$value,] #Step 2: this

Hi, David. Spill intervals must be precolored because they can't be spilled once more. They are the shortest intervals precisely over each def/use of the original interval. That is why they also have their weights set to #INF. Imagine that on a second iteration allocation algorithm figures out that some spilled interval can't be assigned a physical register. Allocator can't spill it

hello, I have a graph and i use qgraph package to calculate centrality parameters. Now I want to know the maximum value of shortest path for each vertex with discarding the Inf value in short pathes. For this I use the ShortestPathLengths of centrality function in qgraph. but when I want to get the maximum the result is wrong. here is my code: cen<-centrality(Q)

Hi, I have a question about computing shortest Euclidean distances between two data frames of spatial points... I have 2 dataframes (not yet converted to spatial class) >Sewers<-data.frame(x=c(10,20,35,50),y=c(100,150,200,300)) >transect <- data.frame(x=seq(from=0, to=50, by=1),y=seq(from=100, to=150, by=1)) I would like to be able to compute the shortest distance from the

Dear R Users, I have a network of 25000 total nodes and a list of 500 node which is a subset of all nodes. Now I want to calculate the APSP (all pair shortest path) matrix only for these 500 nodes. I would appreciate any help. Thanks in advance Dinesh -- Dinesh Kumar Barupal Research Associate Metabolomics Fiehn Lab UCD Genome Center 451 East Health Science Drive GBSF Builidng University of

Hard to follow data analysis without data. Try making your example reproducible [1][2][3] and post in plain text (a setting in your emailer). Read the Posting Guide mentioned in the footer to avoid other posting pitfalls. [1] http://stackoverflow.com/questions/5963269/how-to-make-a-great-r-reproducible-example [2] http://adv-r.had.co.nz/Reproducibility.html [3]

On Monday 06 August 2007 12:15, Anton Vayvod wrote: > Spill intervals must be precolored because they can't be spilled once more. > They are the shortest intervals precisely over each def/use of the original > interval. That is why they also have their weights set to #INF. Yes, that's true. But I wonder if we shouldn't be smarter about which register we pick to color it.

This is not really a problem just something I noticed in my testing.. When two or more Asterisk servers are connected by IAX2 trunks it does not make use of any "shortest path" type system.. (maybe this is still planned somwhere down the line, but may come in handy to those who have multi asterisk installations) Here is the setup.. UA1--- Asterisk1----[IAX2 Trunk]---Asterisk2---UA2

Hi R-ers: I need to compute the distance between 2 street addresses in either km or miles. I do not care if the distance is a "shortest driving route" or if it is "as the crow flies." Does anybody know how to do this? Can it be done in R? I have thousands of addresses, so I think that Mapquest is out of the question! Please rely to: philipsmith at alumni.albany.edu Thank

In the following deployment of web app on ONE pc-based server,running linux,which can support the most amount of concurrent users as well as the shortest latency? 1 apache+mongrel 2 apache+mongrel_cluster 3 lighthttpd+mongrel 4 lighthttpd+mongrel_cluster 5 lighthttpd+fastcgi Thanks charlie -- Posted via http://www.ruby-forum.com/.

Hi, Sorry for not being specific. I just wanted to know if there is any way at all to force clang to generate intermediate code for static functions when they are not being called anywhere inside the current module. Other compilers seem to generate intermediate code (lcc, for instance). Thanks for your reply..Olivier. Sincerely Arvind On Mon, Dec 14, 2009 at 1:10 PM, Olivier Meurant

Hi all, I had little success installing llvm inside scratchbox for an ARM build so have been trying to generate assembly code for arm using the llc utility. However, llc fails to generate code for arm. Output is as below... arvind at zeus:~/tools/llvm/del$ llc main.bc -o mainarm -filetype=asm -march=arm -f llc: ARMISelDAGToDAG.cpp:73: llvm::SDOperand LowerCALL(llvm::SDOperand,

Ah ok. Sorry. :) I think that argument "-femit-all-decls" will help you. Olivier. On Mon, Dec 14, 2009 at 9:18 PM, Arvind Sudarsanam < arvind.sudarsanam at aggiemail.usu.edu> wrote: > Hi, > > Sorry for not being specific. I just wanted to know if there is any > way at all to force clang to generate intermediate code for static > functions when they are not being

Hi, I am trying to compile a single module (dgemm.c) using clang and generate dgemm.ll. Command: clang -emit-llvm dgemm.c -S -o dgemm.ll Some of the functions are declared as static and clang ignores these functions: One of the functions is: static void innerloop(double a, const double* b, double* c, double beta) { *b = a*beta; return; } Is there any way to make clang generate llvm code

HI Arvind, I think you are using an old llc version. VarArg support was implemented a long time ago. Lauro 2008/1/28, Arvind Ayyangar <arvind.ayyangar at gmail.com>: > Hi all, > I had little success installing llvm inside scratchbox for an ARM > build so have been trying to generate assembly code for arm using the > llc utility. However, llc fails to generate code for