similar to: NLS results different from Excel

Folks: I thought the following excerpt from Bruce McCullough's post would be a good candidate for the R fortunes package -- except that it's about Excel, not R! So I nominate it... but leave it to others to say whether it's really "qualified" to be nominated. ---- "The idea that the Excel solver "has a good reputation for being fast and accurate" does not

NIST maintains a repository of Statistical Reference Datasets at http://www.itl.nist.gov/div898/strd/. I have been working through the datasets to compare R's results to their references with the hope that if all works well, this could become a validation package. All the linear regression datasets give results with some degree of accuracy except one. The NIST model includes 11 parameters,

> (1) Spill cost metrics. I think this one cannot be dissociated from some kind of live range pre-splitting. Cheers, Arnaud From: Lang Hames [mailto:lhames at gmail.com] Sent: 03 June 2016 23:15 To: James Molloy Cc: Arnaud De Grandmaison; llvm-dev at lists.llvm.org; Sebastian Buchwald; Bernhard Scholz Subject: Re: [llvm-dev] PBQP register allocation and copy propagation Hi James, Arnaud,

My thanks to Drs. Armstrong, Bates, Harrell, Liaw, Lumley, Prager, Schwartz, and Mr. Wang for their replies. I have pasted my original message and their replies below. After viewing http://www.itl.nist.gov/div898/strd/ as suggested by Dr. Schwartz, it occurred to me that it might be educational to search for some data repositories on google. I was able to find some,though I'm sure many of

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hello all - As I progress in R I am trying to automate functions I would have normally farmed out to Excel, SPSS or Statistica. Single factor anova is one of them. For example, a dataset from NIST StRD (http://www.itl.nist.gov/div898/strd/anova/AtmWtAg.html) has two groups: 1 2 107.8681568 107.8681079 107.8681465 107.8681344

I just recently installed a second hard drive in my Samba server with the hopes of sharing it with the rest of my home network. It seems like Samba can not get the correct permissions to the drive, however. I have the drive mounted under /media/public, and when I try to map a share directly to it and open the share with a client, I get an NT_STATUS_BAD_NETWORK_NAME error. When I map the

Hi, I think I discovered a major armv7 optimization bug in Clang. I create a simple test case which exhibits the issue. When you compile the attached file for armv7 with optimizations turned on (O2, O3 or Os), the binary generated led to a crash. The issue can't be reproduced when using GCC 4.2. It can't be reproduced with Clang when the optimization is turned off (O0). This issue can be

Hi, > > I think one idea to improve the situation is to consider the cost vector of adjacent nodes during RN. Let's say you decided to do a RN for node A and want to compute the costs for choosing register %Ri. The current implementation does this by computing min(row/column i of edge A <--> B) but you can do better by adding B's cost vector to the row/column before computing

The problem is in your code, not the compiler. You're casting an unaligned char* to an int*, even though an int* pointer must be 4-byte aligned in every ARM ABI that I've ever seen. On Jan 23, 2012, at 6:14 AM, Alexandre Colucci wrote: > Hi, > > I think I discovered a major armv7 optimization bug in Clang. I create a simple test case which exhibits the issue. > When you

>> Yes, I'd strongly suggest implementing one of the approaches based >> on the >> chrec analysis we have in the scev pass. >> > > Yup, just get the array accesses under scev form, and set a constraint > system from these. Once you set up the constraint systems for the > dependence distance vectors, you're almost done. You can look at how > this

Dear Users! I encountered with some problem in data reading while I challenged R (and me too) in a validation point of view. In this issue, I tried to utilize some reference datasets ( http://www.itl.nist.gov/div898/strd/index.html). And the result departed a bit from my expectations. This dataset dedicated to challenge cancellation and accumulation errors (case SmLs07), that's why this

Hi, I can't seem to get any Excel Add-Ins to work. In particular, I need the 'Solver' for an assignment ... I've tried with two office versions (2007/2003), which I've managed to install successfully (you have to enable the Solver add-in during installation), but it's the same every time. When I try to start it up I get a message saying can't access SOLVER.XLA, and

Hi, I'm new to R and I've run into a problem that I'm not really sure how to express properly in the language. I've got a data table that I've read from a file containing some simple information about the performance of 4 algorithms. The columns are the name of the algorithm, the problem instance and the resulting score on that problem (if it wasn't solved I mark that

In practice all Apple hardwares support misaligned accesses for single-register loads and stores. If a pointer is not aligned, LLVM should not use the double-register loads and stores. It should keep the two single-register loads instead of trying to optimize them as one unsupported double-register load. Note that this code compiled with GCC 4.2 runs perfectly whereas LLVM will produce a binary

Dear guys, I've put the puzzle solver running on LLVM 2.1. Well, at least partially, for it is failing three of SPEC2000 benchmarks. I will try to debug it now. The results are not as good as before. I mean, the puzzle solver is still the same, but the default allocator is producing very good code now. Even though, the puzzle solver produces faster code for half the benchmarks. It

Hello, I am trying to test the precision of R on datasets from The Statistical Reference Datasets Project http://www.itl.nist.gov/div898/strd/index.html and I don't manage to understand how R is storing its results. For example, I calculate a mean on the michelso dataset (100 values) and find: > m=mean(michel) > m V1 299.8524 > print(m,digits=15) V1 299.8524

Hello -- The question I have is about the gmm() function from the 'gmm' package (v. 1.4-5). The manual accompanying the package says that the gmm() function is programmed to use either of four numerical solvers -- optim, optimize, constrOptim, or nlminb -- for the minimization of the GMM objective function. I wonder whether there is a way to pass controls to a solver used while calling

Hi All, Is the Levenberg-Marquardt algorithm available in R. This method combines the steepest descent algorithm and Newton's method. Thanks in Advance, Dermot MacSweeney. ************************************************************** Dermot MacSweeney NMRC, Email: dsweeney at nmrc.ucc.ie Lee Maltings, Tel: +353 21 904178 Prospect Row, Fax: +353 21 270271 Cork, WWW:

Just thought I'd ask. For those who've never seen TK!Solver, I strongly recommend taking a look. So far as I can tell, it's the only product of its type available, retail or open source, for any platform. What makes TK!Solver so cool is that it adaptively back-solves pretty much any unknown from any set of equations you give it. (or vector full of unknowns, producing a vector of

This is applicable to either using optim or the differential equation solver or any similar solver Suppose I want to use the differential equation solver and this is my code d<-y[2] vdpol<-function(t,y) { list(c(1, d, 3, 4 ) } stiff<-ode(y=rep(0,4),times=c(0,1),func=dvdpol,parms=1) The thing is I want d to be composed of one of state variables in the