Mohammadhadi Alaeiyan

• Doctor of Computer Engineering
• Professor (Assistant) at K.N.Toosi University of Technology

With the Internet becoming more accessible, protecting our digital identities has become more crucial than ever. Our devices are always online, sharing data, and exposed to numerous threats. Traditional methods of detecting malware are no longer adequate due to the rapid advancement and complexity of malware. To address these challenges, researcher...

In contemporary times, the genesis of new and efficient innovative ideas necessitates a comprehensive understandingof various technologies. Given the extensive data inherent in these technologies, it is imperative to employ automatedmethods to elucidate the interconnections among them. This article endeavors to delineate the associationsbetween dis...

Graph properties’ computation is widely used in science. Some algorithms for specific graphs help us compute properties like girth, clique number, and independent number. Nevertheless, processing time would be increased by the growth of the number of graph vertices. This paper suggests machine learning methods for computing a given graph’s girth, m...

Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical results, we are particularly interested in submissions that report on experimental and applied research of general algorithmic interest. Special consideration will be...

Nullity computation is widely used to determine the stability of a chemical molecule. Mainly, a molecule is presented as a graph, and the graph nullity value clarifies the strength of the molecule. Some formulas for specific graphs help us compute the nullity value, but it is challenging to remember the formula of each particular graph. However, an...

The 7th International Conference on Combinatorics, Cryptography, Computer Science and Computation (I4C2022) will be held in the School of Mathematics at Iran University of Science and Technology, Tehran, Iran 2022. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to comp...

14th Iranian International Group Theory Conference The 14th Iranian International Group Theory Conference will be held in the School of Mathematics, Iran University of Science and Technology, Tehran, Iran on 2-3th February 2022. Original research papers in all areas of group theory will be acceptable. In addition to theoretical results, we are par...

Early prediction of malicious activity can help prevent irreparable damage caused by rogue actions. A malware analysis tool can anticipate malicious activity and stop the execution of the instance based on API calls to avoid the damage caused by the malware. The anticipation operation examines signatures as behaviors defined in a hierarchical model...

6th International Conference on Combinatorics, Cryptography, Computer Science and Computation (I4C2021) will be held in Tehran, Iran 2021. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical results, we are particularly...

The rapid increase in the number of malicious programs has made malware forensics a daunting task and caused users’ systems to become in danger. Timely identification of malware characteristics including its origin and the malware sample family would significantly limit the potential damage of malware. This is a more profound risk in Cyber-Physical...

Domain name detection techniques are widely used to detect Algorithmically Generated Domain names (AGD) applied by Botnets. A major difficulty with these algorithms is to detect those generated names which are meaningful. In this way, Command and Control (C2) servers are detected. Machine learning techniques have been of great use to generalize the...

Under a perfect coloring with m colors (a perfect m-coloring) with matrix A={aij}i,j=1,…,m of a graph G, we understand a coloring of the vertices G with the colors {1,…,m} such that the number of vertices of color j adjacent to a fixed vertex of color i is equal to aij independently of the choice of the latter vertex. The matrix A is called the par...

Security threats due to malicious executable are getting more serious. A lot of researchers are interested in combating malware attacks. In contrast, malicious users aim to increase the usage of polymorphism and metamorphism malware in order to increase the analysis cost and prevent being identified by anti-malware tools. Due to the intuitive simil...

This paper presents an overview of the findings on trigger-based malware behavior elicitation, classification, modeling, and behavioral signature generation. Considering reactions to environmental conditions, we suggest a new classification of trigger-based malware behavior as evasive and elicited behaviors. Both these behaviors are concerned with...

A perfect m-coloring of a graph G with a matrix A = {a(ij)}(i,j) = (1), ... , (m) is a coloring of the vertices of G into the set of colors {1, ... , m} such that, for all i, j is an element of {1, ... , m}, every vertex of color i is adjacent to exactly vertices of color j. The matrix A is called the parameter matrix of a perfect coloring. In this...

The aim of this paper is to approximate the numerical result of executing a program/function with a number of input parameters and a single output value with a small number of training points. Curve fitting methods are preferred to non-deterministic methods such as neural network and fuzzing system methods, because they can provide relatively more...

Behavior analysis has been mainly used as a means for recognizing unknown malwares. Behavior could be modeled as sequences of system calls. Sequences of system calls are used as a means for identifying the behavior of malicious code. The difficulty is to detect the repeated sequences of system calls within loop bodies. These sequences could be comp...

A labeling of the edges of a graph is called vertex-coloring if the labeled degrees of the vertices yield a proper coloring of the graph. In this paper, we show that such a labeling is possible from the label set 1,2,3 for the complete graph K n , n ≥ 3.