search for: walking

Hi again, puppetd started to hang with 100% CPU usage all of the sudden. Strace just keeps repeating these 2 lines: --- SIGVTALRM (Virtual timer expired) @ 0 (0) --- sigreturn() = ? (mask now []) In logs it hangs with this message: debug: Calling fileserver.describe But lots of these fileserver.describe calls prior to hang are successful. If I run it with puppetd

Hi I have a set of data with both quantitative and categorical predictors. After scaling of response variable, i looked for multicollinearity (VIF values) among the predictors and removed the predictors who were hinding some of the other significant predictors. I'm curious to know whether the predictors (who are not significant) while doing simple 'lm' will be involved in

libswfdec-gtk/swfdec_gtk_player.c | 1 libswfdec/swfdec_as_date.c | 7 libswfdec/swfdec_audio.c | 10 libswfdec/swfdec_audio_event.c | 2 libswfdec/swfdec_button_movie.c | 2 libswfdec/swfdec_interval.c | 14 libswfdec/swfdec_key_as.c | 6 libswfdec/swfdec_mouse_as.c | 8 libswfdec/swfdec_movie.c |

Hi I have a set of data with both quantitative and categorical predictors. After scaling of response variable, i looked for multicollinearity (VIF values) among the predictors and removed the predictors who were hinding some of the other significant predictors. I'm curious to know whether the predictors (who are not significant) while doing simple 'lm' will be involved in

hi all how does one simulate a random walk process? i.e y(0)=0 y(t)=y(t-1)+ e(t) where e(t) is normal(0,1) say. Regards allan

libswfdec/swfdec_sprite_movie.c | 33 +++++++++++++++++++++++++++++++-- player/swfplay.c | 6 +++++- 2 files changed, 36 insertions(+), 3 deletions(-) New commits: diff-tree 361082fdf6ede11a08266193ca00247490121f6e (from parents) Merge: 906a2ce832b317cdb0d5cd6fefe01fe17a676cd0 adebed995585fa9f993062a75df17ff464113e93 Author: Benjamin Otte <otte at gnome.org> Date: Wed

I've wrote some code to simulate a random walk in 2 dimensions on a lattice. Basically I want to add something in to make it plot it point by point so you can see what is going on. Heres my code for the random walk in 2d RW2D<-function(N) { i<-0 xdir<-0 ydir<-0 xpos<-vector() xpos[1]<-xdir ypos<-vector() ypos[1]<-ydir for (i in 1:N-1)

....8w [1] 13.25 11.50 12.00 13.50 11.50 > walk <- stack(list("active"=active, "passive"=passive, "none"=none, "ctr.8w"=ctr.8w)) > walk values ind 1 9.00 active [...rows deleted...] 23 11.50 ctr.8w I want to name the first column "walking" and the second column "training". How do I do this? Here is a second example: > walk2 <- data.frame(c(active, passive, none, ctr.8w), c(rep(1:4, c(length(active), length(passive), length(none), length(ctr.8w))))) > walk2 c.active..passive..none..ctr.8w. 1...

hello R-masters. i have an R-issue here that i don't know if you'd wish to help me? about it: briefly i'd like to generate many (say hundred) realizations of a random walk, execute a few operations on each of them (mean time of return), and graph each realization on the same plot. IN OTHER WORDS I'D LIKE TO IMPOSE A LOOPING CYCLE TO THE COMMAND NOT THE ARGUMENT OF THE COMMAND.

I know little of statistics and have created this function out of intuition. But since this algorithm is so basic I wonder what is the proper name of this function and is it build in R. here is some code in PHP to illustrate what the function is doing, it uses some function I created but the meaning is obvious: #get csv file and interchange rows with columns to get two arrays $csv =

Hi all, Can anyone please tell me how to calculate the expected distance covered in a 2d random walk. Please! -- View this message in context: http://r.789695.n4.nabble.com/2d-rndom-walk-tp3632468p3632468.html Sent from the R help mailing list archive at Nabble.com.

