Kamran Zamanifar
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
Kamran Zamanifar has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
Naser Nematbakhsh
Dept. of Computer Science University of Isfahan Isfahan Iran
7 shared publications- Fahimeh Ghasemian
University of Isfahan
4 shared publications - Nasser Ghasem-Aghaee
University of Isfahan
4 shared publications Afsaneh Fatemi
2 shared publicationsAlireza Zohali
2 shared publicationsFarhad Mardukhi
Dept. of Computer Science, University of Isfahan, Iran
2 shared publications
Latest Publications
- 22 October 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (15) , 880
A unified, causal recommender for temporal preferences, signed influence, and diversity
- 22 October 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (15) , 880
A unified, causal recommender for temporal preferences, signed influence, and diversity
- 7 November 2025
- Published by Springer Nature in Computing
- Vol. 107 (12) , 1-35
TIGM: a temporal influence graph-based method for fair and diverse group recommendations
- 7 November 2025
- Published by Springer Nature in Computing
- Vol. 107 (12) , 1-35
TIGM: a temporal influence graph-based method for fair and diverse group recommendations
- 13 March 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (35) , 83275-83309
GFGDA: general framework for generating dungeons with atmosphere
- 13 March 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (35) , 83275-83309
GFGDA: general framework for generating dungeons with atmosphere
- 18 November 2022
- Published by Elsevier in Artificial Intelligence in Medicine
- Vol. 135, 102452
Using type-2 fuzzy ontology to improve semantic interoperability for healthcare and diagnosis of depression
- 18 November 2022
- Published by Elsevier in Artificial Intelligence in Medicine
- Vol. 135, 102452
Using type-2 fuzzy ontology to improve semantic interoperability for healthcare and diagnosis of depression
- Open Access
- 13 March 2022
- Published by Prague University of Economics and Business in Acta Informatica Pragensia
- Vol. 11 (1) , 80-104
CA-BPEL: A New Approach to Facilitate the Development and Execution of Context-Aware Service Orchestrations
Peer-reviewed journal on social and business aspects of informatics that covers the theory and application of enterprise information systems, as well as interactions between ICT and people.
- 13 March 2022
- Published by Prague University of Economics and Business in Acta Informatica Pragensia
- Vol. 11 (1) , 80-104
Open AccessCA-BPEL: A New Approach to Facilitate the Development and Execution of Context-Aware Service Orchestrations
Peer-reviewed journal on social and business aspects of informatics that covers the theory and application of enterprise information systems, as well as interactions between ICT and people.
- Open Access
A New Approach for Semantic Web Matching
In this work we propose a new approach for semantic web matching to improve the performance of Web Service replacement. Because in automatic systems we should ensure the self-healing, self-configuration, self-optimization and self-management, all services should be always available and if one of them crashes, it should be replaced with the most similar one. Candidate services are advertised in Universal Description, Discovery and Integration (UDDI) all in Web Ontology Language (OWL). By the help of bipartite graph, we did the matching between the crashed service and a Candidate one. Then we chose the best service, which had the maximum rate of matching. In fact we compare two services` functionalities and capabilities to see how much they match. We found that the best way for matching two web services, is comparing the functionalities of them.
Open AccessA New Approach for Semantic Web Matching
In this work we propose a new approach for semantic web matching to improve the performance of Web Service replacement. Because in automatic systems we should ensure the self-healing, self-configuration, self-optimization and self-management, all services should be always available and if one of them crashes, it should be replaced with the most similar one. Candidate services are advertised in Universal Description, Discovery and Integration (UDDI) all in Web Ontology Language (OWL). By the help of bipartite graph, we did the matching between the crashed service and a Candidate one. Then we chose the best service, which had the maximum rate of matching. In fact we compare two services` functionalities and capabilities to see how much they match. We found that the best way for matching two web services, is comparing the functionalities of them.
- Open Access
- 28 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 64983-65000
Decentralized Edge-to-Cloud Load Balancing: Service Placement for the Internet of Things
The Internet of Things (IoT) requires a new processing paradigm that inherits the scalability of the cloud while minimizing network latency using resources closer to the network edge. On the one hand, building up such flexibility within the edge-to-cloud continuum consisting of a distributed networked ecosystem of heterogeneous computing resources is challenging. On the other hand, IoT traffic dynamics and the rising demand for low-latency services foster the need for minimizing the response time and a balanced service placement. Load-balancing for fog computing becomes a cornerstone for cost-effective system management and operations. This paper studies two optimization objectives and formulates a decentralized load-balancing problem for IoT service placement: (global) IoT workload balance and (local) quality of service (QoS), in terms of minimizing the cost of deadline violation, service deployment, and unhosted services. The proposed solution, EPOS Fog, introduces a decentralized multi-agent system for collective learning that utilizes edge-to-cloud nodes to jointly balance the input workload across the network and minimize the costs involved in service execution. The agents locally generate possible assignments of requests to resources and then cooperatively select an assignment such that their combination maximizes edge utilization while minimizes service execution cost. Extensive experimental evaluation with realistic Google cluster workloads on various networks demonstrates the superior performance of EPOS Fog in terms of workload balance and QoS, compared to approaches such as First Fit and exclusively Cloud-based. The results confirm that EPOS Fog reduces service execution delay up to 25% and the load-balance of network nodes up to 90%. The findings also demonstrate how distributed computational resources on the edge can be utilized more cost-effectively by harvesting collective intelligence.
- 28 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 64983-65000
Open AccessDecentralized Edge-to-Cloud Load Balancing: Service Placement for the Internet of Things
The Internet of Things (IoT) requires a new processing paradigm that inherits the scalability of the cloud while minimizing network latency using resources closer to the network edge. On the one hand, building up such flexibility within the edge-to-cloud continuum consisting of a distributed networked ecosystem of heterogeneous computing resources is challenging. On the other hand, IoT traffic dynamics and the rising demand for low-latency services foster the need for minimizing the response time and a balanced service placement. Load-balancing for fog computing becomes a cornerstone for cost-effective system management and operations. This paper studies two optimization objectives and formulates a decentralized load-balancing problem for IoT service placement: (global) IoT workload balance and (local) quality of service (QoS), in terms of minimizing the cost of deadline violation, service deployment, and unhosted services. The proposed solution, EPOS Fog, introduces a decentralized multi-agent system for collective learning that utilizes edge-to-cloud nodes to jointly balance the input workload across the network and minimize the costs involved in service execution. The agents locally generate possible assignments of requests to resources and then cooperatively select an assignment such that their combination maximizes edge utilization while minimizes service execution cost. Extensive experimental evaluation with realistic Google cluster workloads on various networks demonstrates the superior performance of EPOS Fog in terms of workload balance and QoS, compared to approaches such as First Fit and exclusively Cloud-based. The results confirm that EPOS Fog reduces service execution delay up to 25% and the load-balance of network nodes up to 90%. The findings also demonstrate how distributed computational resources on the edge can be utilized more cost-effectively by harvesting collective intelligence.
- 24 August 2019
- Published by Springer Nature
- p. 323-330
Ontology-Based Resource Allocation for Internet of Things
- 24 August 2019
- Published by Springer Nature
- p. 323-330
Ontology-Based Resource Allocation for Internet of Things
- 20 February 2019
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 23 (1) , 77-102
Efficient resource scheduling for the analysis of Big Data streams
The emergence of Big Data has had a profound impact on how data are analyzed. Open source distributed stream processing platforms have gained popularity for analyzing streaming Big Data as they provide low latency required for streaming Big Data appl
- 20 February 2019
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 23 (1) , 77-102
Efficient resource scheduling for the analysis of Big Data streams
The emergence of Big Data has had a profound impact on how data are analyzed. Open source distributed stream processing platforms have gained popularity for analyzing streaming Big Data as they provide low latency required for streaming Big Data appl
- Open Access
- 14 February 2019
- Published by Springer Nature in Cluster Computing
- Vol. 23 (1) , 241-263
Efficient deadline-aware scheduling for the analysis of Big Data streams in public Cloud
- 14 February 2019
- Published by Springer Nature in Cluster Computing
- Vol. 23 (1) , 241-263
Open AccessEfficient deadline-aware scheduling for the analysis of Big Data streams in public Cloud