Tootfinder

/2
En zie daar het grote verschil dat Nieuwsuur maakt vandaag. Daar een lang item over een Israëlische vrouw em een Palestijnse man die Eem paar km uit elkaar wonen..
Achteraan ook bovenstaand stukje.
De bijeenkomst werd gehouden door de Israëlische ambassade en CJO.
Zeker zolang Israel genocide pleegt is het onbestaanbaar dat Schoof zich daar vertoont.
#RodeLijn #NLpol #Gaza

Didn't realize this at the time but some time in 2020 my radio show surpassed the length of time it took for the confederacy to be established and die, now it's been more than double the amount lol

A look at US efforts to train workers for semiconductor manufacturing, led by Arizona, which has secured over 60 semiconductor expansion projects since 2020 (Nikkei Asia)
https://asia.nikkei.com/business/techn

US races to train tech workers for manufacturing, but will AI get the jobs first?
Immigration issues and China competition further complicate Trump's vision of an industrial revival

/2
Aangezien dit geen functionele data deling is (DDG blokkeert de trackers en de app functioneert al jaren zo), is het duidelijk de vraag wat het doel dan wel is.
De verbinding met de overheid zelf zal alle nodige informatie geven.
#Overheid #DigiD #Datagraaien

“The release of a second consecutive poor #JobsReport confirmed the reality that Mr. Trump has been trying to avoid. The labor market is stalling [as a result] of his agenda. The data showed the first net loss of jobs since [2020], when the pandemic was raging.”

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 23 nodes and 3197 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

🇺🇦 #NowPlaying on KEXP's #SeekAndDestroy
Powerwolf:
🎵 Werewolves of Armenia
#Powerwolf
https://powerwolf.bandcamp.com/track/werewolves-of-armenia-new-version-2020-2
https://open.spotify.com/track/13htaEMCCLphNfJbXIYz3t

2020 dwf felt very clever importing a Hong Kong model S20 so he could get the Snapdragon variant instead of the Exynos. Little did he realize 2025 dwf would be trying to install aftermarket firmware and that not being able to read Chinese characters might pose a _slight_ issue

Comment on "A Note on Over-Smoothing for Graph Neural Networks"
Razi Hasson, Reuven Guetta
https://arxiv.org/abs/2509.04178 https://arxiv.org/pdf…

Comment on "A Note on Over-Smoothing for Graph Neural Networks"
We comment on Cai and Wang (2020, arXiv:2006.13318), who analyze over-smoothing in GNNs via Dirichlet energy. We show that under mild spectral conditions (including with Leaky-ReLU), the Dirichlet energy of node embeddings decreases exponentially with depth; we further extend the result to spectral polynomial filters and provide a short proof for the Leaky-ReLU case. Experiments on edge deletion and weight amplification illustrate when Dirichlet energy increases, hinting at practical ways to re…

from my link log —
libcpu: a library to emulate several CPU architectures using LLVM.
https://github.com/libcpu/libcpu
saved 2020-04-14 https://dotat.a…

GitHub - libcpu/libcpu: "libcpu" is an open source library that emulates several CPU architectures
"libcpu" is an open source library that emulates several CPU architectures - libcpu/libcpu

Absence of eigenvalues of electromagnetic Dirac operators
Naiara Arrizabalaga, Lucrezia Cossetti, Matias Morales
https://arxiv.org/abs/2509.03627 https://a…

