@article {
author = {Ghatee, Mehdi and Khalili, Masoomeh and Teimouri, Mehdi and Bejani, Mohammad Mahdi},
title = {Roadside acoustic sensors to support vulnerable pedestrians via their smartphones},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {135-143},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2019.15479.1017},
abstract = {We propose a new warning system based on smartphones that evaluates the risk of motor vehicle for vulnerable pedestrian (VP). The acoustic sensors are embedded in roadside to receive vehicles sounds and they are classified into heavy vehicle, light vehicle with low speed, light vehicle with high speed, and no vehicle classes. For this aim, we extract new features by Mel-frequency Cepstrum Coefficients (MFCC) and Linear Predictive Coefficients (LPC) algorithms. We use different classification algorithms and show that MLP neural network achieves at least 96.77% in accuracy criterion. To install this system, directional microphones are embedded on roadside and the risk is classified there. Then, for every microphone, a danger area is defined and the warning alarms have been sent to every VPs’ smartphones covered in this danger area.},
keywords = {Signal analysis,smartphone,Road traffic sensing,Road Safety,Vulnerable pedestrians},
url = {https://ajmc.aut.ac.ir/article_3312.html},
eprint = {https://ajmc.aut.ac.ir/article_3312_4fab32f8a3b0bef08afef26d7ff773d5.pdf}
}
@article {
author = {Yarinezhad, Ramin and Hashemi, Seyed Naser},
title = {Approximation algorithms for multi-multiway cut and multicut problems on directed graphs},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {145-152},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2018.15109.1014},
abstract = {In this paper, we study the directed multicut and directed multi-multiway cut problems. The input to the directed multi-multiway cut problem is a weighted directed graph $G=(V,E)$ and $k$ sets $S_1,S_2,...,S_k$ of vertices. The goal is to find a subset of edges of minimum total weight whose removal will disconnect all the connections between the vertices in each set $S_i$, for $1 leq i leq k$. A special case of this problem is the directed multicut problem whose input consists of a weighted directed graph $G=(V,E)$ and a set of ordered pairs of vertices $(s_1,t_1),...,(s_k,t_k)$. The goal is to find a subset of edges of minimum total weight whose removal will make for any $i, 1 leq i leq k, $ there is no directed path from $s_i$ to $t_i$.In this paper, we present two approximation algorithms for these problems. The so called region growing paradigm is modified and used for these two cut problems on directed graphs. using this paradigm, we give an approximation algorithm for each problem such that both algorithms have the approximation factor of $O(k)$ the same as the previous works done on these problems. However, the previous works need to solve $k$ linear programming, whereas our algorithms require only one linear programming. Therefore, our algorithms improve the running time of the previous algorithms.},
keywords = {Approximation algorithm,Computational complexity,NP-hard problems,Directed multi-multiway cut,Directed multicut cut},
url = {https://ajmc.aut.ac.ir/article_3810.html},
eprint = {https://ajmc.aut.ac.ir/article_3810_5e4da5297ba5154b4c1b08186e4dbb8e.pdf}
}
@article {
author = {Yazdaniyan, Zahra and Shamsi, Mostafa and de Pinho, Maria do Rosario and Foroozandeh, Zahra},
title = {Heuristic artificial bee Colony algorithm for solving the Homicidal Chauffeur differential game},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {153-163},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2019.16949.1025},
abstract = {In this paper, we consider the Homicidal Chauffeur (HC) problem as an interesting and practical differential game. At first, we introduce a bilevel optimal control problem (BOCP) and prove that a saddle point solution for this game exists if and only if this BOCP has an optimal solution in which the optimal value of the objective function is equal to 1. Then, BOCP is discretized and converted to a nonlinear bilevel programming problem. Finally, an Artificial Bee Colony (ABC) algorithm is used for solving this problem, in which the lower-level problem will be considered as a constraint and solved by an NLP-solver. Finally, to demonstrate the effectiveness of the presented method, various cases of HC problem are solved and the simulation results are reported.},
keywords = {Differential game,Homicidal chauffeur problem,Artificial bee colony algorithm,Bilevel optimal control problem},
url = {https://ajmc.aut.ac.ir/article_3819.html},
eprint = {https://ajmc.aut.ac.ir/article_3819_c45e1fb78e50d90beda2caf6d6315eca.pdf}
}
@article {
author = {Salari, Farzaneh and Zare Mirakabad, Fatemeh and Sadeghi, Mehdi},
title = {A new hash function and its use in read mapping on genome},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {165-170},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2019.15991.1020},
abstract = {Mapping reads onto genomes is an indispensable step in sequencing data analysis. A widely used method to speed up mapping is to index a genome by a hash table, in which genomic positions of k-mers are stored in the table. The hash table size increases exponentially with the k-mer length and thus the traditional hash function is not appropriate for a k-mer as long as a read. We present a hashing mechanism by two functions named score1 and score2 which can hash sequences with the length of reads. The size of hash table is directly proportional to the genome size, which is absolutely lower than that of hash table built by the conventional hash function. We evaluate our hashing system by developing a read mapper and running the mapper on E. coli genome with some simulated data sets. The results show that the high percentage of simulated reads can be mapped to correct locations on the genome.},
keywords = {Read mapping,Reference-based assembly and hash function},
url = {https://ajmc.aut.ac.ir/article_3820.html},
eprint = {https://ajmc.aut.ac.ir/article_3820_01bc4c431d4b93521c3982c19d0ddeb0.pdf}
}
@article {
author = {Farahzad, Sina and Rahmati, Ali and Rahmati, Zahed},
title = {Counting closed billiard paths},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {171-177},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2020.17320.1026},
abstract = {Given a pool table enclosing a set of axis-aligned rectangles, with a total of $n$ edges, this paper studies {it closed billiard paths}. A closed billiard path is formed by following the ball shooting from a starting point into some direction, such that it doesn't touch any corner of a rectangle, doesn't visit any point on the table twice, and stops exactly at the starting position.The {it signature} of a billiard path is the sequence of the labels of edges in the order that are touched by the path, while repeated edge reflections like $abab$ are replaced by $ab$.We prove that the length of a signature is at most $4.5n-9$, and we show that there exists an arrangement of rectangles where the length of the signature is $1.25n+2$. We also prove that the number of distinct signatures for fixed shooting direction (ang{45}) is at most $1.5n-6$.},
keywords = {Billiard Paths,Maximum Path Length,computational geometry},
url = {https://ajmc.aut.ac.ir/article_3821.html},
eprint = {https://ajmc.aut.ac.ir/article_3821_c20d01188914b161943269bccd3f81c1.pdf}
}
@article {
author = {Tanhaei, Mohammad},
title = {A model transformation approach to perform refactoring on software architecture using refactoring patterns based on stakeholder requirements},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {179-216},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2020.17541.1027},
abstract = {Software Architecture (SA) generally has a considerable influence on software quality attributes. Coordination of software architecture to the requirements of the stakeholders and avoiding common mistakes and faults in designing SA increases the chance of success of the project and satisfaction of the stakeholders. Making the wrong decisions at the architectural design phase usually proves very costly later on. Refactoring is a method which helps in detecting and avoiding complications, improving the internal characteristics of software, while keeping the external behavior intact.Various problems can undermine the architecture refactoring process. The existence of different requirements in different domains, the diversity of architecture description languages, and the difficulty of describing refactoring patterns lead to the difficulty of performing automatic and semi-automatic refactoring on the SA.In this study, we use model transformation as a way to overcome the above mentioned difficulties. In this regard, the first step is converting the SA to a pivot-model. Then, based on the refactoring patterns, the refactoring process is performed on the pivot-model. And finally, the pivot-model is converted back to the original (source) model. In this paper, the requirements of the stakeholders are taken into account in the refactoring process by modeling them as refactoring goals. These goals show the importance of the quality attributes in the project and the process of refactoring. The applicability of the framework is demonstrated using a case study.},
keywords = {Software Architecture Refactoring,Software Architecture,Pattern,Model transformation,Refactoring},
url = {https://ajmc.aut.ac.ir/article_3822.html},
eprint = {https://ajmc.aut.ac.ir/article_3822_432b3d12eea807c32e9192392dc101fa.pdf}
}
@article {
author = {Saeedi Madani, Sara and Kiani, Dariush},
title = {The regularity of binomial edge ideals of graphs},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {217-221},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2020.16433.1024},
abstract = {In this paper, we study the Castelnuovo-Mumford regularity and the graded Betti numbers of the binomial edge ideals of some classes of graphs. Our special attention is devoted to a conjecture which asserts that the number of maximal cliques of a graph provides an upper bound for the regularity of its binomial edge ideal.},
keywords = {Binomial edge ideal,Castelnuovo-Mumford regularity,free cut edge},
url = {https://ajmc.aut.ac.ir/article_3929.html},
eprint = {https://ajmc.aut.ac.ir/article_3929_11dfb7311a254437af0ec3219693fa9c.pdf}
}
@article {
author = {Nadjafikhah, Mehdi},
title = {Lie group analysis for short pulse equation},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {223-227},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2020.18416.1032},
abstract = {In this paper, the classical Lie symmetry analysis and the generalized form of Lie symmetry method are performed for a general short pulse equation. The point, contact and local symmetries for this equation are given. In this paper, we generalize the results of H.~Liu and J.~Li, and add some further facts, such as optimal system of Lie symmetry sub-algebras and two local symmetries.},
keywords = {Lie symmetry analysis,General short pulse equation,Invariant solution,Local symmetry},
url = {https://ajmc.aut.ac.ir/article_3997.html},
eprint = {https://ajmc.aut.ac.ir/article_3997_f80d56061dc269a30df6a98eabe65c7f.pdf}
}
@article {
author = {Yar Ahmadi, Mohamad},
title = {On the gradient Finsler Yamabe solitons},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {229-233},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2020.18420.1034},
abstract = {Here, it is proved that the potential functions of Yamabe solitons have atmost quadratic growth in distance function. Also it is obtained a finite topologicaltype property on complete gradient Yamabe solitons under suitablescalar curvature assumptions.},
keywords = {Finsler metric,gradient Yamabe soliton,finite topological type},
url = {https://ajmc.aut.ac.ir/article_3998.html},
eprint = {https://ajmc.aut.ac.ir/article_3998_36fc0d56185b0ac9a40ca6952129f107.pdf}
}
@article {
author = {Derakhshan, Mohammadhossein and Aminataei, Azim},
title = {Homotopy perturbation transform method for time-fractional Newell-Whitehead-Segel equation containing Caputo-Prabhakar fractional derivative},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {235-250},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2020.18012.1028},
abstract = {The main aim of the current article is tofind the solution for Newell-Whitehead-Segel equationswith constant coefficients containing Caputo-Prabhakar fractional derivative using the homotopy perturbationtransform method.The convergence analysis of the obtained solution for the proposedfractional order model is presented.Four examples are presentedto illustrate the efficiency and applicability and accurateness of the proposed numerical technique.},
keywords = {Nonlinear fractional differential equations,Newell-Whitehead-Segel equations,Homotopy perturbation transform method,Caputo-Prabhakar fractional derivative},
url = {https://ajmc.aut.ac.ir/article_3999.html},
eprint = {https://ajmc.aut.ac.ir/article_3999_ae5645ab55ab9d75e12b5a6dd5b740e1.pdf}
}
@article {
author = {Abolpour, Khadijeh and Zahedi, Mohammad mehdi and Shamsizadeh, Marzieh},
title = {New directions in general fuzzy automata: a dynamic-logical view},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {251-262},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2020.18629.1040},
abstract = {In the current study, by a general fuzzy automaton we aim at showinga set of propositions related to a given automaton showing that the truth-values aredepended on thestates, inputs and membership values of active states at time t. Thisnew approach enables us to consider automata from a different point of view which ismore close to logical treatment and helps us make estimations about the behavior ofautomaton particularly in a ondeterministic mode. The logic consists of propositionson the given GFA and its dynamic nature is stated by means of the so-called transitionfunctor. This logic enables us to derive a certain relation on the set of states labeledby inputs. In fact, it is shown that if our set of propositions is large enough, thisrecovering of the transition relation is possible. Through a synthesis in the theory ofsystems, this study contributes to construct a general fuzzy automaton which realizesa dynamic process at least partially known to the user, which has been fully achievedin Theorem 3.6. Also, we study the theory of general fuzzy automata by using theconcepts of operators. Such operators help us in the algebraic study of general fuzzyautomata theory and provide a platform to use fuzzy topological therein. Further,a Galois connection is obtained between the state-transition relation on states andthetransition operators on propositions. To illustrate the proposed approach, thesubject matter is more elaborated in detail through examples.},
keywords = {Dynamic Logic,General Fuzzy Automata,Proposition,Functor,Active State},
url = {https://ajmc.aut.ac.ir/article_4026.html},
eprint = {https://ajmc.aut.ac.ir/article_4026_a9235238f7454c5c77fa22b6d639eda7.pdf}
}
@article {
author = {Sharifani, Pouyeh and Hooshmandasl, Mohammadreza and Alikhani, Saeid},
title = {A linear-time algorithm to compute total [1,2]-domination number of block graphs},
journal = {AUT Journal of Mathematics and Computing},
volume = {1},
number = {2},
pages = {263-270},
year = {2020},
publisher = {Amirkabir University of Technology},
issn = {},
eissn = {},
doi = {10.22060/ajmc.2020.18444.1035},
abstract = {Let $G=(V,E)$ be a simple graph without isolated vertices. A set $Dsubset V$ is a total $[1, 2]$-dominating set if for every vertex $v in V$, $1 leq |N(v) cap D| leq 2$. The total $[1,2]$-domination problem is to determine the total $[1,2]$-domination number $gamma_{t[1,2]}(G)$, which is the minimum cardinality of a total $[1, 2]$-dominating set for a graph $G$.In this paper, we present a linear-time algorithm to compute $gamma_{t[1,2]}(G)$ for a block graph $G$.},
keywords = {Total $[1, 2]$-set,Dominating set,Block graph},
url = {https://ajmc.aut.ac.ir/article_4029.html},
eprint = {https://ajmc.aut.ac.ir/article_4029_c5e379fd5ea2da4be1fd158b707875ec.pdf}
}