1 code implementation • 1 Jun 2025 • Dania Herzalla, Willian T. Lunardi, Martin Andreoni
Graph-based learning has emerged as a transformative approach for modeling complex relationships across diverse domains, yet its potential in wireless security remains largely unexplored.
1 code implementation • 30 May 2025 • Matthew Hull, Haoyang Yang, Pratham Mehta, Mansi Phute, Aeree Cho, Haoran Wang, Matthew Lau, Wenke Lee, Willian T. Lunardi, Martin Andreoni, Polo Chau
With 3D Gaussian Splatting (3DGS) being increasingly used in safety-critical applications, how can an adversary manipulate the scene to cause harm?
no code implementations • 9 Jan 2025 • Willian T. Lunardi, Abdulrahman Banabila, Dania Herzalla, Martin Andreoni
We address these limitations by proposing a contrastive pretext task for anomaly detection that enforces three key properties: (1) compact ID clustering to reduce intra-class variance, (2) inlier-outlier separation to enhance inter-class separation, and (3) outlier-outlier separation to maintain diversity among synthetic outliers and prevent representation collapse.
no code implementations • 8 Jul 2024 • Matthew Lau, Haoran Wang, Alec Helbling, Matthew Hul, Shengyun Peng, Martin Andreoni, Willian T. Lunardi, Wenke Lee
The robustness of machine learning models has been questioned by the existence of adversarial examples.
no code implementations • 14 Sep 2023 • Dania Herzalla, Willian T. Lunardi, Martin Andreoni Lopez
The effectiveness of network intrusion detection systems, predominantly based on machine learning, are highly influenced by the dataset they are trained on.
Ranked #1 on
Anomaly Detection
on TII-SSRC-23
no code implementations • 3 May 2022 • Willian T. Lunardi, Martin Andreoni Lopez, Jean-Pierre Giacalone
With a convolutional \ac{AE}, ARCADE automatically builds a profile of the normal traffic using a subset of raw bytes of a few initial packets of network flows so that potential network anomalies and intrusions can be efficiently detected before they cause more damage to the network.
1 code implementation • 22 Jun 2020 • Willian T. Lunardi, Ernesto G. Birgin, Débora P. Ronconi, Holger Voos
This challenging real scheduling problem, that emerged in the nowadays printing industry, corresponds to a flexible job shop scheduling problem with sequencing flexibility; and it presents several complicating specificities such as resumable operations, periods of unavailability of the machines, sequence-dependent setup times, partial overlapping between operations with precedence constraints, and fixed operations, among others.