similar to: error messgae

Hi! I''m developing a different kind of Rails app. It''s an email client *built on RoR *which users can download and use. It''ll look and feel like a standard webapp, except that the server will be run locally (maybe webbrick).. Basically, the idea is that: * Web based apps are easier to upgrade, use etc. * But people need to have their email and other stuff on

Hi, I am Chinmay Naik, an undergraduate in Computer Science at Bangalore Institute of Technology, Bangalore. I am an experienced programmer and good with C,C++,Python,Java,OpenGL and would love to participate in Gsoc-13. >From the ideas listed, i am interested to work on the project "posting list encoding improvements". I am a newbie to Xapian but would like to get involved and get a

Hi! I''m new to Rails (and ruby in general). I was planning to implement a whiteboard like system, in which changes made by users to the board are automatically tracked. Currently, I''ve implemented it as a model Post which :has_many Boards. A new Board is added to the Post every time a change is submitted (with a created_at timestamp). This allows saving multiple versions of

Hi, How do I access the loop variables in a loop. for(i = 0; i < N; i++) for(j = 0; j < M; j++) A[i][j+k] = i + j; Is there anyway for me to know that in A[i][j+k], i & j are loop variables whereas k is not! Regards, Prasenjit Chakraborty Performance Modeling and Analysis IBM Systems & Technology Lab

Hi, I sent an email to Mark Fisheh of Oracle Corp. & posted this issue at OTN under Linux thread this morning. I hope that someone among you might have experienced this and can help. On that basis, I am sending this to you too. I am stuck & will really appreciate if you can shed some light on this. Thanks. Anjan

On Oct 12, 2009, at 3:46 AM, Prasenjit Chakraborty wrote: > > Hi, > How do I access the loop variables in a loop. > > for(i = 0; i < N; i++) > for(j = 0; j < M; j++) > A[i][j+k] = i + j; > > Is there anyway for me to know that in A[i][j+k], i & j are loop > variables > whereas k is not! The ScalarEvolution analysis can help here.

Hi, We have implemented the rsqrt instruction generation for X86 target architecture. We have introduced a flag -fp-rsqrt flag which controls the generatation of X86 rsqrt instruction generation. We have observed minor effects on precision due to rsqrt and hence has put these transformations under the mentioned flag. Note that -fp-rsqrt is only enabled with -enable-unsafe-fp-math flag presently.

On Wed, Nov 14, 2012 at 10:43 PM, Chakraborty, Soham <Soham.Chakraborty at amd.com> wrote: > Hi, > > > > We have implemented the rsqrt instruction generation for X86 target > architecture. We have introduced a flag -fp-rsqrt flag which controls the > generatation of X86 rsqrt instruction generation. > > We have observed minor effects on precision due to rsqrt and

Driver init call graph under baremetal: driver_init-> msix_capability_init-> msix_program_entries-> msix_mask_irq-> entry->masked = 1 request_irq-> __setup_irq-> irq_startup-> unmask_msi_irq-> msix_mask_irq-> entry->masked = 0 So

Hello, I am facing an issue with a small test where there is a chance that sign-extension is not introduced as expected - #include <stdio.h> void func( long x ) { printf(" %ld \n", x); } int main() { char c = -1; func ( c ); // c is zero extended to x return 0; } generated IR - define i32 @main() #0 { ........ store i8 -1, i8* %c, align 1 %2 = load i8,

Hello I am facing a curious problem.I have a time series data with which i want to fit auto-regressive model of order p, where p runs from 1:9.I am using a for loop which will fit an AR(p) model for each value of p using the *ar.ols* function. I am using the following code for ( p in 1:9){ a=ar.ols (x=data.ts, order.max=p, demean=T, intercept=T) } Specifying the *order.max* to be p, it gives me a

Hi everybody, I am very new in Ruby on Rails. I install ruby(1.9.2p180) and Rails(3.1.3). Also I install RubyMine3.1.1 as IDE. I successfully have done some simple simple practices. Now I want to play with database(mysql).Though I have checked so some of the URLs but unable to make out. Please help me how to do that, what files or folders should I place and where should I place those.

Hi, Please find attached the modified patch and description. We have modified and retested the patch taking into consideration the comments and inputs provided earlier. Thanks & Regards, soham -----Original Message----- From: Eli Friedman [mailto:eli.friedman at gmail.com] Sent: Thursday, November 15, 2012 12:59 PM To: Chakraborty, Soham Cc: llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev]

Hi Jean, Thats great news for me to start off with as I was planning to go with 16 Kbps ADPCM keeping in mind the issues and options I had. Now, whether the additional computation cost is worth the significant bandwidth savings, I have to see. Just wondering if it is possible to extend this logic to G3 and G4 fax as well, i.e. using a higher bit-rate and complexity mode for modem or fax instead of

Hello everyone, I am using *mlogit* to analyse my choice experiment data. I have *3 alternatives* for each individual and for each individual I have *9 questions*. I have a response from *516 individuals*. So it is a panel of 9*516 observations. I have arranged the data in long format (it contains 100 columns indicating different variables and identifiers). In mlogit I tried the following

On Jul 28, 2011, at 1:38 PM, Rose, Gregory V wrote: > >> From: Anirban Chakraborty [mailto:anirban.chakraborty at qlogic.com] >> Sent: Thursday, July 28, 2011 12:04 PM >> To: Rose, Gregory V >> Cc: David Miller; netdev; Ben Hutchings; Kirsher, Jeffrey T >> Subject: Re: [RFC net-next PATCH 3/4] ethtool: Add new set commands >> >> >> On Jul 28,

On Jul 28, 2011, at 1:38 PM, Rose, Gregory V wrote: > >> From: Anirban Chakraborty [mailto:anirban.chakraborty at qlogic.com] >> Sent: Thursday, July 28, 2011 12:04 PM >> To: Rose, Gregory V >> Cc: David Miller; netdev; Ben Hutchings; Kirsher, Jeffrey T >> Subject: Re: [RFC net-next PATCH 3/4] ethtool: Add new set commands >> >> >> On Jul 28,

Hi, I am new to LLVM. I want to go through all loops in a function. I see that there is a LoopPass manager that I can use. But that is not much of help, as I want to get the order of loops in CallGraphSCC order, hence I visit each function and then just want to go over the loops. Regards, Prasenjit Chakraborty Performance Modeling and Analysis IBM Systems & Technology Lab

In case a system is incapable of fax relay or if it is disabled, one of the easiest and safest options is to go for 40 kbps ADPCM compression (for fax upto 14.4 kbps)..even am new to this problem and the fair bit of seraching which i've done seems to suggest that the standard sloutions are to simply 'bypass' it else compress using ADPCM (40 k for fax upto 14.4 k, 32 k for fax upto 9.6

Hi All, I am sure this has been answered somewhere in the list in the past, but I can''t find it. I was wondering if the linux guest netfront driver has GRO support in it. tcpdump shows packets coming in with 1500 bytes, although the eth0 in dom0 and the vif corresponding to the linux guest in dom0 is showing that they receive large packet: In dom0: eth0 Link encap:Ethernet HWaddr