Tootfinder

Pattern matching is a major feature in software development. While pattern matching applies in several locations, its current usage is limited to switch case blocks. I want to compare the power of pattern matching across a couple of programming languages I’m familiar with in this post.
https://blo…

from my link log —
RE#: high performance derivative-based regex matching with intersection, complement, and lookarounds.
https://arxiv.org/abs/2407.20479
saved 2025-04-17

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds
We present a tool and theory RE# for regular expression matching that is built on symbolic derivatives, does not use backtracking, and, in addition to the classical operators, also supports complement, intersection and lookarounds. We develop the theory formally and show that the main matching algorithm has input-linear complexity both in theory as well as experimentally. We apply thorough evaluation on popular benchmarks that show that RE# is over 71% faster than the next fastest regex engine …

"Medicina mental e medicina orgânica no jovem Foucault: considerações em torno de René Leriche" agora nos Arquivos HAL
#filosofia

QB2 matchmaker: Finding landing spots for Jameis Winston and other expendable backups as roster cuts loom

https://www.cbssports.com/nfl/news/qb2-mat

Quantum Flow Matching
Zidong Cui, Pan Zhang, Ying Tang
https://arxiv.org/abs/2508.12413 https://arxiv.org/pdf/2508.12413

Quantum Flow Matching
Flow matching has rapidly become a dominant paradigm in classical generative modeling, offering an efficient way to interpolate between two complex distributions. We extend this idea to the quantum realm and introduce Quantum Flow Matching (QFM)-a fully quantum-circuit realization that offers efficient interpolation between two density matrices. QFM offers systematic preparation of density matrices and generation of samples for accurately estimating observables, and can be realized on a quantum…

PRISM: Product Retrieval In Shopping Carts using Hybrid Matching
Arda Kabadayi, Senem Velipasalar, Jiajing Chen
https://arxiv.org/abs/2509.14985 https://ar…

PRISM: Product Retrieval In Shopping Carts using Hybrid Matching
Compared to traditional image retrieval tasks, product retrieval in retail settings is even more challenging. Products of the same type from different brands may have highly similar visual appearances, and the query image may be taken from an angle that differs significantly from view angles of the stored catalog images. Foundational models, such as CLIP and SigLIP, often struggle to distinguish these subtle but important local differences. Pixel-wise matching methods, on the other hand, are co…

ShizhenGPT: Towards Multimodal LLMs for Traditional Chinese Medicine
Junying Chen, Zhenyang Cai, Zhiheng Liu, Yunjin Yang, Rongsheng Wang, Qingying Xiao, Xiangyi Feng, Zhan Su, Jing Guo, Xiang Wan, Guangjun Yu, Haizhou Li, Benyou Wang
https://arxiv.org/abs/2508.14706

ShizhenGPT: Towards Multimodal LLMs for Traditional Chinese Medicine
Despite the success of large language models (LLMs) in various domains, their potential in Traditional Chinese Medicine (TCM) remains largely underexplored due to two critical barriers: (1) the scarcity of high-quality TCM data and (2) the inherently multimodal nature of TCM diagnostics, which involve looking, listening, smelling, and pulse-taking. These sensory-rich modalities are beyond the scope of conventional LLMs. To address these challenges, we present ShizhenGPT, the first multimodal LL…

Das Mädchen, das allein nach Haus' geht - @… - #ARD | #DasErste

Gibt es hier im Fediverse jemanden der mir erklären möchte, wie eine HLA-Typisierung mittels Lymphozytotoxischen Tests im Labor abläuft? #Knochenmark #Medizin

Quantum Pattern Matching with Wildcards
Masoud Seddighin, Saeed Seddighin
https://arxiv.org/abs/2507.13885 https://arxiv.org/pdf/2507…

Quantum Pattern Matching with Wildcards
Pattern matching is one of the fundamental problems in Computer Science. Both the classic version of the problem as well as the more sophisticated version where wildcards can also appear in the input can be solved in almost linear time $\tilde O(n)$ using the KMP algorithm and Fast Fourier Transform, respectively. In 2000, Ramesh and Vinay~\cite{ramesh2003string} give a quantum algorithm that solves classic pattern matching in sublinear time and asked whether the wildcard problem can also be so…