Tootfinder

Fun post: Dave Farquhar, History of #overclocking
#Celeron:
> In 1998, Intel released the Celeron to compete with cheap CPUs from AMD and Cyrix. To make it, they took all of the Level 2 cache off a Pentium II, clocked it at 266 or 300 MHz, and sold it at an AMD-like price. But due to the lack of L2 cache, it was slower than a previous-generation Pentium running at 233 MHz, let alone an AMD or Cyrix chip running at 266 or 300 MHz.
>
> But the L2 cache was the Pentium II’s limiting factor in overclocking. So a 266 MHz Celeron ran happily at 400 MHz, or potentially even 450 MHz, the same speed as the fastest Pentium II at the time. It was slower than a Pentium II at the same speed, but it worked well for 3D gaming.
>
> But the only people who bought those Celerons were overclockers and people who didn’t know anything about computers. […]

Star Wars* is here, it seems...
*Ronald Reagan's, not George Lucas'
https://mastodon.online/@clarinette/114941099653299018
clarinette@mastodon.online - https://orbitaltoday.com/2025/04/09/russia-china-escalate-threats-against-starlink-with-kalinka-system/ « Kalinda System: Russia and China Target SpaceX’s Starlink in Escalating Space Conflict »

Edge-colouring and orientations: applications to degree-boundedness and $\chi$-boundedness
Arnab Char, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
https://arxiv.org/abs/2506.23054

Edge-colouring and orientations: applications to degree-boundedness and $χ$-boundedness
We prove that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. As a consequence, we deduce that some classes of graphs are degree-bounded. A class $\mathcal{G}$ is {\it degree-bounded} if, for every integer $s$, there exists $d=d(s)$ such that every graph $G\in \mathcal{G}$ either contains $K_{s,s}$ or has minimum degree at most $d$. We obtain that the following classes are degree-bounded: (i) fo…

Cluster Reconstruction in Electromagnetic Calorimeters Using Machine Learning Methods
Kalina Dimitrova, Venelin Kozhuharov, Ruslan Nastaev, Peicho Petkov
https://arxiv.org/abs/2505.24740

Cluster Reconstruction in Electromagnetic Calorimeters Using Machine Learning Methods
Machine-learning-based methods can be developed for the reconstruction of clusters in segmented detectors for high energy physics experiments. Convolutional neural networks with autoencoder architecture trained on labeled data from a simulated dataset reconstruct events by providing information about the hit point and energy of each particle that has entered the detector. The correct reconstruction of the positionand the energy of the incident particles is crucial for the accurate events recons…

Cycles Protocol: A Peer-to-Peer Electronic Clearing System
Ethan Buchman, Paolo Dini, Shoaib Ahmed, Andrew Miller, Toma\v{z} Fleischman
https://arxiv.org/abs/2507.22309 https://…

Cycles Protocol: A Peer-to-Peer Electronic Clearing System
For centuries, financial institutions have responded to liquidity challenges by forming closed, centralized clearing clubs with strict rules and membership that allow them to collaborate on using the least money to discharge the most debt. As closed clubs, much of the general public has been excluded from participation. But the vast majority of private sector actors consists of micro or small firms that are vulnerable to late payments and generally ineligible for bank loans. This low liquidity …

Kiel Munition Clearance Week: Warum Munition aus dem Meer entfernt werden muss
Nord- und Ostsee sind stark mit Munition belastet. Experten suchen auf der Munition Clearance Week in Kiel nach Lösungen, die Altlasten möglichst zu entfernen.

Cyber Attacks Detection, Prevention, and Source Localization in Digital Substation Communication using Hybrid Statistical-Deep Learning
Nicola Cibin, Bas Mulder, Herman Carstens, Peter Palensky, Alexandru \c{S}tefanov
https://arxiv.org/abs/2507.00522

Cyber Attacks Detection, Prevention, and Source Localization in Digital Substation Communication using Hybrid Statistical-Deep Learning
The digital transformation of power systems is accelerating the adoption of IEC 61850 standard. However, its communication protocols, including Sampled Values (SV), lack built-in security features such as authentication and encryption, making them vulnerable to malicious packet injection. Such cyber attacks can delay fault clearance or trigger unintended circuit breaker operations. While most existing research focuses on detecting cyber attacks in digital substations, intrusion prevention syste…

On the DP-chromatic Number of Cartesian Products of Critical Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma
https://arxiv.org/abs/2507.21421 https://

On the DP-chromatic Number of Cartesian Products of Critical Graphs
DP-coloring (also called correspondence coloring) is a well-studied generalization of list coloring introduced by Dvořák and Postle in 2015. The following sharp bound on the DP-chromatic number of the Cartesian product of graphs $G$ and $H$ is known: $χ_{DP}(G \square H) \leq \text{min}\{χ_{DP}(G) + \text{col}(H), χ_{DP}(H) + \text{col}(G) \} - 1$ where $χ_{DP}(G)$ is the DP-chromatic number of $G$ and $\text{col}(H)$ is the coloring number of $H$. We seek to understand when $χ_{DP}(G \s…

Clearingstelle Urheberrecht: Gremium für Websperren setzt künftig auf die Justiz
Die private "Clearingstelle Urheberrecht im Internet" lässt fortan jede eigene Empfehlung für DNS-Sperren von Webseiten durch Gerichte im Einzelfall prüfen.

Higher-dimensional generalization of Youngs' theorem and circular colorings
Kengo Enami, Takahiro Matsushita
https://arxiv.org/abs/2505.23562 https://

Higher-dimensional generalization of Youngs' theorem and circular colorings
In 1996, Youngs proved that any quadrangulation of the real projective plane is not 3-chromatic. This result has been extended in various directions over the years, including to other non-orientable closed surfaces, higher-dimensional analogues of quadrangulations and circular colorings. In this paper, we provide a generalization which yields some of these extensions of Youngs' theorem.