MohammadAmin Fazli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
MohammadAmin Fazli has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Jafar Habibi
Department of Computer Engineering Sharif University of Technology Tehran Iran
6 shared publications - Abolfazl Younesi
Department of Computer Engineering, Sharif University of Technology, Tehran, Iran
5 shared publications - Alireza Ejlali
Department of Computer Science and Engineering, Sharif University of Technology, Tehran, Iran
4 shared publications Jafar Habibi
Sharif University of Technology, Tehran, Iran
4 shared publications- Jorg Henkel
Karlsruhe Institute of Technology (KIT), Chair for Embedded Systems (CES), Karlsruhe, Germany
3 shared publications - Mohsen Ansari
Sharif University of Technology
3 shared publications
Latest Publications
- Open Access
- 2 May 2026
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 16 (1)
Do not review my code harshly: identifying counterproductive behavior in code review comments
- 2 May 2026
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 16 (1)
Open AccessDo not review my code harshly: identifying counterproductive behavior in code review comments
- 27 February 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 326
Cold-start active preference learning in socio-economic domains
- 27 February 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 326
Cold-start active preference learning in socio-economic domains
- 20 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (11) , 22983-22999
SIREN: Multiobjective Game-Theoretic Scheduler Based on Memory-Driven Gray Wolf Optimization in Fog–Cloud Computing
Fog–cloud task scheduling faces the dual challenge of maintaining critical IoT workloads despite node failures while adhering to strict energy budgets. We present SIREN, a game-theoretic framework that treats fog nodes as strategic players, embedding reliability benefits and dynamic voltage and frequency scaling (DVFS)-aware energy costs directly into their payoffs. By searching the joint strategy space with a memory-driven gray wolf optimizer (MDGWO), SIREN adapts placements, selective replication, and frequency settings to workload dynamics. Extensive evaluations on the Alibaba 2018 and Google 2011 cluster traces and on a latency-critical healthcare application demonstrate that SIREN converges to near-Nash schedules that minimize energy while maximizing reliability. Results confirm that SIREN delivers: 1) 100% task success rates (TSRs) in critical healthcare scenarios; 2)$2.08\times $ –$4.24\times $ lower worst case energy consumption than leading baselines; and 3) a$3.9\times $ –$5.8\times $ reduction in network usage, establishing a new benchmark for resilient, energy-efficient fog computing.- 20 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (11) , 22983-22999
SIREN: Multiobjective Game-Theoretic Scheduler Based on Memory-Driven Gray Wolf Optimization in Fog–Cloud Computing
Fog–cloud task scheduling faces the dual challenge of maintaining critical IoT workloads despite node failures while adhering to strict energy budgets. We present SIREN, a game-theoretic framework that treats fog nodes as strategic players, embedding reliability benefits and dynamic voltage and frequency scaling (DVFS)-aware energy costs directly into their payoffs. By searching the joint strategy space with a memory-driven gray wolf optimizer (MDGWO), SIREN adapts placements, selective replication, and frequency settings to workload dynamics. Extensive evaluations on the Alibaba 2018 and Google 2011 cluster traces and on a latency-critical healthcare application demonstrate that SIREN converges to near-Nash schedules that minimize energy while maximizing reliability. Results confirm that SIREN delivers: 1) 100% task success rates (TSRs) in critical healthcare scenarios; 2)$2.08\times $ –$4.24\times $ lower worst case energy consumption than leading baselines; and 3) a$3.9\times $ –$5.8\times $ reduction in network usage, establishing a new benchmark for resilient, energy-efficient fog computing.- Open Access
- 13 February 2026
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 16 (1) , 37
Correction: NAZM: network analysis of zonal metrics in Persian poetic tradition
- 13 February 2026
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 16 (1) , 37
Open AccessCorrection: NAZM: network analysis of zonal metrics in Persian poetic tradition
- Open Access
From Illusion to Insight: Change-Aware File-Level Software Defect Prediction Using Agentic AI
Much of the reported progress in file-level software defect prediction (SDP) is, in reality, nothing but an illusion of accuracy. Over the last decades, machine learning and deep learning models have reported increasing performance across software versions. However, since most files persist across releases and retain their defect labels, standard evaluation rewards label-persistence bias rather than reasoning about code changes. To address this issue, we reformulate SDP as a change-aware prediction task, in which models reason over code changes of a file within successive project versions, rather than relying on static file snapshots. Building on this formulation, we propose an LLM-driven, change-aware, multi-agent debate framework. Our experiments on multiple PROMISE projects show that traditional models achieve inflated F1, while failing on rare but critical defect-transition cases. In contrast, our change-aware reasoning and multi-agent debate framework yields more balanced performance across evolution subsets and significantly improves sensitivity to defect introductions. These results highlight fundamental flaws in current SDP evaluation practices and emphasize the need for change-aware reasoning in practical defect prediction. The source code is publicly available.
Open AccessFrom Illusion to Insight: Change-Aware File-Level Software Defect Prediction Using Agentic AI
Much of the reported progress in file-level software defect prediction (SDP) is, in reality, nothing but an illusion of accuracy. Over the last decades, machine learning and deep learning models have reported increasing performance across software versions. However, since most files persist across releases and retain their defect labels, standard evaluation rewards label-persistence bias rather than reasoning about code changes. To address this issue, we reformulate SDP as a change-aware prediction task, in which models reason over code changes of a file within successive project versions, rather than relying on static file snapshots. Building on this formulation, we propose an LLM-driven, change-aware, multi-agent debate framework. Our experiments on multiple PROMISE projects show that traditional models achieve inflated F1, while failing on rare but critical defect-transition cases. In contrast, our change-aware reasoning and multi-agent debate framework yields more balanced performance across evolution subsets and significantly improves sensitivity to defect introductions. These results highlight fundamental flaws in current SDP evaluation practices and emphasize the need for change-aware reasoning in practical defect prediction. The source code is publicly available.
- Open Access
RealDrag: The First Dragging Benchmark with Real Target Image
The evaluation of drag based image editing models is unreliable due to a lack of standardized benchmarks and metrics. This ambiguity stems from inconsistent evaluation protocols and, critically, the absence of datasets containing ground truth target images, making objective comparisons between competing methods difficult. To address this, we introduce \textbf{RealDrag}, the first comprehensive benchmark for point based image editing that includes paired ground truth target images. Our dataset contains over 400 human annotated samples from diverse video sources, providing source/target images, handle/target points, editable region masks, and descriptive captions for both the image and the editing action. We also propose four novel, task specific metrics: Semantical Distance (SeD), Outer Mask Preserving Score (OMPS), Inner Patch Preserving Score (IPPS), and Directional Similarity (DiS). These metrics are designed to quantify pixel level matching fidelity, check preservation of non edited (out of mask) regions, and measure semantic alignment with the desired task. Using this benchmark, we conduct the first large scale systematic analysis of the field, evaluating 17 SOTA models. Our results reveal clear trade offs among current approaches and establish a robust, reproducible baseline to guide future research. Our dataset and evaluation toolkit will be made publicly available.
Open AccessRealDrag: The First Dragging Benchmark with Real Target Image
The evaluation of drag based image editing models is unreliable due to a lack of standardized benchmarks and metrics. This ambiguity stems from inconsistent evaluation protocols and, critically, the absence of datasets containing ground truth target images, making objective comparisons between competing methods difficult. To address this, we introduce \textbf{RealDrag}, the first comprehensive benchmark for point based image editing that includes paired ground truth target images. Our dataset contains over 400 human annotated samples from diverse video sources, providing source/target images, handle/target points, editable region masks, and descriptive captions for both the image and the editing action. We also propose four novel, task specific metrics: Semantical Distance (SeD), Outer Mask Preserving Score (OMPS), Inner Patch Preserving Score (IPPS), and Directional Similarity (DiS). These metrics are designed to quantify pixel level matching fidelity, check preservation of non edited (out of mask) regions, and measure semantic alignment with the desired task. Using this benchmark, we conduct the first large scale systematic analysis of the field, evaluating 17 SOTA models. Our results reveal clear trade offs among current approaches and establish a robust, reproducible baseline to guide future research. Our dataset and evaluation toolkit will be made publicly available.
- Open Access
- 3 December 2025
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 15 (1) , 115
NAZM: network analysis of zonal metrics in Persian poetic tradition
This research presents a computational model designed to analyze influence dynamics between classical Persian poets in producing a multi-dimensional similarity network. Using a hand-curated dataset derived from Ganjoor’s corpus, we integrate semantic, lexical, stylistic, thematic, and metrical features generating weighted similarity matrices subsequently integrated into an influence graph portraying relationships between poets. A network analysis identifies both famous poets such as Hafez, Saʿdi, and Rumi holding central positions alongside minor poets such as Khāqānī and Salmān Sāvajī whose brokerage roles become structurally informative. By using community detection via the Louvain algorithm, we further connect discovered groups to known literary schools, notably Sabk-e Khorasani, Sabk-e Hindi, and the Bazgasht-e Adabi move ment. The findings exemplify how data-driven methods can differentiate between canonical height and structural influence and hence yield new insights into the evolution of Persian poetic lineages. By integrating computational linguistics and literary analysis, our proposed outline presents a scalable and interpretable instrument suited to both historical literary studies and future digital humanities work. Throughout, we use multi-dimensional similarity as a proxy for potential influence. Centrality therefore reflects structural integration within the network rather than cultural magnitude or causal primacy; establishing directionality requires temporal and historical evidence.
- 3 December 2025
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 15 (1) , 115
Open AccessNAZM: network analysis of zonal metrics in Persian poetic tradition
This research presents a computational model designed to analyze influence dynamics between classical Persian poets in producing a multi-dimensional similarity network. Using a hand-curated dataset derived from Ganjoor’s corpus, we integrate semantic, lexical, stylistic, thematic, and metrical features generating weighted similarity matrices subsequently integrated into an influence graph portraying relationships between poets. A network analysis identifies both famous poets such as Hafez, Saʿdi, and Rumi holding central positions alongside minor poets such as Khāqānī and Salmān Sāvajī whose brokerage roles become structurally informative. By using community detection via the Louvain algorithm, we further connect discovered groups to known literary schools, notably Sabk-e Khorasani, Sabk-e Hindi, and the Bazgasht-e Adabi move ment. The findings exemplify how data-driven methods can differentiate between canonical height and structural influence and hence yield new insights into the evolution of Persian poetic lineages. By integrating computational linguistics and literary analysis, our proposed outline presents a scalable and interpretable instrument suited to both historical literary studies and future digital humanities work. Throughout, we use multi-dimensional similarity as a proxy for potential influence. Centrality therefore reflects structural integration within the network rather than cultural magnitude or causal primacy; establishing directionality requires temporal and historical evidence.
- 14 November 2025
- Published by Elsevier in Information Sciences
- Vol. 730
Effect of choosing loss function when using T-batching for representation learning on dynamic networks
- 14 November 2025
- Published by Elsevier in Information Sciences
- Vol. 730
Effect of choosing loss function when using T-batching for representation learning on dynamic networks
- 17 October 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (16) , 1-22
Workflow ensemble scheduling in edge-based infrastructures for workflows with optional and mandatory tasks using Heuristic algorithms
- 17 October 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (16) , 1-22
Workflow ensemble scheduling in edge-based infrastructures for workflows with optional and mandatory tasks using Heuristic algorithms
- 16 October 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (15) , 1-17
Cache–aware task and workflow ensemble scheduling in edge–based infrastructures
- 16 October 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (15) , 1-17
Cache–aware task and workflow ensemble scheduling in edge–based infrastructures