We present a novel approach for accurate characterization of workloads. Workloads are generally described with statistical models and are based on the analysis of resource requests measurements of a running program. In this paper we propose to consider the sequence of virtual memory references generated from a program during its execution as a...
-
2017 (v1)PublicationUploaded on: April 14, 2023
-
2016 (v1)Publication
Dynamic programming is a popular optimization technique, developed in the 60's and still widely used today in several fields for its ability to find global optimum. Dynamic Programming Algorithms (DPAs) can be developed in many dimension. However, it is known that if the DPA dimension is greater or equal to two, the algorithm is an NP complete...
Uploaded on: April 14, 2023 -
2017 (v1)Publication
Tor is an anonymous Internet communication system based on the second generation of onion routing network protocol. Using Tor is really difficult to trace the users Internet activity: this is the reason why the usage of Tor is intended in order to protect the privacy of users, their freedom and the ability to conduct confidential communications...
Uploaded on: April 14, 2023 -
2018 (v1)Publication
In this paper, we propose PP-OMDS (Privacy-Preserving OLAP-based Monitoring of Data Streams), an innovative framework for supporting the OLAP-based monitoring of data streams, which is relevant for a plethora of application scenarios (e.g., security, emergency management, and so forth), in a privacypreserving manner. The paper describes...
Uploaded on: April 14, 2023 -
2017 (v1)Publication
Dynamic programming is a popular optimization technique, developed in the 60's and still widely used today in several fields for its ability to find global optimum. Dynamic Programming Algorithms (DPAs) can be developed in many dimension. However, it is known that if the DPA dimension is greater or equal to two, the algorithm is an NP complete...
Uploaded on: March 27, 2023 -
2016 (v1)Publication
The Dynamic Programming Algorithm (DPA) was developed in the fifties. However, it is sometimes still used nowadays in various fields because it can easily find the global optimum in certain optimization problems. DPA has been applied to problems of one, two or three dimensions. When the dimension of the problem solved by DPA is equal to one the...
Uploaded on: April 14, 2023 -
2015 (v1)Publication
In this paper a novel moving shadows detecting algorithm is proposed. The algorithm can be used in indoor and outdoor environments. The algorithm we propose fuses together color and stereo disparity information using the Dempster-Shafer combination rule. Some considerations on the nature of the shadow improves the algorithm's ability to...
Uploaded on: April 14, 2023 -
2015 (v1)Publication
In this paper we present a system for detecting shadows in dynamic indoor and outdoor environment. The algorithm we propose fuses together color and stereo disparity information. Some considerations on the nature of the shadow improves the algorithm's ability to candidate the pixels as shadow or foreground. The candidate of both color and...
Uploaded on: April 14, 2023 -
2019 (v1)Publication
In this paper, we use Hidden Markov Models (HMM) and Mel-Frequency Cepstral Coecients (MFCC) to build statistical models of classical music composers directly from the music datasets. Several musical pieces are divided by instruments (String, Piano, Chorus, Orchestra), and, for each instrument, statistical models of the composers are...
Uploaded on: April 14, 2023