Tootfinder

So, some updates regarding the Consumer Action Taskforce wiki
1. Now called the Consumer Rights Wiki (CRW)
2. I am now a moderator on the wiki!
3. If you want to help assist in making new articles but need inspiration to get started, I just created with the assistance of the wiki staff a new page, a backlog of incidents to handle on the wiki

Minimal Per-Flow Backlog Bounds at an Aggregate FIFO Server under Piecewise-Linear Arrival Curves
Lukas Wildberger, Anja Hamscher, Jens B. Schmitt
https://arxiv.org/abs/2506.16914

Minimal Per-Flow Backlog Bounds at an Aggregate FIFO Server under Piecewise-Linear Arrival Curves
Network Calculus (NC) is a versatile methodology based on min-plus algebra to derive worst-case per-flow performance bounds in networked systems with many concurrent flows. In particular, NC can analyze many scheduling disciplines; yet, somewhat surprisingly, an aggregate FIFO server is a notoriously hard case due to its min-plus non-linearity. A resort is to represent the FIFO residual service by a family of functions with a free parameter instead of just a single curve. For simple token-bucke…

While stuck in Ilulissat I have tried to deal with the email backlog (again). But they come in way faster than I can deal with them.
I love the idea of inbox 0 but would literally achieve nothing else if I practiced it, and work would be very boring.
Anyone have suggestions for good systems that work for overwhelming numbers of emails?
I receive around 50-60 a day, at least half of them need me to do something, often something substantial so they're not just for info. #LifeOfAScientist #Emails #EmailEttiquette

#GitHub #Copilot coding agent in public preview
https://github.blog/changelog/2025-…

Finite-Time Information-Theoretic Bounds in Queueing Control
Yujie Liu, Vincent Y. F. Tan, Yunbei Xu
https://arxiv.org/abs/2506.18278 https://

Finite-Time Information-Theoretic Bounds in Queueing Control
We establish the first finite-time information-theoretic lower bounds-and derive new policies that achieve them-for the total queue length in scheduling problems over stochastic processing networks with both adversarial and stochastic arrivals. Prior analyses of MaxWeight guarantee only stability and asymptotic optimality in heavy traffic; we prove that, at finite horizons, MaxWeight can incur strictly larger backlog by problem-dependent factors which we identify. Our main innovations are 1) a …

Taiichi Ohno: I wrote about how items waiting in a queue are a form of waste, as a cautionary tale
Scrum guys coming up with the backlog: we have created the work queue from the classic manual "Don't Create A Work Queue"

I don't want to gatekeep, so I'll just say that Chelan, WA is a gem and a perfect place to spend a weekend. This was taken a few weeks ago at Endless Orchard Cider.
(I've been better about taking photos than posting them lately, so I'm working through a backlog from the last few months.)

Evaluating Large Language Models on Non-Code Software Engineering Tasks
Fabian C. Pe\~na, Steffen Herbold
https://arxiv.org/abs/2506.10833 https://

Evaluating Large Language Models on Non-Code Software Engineering Tasks
Large Language Models (LLMs) have demonstrated remarkable capabilities in code understanding and generation; however, their effectiveness on non-code Software Engineering (SE) tasks remains underexplored. We present the first comprehensive benchmark, which we name `Software Engineering Language Understanding' (SELU), for evaluating LLMs on 17 non-code tasks, spanning from identifying whether a requirement is functional or non-functional to estimating the effort and complexity of backlog items. …

Hurray this #intellij issue finally transitioned into their backlog after 6 years!
https://youtrack.jetbrains.com/issue/IJPL-63668
This would solve several issues I have…