Mehrdad Jalali

Prof. Dr. Mehrdad Jalali

SRH University Heidelberg, Heidelberg, Baden-Württemberg, Germany
+1
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 July 2023 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
EDElham Dalirinia
Elham Dalirinia
Mehrdad JalaliMehrdad Jalali
Mehrdad Jalali
MYMahdi Yaghoobi
Mahdi Yaghoobi
HTHamid Tabatabaee
Hamid Tabatabaee
Here we introduce a new evolutionary algorithm called the Lotus Effect Algorithm, which combines efficient operators from the dragonfly algorithm, such as the movement of dragonflies in flower pollination for exploration, with the self-cleaning feature of water on flower leaves known as the lotus effect, for extraction and local search operations. The authors compared this method to other improved versions of the dragonfly algorithm using standard benchmark functions, and it outperformed all other methods according to Fredman's test on 29 benchmark functions. The article also highlights the practical application of LEA in reducing energy consumption in IoT nodes through clustering, resulting in increased packet delivery ratio and network lifetime. Additionally, the performance of the proposed method was tested on real-world problems with multiple constraints, such as the welded beam design optimization problem and the speed-reducer problem applied in a gearbox, and the results showed that LEA performs better than other methods in terms of accuracy.

1 September 2010 in Expert Systems with Applications
Verified
Journal Article
Closed access
Mehrdad JalaliMehrdad Jalali
Mehrdad Jalali
NMNorwati Mustapha
Norwati Mustapha
NSNasir Sulaiman
Nasir Sulaiman
AMAli Mamat
Ali Mamat

27 July 2016 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
SMSeyed Ahmad Moosavi
Seyed Ahmad Moosavi
Mehrdad JalaliMehrdad Jalali
Mehrdad Jalali
NMNegin Misaghian
Negin Misaghian
SSShahaboddin Shamshirband
Shahaboddin Shamshirband
Mohammad Hossein AnisiMohammad Hossein Anisi
Mohammad Hossein Anisi

1 April 2019 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
MVMahin Vazifehdan
Mahin Vazifehdan
MMMohammad Hossein Moattar
Mohammad Hossein Moattar
Mehrdad JalaliMehrdad Jalali
Mehrdad Jalali

15 April 2022 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Open access
sadaf safavisadaf safavi
sadaf safavi
Mehrdad JalaliMehrdad Jalali
Mehrdad Jalali
Today, millions of active users spend a percentage of their time on location‐based social networks like Yelp and Gowalla and share their rich information. They can easily learn about their friends' behaviors and where they are visiting and be influenced by their style. As a result, the existence of personalized recommendations and the investigation of meaningful features of users and Point of Interests (POIs), given the challenges of rich contents and data sparsity, is a substantial task to accurately recommend the POIs and interests of users in location‐based social networks (LBSNs). This work proposes a novel pipeline of POI recommendations named DeePOF based on deep learning and the convolutional neural network. This approach only takes into consideration the influence of the most similar pattern of friendship instead of the friendship of all users. The mean‐shift clustering technique is used to detect similarity. The most similar friends' spatial and temporal features are fed into our deep CNN technique. The output of several proposed layers can predict latitude and longitude and the ID of subsequent appropriate places, and then using the friendship interval of a similar pattern, the lowest distance venues are chosen. This combination method is estimated on two popular datasets of LBSNs. Experimental results demonstrate that analyzing similar friendships could make recommendations more accurate and the suggested model for recommending a sequence of top‐k POIs outperforms state‐of‐the‐art approaches.

10 August 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RNRaheleh Ghouchan nezhad noor nia
Raheleh Ghouchan nezhad noor nia
Mehrdad JalaliMehrdad Jalali
Mehrdad Jalali
MHMahboobeh Houshmand
Mahboobeh Houshmand
Traditional techniques for detecting materials have been unable to coordinate with the advancement of material science today due to their low accuracy and high cost. Accordingly, machine learning (ML) improves prediction efficiency in material science and high-entropy alloys’ (HEAs’) phase prediction. Unlike traditional alloys, HEAs consist of at least five elements with equal or near-equal atomic sizes. In a previous approach, we presented an HEA interaction network based on its descriptors. In this study, the HEA phase is predicted using a graph-based k-nearest neighbor (KNN) approach. Each HEA compound has its phase, which includes five categories: FCC, BCC, HCP, Multiphase and Amorphous. A composition phase represents a state of matter with a certain energy level. Phase prediction is effective in determining its application. Each compound in the network has some neighbors, and the phase of a new compound can be predicted based on the phase of the most similar neighbors. The proposed approach is performed on the HEA network. The experimental results show that the accuracy of the proposed approach for predicting the phase of new alloys is 88.88%, which is higher than that of other ML methods.