SearcharxivSearch

arXiv subjects

Diogo Pires

Publications and source records attributed to Diogo Pires.

3 recordsLinked to original sources

Retrieval-Augmented Generation Assistant for Anatomical Pathology Laboratories

Accurate and efficient access to laboratory protocols is essential in Anatomical Pathology (AP), where up to 70% of medical decisions depend on laboratory diagnoses. However, static documentation such as printed manuals or PDFs is often outdated, fragmented, and difficult to search, creating risks of workflow errors and diagnostic delays. This study proposes and evaluates a Retrieval-Augmented Generation (RAG) assistant tailored to AP laboratories, designed to provide technicians with context-grounded answers to protocol-related queries. We curated a novel corpus of 99 AP protocols from a Portuguese healthcare institution and constructed 323 question-answer pairs for systematic evaluation. Ten experiments were conducted, varying chunking strategies, retrieval methods, and embedding models. Performance was assessed using the RAGAS framework (faithfulness, answer relevance, context recall) alongside top-k retrieval metrics. Results show that recursive chunking and hybrid retrieval delivered the strongest baseline performance. Incorporating a biomedical-specific embedding model (MedEmbed) further improved answer relevance (0.74), faithfulness (0.70), and context recall (0.77), showing the importance of domain-specialised embeddings. Top-k analysis revealed that retrieving a single top-ranked chunk (k=1) maximized efficiency and accuracy, reflecting the modular structure of AP protocols. These findings highlight critical design considerations for deploying RAG systems in healthcare and demonstrate their potential to transform static documentation into dynamic, reliable knowledge assistants, thus improving laboratory workflow efficiency and supporting patient safety.

cs.IR

A Digital Quantum Algorithm for Jet Clustering in High-Energy Physics

Experimental High-Energy Physics (HEP), especially the Large Hadron Collider (LHC) programme at the European Organization for Nuclear Research (CERN), is one of the most computationally intensive activities in the world. This demand is set to increase significantly with the upcoming High-Luminosity LHC (HL-LHC), and even more in future machines, such as the Future Circular Collider (FCC). As a consequence, event reconstruction, and in particular jet clustering, is bound to become an even more daunting problem, thus challenging present day computing resources. In this work, we present the first digital quantum algorithm to tackle jet clustering, opening the way for digital quantum processors to address this challenging problem. Furthermore, we show that, at present and future collider energies, our algorithm has comparable, yet generally lower complexity relative to the classical state-of-the-art $k_t$ clustering algorithm.

physics.data-an

Adiabatic Quantum Algorithm for Multijet Clustering in High Energy Physics

The currently predicted increase in computational demand for the upcoming High-Luminosity Large Hadron Collider (HL-LHC) event reconstruction, and in particular jet clustering, is bound to challenge present day computing resources, becoming an even more complex combinatorial problem. In this paper, we show that quantum annealing can tackle dijet event clustering by introducing a novel quantum annealing binary clustering algorithm. The benchmarked efficiency is of the order of $96\%$, thus yielding substantial improvements over the current quantum state-of-the-art. Additionally, we also show how to generalize the proposed objective function into a more versatile form, capable of solving the clustering problem in multijet events.

hep-ex