similar to: [SoC09-Info] An IPopt interface for R

Dear all, I'm wondering if there are some ongoing projects for interior point methods in R (e.g. linking ipopt from Coin written in C++ to R) and for automatic differentiation in R (e.g. linking openAD available in C++ and Fortran) ? Many thanks, David [[alternative HTML version deleted]]

Dear R-Help list: I'm using the Matrix library to operate on 600 X ~5000 element unsymmetrical sparse arrays. So far, so good, but if I find I need more speed or functionality, how hard would it be to utilize other sparse matrix toolsets from within R, say MUMPS, PARDISO or UMFPACK, that do not have explicit R interfaces? More information on these is available here

Dear list, The task view on optimization does not reference a package for non linear constrained optimization problems. Stefan Theussl told me to look at the Rsolnp package, but unfortunately it is not very clear what method is R ported. (The authors ported the matlab code of Yinyu Ye http://www.stanford.edu/~yyye/ <http://www.stanford.edu/%7Eyyye/>) Currently I'm looking for an

Hi everybody, as Fritz mentioned in his introducing "Google Summer of Code 2009" email, I will manage the organizational part of the R-Project application and (hopfully) participation. Google's timeline schedules March 9-13 as date for organizations to make an application as mentoring organization. The idea is now to collect as many project ideas in a brainstorming phase and submit

Hi everybody, just another Google Summer of Code project idea. Best, Manuel. ---------------------------------------------------------------------- cranlab -- "You can't control what you can't measure" [0] Mentor: Manuel J. A. Eugster Summary: The aim of this project is the (1) implementation of software metrics to analyze R packages and (2) the creation of a CRAN

Hi Manuel, find our SoC proposal below. Best wishes, Torsten & Achim _______________________________________________________________________ Party On! New Recursive Partytioning Tools. Mentor: Torsten Hothorn & Achim Zeileis Short Description: The aim of the project is the implementation of recursive partitioning methods ("trees") which aren't available in R at the

Hi all, here's a proposal for a SoC project on wildlife movement patterns analysis. A MSc student is available to anwser the call, of course. The idea has already been briefly discussed with the mantainer of the adehabitat package and the AniMov project community. Short description Develop some add-on functions to use the adehabitat package to perform basic movement ecology analysis, in

Hi all, Here's my idea for the google summer of code - it's a resubmission from last year. We had a couple of interested students, but their proposals weren't quite competitive enough to get funding. Regards, Hadley Summary: Create an information portal for the fast growing list of R packages, integrating package documentation and journal publications with feedback from the useR

Hi guys, my goal is to create a reliable virtualization environment using CentOS 6.4 and KVM, I've three nodes and a clustered GFS2. The enviroment is up and working, but I'm worry for the reliability, if I turn the network interface down on one node to simulate a crash (for example on the node "node6.blade"): 1) GFS2 hangs (processes go in D state) until node6.blade get

hello all, we are developing and porting vorbis1decoder on a 24 bit platform. in the process we came across somedoubts about node bytes and leaf words. from the specification we got that we are arranging the huffman codeword tree into an array. the nodebytes are the number of bytes that are required to represent a node and leafwords are the no. of bytes required to represent the leaf i.e the

Hi Sebastian, It boils down to this: The previous heuristic solver could return infinite cost solutions in some rare cases (despite finite-cost solutions existing). The new solver is still heuristic, but it should always return a finite cost solution if one exists. It does this by avoiding early reduction of infinite spill cost nodes via R1 or R2. To illustrate why the early reductions can be a

Hi, I am a bit confused on how code-words are derived from the codeword lengths. I will appreciate if someone can point me in the correct direction. I will take the example of an actual codebook that i found in a valid vorbis encoded file as shown below. [SK] +------Codebook [0] -------- [SK] Codebook Dimensions = 1 [SK] Codebook Entries = 8 [SK] Unordered [SK] 1, 6, 3, 7, 2, 5, 4, 7, [SK] NO

Hi. I need some advises on how to use R to find pi (i is the index) with the following objective function and constraint: max (sum i)[ f(ai, bi, pi) * g(ci, di, pi) * Di ] s.t. (sum i)[ f(ai, bi, pi) * Di * pi] / (sum i)[ f(ai, bi, pi) * Di ] <= constant f and g are diffentiable. So, I am thinking of optim with method = "BFGS"? But wonder how to include the

Hi Lang, I'm surprised about the fact that you omit R1/R2 reductions in some cases. Can you give a more detailed description of the bug (e.g. a PBQP dump)? Best regards, Sebastian Lang Hames wrote: > Hi Sachin, llvm-dev, > > I've just committed a new PBQP solver which, among other things, > should take care of this bug. > > Please let me know how it works out for you.

Dear gluster experts, We have encountered a severe performance issue related to quota feature of gluster. My underlying fs is lvm with xfs format. The problem is if quota is enabled the io performance is about 26MB/s but with quota disabled the io performance is 216MB/s. Any one known what's the problem? BTW I have reproduce it several times and it is related to quota indeed. Here's the

Hi Sachin, llvm-dev, I've just committed a new PBQP solver which, among other things, should take care of this bug. Please let me know how it works out for you. Cheers, Lang. On Tue, Dec 15, 2009 at 5:54 PM, Lang Hames <lhames at gmail.com> wrote: > Hi Sachin, > > Yes. Bernhard Scholz and I have just discussed a fix for this. I hope to > commit it in the next few days. I

Can someone recommend a method to answer the following type of question: Suppose I have a coin with a probability hhh of coming up heads (and 1-hhh of coming up tails) I plan on flipping the coin nnn times (for example, nnn = 500) What is the expected probability or frequency of a run of rrr heads* during the nnn=500 coin flips? Moreover, I would probably (excuse the pun) want the answer for a

[b]Real Work At Home Online Using Your Computer (ID 20289)[/b] You Know? We are seeking people with a serious, strong desire to improve their life, willing to work hard to earn a 6-figure income. We provide full training with one-on-one personal mentoring and support. No previous experience ... http://ow.ly/3JgBB

Hello, I am going through Zhao's RDataMining PDF, and to redo all the graphics on my computer, I need several packages, 'coin' and 'party' to name two. I get the following error: > install.packages("coin") Installing package(s) into ?/home/sven/R/i686-pc-linux-gnu-library/2.15? (as ?lib? is unspecified) trying URL

Is it possible to implement the Jonckheere-Terpstra test for ordered alternatives using the coin package: Conditional Inference Procedures in a Permutation Test Framework? I found jonckheere.test{clinfun}, but it uses a normal approximation when ties are present in the data. To make this concrete, I've include a small dataset. Thanks. --Dale Hollander and Wolfe, 1999 Table 6.6, pg 205