Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
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)

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

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

A. Ghodousian; Parmida Mirhashemi

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


  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

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

Approximating the Number of Lattice Points inside a Regular Polygon

Mahdi Imanparast

Volume 54, Issue 1 , June 2022, , Pages 89-98


  We study the problem of counting the number of lattice points inside a regular polygon with $n$ sides when its center is at the origin and present an exact algorithm with $\mathcal{O}(k^{2}\log n)$ time and two approximate answers for this problem, where $k$ is the absolute value of side length of the ...  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

Comparing encryption algorithms and providing a new algorithm based on increasing data security

Fariborz rasouli

Volume 54, Issue 2 , December 2022, , Pages 93-103


  In this article, we examine different algorithms in the field of cryptography. And we analyze them from different aspects. Also, we introduce a new solution and algorithm, based on increasing data security. Our proposed method can perform the task optimally and efficiently compared to similar algorithms. ...  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

A Numerical Method for Eigensolution of Tridiagonal Matrices

Iman Shojaei; Hossein Rahami

Volume 53, Issue 1 , June 2021, , Pages 97-115


  In this paper we have developed an iterative method to solve eigenproblem for non-repetitive tridiagonal matrices. The importance of eigensolution for tridiagonal matrices is that in many algorithms the eigneproblem for an arbitrary matrix is first converted to the eigenproblem for a tridiagonal matrix ...  Read More

Generalization of DP Curves and Surfaces

Davood Bakhshesh

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


  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

Relative Clustering Coefficient

Elena Touli; Oscar Lindberg

Volume 54, Issue 1 , June 2022, , Pages 99-108


  In this paper, we relatively extend the definition of the global clustering coefficient to another clustering, which we call it \emph{relative clustering coefficient}. The idea of this definition is to ignore the edges in the network that the probability of having an edge is $0$. Here, we also consider ...  Read More

Hybrid Filter-Wrapper Feature Selection using Equilibrium Optimization

Mohammad Ansari Shiri; Najme Mansouri

Volume 55, Issue 1 , June 2023, , Pages 101-122


  The topic of feature selection has become one of the hottest subjects in machine learning over the last few years. The results of evolutionary algorithm selection have also been promising, along with standard feature selection algorithms. For K-Nearest Neighbor (KNN) classification, this paper presents ...  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

Turbulent Supply Chain Control with Entropy Minimization Approach

Mojtaba Azizian; Mohammad Mehdi Sepehri

Volume 54, Issue 2 , December 2022, , Pages 105-122


  Entropy is a measure of disorder in a system and is widely used in other scientific and engineering disciplines such as statistical mechanics and information theory. In a chaotic supply chain, the goal is to reduce chaotic behaviors and predict the future of the supply chain. In this case, relationships ...  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


  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

An iterative method and maximal solution of Coupled algebraic Riccati equations

Hajar Alimorad

Volume 54, Issue 1 , June 2022, , Pages 109-123


  Coupled Riccati equation has widely been applied to various engineering areas such as jump linear quadratic problem, particle transport theory, and Wiener–Hopf decomposition of Markov chains. In this paper, we consider an iterative method for computing the Hermitian solution of the Coupled Algebraic ...  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

An Alternative Proof for a Theorem of R.L. Graham Concerning CHEBYSHEV Polynomials

A.M.S.. Ramasamy; R Ponraj

Volume 53, Issue 1 , June 2021, , Pages 117-122


  In this paper, an alternative proof is provided for a theorem of R.L.Graham concerning Chebyshev polynomials.  While studying the properties of a double star, R.L.Graham [2] proved a theorem concerning Chebyshev polynomials of the first kind ${T_n (x)}$. The purpose of this paper is to provide an ...  Read More

On the Minimum of True Matches in Exact Graph Matching with Simulated Annealing

Hashem Ezzati; Mahmood Amintoosi; Hashem Tabasi

Volume 53, Issue 1 , June 2021, , Pages 123-134


  Graph matching is one of the most important problems in graph theory and combinatorial optimization, with many applications in various domains. Although meta-heuristic algorithms have had good performance on many NP-Hard and NP-Complete problems, but for graph matching problem, there were not reported ...  Read More

An algorithm to Solve the Linear Programming Problem Constrained with the Harmonic–Fuzzy Relational Equalities

Amin Ghodousian; Babak Sepehri Rad; oveys qodousian

Volume 54, Issue 2 , December 2022, , Pages 123-135


  In this paper, a linear programming problem is investigated in which the feasible region is formed as the intersection of fuzzy relational equalities and the harmonic mean operator is considered as fuzzy composition. Theoretical properties of the feasible region are derived. It is proved that the feasible ...  Read More

A Note on Change Point Analysis Using Filtering

Reza Habibi

Volume 55, Issue 1 , June 2023, , Pages 123-129


  The Kalman-Bucy filter is studied under different scenarios for observation and state equations, however, an important question is, how this filter may be applied to detect the change points. In this paper, using the Bayesian approach, a modified version of this filter is studied which has good and justifiable ...  Read More

Speeding up the Arc Consistency algorithm in Constraint Satisfaction Problems: A New Modification of AC-3

Yaser Shokri Kalandaragh,

Volume 54, Issue 1 , June 2022, , Pages 125-138


  Dealing with constraints is always very common in real-world implementation issues. Search algorithms for real problems are also no exception. Because of the constraints in search problems (named Constraint Satisfaction Problems (CSPs)), their main solving algorithm is presented in backtracking form. ...  Read More

Fuzzy Cumulative Distribution Function and its Properties

Mehdi Shams; Gholamreza Hesamian

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


  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

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

Sequence pairs related to produced graphs from a method for dividing a natural number by two.

Mohammad Zeynali Azim; Saeid Alikhani; Babak Anari; Bagher Zarei

Volume 55, Issue 1 , June 2023, , Pages 131-140


  This paper is about producing a new kind of pairs which we call MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present some applications of these pairs that show their interesting properties ...  Read More

A fast algorithm for the linear programming problem constrained with the Weighted power mean -- Fuzzy Relational Equalities (WPM-FRE)

Amin Ghodousian; Sara Zal

Volume 53, Issue 1 , June 2021, , Pages 135-148


  In this paper, a linear programming problem is investigated in which the feasible region is formed as a special type of fuzzy relational equalities (FRE). In this type of FRE, fuzzy composition is considered as the weighted power mean operator (WPM). Some theoretical properties of the feasible region ...  Read More