500
Reputation
2,021
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
 May9 comment Point belonging to a Disk in a Cartesian Coordinate System @Yves Klett, no this case is impossible ! May8 asked Point belonging to a Disk in a Cartesian Coordinate System May5 accepted Recursion on a moving window May5 comment Recursion on a moving window @R.M, I think I got it using the second one you posted. I just have very very weird / interesting result it seems... I will keep you posted. Many thanks for your help ! May5 revised Recursion on a moving window deleted 39 characters in body May5 comment Recursion on a moving window @R.M. Please see what I added to my question I hope it helps to clarify May5 revised Recursion on a moving window added 80 characters in body May5 comment Recursion on a moving window @R.M. What I need is a sliding window, at first the initial state then its own previous prediction. The window can have a size from 2 to 5 roughly. Many Thanks for you attention, this is driving me insane :-( May5 comment Recursion on a moving window @R.M, The problem i stat you assume the append thing is in my function whereas my function does not. I thought it was a reap and sow that I could not make work. And the worth is I cant share my functions :-(. Oh I just understood your question, I need only the last two. May5 comment Recursion on a moving window @R.M. Ok I am sorry, Now it is worth and I really dont get the ~ ~ things, I will try to be more clear and come back thank you for your time and attention. This really makes it more obscure to me : state ~Join~ {predict[state[[-n ;;]]]. My function takes a list of 2 (initial state) as argument and return one element : t3. I then want the 2 input to be t2 and predicted t3 to predict t4. May4 comment Recursion on a moving window @Mr. Wizard, i can`t think of a clearer explanation sadly. I am doing a bunch of transformation of values at t1 and t2 to predict t3 then I want to do the same bunch of computations but this time on t2 and t3.... i am sorry if it is not clear :-( May4 comment Recursion on a moving window @Mr Wizard, I guess Append[] is a bad example since it is part of the recursion I want to do ? May4 comment Recursion on a moving window @Mr.Wizard, you truly are, after 30 min I realize it does not after 10 iterations for me in what I do :-( May4 revised Recursion on a moving window deleted 191 characters in body May4 asked Recursion on a moving window May4 accepted Counting elements skipped using Reap & Sow May4 comment Counting elements skipped using Reap & Sow @Mr. Wizard, Thank You ! May4 comment Counting elements skipped using Reap & Sow thank you very much ! May3 comment Counting elements skipped using Reap & Sow Thank you for your detailed answer. I have yet not been able to obtain all the "dropped" count in between the chosen one. That is I want a list with all the selected and the corresponding list of the number of dropped value in between 2 selected ones. My attempts using "Position" suffer from possible duplicates. Any thoughts ? May3 comment Counting elements skipped using Reap & Sow @R.M. : By data compression I mean reducing a data set. trying to keep its most meaningful component. In this case I am looking at a financial time series. And I assume that movements under a certain % are irrelevant. Not worth keeping for the analysis I conduct.