similar to: a small puzzle?

Displaying 20 results from an estimated 3000 matches similar to: "a small puzzle?"

2010 Jul 12
6
in continuation with the earlier R puzzle
When I just run a for loop it works. But if I am going to run a for loop every time for large vectors I might as well use C or any other language. The reason R is powerful is becasue it can handle large vectors without each element being manipulated? Please let me know where I am wrong. for(i in 1:length(news1o)){ + if(news1o[i]>s2o[i]) + s[i]<-1 + else + s[i]<--1 + } --
2006 Jan 07
2
VB on Linux with Wine
We have 50 complex applications written in Microsoft Visual Basic 6.0 providing banking solutions. We are seriously thinking of porting our applications to Linux under WINE. Is it possible to do so? Nature of our VB applications: ------------------------------ 1. Extensively used all controls provided in VB 2. Total size of our applications is around 2 million lines 3. Applications are having
2012 Jun 20
4
binary operators that never return missing values
Hi, I work with data sets with lots of missing values. We often need to conduct logical tests on numeric vectors containing missing values. I've searched around for material and conversations on this topic, but I'm having a hard time finding anything. Has anyone written a package that deals with this sort of thing? All I want are a group of functions like the ones I've posted
2010 Mar 26
6
Rake argument error
Hi, I''m having a problem loading a sample data with simple rake command. rake db:fixtures:load When I run the above command,I get the following error $rake db:fixtures:load (in /home/raghu/www/photos) rake aborted! a YAML error occurred parsing /home/raghu/www/photos/test/fixtures/photos.yml. Please note that YAML must be consistently indented using spaces. Tabs are not allowed. Please
2006 Jul 26
3
newbie: Scaffold doesn''t pickup DB changes
I''m following along with the depot example in ''Agile Web Development'' and ran into a problem with Scaffold. I changed the MySQL table structure to add a few columns directly and also tried the migrate script to change the database after I got the initial scaffolding to work. However, I can''t seem to get the new columns to show up and am stumped as to how I can
2007 Jul 13
3
THANK YOU: Updating R version
Based on the feedback received, I did the following: a) moved my lib sub-directory from the existing installed R version to c:\myRLib b) installed the updated R version c) created .Renviron file in the home directory (C:\R-2.5.1) with the line R_LIBS=c:/myRLib d) used .libPaths() command to confirm that the new R installation was recognizing the myRLib sub-directory e) deleted my old R
2004 Mar 30
2
earliest use of rsync?
Dear Folks, Is there a documented case of earliest use of rsync over internet? I presume rsync was used almost as soon as internet was invented as a file transfer and bandwidth efficient backup solution. If anyone has any information, please respond. -- Raghu Kulkarni
2011 Jan 25
0
[LLVMdev] install and add backend to llvm.
Have you added the $LLVM_INSTALL_DIR/bin to your PATH environment variable? Regarding changing a particular backend, check the documentation in http://llvm.org/docs/WritingAnLLVMBackend.html http://llvm.org/docs/CodeGenerator.html A few LLVMdev meetings have good talks to give you a good enough idea. http://llvm.org/devmtg/ Cheers, Raghu. ----- Original Message ----- From: "Teklu
2011 Jan 25
2
[LLVMdev] install and add backend to llvm.
Hi I am new to llvm and Linux (I am using ubuntu 10) My aim is to add backend to llvm. I install llvm using $ sudo apt-get install llvm and I am able to understand what I read about Writing an LLVM Compiler Backend. I have seen the assembly codes of the targets on llvm using llc. What I need now is to change some of the TableGen files of one of the target like SparcInstrInfo.td.  So I
2010 Sep 17
3
[LLVMdev] Query on llvm-gcc v/s llc/as
Hi all, I have started using LLVM recently, and I have a basic question. There are two different ways in which an executable can be generated from a .c file - by just using llvm-gcc, and using a combination of llvm-gcc (to emit bitcode .bc), llc (to emit assembly code), as (to assemble the code) and collect2 (linker). For example, consider compiling test.c : 1) llvm-gcc -O3 test.c -o
2008 May 30
5
Upper limit to number of jobs queued by BDRb?
I use BDRb to process RSS feeds for users on my site (http://feedflix.com). I have a batch job that queries the DB for records that haven''t been updated in the last so many hours and kicks off a background job for each of them. If N records are returned by the DB, N background jobs gets queued and get done serially. As long as N is 255 or under, everything works like a charm.
2011 Jan 20
2
[LLVMdev] Modifying the patterns/ instruction selection phase in LLVM 2.7
On 1/20/11 12:27 PM, Venkatraman Govindaraju wrote: Just out of curiosity, have either of you considered writing an LLVM transform that simply replaces these call instructions with inline assembly code that does what you want? If that works, it seems much simpler than modifying/enhancing the code generator. -- John T. > I have similar requirements for my project. This is what I do. >
2011 Jan 19
2
[LLVMdev] Modifying the patterns/ instruction selection phase in LLVM 2.7
Hello all, I am trying to modify the Sparc backend to do something for my team's project, to do the following. Whenever the backend encounters a call to one particular type of function names (functions like p0(), p1()..etc), I want the backend to generate a "sethi %g0, <number>", and NOT a "call p0, call p1..." instruction. However, the backend should work as usual
2008 May 17
1
Can someone help with this error?
Hello all, I get this intermittent error saying OpenURI::HTTPError. At the bottom of the email is what is reported in my backgroundrb_server_<port>.log file. The process_netflix_reviews method is parsing (in the background) Netflix''s RSS feeds. This error also pretty much brings down the BDRb process and to recover, I am forced to do a ./script/backgroundrb stop
2010 Nov 22
0
[LLVMdev] Sparc back end fix
Hi Tim, Thanks for the patch. I had a few questions though - just to make sure that I get the problem correctly. Currently, here is your flow, as I understand it : x86 llvm-gcc binary llc -march=sparc gcc cross/sparc source ---------------------> .bc ------------------> .s -----------------> sparc executable. Is this correct? Or did you manage to build the
2005 May 06
3
Tru64 unix version...
Hello, I want to use samba on Tru64 Unix. Can anybody let me know the location from where i can download this version. Raghu
2010 Jul 28
2
finding the next highest number in an array
Hi I have a sorted array ( in ascending order) and I want to find the subscript of a number in the array which is the the next highest number to a given number. For example,if I have 67 as a given number and if I have a vector x=c(23,36,45,62,79,103,109), then how do I get the subscript 5 from x (to get 79 which is the next highest to 67) without using a for loop? Thx -- 'Raghu'
2009 Jan 17
2
Confidence Interval
I am new to R and Im some trouble with the following question... Generate 100 standard normal N(0,1) samples of size 100, X1(k),...,X100(k) where k=1,...,100 (The k is and indicie in brackets) Calculate the sample mean for each sample. For each sample mean Xbark the 0.95-confidence interval for the mean mew=0 is given by... Ik= ( Xbark plus or minus 1.96/10) Find the number of intervals such
2010 Jul 28
3
how to code it??
Hi I have say a large vector of 3500 digits. Initially the digits are 0s and 1s. I need to check for a rule to change some of the 0s to -1s in this vector. But once I change a 0 to -1 then I need to start applying the rule to change the next 0 only after I see the next 1 in the vector. Say for example x = (0,0,0,0,0,0,0,1,0,0,1,1,0,0,1,0,0,0,1) I need to traverse from the 9th element to the last
2011 Dec 13
0
[LLVMdev] Optimization application by llvm-gcc, opt
Hi Raghu, > Thanks Duncan. Just to make sure I understand correctly, opt has more global information, due to which optimizations can have greater effect than in llvm-gcc, where optimizations are applied on a per-function basis. Is this correct ? if you look carefully at what "opt -O3" runs (using -debug-pass=Arguments) you will see that it first runs a small list of passes (the