similar to: Graphics

Hi, I want to run through a formula several times with several different variables (which are defined by independent vectors of equal length 10 elements). It looks like this: function (m,s,y) { for (j in m){ for (k in s){ for (i in y){ DIC.hat<-sum(-2*((log(1/sqrt(2*pi*s^2))*exp((((y-m[j])/s)^2)/-2)))) } } } DIC.hat } My problem is that R runs the three

Hi R package developers, I would like to know whether anyone had experience using the C++ Boost library within an R package, and how portable was the resulting package. I am especially thinking of possible compiling problems on Windows and Apple systems. If anyone had any tips on how to render an R package using Boost portable, that would be very much appreciated. Thank you very much for

Hi R package developers, I would like to know whether anyone had experience using the C++ Boost library within an R package, and how portable was the resulting package. I am especially thinking of possible compiling problems on Windows and Apple systems. If anyone had any tips on how to render an R package using Boost portable, that would be very much appreciated. Thank you very much for

hey guys, I'm attempting to install php 5.2.7 using the webtatic repo.. but it looks like my exclude isn't working.. I'd appreciate it if someone could point out the mistake I'm making/flaw in my approach... ## machine info [root at ec2-174-129-154-179 yum.repos.d]# cat /etc/redhat-release CentOS release 5.5 (Final) [root at ec2-174-129-154-179 yum.repos.d]# uname -a Linux

The R translation teams have done a great job in making R usable for people who do not have English as their mother tongue. However, even within English speaking countries, there are groups which have trouble with the language, and it may be valuable to support the Sociolects of these groups too. Thanks to a generous contribution from Lars Polifo, these features will be made available in an

Hello list! I have been instructed to install very specific version numbers of httpd and php on the company web servers. Here's what I've tried so far [root at ec2-50-17-114-126 ~]# yum install php-5.2.17-1.w5.i386 Loaded plugins: fastestmirror Loading mirror speeds from cached hostfile * addons: yum.singlehop.com * base: mirror.rackspace.com * epel: nas1.itc.virginia.edu * extras:

I have a set of data for US t-bill returns and US stock returns frm 1980-2012. I am trying to bootstrap the data and obtain the minimum variance portfolio and repeat this portfolio 1000 times. However I am unable to get the correct code function for the minimum variance portfolio. When I tried to enter Opt(OriData+1, 1, 5, 0), I get "error:subscript out of bounds" Please help!

I think it will looks like: void Encode(const char* infile, const char* outFile) { void* st; SpeexBits bits; ..... st = speex_encoder_init(mode); ..... speex_encode_int(st, input, &bits); ..... speex_bits_destroy(&bits); speex_encoder_destroy(st); } 2011/12/7 Steve Checkoway <s at pahtak.org> > > On Dec 7, 2011, at 0:00 , Denis Romashenko

JOB: Statistical and Mathematical Modelling in the Energy and Environment Sectors Quintessa (www.quintessa.org) is an employee-owned company that undertakes high-quality science-based consultancy, research and software development for industry and governments around the world in the energy and environment sectors. Statistical and mathematical modelling of complex systems (ranging from geological

All, If we can speculatively execute a load instruction, why isn’t it safe to hoist it out by promoting it to a scalar in LICM pass? There is a comment in LICM pass that if a load/store is conditional then it is not safe because it would break the LLVM concurrency model (See commit 73bfa4a). It has an IR test for checking this in test/Transforms/LICM/scalar-promote-memmodel.ll However, I have

I have huge list of edges with weights. a1 b1 w1 a2 b2 w2 a3 b3 w3 a1 b1 w4 a3 b1 w5 I have to convert it into 2 dim matrix b1 b2 b3 a1 max(w1,w4) 0 0 a2 0 w2 0 a3 w5 0 w3 if edges repeated take the maximum weights. How do this efficiently without using for loop? Any idea. thanks Avi [[alternative

I'll try to explain. I want to create dll with only one function "Encode" that will encode file to speex format. In my application I will use this function from 16 threads, if it will work correct? 2011/12/6 ???. <xialonghua at vip.qq.com> > > ** > two thread send frames to only encoder at same time,two thread will use > one buffer > .it will work wrong if not

I have a data frame something like: name wrist nLevel emot 1 4094 3.34 1 frustrated 2 4094 3.94 1 frustrated 3 4094 NA 1 frustrated 4 4094 3.51

I think gcc is right. It inserted a branch for n == 0 (the cbz at the top), so that's not a problem. In all other regards, this is safe: if you examine the sequence of loads and stores, it eliminated all but the first load and all but the last store. How's that unsafe? If I had to guess, the bug here is that LLVM doesn't want to hoist the load over the condition (which it is right

Hi, Jiong, Thanks for the patch! It is a great start to support 32bit register in BPF. In the past, I have studied a little bit to see whether 32bit register support may reduce the number of unnecessary shifts on x86_64 and improve the performance. Looking through a few bpf programs and it looks like the opportunity is not great, but still nice to have if we have this capability. As you

Hi, i think it will work correct.when one thread use encode,the others wait for. in java, i think we can do like this: synchronized (Encode) { Encode.encode(short[] in, byte[] out); } In the doc of speex: it says the speex is not thread-safe. ------------------ ???? ------------------ ???: "????? ?????????"<romius99 at mail.ru>; ????: 2011?12?7?(???) ??4:00 ???:

Thanks for the background on the concurrent memory model. So, is it sufficient that the loop entry is guarded by condition (cbz at top) for preventing the race? The loop entry will be guarded by condition if loop has been rotated by loop rotate pass. Since LICM runs after loop rotate, we can use ScalarEvolution::isLoopEntryGuardedByCond to check if we can speculatively execute load without

Move base / limit accessors into desc.h, where they properly belong. Signed-off-by: Zachary Amsden <zach@vmware.com> Index: linux-2.6.13/include/asm-i386/system.h =================================================================== --- linux-2.6.13.orig/include/asm-i386/system.h 2005-08-08 17:58:03.000000000 -0700 +++ linux-2.6.13/include/asm-i386/system.h 2005-08-08 18:01:31.000000000 -0700

Move base / limit accessors into desc.h, where they properly belong. Signed-off-by: Zachary Amsden <zach@vmware.com> Index: linux-2.6.13/include/asm-i386/system.h =================================================================== --- linux-2.6.13.orig/include/asm-i386/system.h 2005-08-08 17:58:03.000000000 -0700 +++ linux-2.6.13/include/asm-i386/system.h 2005-08-08 18:01:31.000000000 -0700

Move base / limit accessors into desc.h, where they properly belong. Patch-base: 2.6.13-rc5-mm1 Patch-keys: i386 desc cleanup Signed-off-by: Zachary Amsden <zach@vmware.com> Index: linux-2.6.13/include/asm-i386/system.h =================================================================== --- linux-2.6.13.orig/include/asm-i386/system.h 2005-08-09 20:17:26.000000000 -0700 +++