search for: laguage

...or i = 1 to 10 { for j = i+1 to 10 { // do something } } However, trying to do the same in R, my first try was for (i in 1:10) { for (j in (i+1):10) { // do something } } but there's a problem here. For i=10, the last for loop is over 11:10. Usually programming laguages would regard what corresponds to 11:10 as empty, but A:B with A bigger than B is in R interpreted as the numbers from B to A in reverse order. Is there a clever way to make nested loops like the one above in R? -- Michael Knudsen micknudsen at gmail.com http://lifeofknudsen.blogspot.com/

...uploads and downloads. I understand that I need to place everybody in different class''. Could I get help how to use tc/QBC to limit bandwith and impliment a u32 (or fwmark) filter that names mac address''s as the source. Please be specific because I am not very fluent in the laguage yet. Thank you Luke

Well, then I'm royally screwed. What would I have to add to make it work, if only for a very limited subset of cases? On Wed, Feb 2, 2011 at 11:44 PM, Yuri <yuri at rawbw.com> wrote: > On 02/02/2011 19:53, Lally Singh wrote: >> >> To answer my own question.  The problem is that Solaris ships with >> very old tools, and llvmc was generating assembler that worked

On 02/02/2011 19:53, Lally Singh wrote: > To answer my own question. The problem is that Solaris ships with > very old tools, and llvmc was generating assembler that worked with a > fresh (gcc-4.5) compile& install. I had them handy, just further > down the path. Hopefully anyone with the same problem can find this > in the archive. > I think llvm isn't ported to

Hi all, I have happened to work on MS .NET for sometime now, and I found that this language offers RNG what is called as Donald E. Knuth's subtractive random number generator algorithm (found here: http://msdn.microsoft.com/en-us/library/system.random.aspx#Y12). ? Here I was wondering whether R also have same RNG in it's inventory, so looked at ?set.seed. There I found 2 related RNGs

Hi All, Is there something similar to apt-cacher available for CentOS? I would like to ensure that an application is only downloaded once to the network and not hundreds of times. If there isn't an equivalent, would someone please point me in the direction of how I might accomplish this with CentOS? -- James A. Peltier Technical Director, RHCE SCIRF | GrUVi @ Simon Fraser University -

Hi All, Is there something similar to apt-cacher available for CentOS? I would like to ensure that an application is only downloaded once to the network and not hundreds of times. If there isn't an equivalent, would someone please point me in the direction of how I might accomplish this with CentOS? -- James A. Peltier Technical Director, RHCE SCIRF | GrUVi @ Simon Fraser University -

Hi! Maybe, you know thing such as odesk tests. Here will be place we discuss about some questions of them. I can''t understand what they want. (Rails 3) 1.Screenshot-3.png. What is answer? I think d, but I can''t find Net::HTTP.open function in API. 2. Screenshot-5.png. I can''t understand what they want from me. I work only with RSpec 3. Screenshot-6.png. I start to

A customer of mine wants an IVR where the first 3 choices are 1 English 2 Spanish 3 French I can build the IVR but how do I get the system prompts to then speak the selected langauge. For example, a caller has selected Spanish and so is routed to the Spanish part of the IVR. At some point he breaks out of the IVR to leave a VM. How does the system know to continue offering him Spanish?

Hi all there Can some one clarify me on this issue, features wise which is better R or SAS, leaving the commerical aspect associated with it. I suppose there are few people who have worked on both R and SAS and wish they would be able to help me in deciding on this. THank you for the help --------------------------------- [[alternative HTML version deleted]]

Hi group, I found a module for adaptive kernel density estimation for Stata users, but unfortunetly I don't have access to Stata, can I find a similar approach using R? Thank u so much 4 ur time. [[alternative HTML version deleted]]