Absence of eigenvalues of electromagnetic Dirac operators
In this work, we develop the method of multipliers for electromagnetic Dirac operators and establish sufficient conditions on the magnetic and electric fields that guarantee the absence of point spectrum. Our results can be viewed as a generalization of those obtained by Cossetti, Fanelli and Krejčiřík (2020), which treated the purely magnetic case. We also emphasize that, in the massless case, our approach covers Coulomb-type potentials of the form $V(x) = \frac{1}{|x|} \big(ν\ma…

Localised Arrowheads: The building blocks of elastic turbulence in rectilinear, sheared polymer flows
Theo A. Lewy, Rich R. Kerswell
https://arxiv.org/abs/2509.26168 https://

Localised Arrowheads: The building blocks of elastic turbulence in rectilinear, sheared polymer flows
Pressure-driven flow of a dilute polymer solution has been numerically observed to possess a form of elastic turbulence which is organised around the interactions of localised versions of 2-dimensional `arrowhead' travelling waves (Page et al. Phys. Rev. Lett. 125, 154501, 2020). As a step to confirming this theoretically, we identify spanwise-localised arrowhead travelling waves by tracking a symmetry-breaking bifurcation of the known spanwise-invariant (2D) arrowhead to a spanwise-periodic st…

Newsmax pays $67 million to settle defamation case linked to 2020 election coverage (Maddy Lauria/NPR)
https://www.npr.org/2025/08/18/nx-s1-5506062/newsmax-pays-67-million-to-settle-defamation-case-linked-to-2020-election-coverage
http://www.memeorandum.com/250818/p60#a250818p60

The Declarative configuration journey: Why it took 5 years to ignore health check endpoints in tracing
#OpenTelemetry

Permutation closure for multiple context-free languages
Andrew Duncan, Murray Elder, Lisa Frenkel, Mengfan Lyu
https://arxiv.org/abs/2509.22239 https://arx…

Permutation closure for multiple context-free languages
We prove that the \emph{permutation closure} of a multiple context-free language is multiple context-free, which extends work of Okhotin and Sorokin [LATA 2020] who showed closure under \emph{cyclic shift}, and complements work of Brandstädt [1981, RAIRO Inform. Théor.] (resp. Brough \emph{et al.} [2016, Discrete Math. Theor. Comput. Sci.]) who showed the same result for regular, context-sensitive, recursively enumerable (resp. EDT0L and ET0L) languages. In contrast to Okhotin and Sorokin who…

I find it kinda funny that the 2020 MacBook Air—my work machine (albeit with 16 GB of RAM)—is now described as being “still capable at handling basic tasks like a champ, including streaming video, browsing, and dealing with documents.”
I haven’t noticed #Emacs slowing down, so what do people do that needs so much more computing power!?

The Trump administration wants the last four digits of every voter’s Social Security number
—as part of its sweeping efforts to compile a federal voting database
The administration could use the database to investigate claims of noncitizen voting,
an obsession of Trump and other Republicans who claimed the 2020 election had been stolen through massive voter fraud.
In reality, the only ones concocting a scheme to fake votes in that election were in Donald Trump’s camp.

In Disturbing Move, Trump’s DOJ Demands Voting Data From States
It’s part of a sweeping project led by election deniers. Voting rights advocates are alarmed.

Conservative network Newsmax agrees to pay $67M in defamation case over bogus 2020 election claims (Nicholas Riccardi/Associated Press)
https://apnews.com/article/dominion-voting-newsmax-defamation-trump-2020-3b2366dfdae3a8432afe822bf14fe1ef
http://www.memeorandum.com/250818/p70#a250818p70

Predicting Module-Lattice Reduction
L\'eo Ducas, Lynn Engelberts, Paola de Perthuis
https://arxiv.org/abs/2510.10540 https://arxiv.org/pdf/2510.10540…

Predicting Module-Lattice Reduction
Is module-lattice reduction better than unstructured lattice reduction? This question was highlighted as 'Q8' in the Kyber NIST standardization submission (Avanzi et al., 2021), as potentially affecting the concrete security of Kyber and other module-lattice-based schemes. Foundational works on module-lattice reduction (Lee, Pellet-Mary, Stehlé, and Wallet, ASIACRYPT 2019; Mukherjee and Stephens-Davidowitz, CRYPTO 2020) confirmed the existence of such module variants of LLL and block-reduction…

Perturbed Public Voices (P$^{2}$V): A Dataset for Robust Audio Deepfake Detection
Chongyang Gao, Marco Postiglione, Isabel Gortner, Sarit Kraus, V. S. Subrahmanian
https://arxiv.org/abs/2508.10949

Perturbed Public Voices (P$^{2}$V): A Dataset for Robust Audio Deepfake Detection
Current audio deepfake detectors cannot be trusted. While they excel on controlled benchmarks, they fail when tested in the real world. We introduce Perturbed Public Voices (P$^{2}$V), an IRB-approved dataset capturing three critical aspects of malicious deepfakes: (1) identity-consistent transcripts via LLMs, (2) environmental and adversarial noise, and (3) state-of-the-art voice cloning (2020-2025). Experiments reveal alarming vulnerabilities of 22 recent audio deepfake detectors: models trai…

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

On generalized disc-polygons in plane convex bodies with a higher degree of smoothness
Ferenc Fodor, D\'aniel I. Papv\'ari
https://arxiv.org/abs/2509.11702 https://

On generalized disc-polygons in plane convex bodies with a higher degree of smoothness
We prove power series expansions for the expectations of the number of vertices and missed area of random $L$-convex polygons in planar convex bodies with sufficiently smooth boundaries. Random $L$-convex polygons arise as the intersection of all translates of a fixed convex set $L$ that contain i.i.d. uniform random points from a suitable plane convex body $K$. Our results extend the asymptotic formulas proved in Fodor, Papvári and Vígh (2020) and Fodor and Montenegro (2024), and have conseq…

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
Akitoshi Kawamura, Yusuke Kobayashi
https://arxiv.org/abs/2510.06533 https://a…

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
In the covering version of the pinwheel scheduling problem, a daily task must be assigned to agents under the constraint that agent $i$ can perform the task at most once in any $a_i$-day interval. In this paper, we determine the optimal constant $α^* = 1.264\ldots {}$ such that every instance with $\sum_{i} \frac{1}{a_i} \ge α^*$ is schedulable. This resolves an open problem posed by Soejima and Kawamura (2020). Our proof combines Kawamura's (2024) techniques for the packing version with new …