156 reputation
7
bio website
location Colorado Springs, CO
age
visits member for 2 years, 2 months
seen Nov 11 at 23:51

Aug
31
awarded  Popular Question
Aug
20
asked Gradient Filter Function
Jul
20
comment Plot Legends and Frame Ticks in Array Plots
Interesting, I wonder why it affects the frame ticks?
Jul
20
asked Plot Legends and Frame Ticks in Array Plots
Jul
2
awarded  Curious
May
31
accepted Function that is a good fit to the plot made with SmoothHistogram
May
30
comment Function that is a good fit to the plot made with SmoothHistogram
What is an actual function though? For instance, it looks like I could fit a polynomial to this curve. I want to know the actual best fitting function, not just recreate the plot via some other means.
May
29
asked Function that is a good fit to the plot made with SmoothHistogram
May
26
accepted Replacing High Densities of 1.s in Very Large Binary Arrays
May
24
comment Replacing High Densities of 1.s in Very Large Binary Arrays
It does appear to accomplish what I originally intended. What if the "chunk" were to move one increment at a time versus an entire "chunk" size at a time? That way, any given "chunk" in the data would never exceed "lim".
May
24
comment Replacing High Densities of 1.s in Very Large Binary Arrays
I like the idea of the window moving one increment at a time versus moving the entire length of the window each time. By having it moving one increment at a time it guarantees that there will never be more than "threshold" 1s in any given "bandwidth".
May
23
comment Replacing High Densities of 1.s in Very Large Binary Arrays
If the window is 3 and my max density say 2 or more and I am moving the window 3 indices at a time then the result would be {0,0,0,0,0,0,0,0,0,1,0,0}.
May
23
comment Replacing High Densities of 1.s in Very Large Binary Arrays
I like the moving window idea. However, I think you have what I am trying to do backwards. If the density is too high (meaning that if there are too many 1s close together in a given region), I want to make everything zero. I want less ones, not more 1s.
May
23
revised Replacing High Densities of 1.s in Very Large Binary Arrays
added 1361 characters in body
May
23
comment Replacing High Densities of 1.s in Very Large Binary Arrays
No, not quite. I think it is my fault for not being clear enough. Let me revise my posting and give a small scale example.
May
23
asked Replacing High Densities of 1.s in Very Large Binary Arrays
May
22
comment Replacing Patterns In a List of Varying Length
@rasher I think I may just start a new question...
May
22
comment Replacing Patterns In a List of Varying Length
Thanks guys. This has been very helpful. It is very fast and doing exactly what I had originally intended. Unfortunately, it has led me to another problem that is very similar to this one. What I am finding is that just looking for a minimum number of 1s in a row isn't good enough. I am trying to carve out areas in my data where there is a high density of 1s without completely zeroing out everything. This means that there could be some 0s sprinkled in randomly that break up the pattern and I still want that area zeroed out. I would think this requires an entirely different approach?
May
21
comment Replacing Patterns In a List of Varying Length
This method appears to work with the test data above. However, when I use data on the order of {792001,111}, for some reason it doesn't work anymore. For some reason it yielded {792001,104} array and it didn't replace any patterns of 1 to 0.
May
21
awarded  Editor