I'm trying to build a list accumulator with normalization. I've got that far (though I'm severly mathematically challenged, so please feel free to fix what I already think I've done!), but what I want to add is an optional "forget" rate. What I'd like is a slightly more stubborn version of what I already have -- one that will change more slowly over time. Make sense?
[ edit: that is, same peak of 1.0, but smoother curve... yes? ]
Here's what I've committed, thus far (need Lobjects, btw):