jist-202605192320260519232532CMV Verlagkhoffmann@cmv-verlag.comCMV VerlagJournal of Information Systems and Telecommunication (JIST) jist2322-143712202018621VahidehReshadatmaryamhouraliHeshaamFaili122020181810.7508/jist.2018.21.001http://jist.ir/en/Article/15045http://jist.ir/en/Article/Download/15045http://jist.ir/en/Article/Download/15045http://jist.ir/en/Article/Download/15045http://jist.ir/en/Article/Download/15045http://jist.ir/en/Article/Download/15045http://jist.ir/en/Article/Download/15045http://jist.ir/en/Article/Download/15045[1] L. Yao, A. Haghighi, S. Riedel, and A. McCallum, "Structured relation discovery using generative models," in Proceedings of the Conference on Empirical Methods in Natural Language Processing, 2011, pp. 1456-1466. [2] J. Piskorski and R. Yangarber, "Information extraction: Past, present and future," in Multi-source, Multilingual Information Extraction and Summarization, ed: Springer, 2013, pp. 23-49. [3] B. Min, S. Shi, R. Grishman, and C.-Y. Lin, "Towards Large-Scale Unsupervised Relation Extraction from the Web," International Journal on Semantic Web and Information Systems (IJSWIS), vol. 8, pp. 1-23, 2012. [4] R. C. Bunescu and R. J. Mooney, "A shortest path dependency kernel for relation extraction," in Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, 2005, pp. 724-731. [5] A. Culotta, A. McCallum, and J. Betz, "Integrating probabilistic extraction models and data mining to discover relations and patterns in text," in Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, 2006, pp. 296-303. [6] N. Kambhatla, "Combining lexical, syntactic, and semantic features with maximum entropy models for extracting relations," in Proceedings of the ACL 2004 on Interactive poster and demonstration sessions, 2004, p. 22. [7] M. Banko, O. Etzioni, and T. Center, "The Tradeoffs Between Open and Traditional Relation Extraction," in ACL, 2008, pp. 28-36. [8] C. C. Xavier, V. L. S. de Lima, and M. Souza, "Open information extraction based on lexical semantics," Journal of the Brazilian Computer Society, vol. 21, p. 4, 2015. [9] M. Schmitz, R. Bart, S. Soderland, and O. Etzioni, "Open language learning for information extraction," in Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, 2012, pp. 523-534. [10] S. Soderland, B. Roof, B. Qin, S. Xu, and O. Etzioni, "Adapting open information extraction to domain-specific relations," AI Magazine, vol. 31, pp. 93-102, 2010. [11] P. Gamallo and M. Garcia, "Multilingual open information extraction," in Portuguese Conference on Artificial Intelligence, 2015, pp. 711-722. [12] V. Reshadat, M. Hoorali, and H. Faili, "A Hybrid Method for Open Information Extraction Based on Shallow and Deep Linguistic Analysis," Interdisciplinary Information Sciences, vol. 22, pp. 87-100, 2016. [13] L. Del Corro and R. Gemulla, "ClausIE: clause-based open information extraction," in Proceedings of the 22nd international conference on World Wide Web, 2013, pp. 355-366. [14] A. Culotta and A. McCallum, "Confidence estimation for information extraction," in Proceedings of HLT-NAACL 2004: Short Papers, 2004, pp. 109-112. [15] A. McCallum and D. Jensen, "A note on the unification of information extraction and data mining using conditional-probability, relational models," 2003. [16] F. Wu and D. S. Weld, "Open information extraction using Wikipedia," in Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, 2010, pp. 118-127. [17] O. Etzioni, A. Fader, J. Christensen, S. Soderland, and M. Mausam, "Open Information Extraction: The Second Generation," in IJCAI, 2011, pp. 3-10. [18] L. Qiu and Y. Zhang, "Zore: A syntax-based system for chinese open relation extraction," in Proceedings of EMNLP, 2014. [19] Y.-H. Tseng, L.-H. Lee, S.-Y. Lin, B.-S. Liao, M.-J. Liu, H.-H. Chen, et al., "Chinese open relation extraction for knowledge acquisition," EACL 2014, p. 12, 2014. [20] C. Castella Xavier, S. de Lima, V. Lúcia, and M. Souza, "Open information extraction based on lexical-syntactic patterns," in Intelligent Systems (BRACIS), 2013 Brazilian Conference on, 2013, pp. 189-194. [21] P. Cimiano and J. Wenderoth, "Automatically learning qualia structures from the web," in Proceedings of the ACL-SIGLEX workshop on deep lexical acquisition, 2005, pp. 28-37. [22] A. Akbik and J. Broß, "Wanderlust: Extracting semantic relations from natural language text using dependency grammar patterns," in WWW Workshop, 2009. [23] A. Akbik and A. Löser, "Kraken: N-ary facts in open information extraction," in Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction, 2012, pp. 52-56. [24] F. Mesquita, J. Schmidek, and D. Barbosa, "Effectiveness and efficiency of open relation extraction," Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, vol. 500, pp. 447–457, 2013. [25] H. Bast and E. Haussmann, "Open information extraction via contextual sentence decomposition," in Semantic Computing (ICSC), 2013 IEEE Seventh International Conference on, 2013, pp. 154-159. [26] H. Bast and E. Haussmann, "More informative open information extraction via simple inference," in Advances in information retrieval, ed: Springer, 2014, pp. 585-590. [27] A. Fader, S. Soderland, and O. Etzioni, "Identifying relations for open information extraction," in Proceedings of the Conference on Empirical Methods in Natural Language Processing, 2011, pp. 1535-1545. [28] J. Christensen, S. Soderland, and O. Etzioni, "An analysis of open information extraction based on semantic role labeling," in Proceedings of the sixth international conference on Knowledge capture, 2011, pp. 113-120. [29] V. Punyakanok, D. Roth, and W.-t. Yih, "The importance of syntactic parsing and inference in semantic role labeling," Computational Linguistics, vol. 34, pp. 257-287, 2008. [30] R. Johansson and P. Nugues, "The effect of syntactic representation on semantic role labeling," in Proceedings of the 22nd International Conference on Computational Linguistics-Volume 1, 2008, pp. 393-400. [31] M. H. Kim and P. Compton, "Improving open information extraction for informal web documents with ripple-down rules," in Knowledge Management and Acquisition for Intelligent Systems, ed: Springer, 2012, pp. 160-174. [32] P. Gamallo, M. Garcia, and S. Fernández-Lanza, "Dependency-based open information extraction," in Proceedings of the Joint Workshop on Unsupervised and Semi-Supervised Learning in NLP, 2012, pp. 10-18. [33] P. G. Otero and I. G. López, "A grammatical formalism based on patterns of part of speech tags," International journal of corpus linguistics, vol. 16, pp. 45-71, 2011. [34] M. Banko, M. J. Cafarella, S. Soderland, M. Broadhead, and O. Etzioni, "Open information extraction for the web," in IJCAI, 2007, pp. 2670-2676. [35] T. Scheffer, C. Decomain, and S. Wrobel, "Active hidden markov models for information extraction," in Advances in Intelligent Data Analysis, ed: Springer, 2001, pp. 309-318. [36] D. Downey, O. Etzioni, and S. Soderland, "A probabilistic model of redundancy in information extraction," DTIC Document2006. [37] E. Agichtein, "Confidence estimation methods for partially supervised relation extraction," in Proc. of SIAM Intl. Conf. on Data Mining (SDM06), 2006. [38] F. Mesquita, "Clustering techniques for open relation extraction," in Proceedings of the on SIGMOD/PODS 2012 PhD Symposium, 2012, pp. 27-32. [39] M. Röder, A. Both, and A. Hinneburg, "Exploring the space of topic coherence measures," in Proceedings of the eighth ACM international conference on Web search and data mining, 2015, pp. 399-408. [40] D. M. Powers, "Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation," 2011.RaminSafaSeyed AbolghassemMirroshandelSoroushJavadiMohammadAzizi12202018334010.7508/jist.2018.21.005http://jist.ir/en/Article/15052http://jist.ir/en/Article/Download/15052http://jist.ir/en/Article/Download/15052http://jist.ir/en/Article/Download/15052http://jist.ir/en/Article/Download/15052http://jist.ir/en/Article/Download/15052http://jist.ir/en/Article/Download/15052http://jist.ir/en/Article/Download/15052[1] F. Ricci, L. Rokach and B. Shapira (2011). Introduction to recommender systems handbook. Springer. [2] D. Jannach, M. Zanker, A. Felfernig and G. Friedrich (2010). Recommender systems: An introduction. Cambridge University Press. [3] J. Bobadilla, F. Ortega, A. Hernando and A. Gutiérrez (2013). Recommender systems survey. Knowledge-Based Systems 46:109–132. [4] X. Su and T. M. Khoshgoftaar (2009). A survey of collaborative filtering techniques. Advances in Artificial Intelligence 2009:4. [5] J. Beel, B. Gipp, S. Langer and C. Breitinger (2016). Paper recommender systems: A literature survey. International Journal on Digital Libraries 17(4):305–338. [6] C. Pan and W. Li (2010). Research paper recommendation with topic analysis. In: Computer Design and Applications (ICCDA), 2010 International Conference on, IEEE, vol 4, pp V4–264. [7] H. Luong, T. Huynh, S. Gauch, L. Do and K. Hoang (2012). Publication venue recommendation using author network’s publication history. In: Asian Conference on Intelligent Information and Database Systems, Springer, pp 426–435. [8] T. Huynh, K. Hoang and D. Lam (2013). Trend based vertex similarity for academic collaboration recommendation. In: International Conference on Computational Collective Intelligence, Springer, pp 11–20. [9] C. Bancu, M. Dagadita, M. Dascalu, C. Dobre, S. Trausan-Matu and A. M. Florea (2012). ARSYS–article recommender system. In: Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2012 14th International Symposium on, IEEE, pp 349–355. [10] M. Gori and A. Pucci (2006). Research paper recommender systems: A random-walk based approach. In: 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings) (WI’06), IEEE, pp 778–781. [11] Y. Jiang, A. Jia, Y. Feng and D. Zhao (2012). Recommending academic papers via users’ reading purposes. In: Proceedings of the sixth ACM conference on Recommender systems, ACM, pp 241–244. [12] J. Sun, J. Ma, X. Liu, Z. Liu, G. Wang, H. Jiang and T. Silva (2013). A novel approach for personalized article recommendation in online scientific communities. In: System Sciences (HICSS), 2013 46th Hawaii International Conference on, IEEE, pp 1543–1552. [13] G. Cabanac (2011). Accuracy of inter-researcher similarity measures based on topical and social clues. Scientometrics 87(3):597–620. [14] M. S. Pera and Y. K. Ng (2014). Exploiting the wisdom of social connections to make personalized recommendations on scholarly articles Journal of Intelligent Information Systems 42(3):371–391. [15] Z. Zhan, L. Yang, S. Bao, D. Han, Z. Su and Y. Yu (2011). Finding appropriate experts for collaboration. In: International Conference on Web-Age Information Management, Springer, pp 327–339. [16] C. Basu, H. Hirsh, W. W. Cohen and C. Nevill-Manning (2001). Technical paper recommendation: A study in combining multiple information sources. Journal of Artificial Intelligence Research 14:241–262. [17] D. Conry, Y. Koren and N. Ramakrishnan (2009). Recommender systems for the conference paper assignment problem. In: Proceedings of the third ACM conference on Recommender systems, ACM, pp 357–360. [18] B. Gipp and J. Beel (2009). Citation proximity analysis (CPA)–a new approach for identifying related work based on co-citation analysis. In: Proceedings of the 12th International Conference on Scientometrics and Informetrics (ISSI’09), Rio de Janeiro (Brazil): International Society for Scientometrics and Informetrics, vol 2, pp 571–575. [19] C. Caragea, A. Silvescu, P. Mitra and C. L. Giles (2013). Can’t see the forest for the trees?: A citation recommendation system. In: Proceedings of the 13th ACM/IEEE-CS joint conference on Digital libraries, ACM, pp 111–114. [20] R. Klamma, P. M. Cuong and Y. Cao (2009). You never walk alone: Recommending academic events based on social network analysis. In: International Conference on Complex Sciences, Springer, pp 657–670. [21] D. H. Park, H. K. Kim, I. Y. Choi and J. K. Kim (2012). A literature review and classification of recommender systems research. Expert Systems with Applications 39(11):10,059–10,072. [22] G. H. Martı́n, S. Schockaert, C. Cornelis and H. Naessens (2013). An exploratory study on content-based filtering of call for papers. In: Information Retrieval Facility Conference, Springer, pp 58–69. [23] E. Medvet, A. Bartoli and G. Piccinin (2014). Publication venue recommendation based on paper abstract. In: Tools with Artificial Intelligence (ICTAI), 2014 IEEE 26th International Conference on, IEEE, pp 1004–1010. [24] Z. Xu, Y. Yang, F. Wang, J. Xu, Z. Li, F. Mu and L. Li (2014). A recommendation system for paper submission based on vertical search engine. In: Computer Engineering and Networking, Springer, pp 201–208. [25] F. Beierle, J. Tan and K. Grunert (2016). Analyzing social relations for recommending academic conferences. In: Proceedings of the 8th ACM International Workshop on Hot Topics in Planet-scale Mobile Computing and Online Social Networking, ACM, pp 37–42. [26] G. M. Garcı́a, B. P. Nunes, G. R. Lopes, M. A. Casanova and L. A. P. P. Leme (2016). Comparing and recommending conferences. In: Proceedings of the 5th Bra, SNAM–Brazilian Workshop on Social Network Analysis and Mining. [27] D. Peiris and R. Weerasinghe (2015). Citation network based framework for ranking academic publications and venues. In: Advances in ICT for Emerging Regions (ICTer), 2015 Fifteenth International Conference on, IEEE, pp 146–151. [28] S. Perugini, M. A. Gonçalves and E. A. Fox (2004). Recommender systems research: A connection-centric survey. Journal of Intelligent Information Systems 23(2):107–143. [29] X. Ren, Y. Zeng, Y. Qin, N. Zhong, Z. Huang, Y. Wang and C. Wang (2010). Social relation based search refinement: Let your friends help you! In: International Conference on Active Media Technology, Springer, pp 475–485. [30] Y. Zeng, Y. Yao and N. Zhong (2009). DBLP-SSE: A DBLP search support engine. In: Web Intelligence and Intelligent Agent Technologies (WI-IAT’09), IEEE/WIC/ACM International Joint Conferences on, IET, vol 1, pp 626–630. [31] D. Tchuente, M. F. Canut, N. Jessel, A. Peninou and F. Sèdes (2013). A community-based algorithm for deriving users’ profiles from egocentrics networks: Experiment on Facebook and DBLP. Social Network Analysis and Mining 3(3):667–683. [32] M. Eirinaki, J. Gao, I. Varlamis and K. Tserpes (2018). Recommender systems for large-scale social networks: A review of challenges and solutions. [33] H. C. Wang and Y. L. Chang (2007). PKR: A personalized knowledge recommendation system for virtual research communities. Journal of Computer Information Systems 48(1):31–41. [34] J. B. Lovins (1968). Development of a stemming algorithm. MIT Information Processing Group, Electronic Systems Laboratory Cambridge. [35] C. D. Manning, P. Raghavan and H. Schtze (2008). Introduction to information retrieval. Cambridge University Press. [36] T. K. Landauer and S. T. Dumais (1997). A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge. Psychological Review 104(2):211. [37] B. Sarwar, G. Karypis, J. Konstan and J. Riedl (2000). Application of dimensionality reduction in recommender system–a case study. Tech. rep., DTIC Document. [38] M. Ley (2009). DBLP: some lessons learned. Proceedings of the VLDB Endowment 2(2):1493–1500.JavadPaksimaHomaKhajeh12202018505910.7508/jist.2018.21.007http://jist.ir/en/Article/15061http://jist.ir/en/Article/Download/15061http://jist.ir/en/Article/Download/15061http://jist.ir/en/Article/Download/15061http://jist.ir/en/Article/Download/15061http://jist.ir/en/Article/Download/15061http://jist.ir/en/Article/Download/15061http://jist.ir/en/Article/Download/15061[1] K. Purcell, J. Brenner, and L. Rainie, “Search Engine Use 2012,” 2012. [2] Y. Zhang, B. J. Jansen, and A. Spink, “Time series analysis of a Web search engine transaction log,” Information Processing & Management, vol. 45, no. 2, pp. 230–245, 2009. [3] R. Baeza-Yates and B. Ribeiro-Neto, “Modern information retrieval,” New York, vol. 9, p. 513, 1999. [4] Searchmetrics, “Searchmetrics Ranking Factors 2016: Rebooting for Relevance,” 2016. [Online]. Available: http://www.searchmetrics.com/knowledge-base/ranking-factors/. [Accessed: 07-May-2017]. [5] L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank Citation Ranking: Bringing Order to the Web,” World Wide Web Internet And Web Information Systems, vol. 54, no. 1999–66, pp. 1–17, 1998. [6] G.-R. Xue, Q. Yang, H.-J. Zeng, Y. Yu, and Z. Chen, “Exploiting the hierarchical structure for link analysis,” Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 186--193, 2005. [7] J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” Journal of the ACM, vol. 46, no. 5, pp. 604–632, Sep. 1999. [8] R. Patchmuthu, “Link analysis algorithms to handle hanging and spam pages,” 2014. [9] L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank Citation Rankin: Bringing Order to the Web,” World Wide Web Internet And Web Information Systems, vol. 54, no. 1999–66, pp. 1–17, 1998. [10] M. Bianchini, M. Gori, and F. Scarselli, “Inside pagerank,” ACM Transactions on Internet Technology (TOIT), vol. 5, no. 1, pp. 92–128, 2005. [11] A.-L. Barabási and R. Albert, “Emergence of Scaling in Random Networks,” Science, vol. 286, no. October, pp. 509–512, 1999. [12] L. Z. Xiang, “Research and Improvement of PageRank Sort Algorithm Based on Retrieval Results,” in Intelligent Computation Technology and Automation (ICICTA), 2014 7th International Conference on, 2014, pp. 468–471. [13] Z. Dou, R. Song, J.-Y. Nie, and J.-R. Wen, “Using anchor texts with their hyperlink structure for web search,” in Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, 2009, pp. 227–234. [14] A. N. Langville and C. D. Meyer, “A reordering for the PageRank problem,” SIAM Journal on Scientific Computing, vol. 27, no. 6, pp. 2112–2120, 2006. [15] R. K. Patchmuthu, A. K. SINGH, and A. Mohan, “A new algorithm for detection of link spam contributed by zero-out link pages,” Turkish Journal of Electrical Engineering & Computer Sciences, vol. 24, no. 4, pp. 2106–2123, 2016. [16] I. C. F. Ipsen and T. M. Selee, “PageRank computation, with special attention to dangling nodes,” SIAM Journal on Matrix Analysis and Applications, vol. 29, no. 4, pp. 1281–1296, 2007. [17] X. Wang, T. Tao, J.-T. Sun, A. Shakery, and C. Zhai, “Dirichletrank: Solving the zero-one gap problem of pagerank,” ACM Transactions on Information Systems (TOIS), vol. 26, no. 2, p. 10, 2008. [18] K. Berlt, E. S. de Moura, A. Carvalho, M. Cristo, N. Ziviani, and T. Couto, “Modeling the web as a hypergraph to compute page reputation,” Information Systems, vol. 35, no. 5, pp. 530–543, 2010. [19] A. N. Nikolakopoulos and J. D. Garofalakis, “NCDawareRank: a novel ranking method that exploits the decomposable structure of the web,” in Proceedings of the sixth ACM international conference on Web search and data mining, 2013, pp. 143–152. [20] A. Broder et al., “Graph structure in the web,” Computer networks, vol. 33, no. 1, pp. 309–320, 2000. [21] D. Donato, L. Laura, S. Leonardi, and S. Millozzi, “Large scale properties of the webgraph,” The European Physical Journal B-Condensed Matter and Complex Systems, vol. 38, no. 2, pp. 239–243, 2004. [22] A. Flammini, F. Menczer, and A. Vespignani, “The egalitarian effect of search engines,” arXiv preprint cs.CY/0511005, 2005. [23] L. Becchetti and C. Castillo, “The distribution of PageRank follows a power-law only for particular values of the damping factor,” in Proceedings of the 15th international conference on World Wide Web, 2006, pp. 941–942. [24] G. Pandurangan, P. Raghavan, and E. Upfal, “Using pagerank to characterize web structure,” Internet Mathematics, vol. 3, no. 1, pp. 1–20, 2006. [25] N. Litvak, W. R. W. Scheinhardt, and Y. Volkovich, “In-Degree and PageRank of Web pages: Why do they follow similar power laws?,” arXiv preprint math/0607507, 2006. [26] P. Zha, X. Xu, and M. Zuo, “An Efficient Improved Strategy for the PageRank Algorithm,” in 2011 International Conference on Management and Service Science, 2011, pp. 1–4. [27] S. Setayesh, A. Harounabadi, and A. M. Rahmani, “Presentation of an Extended Version of the PageRank Algorithm to Rank Web Pages Inspired by Ant Colony Algorithm,” International Journal of Computer Applications, vol. 85, no. 17, 2014. [28] K. Mohan and J. Kurmi, “A Technique to Improved Page Rank Algorithm in perspective to Optimized Normalization Technique,” International Journal, vol. 8, no. 3, 2017. [29] N. L. Amy and D. M. Carl, “Google’s PageRank: The Math Behind the Search Engine,” Priceton university Press, Nol, vol. 3, pp. 335–380, 2004. [30] W. Xing and A. Ghorbani, “Weighted PageRank algorithm,” in Proceedings of the Second Annual Conference on Communication Networks and Services Research, 2004, pp. 305–314. [31] F. Mathieu and M. Bouklit, “The effect of the back button in a random walk: application for pagerank,” in Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, 2004, pp. 370–371. [32] M. Zhukovskii, G. Gusev, and P. Serdyukov, “URL redirection accounting for improving link-based ranking methods,” in Advances in Information Retrieval, Springer, 2013, pp. 656–667. [33] Z. Bahrami Bidoni, R. George, and K. Shujaee, “A Generalization of the PageRank Algorithm,” ICDS 2014, The Eighth International Conference on Digital Society, pp. 108–113, 2014. [34] A. K. Singh, “A comparative study of page ranking algorithms for information retrieval,” International journal of electrical and computer engineering, vol. 4, pp. 469--480, 2009. [35] A. M. Zareh Bidoki and N. Yazdani, “DistanceRank: An intelligent ranking algorithm for web pages,” Information Processing and Management, vol. 44, no. 2, pp. 877–892, 2008. [36] B. Poblete, C. Castillo, and A. Gionis, “Dr. searcher and mr. browser: a unified hyperlink-click graph,” in Proceedings of the 17th ACM conference on Information and knowledge management, 2008, pp. 1123–1132. [37] R. Baeza-Yates, P. Boldi, and C. Castillo, “Generalizing pagerank: Damping functions for link-based ranking algorithms,” in Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, 2006, pp. 308–315. [38] T. Qin, T. Y. Liu, J. Xu, and H. Li, “LETOR: A benchmark collection for research on learning to rank for information retrieval,” Information Retrieval, vol. 13, pp. 346–374, 2010. [39] T. H. Haveliwala, “Efficient computation of PageRank,” 1999. [40] M. Arora, U. Kanjilal, and D. Varshney, “Evaluation of information retrieval: Precision and recall,” International Journal of Indian Culture and Business Management, vol. 12, no. 2, pp. 224–236, 2016. Mohammad Reza TaghvaRobab Hamlbarani HaghiAzizHanifiKamran feizi1220201891710.7508/jist.2018.21.002http://jist.ir/en/Article/15063http://jist.ir/en/Article/Download/15063http://jist.ir/en/Article/Download/15063http://jist.ir/en/Article/Download/15063http://jist.ir/en/Article/Download/15063http://jist.ir/en/Article/Download/15063http://jist.ir/en/Article/Download/15063http://jist.ir/en/Article/Download/15063[1] I. F. Akyildiz, W. Su, Y. Sankarasbramaniam, and E. Cayirci, “A Survey on Sensor Networks”, In Proc. IEEE Communication magazine, 2002, Vol. 40, No. 8, pp .102-114 . [2] J. Zheng, and A. Jamalipour, “Wireless sensor networks: a networking perspective”, New Jersey: John Wiley & Sons, 2009. [3] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey”, Computer networks, Vol. 38, 2002, pp. 393-422. [4] Q.Zhang, L. Yancheng, G. Haohao, and Q. Zhang “The Design of Hybrid MAC Protocol for Industry Monitoring System Based on WSN”, Procedia Engineering, Vol. 23, No. 3, 2011, pp. 290-295. [5] E. Cayirci, and T. Gupla, “Sendrom: Sensor networks for disaster relief operations management”, Wireless Networks, Vol. 13, No. 3, 2007, pp. 409–423. [6] Y.L. Zheng, “Unobtrusive Sensing and Wearable Devices for Health Informatics”, IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, Vol. 61, No. 5, 2014, pp. 1538-1554. [7] C -H. Tsai, and Y.-C. Tseng. “A path-connected-cluster wireless sensor network and its formation, addressing, and routing protocols.” IEEE Sensors Journal, 2012, Vol. 12, No. 6, pp.2135-2144. [8] I. F. Akyildiz, and M. C. Vuran, “Wireless sensor networks”, United Kingdom: John Wiley & Sons, July 2010. [9] A. Abbasi, and M. Younis, “A survey on clustering algorithms for wireless sensor networks”, Computer communications, Vol. 30, No. 2, 2007, pp. 2826-2841. [10] W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “application-specific protocol architecture for wireless micro sensor networks,” IEEE Trans. On Wireless Communications, Vol. 1, No. 4, 2002, pp.660–670. [11] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proceedings of the 33rd Hawaii International Conference on System Sciences, 4-7 January 2000. [12] L. Xiang, J. Luo, and A. Vasilakos, “Compressed data aggregation for energy efficient wireless sensor networks”. In proc. 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2011, pp. 46-54. [13] S. Lindsey, and C. S. Raghavendra, “PEGASIS: Power efficient gathering in sensor information systems”. In proc. of IEEE Aerospace Conference, Vol. 3, 2002, pp. 1125–1130. [14] O. Younis, and S. Fahmy, “HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks”, IEEE Transactions on Mobile Computing, Vol.3 No.4, 2004, pp.366-379. [15] Y.Yanjun, Q. Cao, A.V. Vasilakos, “EDAL: An energy-efficient, delayaware, and lifetime-balancing data collection protocol for heterogeneous wireless sensor networks”, IEEE ACM Transactions on Networking, Vol. 23, No. 3, 2004, pp.810–823. [16] Y. Liu, N. Xiong, Y. Zhao, A.V. Vasilakos, J. Gao, and Y. Jia “Multi-layer clustering routing algorithm for wireless vehicular sensor networks”, IET Communications. Vol.4, No.7, 2010 , pp. 810–816. [17] Y. Yao, Q. Cao, and A. V. Vasilakos, “EDAL: An Energy-Efficient, Delay-Aware, and Lifetime-Balancing Data Collection Protocol for Heterogeneous Wireless Sensor Networks”, IEEE ACM Transactions on Networking, Vol. 23, No.3, pp. 810–823, 2015. [18] K. Han, J. Luo, Y. Liu, and A. V. Vasilakos, “Algorithm design for data communications in duty-cycled wireless sensor networks: A survey”, Communications Magazine, IEEE, Vol.51, No.7, 2013 , pp. 107–113. [19] G. Wei, Y. Ling, B. Guo, B. Xiao, A. V. Vasilakos, “Prediction-based data aggregation in wireless sensor networks: Combining grey model and Kalman Filter”, Computer Communications. Vol. 34, No.6, 2011 , pp. 793–802. [20] V. Loscri, G. Morabito, and S. Marano, “A two-level hierarchy for low energy adaptive clustering hierarchy (TL-LEACH),” in proc. IEEE 62nd Vehicular Technology Conference, pp. 1809-1813. [21] M. B. Yassein, A. Al-zou'bi, Y. Khamayseh, and W. Mardini, “Improvement on LEACH Protocol of Wireless Sensor Network (VLEACH)”, International Journal of Digital Content Technology and its Applications, Vol. 3, No. 2, 2009, pp. 132-136. [22] M. Xiaoyan, “Study and design on clustering routing protocols of wireless sensor networks”, Ph.D Dissertation, Zhejiang University, Hangzhou, China, 2006. [23] R. M. B. Hani, and A. A. Ijjeh, “A Survey on LEACH-based energy aware protocols for wireless sensor networks”, Journal of Communications Vol. 8, No. 3, 2013. [24] A. Bari, A. Jaekel, and S. Bandyopadhyay, “Clustering strategies for improving the lifetime of two-tiered sensor networks”, Computer Communications, Vol. 31, No. 14, 2008, 3451–3459. [25] N. Chilamkurti, S. Zeadally, A. Vasilakos, and V Sharma, “Cross-layer support for energy efficient routing in wireless sensor networks”, Journal of Sensors, 2009, pp. 1-9. [26] T. Meng, F. Wu, Z. yang, G. Chen, and A.V. Vasilakos, “Spatial reusability-aware routing in multihop wireless networks”, IEEE Transactions on Computers, Vol. 65, No.1, pp. 244–255, 2016. [27] P. Li, S. Guo, S. yu, and A.V. Vasilakos, “Reliable multicast with pipelined network coding using opportunistic feeding and routing” , IEEE Transactions on Parallel and Distributed Systems, vol. 25, no.12, 2014 , pp. 3264–3273. [28] C. Busch, R. Kannan, A. V. Vasilakos “Approximating congestion + dilation in networks via ‘‘quality of routing games””, IEEE Transactions on Computers, Vol.61, No.9, 2012, pp. 1270–1283. [29] N. Zhu, and A.V. Vasilakos, “A generic framework fo energy evaluation on wireless sensor networks”, Wireless Networks. Vol. 22, No. 4, 2015, pp. 1199–1220. [30] S. Singh, S. Chand, R. Kumar, A. Malik, B. Kumar, “NEECP: A Novel Energy Efficient Clustering Protocol for Prolonging Lifetime of WSNs”, IET Wireless Sensor Systems, Vol. 6, No. 5, 151-157. [31] W. B. Heinzelman, A. P. Chandrakasan, H. Balakrishnan, “Anapplication-specific protocol architecture for wireless microsensor networks”, IEEE Transactions on Wireless Communications, Vol. 1, No. 4, 2002, pp. 660–670. [32] T. L. Saaty, “Decision making with the analytic hierarchy process”, Int. J. Services Sciences, Vol. 1, No. 1, 2008. [33] B.O. Saracoglu, "Selecting industrial investment locations in master plans of countries". European J. of Industrial Engineering. Inderscience Enterprises Ltd, Vol. 7, No. 4, 2013, pp. 416–441. [34] M. Taghva, A. Hanifi, K. feizi, and M. Taghavi- Fard, “Energy consumption management by clustering and localization of nodes in wireless sensor networks”. International Journal of Computer Science and Network Security, Vol. 17, No.16, 2017, pp. 273-377. [35] M. Shakeri, S. M. Mazinani, “Crisis Management using Spatial Query Processing in Wireless Sensor Networks”. Journal of information system and telecommunication, Vol. 2, No . 6, 2017, pp. 97-110. [36] J. V. Stoep, “Design and implementation of reliable Localization algorithms using received signal strength”, Master of Science in Electrical Engineering, University of Washington, 2009. [37] S. Adler, S. Pfeiffer, H. Will, T. Hillebrandt and J. Schiller, “Measuring the distance between wireless sensor nodes with standard hardware”, Positioning Navigation and Communication (WPNC), 2012 9th Workshop on, Dresden, Germany, 15-16 March 2012.dmpdmpAliMahjur12202018182410.7508/jist.2018.21.003http://jist.ir/en/Article/15065http://jist.ir/en/Article/Download/15065http://jist.ir/en/Article/Download/15065http://jist.ir/en/Article/Download/15065http://jist.ir/en/Article/Download/15065http://jist.ir/en/Article/Download/15065http://jist.ir/en/Article/Download/15065http://jist.ir/en/Article/Download/15065[1] J. H. Drew, D. L. Evans, A. G. Glen, and L. M. Leemis, “Data Structures and Simple Algorithms,” in Computational Probability, Springer, 2017, pp. 89–109. [2] I. Haller, A. Slowinska, and H. Bos, “Scalable data structure detection and classification for C/C++ binaries,” Empir. Softw. Eng., vol. 21, no. 3, pp. 778–810, 2016. [3] M. Basios, L. Li, F. Wu, L. Kanthan, and E. T. Barr, “Optimising Darwinian Data Structures on Google Guava,” in International Symposium on Search Based Software Engineering, 2017, pp. 161–167. [4] M. Basios, L. Li, F. Wu, L. Kanthan, D. Lawrence, and E. Barr, “Darwinian Data Structure Selection,” arXiv Prepr. arXiv1706.03232, 2017. [5] T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, and C. STEIN, Introduction to Algorithms 3rd Edition. MIT press, 2009. [6] C. Van Reeuwijk and H. J. Sips, “Adding tuples to Java: A study in lightweight data structures,” in Proceedings of the Concurrency Computation Practice and Experience, 2005, vol. 17, no. 5–6 SPEC. ISS., pp. 423–438. [7] M. Sakkinen, “Disciplined Inheritance,” in ECOOP 1989: European Conference on Object-Oriented Programming, 1989, pp. 39–57. [8] Y. Zhang, M. C. Loring, G. Salvaneschi, B. Liskov, and A. C. Myers, “Lightweight, flexible object-oriented generics,” in ACM SIGPLAN Notices, 2015, vol. 50, no. 6, pp. 436–445. [9] S. Lindell, “A normal form for first-order logic over doubly-linked data structures,” Int. J. Found. Comput. Sci., vol. 19, no. 1, pp. 205–217, 2008. [10] C. Loncaric, E. Torlak, and M. D. Ernst, “Fast synthesis of fast collections,” ACM SIGPLAN Not., vol. 51, no. 6, pp. 355–368, 2016. [11] Y. Smaragdakis and D. S. Batory, “DiSTiL: A transformation library for data structures,” in Proceedings of USENIX Conference on Domain-Specific Languages, 1997, no. October, p. 257270. [12] Java.net, “JMH Test,” 2017. [Online]. Available: http://openjdk.java.net/projects/code-tools/jmh/. [13] N. Khammassi and J.-C. Le Lann, “A high-level programming model to ease pipeline parallelism expression on shared memory multicore architectures,” Simul. Ser., vol. 46, no. 5, pp. 63–70, 2014. [14] Y. Smaragdakis, “Technical Perspective High-Level Data Structures,” Commun. ACM, vol. 55, no. 12, p. 2380656, 2012. [15] S. J. Rosenschein and S. M. Katz, “Selection of representations for data structures,” in Proceedings of the 1977 symposium on Artificial intelligence and programming languages., 1977, pp. 147–154. [16] S. Katz and R. Zimmerman, “An advisory system for developing data representations,” in Proceedings of the 7th international joint conference on Artificial intelligence, 1981, pp. 1030–1036. [17] E. Schonberg, J. T. Schwartz, and M. Sharir., “An automatic technique for selection of data representations in setl programs,” ACM Trans. Program. Lang. Syst., vol. 3, no. 2, pp. 126–143, 1981. [18] E. Schonberg, J. T. Schwartz, and M. Sharir., “Automatic data structure selection in setl.,” in Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, 1979, pp. 197–210. [19] J. R. Low, “Automatic data structure selection: an example and overview,” Commun. ACM, vol. 21, no. 5, pp. 376–385, 1978.احمدجلیلیرضااکبریمنیژه کشتگری12202018253210.7508/jist.2018.21.004http://jist.ir/en/Article/15071http://jist.ir/en/Article/Download/15071http://jist.ir/en/Article/Download/15071http://jist.ir/en/Article/Download/15071http://jist.ir/en/Article/Download/15071http://jist.ir/en/Article/Download/15071http://jist.ir/en/Article/Download/15071http://jist.ir/en/Article/Download/15071[1] Kreutz, D., Ramos, F. M., Verissimo, P. E., Rothenberg, C. E., Azodolmolky, S., & Uhlig, S. (2015). Software-defined networking: A comprehensive survey. Proceedings of the IEEE, 103(1), 14-76. [2] Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., and Zolla, J. (2013). B4: Experience with a globally-deployed software defined WAN. ACM SIGCOMM Computer Communication Review, 43(4), 3-14. [3] Sezer, S., Scott-Hayward, S., Chouhan, P. K., Fraser, B., Lake, D., Finnegan, J., and Rao, N. (2013). Are we ready for SDN? Implementation challenges for software-defined networks. IEEE Communications Magazine, 51(7), 36-43. [4] Kano, S., Miyazaki, K., Nagata, A., and Chugo, A. (2005, November). Shared segment recovery mechanism in optical networks. In 6th Asia-Pacific Symposium on Information and Telecommunication Technologies (pp. 415-420). IEEE. [5] Laprie, J. (2005, July). Resilience for the scalability of dependability. In Fourth IEEE International Symposium on Network Computing and Applications (pp. 5-6). IEEE. [6] Benzekki, K., El Fergougui, A., and Elbelrhiti Elalaoui, A. (2017). Software‐defined networking (SDN): a survey. Security and Communication Networks.‏ [7] Oliveira, D., Pourvali, M., Bai, H., Ghani, N., Lehman, T., Yang, X., and Hayat, M. (2017, March). A novel automated SDN architecture and orchestration framework for resilient large-scale networks. In SoutheastCon, 2017 (pp. 1-6). IEEE.‏ [8] Sharma, S., Staessens, D., Colle, D., Pickavet, M., and Demeester, P. (2013). OpenFlow: Meeting carrier-grade recovery requirements. Computer Communications, 36(6), 656-665.‏ [9] Jivorasetkul, S., Shimamura, M., and Iida, K. (2013, August). Better network latency with end-to-end header compression in SDN architecture. In Communications, Computers and Signal Processing (PACRIM), 2013 IEEE Pacific Rim Conference on (pp. 183-188). IEEE. [10] Curtis, A. R., Mogul, J. C., Tourrilhes, J., Yalagandula, P., Sharma, P., and Banerjee, S. (2011). DevoFlow: Scaling flow management for high-performance networks. ACM SIGCOMM Computer Communication Review, 41(4), 254-265.‏ [11] Ng, E., Cai, Z., and Cox, A. L. (2010). Maestro: A system for scalable openflow control. Rice University, Houston, TX, USA, TSEN Maestro-Techn. Rep, TR10-08.‏ [12] Mambretti, J., Chen, J., Yeh, F., Grossman, R., Nash, P., Heath, A., and Zhang, Z. (2017, March). Designing and deploying a bioinformatics software-defined network exchange (SDX): Architecture, services, capabilities, and foundation technologies. In Innovations in Clouds, Internet and Networks (ICIN), 2017 20th Conference on (pp. 135-142). IEEE.‏ [13] Canini, M., Salem, I., Schiff, L., Schiller, E. M., and Schmid, S. (2017, June). A self-organizing distributed and in-band SDN control plane. In Distributed Computing Systems (ICDCS), 2017 IEEE 37th International Conference on (pp. 2656-2657). IEEE.‏ [14] Koponen, T., Casado, M., Gude, N., Stribling, J., Poutievski, L., Zhu, M., and Shenker, S. (2010, October). Onix: A distributed control platform for large-scale production networks. In OSDI (Vol. 10, pp. 1-6). [15] Heller, B., Sherwood, R., and McKeown, N. (2012, August). The controller placement problem. In Proceedings of the first workshop on Hot topics in software defined networks (pp. 7-12). ACM. [16] Zhang, Y., Cui, L., Wang, W., and Zhang, Y. (2017). A Survey on Software Defined Networking with Multiple Controllers. Journal of Network and Computer Applications. [17] McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., and Turner, J. (2008). OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review, 38(2), 69-74. [18] Farahani, R. Z., Asgari, N., Heidari, N., Hosseininia, M., and Goh, M. (2012). Covering problems in facility location: A review. Computers & Industrial Engineering, 62(1), 368-407. [19] Li, S., and Huang, Y. (2014). Heuristic approaches for the flow-based set covering problem with deviation paths. Transportation Research Part E: Logistics and Transportation Review, 72, 144-158. [20] Ramos, R. M., Martinello, M., and Rothenberg, C. E. (2013, October). Slickflow: Resilient source routing in data center networks unlocked by openflow. In Local Computer Networks (LCN), 2013 IEEE 38th Conference on (pp. 606-613). IEEE. [21] Yu, M., Rexford, J., Freedman, M. J., and Wang, J. (2010). Scalable flow-based networking with DIFANE. ACM SIGCOMM Computer Communication Review, 40(4), 351-362.‏ [22] Tootoonchian, A., Gorbunov, S., Ganjali, Y., Casado, M., and Sherwood, R. (2012). On Controller Performance in Software-Defined Networks. Hot-ICE, 12, 1-6. [23] Killi, B., and Rao, S. Optimal Model for Failure Foresight Capacitated Controller Placement in Software Defined Networks, (2016, June), Communications Letters, IEEE, 20(6), 1108 - 1111. [24] Sahoo, K. S., Sarkar, A., Mishra, S. K., Sahoo, B., Puthal, D., Obaidat, M. S., and Sadun, B. (2017). Metaheuristic Solutions for Solving Controller Placement Problem in SDN-based WAN Architecture. [25] ul Huque, M. T. I., Si, W., Jourjon, G., and Gramoli, V. (2017). Large-Scale Dynamic Controller Placement. IEEE Transactions on Network and Service Management, 14(1), 63-76. [26] Ruiz-Rivera, A., Chin, K. W., and Soh, S. (2015). Greco: an energy aware controller association algorithm for software defined networks. IEEE Communications Letters, 19(4), 541-544. [27] He, K., Khalid, J., Das, S., Gember-Jacobson, A., Prakash, C., Akella, A., and Thottan, M. (2015, June). Latency in software defined networks: Measurements and mitigation techniques. In ACM SIGMETRICS Performance Evaluation Review (Vol. 43, No. 1, pp. 435-436). ACM. [28] Kuźniar, M., Perešíni, P., and Kostić, D. (2015, March). What you need to know about SDN flow tables. In International Conference on Passive and Active Network Measurement (pp. 347-359). Springer International Publishing. [29] Sood, K., Yu, S., Xiang, Y., and Cheng, H. (2016). A General QoS Aware Flow-Balancing and Resource Management Scheme in Distributed Software-Defined Networks. IEEE Access, 4, 7176-7185. [30] Rechia, F. S. (2016). An Evaluation of SDN Based Network Virtualization Techniques (Doctoral dissertation, ARIZONA STATE UNIVERSITY). [31] P. Bernier, “NTT Recognized with IBC Award for SDN-based HDTV Service,” September 2013. [Online]. Available: http://www.sdnzone.com/topics/software-defined-network/articles/353466-ntt-recognized-with-ibc-award-sdn-based-hdtv.html.HassanFarsiRezaNasiripourSajadMohammadzadeh12202018414910.7508/jist.2018.21.006http://jist.ir/en/Article/15077http://jist.ir/en/Article/Download/15077http://jist.ir/en/Article/Download/15077http://jist.ir/en/Article/Download/15077http://jist.ir/en/Article/Download/15077http://jist.ir/en/Article/Download/15077http://jist.ir/en/Article/Download/15077http://jist.ir/en/Article/Download/15077[1] Z. Zhu, Q. Ji, "Robust real-time eye detection and tracking under variable lighting conditions and various face orientations", In Computer Vision and Image Understanding, Vol. 98, Vo. 1, 2005, pp. 124-154. [2] L. Ma, Y. Wang, T. Tan., "Iris recognition based on multichannel Gabor filtering", Proc. Fifth Asian Conf. Computer Vision, 2002, pp. 279-283. [3] W. Boles, W., B. Boashash, "A human identification technique using images of the iris and wavelet transform", IEEE transactions on signal processing, Vol. 46, No. 4, 1998, pp. 1185-1188. [4] A. Sović, D. Seršić., "Robustly adaptive wavelet filter bank using L1 norm", in Systems, Signals and Image Processing (IWSSIP), 18th International Conference on. IEEE, 2011. [5] Y. Zhu, T. Tan, Y. Wang, "Biometric personal identification based on iris patterns. in Pattern Recognition", Proceedings. 15th International Conference on. IEEE, 2000. [6] T. Bulow, G. Sommer, "Hypercomplex signals-a novel extension of the analytic signal to the multidimensional case", IEEE Transactions on signal processing, Vol. 49, No. 11, 2001, pp. 2844-2852. [7] D. Monro, S. Rakshit, D. Zhang, "DCT-based iris recognition", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 29, , No. 4, 2007. [8] T. Pradeepthi, A.P. Ramesh. "Pipelined architecture of 2D-DCT, Quantization and Zigzag process for JPEG image compression using VHDL", International Journal of VLSI Design & Communication Systems, Vol. 2, No. 3, 2011. [9] R. Ng, Y.H. Tay, K.M. Mok, "An effective segmentation method for iris recognition system", IET image processing, 2008. [10] C. Belcher, Y. Du, "Region-based SIFT approach to iris recognition", Optics and Lasers in Engineering, Vol. 47, 2009, No. 1, 2009, pp. 139-147. [11] L. Liam, A. Chekima, LC. Fan, J.A, Dargham, "Iris recognition using self-organizing neural network", in Research and Development, 2002. [12] M. Moinuddin, M. Deriche, S.S.A. Ali, "A New Iris Recognition Method based on Neural Networks", WSEAS Transactions on information science and applications, 2004. [13] H. Ali, M.J. Salami, "Iris recognition system using support vector machines", in Biometric Systems, Design and Applications. InTech, 2004. [14] W. Zhang, S. Shan, L. Qing, X. Chan, W. Gao, "Are Gabor phases really useless for face recognition?", Pattern Analysis and Applications, Vol. 12, No. 3, 2009, pp. 301-307. [15] A.M Sarhan, "Iris Recognition Using Discrete Cosine Transform", Journal of Computer Science, Vol. 5,No. 5, 2009, pp. 369-373. [16] P.F.G Mary, P.S.K. Paul, J. Dheeba, "Human identification using periocular biometrics", International Journal of Science, Engineering and Technology Research (IJSETR) , 2013. [17] R.H Abiyev, K. Altunkaya., "Personal iris recognition using neural network", International Journal of Security and its Applications, Vol. 2, No. 2, 2008, pp. 41-50. [18] P.C Murty, E.S. Reddy, "Iris recognition system using principal components of texture characteristics", TECHNIA-Int. J. Computing Science and Communication Technologies, Vol. 2, No. 1, 2009, pp. 343-348. [19] A. Ross, M.S. Sunder, "Block based texture analysis for iris classification and matching", in Computer Vision and Pattern Recognition Workshops (CVPRW), IEEE Computer Society Conference on, 2010. [20] R. Farouk, R. Kumar, K. Riad., "Iris matching using multi-dimensional artificial neural network", IET Computer Vision, Vol. 5,No. 3, 2011, pp. 178-184. [21] A. Varshney, A. Rani, V. Singh., "Optimization of filter parameters for iris detection", in Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions), 2015. [22] K. Hajari, U. Gawande, Y. Golhar., "Neural Network Approach to Iris Recognition in Noisy Environment", Procedia Computer Science, 2016, pp. 675-682. [23] S.H Zahiri, "Learning automata based classifier", Pattern Recognition Letters, Vol. 29, 2008, No. 1, 2008, pp. 40-48. [24] http://iris.di.ubi.pt/ubiris1.html. [25] http://www.cbsr.ia.ac.cn:8080/iapr_database.jsp. [26] http://pesona.mmu.edu.my/. [27] H. Farsi, R. Nasiripour, S. Mohamadzadeh., "Improved Generic Object Retrieval In Large Scale Database By SURF Descriptor", Journal of Information Systems and Telecommunication (JIST). Vol. 5, No. 2, 2017, pp. 128-137. [28] H. Bay, A. Ess, T. Tuytelaars, L.V. Gool, "Speeded-up robust features (SURF)", Computer vision and image understanding, Vol. 110, No. 3, 2008, pp. 346-359. [29] M. obaidat, G. Papadimitiou, A. Pomportsis, "Guest Editorial Learning Automata: Theory, Paradigms and Applications", IEEE Transactions on systems, man, and cybernetics, Vol. 32. No. 6, 2002. [30] Thathachar, M.A. and P.S. Sastry., "Varieties of learning automata: an overview", IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), Vol. 32, No. 6, pp. 711-722, 2002. [31] K.S Narendra, M.A. Thathachar., "Learning automata: an introduction", Courier Corporation, 2012. [32] D.D Zhang, "Automated biometrics", Technologies and systems. Vol. 7.: Springer Science & Business Media, 2007. [33] M. Elgamal, N. Al-Biqami, "An efficient feature extraction method for iris recognition based on wavelet transformation", Int. J. Comput. Inf. Technol, Vol. 2, No. 03, 2013, pp. 521-527. [34] A. Kumar, A. Passi, "Comparison and combination of iris matchers for reliable personal authentication", Pattern recognition. Vol. 43, No. 3, 2013, pp. 1016-1026. [35] A.D. Rahulkar, R.S. Holambe, "Half-iris feature extraction and recognition using a new class of biorthogonal triplet half-band filter bank and flexible k-out-of-n: a postclassifier", IEEE Transactions on Information Forensics and Security, Vol. 7, No.1, 2012, pp. 230-240. [36] M. Baqar, A. Azhar, Z. Lqbal and et al., "Efficient iris recognition system based on dual boundary detection using robust variable learning rate Multilayer Feed Forward neural network", in Information Assurance and Security (IAS), 7th International Conference on. 2011. [37] R.M Sundaram, B.C. Dhara, "Neural network based Iris recognition system using Haralick features. in Electronics Computer Technology (ICECT), 2011. [38] V. Tallapragada, E. Rajan, "Improved kernel-based IRIS recognition system in the framework of support vector machine and hidden Markov model", IET image processing, Vol. 6, No. 6, 2012, pp. 661-667. [39] C.C Tsai, et al., "Iris recognition using possibilistic fuzzy matching on local features", IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), Vol. 42, No. 1, , 2012, pp. 150-162. [40] N.N Babu, V. Vaidehi, "Fuzzy based IRIS recognition system (FIRS) for person identification", in Recent Trends in Information Technology (ICRTIT), International Conference on. 2011. [41] A. Harjoko, S. Hartati, H. Dwiyasa, "A method for iris recognition based on 1d coiflet Wavelet", world academy of science, engineering and technology, Vol. 56, No. 24, 2009, pp. 126-129. [42] K. Masood, M.Y. Javed, A. Basit., "Iris recognition using wavelet", in Emerging Technologies, ICET. International Conference on. 2007. [43] S. Umer, B.C. Dhara, B. Chanda., "Iris recognition using multiscale morphologic features", Pattern Recognition Letters, 2015, pp. 67-74. [44] G. Sachdeva, B. Kaur, "Iris Recognition Using Fuzzy SVM Based On SIFT Feature Extraction Method", in International Journal of Modern Computer Sience (IJMCS), Vol. 4, No. 2, 2016, pp. 16-22. [45] S. Salve, S. Narote, "Iris recognition using SVM and ANN", in Wireless Communications, Signal Processing and Networking (WiSPNET), International Conference on. 2016. IEEE. [46] N. Liu, H. Li, M. Zhang, J. Liu, Z. Sun, T. Tan, "Accurate iris segmentation in non-cooperative environments using fully convolutional networks", In Proceedings of the IEEE International Conference on Biometrics, Halmstad, Sweden, 2016, pp. 1–8. [47] M. Arsalan, H. Gil, R. Naqvi, M. Lee, M. Kim, D. Kim, C. Sik, K. Park, "Deep Learning-Based Ireis Segmentation for iris recognition in visible light environment", in MDPI Journal, 2017. [48] M. Alhamrouni, "Iris Recognition By Using Image Processing Techniques", A thesis submitted to the Graduate School of Natural And Applied Science of ATLIM University, 2017. [49] B. Shekar, S. Sharada, "Multi-patches iris based person authentication system using particle swarm optimization and fuzzy c-means clustering", in The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2017.