Real RGB? Does this mean we can now control the color?
That’s right, check out https://lemmy.world/post/3287635 for some pics.
I was confused about the engraving but I like your idea to ask for “no engraving” as the option. Only the first 30 get a custom one so maybe everyone else will have the logo engraving.
Olight Obulb looks good for kids. Max 55 lumens and sustains close to that for 3 hours (review), waterproof and with a kid-friendly appearance. $20 on amazon currently.
These don’t provide much illumination but the Niteize rechargeable glow sticks are good kid lights too.
replaceable
This is a big part of why I like Convoy, they’re relatively inexpensive enough to have a few backups for the inevitable ones that get lost.
This data structure uses a 2-dimensional array to store data, documented in this scala implementation: https://github.com/twitter/algebird/blob/develop/algebird-core/src/main/scala/com/twitter/algebird/CountMinSketch.scala. I’m still trying to understand it as well.
Similar to your idea, I had thought that by using k bloom filters, each with their own hash function and bit array, one could store an approximate count up to k for each key, which also might be wasteful or a naïve solution.
PDF link: http://www.eecs.harvard.edu/~michaelm/CS222/countmin.pdf
ts12
Late reply but now I realize they should have just made a 14500 version of the ts11, even without aux sft40 or W1 would have been neat with this host.
Been looking for a primary source but the manual doesn’t specifically mention candle mode, only tactical strobe
- Tactical strobe Disorienting strobe light. Can be used to irritate people. Speed is configurable, and the duty cycle is always 33%. Be careful about heat in this mode, if using it for a long time.
And then other places people mention this also applies to candle mode (like this BLF post).
Thanks for these!
I haven’t used them in Spark directly but here’s how they are used for computing sparse joins in a similar data processing framework:
Let’s say you want to join some data “tables” A and B. When B has many more unique keys than are present in A, computing “A inner join B” would require lots of shuffling if B, including those extra keys.
Knowing this, you can add a step before the join to compute a bloom filter of the keys in A, then apply the filter to B. Now the join from A to B-filtered only considers relevant keys from B, hopefully now with much less total computation than the original join.
Collage sounds really interesting , will check it out. Another variation on bloom filter I recently learned about is count-min-sketch. It allows for storing/incrementing a count along with each key, and can answer “probably in set with count greater than _”, “definitely not in set”.
Thanks for adding more detail on the DB use-cases!
A more focused throw channel with the same color temperature as the flood channel would be great.
Sft-70 is 6 volt right? Otherwise this would seem like the perfect spot for an sft-40 3000k.
Well yes, but this is an internet forum for flashlights. That’s pretty weird too.
Oh sorry I mixed that up, the Wurkkos rep called it “bead-blasted” but that sounds more like stonewashed than brushed.
There were also some alternate finishes for the previews, maybe one will make it into production.