Mahmood Fazlali
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mahmood Fazlali has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
Ali Zakerolhosseini
Department of Electrical and Computer Engineering, Shahid Beheshti University G.C, Tehran, Iran
8 shared publications- Georgi Gaydadjiev
Delft University of Technology
5 shared publications - Mohammad Mahdi Dehshibi
University of the West of England
4 shared publications Somayeh Timarchi
Shahid Beheshti University
4 shared publicationsHadi Tabatabaee Malazi
3 shared publicationsAli Katanforoush
Department of Computer Science, Shahid Beheshti University, Tehran, Iran
2 shared publications
Latest Publications
- 29 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Towards Music Instrument Classification using Convolutional Neural Networks
Recognizing musical instruments from an audio signal is a challenging yet valuable endeavor within the realm of music study. The recognition and classification of musical instruments could prove beneficial in organizing various genres of music and automation in music transcription reading and producing. In this paper, we will investigate the use of a Deep Convolutional Neural Network for automatic instruments recognition of polyphonic music. We enhance the state-of-the-art model, which we establish to be responsive to the instrument's playing style rather than its timbre. Furthermore, we set up experimental validation on small networks to extract timbre features from a spectrogram. We demonstrate an ensemble model based on these experiments, which improves the model accuracy by 20 % for both single and multiple instrument recognition. Additionally, we present several models capable of achieving competitive performance with a significantly smaller number of network parameters and neurons.
- 29 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Towards Music Instrument Classification using Convolutional Neural Networks
Recognizing musical instruments from an audio signal is a challenging yet valuable endeavor within the realm of music study. The recognition and classification of musical instruments could prove beneficial in organizing various genres of music and automation in music transcription reading and producing. In this paper, we will investigate the use of a Deep Convolutional Neural Network for automatic instruments recognition of polyphonic music. We enhance the state-of-the-art model, which we establish to be responsive to the instrument's playing style rather than its timbre. Furthermore, we set up experimental validation on small networks to extract timbre features from a spectrogram. We demonstrate an ensemble model based on these experiments, which improves the model accuracy by 20 % for both single and multiple instrument recognition. Additionally, we present several models capable of achieving competitive performance with a significantly smaller number of network parameters and neurons.
- Open Access
- 23 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Parallel Image Encryption Algorithm Using Partitioned Cellular Automata on Graphic Processor Unit
Image encryption is a reliable method for securely transmitting images over a network. The time required to encrypt and decrypt an image in online applications is also very important. Although cellular automata cryptography is an appropriate technique for parallelizing and accelerating cryptographic methods, its capacity cannot be demonstrated only in multi-core platforms. Thus, it is needed to parallelize cellular automata cryptography on Graphic Processor Units (GPUs) in order to significantly decrease the encryption/decryption time. In this paper, we propose a new parallel algorithm for two-dimensional cellular automata cryptography that is implemented on GPU. The proposed algorithm uses multiple threads at once to accelerate the bit-level permutation and substitution operations by taking into account the capacity of cellular automata in parallel processing. According to the study experimental findings, the proposed algorithm performs faster on GPU compared to a multicore platform while maintaining the same level of security in comparison to the serial algorithm.
- 23 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessParallel Image Encryption Algorithm Using Partitioned Cellular Automata on Graphic Processor Unit
Image encryption is a reliable method for securely transmitting images over a network. The time required to encrypt and decrypt an image in online applications is also very important. Although cellular automata cryptography is an appropriate technique for parallelizing and accelerating cryptographic methods, its capacity cannot be demonstrated only in multi-core platforms. Thus, it is needed to parallelize cellular automata cryptography on Graphic Processor Units (GPUs) in order to significantly decrease the encryption/decryption time. In this paper, we propose a new parallel algorithm for two-dimensional cellular automata cryptography that is implemented on GPU. The proposed algorithm uses multiple threads at once to accelerate the bit-level permutation and substitution operations by taking into account the capacity of cellular automata in parallel processing. According to the study experimental findings, the proposed algorithm performs faster on GPU compared to a multicore platform while maintaining the same level of security in comparison to the serial algorithm.
- 6 March 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (11) , 12042-12073
A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm
- 6 March 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (11) , 12042-12073
A fast MILP solver for high-level synthesis based on heuristic model reduction and enhanced branch and bound algorithm
- Open Access
- 1 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Auto-tuning HyperParameters of SGD Matrix Factorization-Based Recommender Systems Using Genetic Algorithm
Recommender systems enable companies to generate meaningful recommendations to users for items or products that might interest them. Stochastic Gradient Descent Matrix Factorization (SGD-MF) is one of the most popular model-based recommender systems. Fractional Adaptive Stochastic Gradient Descent matrix factorization (FASGD-MF) is a subset of SGD-MF-based models that apply fractional calculus in an adaptive way. There are some hyperparameters in these models that impact the quality of the recommender system. However, searching the hyperparameter space to find the best configuration using an exhaustive search is often a time-consuming task. This paper employs a genetic algorithm as a search metaheuristic to tackle this problem. The proposed method is designed based on non-uniform mutation and whole arithmetic crossover. The results indicate that optimizing hyperparameters by the proposed method not only adjusts the values of hyperparameters automatically but also can improve the quality of SGD-MF-based models. Implementing the proposed genetic algorithm on two datasets (MovieLens 100K and MovieLens 1M) verifies the assertion about the performance.
- 1 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Open AccessAuto-tuning HyperParameters of SGD Matrix Factorization-Based Recommender Systems Using Genetic Algorithm
Recommender systems enable companies to generate meaningful recommendations to users for items or products that might interest them. Stochastic Gradient Descent Matrix Factorization (SGD-MF) is one of the most popular model-based recommender systems. Fractional Adaptive Stochastic Gradient Descent matrix factorization (FASGD-MF) is a subset of SGD-MF-based models that apply fractional calculus in an adaptive way. There are some hyperparameters in these models that impact the quality of the recommender system. However, searching the hyperparameter space to find the best configuration using an exhaustive search is often a time-consuming task. This paper employs a genetic algorithm as a search metaheuristic to tackle this problem. The proposed method is designed based on non-uniform mutation and whole arithmetic crossover. The results indicate that optimizing hyperparameters by the proposed method not only adjusts the values of hyperparameters automatically but also can improve the quality of SGD-MF-based models. Implementing the proposed genetic algorithm on two datasets (MovieLens 100K and MovieLens 1M) verifies the assertion about the performance.
- 23 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 35 (3) , 470-483
Parallel Fractional Stochastic Gradient Descent With Adaptive Learning for Recommender Systems
The structural change toward the digital transformation of online sales elevates the importance of parallel processing techniques in recommender systems, particularly in the pandemic and post-pandemic era. Matrix factorization (MF) is a popular and scalable approach in collaborative filtering (CF) to predict user preferences in recommender systems. Researchers apply Stochastic Gradient Descent (SGD) as one of the most famous optimization techniques for MF. Paralleling SGD methods help address big data challenges due to the wide range of products and the sparsity in user ratings. However, these methods’ convergence rate and accuracy are affected by the dependency between the user and item latent factors, specifically in large-scale problems. Besides, the performance is sensitive to the applied learning rates. This article proposes a new parallel method to remove dependencies and boost speed-up by using fractional calculus to improve accuracy and convergence rate. We also apply adaptive learning rates to enhance the performance of our proposed method. The proposed method is based on Compute Unified Device Architecture (CUDA) platform. We evaluate the performance of our proposed method using real-world data and compare the results with the close baselines. The results show that our method can obtain high accuracy and convergence rate in addition to high parallelism.
- 23 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 35 (3) , 470-483
Parallel Fractional Stochastic Gradient Descent With Adaptive Learning for Recommender Systems
The structural change toward the digital transformation of online sales elevates the importance of parallel processing techniques in recommender systems, particularly in the pandemic and post-pandemic era. Matrix factorization (MF) is a popular and scalable approach in collaborative filtering (CF) to predict user preferences in recommender systems. Researchers apply Stochastic Gradient Descent (SGD) as one of the most famous optimization techniques for MF. Paralleling SGD methods help address big data challenges due to the wide range of products and the sparsity in user ratings. However, these methods’ convergence rate and accuracy are affected by the dependency between the user and item latent factors, specifically in large-scale problems. Besides, the performance is sensitive to the applied learning rates. This article proposes a new parallel method to remove dependencies and boost speed-up by using fractional calculus to improve accuracy and convergence rate. We also apply adaptive learning rates to enhance the performance of our proposed method. The proposed method is based on Compute Unified Device Architecture (CUDA) platform. We evaluate the performance of our proposed method using real-world data and compare the results with the close baselines. The results show that our method can obtain high accuracy and convergence rate in addition to high parallelism.
- 3 September 2021
- Published by Springer Nature in Computing
- Vol. 105 (5) , 1121-1139
A symbiosis between population based incremental learning and LP-relaxation based parallel genetic algorithm for solving integer linear programming models
- 3 September 2021
- Published by Springer Nature in Computing
- Vol. 105 (5) , 1121-1139
A symbiosis between population based incremental learning and LP-relaxation based parallel genetic algorithm for solving integer linear programming models
- 18 November 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (6) , 6056-6077
Accelerating Louvain community detection algorithm on graphic processing unit
- 18 November 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (6) , 6056-6077
Accelerating Louvain community detection algorithm on graphic processing unit
- Open Access
- 1 July 2020
- Vol. 8 (2) , 193-200
Parallel and Exact Method for Solving n-Similarity Problem
- 1 July 2020
- Vol. 8 (2) , 193-200
Open AccessParallel and Exact Method for Solving n-Similarity Problem