﻿<?xml version="1.0" encoding="utf-8"?><records><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-09</publicationDate><volume>22</volume><issue>2</issue><startPage>65</startPage><endPage>84</endPage><documentType>article</documentType><title language="eng">A New Green Optimal Routng Algorithm in Data Communication Networks</title><authors><author><name>Mohsen Heydarian</name><email>mohsentabriz900@gmail.com</email><affiliationId>1</affiliationId></author><author><name>Fariba Darvishiyan</name><email>f.darvishyan@azaruniv.ac.ir</email><affiliationId>2</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">University faculty member</affiliationName><affiliationName affiliationId="2">Azarbaijan Shahid Madani University</affiliationName></affiliationsList><abstract language="eng">&lt;p class="Abstract"&gt;The production of energy from renewable sources, such as the energy from electricity-water, which reduces the amount of CO2, is called clean energy. Today, technologies and methods that reduce energy consumption in computer networks and Co2 production in the environment are called green networks. Now, high consumption of energy in networks and increasing production of Co2 is an important global challenge. This research analyzes the three important principles of optimization, not draining resources and not wasting resources from green network standards. This research shows that high-performance optimal routing algorithms do not always guarantee green standards in networks, and the principles of optimality and greenness must be combined. Therefore, by combining the principles of being green and the principles of linear optimization, a new green optimal routing algorithm in computer networks is presented. Next, three types of USCP, OUMR and OMMR routing algorithms are analyzed according to green standards and it is proven that they are not green despite being optimal. Then, based on the strengths and weaknesses of these methods, a new green optimal routing algorithm is presented. The simulation results and comparisons show that the new method, while increasing the network efficiency, also improves the green standards of data transmission.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/41974</fullTextUrl><keywords><keyword>Green computer networks</keyword><keyword> green standard</keyword><keyword> optimal routing</keyword><keyword> linear modeling</keyword><keyword> optimal consumption of resources</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-09</publicationDate><volume>22</volume><issue>2</issue><startPage>85</startPage><endPage>99</endPage><documentType>article</documentType><title language="eng">A Novel Approach based on Chaotic Mapping for Implementing Security Phases on Cloud Computing</title><authors><author><name>Azita Rezaei</name><email>st_az_rezaei@azad.ac.ir</email><affiliationId>1</affiliationId></author><author><name>Ali Broumandnia</name><email>Broumandnia@gmail.com</email><affiliationId>2</affiliationId></author><author><name>Seyed Javad Mirabedini</name><email>j_mirabedini@iauctb.ac.ir</email><affiliationId>3</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Ph.D. Student, Islamic Azad University-South Tehran Branch, Tehran, Iran</affiliationName><affiliationName affiliationId="2" /><affiliationName affiliationId="3">Academic position, Department of Computer Engineering, Islamic Azad University-Central Tehran Branch, Tehran, Iran</affiliationName></affiliationsList><abstract language="eng">&lt;p&gt;Today, various clients use the cloud to transfer Thing by Internet (ETI). Many companies and organizations are persuaded to use the cloud utilities in secure environment. Beside of this technology is becoming popular, the risks and attacks on data are increasing. Ultimately, a security broker management in cloud services tries to balance security, performance, and availability features availabilities. This paper tries to increase the customer satisfaction index by creating 4 phases of security on the data process during transporting between the customer and the Cloud Service Provider (CSP), while increasing efficiency and availability. Tables and graphs show that the amount of the system allocated penalty is reduced by 61.41% and the customer satisfaction index has increased by 60.67%.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/42725</fullTextUrl><keywords><keyword>Broker security management</keyword><keyword> cryptography</keyword><keyword> data segmentation</keyword><keyword> multi-layer security (MLS) algorithm.</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-09</publicationDate><volume>22</volume><issue>2</issue><startPage>100</startPage><endPage>108</endPage><documentType>article</documentType><title language="eng">Community Detection in Complex Networks Using Minimum Spanning Tree and Modularity Maximization</title><authors><author><name>sondos bahadori</name><email>sondos_bahadori@ilam-iau.ac.ir</email><affiliationId>1</affiliationId></author><author><name>maryam nooraei </name><email>S.nooraei@gmail.com</email><affiliationId>2</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Faculty of Engineering, Islamic Azad University, Ilam, Ir</affiliationName><affiliationName affiliationId="2">faculty member</affiliationName></affiliationsList><abstract language="eng">&lt;p&gt;&lt;span style="font-size: 12pt; font-family: 'Times New Roman', serif;"&gt;Modularity is one of the prominent features of complex networks that divides the structure of these networks into community groups. So far, many methods have been used to identify communities in complex networks, but some of these methods have local optimizations that affect the order of processing nodes and the final solution. In this paper, a new method for finding communities in complex networks using split and merge is proposed. In this method, minimum spanning tree is used as a tool to detect dissimilarity between nodes. In the partitioning process, the edges that show the most dissimilarity are removed in the minimum spanning tree to create smaller groups of nodes in a community. In the merging process, each group is merged with the neighboring group whose combination has the highest increase in modularity compared to other neighboring groups. The results of experiments conducted on real networks and artificial networks show that the method proposed in this article has a good accuracy for identifying communities in complex networks.&amp;nbsp;&lt;/span&gt;&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/43289</fullTextUrl><keywords><keyword>Complex networks</keyword><keyword> community</keyword><keyword> minimum spanning tree</keyword><keyword> increasing modularity</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-09</publicationDate><volume>22</volume><issue>2</issue><startPage>109</startPage><endPage>118</endPage><documentType>article</documentType><title language="eng">Event-Driven Distributed Trust Model for Internet of Things Network</title><authors><author><name>Zahra Hadian</name><email>zhadian@stu.yazd.ac.ir</email><affiliationId>1</affiliationId></author><author><name>Fazllolah Adibnia</name><email>fadib@yazd.ac.ir</email><affiliationId>2</affiliationId></author><author><name>وحید رنجبر</name><email>vranjbar@yazd.ac.ir</email><affiliationId>3</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Department of Computer Engineering, Yazd University, Yazd, Iran</affiliationName><affiliationName affiliationId="2">Department of Computer Engineering, Yazd University, Yazd, Iran</affiliationName><affiliationName affiliationId="3">Department of Computer Engineering, Yazd University, Yazd, Iran</affiliationName></affiliationsList><abstract language="eng">&lt;p class="Abstract"&gt;A vision of the future Internet has been introduced in which various computing devices will be connected to each other to form a network called the Internet of Things. The Internet of Things facilitates human life by providing many applications and smart devices that can be controlled remotely. IoT security is a challenging task due to the inherent characteristics of IoT, especially the heterogeneity of nodes in terms of resources. Trust management, by calculating and analyzing the trust between nodes, enables the node to make an appropriate and reliable decision in communication between nodes. The goal of trust management schemes in a distributed system is to predict the future behavior of nodes based on their previous behavior. In this paper, an event-based distributed trust management method is proposed that calculates the trust between objects using weighted summation. In this method, nodes can evaluate the behavior of other nodes. According to the performed simulation, the proposed method is faster in comparison with the DDTMS method and identifies malicious nodes in fewer transactions and is also more resistant to on-off and bad-mouthing attacks.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/39337</fullTextUrl><keywords><keyword>Internet of things</keyword><keyword> trust management</keyword><keyword> distributed trust management</keyword><keyword> trust evaluation</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-09</publicationDate><volume>22</volume><issue>2</issue><startPage>119</startPage><endPage>128</endPage><documentType>article</documentType><title language="eng">Predicting ratings in recommender systems considering the dynamics of  users’ preferences dynamics and changes in items' characteristics</title><authors><author><name>Hamidreza Tahamsbi</name><email>htahma@gmail.com</email><affiliationId>1</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Islamic Azad University</affiliationName></affiliationsList><abstract language="eng">&lt;p class="Abstract"&gt;Recommender systems help users to extract useful information from a large volume of complex data, and their use has received significant attention in recent years. In practice, the interests of users and the characteristics of items in these systems change over time, and therefore, adapting recommender systems to these types of changes is necessary and helps to provide more accurate recommendations to users. However, most temporal recommender systems are only based on the dynamics of users' preferences over time and do not consider changes in item characteristics.&lt;/p&gt;
&lt;p class="Abstract"&gt;In this paper, we propose a non-negative matrix factorization-based recommender system that uses both dynamics of users' interests and the changes in item characteristics over time in predicting users' ratings of items. In the proposed model, in order to reduce the data sparsity problem, in addition to users' ratings, trust between users is also used. The evaluation results on the Epinions dataset show that the proposed model is more accurate than the compared methods.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/42983</fullTextUrl><keywords><keyword>Recommender systems</keyword><keyword> preference dynamics</keyword><keyword> item dynamics</keyword><keyword> non-negative matrix factorization.</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-09</publicationDate><volume>22</volume><issue>2</issue><startPage>129</startPage><endPage>137</endPage><documentType>article</documentType><title language="eng">Dynamic Energy Consumption Reduction Algorithm for Mixed Critical Real-Time Systems with Multi-Core Processors</title><authors><author><name>seyed hassan sadeghzadeh</name><email>sadeghzadeh1@gmail.com</email><affiliationId>1</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1" /></affiliationsList><abstract language="eng">&lt;p class="Abstract"&gt;Today, unlike traditional embedded systems that have tasks with the same degree of importance, many critical embedded systems are mixed and are used more often. Mixed critical systems are real-time embedded systems introduced to consolidate critical safety and non-critical safety programs on a common hardware platform. Multi-core processors provide the ability to integrate different applications on one hardware and can be a suitable choice for mixed critical embedded systems. However, reducing the energy consumption in these systems is a necessary requirement due to the high volume of processing and their generally battery-based design. Therefore, in this paper, an innovative scheduling method is introduced to reduce energy consumption in mixed critical systems consisting of multi-core processors. This algorithm will reduce the energy consumption of the system by DVFS, while ensuring the timely execution of critical tasks. The results obtained from the simulations show that the energy consumption of the proposed algorithm is improved by 30% compared to similar methods.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/38212</fullTextUrl><keywords><keyword>Mixed critical embedded systems</keyword><keyword> multi-core processors</keyword><keyword> energy consumption</keyword><keyword> DVFS</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-09</publicationDate><volume>22</volume><issue>2</issue><startPage>138</startPage><endPage>146</endPage><documentType>article</documentType><title language="eng">An Effective Application of Fractional Optimal Control in the Treatment of Infectious Diseases</title><authors><author><name>Amin Jajarmi</name><email>a.jajarmi@gmail.com</email><affiliationId>1</affiliationId></author><author><name>‎Manijeh Hasanabadi</name><email>manijehasanabadi@yahoo.com</email><affiliationId>2</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">‎Department of Electrical Engineering‎, Faculty of Engineering, ‎University of Bojnord‎, ‎Bojnord‎, ‎Iran</affiliationName><affiliationName affiliationId="2">‎Department of Mathematics‎, ‎Faculty of Mathematical Science and Statistics‎, ‎University of‎ ‎Birjand‎, ‎Birjand‎, ‎Iran</affiliationName></affiliationsList><abstract language="eng">&lt;p class="Abstract"&gt;In this paper, a novel optimal control model is proposed using the generalized fractional derivative with an arbitrary kernel function to investigate and control HIV infection. Accordingly, an effective therapeutic strategy based on the fractional optimal control theory is formulated and examined for the mentioned disease. The optimality conditions, based on the principle of Pontryagin&amp;rsquo;s maximization, are formulated as a fractional boundary value problem. Furthermore, an efficient numerical method is presented for finding the solution to the generalized fractional dynamic system and solving the corresponding optimal control problem. Convergence and analysis of the proposed technique&amp;rsquo;s error are also studied and evaluated. Numerical simulations demonstrate that the fractional derivative model for a fractional order of 0.99 exhibits lower error and, consequently, better accuracy compared to the integer order model and other fractional orders tested (based on real data validated by the World Health Organization). Moreover, the implementation of the proposed optimal control leads to a significant reduction in the spread of the disease. Consequently, the introduced fractional model serves as an efficient tool for highlighting the fundamental characteristics of the transmission of the aforementioned disease and can enhance the effectiveness of therapeutic strategies.&lt;/p&gt;
&lt;p class="Space"&gt;&amp;nbsp;&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/41947</fullTextUrl><keywords><keyword>Infection transmission dynamics of HIV</keyword><keyword> optimal control</keyword><keyword> fractional derivatives</keyword><keyword> numerical results</keyword></keywords></record></records>