Volume 56 (2024)
Issue 2 December 2024, Pages 1-161
Issue 1 August 2024, Pages 1-171
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)

There is no charge for publishing a paper at the Journal of Algorithms and Computation

A lightweight anonymity privacy preserving Data Fabric leveraging attribute-based Encryption

Sadra Fathenojavan; Ali Moeini; Ali Kamandi

Volume 56, Issue 2 , December 2024, Pages 1-23

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

Abstract
  A data fabric architecture ensures that different types of data can be quickly and easily integrated, accessed, transformed, and managed. All users involved with data fabric technology, directly or indirectly, have access to appropriate information in real-time, from the correct location and in the proper ...  Read More

Proposing a novel deep method for detection and localization of anatomical landmarks from the endoscopic video frames

Golnaz Tajeddin; Shima Ayyoubi Nezhad; Toktam Khatibi; Masoudreza Sohrabi

Volume 56, Issue 2 , December 2024, Pages 24-40

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

Abstract
  Early detection of gastrointestinal cancer remains a major challenge, particularly in identifying cancerous regions at their initial stages. Anatomical landmarks are crucial for guiding physicians during endoscopic screenings, with accurate localization enhancing diagnostic precision. This study proposes ...  Read More

Real-Time Age, Gender, and Emotion Detection Using a Guided Module-Based Convolutional Neural Network for Facial Expression Analysis

Mohammad Hassan Nataj Solhdar; Naser Erfani majd; Alireza keramatzadeh

Volume 56, Issue 2 , December 2024, Pages 41-67

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

Abstract
  This study presents an innovative approach to real-time facial expression analysis using a guided module-based convolutional neural network. The proposed methodology simultaneously detects emotions, age, and gender with high accuracy, achieving 95.1% for seven facial emotions. The research contributes ...  Read More

A New Algorithm for Computing the Frobenius Number

Abbas Taheri; Saeid Alikhani

Volume 56, Issue 2 , December 2024, Pages 68-74

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

Abstract
  A number $\alpha$ has a representation with respect to the numbers $\alpha_1,...,\alpha_n$, if there exist the non-negativeintegers $\lambda_1,... ,\lambda_n$ such that $\alpha=\lambda_1\alpha_1+...+\lambda_n \alpha_n$. The largest natural number that does not have a representation with respect to the ...  Read More

DataBay: A Unified Platform for Automating Data Warehouse Management, Real-Time Data Processing, and Ensuring Data Quality and Monitoring

Mostafa Ghadimi; Niyusha Baghayi; Alireza Shateri

Volume 56, Issue 2 , December 2024, Pages 75-88

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

Abstract
  As organizations increasingly depend on large-scale data for strategic decision-making, managing data warehouses has become a complex and resource-intensive challenge. This paper introduces DataBay, a unified platform designed to automate the entire data warehouse lifecycle, from data ingestion and transformation ...  Read More

ACCELERATION OF NEAR FIELD COMPUTATION IN MLFMA ON A SINGLE GPU BY GENERATING REDUNDANCY IN DATA

Morteza Sadeghi; Abdolreza Torabi

Volume 56, Issue 2 , December 2024, Pages 89-112

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

Abstract
  Improving efficiency of multi-level fast multi-pole algorithm (MLFMA) on distributed and parallel systems has been vastly studied, specially for GPUs. Unlike the far-field computation, acceleration of near-field computation in MLFMA algorithm on GPUs was of less concern in the literature, however there ...  Read More

NEW FAMILIES OF PAIR DIFFERENCE CORDIAL GRAPHS

R Ponraj; A GAYATHRI

Volume 56, Issue 2 , December 2024, Pages 113-122

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

Abstract
  In this paper we investigate the pair difference cordial labelingbehaviour of diamond ladder graph,lattitude ladder, octopus graph,pagodagraph, planter graph and semi jahangir graph. Prime labeling behaviour of plantergraph, duplication of planter graph, fusion of planter graph,switching of plantergraph, ...  Read More

The Design and Implementation of a Location-based System for Music Recommendation on the Web

Ali Zare Zardiny; MohammadAli Akhavan Rad

Volume 56, Issue 2 , December 2024, Pages 123-134

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

Abstract
  Music serves as a universal medium for expressing emotions and entertainment. With advancements in technology and artificial intelligence, online systems for sharing and recommending music have grown, but a gap remains in location-based, emotion-aware music suggestions. This article proposes a novel ...  Read More

