similar to: Restricting optimisation algorithm's parameter space in GNLM

> I have a problem. I am using the NLME library to fit a non-linear model. There is a linear component to the model that has a couple parameter values that can only be positive (the coefficients are embedded in a sqrt). When I try and fit the model to data the search algorithm tries to see if a negative value for one of these parameter values will produce an optimal fit. When it does so,

Hi, I'm not yet familar with GLM and still learning. How can I perform a BNL (to estimate LDp values) with matrixes like this (N indicates the observed objects): data from: Kerr D, Meador J. 1996. "Modeling Dose Response Using Generalized Linear Models". Environ Toxicol Chem 15(3) conc respond n 0 0 20 0 1 19 0 1 20 0 0 20 13.5 5 23 13.5 2 20 29 9 20 29 6 20 53 12 20 53 15 20 85

I am attempting to fit discrete data (daily counts of arrivals of recreational vessels at locks on a river) using the fit.dist package. Some distributions return values of NaN and Inf for certain situations, an example with Inf values is shown below. # of vessels: 1 2 3 4 5 6 7 8 9 10 11 # of days with # of vessels: 35 20 10 5 6

Hello, I am interested in fitting a generalized nonlinear regression (gnlr) model with negative binomial errors. I have found Jim Lindsay's package that will do gnlr, but I have having trouble with the particular model I am interested in fitting. It is a threshhold model, where below a certain value of one of the parameters being fitted, the model changes. Here is a sample: Cones:

Hi, I’ve recently encountered an issue where the `instcombine` pass replaces an `llvm.memcpy` between two distinct address spaces with an `addrspacecast` instruction. As an example, see the trivial OpenCL kernel attached. I’m compiling like this: clang -cc1 -triple spir64-unknown-unknown -x cl -O0 -emit-llvm array_init.cl -o before.ll This yields an `llvm.memcpy` to copy the array

Hi list, my previous question was obviously too basic to deserve an answer - apologies for that. I'm learning, things can only get better :-) My current problem is with fitting a generalized gamma distribution with an additional "shift" parameter, that represents a shift of the distribution along the X axis. The gnlr3 function (in Jim Lindsey's GNLM package) fits this

Hi, I just installed the odesolve package and ran the check command on it. It failed trying to execute library(gnlm). Sure enough, there is no gnlm library on my system and I could not find it on the CRAN archive either. Am I missing anything obvious or is gnlm some private library that somehow found its way into the example section of odesolve? Thanks in advance, Andy

Pursing my earlier question, when I tried loading Lindsey's gnlm, I got a message Loading required package: rmutil Warning message: There is no package called 'rmutil' in: library(package, character.only = TRUE, logical = TRUE, warn.conflicts = warn.conflicts, According to the R documentation http://finzi.psych.upenn.edu/R/doc/html/packages.html rmutil is in the standard

I'm fairly new to LLVM, and am writing an optimisation pass to be run by 'opt'. However, i'd like this pass to be parameterisable; as such i'd like to be able to pass an option to it (preferably via the command line to 'opt'). e.g. so i can do something like this "opt -load mypass.so -MyPass=MyPassOption < inputfile.bc ..." (for example one thing I would

Hi Mehdi, Thanks for the reply - I’ve finally got round to trying to fix this based on your suggestion. I’ve got something that mostly works, but I just wanted to double-check something about the regression tests before I post a patch. > The memcpy is supposed to be equivalent to a sequence of load and store. Here we are just failing to keep the property that the load is performed through

OK, I’ve hit one more existing regression test that I’m weary of: define void @test2_addrspacecast() { %A = alloca %T %B = alloca %T %a = addrspacecast %T* %A to i8 addrspace(1)* %b = addrspacecast %T* %B to i8 addrspace(1)* call void @llvm.memcpy.p1i8.p0i8.i64(i8 addrspace(1)* %a, i8* bitcast (%T* @G to i8*), i64 124, i32 4, i1 false) call void

I just had a memory crash with R-0.64.1. I am running under intel pentium 200mhz under slackware linux 2.0.30. 1/home/plindsey >gdb /usr/local/src/R/bin/R.binary core GDB is free software and you are welcome to distribute copies of it under certain conditions; type "show copying" to see the conditions. There is absolutely no warranty for GDB; type "show warranty" for

Dear R-group members, I use: platform i386-pc-mingw32 arch x86 os Win32 system x86, Win32 status major 1 minor 4.1 year 2002 month 01 day 30 language R I try to fit a 2 compartment model. The compartments are open, connected to each other and

Hello, I would like to build samba at different optimisation levels with debug symbols, in order to test a static analysis tool I have developed. I have found the configure option "--enable-developer", which I presume enables debug symbols and sets optimisation to O0, however I would also like to be able to enable debug symbols and set the optimisation level to O2. I cannot find a way

Having a look at clang's source, you can find in "lib/CodeGen/BackendUtil.cpp" the functions where clang builds the passes to emit code. The optimization passes used are there and you can simulate them via the "opt" utility, by running each pass one at a time. LLVM also declares standard module/function passes on include/llvm/Support/StandardPasses.h. Have a look and see

Have a look at ?optim. I don't think it has the BHHH algorithm as an option, though. =========================================== David Barron Jesus College University of Oxford -----Original Message----- From: r-help-bounces at stat.math.ethz.ch [mailto:r-help-bounces at stat.math.ethz.ch]On Behalf Of Harold Doran Sent: 10 July 2003 15:43 To: Fohr, Marc [AM]; R-help at stat.math.ethz.ch

Dear All, I would like to minimise a nonlinear function subject to linear inequality constraints as part of an R program. I have been using the constrOptim function. I have tried all of the methods that come with Optim, but nothing finds the correct solution. If I use the correct solution as the vector of starting values, though, my program does output the correct solution and optimum - the

Hi Sanjoy, Yes these are C tests (from 'gcc.c-torture/execute'), and as I indicated in my original message, the tests are not valid because the behaviour is undefined. However, it was while investigating these new failures in these tests that I realised that this optimisation existed. The optimisation itself is perfectly valid, but it does mean that integer underflow will no longer be

When I'm trying to understand how or why the back end does something I've found the -view-* options to llc to be useful. It's not ideal, because "clang" doesn't take those options, so I have to invoke first "clang" and then "llc", and sometimes that combination gives different final code from invoking just "clang", but usually I can construct

Dear Sirs, I would be interested to hear your views on whether SPEEX could be made to run fast on a DSPIC33 by the following strategy: Make iir_mem16() (for example) purely 16 bit by restricting the number of bits in the signal to say 10 using SATURATE and then making the LPC co-efficients just 6 bits. At present (with standard code) the encode function is taking about 140ms which is seven