Tootfinder

TeraNoC: A Multi-Channel 32-bit Fine-Grained, Hybrid Mesh-Crossbar NoC for Efficient Scale-up of 1000 Core Shared-L1-Memory Clusters
Yichao Zhang, Zexin Fu, Tim Fischer, Yinrong Li, Marco Bertuletti, Luca Benini
https://arxiv.org/abs/2508.02446

TeraNoC: A Multi-Channel 32-bit Fine-Grained, Hybrid Mesh-Crossbar NoC for Efficient Scale-up of 1000+ Core Shared-L1-Memory Clusters
A key challenge in on-chip interconnect design is to scale up bandwidth while maintaining low latency and high area efficiency. 2D-meshes scale with low wiring area and congestion overhead; however, their end-to-end latency increases with the number of hops, making them unsuitable for latency-sensitive core-to-L1-memory access. On the other hand, crossbars offer low latency, but their routing complexity grows quadratically with the number of I/Os, requiring large physical routing resources and …

Weekend Reads
* URI redirection patterns https://arxiv.org/abs/2507.22019
* AI and college grad jobs https://www.

Not Here, Go There: Analyzing Redirection Patterns on the Web
URI redirections are integral to web management, supporting structural changes, SEO optimization, and security. However, their complexities affect usability, SEO performance, and digital preservation. This study analyzed 11 million unique redirecting URIs, following redirections up to 10 hops per URI, to uncover patterns and implications of redirection practices. Our findings revealed that 50% of the URIs terminated successfully, while 50% resulted in errors, including 0.06% exceeding 10 hops. …

This is how we celebrate the 4th of July here in Aotearoa... With an Ōtautahi-brewed America Pale Ale, and gratitude that we took the precaution of drifting to the other end of the earth over the last few hundred million years.

The Situation: Hopscotch is Now Illegal on D.C. Sidewalks | Lawfare #Fascism

Reducing Shortcut and Hopset Constructions to Shallow Graphs
Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
https://arxiv.org/abs/2508.20302 https://

Reducing Shortcut and Hopset Constructions to Shallow Graphs
We introduce a blackbox framework that simplifies all known parallel algorithms with near-linear work for single-source reachability and shortest paths in directed graphs. Specifically, existing reachability algorithms rely on constructing shortcuts; our blackbox allows these algorithms that construct shortcuts with hopbound $h$ to assume the input graph $G$ is ``shallow'', meaning if vertex $s$ can reach vertex $t$, it can do so in approximately $h$ hops. This assumption significantly simplifi…

Calculations of current in the cotunneling regime using Lindblad equations
Kian Maleki, Michael E. Flatt\'e
https://arxiv.org/abs/2509.01003 https://ar…

Calculations of current in the cotunneling regime using Lindblad equations
Transport through zero-dimensional states in a tunneling barrier can occur via co-tunneling, wherein a carrier occupying a state outside the range of energies between the chemical potentials of the two leads hops to a lead, and within the brief time permitted by the energy-time uncertainty relationship the occupancy is replenished from the other lead. Here, we calculate the current in such junctions using a Lindblad formalism within the Markovian approximation. We consider transport in the Coul…

Not Here, Go There: Analyzing Redirection Patterns on the Web
Kritika Garg, Sawood Alam, Dietrich Ayala, Michele C. Weigle, Michael L. Nelson
https://arxiv.org/abs/2507.22019 ht…

Not Here, Go There: Analyzing Redirection Patterns on the Web
URI redirections are integral to web management, supporting structural changes, SEO optimization, and security. However, their complexities affect usability, SEO performance, and digital preservation. This study analyzed 11 million unique redirecting URIs, following redirections up to 10 hops per URI, to uncover patterns and implications of redirection practices. Our findings revealed that 50% of the URIs terminated successfully, while 50% resulted in errors, including 0.06% exceeding 10 hops. …

HOPSO: A Robust Classical Optimizer for VQE
Ijaz Ahamed Mohammad, Yury Chernyak, Martin Plesch
https://arxiv.org/abs/2508.13651 https://arxiv.org/pdf/2508.…

HOPSO: A Robust Classical Optimizer for VQE
Variational Quantum Eigensolver (VQE) algorithm is one of few approaches where the hope for near-term quantum advantage concentrates. However, they face challenges connected with measurement stochastic noise, barren plateaus, and optimization difficulties in periodic parameter spaces. While most of the efforts concentrates on optimizing the quantum part of the procedure, here we aim to enhance the classical optimization by utilizing a modified version of Harmonic Oscillator-based Particle Swarm…

Replaced article(s) found for physics.chem-ph. https://arxiv.org/list/physics.chem-ph/new
[1/1]:
- A coupled-trajectory approach for decoherence, frustrated hops and internal consistency in surfac...
Lea M. Ibele, Eduarda Sangiogo Gil, Peter Sch\"urger, Rodrigue Noc, …

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
Michael Elkin, Chhaya Trehan
https://arxiv.org/abs/2507.13470

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
Given an $n$-vertex $m$-edge digraph $G = (V,E)$ and a subset $S \subseteq V$ of $|S| = n^σ$ (for some $0 \le σ\le 1$) designated sources, the $S \times V$ reachability problem is to compute the sets $\mathcal V_s$ of vertices reachable from $s$, for every $s \in S$. Naive centralized algorithms run BFS/DFS from each source in $O(m \cdot n^σ)$ time or compute $G$'s transitive closure in $\hat O(n^ω)$ time, where $ω\le 2.371552\ldots$ is the matrix multiplication exponent. Thus, t…