search for: 0.0100

Displaying 20 results from an estimated 48 matches for "0.0100".

Did you mean: 0.0000
2009 Oct 20
1
[LLVMdev] 2.6 pre-release2 ready for testing
G'Day Tanya, Is it too late to bring in the following patches to fix some major brokenness in the AuroraUX tool chain for 2.6? http://llvm.org/viewvc/llvm-project/cfe/trunk/lib/Driver/Tools.cpp?r1=84468&r2=84469&view=diff&pathrev=84469 http://llvm.org/viewvc/llvm-project/cfe/trunk/lib/Driver/Tools.cpp?r1=84265&r2=84266&view=diff&pathrev=84266
2009 Oct 20
0
[LLVMdev] 2.6 pre-release2 ready for testing
Hi Tanya, > 1) Compile llvm from source and untar the llvm-test in the projects > directory (name it llvm-test or test-suite). Choose to use a > pre-compiled llvm-gcc or re-compile it yourself. I compiled llvm and llvm-gcc with separate objects directories. Platform is x86_64-linux-gnu. > 2) Run make check, report any failures (FAIL or unexpected pass). Note > that you need to
2009 Oct 20
1
[LLVMdev] 2.6 pre-release2 ready for testing
On Oct 20, 2009, at 6:02 AM, Duncan Sands wrote: > Hi Tanya, > >> 1) Compile llvm from source and untar the llvm-test in the projects >> directory (name it llvm-test or test-suite). Choose to use a pre- >> compiled llvm-gcc or re-compile it yourself. > > I compiled llvm and llvm-gcc with separate objects directories. > Platform is x86_64-linux-gnu. > Ok.
2009 Oct 17
12
[LLVMdev] 2.6 pre-release2 ready for testing
LLVMers, 2.6 pre-release2 is ready to be tested by the community. http://llvm.org/prereleases/2.6/ If you have time, I'd appreciate anyone who can help test the release. To test llvm-gcc: 1) Compile llvm from source and untar the llvm-test in the projects directory (name it llvm-test or test-suite). Choose to use a pre- compiled llvm-gcc or re-compile it yourself. 2) Run make check,
2007 Aug 30
2
How to multiply all dataframe rows by another dataframe's columns
Hello, I have two data frames, X and Y, with two columns each and different numbers of rows. # creation of data frame X Loc1.alleles <- c(1,5,6,7,8) Loc1.Freq <- c(0.35, 0.15, 0.05, 0.10, 0.35) Loc1 <- cbind( Loc1.alleles,Loc1.Freq) X <- data.frame(Loc1) #creation of data frame Y Loc2.alleles <- c(1,4,6,8) Loc2.Freq <- c(0.35, 0.35,
2009 Aug 30
2
error with summary(vector)??
Hello, I get > summary(E) level nodes ave_nodes time Min. : 1 Min. : 1.00 Min. : 10.71 Min. : 0.0000 1st Qu.: 237414 1st Qu.: 2.00 1st Qu.: 19.70 1st Qu.: 0.0100 Median : 749229 Median : 3.00 Median : 27.01 Median : 0.0100 Mean : 767902 Mean : 49.85 Mean : 98.89 Mean : 0.2296 3rd
2012 Aug 27
2
Assigning colors on low p-values in table
Hi all R-users, I?m trying to assign colors on those p-value in my table output that fall above a certain critical value, let?s say a p-value >0.05. My table looks like this: Assets ADF-Level P-Value ADF-First D P-Value ADF-Second D P-Value [1,] Liabilities -2.3109 0.1988 -3.162 0.025 -6.0281
1997 Apr 30
2
R-alpha: New Incomplete Beta Function
Here is a drop-in replacement for the R incomplete beta function. src/math/pbeta.c It is a slightly modified version of the cephes library one from Netlib. In the few cases I tried it seems to give at least 14 digit agreement with the one in S-PLUS (its hard to get more). I'm not sure what performance is like. I'd like to know if it helps with some of the problems which have been
2008 Aug 29
0
Slow perl on CentOS - ActivePerl as a solution
Hi all, I found out that one of my perl scripts is heavily affected by the current bug. I was lazy to compile anything and I didn't want to mess up my system doing some experiments, so I tried to install ActivePerl as a temporary solution instead (RPMs are available). ActivePerl 5.8 is approximately 73x faster that CentOS version and ActivePerl 5.10 even slightly faster. Both versions and
2010 May 11
1
kernel density to smooth plots
Hi r-sers, I have a data of relative frequencies for the interval of 0-20, 20-40,...380-400.  I would like the two data on the same graph using the same x-axis label.  My question is how to get a smooth curve using kernel density code if it possible for this data.   > cbind(rel_obs,rel_gen)           rel_obs rel_gen  [1,] 0.000000000  0.0000  [2,] 0.092534175  0.0712  [3,] 0.105152471  0.1092
2010 Apr 08
3
[LLVMdev] darwin llvm-gfortran Polyhedron 2005 results
Building the current release 2.7 branch on x86_64-apple-darwin10 with r81455 reverted, I get the following Polyhedron 2005 benchmark results (with no test failures)... ================================================================================ Date & Time : 7 Apr 2010 22:24:16 Test Name : llvm_gfortran_lin_p4 Compile Command : llvm-gfortran -ffast-math -funroll-loops -msse3
2013 Jul 16
1
[LLVMdev] Analysis of polly-detect overhead in oggenc
Star Tan wrote: > I have found that the extremely expensive compile-time overhead comes from the string buffer operation for "INVALID" MACRO in the polly-detect pass. > Attached is a hack patch file that simply remove the string buffer operation. This patch file can significantly reduce compile-time overhead when compiling big source code. For example, for oggen*8.ll, the compile
2008 May 06
4
General Plotting Question
f <- (structure(list(X = structure(96:97, .Label = c("119DAmm", "119DN", "119DNN", "119DO", "119DOC", "119Flow", "119Nit", "119ON", "119OPhos", "119OrgP", "119Phos", "119TKN", "119TOC", "148DAmm", "148DN", "148DNN", "148DO",
2010 Mar 17
1
constrOptim - error: initial value not feasible
Hello at all, working with a dataset I try to optimize a non-linear function with constraint. test<-read.csv2("C:/Users/Herb/Desktop/Opti/NORM.csv") fkt<- function(x){ a<-c(0) s<-c(0) #Minimizing square error for(j in 1:107){ s<-(test[j,2] - (x[1] * test[j,3]) - (x[2] * test[j,4]) - (x[3]*test[j,5]) - (x[4]*test[j,6]) - (x[5]*test[j,7]))^2 a<- a+s} a<-as.double(a)
2010 Apr 08
0
[LLVMdev] darwin llvm-gfortran Polyhedron 2005 results
On Apr 7, 2010, at 8:41 PM, Jack Howarth wrote: > Building the current release 2.7 branch on x86_64-apple-darwin10 > with r81455 reverted, I get the following Polyhedron 2005 benchmark > results (with no test failures)... Very nice! A 14% speedup on a benchmark we don't tune for isn't bad. I imagine that there are several easy wins you could get on it if you were interested
2010 Sep 20
1
[LLVMdev] Polyhedron 2005 regressions
Comparing the Polyhedron 2005 benchmark results for gfortran from llvm-gcc-4.2 of April 7th, 2010 and September 18th, 2010 (from the rc2 2.8 release branch), we seem to be regressing in performance for this release.... ================================================================================ Date & Time : 7 Apr 2010 22:24:16 Test Name : llvm_gfortran_lin_p4 Compile Command :
2010 Apr 08
3
[LLVMdev] darwin llvm-gfortran Polyhedron 2005 results
On Wed, Apr 07, 2010 at 09:54:36PM -0700, Chris Lattner wrote: > > On Apr 7, 2010, at 8:41 PM, Jack Howarth wrote: > > > Building the current release 2.7 branch on x86_64-apple-darwin10 > > with r81455 reverted, I get the following Polyhedron 2005 benchmark > > results (with no test failures)... > > Very nice! A 14% speedup on a benchmark we don't tune for
2007 Sep 21
1
Help create a loopto conduct multiple pairwise operations
#Hello, #I have three data frames, X,Y and Z with two columns each and different numbers of rows. # creation of data frame X X.alleles <- c(1,5,6,7,8) X.Freq <- c(0.35, 0.15, 0.05 , 0.10, 0.35) Loc1 <- cbind( X.alleles,X.Freq) X <- data.frame(Loc1) #creation of data frame Y Y.alleles <- c(1,4,6,8) Y.Freq <- c(0.35, 0.35, 0.10, 0.20 )
2002 Oct 11
1
absurd computiation times of lme
Hi, i've been trying to apply the lme apprach to growth curves of children, but lme keeps running for ever and ever as soon as I use a reasonable basis. First Example: Data are 39 boys from the Berkeley growth study, each one measured 31 times at the ages of 1.00 1.25 1.50 1.75 2.00 3.00 4.00 5.00 6.00 7.00 8.00 8.50 9.00 9.50 10.00 10.50 11.00 11.50 12.00 12.50 13.00 13.50
2016 Oct 02
2
[PATCH] nv50/ir: Propagate third immediate src when folding OP_MAD
On 02.10.2016 20:03, Ilia Mirkin wrote: > On Sun, Oct 2, 2016 at 1:58 PM, Tobias Klausmann > <tobias.johannes.klausmann at mni.thm.de> wrote: >> Previously we'd end up with an unnecessary mov for the thirs immediate value. >> >> total instructions in shared programs : 851881 -> 851864 (-0.00%) >> total gprs used in shared programs : 110295 -> 110295