List of Articles
-
Open Access Article
1 - Presenting a Network-on-Chip Mapping Approach Based on Harmony Search Algorithm
Zahra Bagheri Fatemeh Vardi Alireza MahjoubIn network-on-chip implementation, mapping can be considered as an important step in application implementation. The tasks of an application are often represented in the form of a core graph. The cores establish a link between themselves using a communication platform a MoreIn network-on-chip implementation, mapping can be considered as an important step in application implementation. The tasks of an application are often represented in the form of a core graph. The cores establish a link between themselves using a communication platform and often the network on the chip. For finding proper mapping for an application, developers have proposed various algorithms. In most cases, due to the complexity, exact search methods are used to find the mapping. However, these methods are suitable for networks with small dimensions. As the size of the network increases, the search time also increases exponentially. This article, from the perspective of a heuristic approach, uses the harmony search method to decide when to connect cores to routers. Our approach uses an improved version of the harmony search algorithm with a focus on reducing power consumption and delay. Algorithm complexity analysis reveals a more appropriate solution compared to similar algorithms with respect to application traffic pattern. Compared to similar methods, the algorithm achieves 39.98% less delay and 61.11% saving in power consumption. Manuscript profile -
Open Access Article
2 - Semantic Word Embedding Using BERT on the Persian Web
shekoofe bostan Ali-Mohammad Zare-Bidoki mohamad reza pajohanUsing the context and order of words in sentence can lead to its better understanding and comprehension. Pre-trained language models have recently achieved great success in natural language processing. Among these models, The BERT algorithm has been increasingly popular MoreUsing the context and order of words in sentence can lead to its better understanding and comprehension. Pre-trained language models have recently achieved great success in natural language processing. Among these models, The BERT algorithm has been increasingly popular. This problem has not been investigated in Persian language and considered as a challenge in Persian web domain. In this article, the embedding of Persian words forming a sentence was investigated using the BERT algorithm. In the proposed approach, a model was trained based on the Persian web dataset, and the final model was produced with two stages of fine-tuning the model with different architectures. Finally, the features of the model were extracted and evaluated in document ranking. The results obtained from this model are improved compared to results obtained from other investigated models in terms of accuracy compared to the multilingual BERT model by at least one percent. Also, applying the fine-tuning process with our proposed structure on other existing models has resulted in the improvement of the model and embedding accuracy after each fine-tuning process. This process will improve result in around 5% accuracy of the Persian web ranking. Manuscript profile -
Open Access Article
3 - Video Summarization Using a Clustering Graph Neural Networks
Mahsa RahimiResketi Homayun Motameni Ebrahim Akbari Hossein NematzadehThe increase of cameras nowadays, and the power of the media in people's lives lead to a staggering amount of video data. It is certain that a method to process this large volume of videos quickly and optimally becomes especially important. With the help of video summar MoreThe increase of cameras nowadays, and the power of the media in people's lives lead to a staggering amount of video data. It is certain that a method to process this large volume of videos quickly and optimally becomes especially important. With the help of video summarization, this task is achieved and the film is summarized into a series of short but meaningful frames or clips. This study tried to cluster the data by an algorithm (K-Medoids) and then with the help of a convolutional graph attention network, temporal and graph separation is done, then in the next step with the connection rejection method, noises and duplicates are removed, and finally summarization is done by merging the results obtained from two different graphical and temporal steps. The results were analyzed qualitatively and quantitatively on three datasets SumMe, TVSum, and OpenCv. In the qualitative method, an average of 88% accuracy rate in summarization and 31% error rate was achieved, which is one of the highest accuracy rates compared to other methods. In quantitative evaluation, the proposed method has a higher efficiency than the existing methods. Manuscript profile -
Open Access Article
4 - Proposing a Detection and Mitigation Approach for DDoS Attacks on SDN-Based IoT Networks
fatemeh MotieShirazi Seyedakbar MostafaviInternet of Things (IoT) is a network of objects on which objects can communicate with other objects. The Internet of Things is currently constantly under numerous attacks due to technical, legal and human problems. One of the most important of these attacks is the Deni MoreInternet of Things (IoT) is a network of objects on which objects can communicate with other objects. The Internet of Things is currently constantly under numerous attacks due to technical, legal and human problems. One of the most important of these attacks is the Denial of Service (DoS) attack, in which normal network services are out of service and it is impossible for objects and users to access the server and other resources. Existing security solutions have not been able to effectively prevent interruption attacks in Internet of Things services. Software-oriented network (SDN) is a new architecture in the network based on the separation of the control and data plane of the network. Programmability and network management capability by SDN can be used in IoT services because some IoT devices send data periodically and in certain time intervals. SDN can help reduce or prevent the data flood caused by IoT if properly deployed in the data center. In this article, a method to detect DDoS attacks in Internet of Things based on SDN is presented and then an algorithm to reduce DDoS attacks is presented. The proposed method is based on the entropy criterion, which is one of the most important concepts in information theory and is calculated based on the characteristics of the flow. In this method, by using two new components on the controller to receive incoming packets and considering the time window and calculating entropy and flow rate, a possible attack is detected in the network, and then based on the statistics of the flow received from the switches, the certainty of the attack is determined. Compared to the existing methods, the proposed method has improved 12% in terms of attack detection time and 26% in terms of false positives/negatives. Manuscript profile -
Open Access Article
5 - Ontology Matching Based on Maintaining Local Similarity of Information Using Propagation Technique
NazarMohammad Parsa Asieh GhanbarpourIn recent years, ontologies, as one of the most important components of the semantic web, have expanded in various fields. The problem of ontology matching has been raised with the aim of creating a set of mappings between entities of ontologies. This problem is classif MoreIn recent years, ontologies, as one of the most important components of the semantic web, have expanded in various fields. The problem of ontology matching has been raised with the aim of creating a set of mappings between entities of ontologies. This problem is classified as an NP-hard problem. Therefore, greedy methods have been proposed to solve it in different ways. Selecting the appropriate lexical, structural and semantic similarity criteria and using an effective combination method to obtain the final mapping is one of the most important challenges of these methods. In this paper, an automatic method of matching ontologies is proposed to provide a one-to-one mapping set. This method detects primary mappings based on a new lexical similarity criterion, which is accordance with the descriptive essence of entities and combining this similarity with semantic similarity obtained from external semantic sources. By locally propagating the score of initial mappings in the class hierarchy graph, structurally matching entities are identified. In this method, property matching is examined in a separate step. In the final step, the mapping filter is applied in order to maintain the consistency of the final mapping set. In the evaluation section, comparing the performance of the lexical similarity measure compared to other proposed textual similarity measures, indicates the efficiency of this measure in the problem of ontology matching. In addition, the results of the proposed matching system compared to the results of the set of participating systems in the OAEI competitions shows this system in the second place and higher than many complex matching systems. Manuscript profile -
Open Access Article
6 - Distributed Primal-Dual Algorithm with Variable Parameters and Bidirectional Incremental Cooperation
Ghanbar AzarniaSpecial conditions of wireless sensor networks, such as energy limitation, make it essential to accelerate the convergence of algorithms in this field, especially in the distributed compressive sensing (DCS) scenarios, which have a complex reconstruction phase. This pap MoreSpecial conditions of wireless sensor networks, such as energy limitation, make it essential to accelerate the convergence of algorithms in this field, especially in the distributed compressive sensing (DCS) scenarios, which have a complex reconstruction phase. This paper presents a DCS reconstruction algorithm that provides a higher convergence rate. The proposed algorithm is a distributed primal-dual algorithm in a bidirectional incremental cooperation mode where the parameters change with time. The parameters are changed systematically in the convex optimization problems in which the constraint and cooperation functions are strongly convex. The proposed method is supported by simulations, which show the higher performance of the proposed algorithm in terms of convergence rate, even in stricter conditions such as the small number of measurements or the lower degree of sparsity. Manuscript profile