@article{ author = {Hosseini, Elahe sadat and Berangi, Rez}, title = {A Sub-Optimal Policy for Connection Admission Control Mechanism in Cognitive Radio Sensor Networks}, abstract ={Satisfying the quality of service (QoS) is a crucial issue in cognitive radio sensor networks (CRSNs) due to the highly variable nature of cognitive radio channels. Connection admission control (CAC) is a beneficial approach to manage the traffic to provide desired QoS. A CAC is proposed in this paper to optimize the packet loss ratio, jitter of packets and end to end delay in CRSNs. The proposed CAC decides based on the priority of data flows, network state and number of available channels. An estimation formula is proposed through a graph coloring approach to evaluate the required number of channels of network states. The proposed CAC is modeled by a semi Markov decision process (SMDP) and a sub-optimal policy is obtained by a value iteration method to achieve the maximum reward in network. Simulation results demonstrate that the proposed mechanism outperforms the recent proposed admission control mechanism in CRSNs.}, Keywords = {Cognitive radio sensor networks, admission control, QoS, semi Markov decision process (SMDP) }, volume = {9}, Number = {1}, pages = {1-7}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-43-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-43-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2017} } @article{ author = {Karimi, Meysam and Babamir, Seyed Mortez}, title = {QoS-aware web service composition using Gray Wolf Optimizer}, abstract ={In a service-oriented application, an integrated model of web services is composed of multiple abstract tasks. Each abstract task denotes a certain functionality that could be executed by a number of candidate web services with different qualities. The selection of a web service among candidates for execution of each task that is led to an optimal composition of selected web services is a NP-hard problem. In this paper, we adapt the Gray Wolf Optimizer (GWO) algorithm for selection of candidate web services whose composition is optimal. To evaluate the effectiveness of the proposed method, four quality parameters, response time, reliability, availability, and cost of web services are considered and the derived results are compared with several Particle Swarm Optimization (PSO) methods. The proposed method was executed in from 100 to 1000 times and the results showed that a better optimal rate (between 0.2 and 0.4) compared with PSO.}, Keywords = {Optimal web service composition, Gray Wolf Optimizer algorithm, Particle Swarm Optimization, Service oriented, Quality of service }, volume = {9}, Number = {1}, pages = {9-16}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-44-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-44-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2017} } @article{ author = {Behkamal, Bahareh and Naghibzadeh, Mahmou}, title = {Inconsistency Repair to Improve the Alignment Results of Ontology Matchers}, abstract ={Ontology inconsistency is one of the most important topics in the field of ontology matching. Until now many matchers are introduced but most of them suffer from inconsistencies. Many of the ontology matching tools have severe problems with respect to the quality of matching results and therefore the results of matching process is not adequate. In this paper, we focus on this topic and present a new method to produce better results from the matching process. The major novelty of this paper is in detecting the inconsistencies in ontologies before starting the matching process. In this phase, many problems caused by ontology diversity are resolved. Besides, some new patterns and inconsistencies in ontologies are detected and then refactoring operations are applied on them. At the end, one of the well-known matchers in OAEI is selected to evaluate our work. Experimental results show that the transformed ontologies are more efficient than original unrepaired ones with respect to the standard evaluation measures.}, Keywords = {Ontology matching, Alignment, Inconsistency, Refactoring, Pattern detection }, volume = {9}, Number = {1}, pages = {17-23}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-45-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-45-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2017} } @article{ author = {Alishirvani, Nasri}, title = {A Framework to Create a Certificate for e-Commerce Secure Transaction Protocol}, abstract ={The development of e-commerce requires security to win the confidence of its stakeholders. Among the common protocols to establish safe financial transactions, Secure Electronic Transaction (SET) protocol has more security providing a safe protocol of payments at the level of the communication network between the buyers, sellers, banks and payment gates. In this protocol, all participants in the transaction should receive Certificate Authority (CA) identity. This paper analyzes the secure communication solutions and variety secure communication contracts for financial transactions. Then, architecture is presented to establish a web-based Certificate Authority (CA) identity for elements of Secure Electronic Transaction (SET) protocol and its implementation is described. The presented Certificate Authority (CA) identity in the article can process the requests of entities for online processing and transmit them through Hypertext Transfer Protocol (HTTP).}, Keywords = {Secure Transaction Protocol, Certificate Authority, Secure Electronic Transaction, Payment Gateway, Public Key Infrastructure }, volume = {9}, Number = {1}, pages = {25-32}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-46-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-46-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2017} } @article{ author = {AshrafiPayaman, Nosratali and Kangavari, Mohammadrez}, title = {GSSC: Graph Summarization based on both Structure and Concepts}, abstract ={In this paper, we propose a new method for graph summarization named GSSC, Graph Summarization based on both Structure and Concepts. In this method, an attributed graph is summarized by considering both of its topology and related concepts. In this method, for a given attributed graph a new graph is constructed that an edge in this new graph represents structural and conceptual similarity of its two end points. Structural and conceptual similarity of two nodes not necessarily has the equal amount of importance in the weight of the resulting edge. For example, for a special case such as query answering, structure can be more important and vice versa. Similarity of two nodes is computed based on Jaccard similarity. This method has some advantages such as flexibility, simplicity, learning capability, user-orientation that makes it a better method for graph summarization. We implemented our method and the method proposed by Bei and evaluated these two methods on real-life dataset HEP_TH. Our experimental results showed effectiveness and efficiency of our proposed method.}, Keywords = {Graph summarization, super-node, similarity, conceptual summarization, summary}, volume = {9}, Number = {1}, pages = {33-44}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-47-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-47-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2017} } @article{ author = {Cheraghchi, Hamideh Sadat and Zakerolhosseini, Ali}, title = {Mining Dynamic Communities based on a Novel Link-Clustering Algorithm}, abstract ={Discovering communities in time-varying social networks is one of the highly challenging area of research and researchers are welcome to propose new models for this domain. The issue is more problematic when overlapping structure of communities is going to be considered. In this research, we present a new online and incremental community detection algorithm called link-clustering which uses link-based clustering paradigm intertwined with a novel representative-based algorithm to handle these issues. The algorithm works in both weighted and binary networks and intrinsically allows for overlapping communities. Comparison with the state of art evolutionary algorithms and link-based clustering shows the accuracy of this method in detecting communities over times and motivates the extended research in link-based clustering paradigm for dynamic overlapping community detection purpose.}, Keywords = {social network, link clustering, dynamic network, evolutionary clustering, representative-based clustering }, volume = {9}, Number = {1}, pages = {45-51}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-48-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-48-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2017} } @article{ author = {Mosharraf, Maedeh and Taghiyareh, Fattaneh}, title = {Pruning Concept Map to Geneate Ontology}, abstract ={Knowledge representation in the form of a concept map can be a good idea to categorize domain terms and their relations and help to generate ontology. Supplementing detail information to and pruning useless data from the concept map, which likes a skeleton in evolving ontology, can be semantically accomplished using the domain knowledge. In this paper, we propose a method using structural knowledge resources as well as tacit knowledge of experts to generate the ontology of eLearning domain. The concept map of eLearning is manually improved and finally verified using the group of eLearning experts. In order to enrich the ontology with merging into upcoming terms, the paper proposed an automatic method based on two external knowledge sources, Wikipedia and WordNet. The semantic similarity of concepts which is measured using the words hierarchy of WordNet combined with relations of concepts extracted from the Wikipedia graph is applied to link the new eLearning concepts to the domain ontology. The generated ontology is a dynamic knowledge source which can improve itself gradually. This integrated knowledge of eLearning domain can be used to model educational activities and to build, organize, and update specific learning resources.}, Keywords = {concept map, pruning, ontology generation, ontology enrichment, elearning, graph clustering, Wikipedia, WordNet }, volume = {9}, Number = {1}, pages = {53-61}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-49-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-49-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2017} }