List of Articles heuristic

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - embedding a tree in a point set with minimum lenght
  parya noorbakhsh
  In the geometric graph embedding problem, a graph with n vertices and a set of n points in the plane are given and we want to find a one to one mapping of f between vertices of the graph to these points. The embedding f assigns a length to each edge (u,v) of E, equal More

  In the geometric graph embedding problem, a graph with n vertices and a set of n points in the plane are given and we want to find a one to one mapping of f between vertices of the graph to these points. The embedding f assigns a length to each edge (u,v) of E, equal to the )Euclidean( distance between f(u) and f(v) in the plane. We wish to find an embedding of minimum length, where the total length is some of the lengths of the edges of E. This is an NP-hard problem since the traveling salesman problem is one special case of it. In this paper, we present some greedy heuristics algorithm and some heuristics algorithm with respect to the Traveling salesman problem (TSP) for embedding a free tree onto a point set on the plane with minimum total edge length. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - Survey different aspects of the problem phishing website detection and Review to existing Methods
  nafise langari
  One of the latest security threats in cyberspace to steal personal and financial information is created by phisher. Due to there Are various methods to detect phishing and also there is not an up-date comprehensive study on the issue, the authors Motivated to review and More

  One of the latest security threats in cyberspace to steal personal and financial information is created by phisher. Due to there Are various methods to detect phishing and also there is not an up-date comprehensive study on the issue, the authors Motivated to review and analysis the proposed phishing detection methods in five categories such as: anti-phishing tools Based, data mining based, heuristic based, meta-heuristic based and machine learning based methods. The advantages and Disadvantages of each method are extracted from the current review and comparison. The outlines of this study can be suitable to identify the probability gaps in phishing detection problems for feature researches. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - Provide an Energy-aware Markov Based Model for Dynamic Placement of Virtual Machines in Cloud Data Centers
  mehdi rajabzadeh Abolfazl Toroghi Haghighat Amir Masoud Rahmani
  The use of energy-conscious solutions is one of the important research topics in the field of cloud computing. By effectively using virtual machine placement and aggregation algorithms, cloud suppliers will be able to reduce energy consumption. In this paper, a new mode More

  The use of energy-conscious solutions is one of the important research topics in the field of cloud computing. By effectively using virtual machine placement and aggregation algorithms, cloud suppliers will be able to reduce energy consumption. In this paper, a new model is presented that seeks to achieve the desired results by improving the algorithms and providing appropriate methods. Periodic monitoring of resource status, proper analysis of the data obtained, and prediction of the critical state of the servers using the proposed Markov model have reduced the number of unnecessary migrations as much as possible. The combination of genetic algorithm and simulated annealing in the replacement section along with the definition of the adsorbent Markov chain has resulted in better and faster performance of the proposed algorithm. Simulations performed in different scenarios in CloudSim show that compared to the best algorithm compared, at low, medium and high load, energy consumption has decreased significantly. Violations of service level agreements also fell by an average of 17 percent. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  4 - A New Heuristic for Deadlock Detection in Safety Analysis of Software Systems
  عین الله پیرا
  The safety analysis of software systems, especially safety-critical ones, should be performed exactly because even a minor failure in these systems may result in disaster consequences. Also, such analysis must be done before implementation, i.e. the design step and in t More

  The safety analysis of software systems, especially safety-critical ones, should be performed exactly because even a minor failure in these systems may result in disaster consequences. Also, such analysis must be done before implementation, i.e. the design step and in the model level. Model checking is an exact and mathematical-based way that gets a model of a system and analyzes it through exploring all reachable states of the model. Due to the complexity of some systems and their models, this way may face the state space explosion problem, i.e. it cannot explore all available states. A solution to solve this problem in these systems is that model checking tries to refute them, instead of verifying them, by finding errors such as deadlock (if available).Although, a heuristic has been previously proposed to find a deadlock in the model's state space and it has been applied in several simple heuristic search and evolutionary algorithms, its detection speed has been low. In this paper, we propose a novel heuristic to detect a deadlock in the model's state space, and test and compare its detection speed by applying it in several simple heuristic search algorithms such as iterative deepening A*, beam search, and evolutionary algorithms such as genetic, particle swarm optimization, and Bayesian optimization. Comparison results confirm that the new heuristic can detect a deadlock in less time than the previous heuristic. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  5 - Presenting a Network-on-Chip Mapping Approach Based on Harmony Search Algorithm
  Zahra Bagheri Fatemeh Vardi Alireza Mahjoub
  In network-on-chip implementation, mapping can be considered as an important step in application implementation. The tasks of an application are often represented in the form of a core graph. The cores establish a link between themselves using a communication platform a More

  In network-on-chip implementation, mapping can be considered as an important step in application implementation. The tasks of an application are often represented in the form of a core graph. The cores establish a link between themselves using a communication platform and often the network on the chip. For finding proper mapping for an application, developers have proposed various algorithms. In most cases, due to the complexity, exact search methods are used to find the mapping. However, these methods are suitable for networks with small dimensions. As the size of the network increases, the search time also increases exponentially. This article, from the perspective of a heuristic approach, uses the harmony search method to decide when to connect cores to routers. Our approach uses an improved version of the harmony search algorithm with a focus on reducing power consumption and delay. Algorithm complexity analysis reveals a more appropriate solution compared to similar algorithms with respect to application traffic pattern. Compared to similar methods, the algorithm achieves 39.98% less delay and 61.11% saving in power consumption. Manuscript profile