Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Issue 2 December 2019, Pages 1-151
Issue 1 June 2019, Pages 1-164
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Sweep Line Algorithm for Convex Hull Revisited

Keivan Borna

Volume 51, Issue 1 , June 2019, Pages 1-14


  Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points ...  Read More

Intelligent application for Heart disease detection using Hybrid Optimization algorithm

Marzieh Eskandari; Zeinab Hassani

Volume 51, Issue 1 , June 2019, Pages 15-27


  Prediction of heart disease is very important because it is one of the causes of death around the world. Moreover, heart disease prediction in the early stage plays a main role in the treatment and recovery disease and reduces costs of diagnosis disease and side effects it. Machine learning algorithms ...  Read More

Algorithm for finding the largest inscribed rectangle in polygon

Zahraa Marzeh; Maryam Tahmasbi; Narges Mirehi

Volume 51, Issue 1 , June 2019, Pages 29-41


  In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm ...  Read More

Optimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm

Fatemeh Ganji; Zahrasadat Zamani

Volume 51, Issue 1 , June 2019, Pages 43-54


  Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve ...  Read More

Max-Min averaging operator: fuzzy inequality systems and resolution

A. Ghodousian; Tarane Azarnejad; Farnood Samie Yousefi

Volume 51, Issue 1 , June 2019, Pages 55-70


   Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. ...  Read More

A Closed-Form Solution for Two-Dimensional Diffusion Equation Using Crank-Nicolson Finite Difference Method

Iman Shojaei; Hossein Rahami

Volume 51, Issue 1 , June 2019, Pages 71-77


  In this paper a finite difference method for solving 2-dimensional diffusion equation is presented. The method employs Crank-Nicolson scheme to improve finite difference formulation and its convergence and stability. The obtained solution will be a recursive formula in each step of which a system of ...  Read More

Correlation Coefficients for Hesitant Fuzzy Linguistic Term Sets

Gholamreza Hesamian; Mohammad Ghasem Akbari

Volume 51, Issue 1 , June 2019, Pages 79-89


  Here are many situations in real applications of decision making where we deal with uncertain conditions.  Due to the different sources of uncertainty,  since its original definition of fuzzy sets in 1965 \cite{zadeh1965},  different generalizations and extensions of fuzzy sets have been ...  Read More

Some new restart vectors for explicitly restarted Arnoldi method

Zeinab Abadi; Seyed Abolfazl Shahzadeh Fazeli; Seyed Mehdi Karbassi

Volume 51, Issue 1 , June 2019, Pages 91-105


  The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply ...  Read More

Feasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms

Azadeh Sharafibadr; Zahra Nilforoushan

Volume 51, Issue 1 , June 2019, Pages 107-120


  We consider the problem of finding the localization of radioactive source by using data from a digital camera. In other words, the camera could help us to detect the direction of radioactive rays radiation. Therefore, the outcome could be used to command a robot to move toward the true direction to achieve ...  Read More

$k$-Total difference cordial graphs

R Ponraj; S.Yesu Doss Philip; R Kala

Volume 51, Issue 1 , June 2019, Pages 121-128


  Let $G$ be a graph. Let $f:V(G)\to\{0,1,2, \ldots, k-1\}$ be a map where $k \in \mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $\left|f(u)-f(v)\right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $\left|t_{df}(i)-t_{df}(j)\right|\leq 1$, $i,j \in \{0,1,2, \ldots, ...  Read More

Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel

P. Titus; S. Santha Kumari

Volume 51, Issue 1 , June 2019, Pages 129-145


  A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path  $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A  detour monophonic graphoidal cover of a graph $G$ is a collection $\psi_{dm}$ ...  Read More

Tenacity and rupture degree parameters for trapezoid graphs

Dara Moazzami

Volume 51, Issue 1 , June 2019, Pages 157-164


  Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs ...  Read More