Volume 56 (2024)
Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
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)
$4$-total mean cordial labeling in subdivision graphs

R Ponraj; S SUBBULAKSHMI; S Somasundaram

Volume 52, Issue 2 , December 2020, Pages 1-11

https://doi.org/10.22059/jac.2020.78640

Abstract
  Let $G$ be a graph. Let $f:V\left(G\right)\rightarrow \left\{0,1,2,\ldots,k-1\right\}$ be a function where $k\in \mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $f\left(uv\right)=\left\lceil \frac{f\left(u\right)+f\left(v\right)}{2}\right\rceil$.  $f$ is called $k$-total mean cordial ...  Read More

Linear optimization constrained by fuzzy inequalities defined by Max-Min averaging operator

A. Ghodousian; Sara Falahatkar

Volume 52, Issue 2 , December 2020, Pages 13-28

https://doi.org/10.22059/jac.2020.79080

Abstract
  In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated whereby the feasible region is formed as the intersection of two inequality fuzzy systems and \textquotedblleft Fuzzy Max-Min\textquotedblright \ averaging operator is considered as ...  Read More

Crypto- Currency Price Prediction with Decision Tree Based Regressions Approach

ali naghib moayed; Reza Habibi

Volume 52, Issue 2 , December 2020, Pages 29-40

https://doi.org/10.22059/jac.2020.79110

Abstract
  Generally, no one can reject the fact that crypto currency market is expanded rapidly during last few years as, nowadays, crypto currency market is attractive for both traders and business who are not willing to pay for FATF services for transferring money. With this in mind, crypto currency price prediction ...  Read More

Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata

Abolfazl Javan; Maryam Jafarpour; Ali Moieni; Mohammad Shekaramiz

Volume 52, Issue 2 , December 2020, Pages 41-56

https://doi.org/10.22059/jac.2020.79225

Abstract
  Cellular automata are simple mathematical idealizations of natural systems. They consist of a lattice of discrete identical sites, each site taking on a finite set of, say, integer values. Over the years, scientists have been trying to investigate the computational capabilities of cellular automata by ...  Read More

On the domination number of generalized Petersen graphs

Abolfazl Poureidi

Volume 52, Issue 2 , December 2020, Pages 57-65

https://doi.org/10.22059/jac.2020.79236

Abstract
  Let $n$ and $k$ be integers such that $3\leq 2k+ 1 \leq n$.The generalized Petersen graph $GP(n, k)=(V,E) $ is the graph with $V=\{u_1, u_2,\ldots, u_n\}\cup\{v_1, v_2,\ldots, v_n\}$ and $E=\{u_iu_{i+1}, u_iv_i, v_iv_{i+k}: 1 \leq i \leq n\}$, whereaddition is in modulo $n$. A subset $D\subseteq V$ is ...  Read More

On Hardy's Apology Numbers

Dr. Henk Koppelaar; Peyman Nasehpour

Volume 52, Issue 2 , December 2020, Pages 67-83

https://doi.org/10.22059/jac.2020.79248

Abstract
  Twelve well known `Recreational' numbers are generalized and classified in three generalized types Hardy, Dudeney, and Wells. A novel proof method to limit the search for the numbers is exemplified for each of the types. Combinatorial operators are defined to ease programming the search.  Read More

LP Problems on the max - “Fuzzy Or” inequalities systems

A. Ghodousian; Parmida Mirhashemi

Volume 52, Issue 2 , December 2020, Pages 85-98

https://doi.org/10.22059/jac.2020.79249

Abstract
  In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated whereby the feasible region is formed as the intersection of two inequality fuzzy systems and “Fuzzy Or” operator is considered as fuzzy composition. It is shown that a ...  Read More

Generalization of DP Curves and Surfaces

Davood Bakhshesh

Volume 52, Issue 2 , December 2020, Pages 99-108

https://doi.org/10.22059/jac.2020.79264

Abstract
  In CAGD, the DP curves   are known  as a  normalized totally positive curves that have the linear computational complexity. Because of their geometric properties, these curves will have the shape preserving properties, that is, the form of the curve will maintain the shape of the ...  Read More

On the optimization of Hadoop MapReduce default job scheduling through dynamic job prioritization

Narges Peyravi; Ali Moeini

Volume 52, Issue 2 , December 2020, Pages 109-126

https://doi.org/10.22059/jac.2020.79266

Abstract
  One of the most popular frameworks for big data processing is Apache Hadoop MapReduce. The default Hadoop scheduler uses queue system. However, it does not consider any specific priority for the jobs required for MapReduce programming model. In this paper, a new dynamic score is developed to improve ...  Read More

Fuzzy Cumulative Distribution Function and its Properties

Mehdi Shams; Gholamreza Hesamian

Volume 52, Issue 2 , December 2020, Pages 127-136

https://doi.org/10.22059/jac.2020.79267

Abstract
  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

Two different inverse eigenvalue problems for nonsymmetric tridiagonal matrices

Ferya Fathi; Mohammad Ali Fariborzi Araghi; Seyed Abolfazl Shahzadeh Fazeli

Volume 52, Issue 2 , December 2020, Pages 137-148

https://doi.org/10.22059/jac.2020.79269

Abstract
  Inverse eigenvalue problems (IEPs) of tridiagonal matrices are among the most popular IEPs, this is due to the widespread application of this matrix. In this paper, two different IEPs with different eigen information including eigenvalues and eigenvectors are presented on the nonsymmetric ...  Read More

A note on the approximability of the tenacity of graphs

Vahid Heidari; Dara Moazzami

Volume 52, Issue 2 , December 2020, Pages 149-157

https://doi.org/10.22059/jac.2020.79270

Abstract
  In this paper we show that, if $NP\neq ZPP$, for any $\epsilon > 0$, the tenacity of graphwith $n$ vertices is not approximable in polynomial time within a factor of$\frac{1}{2} \left( \frac{n-1}{2} \right) ^{1-\epsilon}$.  Read More