Transforming Education with AI: The Development of a Personalized Learning Algorithm for Individual Learning Styles

Delara Jafari; Zahra Shaterzadeh-Yazdi

Volume 56, Issue 2 , December 2024, Pages 135-150

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

Abstract
  The evolving educational landscape requires innovative teaching methods to enhance learning and accommodate diverse styles. Technologies like artificial intelligence (AI), machine learning (ML), and the Internet of Things (IoT) are transforming education by improving student performance and engagement. ...  Read More

Metropolis-Hasting Idea for Approximating Matrix Inverse

Negin Bagherpour; Nezam Mahdavi Amiri

Volume 56, Issue 2 , December 2024, Pages 151-161

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

Abstract
  Solving a linear system of equations is needed in many different applications and there exist many different techniques to solve such a system with no need to compute inverse matrix, as a costly and not stable computation. But the challenge is that in some other applications such as 3D prints, the goal ...  Read More

A variant of van Hoeij's algorithm to compute hypergeometric term solutions of holonomic recurrence equations
Articles in Press, Accepted Manuscript, Available Online from 13 January 2022

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

Abstract
  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 Convolutional Networks
Articles in Press, Accepted Manuscript, Available Online from 13 January 2022

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

Abstract
   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 ...  Read More

Pair difference cordial labeling of planar grid and mongolian tent
Articles in Press, Accepted Manuscript, Available Online from 13 January 2022

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

Abstract
  \noindent 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 ...  Read More

A comparison between the resolution and linear optimization of FREs defined by product t-norm and geometric mean operator
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

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

Abstract
  In this paper, a type of fuzzy system is firstly investigated whereby the feasible region is defined by the fuzzy relational equalities and the geometric mean as fuzzy composition. Some related basic and theoretical properties are derived and the feasible region is completely determined. Moreover, a ...  Read More

On the J-Tightness of Graphs
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

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

Abstract
  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

A fast algorithm for the linear programming problem constrained with the Weighted power mean -- Fuzzy Relational Equalities (WPM-FRE)
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

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

Abstract
  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

Fuzzy Cumulative Distribution Function \and its Properties
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

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

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

An algorithm to Solve the Linear Programming Problem Constrained with the Harmonic–Fuzzy Relational Equalities
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
  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

Plane Bounded-Degree Spanners Among the Obstacles for the Points in Convex Position
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
  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
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
  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

On the resolution of LP-FRE defined by the convex combination operator
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
  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 convex combination operator. It is proved that the feasible region of the problem can ...  Read More

Priority-Oriented Task Scheduling based on Harris Hawks Optimizer for Cloud Computing
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
   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 ...  Read More

A Systematic Way for Selecting Suitable Journal for Publishing Manuscripts
Articles in Press, Accepted Manuscript, Available Online from 16 January 2022

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

Abstract
  \noindent 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 ...  Read More

$P_3$-Rainbow Edge Colouring of Digraphs
Articles in Press, Accepted Manuscript, Available Online from 16 January 2022

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

Abstract
  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
Articles in Press, Accepted Manuscript, Available Online from 16 January 2022

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

Abstract
  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

An iterative method and maximal solution of Coupled algebraic Riccati equations

Hajar Alimorad

Articles in Press, Accepted Manuscript, Available Online from 29 August 2022

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

Abstract
  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 Hermitian solution of the Coupled Algebraic ...  Read More

ISO Abbreviation: 

J. Algorithm Comput. 

Frequency: Semiannual

Peer Review Policy: Double Blind

Language: English

Acceptance Rate: 10%

Average Time to First Decision: 30 days

Average Time to Final Decision: 6 months

Publishing Policy: Open Access

   

     

Publisher:
University of Tehran

Editorial Board:
Dara Moazzami


Frequency: Monthly

Print ISSN: 2476-2776

Online ISSN: 2476-2784

Indexing and Abstracting

Linkedin

Academia

Magiran

penprofile

...

PlagScan

Any submitted manuscript with plagiarism level greater than 25% will be automatically rejected.

CEIJ and and the Committee on Publication Ethics

This journal subscribes to the principles of, the Committee on Publication Ethics (COPE) http://publicationethics.org/ to deal with acts of misconduct. Using this principles we investigate allegations of misconduct and ensure the integrity of research.