similar to: Finding optim.R function

Hi, I'm interested in using pbtree (package phytools) to simulate a phylogeny, but would first like to understand how the simulation works (i.e. when does a split occur and how is the split chosen?). Can anyone point me to the model that is used? Thank you! [[alternative HTML version deleted]]

I'll not copy all the previous material on this thread to avoid overload. The summary is that all the methods Spencer has tried have some issues. The bad news: This is not uncommon with optimization methods, in part because the problems are "hard", in part because getting them implemented and linked to an interfacing approach like R is very tedious and prone to omissions and

This patch adds new control messages for vcpu hotplug events. Via the xm vcpu_hotplug sub-program, VCPUS in domains can be enabled/disabled when CONFIG_HOTPLUG_CPU is enabled in the target domain''s kernel. Currently there is nothing that tracks whether a VCPU is up or down. My previous [1]patch added a new per-VCPU flag (VCPUF_down) which could be used to keep track of which VCPUS are

Dear R-er, For a non-linear optimisation, I used optim() with BFGS method but it stopped regularly before to reach a true mimimum. It was not a problem with limit of iterations, just a local minimum. I was able sometimes to reach better minimum using several rounds of optim(). Then I moved to optimx() to do the different optim rounds automatically using "Nelder-Mead" and

>>>>> Duncan Murdoch >>>>> on Sun, 26 Mar 2023 12:41:03 -0400 writes: > On 26/03/2023 11:54 a.m., J C Nash wrote: >> A tangential email discussion with Simon U. has >> highlighted a long-standing matter that some tools in the >> base R distribution are outdated, but that so many >> examples and other tools may use

Hello, This is a little off-topic. But I am writing a compiler to llvm ir for a language that admits recursive nested functions and am stuck as to how to translate them. Concretely, I'm trying to lift them all to the topmost level and pass all their free variables explicitly as arguments. To do this, I have to determine all their free variables in their bodies. In particular when I come

**** CALL FOR PAPERS **** The 22nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC'13) New York City, USA - June 17-21, 2013 http://www.hpdc.org/2013 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the premier

**** CALL FOR PAPERS **** The 22nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC'13) New York City, USA - June 17-21, 2013 http://www.hpdc.org/2013 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the premier

**** CALL FOR PAPERS **** The 22nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC'13) New York City, USA - June 17-21, 2013 http://www.hpdc.org/2013 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the premier

**** CALL FOR PAPERS **** The 22nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC'13) New York City, USA - June 17-21, 2013 http://www.hpdc.org/2013 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the premier

There have been several posts about optimizations where the parameters for the objective function are bounds-constrained. Brian Ripley took my 1990 "Compact numerical methods for computers" codes and p2c'd them to give the CG and BFGS and (possibly, I should check!) the Nelder Mead code. However, I have for use by myself and colleagues prepared variants of the codes that allow

HELLO other Rails-Core people! I''m trying to push changes to const_get in to ruby-core that will make our lives easier. I''ve pushed a branch of Ruby to github. Can you please check it out to make sure it does what we need? Here is the link: https://github.com/tenderlove/ruby/tree/p2c When we''re happy with the way it works, I''ll do the work make sure it

**** CALL FOR PAPERS **** The 23nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC-2014) Vancouver, Canada - June 23-27, 2014 http://www.hpdc.org/2014 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the

**** CALL FOR PAPERS **** The 23nd International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC-2014) Vancouver, Canada - June 23-27, 2014 http://www.hpdc.org/2014 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is the

**** CALL FOR PAPERS **** The 24th International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC-2015) Portland, Oregon, USA - June 15-19, 2015 http://www.hpdc.org/2015 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is

**** CALL FOR PAPERS **** The 24th International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC-2015) Portland, Oregon, USA - June 15-19, 2015 http://www.hpdc.org/2015 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is

**** CALL FOR PAPERS **** The 24th International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC-2015) Portland, Oregon, USA - June 15-19, 2015 http://www.hpdc.org/2015 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is

**** CALL FOR PAPERS **** The 24th International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC-2015) Portland, Oregon, USA - June 15-19, 2015 http://www.hpdc.org/2015 The ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) is