jist-202605192320260519232702CMV Verlagkhoffmann@cmv-verlag.comCMV VerlagJournal of Information Systems and Telecommunication (JIST) jist2322-14376232017518MarziyeFathiHoomanNikmehr623201711010.7508/jist.2017.18.006http://jist.ir/en/Article/14910http://jist.ir/en/Article/Download/14910http://jist.ir/en/Article/Download/14910http://jist.ir/en/Article/Download/14910http://jist.ir/en/Article/Download/14910http://jist.ir/en/Article/Download/14910http://jist.ir/en/Article/Download/14910http://jist.ir/en/Article/Download/14910[1] B. Parhami, Computer Arithmetic, New York: Oxford University Press, 2000 [2] X. Guan,Y. Fei and H. Lin. "Hierarchical design of an application-specific instruction set processor for high-throughput and scalable FFT processing." IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 20, No.3, (2012), PP. 551-563 [3] A. V. Oppenheim, R. W. Schafer and J. R. Buck, Discrete-Time Signal Processing, USA: Prentice-Hall, 1998 [4] J. R. Choi, H. G. Kim, S. S. Han and S. C. Hwang, “Variable 2K/4K/8K-point FFT/IFFT with compact memory for OFDM-based DVB-T system,” International Conference on Systems and Informatics (ICSAI), May 2012, pp. 977-980 [5] H. M. Hassan, K. Mohammad and A. F. Shalash, “Implementation of a reconfigurable ASIP for high throughput low power DFT/DCT/FIR engine,” EURASIP Journal on Embedded Systems, No.1, 2012, pp. 1-18. [6] J. Sohn and E. E. Swartzlander Jr,“ Improved architectures for a fused floating-point add-subtract unit,” Circuits and Systems I: Regular Papers, IEEE Transactions on, vol. 59, no. 10, 2012, pp. 2285-2291. [7] X. Chen, A. Minwegen, Y. Hassan, D. Kammler, S. Li, T. Kempf and G. Ascheid, “efficient multi-mode MIMO detection using reconfigurable ASIP,” 20th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), April 2012, pp. 69-76. [8] D. Menard, D. Chillet, F. Charot and O. Sentieys, “Automatic floating-point to fixed-point conversion for DSP code generation,” ACM. In Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems, October 2002, pp. 270-276. [9] S. Z. Gilani, N. S. Kim and M. Schulte, “Virtual floating-point units for low-power embedded processors,” 23rd International Conference on application-Specific Systems, Architectures and Processors (ASAP), July 2012, pp. 61-68. [10] S. Z. Gilani, N. S. Kim and M. Schulte, “Energy-efficient floating-point arithmetic for software-defined radio architectures,” 2011 IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), September 2011, pp. 122-129. [11] P. Korkmaz, B. E. Akgul and K. V. Palem, “Energy, performance, and probability tradeoffs for energy-efficient probabilistic CMOS circuits,” Circuits and Systems I: Regular Papers, IEEE Transactions on, vol. 55, no. 8, 2008, pp. 2249-2262. [12] D. Kelly, B. Phillips and S. Al-Sarawi, “Approximate signed binary integer multipliers for arithmetic data value speculation,” In Conference on Design & Architectures For Signal And Image Processing, 2009. [13] Y. C. Lim, “Single-precision multiplier with reduced circuit complexity for signal processing applications,” Computers, IEEE Transactions on, vol. 41, no. 10, 1992, pp. 1333-1336. [14] N. Petra, D. D. Caro, V. Garofalo, E. Napoli and A. G. Strollo, “Truncated binary multipliers with variable correction and minimum mean square error,” Circuits and Systems I: Regular Papers, IEEE Transactions on, vol. 57, no. 6, 2010, pp. 1312-1325. [15] V. Garofalo, N. Petra and E. Napoli, “Analytical calculation of the maximum error for a family of truncated multipliers providing minimum mean square error,”Computers, IEEE Transactions on, vol. 60, no. 9, 2011, pp. 1366-1371. [16] E. J. King and E. E. Swartzlander, “Data-dependent truncation scheme for parallel multipliers,” Conference Record of the Thirty-First Asilomar Conference on Signals, Systems & Computers, vol. 2, November 1997, pp. 1178-1182. [17] E. E. Swartzlander, “Truncated multiplication with approximate rounding,” Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers, vol. 2, October 1999, pp. 1480-1483.AhmadRahnama ZadehmeybodimeybodiMasoudTaheri Kadkhoda623201711010.7508/jist.2017.18.005http://jist.ir/en/Article/14943http://jist.ir/en/Article/Download/14943http://jist.ir/en/Article/Download/14943http://jist.ir/en/Article/Download/14943http://jist.ir/en/Article/Download/14943http://jist.ir/en/Article/Download/14943http://jist.ir/en/Article/Download/14943http://jist.ir/en/Article/Download/14943[1] J. Neville and D. Jensen, "Iterative classification in relational data," in Proc. AAAI-2000 Workshop on Learning Statistical Models from Relational Data, 2000, pp. 13-20. [2] S. A. Macskassy and F. Provost, "A simple relational classifier," DTIC Document2003. [3] S. Bhagat, I. Rozenbaum, and G. Cormode, "Applying link-based classification to label blogs," in Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis, 2007, pp. 92-101. [4] S. Chakrabarti, B. E. Dom, and P. Indyk, "Enhanced hypertext categorization using hyperlinks," ed: Google Patents, 2002. [5] X. Zhu, Z. Ghahramani, and J. Lafferty, "Semi-supervised learning using gaussian fields and harmonic functions," in ICML, 2003, pp. 912-919. [6] M. S. T. Jaakkola and M. Szummer, "Partially labeled classification with Markov random walks," Advances in neural information processing systems (NIPS), vol. 14, pp. 945-952, 2002. [7] Y. Zhou, H. Cheng, and J. X. Yu, "Graph clustering based on structural/attribute similarities," Proceedings of the VLDB Endowment, vol. 2, pp. 718-729, 2009. [8] J. Kleinberg and E. Tardos, "Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields," Journal of theACM (JACM), vol. 49, pp. 616-639, 2002. [9] F. McSherry, "Spectral partitioning of random graphs," in Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, 2001, pp. 529-537. [10] A.B.Goldberg, X. Zhu, and S. J. Wright, "Dissimilarity in graph-based semi-supervised classification," in International Conference on Artificial Intelligence and Statistics, 2007, pp. 155-162. [11] J. Leskovec, D. Huttenlocher, and J. Kleinberg, "Predicting positive and negative links in online social networks," in Proceedings of the 19th international conference on World wide web, 2010, pp. 641-650. [12] A. Goyal, F. Bonchi, and L. V. Lakshmanan, "Learning influence probabilities in social networks," in Proceedings of the third ACM international conference on Web search and data mining, 2010, pp. 241-250. [13] X. Xu, L. Lu, P. He, Y. Ma, Q. Chen, and L. Chen, "Semi-supervised classification with multiple ants maximal spanning tree," in Web Intelligence (WI) and Intelligent Agent Technologies (IAT), 2013 IEEE/WIC/ACM International Joint Conferences on, 2013, pp. 315-320. [14] H. Xu, Y. Yang, L. Wang, and W. Liu, "Node classification in social network via a factor graph model," in Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2013, pp. 213-224. [15] H. Beigy and M. R. Meybodi, "Utilizing distributed learning automata to solve stochastic shortest path problems," International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 14, pp. 591-615, 2006. [16] M. Al Hasan and M. J. Zaki, "A survey of link prediction in social networks," in Social network data analytics, ed: Springer, 2011, pp. 243-275. [17] C. A. Bliss, M. R. Frank, C. M. Danforth, and P. S. Dodds, "An evolutionary algorithm approach to link prediction in dynamic social networks," Journal of Computational Science, vol. 5, pp. 750-764, 2014. [18] L. Adamic and E. Adar, "How to search a social network," Social networks, vol. 27, pp. 187-203, 2005. [19] Y.-X. Zhu, L. Lü, Q.-M. Zhang, and T. Zhou, "Uncovering missing links with cold ends," Physica A: Statistical Mechanics and its Applications, vol. 391, pp. 5769-5778, 2012. [20] W. Cukierski, B. Hamner, and B. Yang, "Graph-based features for supervised link prediction," in Neural Networks (IJCNN), The 2011 International Joint Conference on, 2011, pp. 1237-1244. [21] E. Zheleva and L. Getoor, "To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles," in Proceedings of the 18th international conference on World wide web, 2009, pp. 531-540.MehdiGhamari Adian623201711010.7508/jist.2017.18.008http://jist.ir/en/Article/14947http://jist.ir/en/Article/Download/14947http://jist.ir/en/Article/Download/14947http://jist.ir/en/Article/Download/14947http://jist.ir/en/Article/Download/14947http://jist.ir/en/Article/Download/14947http://jist.ir/en/Article/Download/14947http://jist.ir/en/Article/Download/14947[1] F. C. Commission, “Report of spectrum efficiency working group,” 2002, spectrum policy task force, Washington, DC, USA. [2] -, “Cognitive radio technologies proceeding," 2003, rep. ET Docket, no. 03-108. [3] L. E. Doyle, Essentials of Cognitive Radio, The Cambridge Wireless Essentials Series, New York, USA: Cambridge University Press, 2009. [4] M. G. Adian, H. Aghaeinia and Y. Norouzi, “Spectrum Sharing and Power Allocation in MIMO Multi-Band Underlay Cognitive Radio Networks,” IET Communications, vol. 7, no. 11, pp. 1140-1150, 2013. [5] M. G. Adian and H. Aghaeinia, “Low Complexity Resource Allocation in MIMO-OFDM based Cooperative Cognitive Radio Networks,” Trans. Emerging Telecommun.s Tech., vol. 27, no. 1, pp. 92-100, 2016. [6] M. G. Adian and H. Aghaeinia, “Resource Allocation in MIMO-OFDM Based Cooperative Cognitive Radio Networks: Optimal and Sub-Optimal Low Complexity Approaches,” International J. Commun. Sys., doi: 10.1002/dac.2804, 2014. [7] M. G. Adian and H. Aghaeinia, “Optimal Resource Allocation in MIMO-OFDM Based Cooperative Cognitive Radio Networks,” IEEE Transactions on Communications, vol. 62, no. 7, pp. 2224-2235, 2014. [8] M. G. Adian and H. Aghaeinia, “Spectrum Sharing and Power Allocation in Multiple-In Multiple-Out Cognitive Radio Networks via Pricing,” IET Communications, vol. 6, no. 16, pp. 2621-2629, 2012. [9] M. G. Adian and H. Aghaeinia, “Optimal Resource Allocation in Heterogeneous MIMO Cognitive Radio Networks,” Wireless Personal Communications, vol. 76, no. 1, pp. 23-39, 2014. [10] M. G. Adian and H. Aghaeinia, “Optimal Resource Allocation for Opportunistic Spectrum Access in MIMO-OFDM based Cooperative Cognitive Radio Networks,” IET Signal Processing, vol. 7, no. 7, pp. 549-557, 2013. [11] S.Wang, M. Ge, and C.Wang, “Efficient resource allocation for cognitive radio networks with cooperative relays,” IEEE J. Sel. Areas in Commun., vol. 31, no. 11, pp. 2432-2441, 2013. [12] M. G. Adian and H. Aghaeinia, “Optimal resource allocation for opportunistic spectrum access in MIMO-OFDM based cooperative cognitive radio networks,” IET Signal Processing, vol. 7, no. 7, pp. 549-557, 2013. SaeedNasehiMoghaddammehdighazanfaribabakteimourpour623201711010.7508/jist.2017.18.001http://jist.ir/en/Article/14968http://jist.ir/en/Article/Download/14968http://jist.ir/en/Article/Download/14968http://jist.ir/en/Article/Download/14968http://jist.ir/en/Article/Download/14968http://jist.ir/en/Article/Download/14968http://jist.ir/en/Article/Download/14968http://jist.ir/en/Article/Download/14968[1] F. Lorrain and H. C. White, "Structural equivalence of individuals in social networks," The Journal of mathematical sociology, vol. 1, pp. 49-80, 1971. [2] S. Wasserman and K. Faust, Social network analysis: Methods and applications vol. 8: Cambridge university press, 1994. [3] P. Doreian, V. Batagelj, and A. Ferligoj, Generalized blockmodeling vol. 25: Cambridge university press, 2005. [4] P. Doreian, V. Batagelj, and A. Ferligoj, "Generalized blockmodeling of two-mode network data," Social networks, vol. 26, pp. 29-53, 2004. [5] P. Doreian and A. Mrvar, "Partitioning signed social networks," Social Networks, vol. 31, pp. 1-11, 2009. [6] A. Žiberna, "Generalized blockmodeling of sparse networks," Metodoloski zvezki, vol. 10, p. 99, 2013. [7] A. Žiberna, "Blockmodeling of multilevel networks," Social Networks, vol. 39, pp. 46-61, 2014. [8] A. Žiberna, "Generalized blockmodeling of valued networks," Social networks, vol. 29, pp. 105-126, 2007. [9] S. Wasserman and C. Anderson, "Stochastic a posteriori blockmodels: Construction and assessment," Social Networks, vol. 9, pp. 1-36, 1987. [10] C. J. Anderson, S. Wasserman, and K. Faust, "Building stochastic blockmodels," Social networks, vol. 14, pp. 137-161, 1992. [11] T. A. Snijders and K. Nowicki, "Estimation and prediction for stochastic blockmodels for graphs with latent block structure," Journal of classification, vol. 14, pp. 75-100, 1997. [12] K. Nowicki and T. A. B. Snijders, "Estimation and prediction for stochastic blockstructures," Journal of the American Statistical Association, vol. 96, pp. 1077-1087, 2001. [13] C. Tallberg, "A Bayesian approach to modeling stochastic blockstructures with covariates," Journal of Mathematical Sociology, vol. 29, pp. 1-23, 2004. [14] P. D. Hoff, A. E. Raftery, and M. S. Handcock, "Latent space approaches to social network analysis," Journal of the american Statistical association, vol. 97, pp. 1090-1098, 2002. [15] P. D. Hoff and M. D. Ward, "Modeling dependencies in international relations networks," Political Analysis, vol. 12, pp. 160-175, 2004. [16] P. D. Hoff, "Bilinear mixed-effects models for dyadic data," Journal of the american Statistical association, vol. 100, pp. 286-295, 2005. [17] M. S. Handcock, A. E. Raftery, and J. M. Tantrum, "Model‐based clustering for social networks," Journal of the Royal Statistical Society: Series A (Statistics in Society), vol. 170, pp. 301-354, 2007. [18] C. Fraley and A. E. Raftery, "Model-based clustering, discriminant analysis, and density estimation," Journal of the American statistical Association, vol. 97, pp. 611-631, 2002. [19] P. N. Krivitsky and M. S. Handcock, "latentnet: Latent position and cluster models for statistical networks," Seattle, WA. Version, vol. 2, 2007. [20] E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing, "Mixed membership stochastic blockmodels," Journal of Machine Learning Research, vol. 9, pp. 1981-2014, 2008. [21] E. P. Xing, W. Fu, and L. Song, "A state-space mixed membership blockmodel for dynamic network tomography," The Annals of Applied Statistics, vol. 4, pp. 535-566, 2010. [22] Q. Ho, L. Song, and E. P. Xing, "Evolving cluster mixed-membership blockmodel for time-varying networks," 2011. [23] M. Mariadassou, S. Robin, and C. Vacher, "Uncovering latent structure in valued graphs: a variational approach," The Annals of Applied Statistics, pp. 715-742, 2010. [24] T. James, E. Brown, and C. T. Ragsdale, "Grouping genetic algorithm for the blockmodel problem," IEEE Transactions on Evolutionary Computation, vol. 14, pp. 103-111, 2010. [25] O. C. Herfindahl, "Concentration in the steel industry," Columbia University., 1950. [26] A. O. Hirschman, "The paternity of an index," The American Economic Review, vol. 54, pp. 761-762, 1964. [27] M. Brusco and D. Steinley, "A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices," Psychometrika, vol. 76, pp. 612-633, 2011. [28] M. Brusco, P. Doreian, P. Lloyd, and D. Steinley, "A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis," Network Science, vol. 1, pp. 191-212, 2013. [29] R. L. Breiger, S. A. Boorman, and P. Arabie, "An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling," Journal of mathematical psychology, vol. 12, pp. 328-383, 1975. [30] H. C. White, S. A. Boorman, and R. L. Breiger, "Social structure from multiple networks. I. Blockmodels of roles and positions," American journal of sociology, pp. 730-780, 1976. [31] W. de Nooy, A. Mrvar, and V. Batagelj, Exploratory Social Network Analysis with Pajek vol. 27: Cambridge University Press, 2005. [32] S. Sampson, "Crisis in a cloister, unpublished Ph. D," Dissertation, Dept. of Sociology, Cornell University, USA, 1969. [33] F. J. Roethlisberger and W. J. Dickson, "Management and theWorker," An Account of a Research Program conducted by theWestern Electric Co., Hawthorne Works, Chicago. HarvardUniversity Press, Cambridge, Mass, 1939.HassanFarsiRezaNasiripourSajadMohammadzadeh623201711010.7508/jist.2017.18.007http://jist.ir/en/Article/14978http://jist.ir/en/Article/Download/14978http://jist.ir/en/Article/Download/14978http://jist.ir/en/Article/Download/14978http://jist.ir/en/Article/Download/14978http://jist.ir/en/Article/Download/14978http://jist.ir/en/Article/Download/14978http://jist.ir/en/Article/Download/14978 P. Kontschieder, H. Riemenschneider, M. Donser, H. Bischof, “Discriminative learning of contour fragments for object detection”, In Proc. Brit. Mach. Vis. Conference. pp. 1-12, 2011. X. Meng, Z. Wang, L. Wu, “Building global image feature for scene recognition”, Pattern Recognition. pp. 373-380, 2012. B. Leibe, K. Schindler, N. Cornelis, L. Van Gool, “Coupled object detection and tracking from static cameras and moving vehicles", IEEE Transaction. Pattern. Anal Mach Intelligence, pp. 1683-1698, 2008. H. Riemenschneider, M. Donoser, H. Bischof, “Using partial edge contour matches for efficient object category localization”, in Proc. Europa Conference Computer, pp. 29-42, 2010. X. Yang, H. Liu, Latecki, “Contour-based object detection as dominant set computation”, Pattern Recognition, pp. 1927-1936, 2012.# V. Ferrari, T. Tuytelaars, and L. Van Gool, “Object detection by contour segment networks”, In (ECCV), 2006. V. Ferrari, F. Jurie, and C. Schmid, “Accurate object detections with deformable shape models learnt from images”, In (CVPR), 2007. V. Ferrari, L. Fevrier, F. Jurie, and C. Schmid, “Groups of adjacent contour segments for object detection”, (PAMI), 2008. X. Meng, Z.Wang, and L.Wu, “Building global image features for scene recognition”, Pattern Recognition, Vol.45, No.1, pp. 373–380, 2012. B. Leibe, K. Schindler, N. Cornelis, and L. Van Gool, “Coupled object detection and tracking from static cameras and moving vehicles”, IEEE Trans. Pattern Anal. Mach. Intell, Vol.30, No.10, pp. 1683–169, 2008. S. Agarwal, A. Awan, and D. Roth, “Learning to detect objects in images via a sparse, part-based representation” , IEEE PAMI, 2004. Pages. Available: http://www.flickr.com. Pages. Available http://wang.ist.psu.edu/docs/related. J. Tangelder, R. Veltkamp, “Polyhedral model retrieval using weighted point sets”, Int. J. Image Graph, 2003. R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin, “Shape distributions”, ACM Transaction, 2002.# # A.Makadia, K.Daniilidis, “Spherical correlation of visual representations for 3D model retrieval”, Int.J.Computer, Vol.89, No.2, 2010. L. Zhu, Y. Chen, A. Yuille, “Unsupervised learning of a probabilistic grammar-Markov models for object categories”, Pattern Analysis and Machine Intelligence, IEEE Transactions, pp. 114-128, 2009. D. G. Lowe, “Object recognition from local scale-invariant feature”, In Proceedings of the International Conference on Computer Vision, pp. 1150-, 1999. S. Malik, J. Puzicha, “Shape matching and object recognition using shape context”, IEEE Transaction. pp. 509-522, 2002. E. Shechtman, M. Irani, “Matching local self-similarities across images and videos”, IEEE Conference on Computer Vision and Pattern Recognition, 2007. H. Seo, P. Milanfar, “Training-free, generic object detection using locally adaptive regression kernels”, IEEE Transaction, pp. 1688-1704, 2010. O. Chum, J. Philbin, J. Sivic, M. Isard, A.A. Zisserman, “Total recall: automatic query expansion with a generative feature model for object retrieval”, IEEE 11th International Conference, 2007. R.Arandjelović, A.Zisserman, “Three things everyone should know to improve object retrieval”, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2012. D.Qin, S.Gammeter, L.Bossard, T.Quack, L.V.Gool, “accurate object retrieval with k-reciprocal nearest neighbors”, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2011. S. E. Grigoresco, N. Petkov, P. Kruizinga, “Comparision of texture features based on Gabor filters”, IEEE Transaction, pp. 1160-1167, 2002. C. Grigorescu, N. Petcov, M. A. Westenberg, “Contour detection based on nonclassical receptive field inhibition”, IEEE Transaction, pp. 729-739, 2003. Chun, Kim, Jang, “Content-based image retrieval using multi-resolution color and texture features”, IEEE Transaction, pp. 1073-1084, 2008. Veganzones M. A, Grana, M, “A spectral/spatial CBIR system for hyper spectral images”, IEEE J. Sel. Top. Earth Obs. Remote Sens, pp. 488-500, 2012. Montagna R, Finlayson, G.G, “Padua point interpolation and L^P-norm minimization in color-based image indexing and retrieval”, IET Image Process. pp. 139-147, 2012. R. Troncy, B. Huet, S. Schenk, “Multimedia semantics, desktop edition (XML): metadata, analysis and interaction”, John Wiley & Sons Inc., New York, (1st edition), pp. 36-54, 2011. A. Ibrahim, A. Zou'bi, R. Sahawneh, M. Makhadmeh, “Fixed representative colors feature extraction algorithm for moving picture experts group-7 dominant color descriptor”, Journal of Computer Science, pp. 773-777, 2009.# J. Philibin, O. Chum, M. Isard, J. Sivic, A. Zisserman, “Object retrieval with large vocabularies and fast spatial matching”, Computer Vision and Pattern Recognition (CVPR), pp. 1-8, 2007. B. Geng, L. Yang, C. Xu, “A study of language model for image retrieval”, IEEE Int. Conf. Data Mining Workshops, IEEE Computer Society, pp. 158-163, 2009. Linjun Yang, Bo Geng, Yang Cai, Alan Hanjalic, Xian-Sheng Hua, “Object retrieval using visual query context”, IEEE Transactions on multimedia, 2011.# # B. Herbert, E. Andreas, T. Tinne, V.G. Luc, “Speeded-up robust features (SURF)”, Computer vision and image understanding (CVIU), pp. 346-359, 2008. J. YU, Z. C, T. W AND X. ZHANG, “Feature integration analysis of bag-of-features model for image retrieval”, Nero computing, [On-line], 2013. J. Ng, F. Yang, and L. Davis. “Exploiting local features from deep networks for image retrieval”, In Computer Vision and Pattern Recognition Workshops (CVPRW), 2015. A. Babenko and V. Lempitsky, “Aggregating local deep features for image retrieval”, In International Conference on Computer Vision (ICCV), 2015. G. Tolias, R. Sicre, and H. J_egou, “Particular object retrieval with integral max-pooling of CNN activations”, arXiv preprint arXiv:1511.05879, 2015. Y. Kalantidis, C. Mellina, and S. Osindero, “Cross-dimensional weighting for aggregated deep convolutional features”, arXiv:1512.04065, 2015.Sooshiant ZakariapourHamidJazayeriMehdiEzoji623201711010.7508/jist.2017.18.003http://jist.ir/en/Article/14990http://jist.ir/en/Article/Download/14990http://jist.ir/en/Article/Download/14990http://jist.ir/en/Article/Download/14990http://jist.ir/en/Article/Download/14990http://jist.ir/en/Article/Download/14990http://jist.ir/en/Article/Download/14990http://jist.ir/en/Article/Download/14990[1] L. Roux, D. Racoceanu, N. Loménie, M. Kulikova, H. Irshad, J. Klossa, F. Capron, C. Genestie, G. Le Naour, and M. N. Gurcan, “Mitosis detection in breast cancer histological images an icpr 2012 contest,” Journal of pathology informatics, vol. 4, 2013. [2] J. A. A. Jothi and V. M. A. Rajam, “A survey on automated cancer diagnosis from histopathology images,” Artificial Intelligence Review, pp. 1–51, 2016. [3] A. Paul and D. P. Mukherjee, “Mitosis detection for invasive breast cancer grading in histopathological images,” Image Processing, IEEE Transactions on, vol. 24, no. 11, pp. 4041–4054, 2015. [4] Y. Freund and R. E. Schapire, “A desicion-theoretic generalization of on-line learning and an application to boosting,” in European conference on computational learning theory. Springer, 1995, pp. 23–37. [5] H. Wang, A. Cruz-Roa, A. Basavanhally, H. Gilmore, N. Shih, M. Feldman, J. Tomaszewski, F. Gonzalez, and A. Madabhushi, “Cascaded ensemble of convolutional neural networks and handcrafted features for mitosis detection,” in SPIE Medical Imaging. International Society for Optics and Photonics, 2014, pp. 90 410B–90 410B. [6] D. C. Cireşan, A. Giusti, L. M. Gambardella, and J. Schmidhuber, “Mitosis detection in breast cancer histology images with deep neural networks,” in Medical Image Computing and Computer-Assisted Intervention–MICCAI 2013. Springer, 2013, pp. 411–418. [7] C. D. Malon, E. Cosatto et al., “Classification of mitotic figures with convolutional neural networks and seeded blob features,” Journal of pathology informatics, vol. 4, no. 1, p. 9, 2013. [8] F. B. Tek et al., “Mitosis detection using generic features and an ensemble of cascade adaboosts,” Journal of pathology informatics, vol. 4, no. 1, p. 12, 2013. [9] J. A. A. Jothi and V. M. A. Rajam, “Segmentation of nuclei from breast histopathology images using pso-based otsus multilevel thresholding,” in Artificial Intelligence and Evolutionary Algorithms in Engineering Systems. Springer, 2015, pp. 835–843. [10] A. Paul, A. Dey, D. P. Mukherjee, J. Sivaswamy, and V. Tourani, “Regenerative random forest with automatic feature selection to detect mitosis in histopathological breast cancer images,” in Medical Image Computing and Computer-Assisted Intervention–MICCAI 2015. Springer, 2015, pp. 94–102. [11] H. Irshad et al., “Automated mitosis detection in histopathology using morphological and multi-channel statistics features,” Journal of pathology informatics, vol. 4, no. 1, p. 10, 2013. [12] A. Tashk, M. S. Helfroush, H. Danyali, and M. Akbarzadeh, “An automatic mitosis detection method for breast cancer histopathology slide images based on objective and pixel wise textural features classification,” in Information and Knowledge Technology (IKT), 2013 5th Conference on. IEEE, 2013, pp. 406–410. [13] J. Monaco, J. Hipp, D. Lucas, S. Smith, U. Balis, and A. Madabhushi, “Image segmentation with implicit color standardization using spatially constrained expectation maximization: Detection of nuclei,” in Medical Image Computing and Computer-Assisted Intervention–MICCAI 2012. Springer, 2012, pp. 365–372. [14] K. Nandy, P. R. Gudla, R. Amundsen, K. J. Meaburn, T. Misteli, and S. J. Lockett, “Automatic segmentation and supervised learning-based selection of nuclei in cancer tissue images,” Cytometry Part A, vol. 81, no. 9, pp. 743–754, 2012. [15] S. Waheed, R. A. Moffitt, Q. Chaudry, A. N. Young, and M. D. Wang, “Computer aided histopathological classification of cancer subtypes,” in 2007 IEEE 7th International Symposium on BioInformatics and BioEngineering. IEEE, 2007, pp. 503–508. [16] M. N. Gurcan, L. E. Boucheron, A. Can, A. Madabhushi, N. M. Rajpoot, and B. Yener, “Histopathological image analysis: A review,” IEEE reviews in biomedical engineering, vol. 2, pp. 147–171, 2009. [17] O. Sertel, U. V. Catalyurek, H. Shimada, and M. Guican, “Computer-aided prognosis of neuroblastoma: Detection of mitosis and karyorrhexis cells in digitized histological images,” in Engineering in Medicine and Biology Society, 2009. EMBC 2009. Annual International Conference of the IEEE. IEEE, 2009, pp. 1433–1436. [18] A. Brook, R. El-Yaniv, E. Isler, R. Kimmel, R. Meir, and D. Peleg, “Breast cancer diagnosis from biopsy images using generic features and svms,” IEEE Transactions on Information Technology in Biomedicine, 2006. [19] S. M. Pizer, E. P. Amburn, J. D. Austin, R. Cromartie, A. Geselowitz, T. Greer, B. ter Haar Romeny, J. B. Zimmerman, and K. Zuiderveld, “Adaptive histogram equalization and its variations,” Computer vision, graphics, and image processing, vol. 39, no. 3, pp. 355–368, 1987. [20] F. Chan, F. Lam, and H. Zhu, “Adaptive thresholding by variational method,” IEEE Transactions on Image Processing, vol. 7, no. 3, pp. 468–473, 1998. [21] T. Ojala, M. Pietikainen, and T. Maenpaa, “Multiresolution gray-scale and rotation invariant texture classification with local binary patterns,” IEEE Transactions on pattern analysis and machine intelligence, vol. 24, no. 7, pp. 971–987, 2002. [22] R. M. Haralick, K. Shanmugam et al., “Textural features for image classification,” IEEE Transactions on systems, man, and cybernetics, no. 6, pp. 610–621, 1973. [23] R. Rojas, “Adaboost and the super bowl of classifiers a tutorial introduction to adaptive boosting,” Freie University, Berlin, Tech. Rep, 2009. [24] F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R.Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, “Scikit-learn: Machine learning in Python,” Journal of Machine Learning Research, vol. 12, pp. 2825–2830, 2011. [25] J. Wickramaratna, S. Holden, and B. Buxton, “Performance degradation in boosting,” in International Workshop on Multiple Classifier Systems. Springer, 2001, pp. 11–21. [26] X. Li, L. Wang, and E. Sung, “Adaboost with svm-based component classifiers,” Engineering Applications of Artificial Intelligence, vol. 21, no. 5, pp. 785–795, 2008. [27] H. Irshad et al., “Automated mitosis detection in histopathology using morphological and multi-channel statistics features,” Journal of pathology informatics, vol. 4, no. 1, p. 10, 2013.mohammadshakeriseyyed majidmazinani623201711010.7508/jist.2017.18.004http://jist.ir/en/Article/14992http://jist.ir/en/Article/Download/14992http://jist.ir/en/Article/Download/14992http://jist.ir/en/Article/Download/14992http://jist.ir/en/Article/Download/14992http://jist.ir/en/Article/Download/14992http://jist.ir/en/Article/Download/14992http://jist.ir/en/Article/Download/14992[1] J. Löffler, J. Schon, V. Hernandez-Ernst, J. Pottebaum, and R. Koch, "Intelligent use of geospatial information for emergency operation management," in Proceedings of the fourth international conference on information systems for crisis management, ISCRAM, 2007. [2] A. Soheili, V. Kalogeraki, and D. Gunopulos, "Spatial queries in sensor networks," in Proceedings of the 13th annual ACM international workshop on Geographic information systems, 2005, pp. 61-70. [3] M. Careem, C. De Silva, R. De Silva, L. Raschid, and S. Weerawarana, "Demonstration of Sahana: free and open source disaster management," in Proceedings of the 8th annual international conference on Digital government research: bridging disciplines & domains, 2007, pp. 266-267. [4] P. K. Chitumalla, D. Harris, B. Thuraisingham, and L. Khan, "Emergency response applications: dynamic plume modeling and real-time routing," IEEE Internet Computing, vol. 12, pp. 38-44, 2008. [5] M. A. M. Vieira, C. N. Coelho, D. da Silva, and J. M. da Mata, "Survey on wireless sensor network devices," in Emerging Technologies and Factory Automation, 2003. Proceedings. ETFA'03. IEEE Conference, 2003, pp. 537-544. [6] J. Yick, B. Mukherjee, and D. Ghosal, "Wireless sensor network survey," Computer Networks, vol. 52, pp. 2292-2330, 2008. [7] J. Zheng and A. Jamalipour, Wireless sensor networks: a networking perspective: John Wiley & Sons, 2009. [8] S. R. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, "TinyDB: an acquisitional query processing system for sensor networks," ACM Transactions on database systems (TODS), vol. 30, pp. 122-173, 2005. [9] Z. Can and M. Demirbas, "A survey on in-network querying and tracking services for wireless sensor networks," Ad Hoc Networks, vol. 11, pp. 596-610, 2013. [10]J. Gehrke and S. Madden, "Query processing in sensor networks," IEEE Pervasive Computing, vol. 3, pp. 46-55, 2004. [11]A. Coman, M. A. Nascimento, and J. Sander, "A framework for spatio-temporal query processing over wireless sensor networks," in Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004, 2004, pp. 104-110. [12]Google map - a desktop web mapping service. Available: https://maps.google.com [13]W. R. Tobler, "AN EXPERIMENT IN THE COMPUTER GENERALIZATION OF MAPS," DTIC Document1964. [14]A. H. Robinson, J. Morrison, P. C. Muehrcke, A. Kimerling, and S. Guptill, "Elements of cartography, john wiley&sons," Inc., New York, USA, 1995. [15]P. S. Heckbert and M. Garland, "Survey of polygonal surface simplification algorithms," DTIC Document1997. [16]D. H. Douglas and T. K. Peucker, "Algorithms for the reduction of the number of points required to represent a digitized line or its caricature," Cartographica: The International Journal for Geographic Information and Geovisualization, vol. 10, pp. 112-122, 1973. [17]U. Ramer, "An iterative procedure for the polygonal approximation of plane curves," Computer graphics and image processing, vol. 1, pp. 244-256, 1972. [18]T. Gökgöz, A. Sen, A. Memduhoglu, and M. Hacar, "A New Algorithm for Cartographic Simplification of Streams and Lakes Using Deviation Angles and Error Bands," ISPRS International Journal of Geo-Information, vol. 4, pp. 2185-2204, 2015. [19]P. Chandrasekara, T. Mahaulpatha, D. Thathsara, I. Koswatta, and N. Fernando, "Landmarks based route planning and linear path generation for mobile navigation applications," Spatial Information Research, pp. 1-11, 2016. [20]M. Lucena, J. M. Fuertes, A. L. Martinez-Carrillo, A. Ruiz, and F. Carrascosa, "Efficient classification of Iberian ceramics using simplified curves," Journal of Cultural Heritage, vol. 19, pp. 538-543, 2016. [21]A. Jelinek, L. Zalud, and T. Jilek, "Fast total least squares vectorization," Journal of Real-Time Image Processing, pp. 1-17, 2016. [22]R. I. da Silva, D. F. Macedo, and J. M. S. Nogueira, "Duty cycle aware spatial query processing in wireless sensor networks," Computer Communications, vol. 36, pp. 149-161, 2013. [23]W. Li, Y. Li, P. Yu, J. Gong, and S. Shen, "The Trace Model: A model for simulation of the tracing process during evacuations in complex route environments," Simulation Modelling Practice and Theory, vol. 60, pp. 108-121, 2016. [24]R. I. da Silva, V. D. D. Almeida, A. M. Poersch, and J. M. S. Nogueira, "Spatial query processing in wireless sensor network for disaster management," in 2009 2nd IFIP Wireless Days (WD), 2009, pp. 1-5. [25]N. Fernández-García, L. D.-M. Martínez, A. Carmona-Poyato, F. Madrid-Cuevas, and R. Medina-Carnicer, "A new thresholding approach for automatic generation of polygonal approximations," Journal of Visual Communication and Image Representation, vol. 35, pp. 155-168, 2016. [26]R. I. Da Silva, D. F. Macedo, and J. M. S. Nogueira, "Spatial query processing in wireless sensor networks–A survey," Information Fusion, vol. 15, pp. 32-43, 2014. [27]"MATLAB - Simulink-Mathematical Software."hasanzafarimaryamhouraliHeshaamFaili623201711010.7508/jist.2017.18.002http://jist.ir/en/Article/15004http://jist.ir/en/Article/Download/15004http://jist.ir/en/Article/Download/15004http://jist.ir/en/Article/Download/15004http://jist.ir/en/Article/Download/15004http://jist.ir/en/Article/Download/15004http://jist.ir/en/Article/Download/15004http://jist.ir/en/Article/Download/15004[1] D. Bean and E. Riloff, “Unsupervised Learning of Contextual Role Knowledge for Coreference Resolution,” in HLT-NAACL, 2004, pp. 297–304. [2] H. Lee, M. Recasens, A. Chang, and M. Surdeanu, “Joint entity and event coreference resolution across documents,” in Association for Computational Linguistics, 2012. [3] N. Chambers and D. Jurafsky, “Unsupervised Learning of Narrative Schemas and their Participants,” Proc. Jt. Conf. 47th Annu. Meet. ACL-IJCNLP 4th Int. Jt. Conf. Nat. Lang. Process. AFNLP, vol. 2, no. August, p. 602, 2009. [4] N. Chambers and D. Jurafsky, “Unsupervised learning of narrative event chains,” Proc. Assoc. Comput. Linguist., vol. 31, no. 14, pp. 789–797, 2008. [5] M. Bansal and D. Klein, “Coreference Semantics from Web Features,” Proc. 50th Annu. Meet. Assoc. Comput. Linguist., no. July, pp. 389–398, 2012. [6] L. Zilles and D. S. Weld, “Joint Coreference Resolution and Named-Entity Linking with Multi-pass Sieves,” Emnlp, no. October, pp. 289–299, 2013. [7] A. Rahman and V. Ng, “Coreference Resolution with World Knowledge,” Acl, no. June, pp. 814–824, 2011. [8] L. Ratinov and D. Roth, “Learning-based multi-sieve co-reference resolution with knowledge,” Proc. 2012 Jt. Conf. Empir. Methods Nat. Lang. Process. Comput. Nat. Lang. Learn., no. 1, pp. 1234–1244, 2012. [9] E. Bengtson and D. Roth, “Understanding the value of features for coreference resolution,” Proc. Conf. Empir. Methods Nat. Lang. Process. - EMNLP ’08, vol. 51, no. October, p. 294, 2008. [10] D. Bean and E. Riloff, “Unsupervised Learning of Contextual Role Knowledge for Coreference Resolution,” Proc. Hum. Lang. Technol. Conf. North Am. Chapter Assoc. Comput. Linguist. (HLT-NAACL 2004), pp. 297–304, 2004. [11] S. Huang, Y. Zhang, J. Zhou, and J. Chen, “Coreference Resolution using Markov Logic Network,” Science (80-. )., pp. 157–168, 2009. [12] F. Chen, “Coreference Resolution with Markov Logic,” Assoc. Adv. Artif. Intell., 2009. [13] Y. Song, J. Jiang, W. X. Zhao, S. Li, H. Wang, and 王厚峰, “Joint learning for coreference resolution with Markov logic,” Proc. 2012 Jt. Conf. Empir. Methods Nat. Lang. Process. Comput. Nat. Lang. Learn., no. July, pp. 1245–1254, 2012. [14] T. Bögel and A. Frank, “A joint inference architecture for global coreference clustering with anaphoricity,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 8105 LNAI, pp. 35–46, 2013. [15] H. Poon and P. Domingos, “Joint Unsupervised Coreference Resolution with Markov logic,” Proc. Conf. Empir. Methods Nat. Lang. Process., no. October, p. 650, 2008. [16] H. Lee, Y. Peirsman, A. Chang, N. Chambers, M. Surdeanu, and D. Jurafsky, “Stanford ’ s Multi-Pass Sieve Coreference Resolution System at the CoNLL-2011 Shared Task,” Proc. Fifteenth Conf. Comput. Nat. Lang. Learn. Shar. Task. Assoc. Comput. Linguist., pp. 28–34, 2011. [17] M. Richardson and P. Domingos, “Markov logic networks,” Mach. Learn., vol. 62, no. 1–2 SPEC. ISS., pp. 107–136, 2006. [18] T. Chklovski and P. Pantel, “VerbOcean: Mining the Web for Fine-Grained Semantic Verb Relations.,” EMNLP, no. Lin 1997, 2004. [19] G. A. Miller, “WordNet: a lexical database for English,” Commun. ACM 38.11 39-41., 1995. [20] M. Baroni and A. Lenci, “Distributional Memory: A General Framework for Corpus-Based Semantics,” Comput. Linguist., vol. 36, no. 4, pp. 673–721, 2010. [21] B. Comrie, “The syntax of action nominals: A cross-language study,” Lingua, vol. 40, no. 2–3, pp. 177–201, 1976. [22] et al Pustejovsky, James, “The timebank corpus,” Corpus Linguist., pp. 647–656, 2003. [23] R. Collobert, J. Weston, L. Bottou, M. Karlen, K. Kavukcuoglu, and P. Kuksa, “Natural Language Processing (almost) from Scratch,” J. Mach. Learn. Res., vol. 12, pp. 2493–2537, 2011. [24] S. University, “Stanford CoreNLP.” . [25] M. Ciaramita and Y. Altun, “Broad-coverage sense disambiguation and information extraction with a supersense sequence tagger,” Proc. 2006 Conf. Empir. Methods Nat. Lang. Process. - EMNLP ’06, no. July, pp. 594–602, 2006. [26] M. Richardson and P. Domingos, “Markov logic networks,” Mach. Learn., vol. 62, no. 1–2, pp. 107–136, 2006. [27] F. Niu, C. Ré, A. Doan, and J. Shavlik, “Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS,” Proc. VLDB Endow., vol. 4, no. 6, pp. 373–384, 2011. [28] M. Vilain, J. Burger, J. Aberdeen, D. Connolly, and L. Hirschman, “A Model-Theoretic Coreference Scoring Scheme,” Messag. Underst. Conf., no. 1, pp. 45–52, 1995. [29] A. Bagga and B. Baldwin, “Algorithms for scoring coreference chains,” in The First International Con-ference on Language Resources and Evaluation Work-shop on Linguistics Coreference, 1998, pp. 563–566. [30] Marta Recasens and Eduard Hovy, “BLANC: Implementing the Rand index for coreference evaluation,” Nat. Lang. Eng., vol. 17(4), pp. 485–510, 2011. [31] W. M. Rand, “Objective criteria for the evaluation of clustering methods,” J. Am. Stat. Assoc., vol. 66(336), pp. 846–850, 1971.