Publications

Pathological prior-guided multiple instance learning for mitigating catastrophic forgetting in breast cancer whole slide image classification

By Weixi Zheng, Aoling Huang, Jingping Yuan, Haoyu Zhao, Zhou Zhao, Yongchao Xu, Thierry Géraud

2025-04-01

In Proceedings of the international conference on acoustics, speech, and signal processing

Abstract

In histopathology, intelligent diagnosis of Whole Slide Images (WSIs) is essential for automating and objectifying diagnoses, reducing the workload of pathologists. However, diagnostic models often face the challenge of forgetting previously learned data during incremental training on datasets from different sources. To address this issue, we propose a new framework PaGMIL to mitigate catastrophic forgetting in breast cancer WSI classification. Our framework introduces two key components into the common MIL model architecture. First, it leverages microscopic pathological prior to select more accurate and diverse representative patches for MIL. Secondly, it trains separate classification heads for each task and uses macroscopic pathological prior knowledge, treating the thumbnail as a prompt guide (PG) to select the appropriate classification head. We evaluate the continual learning performance of PaGMIL across several public breast cancer datasets. PaGMIL achieves a better balance between the performance of the current task and the retention of previous tasks, outperforming other continual learning methods. Our code will be open-sourced upon acceptance.

Continue reading

Performance evaluation of IoT-enabled edge computing infrastructure for mHealth services

By Hermyson Oliveira, Kédna Camboim, David Beserra, Jean Araujo

2025-04-01

In 39th international conference on advanced information networking and applications (AINA-2025)

Abstract

The rapid technological advancements and growing demand for innovative healthcare solutions highlight the critical role of integrating the Internet of Things (IoT) with mobile health (mHealth) services. This study evaluates the performance of an IoT platform within an mHealth context, focusing on the MQTT protocol’s effectiveness for healthcare data communication. Using an Orange Pi Win Plus board as the IoT platform, we simulated real-world mHealth conditions with varying workloads to assess platform resilience and scalability. Representative test scenarios were developed to simulate normal, increasing, and extreme load conditions, measuring key metrics such as CPU usage, memory consumption, throughput, and latency. Data were collected and analyzed using custom scripts to evaluate the platform’s response across different Quality of Service (QoS) levels. Results indicated that the platform could effectively manage standard and moderately high demands, while performance under extreme loads highlighted areas for optimization. This study concludes that the MQTT-based IoT platform demonstrated reliable performance in the mHealth environment, providing a basis for future optimizations and scalability improvements.

Continue reading

Performance evaluation of serverless computing infrastructure: Insights from open-source frameworks

By Antonio Carlos Sousa, David Beserra, Jean Araujo

2025-04-01

In 39th international conference on advanced information networking and applications (AINA-2025)

Abstract

Serverless computing has gained widespread adoption due to its simplified management and lightweight design, particularly when paired with container orchestration systems like Kubernetes. By enabling developers to focus on application logic without managing underlying infrastructure, serverless computing offers advantages such as runtime-based billing in millisecond units, reducing operational costs and appealing to enterprises. This study evaluates resource utilization across 24 combinations of Ubuntu and Debian operating systems with Docker and Podman container platforms under varied workloads. Results indicate that Ubuntu with Docker achieves superior efficiency in CPU and RAM usage compared to other configurations. This experimental analysis provides practical insights into hardware resource management for serverless deployments and highlights opportunities for improving infrastructure in diverse scenarios.

Continue reading

Type-checking heterogeneous sequences in a simple embeddable type system

By Jim Newton

2025-01-01

In Proceedings of 27th international symposium on practical aspects of declarative language (PADL’25)

Abstract

Heterogeneously typed sequences are supported in a wide range of programming languages, both dynamically and statically typed. These sequences often exhibit type patterns such as repetition, alternation, and optionality. The programmer needs a mechanism to declare and query adherence to this regularity. The theory of finite automata over finite alphabets was conceived for characterizing patterns in so-called regular languages, but does not exactly meet this challenge, because the set of potential elements of the sequences is infinite. In this article, we present a generalization of regular expressions called rational type expressions as a means of declaring regular patterns in heterogeneous sequences. We present procedures for constructing and manipulating symbolic finite automata, a generalization of classical finite automata, using a portable, simple, embeddable, type system. For type systems with subtyping, the subtype relation and type vacuity cannot always be computed programmatically. We provide a working, sound solution for constructing finite automata for type-based regular expressions even in cases where the subtype decidability relations is not computable retrospectively, but can be ensured by construction. We demonstrate the generality and portability of the system by providing implementations in Common Lisp, Clojure, Scala, and Python.

Continue reading

$\omega$-regular energy problems

Abstract

We show how to efficiently solve problems involving a quantitative measure, here called energy, as well as a qualitative acceptance condition, expressed as a Büchi or Parity objective, in finite weighted automata and in one-clock weighted timed automata. Solving the former problem and extracting the corresponding witness is our main contribution and is handled by a modified version of the Bellman-Ford algorithm interleaved with Couvreur’s algorithm. The latter problem is handled via a reduction to the former relying on the corner-point abstraction. All our algorithms are freely available and implemented in a tool based on the open-source platforms TChecker and Spot.

Continue reading

Bisimulations and logics for higher-dimensional automata

By Safa Zouari, Krzysztof Ziemiański, Uli Fahrenberg

2024-12-01

In Theoretical aspects of computing - ICTAC 2024 - 21st international colloquium, bangkok, thailand, november 25-29, 2024, proceedings

Abstract

Continue reading

Dense in situ underwater 3D reconstruction by aggregation of successive partial local clouds

Abstract

Assessing the completeness of an underwater 3D reconstruction on-site is crucial as it allows for rescheduling acquisitions, which capture missing data during a mission, avoiding additional costs of a subsequent mission. This assessment needs to rely on a dense point cloud since a sparse cloud lacks detail and a triangulated model can hide gaps. The challenge is to generate a dense cloud with field-deployable tools. Traditional dense reconstruction methods can take several dozen hours on low-capacity systems like laptops or embedded units. To speed up this process, we propose building the dense cloud incrementally within an SfM framework while incorporating data redundancy management to eliminate recalculations and filtering already-processed data. The method evaluates overlap area limits and computes depths by propagating the matching around SeaPoints—the keypoints we design for identifying reliable areas regardless of the quality of the processed underwater images. This produces local partial dense clouds, which are aggregated into a common frame via the SfM pipeline to produce the global dense cloud. Compared to the production of complete dense local clouds, this approach reduces the computation time by about 70 percent while maintaining a comparable final density. The underlying prospect of this work is to enable real-time completeness estimation directly on board, allowing for the dynamic re-planning of the acquisition trajectory.

Continue reading