search for: walks

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)

When I combine separate vectors into one list, there are new names created. I'd like to change them to something more meaningful. Here are two examples using data(zelazo) from library(ISwR): > library(ISwR) > data(zelazo) > attach(zelazo) > zelazo $active [1] 9.00 9.50 9.75 10.00 13.00 9.50 $passive [1] 11.00 10.00 10.00 11.75 10.50 15.00 $none [1] 11.50 12.00 9.00

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.

...test is simply the probability that a random assignment of the pooled data to two sets of the sizes of the input data sets has a KS test statistic at least as great as that of the input data. The function psmirnov2x in ks.c calculates this probability by enumerating all such assignments as lattice walks, except that it doesn't know how to handle tied data points. The correct procedure can be deduced by considering that steps in such lattice walks represent steps along the x-axis in computing the empirical CDFs of the two data sets. The trick is to consider all occurrences of a repeated data...

> 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 breaks orthogonality in the compiler. Today, you can walk th...

Hi all, Is there a way to walk through ALL the predecessors of a basic block in a CFG. I tried to iterate over the preds using this method for (pred_iterator PI = pred_begin(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

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

...the uses. This is extremely dangerous, it would be better to abort. >> which would make it much easier to write buggy/incorrect compiler code >> and passes. > > I argued (implicitly) above that the uses of a Constant[Int/Float/...] > are really not interesting if no-one ever walks them. There is a difference between “no one ever walks them in practice” and “no one can walk them. :-) > Let's assume you > walk the uses and we "removed" the use list so there are none, what does > that mean. I'd say, nothing much. If you inspect the Value and see...

...e iterator >>>> (as in the following example) we can just keep walking to this location my >>>> changing the index of the mas and calling mas_walk()? >>> >>> no. You have to mas_set() to the value and walk from the top of the >>> tree. mas_walk() walks down, not from side to side - well, it does go >>> forward within a node (increasing offset), but if you hit the node limit >>> then you have gotten yourself in trouble. >>> >>>> This would also imply >>>> that the "outer" tree walk conti...

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