This is what the “☆ Save” is for.
davel [he/him]
| Pronouns | he/him |
| Datetime Format | RFC 3339 |
- 1 Post
- 28 Comments
Joined 1 year ago
Cake day: July 8th, 2023
You are not logged in. If you use a Fediverse account that is able to follow users, you can follow this user.
Brian Eno should add a new card to the Oblique Strategies deck.
2·2 months agoThat reminds me, I’ve yet to watch Stalker or read Roadside Picnic.
Back in the day I played Hack until I noticed the sun had risen many times.
Until lemmy.world upgrades to 0.9.14, the cake is a lie: Cake days are 1 day off on leap years #2441
deleted by creator
I don’t care for this Reddit holdover and might
on my cakeday.
Seven Words You Can Never Say on Television: “removed”, “removed”, “removed”, “removed”, “removed”, “removed”, and “removed”.
6·4 months agoYeah we’d also very much like to see no one instance dominating the Lemmyverse, our own in particular: What is lemmy.ml?
Lemmy.ml has always been a niche site, and it will most likely stay this way. We don’t have any intentions to turn it into a mainstream instance, or set a goal of getting as many users as possible.
I’m not sure I would characterize what Blaze said in those posts that way, posts which weren’t theirs. Perhaps you’re shooting the messenger, or perhaps I’d need to re-read them.
This comment is pretty funny though:
LW is already much more active than lemmy.ml (18k monthly active users vs 2.5k: https://fedidb.org/software/lemmy/), so the system is working, people have left for a less politically biased instance
Apparently the neoliberalism of the imperial core is less politically biased 🤷 A real fish don’t know they’re in water moment.
This shit is bananas
B-🍌-N-🍌-N-🍌-S
For the moment at least. Whatever problem we had before, it seemed to get worse over time, eventually requiring a restart. So we’ll have to wait and see.
High praise indeed!
Variyam co-develops innovative new data analysis algorithmThe authors presented their new algorithm at the 2022 European Symposium on Algorithms, a premier international conference on algorithm design. Since then, their discovery has been gaining recognition and praise from computer scientists across the field, including world-renowned computer scientist Donald Knuth, author of “The Art of Computer Programming,” who is often referred to as "the father of the analysis of algorithms.”
In May 2023, Knuth published his own paper on the algorithm, “The CVM Algorithm for Estimating Distinct Elements in Streams [PDF],” offering extensive praise and even naming it the CVM algorithm in honor of its inventors. Knuth said in addition to “explaining the ideas to just about everybody [he] meets,” he expects the algorithm to become a foundational aspect of computer science in the near future.
"Their algorithm is not only interesting; it is extremely simple,” Knuth said in the paper. “It’s wonderfully suited to teaching students who are learning the basics of computer science. I’m pretty sure that something like this will eventually become a standard textbook topic.”
As Knuth predicted and Variyam hoped, the algorithm has already found a place in computer science courses.
From Knuth’s paper:
Algorithm D (Distinct element estimation). Given an arbitrary data stream A = (a1, a2, . . . , am) and a buffer size s ≥ 1 as described above, this algorithm returns an unbiased estimate of |A| = |{a1, a2, . . . , am}|. It uses a buffer B that’s capable of holding up to s ordered pairs (a, u), where a is an element of the stream and u is a real number, 0 ≤ u < 1.
D1. [Initialize.] Set t ← 0, p ← 1, and B ← ∅.
D2. [Done?] Terminate if t = m, returning the estimate |B|/p.
D3. [Input a.] Set t ← t + 1 and a ← at, the next element of the stream.
D4. [Remove a from B.] If B contains the pair (a, u), for any u, delete it.
D5. [Maybe put a in B.] Let u be a uniform deviate, independent of all others (namely a random real number in the range 0 ≤ u < 1). If u ≥ p, go back to step D2. Otherwise, if |B| < s, insert (a, u) into B and go back to step D2.
D6. [Maybe swap a into B.] (At this point u < p and |B| = s.) Let (a’, u’) be the element of B for which u’ is maximum. If u > u’, set p ← u. Otherwise replace (a’, u’) in B by (a, u) and set p ← u’. Then go back to step D2.
Final CVM Algorithm Code in a JavaScript “oneliner”
You can use this JS function by providing any text string as input, and it will simulate the described algorithm, returning the final set of unique words. This is as condensed as it can get, but if you can condese it more , please do post and Ill update it! If you are interested in seeing how this ‘oneliner’ started, before it was condensed, I have included the long form version of this same code at the bottom of the article.
const cvmAlgorithm = t => { const f = n => !(Math.random() * (1 << n) | 0); const w = t.match(/\b\w+\b/g) || []; let r = 1, u = new Set(); for (let i of w.map(x => x.toLowerCase())) u.size < 100 ? u.add(i) : f(r) && u.delete(i), u.size >= 100 && r++, u.size > 50 && (u = new Set([...u].filter(() => f(r)))); return [...u]; }; // Example usage: const text = "To be, or not to be, that is the question..."; const finalWords = cvmAlgorithm(text); console.log(finalWords); // [ 'to', 'be', 'or', 'not', 'that', 'is', 'the', 'question' ]
It’s an old South Park meme https://www.youtube.com/watch?v=iH3K2rkkU7g
I misread OP: they’re talking about comment sorting, not to be confused with post sorting.
deleted by creator
It’s a game about navigating the mission of publishing “all the news that’s fit to print” when your key demographic may not want to hear that news, or may want it softened or ideologically slanted for their comfort.
Yeah that’s not really what NYT editor Joseph Kahn or any of the other members of the Council of Foreign Relations are trying to do.
Wut. The reason we’re talking about it at all is because it’s a success, not a flop.