Tootfinder

eye2vec: Learning Distributed Representations of Eye Movement for Program Comprehension Analysis
Haruhiko Yoshioka, Kazumasa Shimari, Hidetake Uwano, Kenichi Matsumoto
https://arxiv.org/abs/2510.11722 …

eye2vec: Learning Distributed Representations of Eye Movement for Program Comprehension Analysis
This paper presents eye2vec, an infrastructure for analyzing software developers' eye movements while reading source code. In common eye-tracking studies in program comprehension, researchers must preselect analysis targets such as control flow or syntactic elements, and then develop analysis methods to extract appropriate metrics from the fixation for source code. Here, researchers can define various levels of AOIs like words, lines, or code blocks, and the difference leads to different result…

Guten Morgen,
jouh...was soll ich sagen, wird sicher ein nicht einfacher Tag mit vielen IT-Tickets. Vor Weihnachten hat nämlich keiner mehr Urlaub und alle sind in der letzten Phase so produktiv, wie sie es sonst das ganze Jahr über nicht sind 😱.
Ja, das spürt der IT Support, Heidewitzka, da kommen Themen auf den Tisch! 🙈 🙈 🙈
Augen zu und durch! Bald kommt der Nikolaus und versßt auch den Großen die Arbeit.
Schönen Dienstag! :coffeepot: 😅

🇺🇦 #NowPlaying on KEXP's #AfternoonShow
fish narc:
🎵 my ceiling
#fishnarc
https://audiotree.bandcamp.com/track/my-ceiling
https://open.spotify.com/track/0hHt5h6tqKWKoZN6RGXZiD

#FridayDisco #AusGründen
https://youtu.be/Uz-htW9DTus?si=iwXIlFCtjCsDAYoz

🇺🇦 #NowPlaying on KEXP's #MiddayShow
The Smashing Pumpkins:
🎵 1979
#TheSmashingPumpkins
https://soundwavesofficial.bandcamp.com/album/the-smashing-pumpkins-1979-layer-by-layer
https://open.spotify.com/track/3h5zik31hTTat9jmpCZZNC

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
Katsuhiko Hayashi, Hidetaka Kamigaito
https://arxiv.org/abs/2509.22598 https://…

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
We prove that all standard subregular language classes are linearly separable when represented by their deciding predicates. This establishes finite observability and guarantees learnability with simple linear models. Synthetic experiments confirm perfect separability under noise-free conditions, while real-data experiments on English morphology show that learned features align with well-known linguistic constraints. These results demonstrate that the subregular hierarchy provides a rigorous an…

Turbulent Magnetic Fields and Molecular Cloud Interactions in the Supernova Remnant G1.9 0.3
Moeri Tao, Takaaki Tanaka, Hidetoshi Sano, Rami Z. E. Alsaberi, Jun Kataoka
https://arxiv.org/abs/2509.25833

Turbulent Magnetic Fields and Molecular Cloud Interactions in the Supernova Remnant G1.9+0.3
We present on results of a spatially resolved spectral analysis of G1.9+0.3, the youngest known supernova remnant in the Galaxy. The X-ray spectra are well described by synchrotron emission from a power-law electron distribution with an exponential cutoff. We found a cutoff energy $ε_0 \sim 1 ~ \rm{keV}$ in both the radio bright rim and the X-ray bright rims. In the loss-limited case, the cutoff energy depends on the shock velocity $v_{\rm{sh}}$ and the Bohm factor $η$, following the relation…

Crosslisted article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[3/7]:
- Decoding Uncertainty: The Impact of Decoding Strategies for Uncertainty Estimation in Large Langu...
Wataru Hashimoto, Hidetaka Kamigaito, Taro Watanabe

Shift Parallelism: Low-Latency, High-Throughput LLM Inference for Dynamic Workloads
Mert Hidayetoglu, Aurick Qiao, Michael Wyatt, Jeff Rasley, Yuxiong He, Samyam Rajbhandari
https://arxiv.org/abs/2509.16495

Shift Parallelism: Low-Latency, High-Throughput LLM Inference for Dynamic Workloads
Efficient parallelism is necessary for achieving low-latency, high-throughput inference with large language models (LLMs). Tensor parallelism (TP) is the state-of-the-art method for reducing LLM response latency, however GPU communications reduces combined token throughput. On the other hand, data parallelism (DP) obtains a higher throughput yet is slow in response latency. Best of both worlds does not exist, and it is not possible to combine TP and DP because of the KV cache variance across th…

🇺🇦 #NowPlaying on KEXP's #Expansions
Rhyw:
🎵 It Was All Happening
#Rhyw
https://rhyw.bandcamp.com/track/it-was-all-happening
https://open.spotify.com/track/2HDuD93jDVidvXsNzNNBKJ