University of KashanSoft Computing Journal2322-37074220210523Link Prediction in Social Networks through classifiers combinationLink Prediction in Social Networks through classifiers combination217111394FAAzamKeypourJournal Article20210523Abstract
Link prediction in social networks is one of the most important activities in analysis of such networks. The importance of link prediction in social networks is due to its dynamic nature. While members and their relationships (links) in such networks are continuously increasing, links may be missed due to various reasons. By predicting such links, the possibility of extension, completion, and information retrieval of these networks can be provided. For predicting and detecting these links, some information is needed, which they could be extracted from the network graph structure and used as measures for prediction. Having introduced two new measures, which lead to an effective performance in predictions and recommendations, we propose a new method. The link prediction is achieved through combining classifiers and evolutionary methods of GA (Genetic Algorithm) and ICA (Imperialist Competitive Algorithm). To show practical considerations, two real datasets, Facebook and Epinions, are employed. We show that the proposed method can increase the performance and precision of prediction. Abstract
Link prediction in social networks is one of the most important activities in analysis of such networks. The importance of link prediction in social networks is due to its dynamic nature. While members and their relationships (links) in such networks are continuously increasing, links may be missed due to various reasons. By predicting such links, the possibility of extension, completion, and information retrieval of these networks can be provided. For predicting and detecting these links, some information is needed, which they could be extracted from the network graph structure and used as measures for prediction. Having introduced two new measures, which lead to an effective performance in predictions and recommendations, we propose a new method. The link prediction is achieved through combining classifiers and evolutionary methods of GA (Genetic Algorithm) and ICA (Imperialist Competitive Algorithm). To show practical considerations, two real datasets, Facebook and Epinions, are employed. We show that the proposed method can increase the performance and precision of prediction. https://scj.kashanu.ac.ir/article_111394_f085c99e12134ee8371879549912032a.pdfUniversity of KashanSoft Computing Journal2322-37074220210523Optimizing Process of Data Extraction, Transformation and Load in Data Warehouse Based on Parallel ProcessingOptimizing Process of Data Extraction, Transformation and Load in Data Warehouse Based on Parallel Processing1831111395FANeginDaneshpourJournal Article20210523Abstract
Data Warehouses are used to store data in a structure that facilitates data analysis. The process of Extracting, Transforming, and Loading (ETL) covers the process of retrieving required data from the source system and loading them to the data warehouse. Although the structure of source data (e.g. ER model) and DW (e.g. star schema) are usually specified, there is a clear lack of a standard model to represent the ETL scenarios. Using various tools, the ELT process is designed in many different ways based on the source and destination of data structure. The ETL process has time and cost bottlenecks in process of building DW. According to previously proposed different methods on reducing time and efficiency of the ETL process, this paper tries to propose a more efficient method. This paper represents a reduction of the execution time of the ETL process using the parallel processing techniques leading to reduction rate of 29% in execution time.Abstract
Data Warehouses are used to store data in a structure that facilitates data analysis. The process of Extracting, Transforming, and Loading (ETL) covers the process of retrieving required data from the source system and loading them to the data warehouse. Although the structure of source data (e.g. ER model) and DW (e.g. star schema) are usually specified, there is a clear lack of a standard model to represent the ETL scenarios. Using various tools, the ELT process is designed in many different ways based on the source and destination of data structure. The ETL process has time and cost bottlenecks in process of building DW. According to previously proposed different methods on reducing time and efficiency of the ETL process, this paper tries to propose a more efficient method. This paper represents a reduction of the execution time of the ETL process using the parallel processing techniques leading to reduction rate of 29% in execution time.https://scj.kashanu.ac.ir/article_111395_8e02ac24223b49e331ef7e16bac8d573.pdfUniversity of KashanSoft Computing Journal2322-37074220210523A Replicated Agent based Approach for Implementation of a Reliable Mobile Code ParadigmA Replicated Agent based Approach for Implementation of a Reliable Mobile Code Paradigm3253111396FAHodjatHamidiJournal Article20210523Abstract
Using mobile agents, it is possible to bring the code close to the resources, which is not foreseen by the traditional client/server paradigm. Compared to the client/server computing paradigm, the greater flexibility of the mobile agent paradigm comes at additional costs as well as the additional complexity of developing and managing mobile agent-based applications. Such complexity proposes the reliability issue; accordingly, reliability mechanisms for mobile agents must be established. In this paper, fault tolerance is used as a reliability mechanism. Various approaches exist for making mobile agents fault tolerance and their transactional support. These approaches have different strengths and weaknesses, and address different environments. Because of this variety, it is often difficult for the application programmer to choose the approach that best suited to an application. This paper introduces a classification of current approaches for fault-tolerant execution of mobile agents. The classification, which focuses on algorithmic aspects, aims at structuring of fault tolerant mobile agents and facilitates an understanding of the properties and weaknesses of the approaches. In addition, a non-blocking structure is presented for security of mobile agents. In this structure, the protocol that provides fault tolerance moves with the agent. This leads to implement fault tolerant mobile agents without changing their original plan. The costs of making mobile agents fault tolerant are compared against non-replication mobile agents. Furthermore, we show by increasing the number of stages and their size such overhead increases. Abstract
Using mobile agents, it is possible to bring the code close to the resources, which is not foreseen by the traditional client/server paradigm. Compared to the client/server computing paradigm, the greater flexibility of the mobile agent paradigm comes at additional costs as well as the additional complexity of developing and managing mobile agent-based applications. Such complexity proposes the reliability issue; accordingly, reliability mechanisms for mobile agents must be established. In this paper, fault tolerance is used as a reliability mechanism. Various approaches exist for making mobile agents fault tolerance and their transactional support. These approaches have different strengths and weaknesses, and address different environments. Because of this variety, it is often difficult for the application programmer to choose the approach that best suited to an application. This paper introduces a classification of current approaches for fault-tolerant execution of mobile agents. The classification, which focuses on algorithmic aspects, aims at structuring of fault tolerant mobile agents and facilitates an understanding of the properties and weaknesses of the approaches. In addition, a non-blocking structure is presented for security of mobile agents. In this structure, the protocol that provides fault tolerance moves with the agent. This leads to implement fault tolerant mobile agents without changing their original plan. The costs of making mobile agents fault tolerant are compared against non-replication mobile agents. Furthermore, we show by increasing the number of stages and their size such overhead increases. https://scj.kashanu.ac.ir/article_111396_f1851edc4fb8f615341e93cebaa739c5.pdfUniversity of KashanSoft Computing Journal2322-37074220210523Developing a New Model for Governance Maturity of Service Oriented ArchitectureDeveloping a New Model for Governance Maturity of Service Oriented Architecture5467111397FAMojganDehghaniSimaEmadiJournal Article20210523Abstract
Today, Organizations require a suitable and effective governance maturity model of their Service-Oriented Architecture (SOA). This is required to assess current state and needs of their governance and then to provide a suitable framework for their governance. So far, the different SOA governance maturity models have been proposed to assess governance of SOA; however, considering the movement of organizations to process-oriented method in recent years, the governance maturity model based on SOA is needed to assess the maturity of the organization in terms of their governance processes. In this paper, we used the COBIT process maturity model to propose a new model for the SOA governance maturity. The new model can evaluate an organization's process maturity level. COBIT is one of the information technology governance models. Finally to evaluate the proposed model, we contrast our results against the results obtained from reviews of IT experts. Abstract
Today, Organizations require a suitable and effective governance maturity model of their Service-Oriented Architecture (SOA). This is required to assess current state and needs of their governance and then to provide a suitable framework for their governance. So far, the different SOA governance maturity models have been proposed to assess governance of SOA; however, considering the movement of organizations to process-oriented method in recent years, the governance maturity model based on SOA is needed to assess the maturity of the organization in terms of their governance processes. In this paper, we used the COBIT process maturity model to propose a new model for the SOA governance maturity. The new model can evaluate an organization's process maturity level. COBIT is one of the information technology governance models. Finally to evaluate the proposed model, we contrast our results against the results obtained from reviews of IT experts. https://scj.kashanu.ac.ir/article_111397_082dbcedfa27a3c6dd14dfe92699a62d.pdfUniversity of KashanSoft Computing Journal2322-37074220210523Self-Adaptive Delay-Bounded Routing Protocol for Vehicular Ad hoc NetworksSelf-Adaptive Delay-Bounded Routing Protocol for Vehicular Ad hoc Networks6883111398FAZeinabMovahediAminehMazandaraniJournal Article20210523Abstract
Vehicular Ad Hoc Network (VANET) is a particular type of mobile ad hoc network in which vehicles communicate between themselves using wireless antenna. Due to unique characteristics of VANETs (e.g. high mobility of nodes and dynamic topology), routing is one of the challenging tasks in such networks. Consequently, delay tolerant networks which consider the disconnect nature of VANETs have attracted a great deal of attention from both industrial and research committees. However, existing delay tolerant proposals suffer from their traffic-unawareness deficiencies. Mainly, the multi-hop transmission preference of some existing solutions increases the network overhead and imposes extra delay for real-time traffic. In addition, some proposals cause inacceptable latency to data packets through prioritizing the carry-and-forward strategy. To address the aforementioned issues, we propose a self-adaptive delay tolerant routing protocol which adjusts the routing decisions according to the traffic requirements and underlying network context. Simulation results illustrate that the proposed protocol improves the delivery rate of urgent packets up to 30% as well as keeps advantages of delay tolerant protocols.Abstract
Vehicular Ad Hoc Network (VANET) is a particular type of mobile ad hoc network in which vehicles communicate between themselves using wireless antenna. Due to unique characteristics of VANETs (e.g. high mobility of nodes and dynamic topology), routing is one of the challenging tasks in such networks. Consequently, delay tolerant networks which consider the disconnect nature of VANETs have attracted a great deal of attention from both industrial and research committees. However, existing delay tolerant proposals suffer from their traffic-unawareness deficiencies. Mainly, the multi-hop transmission preference of some existing solutions increases the network overhead and imposes extra delay for real-time traffic. In addition, some proposals cause inacceptable latency to data packets through prioritizing the carry-and-forward strategy. To address the aforementioned issues, we propose a self-adaptive delay tolerant routing protocol which adjusts the routing decisions according to the traffic requirements and underlying network context. Simulation results illustrate that the proposed protocol improves the delivery rate of urgent packets up to 30% as well as keeps advantages of delay tolerant protocols.https://scj.kashanu.ac.ir/article_111398_892358e520d7701d4cf4bd63f3a0b831.pdfUniversity of KashanSoft Computing Journal2322-37074220210523Cloud services discovery through Ontology Evolution in Persian languageCloud services discovery through Ontology Evolution in Persian language8493111399FAJournal Article20210523Abstract
The cloud computing is undoubtedly a great achievement of the computer networks. In this environment, various services have been provided but users should take the trouble to find the services they need. Although researchers have tried to solve the needs of users to information on the web, their studies enjoy strengths and weaknesses and there is no comprehensive system for the discovery of the cloud services in Farsi language; this means they did not consider features of Farsi language. Furthermore, the lack of a comprehensive ontology for Farsi language has caused many studies fail to use ontology features in their service discovery systems. Therefore, there is a need for some systems to detect cloud services for Farsi language with acceptable quality. The use of ontology to discover the cloud services semantically could improve the results of the service discovery system. The current study is an attempt to provide an environment for service discovery in a cloud environment for the Farsi language using ontology evolution. Evaluation of the presented environment shows the increase of the quality in discovery of the cloud services for the Farsi language.Abstract
The cloud computing is undoubtedly a great achievement of the computer networks. In this environment, various services have been provided but users should take the trouble to find the services they need. Although researchers have tried to solve the needs of users to information on the web, their studies enjoy strengths and weaknesses and there is no comprehensive system for the discovery of the cloud services in Farsi language; this means they did not consider features of Farsi language. Furthermore, the lack of a comprehensive ontology for Farsi language has caused many studies fail to use ontology features in their service discovery systems. Therefore, there is a need for some systems to detect cloud services for Farsi language with acceptable quality. The use of ontology to discover the cloud services semantically could improve the results of the service discovery system. The current study is an attempt to provide an environment for service discovery in a cloud environment for the Farsi language using ontology evolution. Evaluation of the presented environment shows the increase of the quality in discovery of the cloud services for the Farsi language.https://scj.kashanu.ac.ir/article_111399_7100433b27b5b4efef923cfd845f6826.pdf