Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Issue 2 December 2021, Pages 1-208
Issue 1 June 2021, Pages 1-208
Volume 52 (2020)
Volume 51 (2019)
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)
A variant of van Hoeij's algorithm to compute hypergeometric term solutions of holonomic recurrence equations

Bertrand Teguia Tabuguia

Volume 53, Issue 2 , December 2021, Pages 1-32


  Linear and homogeneous recurrence equations having polynomial coefficients are said to be holonomic. These equations are useful for proving and discovering combinatorial and hypergeometric identities. Given a field $\mathbb{K}$ of characteristic zero, $a_n$ is a hypergeometric term with respect to $\mathbb{K}$, ...  Read More

Overlapping Clusters in Cluster Graph Convolutional Networks

Mahmood Amintoosi

Volume 53, Issue 2 , December 2021, Pages 33-45


  A popular research topic in Graph Convolutional Networks (GCNs) is to speedup the training time of the network. The main bottleneck in training GCN is the exponentially growing of computations. In Cluster-GCN based on this fact that each node and its neighbors are usually grouped in the same ...  Read More

Pair difference cordial labeling of planar grid and mangolian tent

R Ponraj; A Gayathri; S Somasundaram

Volume 53, Issue 2 , December 2021, Pages 47-56


   Let $G = (V, E)$ be a $(p,q)$ graph.Define \begin{equation*}\rho =\begin{cases}\frac{p}{2} ,& \text{if $p$ is even}\\\frac{p-1}{2} ,& \text{if $p$ is odd}\\\end{cases}\end{equation*}\\ and $L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\}$ called the set of labels.\noindent Consider a mapping ...  Read More

On the J-Tightness of Graphs

Abolfazl Javan; Majid Javan; M. Jafarpour; Dara Moazzami; Ali Moieni

Volume 53, Issue 2 , December 2021, Pages 57-74


  We introduce a new invariant vulnerability parameter named “J-Tightness” or “J(G)” for graphs. As a stability measure, its properties along with comparisons to other parameters of a graph are proposed. We show how it is calculated for complete graphs and cycles. We show that J-Tightness ...  Read More

Fuzzy Cumulative Distribution Function and its Properties }

Gholamreza Hesamian; Mehdi Shams

Volume 53, Issue 2 , December 2021, Pages 75-84


  The statistical methods based on cumulative distribution function is a start point for  many parametric or nonparametric statistical inferences. However, there are many practical problems that require dealing with observations/parameters that represent inherently imprecise.  However, Hesamian ...  Read More

Plane Bounded-Degree Spanners Among the Obstacles for the Points in Convex Position

Davood Bakhshesh

Volume 53, Issue 2 , December 2021, Pages 85-90


  Let $S$ be a set of points in the plane that are in convex position. Let~$\cal O$ be a set of simple polygonal obstacles whose vertices are in $S$. The visibility graph $Vis(S,{\cal O})$  is the graph which is obtained from the complete graph of $S$ by removing all edges intersecting some obstacle ...  Read More

Effective Tamper Detection and Recovery of Images after Serious Attacks

Faranak Tohidi; Mohammad Reza Hooshmandasl; Manoranjan Paul

Volume 53, Issue 2 , December 2021, Pages 91-111


  Confirming the integrity of transmitted sensitive digital content is a significant issue due to the evolution in communication technologies and the accessibility of image processing tools. Watermarking has been a successful method of authentication and integrity verification recently. However, several ...  Read More

Priority-Oriented Task Scheduling based on Harris Hawks Optimizer for Cloud Computing

Reyhane Ghafari; Najme Mansouri

Volume 53, Issue 2 , December 2021, Pages 113-156


  Cloud computing is a high-performance computing environment that can remotely provide services to customers using a pay-per-use model. The principal challenge in cloud computing is task scheduling, in which tasks must be effectively allocated to resources. The mapping of cloud resources to customer requests ...  Read More

A Systematic Way for Selecting Suitable Journal for Publishing Manuscripts


Volume 53, Issue 2 , December 2021, Pages 157-164


  Selecting suitable journals for publishing manuscripts for publication is one of the most essential processes before publishing any manuscript. Finding the relevant journal is a key factor which proves one's work valuable to the entire society. The final output and the performance of one's research is ...  Read More

Rainbow Edge Colouring of Digraphs

Mahdieh Hasheminezhad

Volume 53, Issue 2 , December 2021, Pages 165-172


  An edge  coloring of a digraph  $D$ is called a $P_3$-rainbow edge coloring if  the edges of any directed path of $D$ with length 2 are colored with different colors. It is proved that  for a $P_3$-rainbow edge coloring of  a digraph $D$, at least $\left\lceil{log_2{\chi(D)}} ...  Read More

Negative Cost Girth Problem using Map-Reduce Framework

Mahboubeh Shamsi; Abdolreza Rasouli Kenari; Roghayeh Aghamohammadi

Volume 53, Issue 2 , December 2021, Pages 173-196


  On a graph with a negative cost cycle, the shortest path is undefined, but the number of edges of the shortest negative cost cycle could be computed. It is called Negative Cost Girth (NCG). The NCG problem is applied in many optimization issues such as scheduling and model verification. The existing ...  Read More

Developing a New Genetic Algorithm for Selecting Efficient Project Portfolio

Mohammad Mirabi; Mohammad Reza Zare Banadkouki

Volume 53, Issue 2 , December 2021, Pages 197-208


  selecting an efficient project portfolio among available projects is a vital decision for any project manager. The main questions are which projects can have more long-term benefit for manager or organization. Due to the complexity of this field of research, todays so many approaches are developed for ...  Read More