Kamran Zamanifar

ORCID: 0000-0001-5417-0177
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Service-Oriented Architecture and Web Services
  • Cloud Computing and Resource Management
  • Metaheuristic Optimization Algorithms Research
  • IoT and Edge/Fog Computing
  • Distributed and Parallel Computing Systems
  • Semantic Web and Ontologies
  • Advanced Database Systems and Queries
  • Complex Network Analysis Techniques
  • Advanced Multi-Objective Optimization Algorithms
  • Context-Aware Activity Recognition Systems
  • Parallel Computing and Optimization Techniques
  • Opinion Dynamics and Social Influence
  • Advanced Software Engineering Methodologies
  • Vehicle Routing Optimization Methods
  • Network Security and Intrusion Detection
  • Caching and Content Delivery
  • Energy Efficient Wireless Sensor Networks
  • Scheduling and Optimization Algorithms
  • Natural Language Processing Techniques
  • Evolutionary Algorithms and Applications
  • Advanced Data Storage Technologies
  • Web Data Mining and Analysis
  • Peer-to-Peer Network Technologies
  • Data Mining Algorithms and Applications
  • Biomedical Text Mining and Ontologies

University of Isfahan
2014-2024

ORCID
2021

Islamic Azad University, Isfahan
2010-2012

Islamic Azad University of Najafabad
2009-2011

Isfahan University of Technology
2006

University of Leeds
1997

The Internet of Things (IoT) requires a new processing paradigm that inherits the scalability cloud while minimizing network latency using resources closer to edge. Building up such flexibility within edge-to-cloud continuum consisting distributed networked ecosystem heterogeneous computing is challenging. Furthermore, IoT traffic dynamics and rising demand for low-latency services foster need response time balanced service placement. Load-balancing fog becomes cornerstone cost-effective...

10.1109/access.2021.3074962 article EN cc-by IEEE Access 2021-01-01

One of the important issues concerning spreading process in social networks is influence maximization. This problem identifying set most influential nodes order to begin based on an information diffusion model networks. In this study, two new methods considering community structure and influence-based closeness centrality measure are presented maximize spread multiplication threshold, minimum threshold linear models. The main objective study improve efficiency with respect run time while...

10.1177/0165551515621005 article EN Journal of Information Science 2016-02-01

Nowadays, OCR systems have got several applications and are increasingly employed in daily life. Much research has been done regarding the identification of Latin, Japanese, Chinese characters. However, very little investigation performed Farsi/Arabic characters recognition. Probably reason is difficulty complexity those compared to others limitation IT activities Farsi Arabic speaking countries. In this paper, a technique identify isolated A chain code based algorithm along with other...

10.5281/zenodo.1328082 article EN cc-by Zenodo (CERN European Organization for Nuclear Research) 2008-07-27

Influence maximization in a social network involves identifying an initial subset of nodes with pre-defined size order to begin the information diffusion objective maximizing influenced nodes. In this study, sign-aware cascade (SC) model is proposed for modeling effect both trust and distrust relationships on activation positive or negative opinions towards product signed networks. It proved that influence NP-hard SC function neither monotone nor submodular. For solving problem, particle...

10.3233/ida-150801 article EN Intelligent Data Analysis 2016-01-18

The issue of the guarantee quality service (QOS) for users can be provided by advanced reservation. reservation is a kind mechanism that provide ability to allocate resources based on agreement upon needs and increase number accepted users' requests in Grid system. Scheduling grid system NP-complete issue, so deterministic algorithms not used improve it. Some heuristic methods this purpose are: Genetic Algorithm (GA), Simulated Annealing (SA), Hill Climbing (HC), etc. In paper, method,...

10.1109/iccit.2009.319 article EN 2009-01-01

In this paper, we introduce a continuous double auction method for grid resource allocation in which resources are considered as provider agents and users consumer agents. each time step, agent determines its requested value based on workload bid two constraints: the remaining bidding, bidding. We study terms of economic efficiency system performance. Experimental results show that proposed is better than earliest deadline first (EDF) method, default strategy many schedulers.

10.1109/scis.2009.4927011 article EN 2009-03-01

The Traveling Salesman Problem (TSP) is one of the most famous optimization problems. Greedy crossover designed by Greffenstette et al, can be used while Symmetric TSP (STSP) resolved Genetic Algorithm (GA). Researchers have proposed several versions greedy crossover. Here we propose improved version it. We compare our with some recent crossovers, use and crossovers in GA then on speed accuracy.

10.48550/arxiv.1209.5339 preprint EN cc-by arXiv (Cornell University) 2012-01-01

Infrastructure-as-a-service cloud provides a suitable environment where users can run data-intensive applications and store their required data files. The performance of strongly depends on transmission delay. This delay is function the size files, location virtual machines that as well allocation rates to machines. In this paper, we propose novel machine placement algorithm jointly optimizes allocated rates. Through Simulation results show proposed significantly reduce transfer for compared...

10.1109/acct.2012.40 article EN 2012-01-01

Web services composition based on QoS is the NP-hard problem, so bionics optimization algorithms can solve it well. On other hand, of compound service a key factor for satisfying users. The users prefer different QoSs according to their desires. We have Proposed algorithm quality and gravitational search which one recent has many merits, example rapid convergence speed, less memory use, considering lot special parameters such as distance between solutions, etc. This paper presents new...

10.1109/iit.2009.5413773 article EN 2009-12-01

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 as they provide low latency required applications using Cloud resources. However, existing resource schedulers still lacking the efficiency and deadline meeting that analytical require. Recent works already considered characteristics to improve likelihood scheduling in platforms. Nevertheless, not taken into account...

10.1007/s10586-019-02908-2 article EN cc-by Cluster Computing 2019-02-14
Coming Soon ...