Full_Name: Thomas Waterhouse Version: 2.9.1 OS: OS X 10.5.7 Submission from: (NULL) (216.239.45.4) ks.test uses a biased approximation to the p-value in the case of the two-sample test with ties in the pooled data. This has been justified in R in the past by the argument that the KS test assumes a continuous distribution. But the two-sample test can be extended to arbitrary distributions by a

> On Mar 25, 2020, at 12:52 AM, Doerfert, Johannes <jdoerfert at anl.gov> wrote: > > > Some random thoughts: > > If no pass ever walks the use list of a constant, except globals which > we could handle differently, we could get rid of their use-list or > overwrite their use-list interface functions to make them no-ops. This would be really problematic because it

...in(BB), E = pred_end(BB); PI != E; ++I) { BasicBlock *PredBB = *PI; } but this only gives the immediate predecessors for a basic block. For example, in this sample control flow graph. entry -> bb1 -> bb2 -> bb4 -> return | | bb3 <-| walking over the predecessors for bb2 only gives bb3 and bb1.. while i need something like bb3 bb1 and return (i.e. walking till the root of the CFG) Any Ideas ? Regards Prabhat

libswfdec/swfdec_as_date.c | 16 ++-- libswfdec/swfdec_as_interpret.c | 146 ++++++++++++++++++++++++++++++++++++++-- libswfdec/swfdec_movie.c | 43 +++++++---- libswfdec/swfdec_movie.h | 2 libswfdec/swfdec_sprite_movie.c | 37 ---------- 5 files changed, 179 insertions(+), 65 deletions(-) New commits: diff-tree 89d295a9455fead858e48ffcae0cc5808d72ee22 (from

libswfdec/swfdec_button_movie.c | 9 +++++++- libswfdec/swfdec_movie.c | 1 libswfdec/swfdec_player.c | 2 - vivified/core/vivi_application.c | 4 +++ vivified/core/vivi_initialize.as | 1 vivified/core/vivi_player_as.c | 25 ++++++++++++++++++++++++ vivified/dock/vivi_vdock.c | 2 - vivified/ui/Makefile.am | 1 vivified/ui/main.c

On Mar 25, 2020, at 4:14 PM, Doerfert, Johannes <jdoerfert at anl.gov> wrote: > >> Today, you can walk the use-list of any operand to an instruction. >> This would be broken by this change, > > First, you would be able to walk the use-list of any operand. So nothing > breaks just yet. If I understand correctly, you are suggesting that you can walk it, but you don’t

...gt;> On 3/2/23 03:38, Liam R. Howlett wrote: >>> * Danilo Krummrich <dakr at redhat.com> [230227 08:17]: >>> >>> ... >>>>>> Would this variant be significantly more efficient? >>>>> >>>>> Well, what you are doing is walking the tree to see if there's anything >>>>> there... then re-walking the tree to store it. So, yes, it's much more >>>>> efficient.. However, writing is heavier. How much of the time is spent >>>>> walking vs writing depends on the size of the t...

libswfdec/swfdec_debugger.c | 48 ++++ libswfdec/swfdec_debugger.h | 3 libswfdec/swfdec_event.c | 6 libswfdec/swfdec_js_movie.c | 62 +++++- libswfdec/swfdec_movie.c | 60 ++++- libswfdec/swfdec_movie.h | 6 libswfdec/swfdec_net_stream.c | 4 libswfdec/swfdec_player.c | 44 ++--

configure.ac | 14 + libswfdec-gtk/Makefile.am | 1 libswfdec-gtk/swfdec_playback_oss.c | 265 ++++++++++++++++++++++++++++++++++++ 3 files changed, 277 insertions(+), 3 deletions(-) New commits: diff-tree 6e644576c0bac40f193b31935946738a143c3c7a (from c45ceb30a4a9c438c89423e277d8684b2e66c65c) Author: Eric Anholt <eric at anholt.net> Date: Sun Jul