search for: iter

...m_covariates_sexandage <- msm(state ~ duration, subject = SerialNo, data = Data, qmatrix = twoway4.q, ematrix = ematrix,death = 4, obstrue = firstobs, covariates = ~ sex + age, method = "BFGS", control = list(reltol = 1e-10, fnscale = 50000, trace=1,REPORT=1)) msm stops after only 100 iterations and fails to compute the Hessian (See the output below). Why is it stopping at 100 only iterations yet i have specified reltol = 1e-10? One additional information is that when i exclude age, the model converges without any problem. I have tried using age groups instead of actual age but no...

A couple more data points. Current llvm 3.7svn with the two outstanding OPENMP patches can build the openmp support in gdl 0.9.5 (which completely passes its test suite) and apbs 1.4.1's limited openmp support. On Sat, May 2, 2015 at 11:11 PM, Jack Howarth < howarth.mailing.lists at gmail.com> wrote: > On a positive note, current llvm 3.7svn with the two outstanding > OPENMP

Hello! I am performing coupling of chains in MCMC and I need the same value of seed for two chains. I will show demo of what I want: R code, which might show my example is: niter <- 3 nchain <- 2 tmpSeed <- 123 for (i in 1:niter) { # iterations for (j in 1:nchain) { # chains set.seed(tmpSeed) a <- runif(1) cat("iter:", i, "chain:", j, "runif:", a, "\n") tmpSeed <- .Random.seed } } I get this: iter:...

...it? I am attempting to do Monte Carlo simulations, which may explain the loop in the code that follows. After the code I have included the output, which shows that the simulations are changing the response and input values, and that there are not any atypical values for the factors in the seventh iteration. At the end of the output is the aforementioned error message. Finally, I have included the model from biglm. Thanks in advance! Code: ======= iter <- nrow(nov.2010) predict.nov.2011 <- vector(mode='numeric', length=iter) for (i in 1:iter) { iter.df <- nov.2010 ##-...

This is a bit updated set of chain.c32 changes that simplifies a few things (and in partiter part), fixes few minor issues and adds a few new features. Details are in the following commits, below is the summary and pull details at the end. Shao - any chance to peek over them ? Most of those are relatively simple changes and well tested, though of course something might have slipped my at...

From: Raphael S. Carvalho <raphael.scarv at gmail.com> MultiFS depends on the availability of partiter to find a partition. Signed-off-by: Raphael S. Carvalho <raphael.scarv at gmail.com> --- com32/chain/Makefile | 2 +- com32/chain/chain.c | 4 +- com32/chain/mangle.c | 4 +- com32/chain/mangle.h | 2 +- com32/chain/options.c...

From: "Raphael S. Carvalho" <raphael.scarv at gmail.com> MultiFS depends on the availability of partiter to find a partition. Cc: Gene Cumm <gene.cumm at gmail.com> Signed-off-by: Raphael S. Carvalho <raphael.scarv at gmail.com> Signed-off-by: Paulo Alcantara <pcacjr at zytor.com> --- com32/chain/Makefile | 2 +- com32/chain/chain.c | 4 +- com32/chai...

On Tue, Sep 3, 2019 at 4:49 PM Lyude Paul <lyude at redhat.com> wrote: > > Currently, every single piece of code in amdgpu that loops through > connectors does it incorrectly and doesn't use the proper list iteration > helpers, drm_connector_list_iter_begin() and > drm_connector_list_iter_end(). Yeesh. > > So, do that. In fairness, I think the origin of this code predated the iterators. Reviewed-by: Alex Deucher <alexander.deucher at amd.com> > > Cc: Juston Li <juston.li at int...

...optim function not to produce the tracing information on the progress of the optimization, or at least to reduce the frequency of the reports. I tried the following: a) nnet default > x<-rnorm(20) > y<-seq(0,1,length=20) > s<-nnet(y~x,size=1) # weights: 4 initial value 1.910932 iter 10 value 1.819382 iter 20 value 1.788736 iter 30 value 1.775778 iter 40 value 1.767771 iter 50 value 1.765063 iter 60 value 1.762631 iter 70 value 1.760670 iter 80 value 1.759349 iter 90 value 1.757801 iter 100 value 1.756290 final value 1.756290 stopped after 100 iterations Report is g...

...r) +{ + unsigned int i; + + for (i = 0; i < vr->n_epts; i++) + if (vr->ept[i].addr == addr) + return vr->ept + i; + + return NULL; +} + +/* + * if len < 0, then for reading a request, the complete virtual queue buffer + * size is prepared, for sending a response, the length in the iterator is used + */ +int vhost_rpmsg_start_lock(struct vhost_rpmsg *vr, + struct vhost_rpmsg_iter *iter, + unsigned int qid, ssize_t len) + __acquires(vq->mutex) +{ + struct vhost_virtqueue *vq = vr->vq + qid; + size_t tmp; + + if (qid >= VIRTIO_RPMSG_NUM_OF_VQS) + return -EINVAL;...

...r) +{ + unsigned int i; + + for (i = 0; i < vr->n_epts; i++) + if (vr->ept[i].addr == addr) + return vr->ept + i; + + return NULL; +} + +/* + * if len < 0, then for reading a request, the complete virtual queue buffer + * size is prepared, for sending a response, the length in the iterator is used + */ +int vhost_rpmsg_start_lock(struct vhost_rpmsg *vr, struct vhost_rpmsg_iter *iter, + unsigned int qid, ssize_t len) + __acquires(vq->mutex) +{ + struct vhost_virtqueue *vq = vr->vq + qid; + size_t tmp; + + if (qid >= VIRTIO_RPMSG_NUM_OF_VQS) + return -EINVAL; + + ite...

...late vehicle times in and out in each of a number of parking spaces. At this stage, my code basically does what it is supposed to do but for the sequential number of each new parking event for a given space (i.e., the index of the loop variable). Instead of passing the index of the loop variable (iter) to the data frame, it passes the value of the total number of iterations. Eventually, the number of iterations (parking events in a given space) will be determined by an rnorm() fcn, so I am not looking for a process that locks-in the number of iterations. The total eventual data set size is sma...

...##################################################################### Note that the effect vanishes in case of other constraints for par[3:4]. here is what happens with trace=1 : z <- optim(par,fn,method="L-BFGS-B",lower=c(-Inf,-Inf,1e-6,1e-6),x=x,y=y,control=list(trace=1,REPORT=1)) iter 0 value 121.713156 iter 1 value 98.361657 iter 2 value 66.561121 iter 3 value 57.491023 iter 4 value 48.193824 iter 5 value 42.298821 iter 6 value 37.554272 iter 7 value 33.741241 iter 8 value 31.592504 iter 9 value 28.856846 iter 10 value 27.450574 iter 11 value 4...

Dear R users, During the the running of DEoptim function which belongs to "DEoptim" package it automatically gives the output like the following: Iteration: 1 bestvalit: 181.379847 bestmemit: 0.226499 1.395852 Iteration: 2 bestvalit: 14.062649 bestmemit: 2.290357 5.597838 Iteration: 3 bestvalit: 14.062649 bestmemit: 2.290357 5.597838 Iteration: 4 bestvalit: 14.062649 bestmemit: 2.290357 5.597838 Iteration: 5 bestvalit: 14....

...I debug it? I am attempting to do Monte Carlo simulations, which may explain the somewhat interesting loop which follows. After the code I have included the output, which shows that a) the simulations are changing the values, and b) there are not any atypical values for the factors in the seventh iteration. At the end of the output is the aforementioned error message. Code: ======= iter <- nrow(nov.2010) predict.nov.2011 <- vector(mode='numeric', length=iter) for (i in 1:iter) { iter.df <- nov.2010 ##---------- Update values of dynamic variables ------------------...

Currently, every single piece of code in amdgpu that loops through connectors does it incorrectly and doesn't use the proper list iteration helpers, drm_connector_list_iter_begin() and drm_connector_list_iter_end(). Yeesh. So, do that. Cc: Juston Li <juston.li at intel.com> Cc: Imre Deak <imre.deak at intel.com> Cc: Ville Syrjälä <ville.syrjala at linux.intel.com> Cc: Harry Wentland <hwentlan at amd.com>...

...r) +{ + unsigned int i; + + for (i = 0; i < vr->n_epts; i++) + if (vr->ept[i].addr == addr) + return vr->ept + i; + + return NULL; +} + +/* + * if len < 0, then for reading a request, the complete virtual queue buffer + * size is prepared, for sending a response, the length in the iterator is used + */ +int vhost_rpmsg_start_lock(struct vhost_rpmsg *vr, struct vhost_rpmsg_iter *iter, + unsigned int qid, ssize_t len) + __acquires(vq->mutex) +{ + struct vhost_virtqueue *vq = vr->vq + qid; + unsigned int cnt; + ssize_t ret; + size_t tmp; + + if (qid >= VIRTIO_RPMSG_NUM...

I am trying to have prototype perform a request and return to me a javascript object representing the json string returned by the request. I want to iterate over the contents to print each object in the json string. The value of transport.reponseText in onSuccess is what I would expect. But once I try to perform evalJSON() on this text it gives me a bunch of extra function()s when i try to iterate over the result. Why does the object contain thes...

...e random effect for code_tripnr. The offset (‘offsetter’) accounts for the haul duration and sub sampling factor. There are no extreme outliers in lat/lon. The model we try to fit is: > gamm3<-gamm(count~offset(offsetter)+s(lon,lat),random=list(code_tripnr=~1),family="poisson", niterPQL=200) Maximum number of PQL iterations: 200 iteration 1 iteration 2 Error in MEestimate(lmeSt, grps) : NA/NaN/Inf in foreign function call (arg 1) We tried several things. We added some noise to lon and lat, modelled the density instead of using a count with model offset, and we norm...

Hi all, I have a lengthy 'for' loop and for each loop I want to track the iteration number that is currently going on. For this, I have tried following: > for (i in 1:10) { + DumDat <- rnorm(1000) + cat("iteration:", i, " \n") + } iteration: 1 iteration: 2 iteration: 3 iteration: 4 iteration: 5 iteration: 6 iteration: 7 i...