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)
On the optimization of Dombi non-linear programming

A. Ghodousian; Fatemeh Elyasimohammadi

Volume 52, Issue 1 , June 2020, Pages 1-36


  Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization ...  Read More

Neutrosophic Soft $\alpha-$Open Set in Neutrosophic Soft Topological Spaces

Arif Mehmood; Fawad Nadeem; Choonkil Park; Giorgio Nordo; Humaira Kalsoom; Muhammad Rahim Khan; Naeem Abbas

Volume 52, Issue 1 , June 2020, Pages 37-63


  In this paper, the notion of generalized neutrosophic soft open set (GNSOS) in neutrosophic soft  open set (GNSOS) in neutrosophic soft topological structures relative to neutrosophic soft points is introduced.The concept of generalized neutrosophic soft separation axioms in neutrosophic soft topological ...  Read More

What makes a Rhythm to be Bad

Saeed Jafaripour; Zahra Nilforoushan; Keivan Borna

Volume 52, Issue 1 , June 2020, Pages 65-82


  Deciding whether a musical rhythm is good or not, depends on many factors like geographical conditions of a region, culture, the mood of society, the view of rhythm over years, and so on. In this paper, we want to make a decision from the scientific point of view, using geometric features of rhythms, ...  Read More

Efficient Storage and Retrieval of In-Memory Static Data

Anuj Kapoor

Volume 52, Issue 1 , June 2020, Pages 83-96


  Hash or B-Tree based composite indexes, are the two most commonly used techniques for searching and retrieving data from memory. Although these techniques have a serious memory limitation, that restricts \textit{freedom} to search by any combination of single key/data attribute, that comprises the composite ...  Read More

A Computational Criterion for the Irrationality of Some Real Numbers

Peyman Nasehpour

Volume 52, Issue 1 , June 2020, Pages 97-104


  In this paper, we compute the asymptotic average of the decimals of some real numbers. With the help of this computation, we prove that if a real number cannot be represented as a finite decimal and the asymptotic average of its decimals is zero, then it is irrational. We also show that the asymptotic ...  Read More

Survival analyses with dependent covariates: A regression tree-base approach

Mostafa Boskabadi; Mahdi Doostparast; Majid Sarmad

Volume 52, Issue 1 , June 2020, Pages 105-129


  Cox proportional hazards models are the most common modelling framework to prediction and evaluation of covariate effects in time-to-event analyses.These models usually do not account the relationship among covariates which may have impacts on survival times.In this article, we introduce regression tree ...  Read More

On computing total double Roman domination number of trees in linear time

Abolfazl Poureidi

Volume 52, Issue 1 , June 2020, Pages 131-137


  Let $G=(V,E)$ be a graph. A doubleRoman dominating function (DRDF) on $G$ is a function$f:V\to\{0,1,2,3\}$ such that for every vertex $v\in V$if $f(v)=0$, then either there is a vertex $u$ adjacent to $v$ with $f(u)=3$ orthere are vertices $x$ and $y$ adjacent to $v$ with $f(x)=f(y)=2$ and if $f(v)=1$, ...  Read More

A security aware workflow scheduling in hybrid cloud based on PSO algorithm

Maedeh Mehravaran; Fazlollah Adibnia; Mohammad-Reza Pajoohan

Volume 52, Issue 1 , June 2020, Pages 139-161


  In real world, organization's requirements for high performance resources and high capacity storage devices encourage them to use resources in public clouds. While private cloud provides security and low cost for scheduling workflow, public clouds provide a higher scale, potentially exposed to the risk ...  Read More

On the expected weight of the theta graph on uncertain points

Behnam Iranfar; Mohammad Farshi

Volume 52, Issue 1 , June 2020, Pages 163-174


  Given a point set $S\subset \mathbb{R}^d$, the $\theta$-graph of $S$ is as follows: for each point $s\in S$, draw cones with apex at $s$ and angle $\theta$ %fix a line through $p$ at each cone and connect $s$ to the point in each cone such that the projection of the point on the bisector of the cone ...  Read More


.Dara Moazzami

Volume 52, Issue 1 , June 2020, Pages 175-182


  The edge-tenacity $T_e(G)$ of a graph G was defined as\begin{center} $T_e(G)=\displaystyle \min_{F\subset E(G)}\{\frac{\mid F\mid +\tau(G-F)}{\omega(G-F)}\}$\end{center}where the minimum is taken over all edge cutset F of G. We defineG-F to be the graph induced by the edges of $E(G)-F$, $\tau(G-F)$is ...  Read More

A Note on Early Warning Systems for Monitoring the Inflation of Iran

Elham Daadmehr; Reza Habibi

Volume 52, Issue 1 , June 2020, Pages 183-195


  To check the financial stability, it is important to alarm the possibility of future potential financial crisis. In the literature, the early warning system (EWS) is designed to warn the occurrence of a financial crisis before it happens. This tool gives strengthens to managers to make efficient policy ...  Read More

On Point-inclusion Test in Convex Polygons and Polyhedrons

Mahdi Imanparast; Mehdi Kazemi Torbaghan

Volume 52, Issue 1 , June 2020, Pages 197-207


  A new algorithm for point-inclusion test in convex polygons is introduced. The proposed algorithm answers the point-inclusion test in convex polygons in $\mathcal{O}(\log n)$ time without any preprocessing and with $\mathcal{O}(n)$ space. The proposed algorithm is extended to do the point-inclusion test ...  Read More