Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Dell'Amico, Matteo"'
Software Bills of Material (SBOMs), which improve transparency by listing the components constituting software, are a key countermeasure to the mounting problem of Software Supply Chain attacks. SBOM generation tools take project source files and pro
Externí odkaz:
http://arxiv.org/abs/2409.01214
Autor:
Villani, Francesco, Lazzaro, Dario, Cinà, Antonio Emanuele, Dell'Amico, Matteo, Biggio, Battista, Roli, Fabio
Data poisoning attacks on clustering algorithms have received limited attention, with existing methods struggling to scale efficiently as dataset sizes and feature counts increase. These attacks typically require re-clustering the entire dataset mult
Externí odkaz:
http://arxiv.org/abs/2408.07558
Malware abuses TLS to encrypt its malicious traffic, preventing examination by content signatures and deep packet inspection. Network detection of malicious TLS flows is an important, but challenging, problem. Prior works have proposed supervised mac
Externí odkaz:
http://arxiv.org/abs/2109.03878
Autor:
Dell'Amico, Matteo
FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the feature extraction step that usually transforms raw data in numeric ar
Externí odkaz:
http://arxiv.org/abs/1910.07283
Autor:
Dell'Amico, Matteo
It is well known that size-based scheduling policies, which take into account job size (i.e., the time it takes to run them), can perform very desirably in terms of both response time and fairness. Unfortunately, the requirement of knowing a priori t
Externí odkaz:
http://arxiv.org/abs/1907.04824
The supermarket model refers to a system with a large number of queues, where new customers choose d queues at random and join the one with the fewest customers. This model demonstrates the power of even small amounts of choice, as compared to simply
Externí odkaz:
http://arxiv.org/abs/1905.12155
By executing jobs serially rather than in parallel, size-based scheduling policies can shorten time needed to complete jobs; however, major obstacles to their applicability are fairness guarantees and the fact that job sizes are rarely known exactly
Externí odkaz:
http://arxiv.org/abs/1506.09158
Size-based schedulers have very desirable performance properties: optimal or near-optimal response time can be coupled with strong fairness guarantees. Despite this, such systems are very rarely implemented in practical settings, because they require
Externí odkaz:
http://arxiv.org/abs/1410.6122
User connectivity patterns in network applications are known to be heterogeneous, and to follow periodic (daily and weekly) patterns. In many cases, the regularity and the correlation of those patterns is problematic: for network applications, many c
Externí odkaz:
http://arxiv.org/abs/1404.7688
We study size-based schedulers, and focus on the impact of inaccurate job size information on response time and fairness. Our intent is to revisit previous results, which allude to performance degradation for even small errors on job size estimates,
Externí odkaz:
http://arxiv.org/abs/1403.5996