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)
Opinion Fraud Detection in Streaming Comments Utilising Node Similarity in the Review Network

Shahab Ghodsi; Ali Moieni

Volume 54, Issue 2 , December 2022, , Pages 21-35

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

Abstract
  One important criterion in decision-making when we want to purchase a product or a service is users’ reviews. When something is valuable, it’s fake and will be created as well. It is the same for users’ reviews. The purpose of these fake reviews is to deceive users, leading them to ...  Read More

Distribution of RNA 5-mers in Epigenetic Modification Regions and Genes Interactions

Dariush Salimi; mohaddese salimi; Ali Moieni

Volume 54, Issue 2 , December 2022, , Pages 143-162

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

Abstract
  The demand for extracting sophisticated features, capable of effectively predicting gene interaction networks, from DNA or RNA sequences has increased in computational biology. The epigenetic modifications along with their patterns have been intensely recognized as appealing features affecting gene interaction. ...  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

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

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

BloomEclat: Efficient Eclat Algorithm based on Bloom filter

sina abbasi; Ali Moieni

Volume 53, Issue 1 , June 2021, , Pages 197-208

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

Abstract
  Eclat is an algorithm that finds frequent itemsets. It uses a vertical database and calculates item's support by intersecting transactions. However, Eclat suffers from the exponential time complexity of calculating the intersection of transactions. In this paper, a randomized algorithm called BloomEclat ...  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 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

Normalized Tenacity and Normalized Toughness of Graphs

A. Javan; M. Jafarpour; D. Moazzami; A. Moieni

Volume 49, Issue 2 , December 2017, , Pages 141-159

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

Abstract
  In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters.  Using these new parameters enables the graphs with different orders be comparable with each other regarding their ...  Read More

Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model

Mahdi Heidari; Ali Golshani; D. Moazzami; Ali Moeini

Volume 47, Issue 1 , June 2016, , Pages 79-92

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

Abstract
  In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we ...  Read More

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

S. Saadatmand; D. Moazzami; A. Moeini

Volume 47, Issue 1 , June 2016, , Pages 93-99

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

Abstract
  In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors ...  Read More