Bruno Carpentieri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Bruno Carpentieri has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
Raffaele Pizzolante
16 shared publications- Arcangelo Castiglione
University of Salerno
14 shared publications - Francesco Palmieri
Department of Computer Science University of Salerno Fisciano Italy
14 shared publications - Aniello Castiglione
University of Salerno
9 shared publications J.A. Storer
Brandeis University
9 shared publicationsAlfredo De Santis
8 shared publications
Latest Publications
- Open Access
- 4 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 141-146
Light Fields Lossless Compression via Video Codecs
- 4 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 141-146
Open AccessLight Fields Lossless Compression via Video Codecs
- 24 May 2025
- Published by Springer Nature
- p. 213-223
Network Anomaly Detection Based on Burrows–Wheeler Transform and Variational Autoencoders
- 24 May 2025
- Published by Springer Nature
- p. 213-223
Network Anomaly Detection Based on Burrows–Wheeler Transform and Variational Autoencoders
- 22 April 2025
- Published by Springer Nature
- p. 140-148
Epidemic Analysis of the Propagation of Multiple Malware Infectious in Wireless Sensor Networks
- 22 April 2025
- Published by Springer Nature
- p. 140-148
Epidemic Analysis of the Propagation of Multiple Malware Infectious in Wireless Sensor Networks
- Open Access
- 3 March 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (3) , 135
Data Compression with a Time Limit
In this paper, we explore a framework to identify an optimal choice of compression algorithms that enables the best allocation of computing resources in a large-scale data storage environment: our goal is to maximize the efficiency of data compression given a time limit that must be observed by the compression process. We tested this approach with lossless compression of one-dimensional data (text) and two-dimensional data (images) and the experimental results demonstrate its effectiveness. We also extended this technique to lossy compression and successfully applied it to the lossy compression of two-dimensional data.
- 3 March 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (3) , 135
Open AccessData Compression with a Time Limit
In this paper, we explore a framework to identify an optimal choice of compression algorithms that enables the best allocation of computing resources in a large-scale data storage environment: our goal is to maximize the efficiency of data compression given a time limit that must be observed by the compression process. We tested this approach with lossless compression of one-dimensional data (text) and two-dimensional data (images) and the experimental results demonstrate its effectiveness. We also extended this technique to lossy compression and successfully applied it to the lossy compression of two-dimensional data.
- Open Access
- 18 February 2023
- Published by MDPI AG in Information
- Vol. 14 (2) , 135
Transmission of Digital Data in the 5G Era: Compression and Privacy
The vast majority of compressed digital data that flows nowadays on modern high-speed networks is directly related to human activity. It describes what we do, what we see and photograph, where we go, whom we meet, and specifically every moment of our lives. This brings up issues and concerns regarding the necessity to safeguard user privacy as well as to protect the digital multimedia contents that are delivered to offer new experiences. In this paper, we explore a unified approach to compression and privacy by considering different types of digital data (text, images, sound, and hyperspectral images).
- 18 February 2023
- Published by MDPI AG in Information
- Vol. 14 (2) , 135
Open AccessTransmission of Digital Data in the 5G Era: Compression and Privacy
The vast majority of compressed digital data that flows nowadays on modern high-speed networks is directly related to human activity. It describes what we do, what we see and photograph, where we go, whom we meet, and specifically every moment of our lives. This brings up issues and concerns regarding the necessity to safeguard user privacy as well as to protect the digital multimedia contents that are delivered to offer new experiences. In this paper, we explore a unified approach to compression and privacy by considering different types of digital data (text, images, sound, and hyperspectral images).
- 26 August 2022
- Published by Springer Nature
- p. 174-182
Efficient and Secure Transmission of Digital Data in the 5G Era
- 26 August 2022
- Published by Springer Nature
- p. 174-182
Efficient and Secure Transmission of Digital Data in the 5G Era
- 13 May 2021
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 33 (19) , e6351
On the undetectability of payloads generated through automatic tools: A human‐oriented approach
Nowadays, several tools have been proposed to support the operations performed during a security assessment process. In particular, it is a common practice to rely on automated tools to carry out some phases of this process in an automatic or semiautomatic way. In this article, we focus on tools for the automatic generation of custom executable payloads. Then, we will show how these tools can be transformed, through some human‐oriented modifications on the generated payloads, into threats for a given asset's security. The danger of such threats lies in the fact that they may not be detected by common antivirus (AVs). More precisely, in this article, we show a general approach to make a payload generated through automated tools run undetected by most AVs. In detail, we first analyze and explain most of the methods used by AVs to recognize malicious payloads and, for each one of them, we outline the relative strengths and flaws, showing how these flaws could be exploited using a general approach to evade AVs controls, by performing simple human‐oriented operations on the payloads. The testing activity we performed shows that our proposal is helpful in evading virtually all the most popular AVs on the market. Therefore, low‐skilled malicious users could easily use our approach.
- 13 May 2021
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 33 (19) , e6351
On the undetectability of payloads generated through automatic tools: A human‐oriented approach
Nowadays, several tools have been proposed to support the operations performed during a security assessment process. In particular, it is a common practice to rely on automated tools to carry out some phases of this process in an automatic or semiautomatic way. In this article, we focus on tools for the automatic generation of custom executable payloads. Then, we will show how these tools can be transformed, through some human‐oriented modifications on the generated payloads, into threats for a given asset's security. The danger of such threats lies in the fact that they may not be detected by common antivirus (AVs). More precisely, in this article, we show a general approach to make a payload generated through automated tools run undetected by most AVs. In detail, we first analyze and explain most of the methods used by AVs to recognize malicious payloads and, for each one of them, we outline the relative strengths and flaws, showing how these flaws could be exploited using a general approach to evade AVs controls, by performing simple human‐oriented operations on the payloads. The testing activity we performed shows that our proposal is helpful in evading virtually all the most popular AVs on the market. Therefore, low‐skilled malicious users could easily use our approach.
- Open Access
- 24 June 2020
- Published by MDPI AG in Algorithms
- Vol. 13 (6) , 151
Compression of Next-Generation Sequencing Data and of DNA Digital Files
The increase in memory and in network traffic used and caused by new sequenced biological data has recently deeply grown. Genomic projects such as HapMap and 1000 Genomes have contributed to the very large rise of databases and network traffic related to genomic data and to the development of new efficient technologies. The large-scale sequencing of samples of DNA has brought new attention and produced new research, and thus the interest in the scientific community for genomic data has greatly increased. In a very short time, researchers have developed hardware tools, analysis software, algorithms, private databases, and infrastructures to support the research in genomics. In this paper, we analyze different approaches for compressing digital files generated by Next-Generation Sequencing tools containing nucleotide sequences, and we discuss and evaluate the compression performance of generic compression algorithms by confronting them with a specific system designed by Jones et al. specifically for genomic file compression: Quip. Moreover, we present a simple but effective technique for the compression of DNA sequences in which we only consider the relevant DNA data and experimentally evaluate its performances.
- 24 June 2020
- Published by MDPI AG in Algorithms
- Vol. 13 (6) , 151
Open AccessCompression of Next-Generation Sequencing Data and of DNA Digital Files
The increase in memory and in network traffic used and caused by new sequenced biological data has recently deeply grown. Genomic projects such as HapMap and 1000 Genomes have contributed to the very large rise of databases and network traffic related to genomic data and to the development of new efficient technologies. The large-scale sequencing of samples of DNA has brought new attention and produced new research, and thus the interest in the scientific community for genomic data has greatly increased. In a very short time, researchers have developed hardware tools, analysis software, algorithms, private databases, and infrastructures to support the research in genomics. In this paper, we analyze different approaches for compressing digital files generated by Next-Generation Sequencing tools containing nucleotide sequences, and we discuss and evaluate the compression performance of generic compression algorithms by confronting them with a specific system designed by Jones et al. specifically for genomic file compression: Quip. Moreover, we present a simple but effective technique for the compression of DNA sequences in which we only consider the relevant DNA data and experimentally evaluate its performances.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A Scheduling Framework for Latency Optimization on 5G Mobile Edge Computing Infrastructures
Minimizing the latency in communications is assuming a paramount importance in 5G architectures, mainly for mission-critical applications associated to the IoT environment. However, the need of interacting with cloud-based applications introduces unacceptable delays essentially due to wide area transport activities over the Internet. Many solutions are emerging for facing this problem ranging from cloudlets to fog and edge computing architectures, pushing flexible virtualization environments nearer to the end devices, ideally within the base stations. Unfortunately, most of these infrastructures are managed by cloud providers in a network- oblivious way so that in presence of multiple nodes operating at the edge level in the same area no latency optimization strategies are taken into consideration. Accordingly, we present a novel latency- aware edge node selection framework based on a multi-objective bin packing problem transposed in the mobile edge computing scenario where the selection criterion is driven by both latency optimization and load balancing, managed according to a time slotted scheme.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A Scheduling Framework for Latency Optimization on 5G Mobile Edge Computing Infrastructures
Minimizing the latency in communications is assuming a paramount importance in 5G architectures, mainly for mission-critical applications associated to the IoT environment. However, the need of interacting with cloud-based applications introduces unacceptable delays essentially due to wide area transport activities over the Internet. Many solutions are emerging for facing this problem ranging from cloudlets to fog and edge computing architectures, pushing flexible virtualization environments nearer to the end devices, ideally within the base stations. Unfortunately, most of these infrastructures are managed by cloud providers in a network- oblivious way so that in presence of multiple nodes operating at the edge level in the same area no latency optimization strategies are taken into consideration. Accordingly, we present a novel latency- aware edge node selection framework based on a multi-objective bin packing problem transposed in the mobile edge computing scenario where the selection criterion is driven by both latency optimization and load balancing, managed according to a time slotted scheme.
- Open Access
- 1 November 2019
- Published by IOP Publishing in IOP Conference Series: Earth and Environmental Science
- Vol. 362 (1) , 012059
Next Generation Sequencing Data and its Compression
Over the past few years the amount of digital memory and network traffic used by sequenced biological data has increased dramatically. Genomic projects such as HapMap, 1000 Genomes, etc., have come to the collection and description of genomes of 2,504 individuals from 26 populations, and they contributed to exponential growth of databases of this type and to the development of increasingly efficient technologies. Thanks to the large-scale sequencing of samples of DNA, the interest and the new research in these areas by the scientific community are suddenly grown. In a very short time researchers have developed hardware tools, analysis software, algorithms, private databases and infrastructures to support genomics. In this paper we analyse different approaches for compressing digital files generated by Next-Generation Sequencing tools containing nucleotide sequences and we discuss and evaluate the compression performance of generic compression tools such as gzip and bzip2 by confronting them with a specific system that was designed specifically for genomic file compression: quip.
- 1 November 2019
- Published by IOP Publishing in IOP Conference Series: Earth and Environmental Science
- Vol. 362 (1) , 012059
Open AccessNext Generation Sequencing Data and its Compression
Over the past few years the amount of digital memory and network traffic used by sequenced biological data has increased dramatically. Genomic projects such as HapMap, 1000 Genomes, etc., have come to the collection and description of genomes of 2,504 individuals from 26 populations, and they contributed to exponential growth of databases of this type and to the development of increasingly efficient technologies. Thanks to the large-scale sequencing of samples of DNA, the interest and the new research in these areas by the scientific community are suddenly grown. In a very short time researchers have developed hardware tools, analysis software, algorithms, private databases and infrastructures to support genomics. In this paper we analyse different approaches for compressing digital files generated by Next-Generation Sequencing tools containing nucleotide sequences and we discuss and evaluate the compression performance of generic compression tools such as gzip and bzip2 by confronting them with a specific system that was designed specifically for genomic file compression: quip.